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

14th International Conference on Enterprise information systems, ICEIS 2012

作者： Wang, Zhaoxia Wen, Lijie Zhu, Xiaochen Liu, Yingbo Wang, Jianmin School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Lab. for Information System Security Ministry of Education Beijing 100084 China National Laboratory for Information Science and Technology Beijing 100084 China Logistical Engineering University Chongqing 400016 China

ISBN: (纸本)9789898565105

Workflow testing is an important method of workflow analysis in design time. A challenging problem with trace-oriented test data generation in particular and trace-based workflow analysis in general is the existence of infeasible traces for which there is no input data for them to be executed. In this paper we build on the theory of workflow nets and introduce workflow nets where transitions have conditions associated with them. We then demonstrate that we can determine which execution traces, that are possible according to the control-flow dependencies, are actually possible taking the data perspective into account. This way we are able to more accurately determine in design time the infeasible traces caused by the correlation between transition conditions along this trace. Finally, we provide a solution to automatically detecting the shortest infeasible trace.

关键词： Infeasible traces Process models Workflow analysis

来源：评论

学校读者我要写书评

暂无评论

Towards energy-fairness in asynchronous duty-cycling sensor networks

Towards energy-fairness in asynchronous duty-cycling sensor ...

引用

IEEE Conference on Computer Communications, INFOCOM 2012

作者： Li, Zhenjiang Mo, Li Liu, Yunhao School of Computer Engineering Nanyang Technological University Singapore Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong MOE Key Lab. for Information System Security School of Software Tsinghua University China

ISBN: (纸本)9781467307758

In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. We propose a mathematical model to describe the energy efficiency of such networks and observe that traditional sleep interval setting strategy, i.e., operating sensor nodes with identical sleep intervals, or intuitive control heuristics, i.e., greedily increasing sleep intervals of sensor nodes with high energy consumption rates, hardly perform well in practice. There is an urgent need to develop an efficient sleep interval control strategy for achieving fair and high energy efficiency. To this end, we theoretically formulate the Sleep Interval Control (SIC) problem and find it a convex optimization problem. By utilizing the convex property, we decompose the original problem and propose a distributed algorithm, called GDSIC. In GDSIC, sensor nodes can tune sleep intervals through a local information exchange such that the maximum energy consumption rate in the network approaches to be minimized. The algorithm is self-adjustable to the traffic load variance and is able to serve as a unified framework for a variety of asynchronous duty-cycling MAC protocols. We implement our approach in a prototype system and test its feasibility and applicability on a 50-node testbed. We further conduct extensive trace-driven simulations to examine the efficiency and scalability of our algorithm with various settings. © 2012 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Enhancing Discrete Event Simulation in multi-core processors environments using Multi-Dimensional Queue Mechanism

Enhancing Discrete Event Simulation in multi-core processors...

引用

International Conference on New Trends in information and Service Science, NISS

作者： Wong Ming Tat Chong Chun Yong Ling Teck Chaw Department of Computer System & Technology Faculty of Computer Science &Information Technology University Malaya Kuala Lumpur Malaysia Department of Software Engineering Faculty of Computer Science &Information Technology University Malaya Kuala Lumpur Malaysia

ISBN: (纸本)9781467308762

Discrete Event Simulation (DES) is a popular technique use in network simulation tools. Some of the popular queuing methods in DES are linked list, heap, splay tree and calendar based queue. Due to the design characteristic of discrete events and single sequential queue in DES, these queuing methods are unable to fully utilize the computing power of multi-core processors. This paper proposes Multi-Dimensional Queue Mechanism (MDQM) to counter the stated problem. The experimental results show improvement of simulation run time by using the proposed mechanism when running DES on multi-core processors environments.

关键词： Discrete event simulation Multi-Dimensional Queue Mechanism Multi-core Processors Network Simulation

来源：评论

学校读者我要写书评

暂无评论

A Convertibility Study on the Conversion between FPA and COSMIC for Real Time systems

A Convertibility Study on the Conversion between FPA and COS...

引用

Joint Conference of the Int'l Workshop on and International Conference on software Process and Product Measurement software Measurement

作者： Abedallah Zaid Abualkishik Mohd Hasan Selamat Abdul Azim Abd Ghani Rodziah Atan Jean Marc Desharnais Adel Khelifi Department of Information System Faculty of Computer Science and Information Technology University Putra Malaysia Serdang Selangor Darul Ehsan Malaysia Software Engineering and IT Department École de Technologie Supérieure Montreal Canada Software Engineering Department ALHOSN University Abu Dhabi UAE

Function Point Analysis (FPA) measurement method was proposed primarily to measure the functional size of management information systems. The method has been criticized as an inadequate method to measure the functional size of Real Time (RT) applications. Many extensions have been made to the original method to extend its applicability to size RT applications. The Common software Measurement International Consortium (COSMIC) designed COSMIC function point measurement method to meet the requirement of measuring a wider scope of software domains, particularly, RT applications. This paper aims to derive a convertibility equation between the two methods for small-size RT applications. A systematic conversion approach was applied using two types of conversion (using the unadjusted FPA size and transaction functions size) using 13 small-size RT applications, considering the quality of requirements, via linear and non-linear regression models. The results show that RT applications have a varied functional size for processes, in which FPA method could not quantify it adequately, mainly because of the FPA weighting system tables and the inadequate representation of data files. Moreover, the results show that there is a significant correlation between the two methods, but the conversion factor is slightly larger than the previous studies, in which the conversion factor is more than 1. However, some limitations of FPA method rules relative to RT applications cast some doubts on the possibility to extend the conversion for larger applications size.

关键词： software Equations software measurement Size measurement Mathematical model Accuracy Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Decision making model for Electronic Tender Evaluation (eTE) using fuzzy AHP with extent analysis method

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2012年第22期6卷 79-89页

作者： Alias, Ros Haslinda Noor, Noor Maizura Mohamad Selamat, Ali Saman, Md. Yazid Mohd Abdullah, Mohd Lazim Computer Science Department Universiti Malaysia Terengganu Malaysia Software Engineering Department Faculty of Computer Science and Information System Universiti Teknologi Malaysia Malaysia Department of Mathematics Faculty of Science and Technology Universiti Malaysia Terengganu Malaysia

Transformation in procurement technique aims to create a sustainability development and innovative outsourcing strategy. It can increase the probability of project success with quality and give an added value in money and contract times. Wide range of issues should be considered in producing a sincere and trusted decision within respective agencies. Our research proposed a procurement transformation model for selecting the optimal result of contractor selection under multi criteria environments. The corresponding data are centralizing, easy to manage and can be updated accordingly. Fuzzy comparing judgment is used as the method to overcome the ambiguity aspects in selecting significant preferences by decision maker regarding to the subjective opinion. Decision making process is represented by the integration of evaluation model to produce a final result. Finally, the model was tested in tender evaluation processes to determine the most beneficial contractor to perform the construction project.

关键词： Contractors

来源：评论

学校读者我要写书评

暂无评论

Theoretical and Probabilistic Conversion Model between FPA and COSMIC Measurement Method

Theoretical and Probabilistic Conversion Model between FPA a...

引用

Joint Conference of the Int'l Workshop on and International Conference on software Process and Product Measurement software Measurement

作者： Abedallah Zaid Abualkishik Mohd Hasan Selamat Abdul Azim Abd Ghani Rodziah Atan Jean Marc Desharnais Adel Khelifi Department of Information System Faculty of Computer Science and Information Technology University Putra Malaysia UPM Serdang Selangor Darul Ehsan Malaysia Software Engineering and IT Department École de Technologie Supérieure Montreal Canada Software Engineering Department ALHOSN University Abu Dhabi UAE

Functional Size Measurement (FSM) has been widely adopted by software organizations over the past years. In particular, Function Point Analysis (FPA) measurement method as the eldest and the most globally FSM method used. In the middle of 90s, COSMIC measurement method was designed to cover the limitations of previous FSM methods, and to size wider scope of application domains. COSMIC measurement method had received special attention due to its novelties and merits it offers. In this respect, many organizations have moved from using FPA to the COSMIC measurement method, mainly because FPA cannot size as many software project types as COSMIC. Since there have been many projects sized with FPA are available in various databases, researchers undertook to compare the Unadjusted FPA (UFP) size and COSMIC Function Point (CFP) size unit statistically, towards converting FPA data in to its corresponding value in CFP. In the literature, there is only one conversion model that converts the size at the level of Basic Functional Components (BFCs) between the two methods. This paper examines the accuracy of the conversion model that converts the size at the level of BFCs. Moreover, this paper presents a theoretical and probabilistic conversion model that converts the FPA transaction functions size to the most likely corresponding CFP size at the level of BFCs. The proposed model considers the primary intent and the processing logic forms of each FPA transaction function BFC, measurement best practices and COSMIC method rules. The proposed model has been validated using 14 industrial business applications. The model was found to adequately and high accurately convert all the projects tested precisely. The model might be useful for companies that are using both methods or planning to adopt the COSMIC method as a conversion or validation procedure.

关键词： Equations Mathematical model Data models software Size measurement software measurement Process control

来源：评论

学校读者我要写书评

暂无评论

Design Pattern Usage in Grid Computing

Design Pattern Usage in Grid Computing

引用

International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Markus Aleksy Makoto Takizawa Leonard Barolli Industrial Software System Program ABB Corporate Research Center Germany Germany Department of Computer and Information Science Seikei University Tokyo Japan Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan

The recent advances in Grid and Cloud computing make new types of applications possible. At the same time, they require an infrastructure to implement heterogeneous computing resources time and cost-savely. Here, approaches that utilize design patterns, i.e., proven solutions to existing problems, seem to provide a good approach to enable these kind of applications. In this paper, we investigated which design patterns are already used in the area of Grid computing nowadays. After a brief description of the literature study design, we present our findings which include the discovered design patterns, corresponding categories, and application areas.

关键词： Grid computing Parallel processing Cloud computing Conferences Concurrent computing USA Councils

来源：评论

学校读者我要写书评

暂无评论

Sherlock is around: Detecting network failures with local evidence fusion

Sherlock is around: Detecting network failures with local ev...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Qiang Ma Kebin Liu Xin Miao Yunhao Liu Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China

ISBN: (纸本)9781467307734

Traditional approaches for wireless sensor network diagnosis are mainly sink-based. They actively collect global evidences from sensor nodes to the sink so as to conduct centralized analysis at the powerful back-end. On the one hand, long distance proactive information retrieval incurs huge transmission overhead; On the other hand, due to the coupling effect between diagnosis component and the application itself, sink often fails to obtain complete and precise evidences from the network, especially for the problematic or critical parts. To avoid large overhead in evidence collection process, self-diagnosis injects fault inference modules into sensor nodes and let them make local decisions. Diagnosis results from single nodes, however, are generally inaccurate due to the narrow scope of system performances. Besides, existing self-diagnosis methods usually lead to inconsistent results from different inference processes. How to balance the workload among the sensor nodes in a diagnosis task is a critical issue. In this work, we present a new in-network diagnosis approach named Local-Diagnosis (LD2), which conducts the diagnosis process in a local area. LD2 achieves diagnosis decision through distributed evidence fusion operations. Each sensor node provides its own judgements and the evidences are fused within a local area based on the Dempster-Shafer theory, resulting in the consensus diagnosis report. We implement LD2 on TinyOS 2.1 and examine the performance on a 50 nodes indoor testbed.

关键词： Wireless sensor networks Bayesian methods Measurement Accuracy Reliability Computer crashes Protocols

来源：评论

学校读者我要写书评

暂无评论

On affirmative adaptive failure detection

On affirmative adaptive failure detection

引用

12th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2012

作者： Noor, Ahmad Shukri Mohd Deris, Mustafa Mat Herawan, Tutut Hassan, Mohamad Nor Department of Computer Science Faculty of Science and Technology Universiti Malaysia Terengganu 21030 Kuala Terengganu Malaysia Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia 86400 Parit Raja Batu Pahat Johor Darul Takzim Malaysia Faculty of Computer System and Software Engineering Universiti Malaysia Pahang Lebuh Raya Tun Razak 26300 Gambang Kuantan Pahang Malaysia

ISBN: (纸本)9783642330643

Fault detection methodology is a crucial part in providing a scalable, dependable and high availability of grid computing environment. The most popular technique that used in detecting fault is heartbeat mechanism where it monitors the grid resources in a very short interval. However, the heartbeat mechanism-based technique for fault detection suffers from weaknesses of either fast detection with low accuracy or completeness in detecting failures with a lengthy timeout. In this paper, we propose Affirmative Adaptive Failure Detection (AAFD). In this technique, the integration of newly proposed failure detection algorithm and the ping service is essential not only for dynamically improving certainty level of accuracy, but it is also very significant in verifying the aliveness of a site for strong completeness failure detection and reduces waiting time. The model outperforms the existing techniques by 18% to 39% in term of algorithm performance. On the average, AAFD detection is about 30% better than other detection algorithms. © 2012 Springer-Verlag.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Priv-Code: Preserving privacy against traffic analysis through network coding for multihop wireless networks

Priv-Code: Preserving privacy against traffic analysis throu...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Zhiguo Wan Kai Xing Yunhao Liu MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China School of Computer Science and Technology University of Science and Technology China Department of Computer Science and Engineering HKUST Hong Kong China

ISBN: (纸本)9781467307734

Traffic analysis presents a serious threat to wireless network privacy due to the open nature of wireless medium. Traditional solutions are mainly based on the mix mechanism proposed by David Chaum, but the main drawback is its low network performance due to mixing and cryptographic operations. We propose a novel privacy preserving scheme based on network coding called Priv-Code to counter against traffic analysis attacks for wireless communications. Priv-Code is able to provide strong privacy protection for wireless networks as the mix system because of its intrinsic mixing feature, and moreover, it can achieve better network performance owing to the advantage of network coding. We first construct a hypergraph-based network coding model for wireless networks, under which we formalize an optimization problem whose objective function is to make each node have identical transmission rate. Then we provide a decentralized algorithm for this optimization problem. After that we develop an information theoretic metric for privacy measurement using entropy, and based on this metric we demonstrate that Priv-Code achieves stronger privacy protection than the mix system while achieving better network performance.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：