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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是441-450 订阅

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

详细简洁

排序：

Fairness and QoS Enhancement Models and Techniques for Peer-to-Peer Content Sharing Systems

Fairness and QoS Enhancement Models and Techniques for Peer-...

引用

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

作者： Mugurel Ionut Andreica Irina Borozan Lucian-Ionut Balaceanu Nicolae Tapus Computer Science and Engineering Department Politehnica University of Bucharest Bucharest Romania Comput. Sci. & Eng. Dept. Politeh. Univ. of Bucharest Bucharest Romania

Peer-to-peer content sharing systems are becoming increasingly popular in many types of environments, ranging from well-known file sharing communities to scientific and professional resource sharing communities. Two important objectives in such systems are achieving system-level fairness (i.e. participants should not only maximize their benefits, but also contribute to the well-being of the community) and an improved perceived Quality of Service (QoS) at the level of the individual participants. In this paper we propose several techniques for addressing these objectives from two perspectives: the application layer and the communication architecture layer.

关键词： Peer to peer computing Quality of service Resource management scientific computing Computer science Open systems Communities Testing

来源：评论

学校读者我要写书评

暂无评论

Classes of Szilard Languages in NC^1

Classes of Szilard Languages in NC^1

引用

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

作者： Liliana Cojocaru Erkki Makinen Ferucio Laurentiu Tiplea Department of Computer Sciences University of Tampere Tampere Finland Department of Computer Science Alexandru loan Cuza University of Iaşi Iaşi Romania

We prove that Szilard languages of context-free grammars can be accepted by an indexing alternating Turing machine (indexing ATM) in logarithmic time and space. the same result holds for leftmost Szilard languages of unrestricted (phrase-structure or type 0) grammars. Since the class of languages recognizable by an indexing ATM in logarithmic time equals the U E -uniform NC 1 class, we obtain that the above classes of Szilard languages are in NC 1 . the inclusions are strict, since there exist languages in NC 1 that cannot be Szilard languages of any context-free or unrestricted grammar.

关键词： Indexing Character generation Turing machines Production Digital signal processing scientific computing Computer science Upper bound Boolean functions Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Beliefs and Communication, the Basis of Collaborative Agents

Beliefs and Communication, The Basis of Collaborative Agents

引用

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

作者： Ion Mircea Diaconescu Gerd Wagner Department of Internet Technology Institute of Informatics Brandenburg University of Technology Cottbus Germany

Nowadays, simulation scenarios require enhanced agents being capable of communication, learning and having beliefs about their self or about their world. the distinction between facts and (possible false) beliefs is part of the requirements in order to describe scenarios closer to real world. this work proposes a solution which allows information exchange between agents, making use of generic/standard and ad-hoc message types, involving their self beliefs and their beliefs about the world where they act. Standard agent types being capable of automatic management of standard message types are defined. SPARQL, a standard RDF based query language, is used as part of the communication protocol. the paper is build around a social simulation scenario that provides the possibility of testing and describing the benefices of this work.

关键词： Collaboration Vocabulary Intelligent agent Ontologies Speech Communication standards Resource description framework Testing Computer languages scientific computing

来源：评论

学校读者我要写书评

暂无评论

Semantic Web Service Composition Method Based on Fluent Calculus

Semantic Web Service Composition Method Based on Fluent Calc...

引用

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

作者： Viorica R. Chifu Ioan Salomie Ioana Harsa Marius Gherga Department of Computer Science Technical University of Cluj Napoca Cluj-Napoca Romania

this paper presents a new approach for automatic Web service composition based on the formalism of Fluent Calculus using semantic Web service descriptions. In our approach, the Web service composition process is viewed as an AI planning problem in the Fluent Calculus formalism. To semantically describe Web services, we have used a Web service domain ontology which is then translated into a Fluent Calculus knowledge base, necessary for the composition planning phase. For verifying the composed services, the Label Transition System Analyzer (LTSA) formalism is used. the paper also presents an experimental prototype for the Fluent Calculus based Web service composition and demonstrates its effectiveness with the help of an application scenario from the social event planning domain.

关键词： Semantic Web Calculus Web services Ontologies Logic programming scientific computing Computer science Dynamic programming Artificial intelligence Process planning

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance Using a Front-End Service for Large Scale Distributed Systems

Fault Tolerance Using a Front-End Service for Large Scale Di...

引用

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

作者： Marieta Nastase Ciprian Dobre Florin Pop Valentin Cristea Faculty of Automatics and Computer Science University Politehnica of Bucharest Romania

In this paper we present a solution to ensuring a high degree of availability and reliability in service-based large scale distributed systems. the proposed architecture is based on a set of replicated services running in a fault-tolerant container and a proxy service able to mask possible faults, completely transparent for a client. the solution not only masks possible faults but also optimizes the access to the distributed services and their replicas using a load-balancing strategy, whilst ensuring a high degree of scalability. the advantages of the proposed architecture were evaluated using a pilot implementation. the obtained results prove that the solution ensures a high degree of availability and reliability for a wide range of service-based distributed systems.

关键词： Fault tolerant systems Large-scale systems Availability Fault tolerance Containers Scalability scientific computing Computer science Computer architecture Instruments

来源：评论

学校读者我要写书评

暂无评论

Satisfiability and theories

Satisfiability and Theories

引用

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

作者： Andrei Voronkov University of Manchester Institute of Science and Technology UK

Summary form only given. We give a simple introduction to satisfiability modulo theories intended for non-specialists. No previous background is assumed. the tutorial covers the following topics. 1) Propositional satisfiability. 2) DPLL as the main method for satisfiability checking. 3) Implementations of DPLL. 4) theories. 5) Decision procedures for theories. Congruence closure, the theory of arrays and linear arithmetic. 6) SMT: satisfiability modulo theories. How to convert a decision procedure for a set of literals to a DPLL modulo theory algorithm. 7) Satisfiability in a combination of theories. Instead of proving theorems, we will try to explain the main ideas using examples. the tutorial serves as a background for the second tutorial by Nikolaj Bjorner "SMT solvers for Testing, Program Analysis and Verification at Microsoft".

关键词： Surface-mount technology scientific computing Arithmetic Testing Logic

来源：评论

学校读者我要写书评

暂无评论

Bounded Parallelism in PowerList and ParList theories

Bounded Parallelism in PowerList and ParList Theories

引用

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

作者： Virginia Niculescu Adriana Guran Faculty of Mathematics and Computer Science Babeş-Bolyai University Cluj-Napoca Romania

A very efficient model for recursive, data-parallel programs can be one based on PowerList, PowerArray, and ParList theories. It assures simple and correct design of this kind of programs, allowing work at a high level of abstraction. this high level of abstraction could be reconciled with performance by introducing data-distributions into these theories.%An important advantage of formally introducing distributions is that this allows us to evaluate costs, depending on the number of available processors, which is considered as a parameter. In this paper, we generalize the data distributions defined on PowerLists by introducing data distributions for parallel programs defined using ParList structures. Using these distributions we also define a possibility to transform ParList parallel programs into PowerList parallel programs, which are more efficient. this is an important advantage since PowerList programs could be efficiently mapped on real architecture (e.g. hypercubes).

关键词： Data structures Parallel processing Concurrent computing Costs Computer architecture Hypercubes Computational modeling Distributed computing Shape scientific computing

来源：评论

学校读者我要写书评

暂无评论

Matching Semantic Web Services Using Learning Accuracy

Matching Semantic Web Services Using Learning Accuracy

引用

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

作者： Viorica R. Chifu Ioan Salomie Emil St. Chifu Roland Vachter Alpár Kövér Department of Computer Science Technical Univ. of Cluj-Napoca Cluj-Napoca Romania

the automatic discovery of suitable Web services for a given task is one of the key elements in implementing the Semantic Web vision. this paper presents a new matching algorithm for Semantic Web service discovery. Our matching algorithm allows for ranking the discovered Web services according to their relevance to the service request. the learning accuracy is proposed as a suitable metric for determining the semantic similarity between a service request and the service advertisements. the semantic similarity is computed by considering the semantic information encoded in a domain ontology, including both the concept hierarchy and the properties of the concepts. Evaluating the semantic similarity between a service request and a service advertisement is based on the concepts, their semantic relations, their common and distinguishing properties, and the semantic relations between their properties.

关键词： Semantic Web Web services Ontologies Inference algorithms Impedance matching Protocols scientific computing Computer science Logic Encoding

来源：评论

学校读者我要写书评

暂无评论

Dynamic Resources Allocation in Grid Enviroments

Dynamic Resources Allocation in Grid Enviroments

引用

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

作者： Marius Ion Florin Pop Ciprian Dobre Valentin Cristea Faculty of Automatics and Computer Science University Politehnica of Bucharest Romania

this paper presents DyAG, an innovative solution for dynamic allocation of resources for services workflows in Grid enviroments. the proposed solution is responsible with the efficient mapping of the services which make up a Business Process Execution Language workflow onto resources, represented by Web Services, from the Grid enviroment. the presented solution is part of a framework that aims to allow the deployment of large scale workflow enabled scientific applications from a wide range of research fields onto the Grid. A series of allocation policies is considered, but the DyAG also allows the users to dynamically change the policy employed by the scheduler at runtime, through a class loading mechanism. this allows the employment of application profiling techniques in order to finely tune the scheduler in accordance with the characteristics of the environment it is running in, either by changing the various parameters of the policies proposed, or by loading completely new policies.

关键词： Resource management Grid computing Computer networks Service oriented architecture Protocols Web services Dynamic scheduling Runtime Employment Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Formal Proof of theorems on Genetic Regulatory Networks

Formal Proof of Theorems on Genetic Regulatory Networks

引用

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

作者： Maxime Dénès Binjamin Lesage Yves Bertot Adrien Richard Université de Rennes Rennes France I.N.R.I.A. Sophia Antipolis Sophia-Antipolis France Laboratoire I3S UMR 6070 CNRS Sophia-Antipolis France

We describe the formal verification of two theorems of theoretical biology. these theorems concern genetic regulatory networks: they give, in a discrete modeling framework, relations between the topology and the dynamics of these biological networks. In the considered discrete modeling framework, the dynamics is described by a transition graph, where vertices are vectors indicating the expression level of each gene, and where edges represent the evolution of these expression levels. the topology is also described by a graph, called interaction graph, where vertices are genes and where edges correspond to influences between genes. the two results we formalize show that circuits of some kind must be present in the interaction graph if some behaviors are possible in the transition graph. this work was performed with the ssreflect extension of the Coq system.

关键词： Genetics Biological system modeling Evolution (biology) Circuits Biological information theory Proteins Network topology Production scientific computing Formal verification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共59页 << < 41 42 43 44 45 46 47 48 49 50 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：