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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Factorizations of Regular Hedge Languages

Factorizations of Regular Hedge Languages

引用

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

作者： Mircea Marin Adrian Craciun Department of Computer Science University of Tsukuba Tsukuba Japan Department of Computer Science West University of Timişoara Timisoara Romania

Regular hedge languages are an extension of regular tree languages that received renewed attention since their recognition as a formal model of XML schemata. they share several properties with regular languages, but their study is more involved because we need to analyze regularities of sequences of trees instead of words. We show that one shared property is the existence of only finitely many language factors and the possibility to compute and arrange them in a factor matrix with some remarkable properties. We outline an algorithm for the computation of the factor matrix and indicate an application of the factor matrix of an RHL to the solution of a concrete language reconstruction problem.

关键词： XML Computer science Concrete Specification languages scientific computing Chromium Automata Testing

来源：评论

学校读者我要写书评

暂无评论

Simplification and Generalization in CIRC

Simplification and Generalization in CIRC

引用

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

作者： Eugen-Ioan Goriac Georgiana Caltais Dorel Lucanu Faculty of Computer Science Alexandru Ioan Cuza슠University Iasi Romania

CIRC is an automated theorem prover based on the circular coinduction principle. the tool is used for the verification of programs, behavioral equivalence checking, and proving properties over infinite data structures. In this paper we present two extensions of CIRC that handle the case when the prover indicates an infinite execution for a certain goal. the first extension involves goal simplification rules and a procedure for checking that the new execution is indeed a proof, while the second one refers to finding and proving a generalization of the goal. Each of the extensions is presented based on a case study: Binary Process Algebra (BPA) for checking the proof correctness and Streams for using generalization.

关键词： Computer science Humans scientific computing Data structures Algebra Application software

来源：评论

学校读者我要写书评

暂无评论

Using a fUML Action Language to Construct UML Models

Using a fUML Action Language to Construct UML Models

引用

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

作者： Codrut Lucian Lazar Ioan Lazar Bazil Parv Simona Motogna Istvan Gergely Czibula Dept. of Comput. Sci. Babes-Bolyai Univ. Cluj-Napoca Romania Department of Computer Science Babe-Bolyai University Cluj-Napoca Romania

In this paper we introduce a fUML based action language and describe its concrete syntax. the action language uses only elements allowed by the fUML standard for its abstract syntax. the concrete syntax resembles the syntax of existing structured programming languages, with some elements inspired by OCL. the action language is part of the ComDeValCo framework and we are using it to model the functionality of the components, to simulate the execution of the models and to test the models.

关键词： Unified modeling language Concrete Computer languages Packaging Testing Java scientific computing Computer science Computational modeling DSL

来源：评论

学校读者我要写书评

暂无评论

Superfluous S-polynomials in Strategy-Independent Groebner Bases

Superfluous S-polynomials in Strategy-Independent Groebner B...

引用

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

作者： Grant Olney Passmore Leonardo de Moura LFCS University of Edinburgh Edinburgh UK Microsoft Research Limited Redmond WA USA

Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Groebner basis procedures and prove the correctness of two classical criteria for recognising superfluous S-polynomials, Buchberger's criteria 1 and 2, w.r.t. arbitrary fair and correct basis construction strategies. To do so, we develop a general method for proving the strategy-independent correctness of superfluous S-polynomial criteria which seems to be quite powerful. We also derive a new superfluous S-polynomial criterion which is a generalisation of Buchberger-1 and is proved to be correct strategy-independently.

关键词： Polynomials Algebra Equations Inference algorithms scientific computing Commutation Machinery Sufficient conditions Crystallization Quantum computing

来源：评论

学校读者我要写书评

暂无评论

Solving Nonsmooth Interval Equations with Slopes

Solving Nonsmooth Interval Equations with Slopes

引用

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

作者： Rongfen Lin Hao Jiang Lizhi Cheng School of Science National University of Defense Technology Changsha China

In this paper, the problem of finding all zeros of an continuously interval function in a given interval is considered. A new method for solving this problem is proposed. It is based on the idea of isolating the endpoints of interval zeros and the technique of interval slopes. We develop the theory of the new method and apply it on a set of smooth functions and a set of nonsmooth functions respectively. In case of smooth functions, We compare the new method to a similar one from [6]. And the numerical results show the efficiency of our new *** case of nonsmooth functions, we can gain the reliable results too. As far as know, the method we proposed is the first one which could solve the nonsmooth interval functions.

关键词： Newton method Nonlinear equations scientific computing Differential equations Transforms

来源：评论

学校读者我要写书评

暂无评论

Finding the Solutions of Nonlinear Equation Systems from an Interval

Finding the Solutions of Nonlinear Equation Systems from an ...

引用

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

作者： Cristian Cira Mihai Fac. of Exact Sci. Aurel Vlaicu Univ. of Arad Arad Romania

the paper describes an algorithm that determines the solutions of a n-dimensional nonlinear equation system within a given interval. the result is based on Semenov algorithm that isolates the solutions and improves upon it by introducing Kantorovich existence criterion. In Semenov algorithm the existence of the solution is decided by applying Newton method on each interval containing at most one solution. this article improves and completes the Semenov algorithm by determining the start iteration for each solution. With the computed start iteration the Newton method is applied to determine the solution with the precision e. the Kantorovich error function E(k) is also computed for each iteration k. the paper contains numerical experiments.

关键词： Nonlinear equations Newton method Iterative methods scientific computing Convergence of numerical methods Jacobian matrices Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

A Bray-Curtis Weighted Automaton for Detecting Malicious Code through System-Call Analysis

A Bray-Curtis Weighted Automaton for Detecting Malicious Cod...

引用

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

作者： Ciprian-Petrisor Pungila Faculty of Mathematics and Informatics Computer Science Department West University of Timisoara Timisoara Romania

Malicious code detection is one of the top subjects of interest for intrusion detection systems in today9;s computer security research areas. In this paper we propose a new heuristic method for detecting malicious ... 详细信息

Malicious code detection is one of the top subjects of interest for intrusion detection systems in today's computer security research areas. In this paper we propose a new heuristic method for detecting malicious code through system call matching, which also takes in consideration the time of the system call, by using an adaptive search for an extended Aho-Corasick automaton supporting a subset of the regular expressions language, through the use of a normalization technique known as the Bray-Curtis (Sorensen) distance. We will also discuss how this technique can be applied to enrich the set of existing rules from the knowledge base for improving the detection rate.

关键词： Automata Intrusion detection Pattern analysis Algorithm design and analysis Performance analysis scientific computing Mathematics Informatics Computer science

来源：评论

学校读者我要写书评

暂无评论

Relational Operators in Heterogeneous Random Databases

Relational Operators in Heterogeneous Random Databases

引用

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

作者： Letitia Velcescu Laurentiu Vasile Faculty of Mathematics and Informatics University of Bucharest Bucharest Romania

In this paper, we investigate the sizes of some approximate relational operations results, focusing on join, outer join and difference. We extend the notion of random database, in which the records are random vectors following a certain probability distribution, to heterogeneous random databases, in which each column can have its own unidimensional distribution. In this framework, we will investigate if the results already existing for the homogeneous databases remain true. Our approach follows three steps. First, we build up the histograms for some relational operations on heterogeneous tables with specific distributions, then we apply the chi square test of goodness of fit and, in the end, we prove the result that sets the limits for which the cardinality of the self-join can be approximated by a Poisson distribution.

关键词： Relational databases scientific computing

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Yanli Huang Dongming Wang LMIB-SKLSDE-School of Mathematics and Systems Science Beihang University Beijing China Laboratoire d'Informatique de Paris 6 Université Pierre et Marie Curie CNRS Paris France

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.

关键词： Solid modeling Polynomials Equations scientific computing Mathematics Topology Application software Computer applications Sampling methods Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Dynamic Customization of Data Structures Instances Using an Agent Based Approach

Dynamic Customization of Data Structures Instances Using an ...

引用

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

作者： Istvan Gergely Czibula Gabriela Czibula Adriana Mihaela Guran Department of Computer Science Babeş-Bolyai University Cluj-Napoca Romania

Abstract data types (ADTs) represent the core for any software application, and a proper use of them is an essential requirement for developing a robust and efficient system. Moreover, a proper instantiation of a data structure that implements an abstract data type can greatly impact the performance of the system. In this paper we propose a learning approach for the dynamic configuration of data structures instances in a software system. In order to adapt a data structure to the system's current execution context, a neural network will be used and an agent based system is proposed. We experimentally evaluate our system on a case study, emphasizing the advantages of the proposed approach.

关键词： Data structures Software systems Application software Supervised learning Robustness Software algorithms scientific computing Computer science Neural networks Machine learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共59页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：