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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

580 篇 会议
6 篇 期刊文献
4 册 图书

馆藏范围

590 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

191 篇 工学
- 188 篇 计算机科学与技术...
- 116 篇 电气工程
- 33 篇 软件工程
- 7 篇 控制科学与工程
- 4 篇 信息与通信工程
- 2 篇 电子科学与技术（可...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 安全科学与工程
69 篇 理学
- 68 篇 数学
- 3 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
20 篇 经济学
- 18 篇 理论经济学
- 2 篇 应用经济学
15 篇 管理学
- 11 篇 管理科学与工程(可...
- 10 篇 工商管理
- 4 篇 图书情报与档案管...
1 篇 法学
- 1 篇 社会学

主题

289 篇 scientific compu...
91 篇 computer science
62 篇 cloud computing
52 篇 computational mo...
37 篇 polynomials
34 篇 algorithm design...
29 篇 algebra
27 篇 computer archite...
25 篇 testing
24 篇 mathematics
22 篇 software algorit...
22 篇 complexity theor...
22 篇 standards
21 篇 electronic mail
20 篇 grid computing
20 篇 monitoring
19 篇 semantics
18 篇 application soft...
18 篇 distributed comp...
17 篇 concurrent compu...

机构

11 篇 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 篇 davenport james ...
5 篇 dorel lucanu
5 篇 ardagna danilo
5 篇 ciprian dobre
5 篇 ruxandra stoean
5 篇 stephen m. watt
5 篇 florin pop

语言

589 篇 英文
1 篇 中文

检索条件"任意字段=9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing"

共 590 条记录，以下是191-200 订阅

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

详细简洁

排序：

Scalable and fault tolerant monitoring of security parameters in the cloud 17

Scalable and fault tolerant monitoring of security parameter...

引用

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

作者： Irimie, Bogdan-Constantin Petcu, Dana Inst E Austria Timisoara Timisoara Romania West Univ Timisoara Dept Comp Sci Timisoara Romania

ISBN: (纸本)9781509004614

Monitoring cloud resources is an essential part of cloud computing, and although some effort has been made in this direction, monitoring security parameters is still an open issue because of the large number and types of resources available in a multi tenant environment. In this paper we propose a distributed monitoring system that is able to monitor, filter and store security parameters of network hosts. the proposed system is decentralized, fault tolerant and can run scanning jobs in parallel, those three characteristics making it a perfect candidate for monitoring resources in a cloud environment. the proposed monitoring system was validated by a series of tests that demonstrated it's scalability. All the empirical results were analysed and conclusions were formulated based on the observed properties.

关键词： Cloud computing Distributed Systems Security Monitoring

来源：评论

学校读者我要写书评

暂无评论

Parallel heuristics for systems of equations preconditioning 18

Parallel heuristics for systems of equations preconditioning

引用

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

作者： Mafteiu-Scai, Liviu Octavian Cornigeanu, Calin Alexandru West Univ Timisoara Comp Sci Dept Timisoara Romania

ISBN: (纸本)9781509057078

this paper proposes two parallel hybrid heuristics aiming for the reduction of the average bandwidth of sparse matrices, process used in systems of equations preconditioning. Based on a direct processing of the matrix, the first method combines a heuristic inspired from the laws of physics, with a greedy selection of rows/columns to be interchanged. the second one improves the previous heuristic through the use of an exact formula for determining the most favorable interchanges. Experimental results obtained on an IBM Blue Gene /P supercomputer illustrate the fact that the proposed parallel heuristics lead to better results, with respect to time efficiency, speedup, efficiency and solution.

关键词： nature inspired heuristics preconditioning systems of equations parallel computing average bandwidth

来源：评论

学校读者我要写书评

暂无评论

Simple Relation between the Lowest-Order Element of Ideal 〈G,H〉 and the Last Element of Polynomial Remainder Sequence

Simple Relation between the Lowest-Order Element of Ideal 〈...

引用

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

作者： Tateaki Sasaki Daiju Inaba Professor emeritus University of Tsukuba Ibaraki Japan The Mathematics Certification Institute of Japan Tokyo Japan

ISBN: (纸本)9781538626276

Let G and H be relatively prime polynomials in K[x,u], where K is a number field and (u) = (u 1 , . . . , u ℓ ), with ℓ ≥ 2. Let GB(G,H) be the reduced Gröbner basis of ideal hG,Hi, w.r.t. the elimination order for x. Let r̂ be the lowest-order element of GB(G,H), and Ã, B ∈ K[x,u] be the cofactors of r̂: ÃG+ e BH = r̂. Let PRS(G,H) be the polynomial remainder sequence w.r.t. x, with initial polynomials G and H. Let Pk ∈ K[u] be the last element of PRS(G,H), and A k , B k ∈ K[x,u] be cofactors of P k : A k G + B k H = P k . Ak and B k satisfy degree conditions: deg x (Ak) x(H) and deg x (B k ) x(G), while e Ã and B in general do not. computing Â and B by reducing the degrees w.r.t. x, of Ã and B, respectively, and by normalizing Pk suitably, we show that (P k ,A k ,B k ) = c ( r̂, Â, B), where (P,A,B) denotes a tuple and c ∈ K. We then present a new method for solving the multivariate Diophantine equation φ G + ψH = F for given F ∈ K[x,u] and unknowns φ , ψ ∈ K(u)[x]. Furthermore, we show a new method for solving the ideal-membership problem for 〈G,H〉, without computing any Gröbner basis.

关键词： scientific computing Algebra Mathematical model Complexity theory Computational modeling Analytical models

来源：评论

学校读者我要写书评

暂无评论

A Multi-agent Architecture for Ontology-based Diagnosis of Mental Disorders 17

A Multi-agent Architecture for Ontology-based Diagnosis of M...

引用

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

作者： Ivascu, Todor Manate, Bogdan Negru, Viorel West Univ Timisoara Dept Comp Sci Fac Math & Informat Bvd V Parvan 4 Timisoara Romania Inst E Austria Timisoara Bvd V Parvan 4 Timisoara Romania

ISBN: (纸本)9781509004614

this paper presents a Multi-agent system that facilitates the remote monitoring of the elderly patients which are susceptible to mental disorder diseases. In order to find early signs of health condition depreciation we have assessed four of the most common mental disorder diseases to find which kind of sensors can detect specific symptoms with the main purpose of creating an early warning system. the diagnosis component is based on an ontology that defines the relations between sensors, symptoms and diseases. Based on these relationships a specialized agent can inform the medical personnel about the detected symptoms.

关键词： Cloud computing Multi-agent architecture e-Health Ontology-based diagnosis Internet of things

来源：评论

学校读者我要写书评

暂无评论

computing Boolean Border Bases 18

Computing Boolean Border Bases

引用

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

作者： Horacek, Jan Kreuzer, Martin Ekossono, Ange-Salome Messeng Univ Passau Fac Informat & Math D-94030 Passau Germany

ISBN: (纸本)9781509057078

Given a 0-dimensional polynomial system in a polynomial ring over F-2 having only. F-2-rational solutions, we optimize the Border Basis Algorithm (BBA) for solving this system by introducing a Boolean BBA. this algorithm is further improved by optimizing the linear algebra steps. We discuss ways to combine it with SAT solvers, optimized methods for performing the combinatorial steps involved in the algorithm, and various approaches to implement the linear algebra steps. Based on our C++ implementation, we provide some timings to compare sparse and dense representations of the coefficient matrices and to Grobner basis methods.

关键词： boolean polynomial border basis SAT solver small scale AES

来源：评论

学校读者我要写书评

暂无评论

Measuring and Comparing the Scaling Behaviour of a High-Performance CFD Code on Different Supercomputing Infrastructures 17

Measuring and Comparing the Scaling Behaviour of a High-Perf...

引用

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

作者： Frisch, Jerome Mundani, Ralf-Peter Rhein Westfal TH Aachen Inst Energy Efficiency & Sustainable Bldg E3D D-52074 Aachen Germany Tech Univ Munich Chair Computat Engn D-80333 Munich Germany

ISBN: (纸本)9781509004614

Parallel code design is a challenging task especially when addressing petascale systems for massive parallel processing (MPP), i.e. parallel computations on several hundreds of thousands of cores. An in-house computational fluid dynamics code, developed by our group, was designed for such high-fidelity runs in order to exhibit excellent scalability values. Basis for this code is an adaptive hierarchical data structure together with an efficient communication and (numerical) computation scheme that supports MPP. For a detailled scalability analysis, we performed several experiments on two of Germany's national supercomputers up to 140,000 processes. In this paper, we will show the results of those experiments and discuss any bottlenecks that could be observed while solving engineering-based problems such as porous media flows or thermal comfort assessments for problem sizes up to several hundred billion degrees of freedom.

关键词： high-performance computing adaptive data structure multi-grid-like solver concept speed-up measurements

来源：评论

学校读者我要写书评

暂无评论

Coverability Analysis of Time Basic Petri Nets with Non-Urgent Behavior 18

Coverability Analysis of Time Basic Petri Nets with Non-Urge...

引用

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

作者： Camilli, Matteo Bellettini, Carlo Capra, Lorenzo Monga, Mattia Univ Milan Dept Comp Sci Milan Italy

ISBN: (纸本)9781509057078

Time Basic Petri nets are an expressive extension of Petri nets, suitable to model real-time systems. this paper introduces a coverability analysis technique to cope with structurally unbounded Time Basic Petri net models exhibiting non-urgent behavior: i.e., models in which transitions may choose to do not fire and let time pass, even if this could lead to transition disabling. the approach we present exploits the identification of anonymous temporal information, that is the possibility of erasing timestamps associated with specific tokens without compromising the correctness of model's temporal evolution. In particular, we extend the classical Karp-Miller coverability algorithm in two ways: first, we adapt the acceleration function to deal with symbolic states and to identify unboundedness due to time anonymous tokens;second, we employ an aggressive pruning strategy to remove included/ covered portions of the reachability tree during exploration.

关键词： real-time systems Time Basic Petri nets time constraints infinite-states systems reachability problems coverability analysis symbolic state space exploration

来源：评论

学校读者我要写书评

暂无评论

symbolic Derivation of Mean-Field PDEs from Lattice-Based Models 17

Symbolic Derivation of Mean-Field PDEs from Lattice-Based Mo...

引用

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

作者： Koutschan, Christoph Ranetbauer, Helene Regensburger, Georg Wolfram, Marie-therese Austrian Acad Sci OAW Johann Radon Inst Computat & Appl Math RICAM Altenberger Str 69 A-4040 Linz Austria

ISBN: (纸本)9781509004614

Transportation processes, which play a prominent role in the life and social sciences, are typically described by discrete models on lattices. For studying their dynamics a continuous formulation of the problem via partial differential equations (PDE) is employed. In this paper we propose a symbolic computation approach to derive mean-field PDEs from a lattice-based model. We start with the microscopic equations, which state the probability to find a particle at a given lattice site. then the PDEs are formally derived by Taylor expansions of the probability densities and by passing to an appropriate limit as the time steps and the distances between lattice sites tend to zero. We present an implementation in a computer algebra system that performs this transition for a general class of models. In order to rewrite the mean-field PDEs in a conservative formulation, we adapt and implement symbolic integration methods that can handle unspecified functions in several variables. To illustrate our approach, we consider an application in crowd motion analysis where the dynamics of bidirectional flows are studied. However, the presented approach can be applied to various transportation processes of multiple species with variable size in any dimension, for example, to confirm several proposed mean-field models for cell motility.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

A Combined Analytical Modeling Machine Learning Approach for Performance Prediction of MapReduce Jobs in Cloud Environment 18

A Combined Analytical Modeling Machine Learning Approach for...

引用

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

作者： Ataie, Ehsan Gianniti, Eugenio Ardagna, Danilo Movaghar, Ali Sharif Univ Technol Dept Comp Engn Tehran Iran Politecn Milan Dipartimento Elettron Informaz & Bioingn Milan Italy

ISBN: (纸本)9781509057078

Nowadays MapReduce and its open source implementation, Apache Hadoop, are the most widespread solutions for handling massive dataset on clusters of commodity hardware. At the expense of a somewhat reduced performance in comparison to HPC technologies, the MapReduce framework provides fault tolerance and automatic parallelization without any efforts by developers. Since in many cases Hadoop is adopted to support business critical activities, it is often important to predict with fair confidence the execution time of submitted jobs, for instance when SLAs are established with end-users. In this work, we propose and validate a hybrid approach exploiting both queuing networks and support vector regression, in order to achieve a good accuracy without too many costly experiments on a real setup. the experimental results show how the proposed approach attains a 21% improvement in accuracy over applying machine learning techniques without any support from analytical models.

关键词： Analytical performance modeling machine learning cloud computing MapReduce

来源：评论

学校读者我要写书评

暂无评论

Continuation Semantics for Dynamic Hierarchical Systems 17

Continuation Semantics for Dynamic Hierarchical Systems

引用

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

作者： Ciobanu, Gabriel Todoran, Eneia Nicolae Romanian Acad Inst Comp Sci Iasi Romania Tech Univ Cluj Napoca Dept Comp Sci Cluj Napoca Romania

ISBN: (纸本)9781509004614

We present a denotational semantics designed with metric spaces and continuations for a simple concurrent language L-MB embodying a representative set of features encountered in membrane computing. L-MB is a multiset rewriting language. In L-MB multisets of objects are encapsulated in hierarchical structures of compartments, or regions, delimited by membranes. the behaviour of each membrane is specified by means of multiset rewriting rules. the semantics of parallel composition in L-MB is based on the concept of maximal parallelism. Computations proceed according to the multiset rewriting rules, nondeterministically choosing the rules and the objects. Membranes can be grouped into classes based on the rewriting rules that they encapsulate;L-MB also provides a primitive for membrane creation, or instantiation. In this sense, L-MB is similar to an object oriented language. We use continuations and a powerdomain construction to represent nondeterministic behavior. An element of a powerdomain is a collection of sequences of observables representing dynamic membrane structures. Our continuation semantics describes in a compositional manner the behavior of an L-MB program as a dynamic hierarchical system. As far as we know, this is the first paper that presents a metric denotational semantics for the combination of features embodied in L-MB.

关键词： metric semantics continuations parallel multiset rewriting dynamic hierarchical system membrane computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共59页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：