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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Depth-first Algorithm to Reduce Graphs in Linear Time

A Depth-first Algorithm to Reduce Graphs in Linear Time

引用

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

作者： Miklos Bartha Miklos Kresz Department of Computer Science Memorial University of Newfoundland Saint John's NB Canada Faculty of Education University of Szeged Szeged Hungary

A redex in a graph G is a triple r = (u, c, v) of distinct vertices that determine a 2-star. Shrinking r means deleting the center c and merging u with v into one vertex. Reduction of G entails shrinking all of its redexes in a recursive way, and, at the same time, deleting all loops that are created during this process. It is shown that reduction can be implemented in O(m) time, where m is the number of edges in G.

关键词： Solitons Automata scientific computing Computer science Computer science education Merging Tree graphs Gain

来源：评论

学校读者我要写书评

暂无评论

m-Hilbert Polynomial and Arbitrariness of the General Solution of Partial Differential Equations

m-Hilbert Polynomial and Arbitrariness of the General Soluti...

引用

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

作者： Qi Ding Hongqing Zhang School of Mathematical Science Dalian University of Technology Dalian China

Using the framework of formal theory of partial differential equations, we consider a method of computation of the m-Hilbert polynomial (i.e. Hilbert polynomial with multivariable), which generalizes the Seiler's theorem of Hilbert polynomial with single variable. Next we present an approach to compute the number of arbitrary functions of positive differential order in the general solution, and give a formally well-posed initial problem. Finally,as applications the Maxwell equations and weakly over determined equations are considered.

关键词： Polynomials Partial differential equations Differential equations Maxwell equations scientific computing Hilbert space Algebra Physics

来源：评论

学校读者我要写书评

暂无评论

On the Existence of Complete Disjoint NP-Pairs

On the Existence of Complete Disjoint NP-Pairs

引用

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

作者： Olaf Beyersdorff Institut für Informatik Humboldt-Universität zu Berlin Berlin Germany

Disjoint NP-pairs are an interesting model of computation with important applications in cryptography and proof complexity. the question whether there exists a complete disjoint NP-pair was posed by Razborov in 1994 and is one of the most important problems in the field. In this paper we prove that there exists a many-one hard disjoint NP-pair which is computed with access to a very weak oracle (a tally NP-oracle).In addition, we exhibit candidates for complete NP-pairs and apply our results to a recent line of research on the construction of hard tautologies from pseudorandom generators.

关键词： Polynomials Sufficient conditions scientific computing Computational modeling Computer applications Security Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Sparse Matrix Computations Using the Quadtree Storage Format

Sparse Matrix Computations Using the Quadtree Storage Format

引用

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

作者： Ivan Simecek Department of Computer Science and Engineering Czech Technical University Prague Czech Republic

Computations with sparse matrices are widespread in scientific projects. Used data format affects strongly the performance. Efficient formats for storing sparse matrices are still under development, since the computation using widely-used formats (like XY or CSR) is slow and specialized formats (like SPARSITY or CARB) have a large transformation *** this paper, we represent some improvements to the quadtree storage format. We also compare the performance during the execution of some basic routines from the linear algebra using widely-used formats and the quadtree storage format.

关键词： Sparse matrices Linear algebra Tree graphs Cache storage scientific computing Computer science Acceleration Registers Computer architecture Tree data structures

来源：评论

学校读者我要写书评

暂无评论

Factorizations of Regular Hedge Languages

Factorizations of Regular Hedge Languages

引用

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

作者： Mircea Marin Adrian Craciun Department of Computer Science University of Tsukuba Tsukuba Japan Department of Computer Science West University of Timişoara Timisoara Romania

Regular hedge languages are an extension of regular tree languages that received renewed attention since their recognition as a formal model of XML schemata. they share several properties with regular languages, but their study is more involved because we need to analyze regularities of sequences of trees instead of words. We show that one shared property is the existence of only finitely many language factors and the possibility to compute and arrange them in a factor matrix with some remarkable properties. We outline an algorithm for the computation of the factor matrix and indicate an application of the factor matrix of an RHL to the solution of a concrete language reconstruction problem.

关键词： XML Computer science Concrete Specification languages scientific computing Chromium Automata Testing

来源：评论

学校读者我要写书评

暂无评论

Simplification and Generalization in CIRC

Simplification and Generalization in CIRC

引用

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

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

CIRC is an automated theorem prover based on the circular coinduction principle. the tool is used for the verification of programs, behavioral equivalence checking, and proving properties over infinite data structures. In this paper we present two extensions of CIRC that handle the case when the prover indicates an infinite execution for a certain goal. the first extension involves goal simplification rules and a procedure for checking that the new execution is indeed a proof, while the second one refers to finding and proving a generalization of the goal. Each of the extensions is presented based on a case study: Binary Process Algebra (BPA) for checking the proof correctness and Streams for using generalization.

关键词： Computer science Humans scientific computing Data structures Algebra Application software

来源：评论

学校读者我要写书评

暂无评论

Using a fUML Action Language to Construct UML Models

Using a fUML Action Language to Construct UML Models

引用

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

作者： Codrut Lucian Lazar Ioan Lazar Bazil Parv Simona Motogna Istvan Gergely Czibula Dept. of Comput. Sci. Babes-Bolyai Univ. Cluj-Napoca Romania Department of Computer Science Babe-Bolyai University Cluj-Napoca Romania

In this paper we introduce a fUML based action language and describe its concrete syntax. the action language uses only elements allowed by the fUML standard for its abstract syntax. the concrete syntax resembles the syntax of existing structured programming languages, with some elements inspired by OCL. the action language is part of the ComDeValCo framework and we are using it to model the functionality of the components, to simulate the execution of the models and to test the models.

关键词： Unified modeling language Concrete Computer languages Packaging Testing Java scientific computing Computer science Computational modeling DSL

来源：评论

学校读者我要写书评

暂无评论

Superfluous S-polynomials in Strategy-Independent Groebner Bases

Superfluous S-polynomials in Strategy-Independent Groebner B...

引用

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

作者： Grant Olney Passmore Leonardo de Moura LFCS University of Edinburgh Edinburgh UK Microsoft Research Limited Redmond WA USA

Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Groebner basis procedures and prove the correctness of two classical criteria for recognising superfluous S-polynomials, Buchberger's criteria 1 and 2, w.r.t. arbitrary fair and correct basis construction strategies. To do so, we develop a general method for proving the strategy-independent correctness of superfluous S-polynomial criteria which seems to be quite powerful. We also derive a new superfluous S-polynomial criterion which is a generalisation of Buchberger-1 and is proved to be correct strategy-independently.

关键词： Polynomials Algebra Equations Inference algorithms scientific computing Commutation Machinery Sufficient conditions Crystallization Quantum computing

来源：评论

学校读者我要写书评

暂无评论

Solving Nonsmooth Interval Equations with Slopes

Solving Nonsmooth Interval Equations with Slopes

引用

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

作者： Rongfen Lin Hao Jiang Lizhi Cheng School of Science National University of Defense Technology Changsha China

In this paper, the problem of finding all zeros of an continuously interval function in a given interval is considered. A new method for solving this problem is proposed. It is based on the idea of isolating the endpoints of interval zeros and the technique of interval slopes. We develop the theory of the new method and apply it on a set of smooth functions and a set of nonsmooth functions respectively. In case of smooth functions, We compare the new method to a similar one from [6]. And the numerical results show the efficiency of our new *** case of nonsmooth functions, we can gain the reliable results too. As far as know, the method we proposed is the first one which could solve the nonsmooth interval functions.

关键词： Newton method Nonlinear equations scientific computing Differential equations Transforms

来源：评论

学校读者我要写书评

暂无评论

Finding the Solutions of Nonlinear Equation Systems from an Interval

Finding the Solutions of Nonlinear Equation Systems from an ...

引用

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

作者： Cristian Cira Mihai Fac. of Exact Sci. Aurel Vlaicu Univ. of Arad Arad Romania

the paper describes an algorithm that determines the solutions of a n-dimensional nonlinear equation system within a given interval. the result is based on Semenov algorithm that isolates the solutions and improves upon it by introducing Kantorovich existence criterion. In Semenov algorithm the existence of the solution is decided by applying Newton method on each interval containing at most one solution. this article improves and completes the Semenov algorithm by determining the start iteration for each solution. With the computed start iteration the Newton method is applied to determine the solution with the precision e. the Kantorovich error function E(k) is also computed for each iteration k. the paper contains numerical experiments.

关键词： Nonlinear equations Newton method Iterative methods scientific computing Convergence of numerical methods Jacobian matrices Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：