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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Local Optimization Often is Ill-conditioned in Genetic Programming for symbolic Regression

Local Optimization Often is Ill-conditioned in Genetic Progr...

引用

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

作者： Gabriel Kronberger Josef Ressel Center for Symbolic Regression Heuristic and Evolutionary Algorithms Lab University of Applied Sciences Upper Austria

Gradient-based local optimization has been shown to improve results of genetic programming (GP) for symbolic regression. Several state-of-the-art GP implementations use iterative nonlinear least squares (NLS) algorithms such as the Levenberg-Marquardt algorithm for local optimization. the effectiveness of NLS algorithms depends on appropriate scaling and conditioning of the optimization problem. this has so far been ignored in symbolic regression and GP literature. In this study we use a singular value decomposition of NLS Jacobian matrices to determine the numeric rank and the condition number. We perform experiments with a GP implementation and six different benchmark datasets. Our results show that rank-deficient and ill-conditioned Jacobian matrices occur frequently and for all datasets. the issue is less extreme when restricting GP tree size and when using many non-linear functions in the function set.

关键词： Jacobian matrices scientific computing Genetic programming Benchmark testing Approximation algorithms Iterative algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

Simple Venn Diagrams for Multisets

Simple Venn Diagrams for Multisets

引用

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

作者： Aurelian Radoaca Department of Computer Science West University of Timisoara Romania

We introduce Venn diagrams for multisets and showhow they simplify the analysis of multisets. Venn diagrams arevery useful in proofs involving multisets and multiset orders, especially considering the complications introduced by the multiplicity of elements in multisets. We compare the Venn diagramsfor multisets with the corresponding ones for sets. thus, wepresent two types of Venn diagrams for multisets, a simple onethat looks like a diagram for sets, but with areas that are notnecessarily disjoint, and a complex one (compared to sets), butwith certain delimited disjoint areas.

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

来源：评论

学校读者我要写书评

暂无评论

Properties and Computation of the Functional Inverse of Gamma

Properties and Computation of the Functional Inverse of Gamm...

引用

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

作者： K. Amenyo Folitse David J. Jeffrey Robert M. Corless ORCCA and Dept. Applied Maths Western University Canada ORCCA and Dept. Applied Maths Uni. Western Ontario Canada

We define the functional inverse of the Gamma function. It is a multivalued function, and we define its branches. We present its basic properties, included series approximations, asymptotic results and numerical evalu... 详细信息

ISBN: (纸本)9781538626276

关键词： Convergence Newton method Computer science Taylor series scientific computing Turning Presses

来源：评论

学校读者我要写书评

暂无评论

Workflow Management for symbolic Grid Services

Workflow Management for Symbolic Grid Services

引用

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

作者： Alexandru Carstea Georgiana Macariu Marc Frincu Dana Petcu Institute e-Austria Timisoara Romania

the development of software systems for scientific exploration and discovery through computation has an important issue to address: the management of underlying computational steps. To support composition of Web and Grid services, standard workflow languages and workflow execution engines were built but management capabilities are not yet entirely explored. In the context of Grid services, we propose a solution for controlling the execution of workflows without the assistance of a user interface oriented workflow engine. We also investigate the capabilities that our solution may offer for related features such as dynamic retrieval of partial results, steering and provenance.

关键词： Engines Web services Grid computing Software development management Context-aware services Logic Workflow management software Software algorithms scientific computing Software systems

来源：评论

学校读者我要写书评

暂无评论

A Rewrite Stack Machine for ROC!

A Rewrite Stack Machine for ROC!

引用

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

作者： Georgiana Caltais Eugen-Ioan Goriac Dorel Lucanu Gheorghe Grigoras Faculty of Computer Science Alexandru Ioan Cuza슠University Iasi Romania

ROC! is a deterministic rewrite strategy language which includes the rewrite rules as basic operators, and the deterministic choice and the repetition as high-level strategy operators. In this paper we present a method which, for a given term Rewriting system (TRS) R, constructs a new TRS Rmacr such that R-rewriting is equivalent (sound and complete) with Rmacr-rewriting constrained by ROC!. Since Rmacr uses a stack, it is called a rewrite stack machine.

关键词： Commutation Differential equations scientific computing Computer science

来源：评论

学校读者我要写书评

暂无评论

Empirical evaluation of LZW-Compressed Multiple Pattern Matching algorithms

Empirical evaluation of LZW-Compressed Multiple Pattern Matc...

引用

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

作者： Mario Reja Faculty of Mathematics and Informatics West University of Timisoara Timisoara Romania

Data compression is used to reduce the cost of storing and transmitting increasingly large datasets in various domains ranging from bioinformatics to particle physics and general purpose computing. Most of these areas require the ability to scan the datasets for patterns like DNA sequences, malicious executable code or various other string queries, an operation that is hindered by the altered form of the data. In order to speed up the matching process, several compressed pattern matching algorithms have been previously proposed. this paper presents an overview of the state of the art in multiple pattern matching of Lempel-Ziv-Welch encoded archives, together with experimental results.

关键词： Runtime Costs scientific computing Memory management DNA Automata Static analysis

来源：评论

学校读者我要写书评

暂无评论

A Duality-Aware Calculus for Quantified Boolean Formulas

A Duality-Aware Calculus for Quantified Boolean Formulas

引用

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

作者： Katalin Fazekas Martina Seidl Armin Biere Institute for Formal Models and Verification Johannes Kepler University Linz Austria

ISBN: (纸本)9781509057085

Learning and backjumping are essential features in search-based decision procedures for Quantified Boolean Formulas (QBF). To obtain a better understanding of such procedures, we present a formal framework, which allows to simultaneously reason on prenex conjunctive and disjunctive normal form. It captures both satisfying and falsifying search states in a symmetric way. this symmetry simplifies the framework and offers potential for further variants.

关键词： Calculus Reactive power Standards scientific computing Computational modeling numerical models Cognition

来源：评论

学校读者我要写书评

暂无评论

computing with Free Algebras

Computing with Free Algebras

引用

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

作者： Paul Tarau Department of Computer Science and Engineering University of North Texas Denton USA

We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorphic with the set of natural numbers. Constructors and deconstructors seen through an initial algebra semantics are generalized to recursively defined functions obeying similar laws. Implementations using GHC's "view" construct are discussed, based on the free algebra of rooted ordered binary trees.

关键词： Algebra Binary trees Generators Complexity theory Computer science Semantics

来源：评论

学校读者我要写书评

暂无评论

Steel Phase Kinetics Modeling using symbolic Regression

Steel Phase Kinetics Modeling using Symbolic Regression

引用

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

作者： David Piringer Bernhard Bloder Gabriel Kronberger Heuristic & Evolutionary Algorithms Lab University of Applied Sciences Upper Austria Hagenberg Austria MCL Forschungs GmbH Leoben Austria

We describe an approach for empirical modeling of steel phase kinetics based on symbolic regression and genetic programming. the algorithm takes processed data gathered from dilatometer measurements and produces a system of differential equations that models the phase kinetics. Our initial results demonstrate that the proposed approach allows to identify compact differential equations that fit the data. the model predicts ferrite, pearlite and bainite formation for a single steel type. Martensite is not yet included in the model. Future work shall incorporate martensite and generalize to multiple steel types with different chemical compositions.

关键词： Phase measurement scientific computing Computational modeling Differential equations Predictive models Prediction algorithms Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Optimization of Resource Scheduling in Cloud computing

Optimization of Resource Scheduling in Cloud Computing

引用

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

作者： Qiang Li Yike Guo College of Computer Science Sichuan University Chengdu Sichuan China Department of Computer Science University of Tsukuba Japan Department of Computer Science Imperial College London London UK

Resource scheduling based on SLA (Service Level Agreement) in cloud computing is NP-hard problem. there is no efficient method to solve it. this paper proposes a new method to solve the problem by applying stochastic integer programming for optimal resource scheduling in cloud computing. Applying Gröbner bases theory for solving the stochastic integer programming problem and the experimental results of the implementation are also presented.

关键词： Linear programming Stochastic processes Computational modeling Quality of service Business Optimization Cloud computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：