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

Modeling and design for dynamic workflows based on flexible activities

information Technology Journal 2009年第5期8卷 750-756页

作者： Li, Peng Du, Yuyue College of Information Science and Engineering Shandong University of Science and Technology Qingdao 266510 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100080 China

A rapidly changing environment forces the workflow management systems to change their workflow processes ever more frequently. In order to improve the flexibility of workflow management systems, a dynamic workflow model is proposed in this study. The concepts of flexible activities and historical execution information are put forward to construct dynamic workflow models in this method. Each flexible activity is used to encapsulate a group of indeterminate factors, e.g., the constraint rules and optional sub-activities when reifying a flexible activity. Historical execution information is the executive logging of a previous workflow instance. Two algorithms are put forward to guarantee the correctness of sub-workflows and the global control of dynamic processes. Furthermore, a simple example is given to validate the proposed dynamic workflow model. However, this method cannot perform well if there existing loop structures in sub-workflows and the reifying processes of flexible activities are not intelligent enough. © 2009 Asian Network for Scientific information.

关键词： Workflow management

来源：评论

学校读者我要写书评

暂无评论

An Efficient Certificateless Encryption Scheme in the Standard Model

An Efficient Certificateless Encryption Scheme in the Standa...

引用

International Conference on Network and System Security, NSS

作者： Hua Guo Xiyong Zhang Yi Mu Zhoujun Li School of Computer Science & Engineering Beihang University Beijing China Zhengzhou Information Science and Technology Institute Zhengzhou China CCISR School of Computer Science Software Engineering University of Wollongong NSW Australia

We propose an efficient certificateless public key encryption (CL-PKE) scheme which is provably secure against chosen ciphertext attacks without random oracles. Our scheme is more computationally efficient than the existing schemes and provides the shortest public key length compared to other existing CL-PKEs with random oracles. We also propose a practical self-generated-certificate encryption (SGC-PKE) scheme based on our CL-PKE scheme. One of merits of such cryptographic systems is that it can be applied to countermeasure "Denial-of-Decryption (DoD) Attacks" that is inherent in CL-PKE.

关键词： Public key Identity-based encryption Public key cryptography computer science Partial response channels Certification Gold computer security information security software standards

来源：评论

学校读者我要写书评

暂无评论

A process generation approach of dynamic workflows based description logics

引用

information Technology Journal 2009年第7期8卷 998-1005页

作者： Zhang, Fu Xin Du, Yu Yue College of Information Science and Engineering Shandong University of Science and Technology Qingdao 266510 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100080 China

To make workflow processes more flexible, a dynamic generation approach tor workflow processes corresponding to an instance is presented in this study. An activity, a part of a workflow, is defined as an action based on Description Logics (DLs). User preferences are considered, since a final solution should satisfy user preferences as much as possible. Also, a hierarchical workflow ontology model is proposed and a deciding method for basic routing relations in workflows is provided to produce the processes completely. Then for generating the processes, a new planning algorithm of workflow processes, DPWPG: Dynamic Planning for Workflow Process Generation, is presented and used to search matching activities in a workflow ontology model, according to ontological reasoning in semantic activities and users' preferences. Finally, an example is given to test the performance of the planning algorithm. © 2009 Asian Network tor Scientific information.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Enhancing cooperative behavior for online reputation systems by group selection

Enhancing cooperative behavior for online reputation systems...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences, UIC-ATC 2009

作者： Ren, Yizhi Li, Mingchu Cui, Yongrui Guo, Cheng Sakurai, Kouichi School of Software Dalian University of Technology Dalian 116621 China Dept. of Computer Science and Communication Engineering Kyushu University Hakozaki Fukuoka 812-81 Japan Institute of Systems Information Technologies KYUSHU 2-1-22 Momochihama Sawara-ku Fukuoka 814-0001 Japan

ISBN: (纸本)9780769537375

Reputation systems are very useful in large online communities in which users may frequently have the opportunity to interact with users with whom they have no prior experience. Recently, how to enhance the cooperative behaviors in the reputation system that has became to one of the key open issues. Research in the evolutionary game theory shows that the group selection or multilevel selection can favor the cooperation in the finite populations. Furthermore, Nowak et al., in [1], [2] give a fundamental condition for the evolution of cooperation by group *** on the above important result, we extend the group selection concept in evolutionary biology and propose a group-based mechanism to enhance cooperation for online reputation systems. © 2009 IEEE.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Analyzing Reliability of Time Constrained Service Composition

Analyzing Reliability of Time Constrained Service Compositio...

引用

International Conference on computer and information science (ACIS)

作者： Guisheng Fan Huiqun Yu Liqiong Chen Dongmei Liu Department of Computer Science and Engineering East China University of Science and Technology Shanghai China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai China Computer Software Evaluating and Testing Shanghai Key Laboratory Shanghai China

As a way to compose independent services together to fulfill a function, service composition is an important means for flexible and rapid information integration of complex distribution application in open and heterogeneous environment. Because the participating services may be failure or unavailable, how to guarantee the quality of service composition has become a challenging problem. A service composition model based on Timed Petri net (SCTPN) is proposed in this paper, which is capable of accurately capturing transaction behaviors and time constraints of services. The basic relationships and failure processing strategies between services are also characterized by SCTPN model. Based on states of the constructed SCTPN model, we propose the concepts of greatest concurrent set and transfer matrix to analyze reliability related properties of SCTPN model. Two simplification schemas are established to reduce the complexity of computation. Finally, three specific experiments are conducted to explain the effectiveness of proposed method.

关键词： Time factors Distributed computing Quality of service computer science Reliability engineering Petri nets computer networks Web services information science information analysis

来源：评论

学校读者我要写书评

暂无评论

Liveness Analysis of Parallel Program's Petri Net Models

Liveness Analysis of Parallel Program's Petri Net Models

引用

International Conference on information engineering and computer science (ICIECS)

作者： Wei Liu YuYue Du HuanQing Cui Chun Yan College of Information Science and Engineering Shandong University of Science and Technology Qingdao China State Key Laboratory of Computer Science Institute of Software Chinese Academy and Sciences Beijing China

ISBN: (纸本)9781424449934

The liveness of Petri net models of parallel programs is a very important property. The existing analysis techniques take Petri net models as a whole to study properties, which is subject to the state explosion problem. In this study, we decompose a parallel program's Petri net model into multiple process subnets to study liveness preservation instead of taking it as a whole, which thus mitigates efficiently the state explosion problem to some extent. In this paper, the liveness preservation relation between a MPINet and its process subnets is analyzed in detail. A necessary condition of keeping liveness of a MPINet composed of n live process subnets is given. And a class of CR-restricted MPINets is proposed. Liveness preservation can be efficiently verified based on only their net structures for CR-restricted MPINets.

关键词： System recovery Explosions Petri nets information analysis Educational institutions information science Laboratories computer science Application software Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A Concrete Certificateless Signature Scheme without Pairings

A Concrete Certificateless Signature Scheme without Pairings

引用

International Conference on Multimedia information Networking and Security (MINES)

作者： Aijun Ge Shaozhen Chen Xinyi Huang Department of Applied Mathematics Zhengzhou Information Science and Technology Institute Zhengzhou Henan China School of Computer Science and Software Engineering University of Wollongong Wollongong NSW Australia

Certificateless public key cryptography was introduced to avoid the inherent key escrow problem in identity-based cryptography, and eliminate the use of certificates in traditional PKI. Most cryptographic schemes in certificateless cryptography are built from bilinear mappings on elliptic curves which need costly operations. Despite the investigation of certificateless public key encryption without pairings, certificateless signature without pairings received much less attention than what it deserves. In this paper, we present a concrete pairing-free certificateless signature scheme for the first time. Our scheme is more computationally efficient than others built from pairings. The new scheme is provably secure in the random oracle model assuming the hardness of discrete logarithm problem.

关键词： Concrete Identity-based encryption Public key cryptography Public key Elliptic curve cryptography Elliptic curves computer security information security Mathematics information science

来源：评论

学校读者我要写书评

暂无评论

Achieving Close-Capacity Performance with Simple Concatenation Scheme on Multiple-Antenna Channels

Achieving Close-Capacity Performance with Simple Concatenati...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Nghi H. Tran Tho Le-Ngoc Tad Matsumoto Ha H. Nguyen Department of Electrical & Computer Engineering McGill University Montreal QUE Canada Information Theory and Signal Processing Laboratory School of Information Science Japan Advanced Institute of Science and Technology Japan Department of Electrical & Computer Engineering University of Saskatchewan Saskatoon SAS Canada

This paper proposes a simple yet capacity-approaching concatenation of a mixture of short memory length convolutional codes and simple rate-1 block code followed by either complex 1-dimensional (1-D) anti-Gray or Gray mapping over multiple antenna channels with quadrature phase-shift keying (QPSK). By interpreting rate-1 code together with 1-D mapping as a multi-D mapping employed over multiple transmit antennas, the error performance is analyzed in two regions, the error-floor and turbo pinch-off regions. In the former one, a tight union bound and design criterion on the asymptotic performance are first derived, which provide an useful tool to predict the error performance. Based on the design criterion, an optimal rate-1 code for each 1-D mapping is then constructed to achieve the best asymptotic performance. In the turbo pinch-off area, by using extrinsic information transfer (EXIT) chart, the most suitable mixed codes are selected for both symmetric and asymmetric antenna setups. It is demonstrated that the simple concatenation scheme can achieve near-capacity. Furthermore, its error performance is comparable to that obtained by using well-designed irregular low-density parity-check (LDPC) and repeat accumulate (RA) codes, and thereby, outperforms a scheme employing a parallel concatenated turbo code.

关键词： Parity check codes Convolutional codes Block codes Phase shift keying Quadrature phase shift keying Transmitting antennas Error analysis Performance analysis Concatenated codes Turbo codes

来源：评论

学校读者我要写书评

暂无评论

Newborn screening system based on adaptive feature selection and support vector machines

Newborn screening system based on adaptive feature selection...

引用

2009 9th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2009

作者： Hsieh, Sung-Huai Chien, Yin-Hsiu Shen, Chia-Ping Chen, Wei-Hsin Chen, Po-Hao Hsieh, Sheau-Ling Cheng, Po-Hsun Lai, Feipei Information Systems Office National Taiwan University Hospital Taipei Taiwan Department of Computer Science and Information Engineering National Taiwan University Taiwan Department of Electrical Engineering National Taiwan University Taipei Taiwan Network and Computer Centre National Chiao Tung University Hsin Chu Taiwan Graduate Institute of Biomedical Electronics and Bioinformatics National Taiwan University Taiwan Department of Software Engineering National Kaohsiung Normal University Taiwan Department of Medical Genetics National Taiwan University Hospital Taiwan

ISBN: (纸本)9780769536569

The clinical symptoms of metabolic disorders during neonatal period are often not apparent, if not treated early irreversible damages such as mental retardation may occur, even death. Therefore, practicing newborn screening is very important to prevent neonatal from these damages. In this paper, the newborn screening system used support vector machines (SVM) classification technique is proposed in place of cut-off value decision to evaluate the metabolic substances concentration raw data obtained from tandem mass spectrometry (MS/MS) and determine whether the newborn has some kinds of metabolic disorder diseases. On the basis of the proposed features, new analytic combinations are identified with superior discriminatory performance compared with the best published combinations. Classifiers built with the feature selection to find C3/C2, C3 and C16 of three key point features achieved diagnostic sensitivities, specificities and accuracy approaching 100%. © 2009 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Approach for Capacity Control in Clouds

A Heuristic Approach for Capacity Control in Clouds

引用

IEEE International Conference on E-Commerce Technology Workshops

作者： Arun Anandasivam Stefan Buschek Rajkumar Buyya Institute for Information Systems and Management University of Karlsruhe Germany Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9781424446469;9780769537559

Cloud resource providers in a market face dynamic and unpredictable consumer behavior. The way, how prices are set in a dynamic environment, can influence the demand behavior of price sensitive customers. A cloud resource provider has to decide on how to allocate his scarce resources in order to maximize his profit. The application of bid price control for evaluating incoming service requests is a common approach for capacity control in network revenue management. In this paper we introduce a customized version of the concept of self-adjusting bid prices and apply it to the area of cloud computing. Furthermore, we perform a simulation in order to test the efficiency of the proposed model.

关键词： Resource management Cloud computing Grid computing Consumer behavior Computational modeling Business Distributed computing Control systems Management information systems Conference management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：