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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

559 篇 会议
7 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

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

语言

571 篇 英文

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

共 571 条记录，以下是451-460 订阅

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

详细简洁

排序：

Properties of Multiset Orders by Minimal and Maximal Submultisets

Properties of Multiset Orders by Minimal and Maximal Submult...

引用

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

作者： Aurelian Rádoacá Department of Computer Science West University of Timişoara Romania

We analyze the relations between the multisets and their submultisets involved in the multiset order M> mso and derive many properties that can be used in proofs. these properties are used to refine some proofs of known results, like the transitivity or the termination of > mso . these properties also enable a better understandingof the underlying theory and can be use din implementations of theorem provers. For two finite multisets M, N, there can be several pairs of their submultisets that satisfy M> mso N, which can be seen as solutions to the equation M>mso N. We determine the number of solutions that satisfy M> mso N and establish an order between them, not total, but admittinga minimum and a maximum. We determine the formulae for the minimal submultisets and provide several algorithmsto find the maximal submultisets. the minimal submultisetsare necessary and sufficient to determine if M> mso N. the minimal and maximal submultisets also allow for a deeperanalysis in termination problems with multiset orders, being able to determine, for instance, how fast a program can terminate.

关键词： Manganese Finite element analysis scientific computing Computer science Electronic mail Indexes Additives

来源：评论

学校读者我要写书评

暂无评论

Designing Data Interchange Services for Learning Components

Designing Data Interchange Services for Learning Components

引用

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

作者： Alina Andreica Fernando Paulo Bello Florina Covaci Faculty of European Studies Babes-Bolyai University Cluj-Napoca Romania Universitatea Babes-Bolyai Cluj-Napoca RO Institute of Accountancy and Administration Polytechnic Institute of Coimbra Coimbra Portugal

ISBN: (纸本)9781538626276

the paper proposes design principles for data representation in cloud data interchange services among various information systems, with applications on e-learning systems. these principles contribute to detailing and improving standards in the process of retaining learning objects in repositories and facilitate discovering digital content used for teaching, learning, or training among various information systems. Equivalence algorithms and canonical representation are used in order to ensure the uniform representation in the cloud database. the solution we describe, proposed to be provided within cloud architectures, brings important advantages in e-learning systems communication and educational institutions cooperation, since different institutions use different e-learning systems and do not have automatic means of exchanging information. the advances in representing learning objects contribute to facilitating the exchange of these resources among different stakeholders.

关键词： Databases Electronic learning Information systems Standards Pattern matching Cloud computing Interoperability

来源：评论

学校读者我要写书评

暂无评论

Alleviating Urban Traffic Congestion by Means of Adaptive Routing

Alleviating Urban Traffic Congestion by Means of Adaptive Ro...

引用

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

作者： Cristian Gratie Adina Magda Florea Department of Computer Science University Politehnica of Bucharest Bucharest Romania

Traffic congestion is an important problem of today's urban life. Various approaches have been analyzed for solving this problem, most solutions addressing only a specific cause of the congestion. this paper focuses on rush hour congestion and aims to address its cause, the fact that many drivers need to reach the same destination and use the same routes, most frequently the shortest ones. A simple solution would be a collaborative behavior from the drivers, so as to ensure that some of the drivers choose slightly longer routes in order to avoid congestion. this paper aims to investigate the improvement potential of using intelligent routing, while offering (as much as possible) the fastest available routes to the drivers. A simple yet effective routing algorithm is proposed and tested by means of a multi-agent system on top of a traffic simulator. Experimental results conform to the expected behavior of the algorithm and are meant to provide reference values for further research.

关键词： Routing Traffic control Communication system traffic control Multiagent systems Delay Lighting control scientific computing Computer science Collaboration System testing

来源：评论

学校读者我要写书评

暂无评论

Authors and Collaborator Groups Ranking Analysis on SYNASC using Centrality Measures

Authors and Collaborator Groups Ranking Analysis on SYNASC u...

引用

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

作者： Victor Bogdan Alin Brînduşescu West University of Timişoara Timişoara Romania

the constant increase of published papers and participating authors in conferences has risen the interest in studies related to conference and co-authorship analysis techniques. there are numerous different studies in the literature, which offer distinct perspectives regarding the author ranking, impact, collaborations and research interests through various analysis techniques. In our research, we are introducing a new collaborator group ranking analysis based on four different centrality measures, using published papers data from the SYNASC conference during the 2005-2021 period, with which we construct dynamic co-authorship networks. By using the proposed approach, we aim to study collaboration properties at micro-level, which could also determine the impact of the authors and collaborator groups on the conference itself. the results which we obtained are highlighting that some of the authors and collaborator groups excelled in multiple ranking types, by having a constant top ranking, thus also suggesting a significant overall impact, developed over time, on the conference.

关键词： Weight measurement Productivity Correlation scientific computing Collaboration Time measurement Frequency diversity

来源：评论

学校读者我要写书评

暂无评论

Evaluating Moldability of LHCb Jobs for Multicore Job Submission

Evaluating Moldability of LHCb Jobs for Multicore Job Submis...

引用

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

作者： Nathalie Rauschmayr Achim Streit CERN - European Organization for Nuclear Research Geneva Switzerland Steinbuch Centre for Computing Karlsruhe Institute of Technology Karlsruhe Germany

the LHCb experiment at CERN processes its datasets over hundred different grid sites within the Worldwide LHC computing Grid (WLCG). All those grid sites consist of multicore CPUs nowadays. However, the number of cores per worker node will increase in the near future. Using such worker nodes more efficiently requires parallelization of software as well as modifications at the level of scheduling. this paper will evaluate a moldable job model for LHCb grid jobs where the main challenge is the definition of the best degree of parallelism. Choosing an appropriate degree of parallelism depends on the parameters, on which optimization shall be applied. Commonly used features are for example scalability, workload and turnaround time. Prediction of run time is another major problem and it will be discussed how it can be handled using historical information. Furthermore, the advantages and disadvantages of a moldable job model will be discussed as well on how it must be extended to meet the requirements of LHCb jobs.

关键词： Parallel processing Production Software Multicore processing Large Hadron Collider Detectors Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Coloring Random Graphs: A Short Survey

Coloring Random Graphs: A Short Survey

引用

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

作者： Lefteris Kirousis RA Computer Technology Institute and Department of Computer Engineering and Informatics University of Patras Patras Greece

We shortly present some recent results concerning the chromatic number of random graphs. the setting is as follows: we consider a probability space with graphs of a given average degree d and n vertices (the term "average" here refers to the ratio of the sum of the degrees of all vertices to n). In the first case (the Erd¿s-Renyi graphs), the probability space comprises all graphs with average degree d and n vertices. In the second case (regular graphs), the probability space comprises only graphs where all n vertices have degree exactly d. In both cases the probability measure is uniform. In both cases the chromatic number exhibits interesting threshold behavior: for a given average degree (given constant degree, for the regular case, respectively), the chromatic number of almost all graphs (asymptotically with n) lies within a common, small window of 1-3 integers. However as the degree increases, at specific values this window undergoes abrupt changes.

关键词： Space technology Moment methods scientific computing Paper technology Informatics Chebyshev approximation Physics Computer simulation Mathematics Graph theory

来源：评论

学校读者我要写书评

暂无评论

A (Timed) State-Transition Semantics for Reflective Petri Nets

A (Timed) State-Transition Semantics for Reflective Petri Ne...

引用

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

作者： Lorenzo Capra Department of Informatics and Communication University degli Studi Milan Italy

the design of dynamic (adaptable) discrete-event systems calls for adequate modeling formalisms and tools able to manage possible changes occurring during systempsilas lifecycle. A common approach is to pollute design with details that do not regard the current system behavior, rather its evolution. that hampers analysis, reuse and maintenance in general. A Petri net-based reflective model (based on classical Petri nets) was recently proposed to support dynamic discrete-event systempsilas design, and was applied to dynamic workflowpsilas management. Behind there is the idea that keeping functional aspects separated from evolutionary ones, and applying evolution to the (current) system only when necessary, results in a simple formal model on which the ability of verifying properties typical of Petri nets is preserved. On the perspective of implementing in the short time a discrete-event simulation engine, Reflective Petri nets are provided in this paper with a timed state-transition graph semantics, defined in terms of a Markov process.

关键词： Petri nets Discrete event systems Timing Pollution Discrete event simulation Engines Markov processes Performance analysis Stochastic processes scientific computing

来源：评论

学校读者我要写书评

暂无评论

iComponent: A Platform Independent Component Model for Dynamic Execution Environments

iComponent: A Platform Independent Component Model for Dynam...

引用

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

作者： Ioan Lazar Bazil Parv Simona Motogna Istvan Gergely Czibula Codrut-Lucian Lazar Department of Computer Science Babeş-Bolyai University Cluj-Napoca Romania

Service-oriented component models support the dynamic availability of components at run-time and offer the possibility to build dynamically adaptable applications. However, building service-oriented components is a complex task due to the complexity of service-oriented frameworks. In this context today frameworks try to simplify the component development by allowing developers to concentrate only on implementing the business logic of the component and then to configure declaratively the component deployment. In this paper we present a platform-independent component model, iCOMPONENT, which provides these features. We also define a UML profile for constructing components as UML models according to the OMG's model driven architecture. this work is part of a series refering to COMDEVALCO - a framework for software component definition, validation, and composition. As part of COMDEVALCO framework we present a tool for executing UML components expressed in terms of the proposed component model.

关键词： Application software Business Java Integrated circuit modeling Availability Unified modeling language Runtime environment Logic programming scientific computing Computer science

来源：评论

学校读者我要写书评

暂无评论

Hybrid Modelling of an Audio Signal Based on 1-D Wold Decomposition

Hybrid Modelling of an Audio Signal Based on 1-D Wold Decomp...

引用

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

作者： Iuliana Borza Flavius Turcu Mohamed Najim Faculty of Computer Science and Mathematics West University of Timisoara Romania IMS-Department LAPS ENSEIRB University of Bordeaux 1 France

this paper presents a hybrid model which is applicable to a wide variety of unidimensional signals like speech and more complex audio signals. We propose a new criterion for an optimal reconstruction of an unidimensional signal based on Wold-like decomposition of the stochastic processes. this decomposition inthe case 1D implies two mutually orthogonal parts: a purely indeterministic part and a deterministic part, which can be modelled respectively by an autoregressive model and by a harmonic model. the problem to which we answer is the identification and the separation of the two parts, by a new criterion which combines the quality and the parsimony of the parametric representations. Both analytical and experimental results show that the deterministic part and completely non-deterministic components should be parametrized separately. the model proposed by us is very efficient in terms of the numbers of parameters used in the reconstruction of the original signal.

关键词： Stochastic processes Signal processing Autocorrelation Multidimensional signal processing Fourier transforms Additives Particle measurements Frequency measurement scientific computing Mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 42 43 44 45 46 47 48 49 50 51 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：