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

International Conference on software Maintenance (ICSM)

作者： Mark D. Syer Zhen Ming Jiang Meiyappan Nagappan Ahmed E. Hassan Mohamed Nasser Parminder Flora Software Analysis and Intelligence Lab Queen's University Canada Department of Electrical Engineering & Computer Science York University Canada Performance Engineering School of Computing BlackBerry Canada

Load tests ensure that software systems are able to perform under the expected workloads. The current state of load test analysis requires significant manual review of performance counters and execution logs, and a high degree of system-specific expertise. In particular, memory-related issues (e.g., memory leaks or spikes), which may degrade performance and cause crashes, are difficult to diagnose. Performance analysts must correlate hundreds of megabytes or gigabytes of performance counters (to understand resource usage) with execution logs (to understand system behaviour). However, little work has been done to combine these two types of information to assist performance analysts in their diagnosis. We propose an automated approach that combines performance counters and execution logs to diagnose memory-related issues in load tests. We perform three case studies on two systems: one open-source system and one large-scale enterprise system. Our approach flags ≤ 0.1% of the execution logs with a precision ≥ 80%.

关键词： Radiation detectors Standards Transient analysis Lifting equipment Memory management Couplings Visualization

来源：评论

学校读者我要写书评

暂无评论

Integral attacks on reduced-round PRESENT

Integral attacks on reduced-round PRESENT

引用

15th International Conference on Information and Communications Security, ICICS 2013

作者： Wu, Shengbao Wang, Mingsheng Trusted Computing and Information Assurance Laboratory Institute of Software Chinese Academy of Sciences Beijing 100190 PO Box 8718 China Graduate School of Chinese Academy of Sciences Beijing 100190 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319027258

Integral attack is a powerful technique to recover the secret key of block ciphers by usually exploiting the fact that specific parts of the output after several round encryptions has a zero-sum property in a set of chosen plaintexts. In FSE 2008, bit-based integral attack proposed by Z'aba et al. revealed that integral attacks may be not only suitable for byte-based block ciphers but also still applied to bit-based block ciphers. In this work, we show that integral attack against bit-based block ciphers can be improved not only by the theorem of higher-order differential attack but also by using specific algebraic properties of Sboxes, and the order of plaintexts in a set, which is important in bit-based integral attack, is not required here. We focus on the block cipher PRESENT. Based on some algebraic properties of its Sbox, we propose two integral distinguishers: a 5 round (4-th order) integral distinguisher and a 7 round (16-th order) integral distinguishers, which can be used to attack 10 (out of 31) round PRESENT. As far as we know, it is the first time that a 7 round integral distinguisher of PRESENT is reported. Algebraic techniques used in this paper may be also applied to other block ciphers to improve their known integral attacks. © Springer International Publishing 2013.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

A comprehensive QoS determination model for Infrastructure-as-a-Service clouds

A comprehensive QoS determination model for Infrastructure-a...

引用

2013 IEEE International Conference on Automation Science and engineering, CASE 2013

作者： Xia, Yunni Zhou, Mengchu Luo, Xin Zhu, Qingsheng Software Theory and Technology Chongqing Key Lab Chongqing University Chongqing 400030 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States

ISBN: (纸本)9781479915156

Cloud computing is a recently developed new technology for complex systems with massive service sharing, which is different from the resource sharing of the grid computing systems. In a cloud environment, service requests from users go through numerous provider specific steps from the instant it is submitted to when the service is fully delivered. Quality modeling and analysis of clouds are not easy tasks because of the complexity of the provisioning mechanism and the dynamic cloud environment. This study proposes an analytical modelbased approach for quality evaluation of Infrastructure-as-a-Service cloud and consider expected request completion time, rejection probability, and system overhead rate as key QoS metrics. It also features with the modeling of different warming and cooling strategies of machines and the ability to identify the optimal balance between system overhead and performance. © 2013 IEEE.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Thesaurus Performance with Information Retrieval: Schema Matching as A Case Study

Thesaurus Performance with Information Retrieval: Schema Mat...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Thabit Sabbah Ali Selamat Faculty of Computing Department of Computer Science Universiti Teknologi Malaysia (UTM) 81310 Skudai Johor Malaysia Faculty of Computing Department of Software Engineering Universiti Teknologi Malaysia (UTM) 81310 Skudai Johor Malaysia

ISBN: (纸本)9781479906505

Thesaurus is used with many Information Retrieval (IR) models such as data integration, data warehousing, semantic query processing and classifiers. Considering the existence of various thesauri for a particular domain of knowledge;output quality of an IR model when using different thesauri in the same domain is not predictable. In this paper, we propose a methodology to study the performance of thesaurus in solving schema matching as a case study of IR models. The paper also presents initial results of experiment conducted using different thesauri. Precision, recall, and F-measure were calculated to show that the quality of matching was changed according to the used thesaurus.

关键词： Schema Matching Thesaurus Information Retrieval Performance thesaurus information retrieval Case studies schema iridium

来源：评论

学校读者我要写书评

暂无评论

Model-Based Management of Service Composition

Model-Based Management of Service Composition

引用

2013 IEEE Seventh International Symposium on Service-Oriented System engineering

作者： Yun Ma Xuanzhe Liu Yihan Wu Paul Grace Institute of Software School of Electronics Engineering and Computer Science Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China School of Computing and Communications Lancaster University Lancaster UK

ISBN: (纸本)9781467356596

Promoted by the Service computing paradigm, service composition has played an important role in modern software development. Currently, available services have covered a wide spectrum of heterogeneity, including SOAP services, Restful services and other data services. The composite services should continuously serve for a large number of users. The heterogeneity and open dynamic network environment bring grand challenges to the management of service composition. Based upon our previous work on service composition middleware - Star link, and a runtime system management tool - SM@RT, this paper proposes a model-based approach to service composition management at run time. A runtime model enables casual connections between applications and supporting platforms, provides a global view of a running system, abstracts underlying technical details, and performs automated generation of management code. By constructing the runtime model of Star link and using the SM@RT tool to generate synchronization between model and running composition, our approach makes the following contributions to service composition management: (1) a more comprehensive view of service composition management, (2) an easy-of-use manner to perform management operations at model level without underlying tedious details, (3) an on-the-fly effect on running system by means of synchronization between the model and composite services. We demonstrate that our approach can tackle the challenge of service composition management by using a case study of a photo sharing composite service application.

关键词： Runtime Unified modeling language Middleware Synchronization Automata Monitoring Engines

来源：评论

学校读者我要写书评

暂无评论

A Framework for Classifying and Comparing Architecture-centric software Evolution Research

A Framework for Classifying and Comparing Architecture-centr...

引用

(CSMR) European Conference on software Maintenance and Reengineering

作者： Pooyan Jamshidi Mohammad Ghafari Aakash Ahmad Claus Pahl Lero-The Irish Software Engineering Research Centre School of Computing Dublin City University Ireland DeepSE Group @ DEI Politecnico di Milano Italy

ISBN: (纸本)9781467358330

Context: software systems are increasingly required to operate in an open world, characterized by continuous changes in the environment and in the prescribed requirements. Architecture-centric software evolution (ACSE) is considered as an approach to support software adaptation at a controllable level of abstraction in order to survive in the uncertain environment. This requires evolution in system structure and behavior that can be modeled, analyzed and evolved in a formal fashion. Existing research and practices comprise a wide spectrum of evolution-centric approaches in terms of formalisms, methods, processes and frameworks to tackle ACSE as well as empirical studies to consolidate existing research. However, there is no unified framework providing systematic insight into classification and comparison of state-of-the-art in ACSE research. Objective: We present a taxonomic scheme for a classification and comparison of existing ACSE research approaches, leading to a reflection on areas of future research. Method: We performed a systematic literature review (SLR), resulting in 4138 papers searched and 60 peer-reviewed papers considered for data collection. We populated the taxonomic scheme based on a quantitative and qualitative extraction of data items from the included studies. Results: We identified five main classification categories: (i) type of evolution, (ii) type of specification, (iii) type of architectural reasoning, (iv) runtime issues, and (v) tool support. The selected studies are compared based on their claims and supporting evidences through the scheme. Conclusion: The classification scheme provides a critical view of different aspects to be considered when addressing specific ACSE problems. Besides, the consolidation of the ACSE evidences reflects current trends and the needs for future research directions.

关键词： software architecture software Computer architecture Unified modeling language Cognition Data mining Conferences

来源：评论

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8833卷

作者： Sun, Zhenan Shan, Shiguang Sang, Haifeng Zhou, Jie Wang, Yunhong Yuan, Weiqi Chinese Academy of Sciences National Laboratory of Pattern Recognition Institute of Automation Beijing China Chinese Academy of Sciences Institute of Computing Technology Beijing China Shenyang University of Technology School of Information Science and Engineering Shenyang China Tsinghua University Software Engineering Institute Beijing China Beihang University School of Computer Science and Engineering Beijing China

来源：评论

学校读者我要写书评

暂无评论

An Improved Two-sided Assembly Line Balancing Algorithm based on Heuristic Rules

An Improved Two-sided Assembly Line Balancing Algorithm base...

引用

The 2013 2nd International Symposium on Manufacturing Systems engineering(ISMSE 2013)

作者： Yan Gao Tianxiang Chang Yangyang Wang Yao Liu HongYan Quan Jianzhong Xu Institute of Software and Engineering Shanghai Key Laboratory of Trustworthy Computing East China Normal University Institute of Computer Science and Technology Nanchang Army Collage

According to "Assemble line balancing(ALB)" problem which is widespread in manufacture, we establish a mathematical model and present our improved algorithm that is based on Heuristic rules, which adopt cumulative ranked positional weight as a basis of task assignments and schedule the orders of branches traversalAfter that we can find an optimal solution to the balancing problem efficientlyThe result of examples given by this paper shows our algorithm has a good performance.

关键词： Two-sided Assemble line Heuristic Rules Balancing Algorithm

来源：评论

学校读者我要写书评

暂无评论

Choice of boundary condition for lattice-Boltzmann simulation of moderate-Reynolds-number flow in complex domains

引用

Physical Review E 2014年第2期89卷 023303-023303页

作者： Rupert W. Nash Hywel B. Carver Miguel O. Bernabeu James Hetherington Derek Groen Timm Krüger Peter V. Coveney Centre for Computational Science Department of Chemistry University College London 20 Gordon Street London WC1H 0AJ United Kingdom CoMPLEX University College London Physics Building Gower Street London WC1E 6BT United Kingdom Research Software Development Team Research Computing and Facilitating Services University College London Podium Building - 1st Floor Gower Street London WC1E 6BT United Kingdom Institute for Materials and Processes School of Engineering University of Edinburgh King's Buildings Mayfield Road Edinburgh EH9 3JL United Kingdom

Modeling blood flow in larger vessels using lattice-Boltzmann methods comes with a challenging set of constraints: a complex geometry with walls and inlets and outlets at arbitrary orientations with respect to the lattice, intermediate Reynolds (Re) number, and unsteady flow. Simple bounce-back is one of the most commonly used, simplest, and most computationally efficient boundary conditions, but many others have been proposed. We implement three other methods applicable to complex geometries [Guo, Zheng, and Shi, Phys. Fluids 14, 2007 (2002); Bouzidi, Firdaouss, and Lallemand, Phys. Fluids 13, 3452 (2001); Junk and Yang, Phys. Rev. E 72, 066701 (2005)] in our open-source application hemelb. We use these to simulate Poiseuille and Womersley flows in a cylindrical pipe with an arbitrary orientation at physiologically relevant Re number (1–300) and Womersley (4–12) numbers and steady flow in a curved pipe at relevant Dean number (100–200) and compare the accuracy to analytical solutions. We find that both the Bouzidi-Firdaouss-Lallemand (BFL) and Guo-Zheng-Shi (GZS) methods give second-order convergence in space while simple bounce-back degrades to first order. The BFL method appears to perform better than GZS in unsteady flows and is significantly less computationally expensive. The Junk-Yang method shows poor stability at larger Re number and so cannot be recommended here. The choice of collision operator (lattice Bhatnagar-Gross-Krook vs multiple relaxation time) and velocity set (D3Q15 vs D3Q19 vs D3Q27) does not significantly affect the accuracy in the problems studied.

关键词： BOUNDARY value problems BOLTZMANN'S equation REYNOLDS number BLOOD flow STOCHASTIC convergence

来源：评论

学校读者我要写书评

暂无评论

A static detection of security defects between inter-components' communication

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) 2013年第SUPPL.2期41卷 259-264页

作者： Fu, Jianming Li, Pengwei Yi, Qiao Huang, Shiyong Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan University Wuhan 430072 China School of Computer Wuhan University Wuhan 430072 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

Security defects were found between inter-components' communication: the use of implicit intents leaded to component hijacking and information leakage, risk of privilege mission leakage existed in public components. To solve these problems, a method of security defects detection between inter-components' communication has been presented. At first, an Android application was analyzed statically, its control-flow graph (CFG), function call graph (FCG) and component call graph (CCG) were constructed. Then, the potentially dangerous components, implicit intents and privacy leakage paths of the application were found. Finally, 20 popular Android applications were tested. The results show that implicit intents are used in all of the applications, applications embed dynamic codes make up 25%, dangerous components are used in 80% of the applications, and privacy leakages applications make up 40% in total.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：