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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Evaluating Weighted Round Robin Load Balancing for Cloud Web Services

Evaluating Weighted Round Robin Load Balancing for Cloud Web...

引用

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

作者： Weikun Wang Giuliano Casale Department of Computing Imperial College London UK

Weighted round robin load balancing is a common routing policy offered in cloud load balancers. However, there is a lack of effective mechanisms to decide the weights assigned to each server to achieve an overall optimal revenue of the system. In this paper, we first experimentally explore the relation between probabilistic routing and weighted round robin load balancing policies. From the experiment a similar behavior is found between these two policies, which makes it possible to assign the weights according to the routing probability estimated from queueing theoretic heuristic and optimization algorithms studied in the literature. We focus in particular on algorithms based on closed queueing networks for multi-class workloads, which can be used to describe application with service level agreements differentiated across users. We also compare the efficiency of queueing theoretic methods with simple heuristics that do not require to specify a stochastic model of the application. Results indicate that queueing theoretical algorithms yield significantly better results than routings proportional to the VM capacity with respect to throughput maximization.

关键词： Servers Load management Routing Round robin Heuristic algorithms Optimization Monitoring

来源：评论

学校读者我要写书评

暂无评论

A Distributed File System over Heterogeneous SaaS Storage Platforms

A Distributed File System over Heterogeneous SaaS Storage Pl...

引用

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

作者： Marco Scavuzzo Politecnico di Milano DEIB Milano Italy

Nowadays, thanks to the massive usage of the Cloud, different providers offer storage as a service solutions. Each of these solutions is characterized by different storage capacity and features. they are also offered according to various business models, typically, users can choose between free plans (with a limited amount of space) and paid plans. Free plans users, when the storage capacity lowers, tend to subscribe to new free plans from other providers, thus increasing the so called data fragmentation. this phenomenon heavily increases the file management complexity. this paper proposes a solution to the data fragmentation problem, by describing an innovative approach which allows to deploy a distributed file system on top of different SaaS storage accounts, offered by different providers. this approach, not only lowers the complexity of data management by providing a single transparent storage solution to the user, but it is also able to provide features like full-text search, file classification and categorization, data analytics (MapReduce) on top of these SaaS storage accounts. Furthermore, this approach proposes a new way to address data privacy and security issues, typically connected to SaaS storage accounts.

关键词： File systems Cloud computing Security Data privacy Protocols Distributed databases Memory

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 12th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2010

Proceedings - 12th International Symposium on Symbolic and N...

引用

12th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2010

ISBN: (纸本)9780769543246

the proceedings contain 83 papers. the topics discussed include: mathematical and computational mistakes and failures as a source of creativity;automatic improvements of Wallis' inequality;on the mathematics of mathematical handwriting recognition;a symbolic-numeric algorithm for computing the Alexander polynomial of a plane curve singularity;symbolic-numeric cooperation in an open science project;on BLAS operations with recursively stored sparse matrices;on the usage of 16 bit indices in recursively stored sparse matrices;an x-coordinate point compression method for elliptic curves over Fp;abstract domains for constraint programming, with the example of octagons;a parallel algorithm for dot product over word-size finite field using floating-point arithmetic;numerical solutions for a class of backward stochastic differential equations;maximum likelihood estimation algorithm evaluation for wireless sensor networks;and translating regular expression matching into transducers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parallel data acquisition for visualization of very large sparse matrices

Parallel data acquisition for visualization of very large sp...

引用

15th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2013

作者： Langr, Daniel Šimeček, Ivan Tvrdík, Pavel Dytrych, Tomáš Czech Technical University in Prague Faculty of Information Technology Thákurova 9 160 00 Praha Czech Republic Louisiana State University Department of Physics and Astronomy Baton Rouge LA 70803 United States

ISBN: (纸本)9781479930357

the problem of visualization of very large sparse matrices emerging on massively parallel computer systems is identified and a new method along with an accompanying algorithm for parallel acquisition of visualization data for such matrices are presented. the proposed method is based on downsampling a matrix into blocks for which the desired visualization data are saved into a file. this file is then supposed to be downloaded and processed into a final image on a personal computer. Experimental results for the evaluation of the performance and scalability of the proposed algorithm are further provided and discussed. © 2013 IEEE.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Certified, efficient and sharp univariate Taylor models in COQ

Certified, efficient and sharp univariate Taylor models in C...

引用

15th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2013

作者： Martin-Dorel, Érik Rideau, Laurence théry, Laurent Mayero, Micaela Paşca, Ioana Inria Sophia Antipolis France LIPN Institut Galilée Université Paris 13 Villetaneuse France IUT de Nîmes Université Montpellier 2 Nîmes France

ISBN: (纸本)9781479930357

We present a library for univariate Taylor models that has been developed with the COQ proof assistant. Each algorithm of this library is executable and has been formally proved correct. Using this library, one can then effectively compute rigorous and sharp approximations of univariate functions composed of usual functions such as reciprocal, square root, exponential, or sine among others. In this paper, we present the key parts of the formalisation as well as of the proofs of correctness, and we evaluate the quality of our certified library on a set of examples. © 2013 IEEE.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Bounded Bi-ideals and Linear Recurrence

Bounded Bi-ideals and Linear Recurrence

引用

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

作者： Inese Berzina Janis Buls Raivis Bets Faculty of Physics and Mathematics University of Latvia Riga Latvia

Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is ... 详细信息

关键词： Generators scientific computing Physics Mathematics Educational institutions Electronic mail Multiaccess communication

来源：评论

学校读者我要写书评

暂无评论

Deciding Conjugacy in thompson's Group F in Linear Time

Deciding Conjugacy in Thompson's Group F in Linear Time

引用

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

作者： Nabil Hossain Robert W. McGrail James Belk Francesco Matucci Laboratory for Algebraic and Symbolic Computation Bard College Annandle-on-Hudson New York USA Departement de Mathématiques Orsay Cedex France

We present an efficient implementation of the solution to the conjugacy problem in thompson9;s group F, a certain infinite group whose elements are piecewise-linear homeomorphisms of the unit interval. this algorit... 详细信息

We present an efficient implementation of the solution to the conjugacy problem in thompson's group F, a certain infinite group whose elements are piecewise-linear homeomorphisms of the unit interval. this algorithm checks for conjugacy by constructing and comparing directed graphs called strand diagrams. We provide a comprehensive description of our solution algorithm, including the data structure that stores strand diagrams and methods to simplify them. We prove that our algorithm theoretically achieves a linear time bound in the size of the input, and we present a quadratic time working solution.

关键词： Data structures Bismuth Algorithm design and analysis Chemical elements Electronic mail Generators Java

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Cooperative CPU-GPU computing

Algorithm for Cooperative CPU-GPU Computing

引用

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

作者： Razvan-Mihai Aciu Horia Ciocarlie Department of Computer and Software Engineering “Politehnica” University Timisoara Romania

Many applications have modules which could benefit greatly from the massive parallel numeric computing power provided by GPUs. Renderers, signal processing or simulators are only a few such applications. Due to the weaknesses of the GPUs such as stackless execution model or poor capabilities for pointer exchange with the host, sometimes is not feasible to convert an entire algorithm for GPU, even if it is highly parallel and some of its parts can be greatly accelerated on GPU. In such situations a programmer should have a framework which allows him to split the code flow of a thread in parts and each of these parts will run on the most suitable computing resource, CPU or GPU. For GPU execution, multiple data from host threads will be collected, run on GPU and the results returned to the original threads so they will be able to resume execution on host. In this paper we propose such an algorithm, analyze it and evaluate its practical results.

关键词： Graphics processing units Instruction sets Kernel Data structures Signal processing algorithms Clocks Synchronization

来源：评论

学校读者我要写书评

暂无评论

Certified, Efficient and Sharp Univariate Taylor Models in COQ

Certified, Efficient and Sharp Univariate Taylor Models in C...

引用

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

作者： Érik Martin-Dorel Laurence Rideau Laurent théry Micaela Mayero Ioana Pasca Inria Sophia Antipolis France LIPN Université Paris 13 France IUT de Nîmes Université Montpellier 2 Nîmes France

关键词： Polynomials Computational modeling Libraries Approximation methods Abstracts Mathematical model Standards

来源：评论

学校读者我要写书评

暂无评论

computing Origami Universal Molecules with Cyclic Tournament Forests

Computing Origami Universal Molecules with Cyclic Tournament...

引用

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

作者： John C. Bowers Ileana Streinu School of Computer Science University of Massachusetts Amherst Massachusetts Department of Computer Science Smith College Northampton Massachusetts

Lang9;s "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a convex polygonal region (the "paper") having a certain metric relatio... 详细信息

Lang's "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a convex polygonal region (the "paper") having a certain metric relationship with the tree. It computes a crease- pattern which allows for the paper to "fold" to a uniaxial base, which is a 3-dimensional shape projecting onto the given tree. Lang's universal molecule algorithm runs in cubic time and quadratic space. We investigate two implementations which improve the running time to sub-cubic time. the first uses a cyclic tournament forest, a new data structure which extends kinetic tournament trees to allow for cycle splitting operations, and the second uses a priority queue to store events.

关键词： Vegetation Measurement Data structures TV Skeleton Algorithm design and analysis Kinetic theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共59页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：