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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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 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

来源：评论

学校读者我要写书评

暂无评论

Various Enhancements for Extended Hensel Construction of Sparse Multivariate Polynomials

Various Enhancements for Extended Hensel Construction of Spa...

引用

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

作者： Tateaki Sasaki Daiju Inaba University of Tsukuba Ibaraki Japan The Mathematics Certification Institute of Japan Tokyo Japan

ISBN: (纸本)9781509057085

the extended Hensel construction (EHC) is a direct extension of the generalized Hensel construction (GHC), and it targets sparse multivariate polynomials for which the GHC breaks down. the EHC consists of two Hensel constructions which we call separation of "maximal" and "minimal" Hensel factors (see the text). As for the minimal Hensel factor separation, very recently, we enhanced the old algorithm largely by using Groebner basis of two initial factors and syzygies for the elements of the basis. In this paper, we first improve the old algorithm for maximal Hensel factors. We then enhance further the Groebner basis computation in our recent algorithm. the latter is based on a theoretical analysis of the Groebner bases. Simple experiments show that the improved part for the minimal Hensel factors is much faster than the recent one.

关键词： Nickel Algorithm design and analysis scientific computing Interpolation

来源：评论

学校读者我要写书评

暂无评论

Combining Old-Fashioned Computer Go with Monte Carlo Go

Combining Old-Fashioned Computer Go with Monte Carlo Go

引用

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

作者： Florin Chelaru Liviu Ciortuz Faculty of Computer Science University Al.I.Cuza of Iasi Iasi Romania Faculty of Computer Science-Computer Science Department University Al.I.Cuza of Iasi Iasi Romania

In this paper we discuss the idea of combining old-fashioned computer Go with Monte Carlo Go. We introduce an analyze-after approach to random simulations. We also briefly present the other features of our present Monte Carlo implementation with upper confidence trees. We then explain our approach to adding this implementation as a module in the GNU Go 3.6 engine, and finally show some preliminary results of the entire work, ideas for future work and conclusions.

关键词： Monte Carlo methods Computational modeling Computer science Artificial intelligence Engines scientific computing Algorithm design and analysis Analytical models Computer simulation Law

来源：评论

学校读者我要写书评

暂无评论

Designing a Dynamic Replication Engine for Grid Shared Data Programming

Designing a Dynamic Replication Engine for Grid Shared Data ...

引用

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

作者： Georgiana Macariu Dacian Tudor Vladimir Cretu Computer Science and Engineering Department Polytechnic University of Timisoara Timisoara Romania

Besides the complexity of grid application programming, achieving high performance has become a real challenge in large scale grid systems mainly because of the high latencies and unpredictable communication paths. We follow the idea of shared data programming in grid environments and we design a replication component for a shared data programming framework with dynamic replication capabilities. We define several replication policies that are dynamically used during the application life-cycle in order to minimize the communication cost and provide better performance. We evaluate several application scenarios in order to prove that dynamic policy based replication can improve the overall application performance and reduce resource access time.

关键词： Dynamic programming Engines Availability Object oriented modeling scientific computing Algorithm design and analysis Computer science Data engineering Design engineering Application software

来源：评论

学校读者我要写书评

暂无评论

Building customized Named Entity Recognition models for specific process automation tasks

Building customized Named Entity Recognition models for spec...

引用

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

作者： Vasile Ionut Iga Gheorghe Cosmin Silaghi Business Informatics Research Center Babes-Bolyai University Cluj-Napoca Romania

In the context of a project aiming to build human-behaving robots for process automation, named entity recognition (NER) becomes one of the first tasks to solve. this paper presents our experience on building NER models for recognizing specific entities of interest, with the help of the state-of-the-art pre-trained BERT model. Noticing that the model built with the help of a general knowledge dataset scores poor results in retrieving entities specific to our particular use cases, we constructed two datasets tailored for our context and trained BERT-based models on it. We show that properly constructing the specific datasets is sufficient in order to obtain a good entity classification performance, without further increasing the model learning time.

关键词： Training Automation Target recognition scientific computing Computational modeling Buildings Predictive models

来源：评论

学校读者我要写书评

暂无评论

CSPs and Connectedness: P/NP Dichotomy for Idempotent, Right Quasigroups

CSPs and Connectedness: P/NP Dichotomy for Idempotent, Right...

引用

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

作者： Robert W. McGrail James Belk Solomon Garber Japheth Wood Benjamin Fish Reem Kayden Center for Science and Computation Bard College New York Department of Mathematics University of Illinois at Chicago Chicago IL

In the 1990's, Jeavons showed that every finite algebra corresponds to a class of constraint satisfaction problems. Vardi later conjectured that idempotent algebras exhibit P/NP dichotomy: Every non NP-complete algebra in this class must be tractable. Here we discuss how tractability corresponds to connectivity in Cayley graphs. In particular, we show that dichotomy in finite idempotent, right quasi groups follows from a very strong notion of connectivity. Moreover, P/NP membership is first-order axiomatizable in involutory quandles.

关键词： Algebra Polynomials Educational institutions scientific computing Roads Marine animals

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance Using a Front-End Service for Large Scale Distributed Systems

Fault Tolerance Using a Front-End Service for Large Scale Di...

引用

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

作者： Marieta Nastase Ciprian Dobre Florin Pop Valentin Cristea Faculty of Automatics and Computer Science University Politehnica of Bucharest Romania

In this paper we present a solution to ensuring a high degree of availability and reliability in service-based large scale distributed systems. the proposed architecture is based on a set of replicated services running in a fault-tolerant container and a proxy service able to mask possible faults, completely transparent for a client. the solution not only masks possible faults but also optimizes the access to the distributed services and their replicas using a load-balancing strategy, whilst ensuring a high degree of scalability. the advantages of the proposed architecture were evaluated using a pilot implementation. the obtained results prove that the solution ensures a high degree of availability and reliability for a wide range of service-based distributed systems.

关键词： Fault tolerant systems Large-scale systems Availability Fault tolerance Containers Scalability scientific computing Computer science Computer architecture Instruments

来源：评论

学校读者我要写书评

暂无评论

symbolic Regression with augmented dataset using RuleFit

Symbolic Regression with augmented dataset using RuleFit

引用

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

作者： Fabricio Olivetti de Franca Universidade Federal do ABC Center for Mathematics Computing and Cognition (CMCC) Heuristics and Analysis Laboratory (HAL) Santo Andre Brazil

symbolic Regression models are often associated with transparency and interpretability. the main motivation is their ability to describe nonlinear models balancing accuracy and conciseness. But, in practice, it may generate models that are hard to understand at the same level as opaque models. From another perspective, linear models are guaranteed to be transparent but fail to model nonlinearities and interactions. the algorithm RuleFit uses a tree-based nonlinear model to create meta-features augmenting the dataset, increasing the accuracy of the linear models while maintaining their transparency. In this paper we test whether this augmented dataset can help symbolic Regression models to find more transparent models without reducing the overall accuracy. the results indicate that the augmented models have a slightly better accuracy on a class of benchmarks while keeping the expression size small and closer to a linear model. As a caveat, the models also tend to become closer to a step function which limits the interpretability of the studied phenomena.

关键词： Analytical models scientific computing Benchmark testing Data models

来源：评论

学校读者我要写书评

暂无评论

Challenges in Verifying Arithmetic Circuits Using Computer Algebra

Challenges in Verifying Arithmetic Circuits Using Computer A...

引用

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

作者： Armin Biere Manuel Kauers Daniela Ritirc Johannes Kepler University Linz Linz Austria

ISBN: (纸本)9781538626276

Verifying arithmetic circuits is an important problem which still requires considerable manual effort. For instance multipliers are considered difficult to verify. the currently most effective approach for arithmetic circuit verification uses computer algebra. In this approach the circuit is modeled as a set of pseudo-boolean polynomials and it is checked if the given word-level specification is implied by the circuit polynomials. For this purpose the theory of Gröbner bases is used. In this paper we give a summary of two recent papers on this work. We reword the theory and illustrate the results of these papers by examples. We also present a new technical theorem which allows to rewrite local parts of the Gröbner basis. Rewriting the Gröbner basis has tremendous effect on computation time.

关键词： Logic gates Algebra Integrated circuit modeling Computational modeling Adders scientific computing Manuals

来源：评论

学校读者我要写书评

暂无评论

Branch Differences and Lambert W

Branch Differences and Lambert W

引用

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

作者： D.J. Jeffrey J.E. Jankowski Department of Applied Mathematics The University of Western Ontario London Canada

the Lambert W function possesses branches labelled by an index k. the value of W therefore depends upon the value of its argument z and the value of its branch index. Given two branches, labelled n and m, the branch difference is the difference between the two branches, when both are evaluated at the same argument z. It is shown that elementary inverse functions have trivial branch differences, but Lambert W has nontrivial differences. the inverse sine function has real-valued branch differences for real arguments, and the natural logarithm function has purely imaginary branch differences. the Lambert W function, however, has both real-valued differences and complex-valued differences. Applications and representations of the branch differences of W are given.

关键词： Equations Educational institutions Indexes Presses scientific computing Electronic mail

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：