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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Peer-to-Peer Wikis: Replication of Highly Dynamic Content on XWiki

Peer-to-Peer Wikis: Replication of Highly Dynamic Content on...

引用

9th international symposium on symbolic and numeric algorithms for scientific computing

作者： Dumitriu, Sergiu Buraga, Sabin Corneliu Alexandru Ioan Cuza Univ Iasi Romania

ISBN: (纸本)9780769530789

After identifying certain usage scenarios for a P2P wiki, we propose a generic model regarding a P2P wiki platform, that can be configured to adapt to several usage scenarios, from massively distributed wikis to small mobile collaborative tools. the platform is built as a XWiki plugin collection and consists of a set of loosely coupled components providing services to be used in the context of grid computing.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Optimal Capacity Allocation for executing MapReduce Jobs in Cloud Systems 16

Optimal Capacity Allocation for executing MapReduce Jobs in ...

引用

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

作者： Malekimajd, M. Rizzi, A. M. Ardagna, D. Ciavotta, M. Passacantando, M. Movaghar, A. Sharif Univ Technol Dept Comp Engn Tehran Iran Politecn Milan Dipartimento Elettron Informaz & Bioingn I-20133 Milan Italy Univ Pisa Dipartimento Informat Pisa Italy

ISBN: (纸本)9781479984480

Nowadays, analyzing large amount of data is of paramount importance for many companies. Big data and business intelligence applications are facilitated by the MapReduce programming model while, at infrastructural layer, cloud computing provides flexible and cost effective solutions for allocating on demand large clusters. Capacity allocation in such systems is a key challenge to providing performance for MapReduce jobs and minimize cloud resource cost. the contribution of this paper is twofold: (i) we formulate a linear programming model able to minimize cloud resources cost and job rejection penalties for the execution of jobs of multiple classes with (soft) deadline guarantees, (ii) we provide new upper and lower bounds for MapReduce job execution time in shared Hadoop clusters. Moreover, our solutions are validated by a large set of experiments. We demonstrate that our method is able to determine the global optimal solution for systems including up to 1000 user classes in less than 0.5 seconds. Moreover, the execution time of MapReduce jobs are within 19% of our upper bounds on average.

关键词： Big Data cloud computing data analysis linear programming parallel programming pattern clustering resource allocation MapReduce job execution time MapReduce programming model big data applications business intelligence applications capacity allocation cloud resource cost minimization cloud systems infrastructural layer job rejection linear programming model optimal capacity allocation shared Hadoop clusters Bismuth Mathematical model Optimization Resource management Scalability Silicon Upper bound Capacity Allocation Cloud computing MapReduce Performance bounds Cloud computing big data linear programming models management of resources Upper bound jobs Parallel programming Data analysis Scalability bismuth Cluster Analysis linear programming Resource utilization Mathematical Model Big data applications

来源：评论

学校读者我要写书评

暂无评论

symbolic representations of biological oscillations

Symbolic representations of biological oscillations

引用

7th international symposium on symbolic and numeric algorithms for scientific computing

作者： Bianco, L Manca, V Zorzan, S Univ Verona Dept Comp Sci I-37134 Verona Italy

ISBN: (纸本)0769524532

the investigation of biological dynamics involves many interesting aspects such as abstraction, modelling and simulation, but a very important aspect to consider is the representation of such dynamics. A correct, flexible and formal representation mechanism of interesting behaviours is the right starting point for all successive modelling steps and it can be helpful in capturing the essence of the system under investigation. In particular, provided a formal representation of the relevant traits of biological systems behaviours, the application of P systems, to their modelling can become more and more fruitful. For this reason, here we present a formalism allowing us to represent biological oscillations by means of strings composed by parametric words that we call beats.

关键词： Natural sciences computing

来源：评论

学校读者我要写书评

暂无评论

DNA computing model for the minimum spanning tree problem

DNA computing model for the minimum spanning tree problem

引用

8th international symposium on symbolic and numeric algorithms for scientific computing

作者： Han, Aili Zhu, Daming Shandong Univ Weihai Dept Comp Sci & Technol Weihai 264209 Peoples R China Shandong Univ Sch Comp Sci & Technol Jinan 250061 Peoples R China

ISBN: (纸本)9780769527406

We have devised a DNA encoding method and a corresponding DNA algorithm for the minimum spanning tree problem, an instance of optimization problems on weighted graphs. In order to find out the minimum spanning trees of a weighted graph G= (V,E,W), 9) by means of molecular biology techniques, we encode each vertex v(i)is an element of V using one recognition code of length l, l=max{[log(4)n],6};we encode each edge e(ij)is an element of E using two DNA strands of length 2p=2max{w(ij), l};for any two adjacent edges e(ij)e(jk), we add one DNA strand s(aijk) of length w(ij)+w(jk) as an additional code. We also presented a DNA algorithm for the minimum spanning tree problem based on the proposed DNA encoding method, in which we firstly obtain the Euler cycle corresponding to the minimum spanning tree by means of the molecular biology techniques, and then the Euler cycle is converted to the minimum spanning tree. Our work provides further evidence for the ability of DNA computing to solve numerical optimization problems.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

computing the Lowest-order Element of a Multivariate Elimination Ideal by Using Remainder Sequences 20

Computing the Lowest-order Element of a Multivariate Elimina...

引用

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

作者： Sasaki, Tateaki Inaba, Daiju Univ Tsukuba Tsukuba 1-1-1 Ibaraki 3058571 Japan Math Certificat Inst Japan Ueno 5-1-1 Tokyo 1100005 Japan

ISBN: (纸本)9781728106250

Given a set of m +1 multivariate polynomials, with m >= 2, in main variables x(1), ... , x(m) and sub-variables u(1), ... , u(n), we can usually eliminate x(1), ... , x(m) and obtain a polynomial in u(1), ... , u(n) only. there are basically two methods to perform this elimination. One is the so-called resultant method and the other is the Grobner basis method. the Grobner basis method gives the lowest-order element (S) over cap (u) of the elimination ideal, where (u) = (u(1), ... , u(n)), but it is often very slow. the resultant method is quite fast, but the resulting polynomial R(u) often contains many more terms than (S) over cap (u). In this paper, we present a simple method of computing (S) over cap (u) by the repeated computation of PRSs (polynomial remainder sequences). the idea is to compute PRSs by changing their arguments systematically and obtain polynomials R-1(u), ... , R-l(u), l >= 2, in the sub-variables only. Let (S) over bar (u) be the GCD of R-1, ... , R-l. then, our main theorem asserts that (S) over bar (u) is a multiple of (S) over cap (u): (S) over bar (u) = (e) over tilde (u)(S) over cap (u). We call (e) over tilde (u) the extraneous factor and it often consists of a small number of terms. We present three conditions and one sub-method to remove (e) over tilde (u) from (S) over bar (u).

关键词： elimination ideal of multivariate polynomial system lowest-order element of elimination ideal variable elimination of multivariate polynomial system resultant method Grobner basis method multivariate polynomial remainder sequence

来源：评论

学校读者我要写书评

暂无评论

Automatic and Reliable Distribution of Data in Grids over Globus Toolkit

Automatic and Reliable Distribution of Data in Grids over Gl...

引用

9th international symposium on symbolic and numeric algorithms for scientific computing

作者： Colesa, Adrian Pop, Teodor Ignat, Iosif Ardelean, Cosmin Tech Univ Cluj Napoca Dept Comp Sci Cluj Napoca Romania

ISBN: (纸本)9780769530789

this paper presents a strategy to develop an infrastructure for reliable distribution of data in Grids. We used the data replication services of Globus Toolkit 4.0, but extended their functionality in order to improve the reliabilily of the overall data distribution in different failure scenarios. Our solution makes the data distribution process automatic, based on distribution patterns the user provides when he configures the distribution system built on our infrastructure. We implemented the proposed solution, tested its functionality and measured its efficiency

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

A Distributed Algorithm for Critical Area Detection in Satellite Imagery

A Distributed Algorithm for Critical Area Detection in Satel...

引用

10th international symposium on symbolic and numeric algorithms for scientific computing

作者： Alecsandrescu, Razvan Pop, Florin Cristea, Valentin Univ Politehn Bucuresti Fac Automat & Comp Sci Bucharest Romania

ISBN: (纸本)9780769535234

this paper presents a distributed algorithm for critical area detection in satellite imagery. the detection of critical area is very important in natural disaster detection and control. the algorithm uses the distributed change detection methods for multiple spectral bands in satellite images and combines changes which have appeared during a period of time. the result shows a critical area for analyzed time interval. the algorithm is distributed for support a large amount of data. the distributed approach shows a decrease in processing time with the increase of the number of workers. the presented algorithm represents a component from MedioGRID system, which implemented a real-time satellite image processing system for extracting relevant environmental and meteorological parameters on Grid systems. the critical area detection application will be integrated in Grid environments.

关键词： Satellite Imagery Change Detection Critical Area Detection Grid computing MedioGRID

来源：评论

学校读者我要写书评

暂无评论

A direct products of fields approach to comprehensive Grobner bases over finite fields

A direct products of fields approach to comprehensive Grobne...

引用

7th international symposium on symbolic and numeric algorithms for scientific computing

作者： Nabeshima, K Johannes Kepler Univ Res Inst Symbol Computat A-4040 Linz Austria

ISBN: (纸本)0769524532

In this paper we describe comprehensive Grobner bases over finite fields by direct product of fields. In general, representations of comprehensive Grobner bases have some conditions on parameters. However in finite fields we can construct comprehensive Grobner bases without conditions by the theory of von Neumann regular rings. Our comprehensive Grobner bases are defined as Grobner bases in polynomial rings over commutative von Neumann regular rings, hence our comprehensive Grobner bases have some nice properties. Our method is different from the methods of Weispfenning (CGB, CCGB), Monies (DisPGB), Sato and Suzuki (ACGB).

关键词： Natural sciences computing

来源：评论

学校读者我要写书评

暂无评论

Colored petri nets state-space reduction via symbolic execution

Colored petri nets state-space reduction via symbolic execut...

引用

7th international symposium on symbolic and numeric algorithms for scientific computing

作者： Capra, L Univ Milan Dip Informat & Comunicaz I-20135 Milan Italy

ISBN: (纸本)0769524532

State-space reduction techniques for distributed discrete-event systems are normally based on detection of behavioral equivalences or symmetries. Well-Formed Nets (WN) are a Colored Petri Net flavor allowing the direct construction of a quotient graph, the symbolic Reachability Graph (SRG), that captures symmetries suitably encoded in the WN color annotations, and holds the same information as the ordinary reachability graph. Like all those approaches based on static (global) symmetries, however the SRG is not effective in many real cases. In this paper a new quotient graph for colored PNs matching an extended WN-like syntax is introduced. the technique, which relies on a simple mapping of color domains into numerical domains, makes use of linear constraints to perform a sort of symbolic execution. We compare it with a recently presented approach exploiting local symmetries. the model of an asymmetric distributed algorithm is used as comparison term.

关键词： high-level Petri nets quotient graphs symmetries linear constraints

来源：评论

学校读者我要写书评

暂无评论

Checking RSC criteria for extended dixon resultant by interpolation method

Checking RSC criteria for extended dixon resultant by interp...

引用

7th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2005

作者： Yong, Feng Yaohui, Li Laboratory for Automated Reasoning and Programming Chengdu Institute of Computer Applications Academia Sinica 610041 Chengdu China

ISBN: (纸本)0769524532

Dixon Resultant method can eliminate many variables simultaneously. It is often used to solve a system of polynomial equations. However, the Dixon matrix is often singular, and the Dixon Resultant vanishes identically yielding no information about solutions for many algebraic and geometry problems. So, Extended Dixon Method (KSY method) was proposed for the case when the Dixon matrix is singular, but satisfies RSC criteria. However, checking RSC criteria and extracting a maximum nonsingular submatrix of Dixon matrix are symbolic methods, which restrict Extended Dixon Method to be applied in more fields. In this paper, based on polynomial interpolation theory, an efficient numerical algorithm is developed to check RSC criteria and to extract a maximum nonsingular submatrix of singular Dixon matrix. Combining with interpolation methods for computing determinant, our method can solve larger scale problems. Furthermore, our method can be carried out parallel. © 2005 IEEE.

关键词： Natural sciences computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：