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

IEEE International Conference on Requirements engineering

作者： Thorsten Merten Matúš Falis Paul Hübner Thomas Quirchmayr Simone Bürsner Barbara Paech Dept. of Computer Science Sankt Augustin Bonn-Rhein-Sieg University of Applied Sciences Germany The University of Edinburgh Edinburgh United Kingdom Software Engineering Group University of Heidelberg Heidelberg Germany

ISBN: (纸本)9781509041220

Communication about requirements is often handled in issue tracking systems, especially in a distributed setting. As issue tracking systems also contain bug reports or programming tasks, the software feature requests of the users are often difficult to identify. This paper investigates natural language processing and machine learning features to detect software feature requests in natural language data of issue tracking systems. It compares traditional linguistic machine learning features, such as "bag of words", with more advanced features, such as subject-action-object, and evaluates combinations of machine learning features derived from the natural language and features taken from the issue tracking system meta-data. Our investigation shows that some combinations of machine learning features derived from natural language and the issue tracking system meta-data outperform traditional approaches. We show that issues or data fields (e.g. descriptions or comments), which contain software feature requests, can be identified reasonably well, but hardly the exact sentence. Finally, we show that the choice of machine learning algorithms should depend on the goal, e.g. maximization of the detection rate or balance between detection rate and precision. In addition, the paper contributes a double coded gold standard and an open-source implementation to further pursue this topic.

关键词： software computer bugs Natural languages Feature extraction Machine learning algorithms Prediction algorithms Training data

来源：评论

学校读者我要写书评

暂无评论

Securing vehicular ad-hoc networks from data falsification attacks

Securing vehicular ad-hoc networks from data falsification a...

引用

IEEE Region 10 International Conference TENCON

作者： Danda B. Rawat Bhed Bahadur Bista Gongjun Yan Dept. of Electrical Engineering & Computer Science Howard University Washington DC USA Faculty of Software & Information Science Iwate Prefectural University Iwate Ken Japan Department of Information/Computer Science University of Southern Indiana Evansville IN USA

ISBN: (纸本)9781509025985

Data falsification attack is one of the main security issues in vehicular ad-hoc networks (VANETs) where vehicles rely on information received from other peers/vehicles. In this paper, we propose a method to detect data falsification attack using hash chains for enhancing the network performance by adapting contention window size to forward accurate information to the neighboring vehicles in a timely manner (to improve throughput while reducing end-to-end delay). Performance of the proposed approach is evaluated using numerical results obtained from simulations. We found that the proposed adaptive approach prevents VANET from data falsification attacks and provides higher throughput with lower delay.

关键词： Vehicular ad hoc networks Delays Throughput Relays Adaptation models Cryptography

来源：评论

学校读者我要写书评

暂无评论

Black printed circuit board-based micro-polymerase chain reactionchip structure for fluorescence detection test

International Journal of Control and Automation

引用

International Journal of Control and Automation 2015年第10期8卷 15-24页

作者： Hwang, Ji-Soo Kim, Jong-Dae Kim, Yu-Seop Song, Hye-Jeong Park, Chan-Young Dept. of Computer Engineering Hallym University Korea Republic of Dept. of Convergence Software Hallym University Korea Republic of Bio-IT Research Center Hallym University Korea Republic of Department of Ubiquitous Computing Hallym University Korea Republic of

This paper proposes the optimal structure of a Printed Circuit Board-based micro-PCR Chip constructed on a PCB substrate using commercial adhesive tapes and plastic films. The proposed micro-PCR chip was composed of four layers. In a previous experiment, the chip had been made with a green PCB, yielding an unwanted reflection that prevented accurate analysis. In this study, the solder mask of the PCB substrate was coated black for a higher signal-to-noise ratio, and the area where the reaction chamber was attached was legend-printed with white silk for better reflection of the fluorescence light. The top cover, which was 180μm thick, was also colored black to minimize the noise during fluorescence detection. As a result of carrying out PCR, it was found that the fluorescence brightness increased with increasing numbers of cycles. © 2015 SERSC.

关键词： Polymerase chain reaction

来源：评论

学校读者我要写书评

暂无评论

A flash-aware buffering scheme using on-the-fly redo 15

A flash-aware buffering scheme using on-the-fly redo

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Jeong, Kyosung Kim, Sang-Wook Lim, Sungchae Dept. of Electronics and Computer Engineering Hanyang University Seoul Korea Republic of Dept. of Computer and Software Hanyang University Seoul Korea Republic of Dept. of Computer Science Dongduk Women's University Seoul Korea Republic of

ISBN: (纸本)9781450337946

In this paper, we address how to reduce the amount of page updates in flash-based DBMS equipped with SSD (solid state drive). We propose a novel buffering scheme that evicts a dirty page X without flushing it into SSD, and restores the right image of X when X is requested for later access. The restoration of X having previous flushing-less eviction is performed through our online redo actions on X. We call this page-restoring online redo the on-the-fly redo. Although our on-the-fly redo mechanism has some overhead of increasing the number of page reads, this can be compensated by infrequent page updates. Additionally, since the proposed buffering scheme with the on-the-fly redo can easily support the no-steal policy in buffer management, we can enjoy the advantages of smaller logging overhead and faster recovery. Through the TPC-C benchmarks using a Berkeley DB, we show that our scheme shortens the transaction processing times by up to 53%. © 2015 ACM.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

User-friendly calibration tool for temperature measurements of PCR devices with NTC thermistors

International Journal of Control and Automation

引用

International Journal of Control and Automation 2015年第7期8卷 13-24页

作者： Lee, Wan Yeon Kim, Tong Min Kim, Min Ja Ko, Young Woong Kim, Jong Dae Department of Computer Science Dongduk Women's University Seoul Korea Republic of Dept. of Computer Science and Engineering Korea University Seoul Korea Republic of Department of Computer engineering Hallym University Chunchon Korea Republic of Department of Convergence Software Hallym University Chunchon Korea Republic of

In this paper, we propose a user-friendly tool that calibrates the coefficient variables of Steinhart-Hart equation used for the temperature measurement of NTC thermistor. The proposed tool provides automatic modification of the coefficient variables only with temperature measurement, whereas the legacy process requires manual modification of the coefficient variables with temperature and resistance measurements. For user convenience, the proposed tool is implemented with a user-friendly GUI program. The tool is applied to 4-points temperature measurements of PCR devices. In accuracy evaluation, the proposed tool yields a precision of ±0.1°C. © 2015 SERSC.

关键词： Temperature measurement

来源：评论

学校读者我要写书评

暂无评论

Awareness-based couplings of intelligent agents and Other advanced coupling concepts for M&S 5

Awareness-based couplings of intelligent agents and Other ad...

引用

5th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2015

作者： Ören, Tuncer Yilmaz, Levent School of Electrical Engineering and Computer Science University of Ottawa OttawaON Canada Dept. of Computer Science and Software Engineering Auburn University AuburnAL United States

ISBN: (纸本)9789897581205

This study is a sequel of a recent publication where the coupling concepts as well as the advantages of coupling of declarative models were clarified. In this article, the basic concepts of simulation model coupling is reviewed. Advanced input concepts, including context-mediated perception, are elucidated. Synergy of agents and simulation is revised. Awareness-based couplings of intelligent agents are explained. Other advanced coupling concepts clarified include: deliberation-based coupling, introspection-based coupling, anticipation-based coupling, and model/real-system coupling.

关键词： Couplings

来源：评论

学校读者我要写书评

暂无评论

A Taxonomy for Program Metamodels in Program Reverse engineering

A Taxonomy for Program Metamodels in Program Reverse Enginee...

引用

International Conference on software Maintenance (ICSM)

作者： Hironori Washizaki Yann-Gaël Guéhéneuc Foutse Khomh SYSTEM INFORMATION CO. LTD. Tokyo Japan Dept. of Computer Science and Engineering Waseda University Tokyo Japan National Institute of Informatics Tokyo Japan PTIDEJ-SWAT DGIGL Polytechnique Montréal Quebec Canada

To support program comprehension, maintenance, and evolution, metamodels are frequently used during program reverse engineering activities to describe and analyze constituents of a program and their relations. Reverse engineering tools often define their own metamodels according to the intended purposes and features. Although each metamodel has its own advantages, its limitations may be addressed by other metamodels. Existing works have evaluated and compared metamodels and tools, but none have considered all the possible characteristics and limitations to provide a comprehensive guideline for classifying, comparing, reusing, and extending program metamodels. To aid practitioners and researchers in classifying, comparing, reusing, and extending program metamodels and their corresponding reverse engineering tools according to the intended goals, we establish a conceptual framework with definitions of program metamodels and related concepts. Then this framework is used to provide a comprehensive taxonomy, named Program Metamodel TAxonomy (ProMeTA), which incorporates newly identified characteristics into those stated in previous works, which were identified via a systematic literature survey on program metamodels, while keeping the orthogonality of the entire taxonomy. Additionally, we validate the taxonomy in terms of its orthogonality and usefulness through the classification of popular metamodels.

关键词： Reverse engineering Taxonomy Unified modeling language Biological system modeling Syntactics Grammar Data mining

来源：评论

学校读者我要写书评

暂无评论

An Analysis of Onion-Based Anonymous Routing for Delay Tolerant Networks

An Analysis of Onion-Based Anonymous Routing for Delay Toler...

引用

International Conference on Distributed Computing Systems

作者： Kazuya Sakai Min-Te Sun Wei-Shinn Ku Jie Wu Faisal S. Alanazi Dept. of Info. and Commun. Systems Tokyo Metropolitan University Hino Tokyo Japan Department of Computer Science and Information Engineering National Central University Taoyuan 320 Taiwan Department of Computer Science and Software Engineering Auburn University Auburn Alabama Department of Computer and Information Sciences Temple University Philadelphia PA Department of Electrical and Computer Engineering The Ohio State University Columbus Ohio

Delay tolerant network (DTN) routing provides a communication primitive in intermittently disconnected networks, such as battlefield communications and human-contact networks. In these applications, the anonymity preserving mechanism, which hides the identities of communicating parties, plays an important role as a defense against cyber and physical attacks. While anonymous routing protocols for DTNs have been proposed in the past, to the best of our knowledge, there is no work that emphasizes the theoretical aspects. In this paper, we first design an abstract of anonymous routing protocols for DTNs and augment the existing solution with multi-copy message forwarding. Then, we construct simplified mathematical models, which can be used to understand the fundamental performance and security guarantees of onion-based anonymous routing in DTNs. The numerical and simulation results using randomly generated contact graphs and the real traces demonstrate that our models provide very close approximations to the performance of the anonymous DTN routing protocol.

关键词： Routing Routing protocols Mathematical model Encryption Simulation

来源：评论

学校读者我要写书评

暂无评论

Preserving opacity on Interval Markov Chains under simulation

Preserving opacity on Interval Markov Chains under simulatio...

引用

International Workshop on Discrete Event Systems, WODES

作者： Béatrice Bérard Olga Kouchnarenko John Mullins Mathieu Sassolas Sorbonne Université UPMC Univ. Paris Paris France FEMTO-ST Univ. Franche-Comté Besançon France Dept. of Computer & Software Eng École Polytechnique de Montréal Montreal Quebec Canada LACL Université Paris-Est Créteil France

Given a probabilistic transition system (PTS) A partially observed by an attacker, and an ω-regular predicate φ over the traces of A, measuring the disclosure of the secret φ in A means computing the probability that an attacker who observes a run of A can ascertain that its trace belongs to φ. We consider specifications given as Interval Markov Chains (IMCs), which are underspecified Markov chains where probabilities on edges are only required to belong to intervals. Scheduling an IMC S produces a concrete implementation as a PTS and we define the worst case disclosure of secret φ in S as the maximal disclosure of φ over all PTSs thus produced. We compute this value for a subclass of IMCs and we prove that simulation between specifications can only improve the opacity of implementations.

关键词： Markov processes Probabilistic logic Semantics Computational modeling Context Observers Automata

来源：评论

学校读者我要写书评

暂无评论

Structural information based malicious app similarity calculation and clustering

Structural information based malicious app similarity calcul...

引用

Research in Adaptive and Convergent Systems, RACS 2015

作者： Kim, Junhyoung Kim, Tae Guen Im, Eul Gyu Dept. of Computer and Software Hanyang University Seoul Korea Republic of Div. of Computer Science and Engineering Hanyang University Seoul Korea Republic of

ISBN: (纸本)9781450337380

Depending on expansion of supply of smartphone, development of mobile application is more active using various mobile platform. As a result of malicious applications, but also targeting the mobile it is rapidly increasing. In this paper, method of Android malware similarity and clustering. First, there is a need for a process for extracting the control flow graph in an Android application. By extract the control flow graph, we form structural information of methods in Android application called'4-tuple'. After we create the structural information extracted from the control flow graph it is necessary to compare the matching process. Matching process we propose has two steps, 'initial matching' and 'second matching'. Initial matching step is the process of matching the'4-tuple' information but not exactly same with each other only a single in Android application. Second matching step is process of matching in the same way as the initial matching target method that calling its method and method that is invoked. Finally, it measure the ratio of the total number of method in Android application and matched method after initial matching and second matching. Finally, it measure the ratio of the total number of method in Android application and matched method after initial matching and second matching. We proceeds clustering using the above process. Based on previous studies, we used the DBSCAN algorithm for clustering. It was 65.8% average using the structural information of the result of the clustering. © 2015 ACM.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：