检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

580 篇 会议
6 篇 期刊文献
4 册 图书

馆藏范围

590 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

191 篇 工学
- 188 篇 计算机科学与技术...
- 116 篇 电气工程
- 33 篇 软件工程
- 7 篇 控制科学与工程
- 4 篇 信息与通信工程
- 2 篇 电子科学与技术（可...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 安全科学与工程
69 篇 理学
- 68 篇 数学
- 3 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
20 篇 经济学
- 18 篇 理论经济学
- 2 篇 应用经济学
15 篇 管理学
- 11 篇 管理科学与工程(可...
- 10 篇 工商管理
- 4 篇 图书情报与档案管...
1 篇 法学
- 1 篇 社会学

主题

289 篇 scientific compu...
91 篇 computer science
62 篇 cloud computing
52 篇 computational mo...
37 篇 polynomials
34 篇 algorithm design...
29 篇 algebra
27 篇 computer archite...
25 篇 testing
24 篇 mathematics
22 篇 software algorit...
22 篇 complexity theor...
22 篇 standards
21 篇 electronic mail
20 篇 grid computing
20 篇 monitoring
19 篇 semantics
18 篇 application soft...
18 篇 distributed comp...
17 篇 concurrent compu...

机构

11 篇 research institu...
8 篇 tech univ cluj n...
7 篇 department of co...
7 篇 faculty of infor...
6 篇 faculty of mathe...
6 篇 department of co...
6 篇 faculty of compu...
5 篇 department of co...
5 篇 department of co...
5 篇 computer science...
4 篇 department of co...
4 篇 nicolaus coperni...
4 篇 research institu...
4 篇 institute e-aust...
4 篇 department of co...
4 篇 romanian acad in...
4 篇 computer science...
4 篇 faculty of autom...
3 篇 department of co...
3 篇 department of co...

作者

9 篇 gabriel ciobanu
8 篇 adina magda flor...
7 篇 petcu dana
7 篇 james h. davenpo...
7 篇 jebelean tudor
7 篇 eneia nicolae to...
7 篇 nebojsa bacanin
7 篇 tudor jebelean
6 篇 catalin stoean
6 篇 ciobanu gabriel
6 篇 nicolae tapus
6 篇 valentin cristea
5 篇 mugurel ionut an...
5 篇 davenport james ...
5 篇 dorel lucanu
5 篇 ardagna danilo
5 篇 ciprian dobre
5 篇 ruxandra stoean
5 篇 stephen m. watt
5 篇 florin pop

语言

589 篇 英文
1 篇 中文

检索条件"任意字段=9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing"

共 590 条记录，以下是421-430 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Distributed Scheduling Policy in Service Oriented Environments

Distributed Scheduling Policy in Service Oriented Environmen...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Marc Eduard Frincu Research Institute e-Austria Timisoara Romania

Service oriented architectures become more and more popular with the emergence and consolidation of new paradigms such as Clouds and Grids. In this context scheduling becomes an important and difficult problem as services hide their actual implementation, requirements or efficiency and are spread across multiple institutions and geographical locations. this paper proposes a distributed scheduling approach based on agents where each agent handles a certain domain and manages independently the policies inside it. In its frame several scheduling algorithms are also studied, compared and some results are given.

关键词： Processor scheduling Service oriented architecture Scheduling algorithm Clouds Delay scientific computing Computer architecture Context-aware services Distributed computing throughput

来源：评论

学校读者我要写书评

暂无评论

Approximating and Combining Equilibria in Non-cooperative Games

Approximating and Combining Equilibria in Non-cooperative Ga...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： D. Dumitrescu Rodica Ioana Lung Tudor Dan Mihoc Babeş-Bolyai University Cluj-Napoca Romania

Generative relations for different equilibria types in finite non cooperative games are proposed. these relations induce appropriate domination concepts. Using an evolutionary technique approximations for different equilibria are computed. the concept of game is extended in order to allow players to have different types of rationality. the new game allows us to combine different equilibria. numerical experiments indicate the potential of the proposed concepts and technique and offers an inside view of the implication of the rationality in the solution concept.

关键词： Game theory Nash equilibrium scientific computing Lungs

来源：评论

学校读者我要写书评

暂无评论

On a Functional-Differential Equation from Price theory

On a Functional-Differential Equation from Price Theory

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Anton S. Muresan Department of Statistics Forecasting and Mathematics Faculty of Economics and Business Administration Babeş-Bolyai University Cluj-Napoca Romania

In this paper we consider a functional-differential equation which appears in price theory and in the dynamics of economical systems. We give some new results about existence, uniqueness and data dependence of the solution of a problem which appears in conection with this functional-differential equation. these results are obtained by using Picard operator's technique and an abstract model for the steps method, due to the Professor Ioan A. Rus.

关键词： Fluctuations Biological system modeling Delay Economic forecasting Economic indicators Mathematics Differential equations scientific computing Statistics Red blood cells

来源：评论

学校读者我要写书评

暂无评论

A Grid Enabled Quantum Computer Simulator

A Grid Enabled Quantum Computer Simulator

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Simona Caraiman Alexandru Archip Vasile Manta Computer Science Department Gheorghe Asachi Technical University of Iasi Iasi Romania

Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Grid systems are a good choice for simulating quantum algorithms, since they provide access to high-performance computer clusters. In this paper we present the design of a message passing parallel version of the quantum computer simulator, QCL, deployed as a grid service. After describing the architecture of our grid service and the parallelization strategy for the general single qubit operator, we present the performance measurements for some test cases, showing the speedups obtained.

关键词： Quantum computing Grid computing Computational modeling Computer simulation Clustering algorithms Message passing Concurrent computing Quantum cascade lasers Computer architecture Measurement

来源：评论

学校读者我要写书评

暂无评论

Mamdani FLC with Various Implications

Mamdani FLC with Various Implications

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Ion Iancu Mihaela Colhon Department of Computer Science University of Craiova Craiova Romania

the task of the standard Mamdani fuzzy logic controller is to find a crisp control action from the fuzzy rule-base and from a set of crisp inputs. Because the interval inputs are frequently used in various domains (online shopping, for instance), in this paper we propose an extension of this type of controller which works with intervals as inputs and with various implication operators. For any implication we obtain a crisp value as output. Finally, these outputs are combined to obtain the overall crisp output action of the system.

关键词： Fuzzy logic Fuzzy sets Fuzzy control Fuzzy systems Control systems Computer science Knowledge based systems scientific computing Terminology Databases

来源：评论

学校读者我要写书评

暂无评论

A Depth-first Algorithm to Reduce Graphs in Linear Time

A Depth-first Algorithm to Reduce Graphs in Linear Time

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Miklos Bartha Miklos Kresz Department of Computer Science Memorial University of Newfoundland Saint John's NB Canada Faculty of Education University of Szeged Szeged Hungary

A redex in a graph G is a triple r = (u, c, v) of distinct vertices that determine a 2-star. Shrinking r means deleting the center c and merging u with v into one vertex. Reduction of G entails shrinking all of its redexes in a recursive way, and, at the same time, deleting all loops that are created during this process. It is shown that reduction can be implemented in O(m) time, where m is the number of edges in G.

关键词： Solitons Automata scientific computing Computer science Computer science education Merging Tree graphs Gain

来源：评论

学校读者我要写书评

暂无评论

Enhanced Rule-Based Phonetic Transcription for the Romanian Language

Enhanced Rule-Based Phonetic Transcription for the Romanian ...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Mihai Alexandru Ordean Andrei Saupe Mihaela Ordean Melania Duma Gheorghe Cosmin Silaghi IQuest Techonologies Cluj-Napoca Romania Babeş-Bolyai University Romania

this paper presents a rule-based approach for the phonetic transcription of the Romanian language. We integrate this phonetic analysis in the text processing component of a text-to-speech system for Romanian. Grapheme-to-phoneme rules are constructed based on expert information from DOOMII dictionary. In the cases when rules are useless, we employed decision trees constructed on engineered training sets to help the classifiers to learn the language exceptions.

关键词： Speech synthesis Text processing Engines Dictionaries Decision trees Databases Artificial intelligence scientific computing Classification tree analysis Information analysis

来源：评论

学校读者我要写书评

暂无评论

m-Hilbert Polynomial and Arbitrariness of the General Solution of Partial Differential Equations

m-Hilbert Polynomial and Arbitrariness of the General Soluti...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Qi Ding Hongqing Zhang School of Mathematical Science Dalian University of Technology Dalian China

Using the framework of formal theory of partial differential equations, we consider a method of computation of the m-Hilbert polynomial (i.e. Hilbert polynomial with multivariable), which generalizes the Seiler's theorem of Hilbert polynomial with single variable. Next we present an approach to compute the number of arbitrary functions of positive differential order in the general solution, and give a formally well-posed initial problem. Finally,as applications the Maxwell equations and weakly over determined equations are considered.

关键词： Polynomials Partial differential equations Differential equations Maxwell equations scientific computing Hilbert space Algebra Physics

来源：评论

学校读者我要写书评

暂无评论

On the Existence of Complete Disjoint NP-Pairs

On the Existence of Complete Disjoint NP-Pairs

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Olaf Beyersdorff Institut für Informatik Humboldt-Universität zu Berlin Berlin Germany

Disjoint NP-pairs are an interesting model of computation with important applications in cryptography and proof complexity. the question whether there exists a complete disjoint NP-pair was posed by Razborov in 1994 and is one of the most important problems in the field. In this paper we prove that there exists a many-one hard disjoint NP-pair which is computed with access to a very weak oracle (a tally NP-oracle).In addition, we exhibit candidates for complete NP-pairs and apply our results to a recent line of research on the construction of hard tautologies from pseudorandom generators.

关键词： Polynomials Sufficient conditions scientific computing Computational modeling Computer applications Security Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Sparse Matrix Computations Using the Quadtree Storage Format

Sparse Matrix Computations Using the Quadtree Storage Format

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Ivan Simecek Department of Computer Science and Engineering Czech Technical University Prague Czech Republic

Computations with sparse matrices are widespread in scientific projects. Used data format affects strongly the performance. Efficient formats for storing sparse matrices are still under development, since the computation using widely-used formats (like XY or CSR) is slow and specialized formats (like SPARSITY or CARB) have a large transformation *** this paper, we represent some improvements to the quadtree storage format. We also compare the performance during the execution of some basic routines from the linear algebra using widely-used formats and the quadtree storage format.

关键词： Sparse matrices Linear algebra Tree graphs Cache storage scientific computing Computer science Acceleration Registers Computer architecture Tree data structures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共59页 << < 39 40 41 42 43 44 45 46 47 48 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：