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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

565 篇 会议
7 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

176 篇 工学
- 173 篇 计算机科学与技术...
- 108 篇 电气工程
- 28 篇 软件工程
- 5 篇 控制科学与工程
- 4 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
59 篇 理学
- 59 篇 数学
- 2 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
19 篇 经济学
- 18 篇 理论经济学
- 1 篇 应用经济学
12 篇 管理学
- 8 篇 管理科学与工程(可...
- 7 篇 工商管理
- 4 篇 图书情报与档案管...
1 篇 法学
- 1 篇 社会学

主题

290 篇 scientific compu...
91 篇 computer science
64 篇 cloud computing
51 篇 computational mo...
36 篇 polynomials
34 篇 algorithm design...
28 篇 algebra
27 篇 computer archite...
25 篇 mathematics
25 篇 testing
22 篇 software algorit...
22 篇 complexity theor...
21 篇 electronic mail
20 篇 monitoring
20 篇 standards
19 篇 grid computing
19 篇 semantics
18 篇 application soft...
18 篇 distributed comp...
17 篇 concurrent compu...

机构

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

语言

574 篇 英文

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

共 574 条记录，以下是151-160 订阅

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

详细简洁

排序：

An Architecture for a Management Agency for Cloud Resources 20

An Architecture for a Management Agency for Cloud Resources

引用

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

作者： Erascu, Madalina Iuhasz, Gabriel Micota, Flavia West Univ Timisoara Dept Comp Sci Inst Austria Timisoara Blvd V Parvan 4 Timisoara Romania

ISBN: (纸本)9781728106250

Cloud computing offers attractive options to migrate corporate applications without the end users needing to manage any physical resources. While this "ease" is appealing, several issues arise: 1) Which Cloud Providers (CPs) offer the best infrastructure at a fair budget? 2) I am no Cloud expert, then what are the characteristics of the infrastructure which best fit my application? To answer these questions, one must solve a resource management problem, that is, the allocation of computing, storage, networking and (indirectly) cost resources to a set of applications such that the performance objectives of the application are fulfilled. there are many approaches which answer separately these questions but there is no comprehensive and easily usable solution for these issues. MANeUveR solves them by integrating the following components: 1) a Web User Interface offers the end user the possibility to describe his application in terms of interactions between components and their software and hardware requirements, 2) an Offers Management System, through a crawler, periodically updates an ontology with infrastructure and services details from different CPs, 3) a Recommendation Engine provides a (sub)optimal solution for application deployment in the CP infrastructure regarding the leasing price of the virtual machines needed for deployment and their characteristics. Using a secure-billing e-mail service, we demonstrate the effectiveness of our solution.

关键词： Cloud computing crawling ontology optimization SMT solving metaheuristics

来源：评论

学校读者我要写书评

暂无评论

An Imperialistic Strategy Approach to Continuous Global Optimization Problem 16

An Imperialistic Strategy Approach to Continuous Global Opti...

引用

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

作者： Anescu, George Univ Politehn Bucuresti Power Plant Engn Fac Bucharest 060042 Romania

ISBN: (纸本)9781479984480

the paper is introducing the principles of a new global optimization strategy, Imperialistic Strategy (IS), applied to the Continuous Global Optimization Problem (CGOP). Inspired from existing multi-population strategies, like the Island Model (IM) approaches to parallel Evolutionary algorithms (EA) and the Imperialistic Competitive Algorithm (ICA), the proposed IS method is considered an optimization strategy for the reason that it can integrate other well-known optimization methods, which in the context are regarded as sub-methods (although in other contexts they are prominent global optimization methods). Four optimization methods were implemented and tested in the roles of sub-methods: Genetic Algorithm (GA) (a floating-point representation variant), Differential Evolution (DE), Quantum Particle Swarm Optimization (QPSO) and Artificial Bee Colony (ABC). the optimization performances of the proposed optimization methods were compared on a test bed of 9 known multimodal optimization problems by applying an appropriate testing methodology. the obtained increased success rates of IS multi-population variants compared to the success rates of the optimization sub-methods run separately, combined with the increased computing efficiencies possible to be perceived for parallel and distributed implementations, demonstrated that IS is a promising approach to CGOP.

关键词： genetic algorithms parallel algorithms quantum computing ABC CGOP DE EA GA ICA IM IS multipopulation variants QPSO artificial bee colony continuous global optimization problem differential evolution distributed implementations floating-point representation variant genetic algorithm imperialistic competitive algorithm imperialistic strategy approach island model multimodal optimization problems multipopulation strategies parallel evolutionary algorithms parallel implementations quantum particle swarm optimization Biological cells Genetic algorithms Linear programming Optimization Sociology Statistics Vectors Artificial Bee Colony Continuous Global Optimization Problem Differential Evolution Genetic Algorithm IS Imperialistic Competitive Algorithm Imperialistic Strategy Island Model Quantum Particle Swarm Optimization Genetic Algorithm (GA) MT activity based costing Independent component analysis islet cell antibody Instant messaging Particle swarm optimization Gallium cytology Sociology Parallel algorithms quantum computing Policies and plans bee colonies linear programming

来源：评论

学校读者我要写书评

暂无评论

Algorithmic experiences in Coxeter spectral study of P-critical edge-bipartite graphs and posets

Algorithmic experiences in Coxeter spectral study of P-criti...

引用

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

作者： Polak, Agnieszka Simson, Daniel Nicolaus Copernicus Univ Fac Math & Comp Sci Torun Poland

ISBN: (纸本)9781479930357

We study P-critical edge-bipartite graphs (bigraphs for short) Delta with n >= 2 vertices, by means of the nonsymmetric Gram matrix G(Delta) is an element of M-n (Z), the Coxeter matrix Cox(Delta)(t) := G(Delta) center dot G(Delta)(-tr) M-n(Z), its Coxeter polynomial cox(Delta (t)) = det(t center dot E + G(Delta)(-tr)) and its Coxeter spectrum specc(Delta). We recall that Delta is positive if the symmetric matrix G(Delta) := G(Delta) + G(Delta)(-tr) is positive definite;and Delta is P-critical if it is not positive and each of its proper full subbigraphs is positive. It is easy to see that if two bigraphs Delta, Delta' are Z-bilinear equivalent Delta approximate to(Z) Delta' (i.e., there exists a matrix B is an element of Gl(n,Z) such that G Delta - B-tr center dot G(Delta') center dot B) then their Coxeter spectra specc(Delta) and specc(Delta') coincide;but the converse implication does not hold in general. One of the main questions of the Coxeter spectral analysis of connected P-critical bigraphs Delta, Delta' is whether the congruence Delta approximate to (Z)Delta' holds if and only if specc(Delta) = specc(Delta') In this note we discuss the problem in case when n < 10 and Delta and Delta' are P-critical loop-free bigraphs such that their Euclidean types D Delta, D Delta' is an element of {A(n), n >= 1, D-m, m >= 4, <(E)over tilde>(6), (E) over tilde (7), (E) over tilde (8)} coincide. In particular, we get an affirmative answer to the stated question, for a large class of P-critical bigraphs and Tits P-critical finite posets. By applying symbolic and numerical algorithms in Maple and C# we compute the set of Coxeter polynomials cox(Delta) (t) for P-critical loop-free bigraphs Delta, with at most 10 vertices.

关键词： Coxeter-Gram polynomial Euclidean diagram Gram matrix P-critical edge-bipartite graph algorithm edge-bipartite graph orthogonal group sincere root unit quadratic form loop-free Bipartite graph algorithms Positive definite Poset mathematics computing symbolic algebra Acer vertex head If and only if Polynomial matrices

来源：评论

学校读者我要写书评

暂无评论

Minimizing Resource Rent Loss while Maximizing User Availability in Cloud Applications through Online Switching of the Scaling Method

Minimizing Resource Rent Loss while Maximizing User Availabi...

引用

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

作者： Frincu, Marc E. Spataru, Adrian F. Res Inst E Austria Timisoara Romania W Univ Timisoara Timisoara Romania

ISBN: (纸本)9780769549347;9781467350266

Clouds offer access to virtually unlimited resources. Applications requiring a variable number of resources (i.e., elastic) are hence ideal for such a scenario. As cloud resources are usually paid by the hour applications need efficient ways of predicting their requirements in order to reduce costs. In addition we need to maximize user satisfaction through high application availability. Finding the best balance between them is a crucial task. In this paper we consider the case of commercial web applications and focus on the hit rate as scaling factor. Since it is known that no scaling algorithm can have a definite edge over the rest we propose three strategies for online scaling strategy switching. the first one chooses at each step always the best strategy. the second one focuses on analyzing the probability distribution of the historic hit rate and determining the best scaling method for it. Finally, the third one relies on changing the method without needing to know the distribution through random choices. Results show that given the fluctuations and uncertainty of cloud environments and user behavior the most suited method for online selection of the scaling strategy is the first one based on the best strategy.

关键词： cloud computing elastic applications scaling methods adaptive scaling

来源：评论

学校读者我要写书评

暂无评论

A New Digital Repository for Remotely Sensed Hyperspectral Imagery on GPUs

A New Digital Repository for Remotely Sensed Hyperspectral I...

引用

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

作者： Sevilla, Jorge Plaza, Antonio Univ Extremadura Hyperspectral Comp Lab Dept Technol Comp & Commun Caceres Spain

ISBN: (纸本)9781479930357

Hyperspectral imaging is a new technique in remote sensing in which an imaging spectrometer collects hundred of images (at different wavelength channels) for the same area on the surface of Earth. Over the last years, hyperspectral image data sets have been collected from a great amount of locations over the world using a variety of instruments for Earth observation. Only a small amount of them are available for public use and they are spread among different storage locations and exhibit significant heterogeneity regarding the storage format. therefore, the development of a standardized hyperspectral data repository is a highly desired goal in the remote sensing community. In this paper, we describe the development of a shared digital repository for remotely sensed hyperspectral data, which allows uploading new hyperspectral data sets along with meta-data, ground-truth and analysis results (spectral information). Such repository is presented as a web service for providing the management of images through a web interface, and it is available online from http://***/repository. Most importantly, the developed system includes a spectral unmixing-based content based image retrieval (CBIR) functionality which allows searching for images from the database using spectrally pure components or endmembers in the scene. A full spectral unmixing chain is implemented for spectral information extraction, which allows filtering images using the similarity of the spectral signature and abundance of a given ground-truth. In order to accelerate the process of obtaining the spectral information for new entries in the system, we resort to an efficient implementations of spectral unmixing algorithms of graphics processing units (GPUs).

关键词： Hyperspectral imaging repository content-based image retrieval (CBIR) spectral unmixing high performance computing GPUs distributed resources

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Open-Source Static Analysis Tools for Vulnerability Detection in C/C plus plus Code 19

A Comparison of Open-Source Static Analysis Tools for Vulner...

引用

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

作者： Arusoaie, Andrei Ciobaca, Stefan Craciun, Vlad Gavrilut, Dragos Lucanu, Dorel Alexandru Ioan Cuza Univ Fac Comp Sci Iasi Romania Bitdefender Iasi Romania

ISBN: (纸本)9781538626269

We describe work that is part of a research project on static code analysis between the Alexandru loan Cuza University and Bitdefender. the goal of the project is to develop customized static analysis tools for detecting potential vulnerabilities in C/C++ code. We present the results of benchmarking several existing open source static analysis tools for C/C++ against the Toyota ITC test suite [1] in order to determine which tools are best suited to our purpose. the Toyota ITC test suite is a synthetic benchmark for C/C++ consisting of around 650 test cases organized by defect type and defect subtype and is well-suited to our purpose, since it contains various bugs such as buffer overflows that are common in C/C++ code. We analyze the open-source static analysis tools according to the existing quality indicators such as detection rate and false positive rate proposed in [1], but we also introduce a new quality metric that we call robust detection which also allows us to measure unique detections by tool and by (sub)defect type. We also find several mistakes in the Toyota ITC testsuite that we fix. We publish the harness used to benchmark the static analyzers in order for anyone to be able to reproduce our results.

关键词： Tools Static analysis Memory management Computer bugs Resource management Concurrent computing Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

On corank two edge-bipartite graphs and simply extended Euclidean diagrams 16

On corank two edge-bipartite graphs and simply extended Eucl...

引用

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

作者： Gasiorek, Marcin Simson, Daniel Zajac, Katarzyna Nicholas Copernicus Univ Fac Math & Comp Sci Torun Poland

ISBN: (纸本)9781479984480

We continue the Coxeter spectral study of finite connected loop- free edge- bipartite graphs Delta, with m + 2 >= 3 vertices (a class of signed graphs), started in [SIAM J. Discrete Math., 27(2013), 827- 854] by means of the complex Coxeter spectrum specc(Delta) subset of C and presented in our talks given in SYNASC12 and SYNASC13. Here, we study non- negative edge- bipartite graphs of corank two, in the sense that the symmetric Gram matrix G Delta is an element of Mm+2(Z) of Delta is positive semi- definite of rank m >= 1. Extending each of the simply laced Euclidean diagrams (A) over tilde (m), m >= 1, D-m, m >= 4, (E) over tilde (6), (E) over tilde (7), (E) over tilde (8) by one vertex, we construct a family of loop-free corank two diagrams (A) over tilde (2)(m), (D) over tilde (2)(m), (E) over tilde (2)(6), (E) over tilde (2)(7), (E) over tilde (2)(8) (called simply extended Euclidean diagrams) such that they classify all connected corank two loop- free edge- bipartite graphs Delta, with m + 2 >= 3 vertices, up to Z-congruence Delta similar to(Z) Delta'. Here Delta similar to(Z) Delta' means that G(Delta') = B-tr.G(Delta).B, for some B is an element of Mm+2(Z) such that det B = +/- 1. We present algorithms that generate all such edge- bipartite graphs of a given size m + 2 >= 3, together with their Coxeter polynomials, and the reduced Coxeter numbers, using symbolic and numeric computer calculations in Python. Moreover, we prove that for any corank two connected loop- free edge- bipartite graph Delta, with m + 2 >= 3 vertices, there exists a simply extended Euclidean diagram D such that Delta similar to(Z) D.

关键词： graph theory mathematics computing matrix algebra polynomials Coxeter polynomials Python complex Coxeter spectrum corank two edge-bipartite graphs extended Euclidean diagrams finite connected loop-free edge-bipartite graphs nonnegative edge-bipartite graphs numeric computer calculations reduced Coxeter numbers signed graphs symbolic computer calculations symmetric Gram matrix Bipartite graph Kernel Labeling Polynomials Symmetric matrices Vectors Zinc Coxeter spectral analysis Euclidean diagrams Z-congruence inflation algorithm non-negative bigraphs of corank two quadratic form Bipartite graph Polynomial mathematics computing Symmetric matrix Pythonidae Quadratic form matrix algebra Graph theory loop-free Euclidean Python zinc Kernel

来源：评论

学校读者我要写书评

暂无评论

Implementing parameterized type algorithm definitions in Mathematica

Implementing parameterized type algorithm definitions in Mat...

引用

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

作者： Andreica, Alina Univ Babes Bolyai ICT Dept R-3400 Cluj Napoca Romania

ISBN: (纸本)9780769527406

the paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. symbolic algorithms based on category theory have the advantage of systematically dealing with domains, categories, operators over them by creating general contexts Of expressing algorithms, which can be applied by parameterizing them with various domains, using the same algorithm definition. While similar approaches have been previously presented by the author, the present paper aims at a stronger focus on algorithm characteristics defined on categorical principles and giving a more general framework for implementing Mathematica algorithms based on genetic principles and category theory. the paper also discusses run time efficiency aspects for these generic implementations.

关键词： category theory parameterized type definitions generic algorithms in symbolic computation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：