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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Analysis of the Influence of Bound Constraint Handling Strategies on the Search Direction in Differential Evolution algorithms

Analysis of the Influence of Bound Constraint Handling Strat...

引用

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

作者： Mitran Mădălina-Andreea Faculty of Mathematics and Informatics West University of Timişoara Timiş oara România

ISBN: (纸本)9781665406512

this paper is aiming to analyze the influence of the boundary constraints handling methods (BCHM) on the search direction in the case of Differential Evolution (DE) optimization algorithms. An experimental analysis for 8 correction methods was conducted, its main aim being the comparison between cosine similarities corresponding to the search direction computed before the application of BCHM and the search direction computed after the application of BCHM. the results of the analysis provide information about how much of the initial search direction is conserved by applying a correction method. Some preliminary theoretical results are also presented.

关键词： Constraint handling scientific computing Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Beliefs and Communication, the Basis of Collaborative Agents

Beliefs and Communication, The Basis of Collaborative Agents

引用

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

作者： Ion Mircea Diaconescu Gerd Wagner Department of Internet Technology Institute of Informatics Brandenburg University of Technology Cottbus Germany

Nowadays, simulation scenarios require enhanced agents being capable of communication, learning and having beliefs about their self or about their world. the distinction between facts and (possible false) beliefs is part of the requirements in order to describe scenarios closer to real world. this work proposes a solution which allows information exchange between agents, making use of generic/standard and ad-hoc message types, involving their self beliefs and their beliefs about the world where they act. Standard agent types being capable of automatic management of standard message types are defined. SPARQL, a standard RDF based query language, is used as part of the communication protocol. the paper is build around a social simulation scenario that provides the possibility of testing and describing the benefices of this work.

关键词： Collaboration Vocabulary Intelligent agent Ontologies Speech Communication standards Resource description framework Testing Computer languages scientific computing

来源：评论

学校读者我要写书评

暂无评论

Semantic Web Service Composition Method Based on Fluent Calculus

Semantic Web Service Composition Method Based on Fluent Calc...

引用

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

作者： Viorica R. Chifu Ioan Salomie Ioana Harsa Marius Gherga Department of Computer Science Technical University of Cluj Napoca Cluj-Napoca Romania

this paper presents a new approach for automatic Web service composition based on the formalism of Fluent Calculus using semantic Web service descriptions. In our approach, the Web service composition process is viewed as an AI planning problem in the Fluent Calculus formalism. To semantically describe Web services, we have used a Web service domain ontology which is then translated into a Fluent Calculus knowledge base, necessary for the composition planning phase. For verifying the composed services, the Label Transition System Analyzer (LTSA) formalism is used. the paper also presents an experimental prototype for the Fluent Calculus based Web service composition and demonstrates its effectiveness with the help of an application scenario from the social event planning domain.

关键词： Semantic Web Calculus Web services Ontologies Logic programming scientific computing Computer science Dynamic programming Artificial intelligence Process planning

来源：评论

学校读者我要写书评

暂无评论

Intelligent Agent for Food Recognition in a Smart Fridge

Intelligent Agent for Food Recognition in a Smart Fridge

引用

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

作者： Florin Dumitrescu Adina Magda Florea Mihai Trăscău Alexandru Sorici Computer Science Department University Politehnica of Bucharest Bucharest

Respecting an adequate diet is essential for a healthy lifestyle. However, keeping track of the daily consumed food and of what one has in the home fridge may be tedious and time consuming if not backed up by user-friendly applications. In this context, the paper presents some of the main components of an intelligent agent and system aimed to create a user-oriented application for recommending personalized food recipes based on the available ingredients and dietary restrictions in a domestic environment. the developed application includes a component to accurately detect the ingredients from an image taken from inside a fridge equipped with mounted cameras, and allows the user to get information about each ingredient, such as the ingredient type, name and associated calories. To facilitate the development of this application, our own data set of food ingredients was collected and annotated, and an ontology of recipes was developed.

关键词： Image recognition scientific computing Prototypes User interfaces Ontologies Sensor systems and applications numerical models

来源：评论

学校读者我要写书评

暂无评论

One side class SVM training methods for malware detection

One side class SVM training methods for malware detection

引用

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

作者： George Popoiu PhD Student "Al. I. Cuza" University - Faculty of Computer Science Iaşi România Bitdefender Cyber Threat Intelligence Lab Iaşi România

Even though machine learning methods are being used in practice for malware detection, there are still many hurdles to overcome. Nowadays, there are still some challenges remaining regarding machine learning for malware detection: having a false positive rate as low as possible, fast classification, low volatile and disk memory usage. Because of these constraints, security solutions often have to rely on simpler models rather than on more complex ones. this paper has the purpose of reducing the training phase false positive rate of SVM models in the context of malware detection by using reformulations of the SVM optimization problem. the results obtained show that the proposed linear SVM model can be a drop in replacement with better false positive rate than regular linear SVM models or the one side class perceptron [4].

关键词： Support vector machines Training scientific computing Computational modeling Machine learning Malware numerical models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：