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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Classes of Szilard Languages in NC^1

Classes of Szilard Languages in NC^1

引用

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

作者： Liliana Cojocaru Erkki Makinen Ferucio Laurentiu Tiplea Department of Computer Sciences University of Tampere Tampere Finland Department of Computer Science Alexandru loan Cuza University of Iaşi Iaşi Romania

We prove that Szilard languages of context-free grammars can be accepted by an indexing alternating Turing machine (indexing ATM) in logarithmic time and space. the same result holds for leftmost Szilard languages of unrestricted (phrase-structure or type 0) grammars. Since the class of languages recognizable by an indexing ATM in logarithmic time equals the U E -uniform NC 1 class, we obtain that the above classes of Szilard languages are in NC 1 . the inclusions are strict, since there exist languages in NC 1 that cannot be Szilard languages of any context-free or unrestricted grammar.

关键词： Indexing Character generation Turing machines Production Digital signal processing scientific computing Computer science Upper bound Boolean functions Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

VIAP - Automated System for Verifying Integer Assignment Programs with Loops

VIAP - Automated System for Verifying Integer Assignment Pro...

引用

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

作者： Pritom Rajkhowa Fangzhen Lin Department of Computer Science The Hong Kong University of Science and Technology Kowloon Hong Kong

ISBN: (纸本)9781538626276

this paper describes an automated system, VIAP, for proving the correctness of procedural programs with integer assignments and loops. VIAP does not require loop-invariants to verify the correctness of programs. It also includes functionalities resulting from the extension of existing work about program translation into FOL by solving recurrences generated during translation. this system is also able to prove partial correctness of programs, given precondition(s) and postcondition(s), without using loop invariants. We validate these claims by showing that VIAP can successfully prove the benchmark programs used by invariant-generating tools in literature for their validation, without the requirement of the generation of these loop-invariants. the system is fully automatic and points to a new way of proving properties of programs.

关键词： Benchmark testing Closed-form solutions Tools scientific computing Indexes Python

来源：评论

学校读者我要写书评

暂无评论

Obfuscation Techniques Based on Random Strings Used in Malicious VBA Scripts

Obfuscation Techniques Based on Random Strings Used in Malic...

引用

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

作者： Lupascu Marilena "Al.I. Cuza" University - Faculty of Computer Science Iaşi România

the script-based attacks are still in trend when it comes to malicious files. the main attack vectors are represented by the documents sent to victims as email attachments. Besides the tricks used by the attackers to persuade the victim to download and open the received documents, also, the attackers try their best to avoid the detection of security products. the obfuscation of the code is the main technique used in script-based attacks to evade *** paper presents a study on VBA-malware obfuscation techniques based on the usage of generated random strings. this technique is an obvious mark of obfuscated and, further, malicious code. Hence, the main concern in malicious code analysis is to identify as many randomly generated identifiers as possible.

关键词： Visual BASIC Codes scientific computing Market research Malware Security

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Particle Swarm Optimizer Using Balanced Explorative and Exploitative Behaviors

An Adaptive Particle Swarm Optimizer Using Balanced Explorat...

引用

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

作者： Sayan Ghosh Debarati Kundu Kaushik Suresh Swagatam Das Ajith Abraham Department of Electronics and Telecommunication Engineering Jadavpur University Kolkata India Center of Excellence for Quantifiable Quality of Service Norwegian University of Science and Technology Trondheim Norway

Particle Swarm Optimization (PSO) has recently emerged as a nature inspired algorithm for real parameter optimization. this article describes a method for improving the final accuracy and the convergence speed of PSO by adding a new coefficient to the position updating equation and modulating the inertia weight. this work also mathematically analyzes the effect of this modification on the PSO algorithm. the new algorithm has been shown to be statistically significantly better than four recent variants of PSO on a six functions test suite.

关键词： Particle swarm optimization Equations Convergence Acceleration scientific computing Quality of service Algorithm design and analysis Testing Stochastic processes Random variables

来源：评论

学校读者我要写书评

暂无评论

Data Flow Entropy Collector

Data Flow Entropy Collector

引用

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

作者： Alin Suciu Kinga Marton Zoltan Antal Department of Computer Science Technical University of Cluj Napoca Cluj-Napoca Romania

Collecting entropy from various sources available within a regular PC and combining them in an entropy pool is often used as an alternative to pseudo random number generation. Cheaper than using a hardware true random number generator (TRNG), this method offers a good approximation of a TRNG, commonly known as an unpredictable random number generator. the source of unpredictability is ultimately the human-computer interaction that, when complex enough, is irreproducible by an adversary. the present paper proposes a novel approach to combining the entropy from various sources in a data flow manner, thus increasing the degree of unpredictability. the result is a highly unpredictable random number generator, of potentially good quality.

关键词： Entropy Random number generation Mice Keyboards Hardware Sampling methods Timing Linux Pulse modulation scientific computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：