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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Variant Implementations of SCBiCG Method for Linear Equations with Complex Symmetric Matrices

Variant Implementations of SCBiCG Method for Linear Equation...

引用

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

作者： Kuniyoshi Abe Seiji Fujino Economics and Information Gifu Shotoku University Gifu Japan Research Institute for Information Technology Kyushu University Fukuoka Japan

ISBN: (纸本)9781509004621

SCBiCG (Bi-Conjugate Gradient method for Symmetric Complex matrices) has been proposed for solving linear equations with complex symmetric matrices, where coefficients ci need to be set by users in SCBiCG. We have had the numerical results that the residual norms of SCBiCG do not converge when the coefficients ci are real. We therefore design an efficient implementation such that the coefficients ci which are complex are given by a computation. numerical experiments show that the residual norms of our proposed variant with the complex coefficients ci converge slightly faster than those of COCG (Conjugate Orthogonal Conjugate Gradient method) and some implementations of SCBiCG.

关键词： Symmetric matrices Gradient methods Computational efficiency Electronic mail Convergence Transforms scientific computing

来源：评论

学校读者我要写书评

暂无评论

Organic Structures Emerging From Bio-Inspired Graph-Rewriting Automata

Organic Structures Emerging From Bio-Inspired Graph-Rewritin...

引用

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

作者： Paul Cousin Aude Maignan CNRS Grenoble INP LJK Univ. Grenoble Alpes Grenoble France

Graph-Rewriting Automata (GRA) are an extension of Cellular Automata to a dynamic structure using local graph-rewriting rules. this work introduces linear algebra based tools that allow for a practical investigation of their behavior in deeply extended time scales. A natural subset of GRA is explored in different ways thereby demonstrating the benefits of this method. Some elements of the subset were discovered to create chaotic patterns of growth and others to generate organic-looking graph structures. these phenomena suggest a strong relevance of GRA in the modeling natural complex systems. the approach presented here can be easily adapted to a wide range of GRA beyond the chosen subset.

关键词： Adaptation models scientific computing Automata Directed graphs Linear algebra Behavioral sciences Topology

来源：评论

学校读者我要写书评

暂无评论

Satisfiability and theories

Satisfiability and Theories

引用

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

作者： Andrei Voronkov University of Manchester Institute of Science and Technology UK

Summary form only given. We give a simple introduction to satisfiability modulo theories intended for non-specialists. No previous background is assumed. the tutorial covers the following topics. 1) Propositional satisfiability. 2) DPLL as the main method for satisfiability checking. 3) Implementations of DPLL. 4) theories. 5) Decision procedures for theories. Congruence closure, the theory of arrays and linear arithmetic. 6) SMT: satisfiability modulo theories. How to convert a decision procedure for a set of literals to a DPLL modulo theory algorithm. 7) Satisfiability in a combination of theories. Instead of proving theorems, we will try to explain the main ideas using examples. the tutorial serves as a background for the second tutorial by Nikolaj Bjorner "SMT solvers for Testing, Program Analysis and Verification at Microsoft".

关键词： Surface-mount technology scientific computing Arithmetic Testing Logic

来源：评论

学校读者我要写书评

暂无评论

Proof of Useful Work Based on Matrix Computation

Proof of Useful Work Based on Matrix Computation

引用

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

作者： Cojocaru Dragos Universirty of Alexandru Ioan Cuza Iasi Romania

Due to the inherently wasteful nature of traditional proof of work mechanisms in blockchain networks, researchers are motivated to find alternatives that can make use of the computational power expended in the process. there are a number of such applications, however most of them target very specific problems, and few are proven to work in practice. this paper presents a proof of work mechanism based on matrix computation, serving a much wider range of applications while serving as the consensus mechanism of a blockchain network. I will cover the current research in the proof of useful work area, and focus on Proof of eXercise (PoX), another mechanism based on matrix computation. Proof of Computation (PoC), the consensus mechanism described in this paper, is a redesigned version of PoX. the mechanism is backed by a series of experiments that confirm the functionality of the protocol.

关键词： scientific computing Computational modeling Proof of Work Trustless services Consensus protocol numerical models Load modeling

来源：评论

学校读者我要写书评

暂无评论

Scalable and Fault Tolerant Monitoring of Security Parameters in the Cloud

Scalable and Fault Tolerant Monitoring of Security Parameter...

引用

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

作者： Bogdan-Constantin Irimie Dana Petcu Department of Computer Science West University of Timisoara Romania Institute e-Austria Timisoara Romania

Monitoring cloud resources is an essential part of cloud computing, and although some effort has been made in this direction, monitoring security parameters is still an open issue because of the large number and types of resources available in a multi tenant environment. In this paper we propose a distributed monitoring system that is able to monitor, filter and store security parameters of network hosts. the proposed system is decentralized, fault tolerant and can run scanning jobs in parallel, those three characteristics making it a perfect candidate for monitoring resources in a cloud environment. the proposed monitoring system was validated by a series of tests that demonstrated it's scalability. All the empirical results were analysed and conclusions were formulated based on the observed properties.

关键词： Monitoring Security Cloud computing Computer architecture Fault tolerance Fault tolerant systems Servers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：