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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Description and Execution of Patterns for symbolic Computations

Description and Execution of Patterns for Symbolic Computati...

引用

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

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

the principal benefit introduced by distributed systems is the ability to use the computation power and processing capabilities of multiple processing nodes in order to solve problems infeasible on a single machine. For symbolic computing these advantages are particularly useful. In order to create a successful distributed system to support symbolic computations is important to have a deep understanding of the way the computer algebra specialists interact with a symbolic computing system. In this paper we investigate general processing capabilities of symbolic computing systems related to control flow and we emphasize several execution patterns. the impact that workflow management functionalities have over general execution patterns in symbolic computing are also investigated.

关键词： Genetic algorithms Design optimization Middleware Data warehouses Algorithm design and analysis Grid computing Parallel processing Biological cells scientific computing Informatics

来源：评论

学校读者我要写书评

暂无评论

Intelligent Computer Mathematics - 9th international Conference, AISC 2008 - 15th symposium, Calculemus 2008 - 7th international Conference, MKM 2008, Proceedings

Intelligent Computer Mathematics - 9th International Confere...

引用

9th Int. Conf. Artificial Intelligence and symbolic Computation, AISC 2008 - 15th symposium on the Integration of symbolic Computation and Mechanized Reasoning, Calculemus 2008 - 7th Int. Conf. Mathematical Knowledge Management, MKM 2008

ISBN: (纸本)3540851097

the proceedings contain 43 papers. the topics discussed include: on a hybrid symbolic-connectionist approach for modeling the kinematic robot map - and benchmarks for computer algebra;applying link grammar formalism in the development of English-Indonesian machine translation system;case studies in model manipulation for scientific computing;mechanising a proof of Craig's interpolation theorem for intuitionistic logic in nominal Isabelle;ASIC meets natural typography;the monoids of order eight and nine;extending graphical representations for compact closed categories with applications to symbolic quantum computation;a full first-order constraint solver for decomposable theories;search techniques for rational polynomial orders;strategies for solving sat in grids by randomized search;towards an implementation of a computer algebra system in a functional language;and automated model building: from finite to infinite models.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

A Cryptographic Algorithm Based on a Pseudorandom Number Generator

A Cryptographic Algorithm Based on a Pseudorandom Number Gen...

引用

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

作者： Dominic Bucerzan Department of Mathematics and Computer Science Aurel Vlaicu University of Arad Arad Romania

the paper proposes to the information security specialists, a new algorithm based on a synchronous stream cipher HENKOS, built around a performing pseudorandom number generator. the paper describes the main parts of the algorithm, analyze the quality of the implementation, measure the performance and present the statistical tests results for the pseudorandom number generator .

关键词： Cryptography Testing Algorithm design and analysis scientific computing Synchronous generators Mathematics Computer science Information security Performance analysis Bibliographies

来源：评论

学校读者我要写书评

暂无评论

What’s New In QBF Solving? : (Invited Talk)

What’s New In QBF Solving? : (Invited Talk)

引用

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

作者： Martina Seidl Institute for Symbolic Artificial Intelligence Johannes Kepler University Linz Austria

Quantified Boolean Formulas (QBFs) extend propositional formulas by quantifiers over the Boolean variables. this extension makes the QBF decision problem PSPACE-hard. therefore, QBFs provide an attractive reasoning framework for many reasoning problems from artificial intelligence, formal verification, and other fields. In this work, we review current advancements in the theory and practice of QBF solving.

关键词： scientific computing Feature extraction Cognition Encoding Artificial intelligence Certification Formal verification

来源：评论

学校读者我要写书评

暂无评论

algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints

Algorithms for Identifying Sequence Patterns with Several Ty...

引用

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

作者： Mugurel Ionut Andreica Andrei Grigorean Nicolae Tapus Computer Science and Engineering Department Politehnica University of Bucharest Bucharest Romania Faculty of Mathematics and Computer Science University of Bucharest Bucharest Romania

In this paper we present efficient algorithmic techniques for identifying several types of sequence-related patterns. We consider two main problems: finding a maximum weight contiguous subsequence which has the structure of a permutation with repetitions, and an online problem consisting of the constrained guessing of a secret sequence.

关键词： Computer science scientific computing Mathematics Sorting Counting circuits

来源：评论

学校读者我要写书评

暂无评论

the Time Yards Model - Rethinking the Way to Look at Texts

The Time Yards Model - Rethinking the Way to Look at Texts

引用

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

作者： Dan Cristea Faculty of Computer Science “Alexandru Ioan Cuza” University Iasi Romania Iasi branch of the Romanian Academy Institute of Computer Science Iasi Romania

this paper is about copying on artificial agents humans' perception of time and their ability to produce-condensed short stories out of large free texts. We propose a model intended to objectivize processes that h... 详细信息

ISBN: (纸本)9781509057085

关键词： Communication channels scientific computing Trajectory Motion pictures Computational modeling Computer science Libraries

来源：评论

学校读者我要写书评

暂无评论

Triangular Decomposition for Algebraic and Geometric computing

Triangular Decomposition for Algebraic and Geometric Computi...

引用

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

作者： Dongming Wang Laboratoire d'Informatique de Paris 6 UPMC-CNRS Paris France LMIB-School of Science Beihang University Beijing China

In this talk, we present several algorithms for decomposing systems of multivariate polynomials into triangular systems of various kinds. the algorithms have been efficiently implemented and successfully applied to numerous problems of scientific computing, ranging over computational polynomial algebra, automated geometric reasoning, solving systems of nonlinear equations, qualitative analysis of biological systems, and computer aided geometric design. We discuss some of the applications with a number of illustrative examples.

关键词： scientific computing Polynomials Biology computing Algorithm design and analysis Algebra Nonlinear equations Biological systems Application software

来源：评论

学校读者我要写书评

暂无评论

Termination Analysis by Program Inversion

Termination Analysis by Program Inversion

引用

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

作者： Stefan Andrei Department of Computer Science Lamar University Beaumont TX USA

Automatic methods for discovering program runtime and proving program termination have always been a challenging problem in computer science. We present here a novel and systematic approach for calculating an upper bound of the maximum runtime of functions for a non-trivial class of programs. the proof is based on an induction over a tree of execution traces - a new mathematical data structure. As a consequence, this can also show termination for these functions. the approach uses symbolic-numeric algorithms over a novel mathematical data structure, and can systematically find the maximum runtime for a wide class of functions.

关键词： Runtime Computer science scientific computing Algorithm design and analysis Upper bound Tree data structures Data structures Partitioning algorithms Arithmetic Delay effects

来源：评论

学校读者我要写书评

暂无评论

A Streamlined Difference Ring theory: Indefinite Nested Sums, the Alternating Sign, and the Parameterized Telescoping Problem

A Streamlined Difference Ring Theory: Indefinite Nested Sums...

引用

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

作者： Carsten Schneider Research Institute for Symbolic Computation (RISC) Johannes Kepler University (JKU) Linz Austria

We present an algebraic framework to represent indefinite nested sums over hyper geometric expressions in difference rings. In order to accomplish this task, parts of Karr's difference field theory have been extended to a ring theory in which also the alternating sign can be expressed. the underlying machinery relies on algorithms that compute all solutions of a given parameterized telescoping equation. As a consequence, we can solve the telescoping and creative telescoping problem in such difference rings.

关键词： Poles and towers Polynomials scientific computing Reduced instruction set computing Educational institutions Machinery

来源：评论

学校读者我要写书评

暂无评论

symbolic and numeric computation of symmetries for a class of Schrödinger Equations

Symbolic and numeric computation of symmetries for a class o...

引用

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

作者： Siyuan Deng Gregory Reid Department of Mathematics University of Western Ontario London Canada

An important and challenging computational problem is to identify and include the missing compatibility (integrability) conditions for general systems of partial differential equations. the inclusion of such missing conditions is executed by the application of differential-elimination algorithms. Differential equations arising during modeling generally contain both exactly known coefficients and coefficients known approximately from data. We focus on our recent work on approximate differential-elimination methods and in particular their application to the determination of approximate symmetries. We illustrate this with applications to a class of Schrödinger equations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：