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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

computing Self-intersection Loci of Parametrized Surfaces Using Regular Systems and Grobner Bases

Computing Self-intersection Loci of Parametrized Surfaces Us...

引用

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

作者： Huang, Yanli Wang, Dongming Beihang Univ LMIB SKLSDE Sch Math & Syst Sci Beijing 100191 Peoples R China Univ Paris 06 Lab Informat CNRS F-75016 Paris France

ISBN: (纸本)9780769539645

the computation of self-intersection loci of parametrized surfaces is needed for constructing trimmed parametrizations and describing the topology of the considered surfaces in real settings. this paper presents two general and efficient methods for determining self-intersection loci of rationally parametrized surfaces. One of the methods, based on regular systems, is capable of computing the exact parametric locus of self-intersection of a given surface and the other, based on Grobner bases, can compute the minimal variety passing through the exact parametric locus. the relation between the results computed by the two methods is established and two algorithms for computing parametric loci of self-intersection are described. Experimental results and comparisons with some existing methods show that our algorithms have a good performance for parametrized surfaces.

关键词： parametrized surface self-intersection locus minimal variety parametric locus

来源：评论

学校读者我要写书评

暂无评论

Comparison of OLS and NLS to fit Transformation-Interaction-Rational expressions 24

Comparison of OLS and NLS to fit Transformation-Interaction-...

引用

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

作者： de Franca, Fabricio Olivetti Univ Fed ABC Ctr Math Comp & Cognit CMCC Heurist & Anal Lab HAL Santo Andre Brazil

ISBN: (纸本)9781665465458

Transformation-Interaction-Rational is a representation for symbolic Regression created with the intent to constrain the search space of mathematical expressions with only simple models. In short, this representation is a rational of two linear models with transformed variables. Even though the representation makes the model nonlinear w.r.t. its numerical parameters, it is possible to rewrite the expression such that the parameters become linear and, thus, can be adjusted using the Ordinary Least Squares method, that guarantees the global optima solution. But, when we are working with a noisy data set, the reparametrization procedure may skew the noise distribution leading to an incorrect value for the numerical parameters. In this work, we test and compare the use of Ordinary Least Square and a non-linear optimization in simulated benchmarks with the presence of noise. the results show evidence that OLS is robust to noise and always returns a similar solution to the non-linear optimization algorithm.

关键词： symbolic regression parameter optimization representation

来源：评论

学校读者我要写书评

暂无评论

Evaluating Weighted Round Robin Load Balancing for Cloud Web Services 16

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

引用

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

作者： Wang, Weikun Casale, Giuliano Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England

ISBN: (纸本)9781479984480

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 than routings proportional to the VM capacity with respect to throughput maximization.

关键词： Web services cloud computing contracts resource allocation VM capacity closed queueing networks cloud Web services cloud load balancers multiclass workloads optimal revenue optimization algorithms probabilistic routing policy queueing theoretic heuristic queueing theoretic methods routing probability service level agreements stochastic model throughput maximization weighted round robin load balancing policies Heuristic algorithms Load management Monitoring Optimization Round robin Routing Servers Round robin Service level agreements Optimization algorithms Servers Web Service Stochastic models load management Network routing Heuristic algorithms Queueing networks Cloud computing contract Resource utilization Load balancing

来源：评论

学校读者我要写书评

暂无评论

Identification of Discrete Non-Linear Dynamics of a Radio-Frequency Power Amplifier Circuit using symbolic Regression 24

Identification of Discrete Non-Linear Dynamics of a Radio-Fr...

引用

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

作者： Steiger, Martin Brachtendorf, Hans-Georg Kronberger, Gabriel UAS Upper Austria Embedded Syst Lab Hagenberg Austria UAS Upper Austria Josef Ressel Ctr Symbol Regress Heurist & Evolutionary Algorithms Lab Hagenberg Austria

ISBN: (纸本)9781665465458

the identification of non-linearities or undesirable dynamic behavior of electrical components is a common problem. Previous modeling forms are largely based on extensive physical knowledge at the semiconductor level, which has produced reliable solutions over the past decades. this however implies the measurement of physical prototypes in laboratories, which can be costly. It is therefore desirable to have reliable software models of the prototypes available to outsource this procedure to simulators. this paper presents a number of solutions from the field of empirical modeling including symbolic regression, which allow to parameterize such models from measured values. As an example we are utilizing time-domain data from a real radio-frequency power amplifier circuit. We compare a Hammerstein-Wiener model with two methods for symbolic regression, and find that the Hammerstein-Wiener model produces the best predictions but has many non-zero coefficients. Both symbolic regression methods produce short linear models with slightly higher prediction error than the HW model.

关键词： Non-Linear System Identification Sparse Identification Genetic Programming symbolic Regression Power Amplifier

来源：评论

学校读者我要写书评

暂无评论

On computing non-negative loop-free edge-bipartite graphs

On computing non-negative loop-free edge-bipartite graphs

引用

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

作者： Marczak, Grzegorz Simson, Daniel Zajac, Katarzyna Nicolaus Copernicus Univ Fac Math & Comp Sci Torun Poland

ISBN: (纸本)9781479930357

We continue the Coxeter spectral study of finite connected loop-free edge-bipartite graphs Delta, with n >= 2 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. Here, we discuss Coxeter spectral analysis problems of non-negative edge-bipartite graphs of corank s <= n - 1, which means that the symmetric Gram matrix G(Delta) is an element of M-n(Z) is positive semi-definite of rank n - s <= n. In particular, we study in details the loop-free edge-bipartite graphs of corank s = n - 1. We present algorithms that generate all such edge-bipartite graphs of a given size and, using symbolic and numerical computer calculations in Python, and we obtain their complete classification in relation with Diophantine geometry problems. We also construct algorithms that allow us to classify all connected loop-free non-negative edge-bipartite graphs Delta, with a fixed number n >= 2 of vertices, by means of their Coxeter spectra specc(Delta).

关键词： Coxeter spectrum Z-congruence edge-bipartite graph mesh root system unit quadratic form Bipartite graph loop-free Nonnegative Positive semi-definite Pythonidae

来源：评论

学校读者我要写书评

暂无评论

Supporting the Development and Operation of Multi-Cloud Applications: the MODAClouds Approach

Supporting the Development and Operation of Multi-Cloud Appl...

引用

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

作者： Di Nitto, Elisabetta da Silva, Marcos Aurelio Almeida Ardagna, Danilo Casale, Giuliano Craciun, Ciprian Dorin Ferry, Nicolas Muntes, Victor Solberg, Arnor Politecn Milan DEIB I-20133 Milan Italy SOFTEAM Paris France Univ London Imperial Coll Sci Technol & Med London England IEAT Timisoara Romania SINTEF Oslo Norway CA Barcelona Spain

ISBN: (纸本)9781479930357

Vendor lock-in and cloud outages are two important challenges that make IT managers reluctant in widely adopting the cloud within the enterprise. Vendor lock-in happens when the adoption of cloud provider-specific technologies and APIs forces consumers to stay with the same provider even if they would like to change. Cloud outages can happen to any provider, as the events of the last years have largely demonstrated, and have a critical impact on the actual reliability of cloud applications. A solution to both problems could be to support application developers and operators in the adoption of a multi-cloud approach: applications are built to run and replicate on different clouds, and mechanisms for fast switching from a cloud installation to the other are offered. In the MODA Clouds project we pursue this approach and rely on model-driven development combined with risk analysis and quality prediction. In this paper we provide an overview of our approach and present the architecture of the corresponding platform.

关键词： cloud computing multi-cloud applications model-driven design QoS analysis monitoring self-adaptation

来源：评论

学校读者我要写书评

暂无评论

Reducing energy consumption by using Clouds

Reducing energy consumption by using Clouds

引用

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

作者： Brandic, Ivona Vienna Univ Technol Vienna Austria

ISBN: (纸本)9781479930357

Cloud computing is a promising technology for the realization of large, scalable, and on-demand provisioned computing infrastructures. Currently, many enterprises are adopting Clouds to achieve high performance and scalability for their applications while maintaining low costs. Service provisioning in the Cloud is based on a set of predefined nonfunctional properties specified and negotiated by means of Service Level Agreements (SLAs). Cloud workloads are dynamic and change constantly. thus, in order to reduce steady human interactions, self-manageable Cloud techniques are required to comply with the agreed customers' SLAs. Flexible and reliable management of SLAs is of paramount importance for both, Cloud providers and consumers. On one hand, the prevention of SLA violations avoids penalties that are costly to providers. On the other hand, based on flexible and timely reactions to possible SLA violation threats, user interaction with the system can be minimized enabling Cloud computing to take roots as a flexible and reliable form of on-demand computing. Furthermore, a trade-off has to be found between proactive actions that prevent SLA violations and those that reduce energy consumption, i.e., increase energy efficiency. In this talk we discuss how the application of Cloud computing technologies can support the work of scientists working in the field of high-throughput sequencing, while at the same time optimizing utilization of resource and increasing energy efficiency.

关键词： Clouds Cloud computing Energy efficiency energy consumption SLA gene reduced power FLEXIBLE CLOUDS Scalability user-computer interaction Speaking

来源：评论

学校读者我要写书评

暂无评论

Early Prediction of the Cost of HPC Application Execution in the Cloud 16

Early Prediction of the Cost of HPC Application Execution in...

引用

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

作者： Rak, Massimiliano Turtur, Mauro Villano, Umberto Univ Naples 2 Dept Ind & Informat Engn Aversa Italy Univ Sannio Dept Engn Benevento Italy

ISBN: (纸本)9781479984480

Even if clouds are not fit for high-end HPC applications, they could be profitably used to bring the power of economic and scalable parallel computing to the masses. But this requires both simple development environments, able to exploit cloud scalability, and the capability to easily predict the cost of HPC application runs. this paper presents a framework built on the top of a cloud-aware programming platform (mOSAIC) for the development of bag-of-tasks scientific applications. the framework integrates a cloud-based simulation environment able to predict the behavior of the developed applications. Simulations enable the developer to predict at an early development stage performance and cloud resource usage, and so the infrastructure lease cost on a public cloud. the paper sketches the framework organization and discusses the approach followed for application development. Moreover, some validation tests of prediction results are presented.

关键词： cloud computing parallel processing HPC application execution cost prediction bag-of-tasks scientific applications cloud aware programming platform cloud resource usage cloud-based simulation environment mOSAIC public cloud scalable parallel computing Benchmark testing Cloud computing Computational modeling Corporate acquisitions Load modeling Prediction algorithms Predictive models Cloud computing bag of tasks mosaic performance prediction scientific applications simulation Cloud computing PARALLEL PROCESSING (COMPUTERS) corporate acquisitions Benchmark testing mosaic pattern Prediction algorithms Load modeling performance prediction Computational modeling Prediction models Clouds Patchy burn Mosaic CLOUDS High Performance computing

来源：评论

学校读者我要写书评

暂无评论

'Descente Infinie' Induction-based Saturation Procedures

'Descente Infinie' Induction-based Saturation Procedures

引用

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

作者： Stratulat, Sorin Univ Paul Verlaine Metz LITA F-57000 Metz France

ISBN: (纸本)9780769530789

In [11], we have shown that implicit induction and saturation proof techniques share the same logic, witnessed by an inference system implementing the Fermat's 'Descente Infinie' induction principle. As a case study, a simple paramodulation-based inference system has been proved as an instance of it. In this paper, we detail the instantiation method to treat general saturation-based systems and apply it to analyse a non-trivial resolution-based system. We also propose a methodology to build variants of existing systems, which preserve crucial properties like soundness and refutational completeness.

关键词： Logic Carbon capture and storage Inference algorithms scientific computing Computer science Calculus Testing Concrete

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：