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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Practical Issues in Implementing TRNGs in FPGAs Based on the Ring Oscillator Sampling Method

Practical Issues in Implementing TRNGs in FPGAs Based on the...

引用

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

作者： Octavian Cret Alin Suciu Tamas Gyorfi Department of Computer Science Technical University of Cluj Napoca Cluj-Napoca Romania

Field programmable gate arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. For all such systems, random numbers are essential. One of the most well-known methods for producing true random number sequences in FPGAs is based on the phenomenon of jitter and built upon ring oscillators. this paper describes how to overcome the placement sensitivity caused by the different physical properties of the logic elements, thus extending the portability of TRNGs on various FPGA boards. Our design offers an easy implementation, but in the same time maintains the good quality and high generation throughput of random numbers.

关键词： Field programmable gate arrays Ring oscillators Sampling methods Random number generation Semiconductor device noise Cryptography Chaos Jitter throughput scientific computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Distributed Algorithm for Critical Area Detection in Satellite Imagery

A Distributed Algorithm for Critical Area Detection in Satel...

引用

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

作者： Razvan Alecsandrescu Florin Pop Valentin Cristea Faculty of Automatics and Computer Science University Politehnica of Bucharest Romania

this paper presents a distributed algorithm for critical area detection in satellite imagery. the detection of critical area is very important in natural disaster detection and control. the algorithm uses the distributed change detection methods for multiple spectral bands in satellite images and combines changes which have appeared during a period of time. the result shows a critical area for analyzed time interval. the algorithm is distributed for support a large amount of data. the distributed approach shows a decrease in processing time with the increase of the number of workers. the presented algorithm represents a component from MedioGRID system, which implemented a real-time satellite image processing system for extracting relevant environmental and meteorological parameters on Grid systems. the critical area detection application will be integrated in Grid environments.

关键词： Distributed algorithms Satellites Change detection algorithms Clustering algorithms Earthquakes Detection algorithms Grid computing Iterative algorithms Image processing MODIS

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Techniques for Proof-Based Synthesis of Sorting algorithms

Combinatorial Techniques for Proof-Based Synthesis of Sortin...

引用

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

作者： Isabela Drämnesc Tudor Jebelean Sorin Stratulat Dept. of Comput. Sci. West Univ. Timisoara Romania Research Institute for Symbolic Computation Johannes Kepler University Linz Austria Department of Computer Science Université de Lorraine Metz LITA France

In the frame of our previous experiments for proof based synthesis of sorting algorithms for lists and for binary trees, we employed certain special techniques which are able to generate multiple variants of sorting and merging, by investigating all combinations of auxiliary functions available for composing objects (lists, respectively trees). the purpose of this paper is to describe this technique and the results obtained. We present the main principles and the application of this technique to merging of sorted binary trees into a sorted one. Remarkably, merging requires a nested recursion, for which an appropriate induction principle is difficult to guess. Our method is able to find it automatically by using a general Noetherian induction and the combinatorial technique.

关键词： Binary trees Sorting Electronic mail Merging Cognition Inference algorithms Computer science

来源：评论

学校读者我要写书评

暂无评论

Deciding Conjugacy in thompson's Group F in Linear Time

Deciding Conjugacy in Thompson's Group F in Linear Time

引用

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

作者： Nabil Hossain Robert W. McGrail James Belk Francesco Matucci Laboratory for Algebraic and Symbolic Computation Bard College Annandle-on-Hudson New York USA Departement de Mathématiques Orsay Cedex France

We present an efficient implementation of the solution to the conjugacy problem in thompson's group F, a certain infinite group whose elements are piecewise-linear homeomorphisms of the unit interval. this algorithm checks for conjugacy by constructing and comparing directed graphs called strand diagrams. We provide a comprehensive description of our solution algorithm, including the data structure that stores strand diagrams and methods to simplify them. We prove that our algorithm theoretically achieves a linear time bound in the size of the input, and we present a quadratic time working solution.

关键词： Data structures Bismuth Algorithm design and analysis Chemical elements Electronic mail Generators Java

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Massimiliano Rak Mauro Turtur Umberto Villano Department of Industrial and Information Engineering Second University of Naples Aversa Italia

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.

关键词： Computational modeling Predictive models Benchmark testing Corporate acquisitions Load modeling Prediction algorithms Cloud computing

来源：评论

学校读者我要写书评

暂无评论

FERPModels: A Certification Framework for Expansion-Based QBF Solving

FERPModels: A Certification Framework for Expansion-Based QB...

引用

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

作者： Vedad Hadžić Roderick Bloem Ankit Shukla Martina Seidl Graz University of Technology Graz Austria Johannes Kepler University Linz Linz Austria

Modern expansion-based solvers for quantified Boolean formulas (QBFs) are successful in many applications. However, no such solver supports the generation of proofs needed to independently validate the correctness of the solving result and for the extraction of winning strategies which encode concrete solutions to the application *** this paper, we present a complete tool chain for proof generation, result validation, and for universal winning strategy extraction in the context of expansion-based solving. In particular, we introduce a proof format for the ∀Exp-Res calculus on which expansion-based solving is founded, implement proof generation in a recent QBF solver, provide a checker for these proofs, and develop a new strategy extraction algorithm.

关键词： scientific computing Calculus Certification

来源：评论

学校读者我要写书评

暂无评论

Time Slot Groups - A Data Structure for QoS-Constrained Advance Bandwidth Reservation and Admission Control

Time Slot Groups - A Data Structure for QoS-Constrained Adva...

引用

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

作者： Mugurel Ionut Andreica Nicolae Tapus Computer Science and Engineering Department Politehnica University of Bucharest Bucharest Romania

In this paper we present time slot groups (TSG), a novel, efficient data structure for QoS-constrained advance bandwidth reservation and admission control. the data structure divides the time horizon into T equally sized time slots and can be used for serving efficiently complex bandwidth reservation requests specifying the duration of the reservation, the minimum required bandwidth, the earliest possible starting time and the latest possible finish time. the data structure supports reservation queries in time O(k+(T/k)* log(k)) and reservation updates in time O(k+(T/k)), where k is a user-defined parameter.

关键词： Data structures Bandwidth Admission control Streaming media scientific computing Computer science Data engineering Time factors Multimedia systems Testing

来源：评论

学校读者我要写书评

暂无评论

Soundness of a Logic-Based Verification Method for Imperative Loops

Soundness of a Logic-Based Verification Method for Imperativ...

引用

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

作者： Madalina Erascu Tudor Jebelean Research Institute for Symbolic Computation Johannes Kepler University Linz Linz Austria

We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness. the verification method consists in generating verification conditions for total correctness of an imperative loop annotated with an invariant. We realized, in the \textit{theorem a} system (\url{***}), the automatic proof of the soundness of verification method: if the verification conditions hold, then the imperative loop is totally correct with respect to its given invariant. the approach is simpler than the others because it is based on functional semantics (no additional theory of program execution is necessary) and produces verification conditions in the object theory of the program. the computer-supported proofs reveal the minimal collection of logical assumptions (some from natural number theory) and logical inferences (including induction) which are necessary for the soundness of the verification technique.

关键词： Semantics Syntactics Arrays Indexes Programming Calculus Cognition

来源：评论

学校读者我要写书评

暂无评论

Using N-Gram Variations in Static Analysis for Malware Detection

Using N-Gram Variations in Static Analysis for Malware Detec...

引用

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

作者： Marco Radovancovici Darius Galiş Ciprian Pungilă Faculty of Mathematics and Informatics West University of Timişoara Timişoara Romania

Most of intrusion detection systems nowadays employ signature based analysis that often fails when newer or modified malware versions are brought into play. Intrusion detection systems working with cryptanalysis would offer some advantages against obfuscated code or newly derived viruses based on classic exploits. In this paper, we are applying an index of coincidence approach from cryptanalysis with a N-gram pattern-matching technique on recent binaries, to attempt classification of malicious code. those characteristics are studied with the use of modern data mining methods, namely K-means, to discover interesting clusters for classification and properties of malicious behavior. the challenges of gathering, working with, learning from and classifying large amounts of virus datasets with different techniques are explored.

关键词： Codes Computer viruses scientific computing Intrusion detection Clustering algorithms Static analysis Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：