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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

565 篇 会议
7 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

176 篇 工学
- 173 篇 计算机科学与技术...
- 108 篇 电气工程
- 28 篇 软件工程
- 5 篇 控制科学与工程
- 4 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
59 篇 理学
- 59 篇 数学
- 2 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
19 篇 经济学
- 18 篇 理论经济学
- 1 篇 应用经济学
12 篇 管理学
- 8 篇 管理科学与工程(可...
- 7 篇 工商管理
- 4 篇 图书情报与档案管...
1 篇 法学
- 1 篇 社会学

主题

290 篇 scientific compu...
91 篇 computer science
64 篇 cloud computing
51 篇 computational mo...
36 篇 polynomials
34 篇 algorithm design...
28 篇 algebra
27 篇 computer archite...
25 篇 mathematics
25 篇 testing
22 篇 software algorit...
22 篇 complexity theor...
21 篇 electronic mail
20 篇 monitoring
20 篇 standards
19 篇 grid computing
19 篇 semantics
18 篇 application soft...
18 篇 distributed comp...
17 篇 concurrent compu...

机构

10 篇 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 篇 dorel lucanu
5 篇 ardagna danilo
5 篇 ciprian dobre
5 篇 ruxandra stoean
5 篇 stephen m. watt
5 篇 florin pop
5 篇 simson daniel

语言

574 篇 英文

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

共 574 条记录，以下是381-390 订阅

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

详细简洁

排序：

Dynamics of a Utility Based Distributed Video Proxy-Cache

Dynamics of a Utility Based Distributed Video Proxy-Cache

引用

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

作者： Claudiu Cobarzan Alin Mihaila Cristina Mihaila Computer Science Department Babeş-Bolyai University Cluj-Napoca Romania Computer Science applied to Economics Department Babeş-Bolyai University Cluj-Napoca Romania

We present a distributed video proxy-cache system that is able to adapt the number of running nodes depending on the client request patterns and available storage and computational resources. Cache related operations are performed with regard to the utility values of the stored objects. We propose the use of a new utility formula which considers a number of object characteristics. this formula is fine tuned by using a genetic algorithm for determining the best approach to weight those characteristics so that the yielded byte hit rate of the system is maximal. Also, a new approach that uses the standard deviation of the utility values for the cached objects, to increase or decrease the number of active nodes within the proposed system, is presented.

关键词： Computer science Streaming media Genetic algorithms Quality of service Bandwidth scientific computing Distributed computing Internet HTML IP networks

来源：评论

学校读者我要写书评

暂无评论

Optimal Scheduling of Two Communication Flows on Multiple Disjoint Packet-Type Aware Paths

Optimal Scheduling of Two Communication Flows on Multiple Di...

引用

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

作者： Mugurel Ionut Andreica Nicolae Tapus Computer Science and Engineering Department Politehnica University of Bucharest Bucharest Romania

Communication flows in distributed systems often present a poor performance, because they are unaware of each other and end up competing for the same bottleneck resources. A solution to this problem consists of scheduling the communication flows in order to optimize some performance metric. In this paper we study the scheduling of two communication flows over multiple disjoint paths, such that the maximum completion time (makespan) is minimized. Each flow is composed of a large number of identical packets of the same type. the paths are aware of the packet types and have different transmission times for each type. We consider the objectives of minimizing the makespan and the weighted sum of completion times. We also consider some error-correcting issues, as well as the possibility of dropping the packet ordering constraints.

关键词： Optimal scheduling Scheduling algorithm Processor scheduling Measurement scientific computing Computer science Dynamic programming Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

computing Origami Universal Molecules with Cyclic Tournament Forests

Computing Origami Universal Molecules with Cyclic Tournament...

引用

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

作者： John C. Bowers Ileana Streinu School of Computer Science University of Massachusetts Amherst Massachusetts Department of Computer Science Smith College Northampton Massachusetts

Lang's "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a convex polygonal region (the "paper") having a certain metric relationship with the tree. It computes a crease- pattern which allows for the paper to "fold" to a uniaxial base, which is a 3-dimensional shape projecting onto the given tree. Lang's universal molecule algorithm runs in cubic time and quadratic space. We investigate two implementations which improve the running time to sub-cubic time. the first uses a cyclic tournament forest, a new data structure which extends kinetic tournament trees to allow for cycle splitting operations, and the second uses a priority queue to store events.

关键词： Vegetation Measurement Data structures TV Skeleton Algorithm design and analysis Kinetic theory

来源：评论

学校读者我要写书评

暂无评论

Towards a Clausal Analysis of Proof Schemata

Towards a Clausal Analysis of Proof Schemata

引用

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

作者： David M. Cerna Michael Lettmann Research Institute for Symbolic Computation Johannes Kepler Universitat Linz Linz Austria Institute of Information Systems Technische Universität Wien Vienna Austria

Proof schemata are a variant of LK-proofs able to simulate various induction schemes in first-order logic by adding so called links to the standard first-order LK-calculus. Links allow proofs to reference other proofs, and thus give schemata a recursive structure. Gentzen style cut-elimination methods, which reduce cuts locally, does not work in the presence of links. However, an alternative method, such as cut-elimination by resolution (CERES), which eliminate cuts globally, is able to reduce cuts over the entire recursive structure simultaneously. Unfortunately, analysis of the cut structure of a proof after partial cut-elimination is non-trivial. By extending local methods to proof schemata, we provide such an analysis.

关键词： Calculus Standards Redundancy Complexity theory scientific computing Information systems Tools

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Service Lifecycle in the Cloud Environment

Service Lifecycle in the Cloud Environment

引用

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

作者： Victor Ion Munteanu Teodor-Florin Fortis Viorel Negru Faculty of Mathematics and Informatics Department of Computer Science West University of Timişoara Timisoara Romania

Cloud governance's approach to development in the cloud environment allows for a way in which services are well defined and unambiguous, where they can be easily designed, implemented, deployed and executed, for a way in which they can be consumed. this approach is beneficial to SMEs which can now empower themselves by adopting cloud-based technologies and platforms. they now have the opportunity to develop niche solutions, or to group themselves in specialized clusters, in order to build complex, targeted solutions, tailored on customers' needs. the focus of this paper is detailing the service lifecycle from the point of view of our proposed cloud governance architecture that is based on a cloud management solution, the Cloud Agency, a multi-agent system that is part of the mOSAIC project.

关键词： Clouds Cloud computing Security Contracts Biological system modeling Quality of service

来源：评论

学校读者我要写书评

暂无评论

Partial Finitely Generated Bi-Ideals

Partial Finitely Generated Bi-Ideals

引用

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

作者： Raivis Bets Janis Buls Department of Mathematics University of Latvia Riga Latvia

ISBN: (纸本)9781509057085

Partial words have been studied by Blanchet-Sadri et al., but bi-ideals or reccurrent words have been studied for centuries by many researchers. this paper gives a solution for some problems for partial reccurrent words. this paper gives an algorithm for a given finitely generated bi-ideal, how to construct a new basis of ultimately finitely generated bi-ideal, which generates the same given bi-ideal. the paper states that it is always possible to find a basis for a given finitely generated bi-ideal. the main results of this paper are presented in third section. At first, we show that if two irreduciable bi-ideals are different, they will differ in infinitely many places. this led to the statement that it is possible to fill the finite number of holes for a given finitely generated bi-ideal, but a counterexample shows that it is not possible for infinitely many holes.

关键词： Indexes Mathematics Electronic mail DNA scientific computing Computer science DNA computing

来源：评论

学校读者我要写书评

暂无评论

Clustering Heterogeneous Web Data using Clustering by Compression. Cluster Validity

Clustering Heterogeneous Web Data using Clustering by Compre...

引用

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

作者： Alexandra Cernian Dorin Carstoiu Adriana Olteanu Faculty of Automatic Control and Computer Science Politehnica University of Bucharest Bucharest Romania

the expansive nature of the Internet produced a vast quantity of unstructured data, compared to our conception of a conventional data base. the application of clustering on the World Wide Web is essential to get structured information from this sea of information. In this paper, we intend to test the results of a new clustering technique - clustering by compression - when applied to heterogeneous sets of data. the clustering by compression procedure is based on a parameter-free, universal, similarity distance, the normalized compression distance or NCD, computed from the lengths of compressed data files (singly and in pair-wise concatenation). In order to validate the results, we calculate some quality indices. If the values we obtain prove a high quality of the clustering, in the near future we plan to include the clustering by compression technique into a framework for clustering heterogeneous Web objects.

关键词： Clustering algorithms Internet Web sites Testing Clustering methods Collaboration Information filtering Information filters scientific computing Automatic control

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi

On Some Problems of Efficient Inference Search in First-Orde...

引用

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

作者： Alexander Lyaletski Faculty of Cybernetics Taras Shevchenko National University of Kiev Kyiv Ukraine

A unified approach is developed for constructing first-order cut-free sequent calculi without equality representing two classes of modal logics in dependence of whether classical logic or intuitionistic one is taken as a basis. It uses the original notions of admissibility and compatibility, which, in general, permits to avoid skolemization being a forbidden operation for the logics under ***, it requires the modal sequent calculi to satisfy a so-called principle-subformula condition. Following the approach, cut-free sequent modal calculi avoiding the dependence of inference search on different orders of quantifier rules applications are described. Results relating to the co-extensivity of various modal sequent calculi are given. the research gives a possibility to construct sound and complete methods for enough high efficient inference search in certain first-order modal logics if efficient technique for the handling of their propositional parts is available.

关键词： Logic Search methods Inference algorithms scientific computing Cybernetics Application software Calculus

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：