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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Soundness of a Logic-Based Verification Method for Imperative Loops

Soundness of a Logic-Based Verification Method for Imperativ...

引用

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

作者： Erascu, Madalina Jebelean, Tudor Johannes Kepler Univ Linz Symbol Computat Res Inst A-4040 Linz Austria

ISBN: (纸本)9780769549347;9781467350266

We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness. the verification method consists in generating verification conditions for total correctness of an imperative loop annotated with an invariant. We realized, in the theorema system (***), the automatic proof of the soundness of verification method: if the verification conditions hold, then the imperative loop is totally correct with respect to its given invariant. the approach is simpler than the others because it is based on functional semantics (no additional theory of program execution is necessary) and produces verification conditions in the object theory of the program. the computer-supported proofs reveal the minimal collection of logical assumptions (some from natural number theory) and logical inferences (including induction) which are necessary for the soundness of the verification technique.

关键词： program analysis and verification symbolic execution semantics induction termination theorema system

来源：评论

学校读者我要写书评

暂无评论

Model-Driven Design of Cloud Applications with Quality-of-Service Guarantees: the MODAClouds Approach MICAS Tutorial 16

Model-Driven Design of Cloud Applications with Quality-of-Se...

引用

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

作者： da Silva, Marcos Aurelio Almeida Ferry, Nicolas Ardagna, Danilo Perez, Juan F. Softeam Paris France SINTEF Trondheim Norway Politecn Milan Dipartimento Elettron Informaz & Bioingn Milan Italy Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England

ISBN: (纸本)9781479984480

the competition between cloud providers has led to an impressive set of cloud solutions offered to consumers. the ability to properly design and deploy multi-cloud applications (i.e., applications deployed on multiple clouds) allows exploiting the peculiarities of each cloud solution and hence optimizing the performance and cost of the applications. However, this is hindered by the large heterogeneity of the existing cloud offerings. In this work, we present the model-driven methodology and tools developed within the MODAClouds European project to support the design of multi-cloud applications. In particular, the proposed framework promotes a model driven approach to help reducing vendor "lock-in", support multi-cloud deployments, and provide solutions for estimating and optimizing the performance of multi-cloud applications at design-time.

关键词： Model-Driven-Development Cloud computing Quality of Service Capacity Allocation Optimization

来源：评论

学校读者我要写书评

暂无评论

computing Origami Universal Molecules with Cyclic Tournament Forests

Computing Origami Universal Molecules with Cyclic Tournament...

引用

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

作者： Bowers, John C. Streinu, Ileana Univ Massachusetts Sch Comp Sci Amherst MA 01003 USA Smith Coll Dept Comp Sci Northampton MA 01063 USA

ISBN: (纸本)9781479930357

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.

关键词： computational geometry origami tree-constrained straight-skeleton KDS tournament tree

来源：评论

学校读者我要写书评

暂无评论

Service lifecycle in the cloud environment

Service lifecycle in the cloud environment

引用

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

作者： Munteanu, Victor Ion Fortis, Teodor-Florin Negru, Viorel West Univ Timisoara Fac Math & Informat Dept Comp Sci Timisoara Romania

ISBN: (纸本)9780769549347;9781467350266

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.

关键词： service lifecycle cloud computing cloud governance cloud brokerage cloud management

来源：评论

学校读者我要写书评

暂无评论

computing Boolean Border Bases 18

Computing Boolean Border Bases

引用

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

作者： Horacek, Jan Kreuzer, Martin Ekossono, Ange-Salome Messeng Univ Passau Fac Informat & Math D-94030 Passau Germany

ISBN: (纸本)9781509057078

Given a 0-dimensional polynomial system in a polynomial ring over F-2 having only. F-2-rational solutions, we optimize the Border Basis Algorithm (BBA) for solving this system by introducing a Boolean BBA. this algorithm is further improved by optimizing the linear algebra steps. We discuss ways to combine it with SAT solvers, optimized methods for performing the combinatorial steps involved in the algorithm, and various approaches to implement the linear algebra steps. Based on our C++ implementation, we provide some timings to compare sparse and dense representations of the coefficient matrices and to Grobner basis methods.

关键词： boolean polynomial border basis SAT solver small scale AES

来源：评论

学校读者我要写书评

暂无评论

Reachability Analysis of Time Basic Petri Nets: a Time Coverage Approach

Reachability Analysis of Time Basic Petri Nets: a Time Cover...

引用

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

作者： Bellettini, Carlo Capra, Lorenzo Univ Milan Dept Informat & Commun Milan Italy

ISBN: (纸本)9780769546308

We introduce a technique for reachability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real-time systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are functions of marking's time description. the technique consists of building a symbolic reachability graph relying on a sort of time coverage, and overcomes the limitations of the only available analyzer for TB nets, based in turn on a time-bounded inspection of a (possibly infinite) reachability-tree. the graph construction algorithm has been automated by a tool-set, briefly described in the paper together with its main functionality and analysis capability. A running example is used throughout the paper to sketch the symbolic graph construction. A use case describing a small real system - that the running example is an excerpt from - has been employed to benchmark the technique and the tool-set. the main outcome of this test are also presented in the paper. Ongoing work, in the perspective of integrating with a model-checking engine, is shortly discussed.

关键词： timed Petri nets linear constraints symbolic reachability analysis

来源：评论

学校读者我要写书评

暂无评论

Specifications and verification of network protocols by process algebra

Specifications and verification of network protocols by proc...

引用

7th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2005

作者： Ciobanu, Gabriel Sridhar, K.N. Research Institute e-Austria Timişoara Romania Romanian Academy Institute of Computer Science Iaşi Romania National University of Singapore School of Computing

ISBN: (纸本)0769524532

this paper describes the specification and verification techniques for network protocols, concentrating on one hand on process algebras, and on the other hand on techniques for specific layers. the original contribution is given by new pi-calculus rules representing a set of specific patterns for expressing protocol behavior. the paper provides a review of the verification tools, and proposes a few extensions. © 2005 IEEE.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Colored petri nets state-space reduction via symbolic execution

Colored petri nets state-space reduction via symbolic execut...

引用

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

作者： Capra, L Univ Milan Dip Informat & Comunicaz I-20135 Milan Italy

ISBN: (纸本)0769524532

State-space reduction techniques for distributed discrete-event systems are normally based on detection of behavioral equivalences or symmetries. Well-Formed Nets (WN) are a Colored Petri Net flavor allowing the direct construction of a quotient graph, the symbolic Reachability Graph (SRG), that captures symmetries suitably encoded in the WN color annotations, and holds the same information as the ordinary reachability graph. Like all those approaches based on static (global) symmetries, however the SRG is not effective in many real cases. In this paper a new quotient graph for colored PNs matching an extended WN-like syntax is introduced. the technique, which relies on a simple mapping of color domains into numerical domains, makes use of linear constraints to perform a sort of symbolic execution. We compare it with a recently presented approach exploiting local symmetries. the model of an asymmetric distributed algorithm is used as comparison term.

关键词： high-level Petri nets quotient graphs symmetries linear constraints

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： de Franca, Fabricio Olivetti Univ Fed ABC Ctr Math Comp & Cognit CMCC Heurist & Anal Lab HAL Santo Andre Brazil

ISBN: (纸本)9781665465458

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.

关键词： symbolic regression parameter optimization representation

来源：评论

学校读者我要写书评

暂无评论

computing Self-intersection Loci of Parametrized Surfaces Using Regular Systems and Grobner Bases

Computing Self-intersection Loci of Parametrized Surfaces Us...

引用

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

作者： Huang, Yanli Wang, Dongming Beihang Univ LMIB SKLSDE Sch Math & Syst Sci Beijing 100191 Peoples R China Univ Paris 06 Lab Informat CNRS F-75016 Paris France

ISBN: (纸本)9780769539645

the computation of self-intersection loci of parametrized surfaces is needed for constructing trimmed parametrizations and describing the topology of the considered surfaces in real settings. this paper presents two general and efficient methods for determining self-intersection loci of rationally parametrized surfaces. One of the methods, based on regular systems, is capable of computing the exact parametric locus of self-intersection of a given surface and the other, based on Grobner bases, can compute the minimal variety passing through the exact parametric locus. the relation between the results computed by the two methods is established and two algorithms for computing parametric loci of self-intersection are described. Experimental results and comparisons with some existing methods show that our algorithms have a good performance for parametrized surfaces.

关键词： parametrized surface self-intersection locus minimal variety parametric locus

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：