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

8th International Conference on Intelligent Computing Technology, ICIC 2012

作者： Liu, Wei Chen, Hanwu Chen, Ling Department of Computer Science and Engineering Southeast University Nanjing 210096 China Department of Computer Science Yangzhou University Yangzhou 225127 China National Key Lab. of Novel Software Tech. Nanjing University Nanjing 210093 China

ISBN: (纸本)9783642315879

This paper presents a novel method for CpG islands location identification based on conditional random fields (CRF) model. The method transforms CpG islands location identification into the problem of sequential data lab.ling. Based on the nature of CpG islands location, we design the methods of model constructing, training and decoding in CRF accordingly. Experimental results on benchmark data sets show that our algorithm is more practicable and efficient than the traditional methods. © 2012 Springer-Verlag.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

An interface model of software components

An interface model of software components

引用

10th International Colloquium on Theoretical Aspects of Computing, ICTAC 2013

作者： Dong, Ruzhen Zhan, Naijun Zhao, Liang Dipartmento di Informatica Università di Pisa Italy UNU-IIST China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences China Institute of Computing Theory and Technology Xidian University China

ISBN: (纸本)9783642397172

We present an automata-based model for describing the behaviors of software components. This extends our previous work by allowing internal behaviors. In order to improve the techniques for checking if two component can be composed without causing deadlocks, we develop an interface model, called input deterministic automata, that define all the non-blockable traces of invocation to services provided by a component. We also present an algorithm that, for any given component automaton, generates the interface model that has the same input deterministic behaviors as the original automaton. Properties of the algorithm with respect to component refinement and composition are studied as preliminary results towards a theory of software component interfaces. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

On sweep coverage with minimum mobile sensors

On sweep coverage with minimum mobile sensors

引用

16th IEEE International Conference on Parallel and Distributed systems, ICPADS 2010

作者： Du, Junzhao Li, Yawei Liu, Hui Sha, Kewei Software Engineering Institute Xidian University Xi'an ShaanXi China State Key Lab. of ISN Xidian University Xi'an ShaanXi China Department of Computer Science Oklahoma City University Oklahoma City OK United States

ISBN: (纸本)9780769543079

For some sensor network applications, the problem of sweep coverage, which periodically covers POIs (Points of Interest) to sense events, is of importance. How to schedule minimum number of mobile sensors to achieve the sweep coverage within specified sweep period is a challenging problem, especially when the POIs to be scanned exceeds certain scale and the speed of mobile sensor is limited. Therefore, multiple mobile sensors are required to collab.ratively complete the scanning task. When the mobile sensor is restricted to follow the same trajectory in different sweep periods, we design a centralized algorithm, MinExpand, to schedule the scan path. When the scan path of the existing mobile sensors has been exceeds the length constraint, MinExpand gradually deploys more mobile sensors and eventually achieves sweep coverage to all POIs. When the mobile sensors are not restricted to follow the same trajectory in different sweep periods, we design OSweep algorithm, where all the mobile sensors are scheduled to move along a TSP (Traveling Salesman Problem) ring consists of POIs. We conduct comprehensive simulations to study the performance of the proposed algorithms. The simulation results show that MinExpand and OSweep outperform CSWEEP in both effectiveness and efficiency. © 2010 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Sleep-wakeup algorithms for virtual barriers of wireless sensor networks in 3D space

Sleep-wakeup algorithms for virtual barriers of wireless sen...

引用

International Conference on Mobile Ad-hoc and Sensor Networks

作者： Du, Junzhao Liu, Chang Liu, Hui Sha, Kewei Software Engineering Institute Xidian University Xi'an ShaanXi China State Key Lab. of ISN Xidian University Xi'an ShaanXi China Department of Computer Science Oklahoma City University Oklahoma City OK United States

ISBN: (纸本)9780769543154

In order to maximize the lifetime of wireless sensor networks, while ensuring the monitoring quality for specific applications, we develop the sleep-wakeup algorithms for the sensor networks. Firstly, for the three-dimensional wireless sensor networks, we formulate the virtual barrier coverage problems. Secondly, the design and implementation of the nodes sleep-wakeup scheduling algorithm, FWP, to maximize the covering time of a single virtual barrier and the k-virtual barriers sleep-wakeup scheduling algorithm, OBP, to maximize the network coverage time of k virtual barriers are presented. Finally, through the comprehensive simulation, the effectiveness of the algorithms is validated. The relationships among the density of the virtual barriers, virtual lattice point, the number of sensors and the sensing radius are also investigated and simulated. © 2010 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Flow based clustering algorithm for tourism search engine

Flow based clustering algorithm for tourism search engine

引用

作者： Liu, Jie Du, Junping Sun, Zengqi Jia, Yingming Beijing Key Lab. of Intelligent Telecommunication Software and Multimedia School of Computer Science Beijing University of Posts and Telecommunications Beijing China Department of Computer Science Tsinghua University Beijing China Beijing China

ISBN: (纸本)9781424474530

This paper introduces a flow based clustering algorithm for tourism search engine. Unlike the general tourism search engines such as ***, *** and *** etc. to return the users' queries huge amount of web page links, this algorithm helps the tourism search engine create a list of words which serve as suggestions to expand and update the users' queries. It is much different from the previous clustering algorithms which cluster the results by the similar subjects. This algorithm clusters the search results by the inside vector distance representing each relationship between the web pages. In this manner, these representatives belong to different clusters merging into something like different flows. The experimental results indicate that the algorithm performs an unexpected usefulness for the users' queries. Meanwhile, through the comparison with some often used algorithms and an online survey, it shows this algorithm has an accepted performance. ©ICROS.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Collab.rative Reversing of Input Formats and Program Data Structures for Security Applications

引用

China Communications 2014年第9期11卷 135-147页

作者： ZHAO Lei Key Laboratory of Aerospace Information Security and Trust Computing Wuhan China Computer School of Wuhan University Wuhan China State Key Lab. for Novel Software Technology Nanjing University China

Reversing the syntactic format of program inputs and data structures in binaries plays a vital role for understanding program behaviors in many security *** this paper,we propose a collab.rative reversing technique by capturing the mapping relationship between input fields and program data *** key insight behind our paper is that program uses corresponding data structures as references to parse and access different input fields,and every field could be identified by reversing its corresponding data *** details,we use a finegrained dynamic taint analysis to monitor the propagation of *** identifying base pointers for each input byte,we could reverse data structures and conversely identify fields based on their referencing data *** construct several experiments to evaluate the *** results show that our approach could effectively reverse precise input formats,and provide unique benefits to two representative security applications,exploit diagnosis and malware analysis.

关键词： software security, reversingengineering fine-grained dynamic tainting

来源：评论

学校读者我要写书评

暂无评论

A Code Completion Approach Combining Pointer Network and Transformer-XL Network 19th

A Code Completion Approach Combining Pointer Network and Tr...

引用

19th EAI International Conference on Collab.rative Computing: Networking, Applications and Worksharing, Collab.rateCom 2023

作者： Zhang, Xiangping Liu, Jianxun Long, Teng Hu, Haize School of Computer Science and Engineering Hunan University of Science and Technology Hunan Xiangtan411100 China Hunan Key Lab. for Services Computing and Novel Software Technology Hunan University of Science and Technology Hunan Xiangtan411100 China

ISBN: (纸本)9783031545207

Code completion is an integral component of modern integrated development environments, as it not only facilitates the software development process but also enhances the quality of software products. By leveraging large-scale codes to learn the probability distribution among code token units, deep learning methods have demonstrated significant improvements in the accuracy of token unit recommendations. However, the effectiveness of code completion with deep learning techniques is hindered by information loss. To alleviate the above problem, we proposed a code language model which combines the pointer network and Transformer-XL network to overcome the limitations of existing approaches in code completion. The proposed model takes as input the original code fragment and its corresponding abstract syntax tree and leverages the Transformer-XL model as the basis model for capturing long-term dependencies. Furthermore, we integrate a pointer network as a local component to predict the out-of-vocabulary words. The proposed method is evaluated on real PY150 and JS150 datasets. The comparative experimental results demonstrate the effectiveness of our model in improving the accuracy of the code completion task at the token unit level. © ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

A dynamic marking method for implicit information flow in dynamic taint analysis 8

A dynamic marking method for implicit information flow in dy...

引用

8th International Conference on Security of Information and Networks, SIN 2015

作者： Wang, Xuefei Ma, Hengtai Jing, Lisha Sci. and Tech. on Integrated Information System Lab Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781450334532

Dynamic taint analysis is an important technique for tracking information flow in software and it has been widely applied in the field of software testing, debugging and vulnerability detection. However, most of the dynamic taint analysis tools only handle explicit information flow, while ignoring the implicit information flow, resulting in a large number of false negative *** this situation, we present a dynamic marking method for implicit information flow, to handle a specific type of control-dependence. The method can identify and propagate implicit data during runtime, thus increasing the coverage of the tested program. we also propose pipeline, integrating our method in the process of dynamic taint analysis. Pipeline is implemented on the base of the dynamic taint analysis framework avalanche, and is designed to detect vulnerabilities in binary programs. In the studies, we applied the tool to 5 applications from some open-source projects, and it has effectively located and propagated the specific kind of implicit information flow. © 2015 ACM.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

The applications of generalized learning in RSIRS

The applications of generalized learning in RSIRS

引用

2004 7th International Conference on Signal Processing Proceedings, ICSP

作者： Yao, Min Shou, Zhou-Xiang Wu, Ming Zhao, Xiaoming College of Computer Zhejiang University Hangzhou 310027 China State Key Lab. Novel Software T. Nanjing University Nanjing 210093 China Dept. of Computer Taizhou University Taizhou 317000 China

ISBN: (纸本)0780384075

Generalized learning is a kind of integrated machine learning methods, which combines symbolic learning with connective learning, fuzzy learning and evolutionlearning. This paper discusses the fundamental principle for generalized learning first. Then the generalized learning is introduced to remote sensing image recognition system (RSIRS for short) to obtain certain knowledge from training sample set for classification. The experiment result has shown the validity of generalized learning in knowledge discovering.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Sleep scheduling method based on half-sleep state in the distributed sensor network 9

Sleep scheduling method based on half-sleep state in the dis...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Deng, Pan Chen, Feng Yan, Biying Zhang, Jianwei Zhao, Long Wan, Jiafu Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China College of Electrical Engineering and Automation Jiangxi University of Science and Technology Ganzhou China

ISBN: (纸本)9783319133256

In order to extend the sensor’s lifetime, this paper researched deeply into the sleep scheduling mechanism in the distributed sensor network. Now, the commonly used sleep scheduling methods based on the coverage have the problem of response delay, so we proposed a sleep scheduling method based on the half-sleep state to overcome this shortcoming. Under the control of regional agent node, this method adopts a minimum coverage algorithm based on the approximate solution to select the minimum coverage node set. Experimental results show that the proposed scheduling method can both reduce power consumption of the whole network effectively and extend the lifetime of the sensor noticeably. © Institute for computer sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：