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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Fast computing of Non-uniform Sampling Positions for Real Signals

Fast Computing of Non-uniform Sampling Positions for Real Si...

引用

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

作者： Péter Kovács Viktor Vad Department of Numerical Analysis Eötvös L. University Budapest Hungary Department of Signal Processing Tampere University of Technology Tampere Finland

there is a wide range of applications of non-equidistant discretization of real signals. For instance, in computer graphics, Fourier analysis, identification and control theories, etc. they have the common ability to describe dynamical systems as well. In this paper we provide a fast algorithm based on an existing mathematical model to compute a non-uniform grid for representing different types of signals. In order to do that we need new concepts for constructing an effective numerical solution. Additionally, two experiments are performed to investigate the accuracy of the method. Finally, we also present a parallel implementation in CUDA which can further improve the execution time.

关键词： Graphics processing units Instruction sets Splines (mathematics) Function approximation Convergence Interpolation

来源：评论

学校读者我要写书评

暂无评论

Prüfer Number Encoding for Genetic Bayesian Network Structure Learning Algorithm

Prüfer Number Encoding for Genetic Bayesian Network Structu...

引用

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

作者： Beata Reiz Lehel Csato Dan Dumitrescu Bioinformatics Group Biological Research Center Szeged Hungary Faculty of Mathematics and Computer Science Babeş-Bolyai University Cluj-Napoca Romania

Bayesian networks encode causal relations between variables using probability and graph theory. We employ genetic algorithm to exploit these causal relations from data for classification problems, thus restricting the search space from directed acyclic graphs to trees. Prufer number encoding of the structure is employed for the representation of individuals in the genetic algorithm. Several score functions - information criteria - are also employed in order to analyse Prufer number encoding for Bayesian network structure learning. In this work we show that Prufer number encoding can reveal the causal dependence between class the variable and the attributes, the dependence being made without a-priori information regarding about the class variable.

关键词： Encoding Bayesian methods Genetic algorithms Tree graphs Probability distribution Information analysis Testing scientific computing Bioinformatics Biology

来源：评论

学校读者我要写书评

暂无评论

Reliable Management of Virtualized Resources Using Fault Trees

Reliable Management of Virtualized Resources Using Fault Tre...

引用

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

作者： Alexandru Butoi Alexandru Stan Gheorghe Cosmin Silaghi Babes-Bolyai University Cluj-Napoca Romania

the new trends in distributed computing has changed the way we do computing when talking about cloud infrastructures or high-performance computing. Resource virtualization technologies enabled elasticity of resource provisioning and management through easy replication of virtual nodes or virtual machine migration. In order to provide high availability and reliability in such distributed environments where resources are managed and served in form of virtual machines, specific load balancing and fault strategies are needed. Based on fault tree analysis concepts, we propose a distributed and autonomous approach to manage faults using fault agents able to asses and predict for each virtualized node, its state of fault or future fault. Accordingly, each node can take a decision about accepting future jobs, delegate jobs to own replicated instances or start a live migration process as a second strategy for assuring availability and continuity of the service.

关键词： Virtual machining Fault trees Computational modeling Cloud computing Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

A Purely Logical Approach to the Termination of Imperative Loops

A Purely Logical Approach to the Termination of Imperative L...

引用

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

作者： Mȃdȃlina Eraşcu Tudor Jebelean Research Institute for Symbolic Computation Johannes Kepler University Linz Austria

We present and illustrate a method for the generation of the termination conditions for nested loops with abrupt termination statements. the conditions are (first-order) formulae obtained by certain transformations of the program text. the loops are treated similarly to calls of recursively defined functions. the program text is analyzed on all possible execution paths by forward symbolic execution using certain meta-level functions which define the syntax, the semantics, the verification conditions for the partial correctness, and the termination conditions. the termination conditions are expressed as induction principles, however, still in first-order logic. Our approach is simpler than others because we use neither an additional model for program execution, nor a fix point theory for the definition of program semantics. Because the meta-level functions are fully formalized in predicate logic, it is possible to prove in a purely logical way and at object level that the verification conditions are necessary and sufficient for the existence and uniqueness of the function implemented by the program.

关键词： Semantics Syntactics Generators Arrays Safety Cognition Programming

来源：评论

学校读者我要写书评

暂无评论

Quantitative Programming and Markov Decision Processes

Quantitative Programming and Markov Decision Processes

引用

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

作者： Eneia Nicolae Todoran Department of Computer Science Technical University of Cluj-Napoca Cluj-Napoca Romania

Quantitative programming (or performance evaluation programming) is a programming paradigm, which supports the formal verification of (bounded versions of) concurrent programs by using model checking techniques. By partitioning the state space of programs into bisimulation equivalence classes, this approach enables the formal verification of programs with large state spaces. the paradigm was introduced by us in previous works by developing an experimental concurrent language designed to facilitate the construction of probabilistic models that capture the behavior of programs and that can be verified by using probabilistic model checking techniques. the experimental language introduced in previous works is extended in this paper with constructions which enable the specification of behavioral equivalence classes. Concurrent programs are translated into corresponding probabilistic models, which are analyzed by using the PRISM probabilistic model checker. the programmer identifies bisimulation equivalence classes to enable the formal verification of programs with large state spaces. For formal verification, we employ Markov Decision Processes.

关键词： Concurrent computing Analytical models scientific computing Programming Model checking Markov processes Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Path Directed symbolic Execution in the K Framework

Path Directed Symbolic Execution in the K Framework

引用

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

作者： Irina Mariuca Asăvoae Mihail Asăvoae Dorel Lucanu Faculty of Computer Science Alexandru Ioan Cuza University Iaşi Romania

the K framework is a rewrite-based executable semantic framework built with the purpose to define programming languages and formal analysis methods. this paper introduces K definition of the path-directed symbolic execution, which is that part of Counterexample Guided Abstraction Refinement (CEGAR) where the counterexample is checked for spuriousness. To express this technique in K, we use strongest post condition computation on straight line code. the programming language at hand is imperative, with simple arithmetic, but the approach can be applied to more complicated languages. this work aims to further advance the integration of CEGAR technique in rewriting logic semantics project in general, and in K in particular. By doing this we obtain an uniform description of the definition of the programming language, the abstract model checking, and the counterexample guided refinement. this uniformity enables formal reasoning about CEGAR's implementation correctness which could be further standardized and eventually automatized.

关键词： Semantics Concrete Cognition Computer languages Syntactics Computational modeling Heating

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Automated Synthesis of Some algorithms on Finite Sets

Automated Synthesis of Some Algorithms on Finite Sets

引用

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

作者： Isabela Dramnesc Tudor Jebelean Department of Computer Science West University Timisoara Romania Research Institute for Symbolic Computation Johannes Kepler University Linz Linz Austria

We start from the set theory axioms and we represent sets by monotone lists (sorted lists without duplications). For this, we define a representation function R and its reverse S and we want to synthesize the implementation of the essential corresponding predicates and functions over sets. Each synthesis starts as an inductive constructive proof which applies specific strategies and inference rules. We synthesize (by extracting from proofs) five algorithms among which two predicates: membership and inclusion, and three functions: union, intersection, and difference. In the process of proving we use properties from the theory of sets and we also add other necessary properties in the knowledge base. In this way we explore the theory of sets (represented as monotone lists). the program synthesis and the corresponding theory exploration are carried out in the frame of the theorem a system. One of the major advantages of our approach is that the algorithms for operating on sets represented as monotone lists are more efficient than the ones for operating on sets represented as non-sorted lists.

关键词： Knowledge based systems Inference algorithms Educational institutions Electronic mail Set theory Context scientific computing

来源：评论

学校读者我要写书评

暂无评论

Comparison of OLS and NLS to fit Transformation-Interaction-Rational expressions

Comparison of OLS and NLS to fit Transformation-Interaction-...

引用

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

作者： Fabricio Olivetti de Franca Center for Mathematics Computing and Cognition (CMCC) Heuristics and Analysis Laboratory (HAL) Universidade Federal do ABC Santo Andre Brazil

Transformation-Interaction-Rational is a representation for symbolic Regression created with the intent to constrain the search space of mathematical expressions with only simple models. In short, this representation is a rational of two linear models with transformed variables. Even though the representation makes the model nonlinear w.r.t. its numerical parameters, it is possible to rewrite the expression such that the parameters become linear and, thus, can be adjusted using the Ordinary Least Squares method, that guarantees the global optima solution. But, when we are working with a noisy data set, the reparametrization procedure may skew the noise distribution leading to an incorrect value for the numerical parameters. In this work, we test and compare the use of Ordinary Least Square and a non-linear optimization in simulated benchmarks with the presence of noise. the results show evidence that OLS is robust to noise and always returns a similar solution to the non-linear optimization algorithm.

关键词： scientific computing Benchmark testing Mathematical models numerical models Noise measurement Task analysis Optimization

来源：评论

学校读者我要写书评

暂无评论

Implementation Techniques for Mathematical Model Checking

Implementation Techniques for Mathematical Model Checking

引用

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

作者： Wolfgang Schreiner Research Institute for Symbolic Computation (RISC) Johannes Kepler University Linz Austria

We report on the various implementation techniques that the model checker RISCAL applies for the formal verification of mathematical algorithms and theorems in finite models of configurable sizes. Originally, RISCAL was based entirely on semantic evaluation where every syntactic phrase is translated to an executable version of its denotational semantics, which allows to execute algorithms and to evaluate first-order formulas. Later this was extended by a translation of formulas from the RISCAL language to an SMT-LIB logic, which enables their decision by the application of external SMT (satisfiability modulo theories) solvers. Subsequently, semantic evaluation was extended to nondeterministic/concurrent transition systems which facilitates the verification of invariance properties by state space exploration; this was recently generalized to an automatabased technique for verifying system specifications expressed in a LTL (linear temporal logic) extension of the RISCAL formula language. Recently, the checking capabilities of RISCAL have been complemented (via an embedding of the RISCTP theorem proving interface) by capabilities for verifying formulas in domains of arbitrary size with the help of external theorem provers. We briefly sketch these techniques and discuss their purpose and relationship within the general problem area of algorithm specification and verification.

关键词： Concurrent computing Runtime scientific computing Semantics Syntactics Mathematical models Space exploration

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：