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

arXiv 2018年

作者： Zhang, Chen Jason Chen, Lei Jagadish, H.V. Zhang, Mengchen Tong, Yongxin School of Computer Science and Technology Shandong University of Finance and Economics Jinan Shandong China Department of Computer Science and Engineering Hong Kong University of Science and Technology Kowloon Hong Kong Department of Electrical Engineering and Computer Science University of Michigan United States State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China

Schema matching is a central challenge for data integration systems. Inspired by the popularity and the success of crowdsourcing platforms, we explore the use of crowdsourcing to reduce the uncertainty of schema matching. Since crowdsourcing platforms are most effective for simple questions, we assume that each Correspondence Correctness Question (CCQ) asks the crowd to decide whether a given correspondence should exist in the correct matching. Furthermore, members of a crowd may sometimes return incorrect answers with different probabilities. Accuracy rates of individual crowd workers are probabilities of returning correct answers which can be attributes of CCQs as well as evaluations of individual workers. We prove that uncertainty reduction equals to entropy of answers minus entropy of crowds and show how to obtain lower and upper bounds for it. We propose frameworks and efficient algorithms to dynamically manage the CCQs to maximize the uncertainty reduction within a limited budget of questions. We develop two novel approaches, namely "Single CCQ" and "Multiple CCQ", which adaptively select, publish and manage questions. We verify the value of our solutions with simulation and real implementation. Copyright © 2018, The Authors. All rights reserved.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

A Power and Area Optimization Approach of Mixed Polarity Reed-Muller Expression for Incompletely Specified Boolean Functions

引用

Journal of computer science & Technology 2017年第2期32卷 297-311页

作者： Zhen-Xue He Li-Min Xiao Li Ruan Fei Gu Zhi-Sheng Huo Guang-Jun Qin Ming-Fa Zhu F Long-Bing Zhang Rui Liu Xiang Wang State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China School of Electronic and Information Engineering Beihang University Beijing 100191 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China National Engineering Research Center for Science and Technology Resources Sharing Service Beihang University Beijing 100191 China

The power and area optimization of Reed-Muller （RM） circuits has been widely concerned. However, almost none of the exiting power and area optimization approaches can obtain all the Pareto optimal solutions of the original problem and are efficient enough. Moreover, they have not considered the don＇t care terms, which makes the circuit performance unable to be further optimized. In this paper, we propose a power and area optimization approach of mixed polarity RM expression （MPRM） for incompletely specified Boolean functions based on Non-Dominated Sorting Genetic Algorithm II （NSGA-II）. Firstly, the incompletely specified Boolean function is transformed into zero polarity incompletely specified MPRM （ISMPRM） by using a novel ISMPRM acquisition algorithm. Secondly, the polarity and allocation of don＇t care terms of ISMPRM is encoded as chromosome. Lastly, the Pareto optimal solutions are obtained by using NSGA-II, in which MPRM corresponding to the given chromosome is obtained by using a chromosome conversion algorithm. The results on incompletely specified Boolean functions and MCNC benchmark circuits show that a significant power and area improvement can be made compared with the existing power and area optimization approaches of RM circuits.

关键词： power and area optimization Reed-Muller （RM） circuit Pareto optimal solution don＇t care term chromosomeconversion

来源：评论

学校读者我要写书评

暂无评论

Scalab.e tag recommendation for software information sites 24

Scalable tag recommendation for software information sites

引用

24th IEEE International Conference on software Analysis, Evolution, and Reengineering, SANER 2017

作者： Zhou, Pingyi Liu, Jin Yang, Zijiang Zhou, Guangyou State Key Lab. of Software Engineering Computer School Wuhan University China Department of Computer Science Western Michigan University Kalamazoo United States School of Computer Central China Normal University Wuhan China

ISBN: (纸本)9781509055012

software developers can search, share and learn development experience, solutions, bug fixes and open source projects in software information sites such as StackOverflow and Freecode. Many software information sites rely on tags to classify their contents, i.e. software objects, in order to improve the performance and accuracy of various operations on the sites. The quality of tags thus has a significant impact on the usefulness of these sites. High quality tags are expected to be concise and can describe the most important features of the software objects. © 2017 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Sliding-window based Propagation-aware Temporal Verification for Monitoring Parallel Cloud Business Workflows

Sliding-window based Propagation-aware Temporal Verification...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yeguo Wang Rongbin Xu Futian Wang Haoyu Luo Menglong Wang Xiao Liu School of Computer Science and Technology Anhui University Hefei China Ministry of Education Anhui University Hefei China State Key Lab. of Software Engineering Wuhan University Wuhan China School of Info Technology Deakin University Melbourne australia

Dn-time completion is one of critical QoS (Quality of Service) measurements for massive time-constrained business processes executing in the cloud environment. However, temporal violations inevitably occur during the execution of business workflows due to the uncertainty and dynamic nature of cloud environment. To realize the goal of the target on-time completion rate, workflow temporal verification is employed for monitoring the execution time of workflow activities and handling time delays before the deadline. While current studies on business cloud workflows temporal verification mainly monitor the execution of workflows with fixed observation time intervals along the system timeline, which can result in huge monitoring cost. To reduce the monitoring cost, this paper presents a sliding-window based dynamic temporal checkpoint selection strategy using propagation-aware throughput temporal consistency model for parallel cloud business workflows. The strategy adjusts the next observation time interval according to the temporal verification result at the previous checkpoint. Experimental results show that our strategy can select fewer temporal checkpoints and violation handling points compared with conventional strategies under the same situations.

关键词： Conferences Collab.rative work

来源：评论

学校读者我要写书评

暂无评论

Big graph search： challenges and techniques

引用

Frontiers of computer science 2016年第3期10卷 387-398页

作者： Shuai MA Jia LI Chunming HU Xuelian LIN Jinpeng HUAI State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing 100191 China

On one hand, compared with traditional rela- tional and XML models, graphs have more expressive power and are widely used today. On the other hand, various ap- plications of social computing trigger the pressing need of a new search paradigm. In this article, we argue that big graph search is the one filling this gap. We first introduce the ap- plication of graph search in various scenarios. We then for- malize the graph search problem, and give an analysis of graph search from an evolutionary point of view, followed by the evidences from both the industry and academia. After that, we analyze the difficulties and challenges of big graph search. Finally, we present three classes of techniques to- wards big graph search： query techniques, data techniques and distributed computing techniques.

关键词： graph search big data query techniques data techniques distributed computing

来源：评论

学校读者我要写书评

暂无评论

Towards a multi-layers anomaly detection framework for analyzing network traffic

Towards a multi-layers anomaly detection framework for analy...

引用

作者： Li, Bo Zhang, Simin Li, Ke State Key Laboratory of Software Development Environment Beihang University Beijing China School of Aeronautic Science and Engineering Beihang University Beijing China Guangxi Key Lab of Multi-source Information Mining & Security Guangxi China

Anomaly detection plays a crucial part in identifying unforeseen attacks for network and information security. However, the accuracy of existing network anomaly detection approaches is limited because of the lack of sufficient and high-quality features. Most research works only take information from one network layer into account, which leads to a situation that some key features of other network layers are omitted. To address this issue, we propose a novel approach, named Multi-Layers Anomaly Detection, which extracts and combines features from different network layers. In order to reduce redundancy and noise derived from the combination of multiple layers, an algorithm called RanPF is designed by applying principal components analysis (PCA) into random forest (RF) algorithm. RanPF uses features selected by PCA to decide the height of every tree in RF and provides a method to select which features for tree nodes to use according to the weights of principal components. To obtain high-quality features, we adopt an attribute learning mechanism. Naive Bayes is used to characterize the attribute information, which is fast and simple compared with other learning algorithms such as SVM. In addition, a series of experiments conducted on two real-life datasets demonstrate that our approach outperforms the state-of-the-art methods in terms of detection rate and false alarm rate. MLAD achieves about 99% detection rate and about 0.6% false alarm rate on average when the ratio of the training set is 60%. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

YA-JOP:YET ANOTHER JAVA OBJECT PROFILER ON ART VIRTUAL MACHINE

YA-JOP:YET ANOTHER JAVA OBJECT PROFILER ON ART VIRTUAL MACHI...

引用

2017 2nd Joint International Mechanical,Electronic and Information Technology Conference(JIMET 2017)

作者： Fei Wang Xiaohua Shi Chao Li State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University

In this paper,we design and implement an efficient and low overhead Java object profiler called YA-JOP on Android 6.0and its ART virtual machine,which uses an AOT(ahead-oftime)***-JOP records the allocation site,the class information,the object size,the birth time and death time,the last access time and the access regular pattern for every Java *** data profiled can help the developers to detect memory leaks,find reusable objects,implement optimizations like pretenuring,*** profiler proposed in this paper has reasonable execution time overhead,imposes no overhead on the Java heap and does not modify any existing key data structure of the ART Virtual Machine,including the object layouts,class layouts and any others.

关键词： java object profiler embedded systems Android managed languages object lifetime information

来源：评论

学校读者我要写书评

暂无评论

How to reduce software development cost with personnel assignment optimization: Exemplary improvement on the Hungarian Algorithm 17

How to reduce software development cost with personnel assig...

引用

21st International Conference on Evaluation and Assessment in software engineering, EASE 2017

作者： Wang, Chong Luo, Zhong Lin, Luxin Daneva, Maya State Key Lab. of Software Engineering Computer School Wuhan University Wuhan430072 China University of Twente Enschede7522HN Netherlands Science and Research Department Naval University of Engineering Wuhan430033 China Computer School Wuhan University Wuhan430072 China

ISBN: (纸本)9781450348041

Reasonable reduction and controlling of software cost is always a challenge for software companies. To estimate software development cost more precisely, current research effort is focused on improving the measurement of software size or complexity by combining or adjusting key cost drivers, such as function points and other observable project context factors. However, personnel factors are seldom investigated or treated in depth as a way to reduce the estimated software development cost. On the premise that a software project is decomposed in a number of tasks, and that predetermined developers are availab.e as resources for it, this paper intends to optimize the allocation of availab.e personnel for lower development cost. In this research, we consider the problem of allocating competent developers to suitable tasks as an unbalanced personnel assignment problem, and improve the traditional Hungarian Algorithm by applying three strategies to find optimal personnel allocation solutions for diverse requirements. Moreover, the performance of our improved algorithms is evaluated and compared through a series of experiments on simulation datasets to identify and validate the measurement indicators and influence factors of their performance. © 2017 ACM.

关键词： Cost estimating

来源：评论

学校读者我要写书评

暂无评论

Coordinating workload balancing and power switching in renewable energy powered data center

引用

Frontiers of computer science 2016年第3期10卷 574-587页

作者： Xian LI Rui WANG Zhongzhi LUAN Yi LIU Depei QIAN State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China

There has been growing concern about energy consumption and environmental impact of datacenters. Some pioneers begin to power datacenters with renewable energy to offset carbon footprint. However, it is challenging to integrate intermittent renewable energy into datacenter power system. Grid-tied system is widely deployed in renewable energy powered datacenters. But the drawbacks （e.g. Harmonic dis- turbance and costliness） of grid tie inverter harass this design. Besides, the mixture of green load and brown load makes power management heavily depend on software measurement and monitoring, which often suffers inaccuracy. We propose DualPower, a novel power provisioning architecture that en- ables green datacenters to integrate renewable power supply without grid tie inverters. To optimize DualPower operation, we propose a specially designed power management frame- work to coordinate workload balancing with power supply switching. We evaluate three optimization schemes （LM, PS and JO） under different datacenter operation scenarios on our trace-driven simulation platform. The experimental results show that DualPower can be as efficient as grid-tied system and has good scalab.lity. In contrast to previous works, Du- alPower integrates renewable power at lower cost and main- tains full availab.lity of datacenter servers.

关键词： renewable energy green computing power pro-visioning power management

来源：评论

学校读者我要写书评

暂无评论

A deduplication algorithm based on data similarity and delta encoding 4th

A deduplication algorithm based on data similarity and delta...

引用

4th International Conference on Geo-Informatics in Resource Management and Sustainable Ecosystem, GRMSE 2016

作者： Song, Bin Xiao, Limin Qin, Guangjun Ruan, Li Qiu, Shida State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing100191 China National Engineering Research Center for Science and Technology Resources Sharing Service Beijing100191 China Space Star Technology Co. Ltd. Beijing100086 China

ISBN: (纸本)9789811039683

Satellite applications such as remote sensing application are overwhelmed with vast quantities of data. Nevertheless, the storage resources in the satellite are so limited that it should be used more efficient. The similarity between the remote sensing data is high, but the dissimilar parts of the data distribute irregularly. When using the traditional deduplication algorithm to split the file into chunks, a large amount of chunks are exactly similar but not the same, which results in the bad effect of data deduplication. We propose a deduplication algorithm based on data similarity and delta encoding to reduce the usage of storage resources. The data similarity analysis can find out the similar data. The delta encoding technology can reduce the usage of storage resources. Through experiments on remote sensing application data, we have achieved deduplication ratios up to 30:1, and analyzed how the chunksize affect the experiment results. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Satellites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：