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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Supply Chain Risk Management by Mining Business Dependencies

Supply Chain Risk Management by Mining Business Dependencies

引用

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

作者： Lucian Hancu Soft ProEuro s. r. l Cluj-Napoca Romania

Current supply chain risk management techniques rely on the integration of the business information systems of the entities forming the supply chain. the method is well-suited for small and medium entities, but large Entities are rather reticent in integrating Information Systems with the ones of SMEs. this article presents a risk-reduction mechanism based on mining Business Dependencies that were previously automatically discovered from the Web logs of our multi-server search application. the material gathered in the previous experiments (business dependencies inferred from Web usage logs and information on entities) serves as a support for building Virtualized Supply Chains. the generation of the Virtualized Supply Chains and the computation of the associated risks conduct to the derivation of a risk reduction technique, which can be later applied in the redesign of Supply Chains and replace suppliers having high risk measures with those exhibiting lower risk measures.

关键词： Supply chains Risk management Business Radiofrequency identification Management information systems Supply chain management Web search Companies Floods scientific computing

来源：评论

学校读者我要写书评

暂无评论

Experiences in symbolic Computations for Matrix Problems

Experiences in Symbolic Computations for Matrix Problems

引用

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

作者： Stanislaw Kasjan Andrzej Mróz Faculty of Mathematics and Computer Science Nicolaus Copernicus University Torun Poland

We review our recent results concerning several computer algebra aspects of determining canonical forms, performing a decomposition and deciding the isomorphism question for matrix problems. We consider them in the language of finite dimensional modules over algebra and the language of square block matrices with an action of elements from some sub algebra of the full matrix algebra. We present an efficient (polynomial-time) improvement of classical Bongartz's algorithm for determining a maximal common direct summand of modules, and its application to solving the isomorphism problem. the improved algorithm recently became a part of QPA package ver. 1.07 for GAP. We also study the behaviour of Belitskii's algorithm for determining certain canonical form on a class of square block matrices, especially for matrix problems associated with a poset. Both problems can be considered as a highly generalized classical Jordan problem for square matrices.

关键词： Complexity theory Matrix decomposition Context Polynomials

来源：评论

学校读者我要写书评

暂无评论

Accelerating heuristic convergence on the "Evolution of Mona Lisa" problem by including image-centric mutation operators

Accelerating heuristic convergence on the "Evolution of Mona...

引用

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

作者： theodor-Alexandru Vlad Eugen Nicolae Croitoru Faculty of Computer Science "Alexandru Ioan Cuza" University of Iasi Iasi Romania

the "Evolution of Mona Lisa" problem aims to approximate a target image by overlapping many semi-transparent polygons. the problem has been tackled in the past using multiple Nature-Inspired heuristics, and our main contribution is adding image-centric mutation operators (scaling, rotating and translating polygons).We compare Genetic algorithms, Hill-Climbing and Simulated Annealing. A candidate solution has variable length (of, at most, 300 decagons) and, due to the variable opacity of polygons, order matters – resulting, in practice, in a pseudo-Messy GA. We use the same representation and mutation operators for the trajectory methods which, due to the focus on wall-clock time, outperform our GA *** find that these methods retain good image approximation at good run times: 98.9-99.2% (mean on 30 images), with a time limit of 30 minutes, on images 500-pixels tall.

关键词： Visualization Evolution (biology) scientific computing Nose Mouth Simulated annealing Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

IPO-MAXSAT: the In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation

IPO-MAXSAT: The In-Parameter-Order Strategy combined with Ma...

引用

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

作者： Irene Hiess Ludwig Kampel Michael Wagner Dimitris E. Simos MATRIS SBA Research Vienna Austria

Covering arrays (CAs) are combinatorial designs that represent the backbone of combinatorial testing, which is applied most prominently in automated software testing. the generation of optimized CAs is a difficult combinatorial optimization problem being subject to ongoing research. Previous studies have shown that many different algorithmic approaches are best suited for different instances of CAs. In this paper we present the IPO-MAXSAT algorithm, which adopts the prominent inparameter-order (IPO) strategy for CA generation and uses MaxSAT solving to optimize the occurring sub-problems. We devise three different algorithmic variants that use a MaxSAT solver for different sub-problems. these variants are evaluated in an extensive set of experiments where we also consider the usage of different MaxSAT solvers. Further, we provide a comparison against various other algorithms realizing the IPO strategy as well as the state of the art.

关键词： scientific computing Combinatorial testing Software algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

7th international Conference on Evolutionary Programming, EP 1998

7th International Conference on Evolutionary Programming, EP...

引用

7th Annual Conference on Evolutionary Programming, EP 1998

ISBN: (纸本)3540648917

the proceedings contain 79 papers. the special focus in this conference is on Economics, Emergence, Complex Systems, Issues and Innovations in Evolutionary Computation. the topics include: A framework for evolutionary processes in semantic memory;preferential partner selection in evolutionary labor markets;subspace pursuit for exploratory modeling;evolutionary computing in multi-agent environments;evalution of a simple host-parasite genetic algorithm;testing three paradigms for evolving groups of cooperative, simple agents;acquisition of general adaptive features by evolution;hybrid interior-lagrangian penalty based evolutionary optimization;GA-optimal fitness functions;scaling up evolutionary programming algorithms;short notes on the schema theorem and the building block hypothesis in genetic algorithms;a superior evolutionary algorithm for 3-SAT;evolvable hardware control for dynamic reconfigurable and adaptive computing;evolutionary programming strategies with self-adaptation applied to the design of rotorcraft using parallel processing;optimization of thinned phased arrays using evolutionary programming;evolutionary domain covering of an inference system for function approximation;learning to re-engineer semantic networks using cultural algorithms;integration of slicing methods into a cultural algorithm in order to assist in large-scale engineering systems design;genetic search for object identification;fuzzy cultural algorithms with evolutionary programming;culturing evolution strategies to support the exploration of novel environments by an intelligent robotic agent;skeuomorphs and cultural algorithms;sphere operators and their applicability for constrained parameter optimization problems;numeric mutation as an improvement to symbolic regression in genetic programming and variable-dimensional optimization with evolutionary algorithms using fixed-length representations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Service Brokering in Cloud Governance

Service Brokering in Cloud Governance

引用

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

作者： Victor Ion Munteanu Cristina Mindruta Teodor-Florin Fortis Faculty of Mathematics and Informatics Department of Computer Science West University of Timişoara Timisoara Romania Institute e-Austria Timisoara Romania

the dawn of Cloud computing has opened new opportunities for IT-based industries, enabling them to cut costs and extend their businesses to a level which was previously hard to attain. While Cloud adoption is an ongoing process, many enterprises are still reluctant to pursue it because its downside outweighs its benefits, especially due to problems related to security and privacy. Coming from Service Oriented Architecture (SOA) Governance, Cloud Governance aims to cover these issues by offering a set of complementary services to the already available Cloud Management ones. this paper covers one of the core aspects of Cloud Governance, its ability to provide service brokering. A semantic approach is proposed where related services and cloud ontologies as well as brokering mechanisms are discussed.

关键词： Ontologies Semantics Cloud computing Contracts Service-oriented architecture Context Taxonomy

来源：评论

学校读者我要写书评

暂无评论

Optimizing Automotive Cyber-Physical System Specifications with Multi-Event Dependencies

Optimizing Automotive Cyber-Physical System Specifications w...

引用

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

作者： Stefan Andrei Albert Mo Kim Cheng Department of Computer Science Lamar University Beaumont TX USA Department of Computer Science University of Houston Houston TX USA

Cyberphysical systems are changing the way we interact with the physical world. the correctness of many systems and devices in our modern society depends not only on the effects or results they produce but also on the time at which these results are produced. Given the behavioral specification of a system (denoted by SP) and a safety assertion (denoted by SA) to be analyzed, the goal is to relate a given safety assertion with the system specification. Deriving optimal theorems (SP rarr SA) will allow the system designer to determine how far the performance of the processing platform can drift from the norm without violating the SA. this paper deals with this clear fundamental issue in the design and implementation of highly dependable realtime/embedded systems.

关键词： Automotive engineering Real time systems Control systems Sensor arrays Embedded computing Embedded system Physics computing Computer science Safety Sensor systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

OFBench: An Enterprise Application Benchmark for Cloud Resource Management Studies

OFBench: An Enterprise Application Benchmark for Cloud Resou...

引用

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

作者： Jean Moschetta Giuliano Casale Department of Computing Imperial College London UK

We introduce OF Bench, a new research benchmark for enterprise applications. OF Bench is a load generator for the demo e-commerce component of the Apache OF Biz enterprise resource planning (ERP) framework. ERP applications are increasingly important in the cloud market due to the growing popularity of Software-as-a-Service (SaaS) solutions, hence OF Bench is useful to explore the resource consumption patterns arising in these applications. On client-side, OF Bench features randomized customer surfing patterns, workload generation based on automation of real web browsers, reproducible burstiness in inter-request and inter-session think times, non-stationary workload generation. On server-side, it features JMX performance monitoring, business logic instrumentation, and synchronization with client-side monitoring via TCP sockets. We illustrate the execution of the benchmark in example runs and use them to investigate the overheads of JMX-based monitoring.

关键词： Benchmark testing Monitoring Browsers Business Databases Java Generators

来源：评论

学校读者我要写书评

暂无评论

Abstract Continuation Semantics for Asynchronous Concurrency

Abstract Continuation Semantics for Asynchronous Concurrency

引用

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

作者： Gabriel Ciobanu Eneia Nicolae Todoran Institute of Computer Science Romanian Academy Iaşi Department of Computer Science Technical University of Cluj-Napoca Romania

ISBN: (纸本)9781538626276

We investigate the abstractness of denotational models designed with continuation semantics for concurrency over metric spaces. Although there exist papers using continuations in the denotational semantics of concurrent languages, we are not aware of any full abstractness result for a concurrent language designed with continuations. therefore we introduce a new criterion that we name weak abstractness; it preserves the correctness condition, but relaxes the completeness condition of the full abstractness criterion. Weak abstractness may be useful for a wide class of denotational models designed with continuations in which full abstractness is difficult (or impossible) to achieve. To illustrate this approach we present a denotational semantics for a simple asynchronous concurrent language designed with continuation semantics over metric spaces. We show that this denotational semantics is weakly abstract with respect to a corresponding operational model.

关键词： Semantics Extraterrestrial measurements Concurrent computing Computational modeling Context modeling Syntactics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 39 40 41 42 43 44 45 46 47 48 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：