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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Combinatorial Techniques for Proof-Based Synthesis of Sorting algorithms

Combinatorial Techniques for Proof-Based Synthesis of Sortin...

引用

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

作者： Isabela Drämnesc Tudor Jebelean Sorin Stratulat Dept. of Comput. Sci. West Univ. Timisoara Romania Research Institute for Symbolic Computation Johannes Kepler University Linz Austria Department of Computer Science Université de Lorraine Metz LITA France

In the frame of our previous experiments for proof based synthesis of sorting algorithms for lists and for binary trees, we employed certain special techniques which are able to generate multiple variants of sorting and merging, by investigating all combinations of auxiliary functions available for composing objects (lists, respectively trees). the purpose of this paper is to describe this technique and the results obtained. We present the main principles and the application of this technique to merging of sorted binary trees into a sorted one. Remarkably, merging requires a nested recursion, for which an appropriate induction principle is difficult to guess. Our method is able to find it automatically by using a general Noetherian induction and the combinatorial technique.

关键词： Binary trees Sorting Electronic mail Merging Cognition Inference algorithms Computer science

来源：评论

学校读者我要写书评

暂无评论

A Model-Driven DevOps Framework for QoS-Aware Cloud Applications

A Model-Driven DevOps Framework for QoS-Aware Cloud Applicat...

引用

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

作者： Michele Guerriero Michele Ciavotta Giovanni Paolo Gibilisco Danilo Ardagna Dipartimento di Elettronica Informazione e Bioingegneria Politecnico di Milano Milan Italy

Recently we witnessed a deep transformation in the the design, development and management of modern applications, which have grown in scope and size becoming distributed and service-oriented. A big part in this metamorphosis is played by the Cloud with the availability of almost-infinite resources, high availability and outsourced maintenance. this has led to the emergence of new software development methodologies to effectively deal with this paradigm shift in the field of software engineering. DevOps is one of them, it advocates for a greater level of collaboration and convergence between developers and other IT professionals. Consequently, new tools, purposely designed to ease this process, are required. In this scenario, we present SPACE4Cloud, a DevOps integrated environment for model-driven design-time quality of service assessment and optimization, and runtime capacity allocation of Cloud applications.

关键词： Quality of service Runtime Optimization Cloud computing Adaptation models Resource management

来源：评论

学校读者我要写书评

暂无评论

Properties of Multiset Orders by Minimal and Maximal Submultisets

Properties of Multiset Orders by Minimal and Maximal Submult...

引用

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

作者： Aurelian Rádoacá Department of Computer Science West University of Timişoara Romania

We analyze the relations between the multisets and their submultisets involved in the multiset order M> mso and derive many properties that can be used in proofs. these properties are used to refine some proofs of known results, like the transitivity or the termination of > mso . these properties also enable a better understandingof the underlying theory and can be use din implementations of theorem provers. For two finite multisets M, N, there can be several pairs of their submultisets that satisfy M> mso N, which can be seen as solutions to the equation M>mso N. We determine the number of solutions that satisfy M> mso N and establish an order between them, not total, but admittinga minimum and a maximum. We determine the formulae for the minimal submultisets and provide several algorithmsto find the maximal submultisets. the minimal submultisetsare necessary and sufficient to determine if M> mso N. the minimal and maximal submultisets also allow for a deeperanalysis in termination problems with multiset orders, being able to determine, for instance, how fast a program can terminate.

关键词： Manganese Finite element analysis scientific computing Computer science Electronic mail Indexes Additives

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Christoph Koutschan Helene Ranetbauer Georg Regensburger Marie-therese Wolfram Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences (ÖAW) Linz Austria

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.

关键词： Mathematical model Lattices Computational modeling Microscopy Taylor series Transportation Handheld computers

来源：评论

学校读者我要写书评

暂无评论

SLA-Based Secure Cloud Application Development: the SPECS Framework

SLA-Based Secure Cloud Application Development: The SPECS Fr...

引用

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

作者： Valentina Casola Alessandra De Benedictis Massimiliano Rak Umberto Villano DIETI University of Naples Federico II Napoli Italy DIII Universita degli Studi della Campania Luigi Vanvitelli Napoli Campania IT DIII Second University of Naples Aversa Italy DING University of Sannio Benevento Italy

the perception of lack of control over resources deployed in the cloud may represent one of the critical factors for an organization to decide to cloudify or not their own services. Furthermore, in spite of the idea of offering security-as-a-service, the development of secure cloud applications requires security skills that can slow down the adoption of the cloud for nonexpert users. In the recent years, the concept of Security Service Level Agreements (Security SLA) is assuming a key role in the provisioning of cloud resources. this paper presents the SPECS framework, which enables the development of secure cloud applications covered by a Security SLA. the SPECS framework offers APIs to manage the whole Security SLA life cycle and provides all the functionalities needed to automatize the enforcement of proper security mechanisms and to monitor userdefined security features. the development process of SPECS applications offering security-enhanced services is illustrated, presenting as a real-world case study the provisioning of a secure web server.

关键词： Security Cloud computing Monitoring Unified modeling language Context Supply chains

来源：评论

学校读者我要写书评

暂无评论

Computation of GCD of Sparse Multivariate Polynomials by Extended Hensel Construction

Computation of GCD of Sparse Multivariate Polynomials by Ext...

引用

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

作者： Masaru Sanuki Daiju Inaba Tateaki Sasaki Division of Clinical Medicine University of Tsukuba Ibaraki Japan The Mathematics Certification Institute of Japan Tokyo Japan University of Tsukuba Ibaraki Japan

ISBN: (纸本)9781509004621

Let F(x, u 1 ,..., u ℓ ) be a squarefree multivariate polynomial in main variable x and sub-variables u 1 ,..., u ℓ . We say that the leading coefficient (LC) of F is singular if it vanishes at the origin of sub-variables. A representative algorithm for nonsparse multivariate polynomial GCD is the EZ-GCD algorithm, which is based on the generalized Hensel construction (GHC). In order to apply the GHC easily, we require 1) the LC of F is nonsingular, 2) F(x, 0,..., 0) is squarefree, and 3) the initial Hensel factor of GCD is "lucky". these requirements are usually satisfied by the "nonzero substitution", i.e., to shift the origin of subvariables. However, the nonzero substitution may cause a drastic increase of the number of terms of F if F is sparse. In 1993, Sasaki and Kako proposed the extended Hensel construction (EHC) which does not perform the nonzero substitution even if the LC is singular. Using the EHC, Inaba implemented an algorithm of multivariate polynomial factorization and verified that it is very useful for sparse polynomials. In this paper, we apply the EHC for the computation of GCD of sparse multivariate polynomials. In order to find a lucky initial factor, we utilize the weighting of sub-variables, etc. Our naive implementation in Maple shows that our algorithm is comparable in performance to Maple's GCD routine based on the sparse interpolation.

关键词： Nickel Interpolation scientific computing Lead Computational efficiency Newton method

来源：评论

学校读者我要写书评

暂无评论

Expressive Data Storage Policies for Multi-cloud Storage Configurations

Expressive Data Storage Policies for Multi-cloud Storage Con...

引用

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

作者： Ansar Rafique Dimitri Van Landuyt Wouter Joosen Iminds-DistriNet KU Leuven Leuven Belgium iMinds-DistriNet Katholieke Universiteit Leuven Leuven Flanders BE

Software-as-a-Service (SaaS) providers increasingly rely on multi-cloud setups to leverage the combined benefits of different enabling technologies and third-party providers. Especially, in the context of NoSQL storage systems, which are characterized by heterogeneity and quick technological evolution, adopting the multi-cloud paradigm is a promising way to deal with different data storage requirements. Existing data access middleware platforms that support this type of setup (polyglot persistence) commonly rely on (i) configuration models that describe the multi-cloud setup, and (ii) the hard-coded logic in the application source code or the data storage policies that define how the middleware platforms should store data across different storage systems. In practice, however, both models are tightly coupled, i.e. the hard-coded logic in the application source code and data storage policies refer to specific configuration model elements, leads to fragility issues (ripple effects) and hinders reusability. More specifically, in multi-cloud configurations that change often (e.g., in dynamic cloud federations), this is a key problem. In this paper, we present a more expressive way to specify storage policies, that involves (i) enriching the configuration models with metadata about the technical capabilities of the storage systems, (ii) referring to the desired capabilities of the storage system in the storage policies, and (iii) leaving actual resolution to the policy engine. Our validation in the context of a realistic SaaS application shows how the policies accommodate such changes for a number of realistic policy change scenarios. In addition, we evaluate the performance overhead, showing that policy evaluation is on average less than 2% of the total execution time.

关键词： Memory Data models Cloud computing Context Engines scientific computing

来源：评论

学校读者我要写书评

暂无评论

Spiking Neural P Systems. A Quick Survey and Some Research Topics 16

Spiking Neural P Systems. A Quick Survey and Some Research T...

引用

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

作者： Panu, Gheorghe Romanian Acad Inst Math Bucharest 014700 Romania

After presenting the basic definition of spiking neural P systems (SN P systems), illustrated with two examples, we recall some results concerning the computing power and the size of universal SN P systems. We end thi... 详细信息

ISBN: (纸本)9781479984480

关键词： membrane computing P system spiking neural P system computational complexity

来源：评论

学校读者我要写书评

暂无评论

On ladder operators for little q-Jacobi polynomials and their generalizations

On ladder operators for little <i>q</i>-Jacobi polynomials a...

引用

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

作者： Filipuk, Galina Haneczok, Maciej Univ Warsaw Fac Math Informat & Mech PL-02097 Warsaw Poland Katholieke Univ Leuven Dept Math B-3001 Leuven Belgium

In this paper we study the ladder operators for little q-Jacobi polynomials and for polynomials orthogonal with respect to a generalized q-Jacobi weight. We also briefly discuss the computational aspects in the comput... 详细信息

ISBN: (纸本)9781479930357

关键词： Jacobi polynomials Polynomial Generalization Ladders symbolic algebra Operon OPERATORS Operators Little's Disease mathematics computing

来源：评论

学校读者我要写书评

暂无评论

Stepping Up

Stepping Up

引用

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

作者： Jackson, Adrian Univ Edinburgh EPCC Edinburgh EH9 3JZ Midlothian Scotland

ISBN: (纸本)9781479930357

Computational simulation is an important research tool for modern scientists. there are a range of different scales of high performance computing (HPC) resources available to scientists, from laptop and desktop machines, to small institutional clusters, to national HPC resources, and the largest parallel computers in the world. this paper outlines the challenges that developers and users face moving from small scale computational resources to larger scale parallel machines. We present an overview of various research efforts to improve performance on large scale systems to enable users and developers to gain an understanding of the performance issues often encountered by simulation codes.

关键词： High Performance computing large-scale systems Developers Speeding parallel machines Consumers hand-held equipment Research Tools DEVELOPERS simulating Moving scientific personnel parallel computers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共59页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：