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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

559 篇 会议
7 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

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

语言

571 篇 英文

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

共 571 条记录，以下是441-450 订阅

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

详细简洁

排序：

Towards Validating Prediction Systems for Process Understandability: Measuring Process Understandability

Towards Validating Prediction Systems for Process Understand...

引用

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

作者： Joachim Melcher Detlef Seese Institut AIFB Universität Karlsruhe Karlsruhe Germany

Motivated by software metrics, several process metrics for measuring internal (structural) process attributes have been proposed. Integrated in validated prediction systems, these metrics can be used to predict values of external process attributes like, for example, process understandability. there are only a few papers dealing with finding a process understandability metric and validating prediction systems for process understandability. Looking at these publications, we identified possible problems with metric reliability and validity. In this paper, we define new metrics for process understandability inspired by existing work. Furthermore, we present some hypotheses about effects of measuring process understandability. Conducting an experiment, we got some encouraging findings supporting these hypotheses: different aspects of process understandability can be complicated in varying degrees for a process and asking only some few questions about a process can cause values for process understandability differing very much from the real value. these findings should be considered in future work about measuring process understandability.

关键词： Software measurement Software metrics Humans Software algorithms scientific computing Costs Time measurement Process design Design for experiments Concrete

来源：评论

学校读者我要写书评

暂无评论

Resource Competition and Synchronization in Membranes

Resource Competition and Synchronization in Membranes

引用

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

作者： Bogdan Aman Gabriel Ciobanu Faculty of Computer Science Alexandru Ioan Cuza슠University Iasi Romania

In the enhanced mobile membranes, a membrane may enter or exit another membrane. the second membrane just undergoes the action, meaning that it has no control on when the movement takes place. this kind of movement illustrates the lack of an agreement (synchronization) similar to an asynchronous evolution. In safe enhanced mobile membranes this aspect is adjusted: any movement takes place only if both participants agree by synchronizing their evolution. In membranes two kinds of competition can occur: resource competition and location competition. Resource competition refers to rules which request the same resources, and the available resources can only be allocated to some of the rules. Location competition refers to the movement of a membrane in the hierarchical structure of the membrane systems under the request of some conflict rules. We use the two variants of membrane systems in order to describe and explain these kinds of competition, and introduce synchronizing objects in safe enhanced mobile membranes to solve the resource and location competitions.

关键词： Biomembranes Evolution (biology) Computer science Resource management Skin Chemicals scientific computing Biology computing Systems biology Immune system

来源：评论

学校读者我要写书评

暂无评论

symbolic State Space Exploration of RT Systems in the Cloud

Symbolic State Space Exploration of RT Systems in the Cloud

引用

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

作者： Carlo Bellettini Matteo Camilli Lorenzo Capra Mattia Monga Department of Computer Science Università degli Studi di Milano Milan Italy

the growing availability of distributed and cloud computing frameworks makes it possible to face complex computational problems in a more effective and convenient way. A notable example is state-space exploration of discrete-event systems specified in a formal way. the exponential complexity of this task is a major limitation to the usage of consolidated analysis techniques and tools. Several techniques for addressing the state space explosion problem within this context have been studied in the literature. One of these is to use distributed memory and computation to deal with the state space explosion problem. In this paper we study and compare two different approaches, relying on distributed and cloud frameworks, respectively. these approaches were designed and implemented following the same computational schema, a sort of map & fold. they are applied on symbolic state-space exploration of real-time systems specified by (a timed extension of) Petri Nets, by re-adapting a sequential algorithm implemented as a command-line Java tool. the outcome of several tests performed on a benchmarking specification are presented, thus showing the convenience of distributed approaches.

关键词： Computational modeling Abstracts Peer-to-peer computing Explosions Petri nets Concrete Real-time systems

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Algorithm for Solving 7 Parameters Transformation

A Hybrid Algorithm for Solving 7 Parameters Transformation

引用

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

作者： Amir Hashemi Mahzad Kalantari Department of Mathematical Sciences Isfahan University of Technology Isfahan Iran Institut de Recherche en Communications et Cybernétique de Nantes (IRCCyN) Ecole Nationale des Sciences Géographiques UMR CNRS 6597 Ecole Polytechnique University of Nantes France

the 7 parameters transformation is a well-known problem in engineering sciences such as Computer Vision, Survey Engineering and Photogrammetry. To solve this problem, we use an algebraic solver in which we need to transform the input system into an equivalent system, but better adapted such as a Gro¿bner basis. For operational applications of this problem, we need to compute this basis as fast as possible. In this paper, we describe an efficient hybrid algorithm which employs both Buchberger algorithm and Faugere's F 5 algorithm to compute this basis. Using this algorithm, we record the "trace" of the useful calculations for computing the Gro¿bner basis of the polynomial ideal generated by the equations of the system. For any coordinates of input points, this trace can provide directly the Gro¿bner basis of the ideal generated by the system without useless computations.

关键词： Polynomials Application software Equations scientific computing Computer vision Transforms Stereo vision Geodesy Jacobian matrices History

来源：评论

学校读者我要写书评

暂无评论

A Policy-Based Context Aware Self-Management Model

A Policy-Based Context Aware Self-Management Model

引用

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

作者： Tudor Cioara Ionut Anghel Ioan Salomie Mihaela Dinsoreanu Computer Science Department Technical University of Cluj Napoca Cluj-Napoca Romania

this paper proposes a generic policy based self-management model that can be used to automatically detect and repair the problems appeared during the context adaptation processes. To successfully capture and evaluate the dynamic rules that govern the context aware adaptation processes we have defined an generic context policy representation model and its associated reasoning language conversion model for run-time evaluation. To evaluate the run-time degree of respecting the context policies we define and formalize the concept of context entropy. the context information is modeled in a system programmatic manner using both the set based and ontology based representations provided by our RAP (Resources, Actors, Policies) context model. the context model artifacts are generated and administrated at run time by a management infrastructure based on BDI (Believe, Desire, Intentions) agents. the model was tested and validated within the premises of our Distributed Systems Research Laboratory smart environment.

关键词： Context awareness Context modeling Ontologies Runtime Entropy scientific computing Computer science System testing Environmental management Resource management

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Martin Steiger Hans-Georg Brachtendorf Gabriel Kronberger Embedded Systems Lab UAS Upper Austria Hagenberg Austria Josef Ressel Center for Symbolic Regression Heuristic and Evolutionary Algorithms Lab UAS Upper Austria Hagenberg Austria

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.

关键词： Radio frequency Semiconductor device measurement Heuristic algorithms Computational modeling Prototypes Power amplifiers Predictive models

来源：评论

学校读者我要写书评

暂无评论

Lexical Chains Segmentation in Summarization

Lexical Chains Segmentation in Summarization

引用

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

作者： Doina Tatar Andreea Diana Mihis Gabriela Serban Czibula Department of Computer Science University Babeş-Bolyai Cluj-Napoca Romania

In this paper we propose a new method of linear text segmentation based on lexical cohesion of a text. the usual steps (to compute the lexical chains according to relatedness criteria, to score the chains after different parameters,to select the strong chains, to obtain the segments) are replaced by a single procedure. Namely, a single chain of disambiguated words in a text is established and the rips of this single chain are considered as boundaries of the segments of the cohesion structure of the text (CohesionTextTiling or CTT). the summaries of arbitrarily length are obtained by extraction using three different methods applied to the obtained segments. the informativeness of the obtained summaries is compared with the informativeness of the pair summaries of the same length obtained using an earlier method of logical segmentation (coherence segmentation) by text entailment (logical TextTiling or LTT). Some experiments about CTT and LTT methods are made for four rdquoclassicalrdquo texts in summarization literature. the conclusion is that the quality of the summarization using cohesion segmentation (CTT) is better than the quality using logical (coherence) segmentation (LTT).

关键词： Abstracts scientific computing Computer science Statistics thesauri

来源：评论

学校读者我要写书评

暂无评论

Formal Proof of theorems on Genetic Regulatory Networks

Formal Proof of Theorems on Genetic Regulatory Networks

引用

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

作者： Maxime Dénès Binjamin Lesage Yves Bertot Adrien Richard Université de Rennes Rennes France I.N.R.I.A. Sophia Antipolis Sophia-Antipolis France Laboratoire I3S UMR 6070 CNRS Sophia-Antipolis France

We describe the formal verification of two theorems of theoretical biology. these theorems concern genetic regulatory networks: they give, in a discrete modeling framework, relations between the topology and the dynamics of these biological networks. In the considered discrete modeling framework, the dynamics is described by a transition graph, where vertices are vectors indicating the expression level of each gene, and where edges represent the evolution of these expression levels. the topology is also described by a graph, called interaction graph, where vertices are genes and where edges correspond to influences between genes. the two results we formalize show that circuits of some kind must be present in the interaction graph if some behaviors are possible in the transition graph. this work was performed with the ssreflect extension of the Coq system.

关键词： Genetics Biological system modeling Evolution (biology) Circuits Biological information theory Proteins Network topology Production scientific computing Formal verification

来源：评论

学校读者我要写书评

暂无评论

Interactive vs. automated proofs in computational origami

Interactive vs. automated proofs in computational origami

引用

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

作者： Tetsuo Ida Department of Computer Science University of Tsukuba Tsukuba Japan

this talk focuses on two important and subtle aspects in the specification of geometrical modeling. these aspects concern the so-called non-degeneracy and incident conditions. Non-degeneracy ensures that the specification can preclude the possibility that the model in question does not collapse into a degenerate version of the original one. On the other hand, an incident condition specifies that a given point is not on a given line. While an incident condition is in many situations a natural property, it may be subtle in certain geometric modeling and may therefore lead to nondegeneracy conditions. In this talk, we explain the non-degeneracy and incident conditions in the Huzita's origami fold systems[1] that consist of (originally six) seven fold operations. We re-state Huzita's origami operations and prove their basic geometrical properties related to fold in Isabelle/HOL. We then formally (in Isabelle/HOL) show that some of these operations will collapse into other operations when degenerate and incident cases occur. the part of proofs, i.e. those that require algebraic simplification into solved form, are performed by Mathematica.

关键词： Solid modeling Face Computational modeling scientific computing Computer science Educational institutions numerical models

来源：评论

学校读者我要写书评

暂无评论

Unified Strategy for Feature Selection and Data Imputation

Unified Strategy for Feature Selection and Data Imputation

引用

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

作者： Camelia Vidrighin Bratu Rodica Potolea Computer Science Department Technical University of Cluj Napoca Cluj-Napoca Romania

Data-related issues represent the main causes for insufficient performance in data mining. Existing strategies for tackling these issues include procedures for handling incomplete data - mandatory in various schemes, and feature selection, both augmenting the learning process. Our previous work on data imputation has shown that a good imputation policy for strongly correlated attributes with the class can improve the learning accuracy. Moreover, feature selection also enhances the performance of an inducer. the focus of the paper is to validate the performance and stability of our combined methodology for pre-processing data. the novelty of the method resides in the combination of feature selection with data imputation, in order to obtain an improved version of the training set. the experimental results have shown that, when mining incomplete data, our combined pre-processing methodology boosts the accuracy of a classifier. Moreover, it is more successful than each of the individual steps it combines, feature selection and imputation, producing better or similar results.

关键词： Data mining Performance evaluation scientific computing Computer science Stability Humans Data analysis Data preprocessing Cleaning Filtering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 41 42 43 44 45 46 47 48 49 50 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：