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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Selective Breeding Analysed as a Communication Channel: Channel Capacity as a Fundamental Limit on Adaptive Complexity

Selective Breeding Analysed as a Communication Channel: Chan...

引用

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

作者： Chris Watkins Department of Computer Science University of London Royal Holloway Surrey UK

Abstract-Selective breeding is considered as a communication channel, in a novel way. the Shannon informational capacity of this channel is an upper limit on the amount of information that can be put into the genome by selection: this is a meaningful upper limit to the adaptive complexity of evolved organisms. We calculate the maximum adaptive complexity achievable for a given mutation rate for simple models of sexual and asexual reproduction. A new and surprising result is that, with sexual reproduction, the greatest adaptive complexity can be achieved with very long genomes, so long that genetic drift ensures that individual genetic elements are only weakly determined. Put another way, with sexual reproduction, the greatest adaptive complexity can in principle be obtained with genetic architectures that are, in a sense, error correcting codes. For asexual reproduction, for a given mutation rate, the achievable adaptive complexity is much less than for sexual reproduction, and depends only weakly on genome length. A possible implication of this result for genetic algorithms is that the greatest adaptive complexity is in principle achievable when genomes are so long that mutation prevents the population coming close to convergence.

关键词： Communication channels Channel capacity Genomics Bioinformatics Genetic mutations Organisms Genetic algorithms scientific computing Algorithm design and analysis Computer science

来源：评论

学校读者我要写书评

暂无评论

Checking Correctness and Compliance of Integrated Process Models

Checking Correctness and Compliance of Integrated Process Mo...

引用

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

作者： Rene Worzberger thomas Kurpick thomas Heer Department of Computer Science & Software Engineering RWTH Aachen University Aachen Germany

Models of different kinds are used in the area of business process management. Abstract process knowledge as well as executable process definitions can be visualized and edited in a graphical manner. the same holds true for models of process instances in some process-aware information systems (PAIS), which allow for dynamic modifications in a process instance during process runtime. An appropriate modeling tool must not only provide means to graphically edit different kinds of models on different abstraction layers but also detect or prevent violations of certain model constraints. these constraints comprise a model's internal correctness as well as a model's compliance with general process knowledge expressed in another more abstract model. In this paper we contribute an approach that allows for uniformly specifying correctness as well as compliance checks for diverse graphical process models. this is achieved by means of an integrated meta-model for models of different kinds. the integrated meta-model is referenced by a fixed set of Object Constraint Language (OCL) expressions, which specify correctness and compliance checks. We exemplify some OCL expressions and their application within a prototypical modeling tool.

关键词： Management information systems Prototypes Law Legal factors Software algorithms scientific computing Computer science Software engineering Engineering management Visualization

来源：评论

学校读者我要写书评

暂无评论

Primal Congestion Control algorithms for Multimedia Streams

Primal Congestion Control Algorithms for Multimedia Streams

引用

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

作者： Adrian Sterca Department of Computer Science Babes Bolyai University Cluj-Napoca Romania

We investigate in this paper congestion control algorithms that are TCP-friendly and media-friendly at the same time, so they are more suitable for multimedia streaming than TCP's AIMD. We use in this investigation the optimization framework developed by Kelly et al. in. Kelly et al. derived two gradient-like algorithms, a primal algorithm and a dual one, to control the congestion in a computer network in an end-to-end way and to obtain optimal bandwidth allocation among competing sources. Starting with Kelly et. al's paper, several other papers proposed different variants of the original primal and dual algorithms, but none of these considers the specific characteristics of multimedia streams. the aim of this paper is to build window-based, primal congestion control algorithms for optimizing the perceived quality of multimedia streams in best-effort networks. We build these media-friendly primal congestion control algorithms using the following recipe: 1) first we construct a window-based congestion control algorithm that is TCP-friendly, but has a much more stable throughput and then 2) we shape this stable throughput according to media characteristics (e.g. bitrate). We present two such primal congestion control algorithms and prove their stability around the equilibrium.

关键词： Streaming media Multimedia systems Bit rate Internet Bandwidth Shape control Multimedia computing throughput Codecs Network servers

来源：评论

学校读者我要写书评

暂无评论

Random Numbers for Quantum Key Distribution

Random Numbers for Quantum Key Distribution

引用

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

作者： Hugo Zbinden Group of Applied Physics University of Geneva Geneva Switzerland

Quantum key distribution (QKD) has seen an important development for the last ten years. Nowadays, different companies offer commercial solutions and key exchanges at pulse rates of up to 1 GHz and over distances of up to 200 km have been demonstrated in research labs. However, the generation of random bit strings has often been neglected and it remains a technical problem, as physical random number generators have still insufficient bit rates for high speed QKD. In this talk, after an introduction in QKD, a state of the art prototype developed at the University of Geneva was presented. this prototype allows generating keys at high rates over up to 200 km of optical fiber. However, due to the lack of high rate physical random generators, random bits at a rate of 350 MHz are produced by a pseudo random number generator seeded by random bits originating from a quantum random number generator (4 MHz, id Quantique). It was show how an eavesdropper could attack a QKD system based on pseudo random numbers. Finally, different possibilities to increase the rates of quantum random number generators was discussed.

关键词： Random number generation Prototypes scientific computing Quantum computing Physics Bit rate Optical fibers

来源：评论

学校读者我要写书评

暂无评论

Multi-Population Agent Search: Stigmergy and Heterogeneity

Multi-Population Agent Search: Stigmergy and Heterogeneity

引用

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

作者： Camelia Chira Camelia-M. Pintea D. Dumitrescu Department of Computer Science Babes Bolyai University Cluj-Napoca Romania

Ant systems normally rely on identical agents that cooperate indirectly using pheromone trails to find a problem solution. this uniformity may be inadequate in solving difficult problems where complex behavior patterns are needed. A new ant-based model is developed with the aim of promoting non-uniformity in the agent population by enhancing each agent with properties that induce heterogeneity. Agents are endowed with different pheromone sensitivity levels. Highly-sensitive agents are essentially influenced in the decision making process by stigmergic information and thus likely to select strong pheromone-marked moves. Agents with low sensitivity are biased towards random search inducing diversity for exploration. Sensitive agents allow many types of reactions to a changing environment facilitating an efficient balance between exploration and exploitation. this balance is pursued by organizing the agents in several subpopulations based on a sensitivity level interval. therefore, each subpopulation has a specific behavior given by the sensitivity level spanning from the diversification to the intensification of the search. the proposed model is engaged in a set of numerical experiments and comparisons for solving various combinatorial optimization problems with very promising results.

关键词： Ant colony optimization Decision making Design optimization scientific computing Computer science Organizing Storage automation Scheduling Mathematical programming Algebra

来源：评论

学校读者我要写书评

暂无评论

Building a Textual Entailment System for the RTE3 Competition. Application to a QA System

Building a Textual Entailment System for the RTE3 Competitio...

引用

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

作者： Adrian Iftene Faculty of Computer Science Alexandru Ioan Cuza슠University Iasi Romania

Textual entailment recognition (RTE) is the task of deciding, when given two text fragments, whether the meaning of one text is entailed (can be inferred) from the other text. Last year, we built our first Textual Entailment (TE) system, with which we participated in the RTE3 competition. the main idea of this system is to transform the hypothesis making use of extensive semantic knowledge from sources like DIRT, WordNet, Wikipedia and acronyms database. Additionally, the system applies complex grammar rules for rephrasing in English and uses the results of a module we built to acquire the extra background knowledge needed. In the first part, we presented the system architecture and the results, whose best run ranked 3 rd in RTE3 among 45 participating runs of 26 *** second part of the paper presents the manner in which we adapted the TE system in order to include it in a Question Answering (QA) system. the aim of using the TE system as a module in the general architecture of a QA system is to improve the ranking between possible answers for questions in which the answer type is Measure, Person, Location, Date and Organization.

关键词： Tellurium Humans scientific computing Application software Computer science Text recognition Wikipedia Databases System performance Sections

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Application of Evolution Rules Based on Linear Diofantic Equations

Algorithm for Application of Evolution Rules Based on Linear...

引用

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

作者： Alberto Arteta Luis Fernandez Javier Gil Natural Computing group Universidad Politecnica de Madrid Madrid Spain

Transition P system are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of objects and evolution rules. Transition P systems evolve through transitions between two consecutive configurations. Moreover, transitions between two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of evolution rules inside each membrane of the P system. Hence, rules application is critical for the whole evolution process efficiency, because it is performed in parallel inside each membrane in each one of the evolution steps. It is known that P systems have a high degree of nondeterminism and parallelism. A transition in such a system consists in applying in parallel a set of atomic actions (e.g., evolution rules) and this set of atomic actions is randomly chosen from a domain of possible next transitions. this paper tries to characterize this domain as the hyperspace defined by a set of diophantine equations and then to develop an algorithm which randomly chooses solutions from this hyperspace. those solutions are uniquely related to the number of times that certain evolution rules are applied. the work presented here includes an algorithm based on resolving linear systems equations and explain into detail the process that the algorithm must follow.

关键词： Equations Evolution (biology) Biomembranes Biology computing Biological system modeling Computational modeling Parallel processing Application software Concurrent computing Linear systems

来源：评论

学校读者我要写书评

暂无评论

Multi-Domain Logic and its Applications to SAT

Multi-Domain Logic and its Applications to SAT

引用

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

作者： Tudor Jebelean Gabor Kusper RISC Linz Austria Eszterházy Károly College Hungary

We describe a new formalism and special proof methods for a novel generalization of propositional logic, which is especially suitable for solving the satisfiability problem (SAT). A multi-domain logic (MDL) formula is quantifier-free and contains only atoms of the form x isin A, where x is a variable and A is a constant set. For formulae in conjunctive normal form, we are interested in finding solutions (assignments to variables which satisfy all clauses). Classical propositional logic corresponds to the special case when each set is either {T} or {F}. the union of all the sets occurring for a certain variable can be seen as rdquothe domainrdquo of that variable, thus MDL is also a generalization of multi-valued logic, but with different domains for variables. the most distinctive feature is, however, the indication of the sub-domain in each clause. the notions of resolution, subsumption, as well as the basic steps of the DPLL method generalize in an elegant and straightforward way. As a novel MDL specific technique, variable clustering consists in creating a new variable ranging over the cartesian product of the domains of several rdquoclusteredrdquo variables. this allows the transformation of classical SAT problems in MDL problems with less literals, and in which the propagation of information can be performed more efficiently than classical unit propagation. the basic idea of MDL originates from the earlier work of the second author on rdquohyper-unitrdquo propagation (that is simultaneous propagation of several unit clauses) and on the representation and propagation of rdquok-literalsrdquo (generalized literals containing information on several propositional variables). Preliminary experiments with a prototype Java implementation exhibit speed-ups of up to 30 times.

关键词： scientific computing Reduced instruction set computing Educational institutions Multivalued logic Prototypes Java Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Quantum Genetic Algorithm and its Application to Multi-user Detection

Quantum Genetic Algorithm and its Application to Multi-user ...

引用

9th international Conference on Signal Processing(第九届国际信号处理学术会议)(ICSP'08)

作者： Fei Li Baoyu Zheng Liang Hong Institute of Signal & Information Processing Nanjing University of Posts and TelecommunicationsNanj Maanshan Mobile Communication Company Maanshan China 243000

Quantum Genetic Algorithm (QGA) is based on the concept and principles of quantum computing,such as a quantum bit and superposition of *** of binary,numeric,or symbolic representation,QGA uses a Q-bit,defined as the smallest unit of information,for the probabilistic representation and a Q-bit individual as a string of Q-bits.A Q-gate is introduced as a variation operator to drive the individuals toward better solutions.A novel multi-user detector based on QGA is *** analysis is given to the theoretical basis and practical performance of the proposed *** simulation results show that the proposed detector has more powerful properties in bit error rate than conventional Genetic Algorithm based detector,namely a 2-3 dB gain in performance can be *** results demonstrated the effectiveness and the applicability of QGA in multi-user detection.

关键词： Genetic algorithms Multiuser detection Quantum computing Detectors Space exploration Signal processing Information processing Mobile communication Telecommunication computing Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Strong convergence of the projection method in convex feasibility problem

Strong convergence of the projection method in convex feasib...

引用

9th international symposium on symbolic and numeric algorithms for scientific computing

作者： Stefan, Maruster W Univ Timisoara Dept Informat Timisoara Romania

the strong convergence properties of the projection method for convex feasibility problem are investigated in the frame of a real Hilbert space. the significant role of the regularity properties for strong convergence... 详细信息

ISBN: (纸本)9780769530789

关键词： Hilbert space Convergence of numerical methods scientific computing Informatics Joining processes Iterative methods Books Projection algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共59页 << < 50 51 52 53 54 55 56 57 58 59 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：