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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

ContractCML - A Contract Aware Component Modeling Language

ContractCML - A Contract Aware Component Modeling Language

引用

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

作者： Vladiela Petrascu Dan Chiorean Dragos Petrascu Computer Science Department Babes Bolyai University Cluj-Napoca Romania

Providing software components with a four level contract specification - syntax, semantics, synchronization, quality of service - is important to their correct (re)use. the mandatory syntactic level is included by all current component models. Academic models also employ one of the others, but use different formalisms to represent it. through this paper, we propose an integrated approach for handling component contracts. We focus on introducing ContractCML (Contract Component Modeling Language), a domain specific modeling language that ensures the basis of our proposal.

关键词： Contracts Packaging Assembly Computer science Software quality Quality of service Proposals Model driven engineering Software algorithms scientific computing

来源：评论

学校读者我要写书评

暂无评论

Solving the Countdown Problem Using Automatic Composition of Semantic Web Services

Solving the Countdown Problem Using Automatic Composition of...

引用

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

作者： Andrei-Horia Mogos Adina Magda Florea University Politehnica of Bucharest Bucharest Romania

the automatic composition of semantic Web services is one of the challenging areas of the semantic Web services research. Mathematical semantic Web services are very useful in practice, however only a small number of related research results are reported. In this paper, we will show a dynamic, automated composition method for mathematical semantic Web services, using intelligent agents. the paper is focused on solving a kind of mathematical puzzle, called "the countdown problem". In addition, we will show a static, manual composition method for Web services.

关键词： Semantic Web Web services Intelligent agent Software systems scientific computing Software algorithms Software standards Robustness Navigation OWL

来源：评论

学校读者我要写书评

暂无评论

General Sum-Connectivity Index with a = 1 for Trees and Unicyclic Graphs with k Pendants

General Sum-Connectivity Index with a = 1 for Trees and Unic...

引用

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

作者： Rozica-Maria Tache Ioan Tomescu Faculty of Mathematics and Computer Science University of Bucharest Bucharest Romania

ISBN: (纸本)9781509004621

One of the newest molecular descriptors, the general sum-connectivity index of a graph G is defined as χ α (G) = Σ uvϵE(G) (d(u) + d(v))α, where d(u) denotes the degree of vertex u in G and is a real number. the aim of this paper is to determine the trees and the unicyclic graphs with k pendant vertices that maximize the general sum-connectivity index for α ≥ 1,with 2 ≤ k ≤ n for trees and 0 ≤ k ≤ n - 3 for unicyclic graphs.

关键词： Indexes scientific computing Mathematics Computer science Electronic mail Marine vehicles Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

A theory of Adaptable Contract-Based Service Composition

A Theory of Adaptable Contract-Based Service Composition

引用

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

作者： Giovanni Bernardi Michele Bugliesi Damiano Macedonio Sabina Rossi Dipartimento di Informatica Università CaE28099Foscari of Venice Italy

Service oriented architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a cost: the software architect must ensure that the off-the-shelf components interact safely and in ways that conform with the specification. We develop a new theory for adaptable service composition. the theory provides an effective framework for analyzing the conformance of contract-based service compositions, and for enforcing their compliance, in a uniform, formally elegant setting.

关键词： Contracts Filters Assembly Service oriented architecture Software algorithms scientific computing Computer architecture Costs Software safety Software design

来源：评论

学校读者我要写书评

暂无评论

Lambda Calculus with Regular Types

Lambda Calculus with Regular Types

引用

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

作者： Besik Dundua Mário Florido Temur Kutsia Institute of Applied Mathematics Tbilisi State University Department of Computer Science University of Porto Research Institute for Symbolic Computation Johannes Kepler University Linz

In this paper we introduce λ R : A foundational calculus for sequence processing with regular expression types. Its term language is the lambda calculus extended with sequences of terms and its types are regular expressions over simple types. We provide a flexible notion of subtyping based on the semantic notion of nominal interpretation of a type. then we prove that types are preserved by reduction (subject reduction), and that there exist no infinite reduction sequences starting at typed terms (strong normalization).

关键词： Calculus Semantics Hafnium XML Syntactics Grammar

来源：评论

学校读者我要写书评

暂无评论

On a Functional-Differential Equation from Price theory

On a Functional-Differential Equation from Price Theory

引用

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

作者： Anton S. Muresan Department of Statistics Forecasting and Mathematics Faculty of Economics and Business Administration Babeş-Bolyai University Cluj-Napoca Romania

In this paper we consider a functional-differential equation which appears in price theory and in the dynamics of economical systems. We give some new results about existence, uniqueness and data dependence of the solution of a problem which appears in conection with this functional-differential equation. these results are obtained by using Picard operator's technique and an abstract model for the steps method, due to the Professor Ioan A. Rus.

关键词： Fluctuations Biological system modeling Delay Economic forecasting Economic indicators Mathematics Differential equations scientific computing Statistics Red blood cells

来源：评论

学校读者我要写书评

暂无评论

A Grid Enabled Quantum Computer Simulator

A Grid Enabled Quantum Computer Simulator

引用

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

作者： Simona Caraiman Alexandru Archip Vasile Manta Computer Science Department Gheorghe Asachi Technical University of Iasi Iasi Romania

Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Grid systems are a good choice for simulating quantum algorithms, since they provide access to high-performance computer clusters. In this paper we present the design of a message passing parallel version of the quantum computer simulator, QCL, deployed as a grid service. After describing the architecture of our grid service and the parallelization strategy for the general single qubit operator, we present the performance measurements for some test cases, showing the speedups obtained.

关键词： Quantum computing Grid computing Computational modeling Computer simulation Clustering algorithms Message passing Concurrent computing Quantum cascade lasers Computer architecture Measurement

来源：评论

学校读者我要写书评

暂无评论

A Comparative Landscape Analysis of Fitness Functions for Search-Based Testing

A Comparative Landscape Analysis of Fitness Functions for Se...

引用

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

作者： Raluca Lefticaru Florentin Ipate Department of Computer Science and Mathematics University of Pitesti Pitesti Romania

Landscape analysis of fitness functions is an important topic. this paper makes an attempt to characterize the search problems associated with the fitness functions used in search-based testing, employing the following measures: diameter, autocorrelation and fitness distance correlation. In a previous work, a general form of objective functions for structural search-based software testing was tailored for state-based testing. A comparison is performed in this paper between the general fitness functions and some problem-specific fitness functions, taking into account their performance with different search methods.

关键词： Automatic testing Software testing Search methods Particle swarm optimization Search problems Genetic algorithms Simulated annealing Application software scientific computing Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：