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

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Guoliang He Naixue Xiong Athanasios V. Vasilakos Yuanxiang Li Zhongzhi Shi State Key Laboratory of Software Engineering Wuhan University of China Wuhan China Key Laboratory of Intelligent Information Process Institute of Computing Technology Chinese Academy and Sciences Beijing China Department of Computer Science Georgia State University USA Department of Computer Science Saint Francis Xavier University Canada

Since the scalability of logic circuits is becoming larger and more complex, the auto-design is becoming more and more difficult. In order to improve automatic design and performance evaluation of logic circuits in efficiency and capability of optimization, multiobjective simulated annealing (MSA) based increasable evolution approach is designed to evolve logic circuits automatically with an extended matrix encoding method, which can be able to reflect the potential performance of a circuit and reduce the risk of deleting a circuit with a good developing potential during evolution is devised. In the process of evolution, each individual is renewedly associated to a corresponding objective in terms of a novel adaptive evaluation method at each generation. In experiments, complicated arithmetic circuits are designed to assess the performance of MSA against other algorithms. Results indicate that the proposed method could design logic circuits efficiently.

关键词： Logic circuits Encoding Hardware Scalability Circuit simulation Simulated annealing Genetic algorithms Laboratories computer science Arithmetic

来源：评论

学校读者我要写书评

暂无评论

DFTT4CWS: A Testing Tool for Composite Web Services Based on Data-Flow

DFTT4CWS: A Testing Tool for Composite Web Services Based on...

引用

Web Information Systems and Applications Conference (WISA)

作者： Jun Hou Lei Xu School of Computer Science and Engineering South-East University Nanjing China China Telecom Jiangsu Hongxin System Integration Company Limited Nanjing China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

For large and complex composite Web services which are composed by BPEL and a set of WSDL and XSD documents, we urgently need the aid of the tools in designing and selecting test cases. However, most of mature testing tools which generate test data with the information of WSDL are used for single service while the research for composition remains in the realm of theory. So we apply the theory of data-flow testing and try to develop a testing tool for Web services composition which can automatically detects harmful data-flow anomalies and generate test paths according to all kinds of data flow coverage criteria.

关键词： Web services Automatic testing Application software System testing computer science Sequential analysis Information systems Data engineering Design engineering Telecommunications

来源：评论

学校读者我要写书评

暂无评论

Designing a Credit Approval System Using Web Services, BPEL, and AJAX

Designing a Credit Approval System Using Web Services, BPEL,...

引用

IEEE International Conference on e-Business Engineering (ICEBE)

作者： Vincent C.T. Chan Dickson K.W. Chiu Michelle Watson Patrick C.K. Hung Haiyang Hu Hua Hu Yi Zhuang Department of Computer Science & Engineering Hong Kong University of Science and Technology Hong Kong China Faculty of Business and IT University of Ontario Institute of Technology (UOIT) Canada College of Computer Science and Information Engineering Zhejiang Gongshang University China State Key Laboratory for Novel Software Technology Nanjing University China College of Computer Science Hangzhou Dianzi University China

In the business world, financial institutions, like banks and investment firms, heavily rely on technology to manipulate daily operations and support business. Many more business processes have now become automated and require procedures to be approved. For example, when providing business services liked personal / corporate loans, mortgage, or Letter of Credit (LC), a customer is required to submit information within their applications; whereas, the service provider has to perform complicated approval procedures, involving different departments or even external parties. In this paper, we discuss how a credit approval system (CAS) handles the workflow of such business processes. The system is extensible to contemporary technologies including business process execution language (BPEL), asynchronous JavaScript and XML (AJAX), and Java server face (JSF) in order to coordinate related parties through the Internet as well as to facilitate the operations and communications with different levels of staff in the Intranet. Our experiences and design characteristics will be further implemented into a system designed for a global financial firm.

关键词： Web services Content addressable storage Java computer science Educational institutions Loans and mortgages XML Financial management Design engineering Laboratories

来源：评论

学校读者我要写书评

暂无评论

Enhanced Pictorial Structures for precise eye localization under incontrolled conditions

Enhanced Pictorial Structures for precise eye localization u...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Xiaoyang Tan Fengyi Song Zhi-Hua Zhou Songcan Chen Department of Computer Science and Engineering Nanjing University of Aeronautics and Astronautics Nanjing China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China

In this paper, we present an enhanced pictorial structure (PS) model for precise eye localization, a fundamental problem involved in many face processing tasks. PS is a computationally efficient framework for part-based object modelling. For face images taken under uncontrolled conditions, however, the traditional PS model is not flexible enough for handling the complicated appearance and structural variations. To extend PS, we 1) propose a discriminative PS model for a more accurate part localization when appearance changes seriously, 2) introduce a series of global constraints to improve the robustness against scale, rotation and translation, and 3) adopt a heuristic prediction method to address the difficulty of eye localization with partial occlusion. Experimental results on the challenging LFW (Labeled Face in the Wild) database show that our model can locate eyes accurately and efficiently under a broad range of uncontrolled variations involving poses, expressions, lightings, camera qualities, occlusions, etc.

关键词： Face detection Eyes Face recognition Object detection Robustness Nose Image databases Image analysis Mouth Solid modeling

来源：评论

学校读者我要写书评

暂无评论

Differential Fault Analysis on SHACAL-1

Differential Fault Analysis on SHACAL-1

引用

Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)

作者： Ruilin Li Chao Li Chunye Gong Department of Mathematics and System Science Science College National University of Defense Technology Changsha China State Key Laboratory of Information Security Institute of Software Chinese Academy and Sciences Beijing China School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781424449729;9780769538242

SHACAL-1, known as one of the finalists of the NESSIE project, originates from the compression component of the widely used hash function SHA-1. The requirements of confusion and diffusion are implemented through mixing operations and rotations other than substitution and permutation, thus there exists little literature on its immunity against fault attacks. In this paper, we apply differential fault analysis on SHACAL-1 in a synthetic approach. We introduce the random word fault model, present some theoretical arguments, and give an efficient fault attack based on the characteristic of the cipher. Both theoretical predications and experimental results demonstrate that, 72 random faults are needed to obtain 512 bits key with successful probability more than 60%, while 120 random faults are enough to obtain 512 bits key with successful probability more than 99%.

关键词： Doped fiber amplifiers Public key cryptography Fault diagnosis Information analysis Chaos Mathematics Educational institutions Laboratories Information security Public key

来源：评论

学校读者我要写书评

暂无评论

Model Checking Needham-Schroeder Security Protocol Based on Temporal Logic of Knowledge

Model Checking Needham-Schroeder Security Protocol Based on ...

引用

International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC

作者： Xiangyu Luo Yan Chen Ming Gu Lijun Wu School of Software Key Laboratory of Security for Information System of Ministry of Education Tsinghua University Beijing China Department of Computer Science Guilin University of Electronic Technology Guilin China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9781424442232

Formal verification approaches can guarantee the correctness of security protocols. In this paper we take the well-known Needham-Schroeder public-key authentication protocol as an example, to show how we can apply the symbolic model checker for multiagent systems MCTK, which is developed by us, to the verification of security protocols. One temporal epistemic property is checked successfully both in the original version and the Lowe's revised version of the Needham-Schroeder protocol. The experimental result shows that our method is an effective way to the verification of security protocol.

关键词： Logic computer security Cryptographic protocols Communication system security Information security Electronic mail Authentication Multiagent systems Cryptography computer networks

来源：评论

学校读者我要写书评

暂无评论

Solid texture synthesis using Position Histogram Matching

Solid texture synthesis using Position Histogram Matching

引用

IEEE International Conference on computer-Aided Design and computer Graphics

作者： Jiating Chen Bin Wang Department of Computer Science and Technology Tsinghua University Beijing China Ministry of Education Key Laboratory of Information System Security Beijing China School of Software Tsinghua University Beijing China Tsinghua National Laboratory for Information Science and Technology Beijing China

In the past, several approaches have been proposed to produce high quality solid textures. Unfortunately, they often suffer from several synthesis artifacts, such as color blurry, bad texture structures, introducing aberrant voxel colors and so on. In this paper, we present a novel algorithm for synthesizing high quality solid textures from 2D exemplars. We adopt an optimization framework with the k-coherence search and the discrete solver for solid texture synthesis. The texture optimization approach is integrated with a new kind of histogram matching, position histogram matching, which effectively causes the global statistics of the synthesized solid textures to match those of the exemplars. Experimental results show that our synthesized results do not suffer from color blurry, and most texture structures are preserved well, outperforming the previous solid texture synthesis algorithms in terms of the synthesis quality.

关键词： Histograms Solid modeling Surface texture Educational technology Laboratories Principal component analysis software quality computer science Information systems computer security

来源：评论

学校读者我要写书评

暂无评论

Frequent Items Mining on Data Stream Based on Time Fading Factor

Frequent Items Mining on Data Stream Based on Time Fading Fa...

引用

International Conference on Artificial Intelligence and Computational Intelligence (AICI)

作者： Shan Zhang Ling Chen Li Tu Department of Computer Science and Engineering Yangzhou University Yangzhou China State Key Laboratory of Novel Software Tech Nanjing University Nanjing China Department of Computer Science Yangzhou University Yangzhou China Institute of Information Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China

Most of the existing algorithms for mining frequent items on data stream do not emphasis the importance of the recent data items. We present an algorithm using a fading factor to detect the data items with frequency counts exceeding a user-specified threshold. Our algorithm can detect ¿-approximate frequent data items on data stream using O(¿ -1 ) memory space and the processing time for each data item and a query is O(¿ -1 ). Experimental results on several artificial datasets and real datasets show our algorithm has higher precision, requires less memory and consumes less computation time than other similar methods.

关键词： Data mining Fading Frequency computer science Artificial intelligence Computational intelligence Data engineering Information science Space technology software algorithms

来源：评论

学校读者我要写书评

暂无评论

Translation-Based Model Checking for PLC Programs

Translation-Based Model Checking for PLC Programs

引用

IEEE Annual International computer software and Applications Conference (COMPSAC)

作者： Min Zhou Fei He Ming Gu Xiaoyu Song Key Laboratory of ISS of MOE Tsinghua National Laboratory of Information Science and Technology School of Software Tsinghua University Beijing China ECE Department Portland State University Portland USA

In this paper, we focus on modeling and verification of PLC systems, which are widespread in industry and manufacture. Our approach is based on a translation procedure from PLC programs to timed automata. The resulting model consists of several kinds of modules. Besides the main module which depicts the behaviors of the PLC programs, a dedicated module is constructed to simulate the cyclical running mode of PLC systems, and another module is involved for specifying the environment behaviors. After all modules are constructed, the model checker Uppaal is adapted to perform the model checking. Experimental results show promising performance of our approach. Compared with existing approaches, our method supports extensive instructions, including not only the time-related instructions, such as timer and counter, but also the subroutine and interruption instructions. In addition, the structure of whole model is more compact, and the translation procedure is more efficient, which results in a reduced verification model.

关键词： Programmable control Automata Laboratories Information science Hardware computer aided manufacturing Manufacturing industries Automatic control Assembly computer applications

来源：评论

学校读者我要写书评

暂无评论

Trapping in scale-free networks with hierarchical organization of modularity

引用

Physical Review E 2009年第5期80卷 051120-051120页

作者： Zhongzhi Zhang Yuan Lin Shuyang Gao Shuigeng Zhou Jihong Guan Mo Li School of Computer Science Fudan University Shanghai 200433 China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai 200433 China Department of Computer Science and Technology Tongji University 4800 Cao’an Road Shanghai 201804 China Software School Fudan University Shanghai 200433 China

A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how these two features affect the dynamical processes taking place on such networks. In this paper, we investigate a simple stochastic process—trapping problem, a random walk with a perfect trap fixed at a given location, performed on a family of hierarchical networks that exhibit simultaneously striking scale-free and modular structure. We focus on a particular case with the immobile trap positioned at the hub node having the largest degree. Using a method based on generating functions, we determine explicitly the mean first-passage time (MFPT) for the trapping problem, which is the mean of the node-to-trap first-passage time over the entire network. The exact expression for the MFPT is calculated through the recurrence relations derived from the special construction of the hierarchical networks. The obtained rigorous formula corroborated by extensive direct numerical calculations exhibits that the MFPT grows algebraically with the network order. Concretely, the MFPT increases as a power-law function of the number of nodes with the exponent much less than 1. We demonstrate that the hierarchical networks under consideration have more efficient structure for transport by diffusion in contrast with other analytically soluble media including some previously studied scale-free networks. We argue that the scale-free and modular topologies are responsible for the high efficiency of the trapping process on the hierarchical networks.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：