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

International Siberian Conference on Control and Communications (SIBCON)

作者： Popov, Artem A. Bilevich, Dmitry V. Salnikov, Andrei S. Dobush, Igor M. Kalentyev, Alexey A. Goryainov, Aleksandr E. Tomsk State Univ Control Syst & Radioelect Tomsk Russia

ISBN: (纸本)9781538651421

Compact large-signal modeling of nonlinear MMIC devices is a one of the most essential topics for the microwave community. Many different nonlinear modeling techniques have been suggested in the last years and a significant progress has been made in measurement tools. However, as the number of measured points increases, traditional verification approaches based on simple comparison between measured and simulated data become inefficient and time consuming. Moreover, in order to avoid inconsistent errors, every new nonlinear modeling technique should be verified for convergence and repeatability of the results being obtained before real applications. In this paper a simple approach to verify the convergence of the automatic nonlinear modeling technique will be discussed. Also, an algorithm of automatic verification of a compact HEN IT model directly in commercial EDA NI AWR Design Environment is demonstrated.

关键词： HEVIT transistors semiconductor device extraction large-signal modeling automatic nonlinear modeling verification algorithm

来源：评论

学校读者我要写书评

暂无评论

Safe Diagnosability of Fuzzy Discrete-Event Systems and a Polynomial-Time verification

引用

IEEE TRANSACTIONS ON FUZZY SYSTEMS 2015年第5期23卷 1534-1544页

作者： Liu, Fuchun Guangdong Univ Technol Sch Comp Guangzhou 510006 Guangdong Peoples R China

Since fuzzy discrete-event systems (FDESs) were significantly brought forward, the study of FDESs has received increasing attention recently. This paper addresses the safe diagnosability under the framework of FDESs. The contributions are threefold. First, the notion of safe diagnosability for fuzzy systems is formalized. A safe diagnosable FDES means that not only each failure can be detected in terms of fuzziness, as well as the detection must be completed before any unsafe operation is executed. Then, a necessary and sufficient condition of safe diagnosability of FDESs is proposed by constructing the safe diagnoser. Finally, we present an algorithm for verifying the safe diagnosability of FDESs based on a constructive nondeterministic automaton, namely verifier. It is worth noting that both constructing the verifier and verifying the safe diagnosability of FDESs can be realized with a polynomial complexity.

关键词： Discrete-event systems failure diagnosis fuzzy automata safe diagnosability verification algorithm

来源：评论

学校读者我要写书评

暂无评论

Independent endpoint event review for the elimination of reporting bias in an open label phase III pharmaceutical trial

引用

TRIALS 2015年第SUPPL 2期16卷 P188-P188页

作者： Hall, Peter Waterhouse, Anna Smith, Isabelle Brown, Julia Gregory, Walter Steger, Guenther Bell, Richard Cameron, David Univ Edinburgh Edinburgh Midlothian Scotland Univ Leeds Leeds W Yorkshire England Andrew Love Canc Ctr Geelong Vic Australia Med Univ Vienna Vienna Austria

来源：评论

学校读者我要写书评

暂无评论

An On-The-Fly Approach for the verification of Opacity in Critical Systems 23

An On-The-Fly Approach for the Verification of Opacity in Cr...

引用

23rd IEEE International Conference on Enabling Technologies, Infrastructure for Collaborative Enterprises (WETICE)

作者： Klai, Kais Hamdi, Nawel Ben Hadj-Alouane, Nejib Univ Paris 13 LIPN CNRS UMR 7030 Sorbonne Paris Cite F-93430 Villetaneuse France ElManar Univ Natl Sch Engineers Tunis OASIS Lab El Manar Tunisia

ISBN: (纸本)9781479942497

Opacity is an important security property dealing with the hiding and keeping secret, a subset of a system's behaviour from external observers. A system is characterised as "opaque" if it can effectively hide specific actions from an intruder or attacker. As the need for opacity, and similar fundamental secrecy properties may arise in a wide range of applications and sectors, like health care, banking, trading and voting systems,... etc., providing efficient tools for its verification becomes important, especially for large-scale real-world systems. In this paper, we formulate opacity, based on labeled transition systems models, and provide an efficient verification algorithm within the framework of a hybrid on-the-fly approach. Our verification strategy is based on the construction of a symbolic observation graph, allowing for the abstraction of the system's behaviour, while preserving the necessary structure needed for the checking of the opacity property dealt with in this paper. The preliminary implementation of our algorithm and the provided experimental results are promising, and demonstrate its effectiveness in face of the exponential state explosion problem, compared with existing techniques.

关键词： formal verification graph theory security of data critical systems exponential state explosion problem hybrid on-the-fly approach labeled transition systems models opacity property opacity verification secrecy property security property symbolic observation graph verification algorithm Aggregates Computers Context Data structures Educational institutions Observers Security critical systems Opacity Data Security Educational institutions Formal verification Data structures Graph theory Computers system behavior Observers verification Security

来源：评论

学校读者我要写书评

暂无评论

verification-Based Interval-Passing algorithm for Compressed Sensing

引用

IEEE SIGNAL PROCESSING LETTERS 2013年第10期20卷 933-936页

作者： Wu, Xiaofu Yang, Zhen Nanjing Univ Posts & Telecommun Inst Signal Proc & Transmiss Nanjing 210003 Jiangsu Peoples R China

We propose a verification-based Interval-Passing (IP) algorithm for iteratively reconstruction of nonnegative sparse signals using parity check matrices of low-density parity check (LDPC) codes as measurement matrices. The proposed algorithm can be considered as an improved IP algorithm by further incorporation of the mechanism of verification algorithm. It is proved that the proposed algorithm performs always better than either the IP algorithm or the verification algorithm. Simulation results are also given to demonstrate the superior performance of the proposed algorithm.

关键词： Compressed sensing interval-passing algorithm low-density parity-check (LDPC) codes sparse measurements verification algorithm

来源：评论

学校读者我要写书评

暂无评论

Workflow process modelling and resource allocation based on polychromatic sets theory

引用

ENTERPRISE INFORMATION SYSTEMS 2013年第2期7卷 198-226页

作者： Gao, Xinqin Xu, Lida Wang, Xueping Li, Yan Yang, Mingshun Liu, Yong Xian Univ Technol Sch Mech & Precis Instrument Engn Xian 710048 Peoples R China Shanghai Jiao Tong Univ Antai Coll Econ & Management Shanghai 200052 Peoples R China Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Old Dominion Univ Dept Informat Technol & Decis Sci Norfolk VA 23529 USA Xi An Jiao Tong Univ Sch Econ & Finance Xian 710061 Peoples R China

In workflow management, studying the relationship between workflow process activities and resource allocation is one of the interesting research topics. Polychromatic sets theory (PST) is a relatively new mathematical theory which is especially suitable for treating such problems. Based on PST, this paper proposes a framework of workflow process modelling and resource allocation. As the theoretical foundation, polychromatic sets (PS), polychromatic graph (PG) and isolation operation (IO) of the PS are introduced. Special net structure (SNS), a special PG with colourless nodes and concolourous edges, is also introduced, and a new workflow process model and its verification algorithm are presented. Furthermore, a workflow resource model based on the entity of PS is developed. Based on IO of PS, the allocation mechanism that considers workflow process and workflow resource is proposed. Finally, a case study is provided to demonstrate the effectiveness of the above-mentioned theory and method.

关键词： workflow process model resource model polychromatic sets polychromatic graph special net structure hash table isolation operation verification algorithm

来源：评论

学校读者我要写书评

暂无评论

verification algorithm of a Sequential Circuit's Equivalence Based on State Transfer Graph

Verification Algorithm of a Sequential Circuit's Equivalence...

引用

2008 2nd International Symposium on Information Technologies and Applications in Education(ISITAE2008)

作者： Wei Li 1,2 , Desheng Yang 1,2 , Ying Lu 1,2 ,Yichao Zhang 1,2 1 Institute of Computer Science and Technology , Anhui University ,Hefei,China 2 Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education, Hefei,Anhui University

An equivalence verification algorithm of sequential circuits [1] based on state transfer graph (STG) is presented in this paper, which obtains some certain useful information through verifying the corresponding state transfer graphs' isomorphism, namely that two corresponding sequential circuits' equivalence . And the verifying includes two steps: firstly, find out all state pairs of the vertexes, which are being verified;secondly verify the equivalence of state pairs, if all the state pairs can be matched as equal state pairs, thus we can come to a conclusion that the corresponding circuits have the same sequential behavior. The algorithm mainly verifies ISCAS85 circuits and some simple state transfer graphs, and the final experiment data shows that the algorithm introduced in the paper will obtain better results compared to BDD(Binary Decision Diagram) and SET(Symbolic Trajectory Evaluation) methods.

关键词： State Transfer Graph Sequential Circuit Isomorphism verification algorithm Equivalent State Pairs

来源：评论

学校读者我要写书评

暂无评论

A Special Net Structure and Its Application in Workflow Modeling

A Special Net Structure and Its Application in Workflow Mode...

引用

2011 4th IEEE International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Xinqin Gao,Yan Li,Mingshun Yang,Yong Liu and Erbao Xu School of Mechanical and Precision Instrument Engineering Xi'an University of Technology 5 South Jinhua Road,Xi'an 710048,Shaanxi,P.R.China

On the basis of the traditional net structure,a new concept of special net structure(SNS)was proposed and its main characteristics were ***,this special net structure was a concolorous graph with colorless nodes and concolorous edges,and also was a special polychromatic graph,which can be described by polychromatic sets theory *** the same time,the SNS was stored by utilizing Hashtable in computer programming in order to reduce the storage space and diminish the search *** special net structure was applied to workflow modeling,and the basic model primitives,typical model constructs and typical conflict constructs were *** verification algorithm of workflow special net structure model was *** with an example of service process,a prototype system of workflow modeling based on the special net structure was developed to illustrate the correctness and feasibility of the proposed approach.

关键词： special net structure polychromatic sets workflow modeling verification algorithm

来源：评论

学校读者我要写书评

暂无评论

Certification of the QR Factor R and of Lattice Basis Reducedness 07

Certification of the QR Factor R and of Lattice Basis Reduce...

引用

20th International Symposium on Symbolic and Algebraic Computation

作者： Villard, Gilles UCBL INRIA Ecole Normale Super Lyon Lab LIP Lyon France

ISBN: (纸本)9781595937438

Given a lattice basis of n vectors in Z(n), we propose an algorithm using 12n(3) + O(n(2)) floating point operations for checking whether the basis is LLL-reduced. If the basis is reduced then the algorithm will hopefully answer "yes". If the basis is not reduced, or if the precision used is not sufficient with respect to n, and to the numerical properties of the basis, the algorithm will answer "failed". Hence a positive answer is a rigorous certificate. For implementing the certificate itself, we propose a floating point algorithm for computing (certified) error bounds for the R factor of the QR factorization. This algorithm takes into account all possible approximation and rounding errors. The certificate may be implemented using matrix library routines only. We report experiments that show that for a reduced basis of adequate dimension and quality the certificate succeeds, and establish the effectiveness of the certificate. This effectiveness is applied for certifying the output of fastest existing floating point heuristics of LLL reduction, without slowing down the whole process.

关键词： linear algebra QR factorization lattice basis reducedness verification algorithm

来源：评论

学校读者我要写书评

暂无评论

A memory-efficient fingerprint verification algorithm using a multi-resolution accumulator array

引用

ETRI JOURNAL 2003年第3期25卷 179-186页

作者： Pan, SB Gil, YH Moon, D Chung, Y Park, CH ETRI Informat Secur Res Div Taejon South Korea

Using biometrics to verify a person's identity has several advantages over the present practices of personal identification numbers (PINs) and passwords. At the same time, improvements in VLSI technology have recently led to the introduction of smart cards with 32-bit RISC processors. To gain maximum security in verification systems using biometrics, verification as well as storage of the biometlic pattern must be done in the smart card. However, because of the limited resources (processing power and memory space) of the smart card, integrating biometrics into it is still an open challenge. In this paper, we propose a fingerprint verification algorithm using a multi-resolution accumulator array that can be executed in restricted environments such as the smart card. We first evaluate both the number of instructions executed and the memory requirement for each step of a typical fingerprint verification algorithm. We then develope a memory-efficient algorithm for the most memory-consuming step (alignment) using a multi-resolution accumulator array. Our experimental results show that the proposed algorithm can reduce the required memory space by a factor of 40 and can be executed in real time in resource-constrained environments without significantly degrading accuracy.

关键词： .person executed memory space fingerprint processing power smart card accumulator memory requirement number of instructions verification algorithm algorithm Using Multi-Resolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：