|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Link prediction in social networks: the state-of-the-art显示文摘In social networks, link prediction predicts missing links in current networks and new or dissolution links in future networks, is important for mining and analyzing the evolution of social networks. In the past decade, many works have been done about the link prediction in social networks. The goal of this paper is to comprehensively review, analyze and discuss the state-of-the-art of the link prediction in social networks. A systematical category for link prediction techniques and problems is presented. Then link prediction techniques and problems are analyzed and discussed. Typical applications of link prediction are also addressed. Achievements and roadmaps of some active research groups are introduced. Finally, some future challenges of the link prediction in social networks are discussed. | WANG Peng XU BaoWen WU YuRong ZHOU XiaoYu | 2015 | Science China(Information Sciences)2015,58,1: | 52 |
| 2 | Single-phase-to-ground Fault Detection with Distributed Parameters Analysis in Non-direct Grounded Systems显示文摘The fast and accurate detection of the single-phaseto-ground fault is of great significance for the reliability and safety of the power supply.In this paper,novel algorithms for distribution network protection were proposed with distributed parameters analysis in non-direct grounded systems.At first,novel generating mechanisms of zero-sequence voltage and residual current were proposed.Then the compositions of residue parameters,including residual current and residual admittances,were decomposed in detail.After that,an improved algorithm for a fault resistance calculation of a single phase-to-earth fault was also proposed,and the algorithm is much more convenient as it only needs to measure the variation of the zero-sequence voltage and does not need the prerequisites of the faulty feeder selection.Furthermore,the fault feeder can also be selected by an improved calculation algorithm of zero-sequence admittance of the faulty feeder,which cannot be affected by the asymmetry of the network.Theoretical analysis and the MATALB/Simulink simulation results demonstrate the effectiveness of the proposed algorithms. | Baowen Liu Hongzhong Ma Honghua Xu Ping Ju | 2019 | CSEE Journal of Power and Energy Systems2019,5,1: | 16 |
| 3 | Stable Initialization Scheme for K-Means Clustering显示文摘Though K-means is very popular for general clustering, its performance, which generally converges to numerous local minima, depends highly on initial cluster centers. In this paper a novel initialization scheme to select initial cluster centers for K-means clustering is proposed. This algorithm is based on reverse nearest neighbor (RNN) search which retrieves all points in a given data set whose nearest neighbor is a given query point. The initial cluster centers computed using this methodology are found to be very close to the desired cluster centers for iterative cluster-ing algorithms. This procedure is applicable to clustering algo-rithms for continuous data. The application of the proposed algo-rithm to K-means clustering algorithm is demonstrated. An ex-periment is carried out on several popular datasets and the results show the advantages of the proposed method. | XU Junling XU Baowen ZHANG Weifeng ZHANG Wei HOU Jun | 2009 | Wuhan University Journal of Natural Sciences2009,14,1: | 15 |
| 4 | The Forthcoming 30th International Geological Congress (Beijing)-Geological Olympic Grand Meeting显示文摘TheForthcoming30thInternationalGeologicalCongress(Beijing)-GeologicalOlympicGrandMeeting¥//YanDunshi(ViceChairmanoftheOrganiz... | (Vice Chairman of the Organization Committee of the 30th IGC the Chairman of Exhibition committee)Xu Baowen(Chairman of the Exhibition Commitiee of the 30th IGC.the Deputy director of Senior,Consultotation,Center of the Minisiry of Geology and Mineral Res | 1996 | China Oil & Gas1996,3,2: | 10 |
| 5 | Comparing logic coverage criteria on test case prioritization显示文摘Logic coverage criteria have been widely used in the testing of safety-critical software.In the past few years,fault-based logic coverage criteria have been studied intensively both in theory and in practice.However,there is a lack of authentic evidence of the comparison of fault-based logic coverage criteria with other logic coverage criteria,such as branch coverage and modified condition/decision coverage(MC/DC).In this paper,we present a comprehensive empirical study that compares these logic coverage criteria on test case prioritization,which is currently a hot topic in software testing.Several useful conclusions are drawn from our research:(1) Fine-grained coverage criteria are always more effective and efficient.(2) The effectiveness of fault-based logic coverage criteria is not significantly different from that of MC/DC in terms of statistics,but the former is more stable.(3) A random strategy is more effective than branch coverage if a certain number of test cases are redundant. | FANG ChunRong CHEN ZhenYu XU BaoWen | 2012 | Science China(Information Sciences)2012,55,12: | 6 |
| 6 | MEASURING STRUCTURE COMPLEXITY OF UML CLASS DIAGRAMS显示文摘To provide system designer a valid measure to evaluate the structure complexityof class diagrams objectively, this letter first proposes a method to transform a class diagramsinto a weighted class dependence graph, then presents a structure complexity measure for classdiagrams based on entropy distance. | Zhou Yuming Xu Baowen (Dept. of Computer Science & Eng., Southeast Univ., Nanjing 210096) (State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072) (Jiangsu Key Lab. of Computer Info. Proc. Tech., Soochow Univ., Suzhou 215006) | 2003 | Journal of Electronics(China)2003,20,3: | 6 |
| 7 | A New Approach of Feature Selection for Text Categorization显示文摘This paper proposes a new approach of feature selection based on the independent measure between features for text categorization. A fundamental hypothesis that occurrence of the terms in documents is independent of each other, widely used in the probabilistic models for text categorization (TC), is discussed. However, the basic hypothesis is incomplete for independence of feature set. From the view of feature selection, a new independent measure between features is designed, by which a feature selection algorithm is given to obtain a feature subset. The selected subset is high in relevance with category and strong in independence between features, satisfies the basic hypothesis at maximum degree. Compared with other traditional feature selection method in TC (which is only taken into the relevance account), the performance of feature subset selected by our method is prior to others with experiments on the benchmark dataset of 20 Newsgroups. | CUI Zifeng XU Baowen ZHANG Weifeng XU Junling | 2006 | Wuhan University Journal of Natural Sciences2006,11,5: | 6 |
| 8 | A study on the changes of dynamic feature code when fixing bugs: towards the benefits and costs of Python dynamic features显示文摘Dynamic features in programming languages support the modification of the execution status at runtime, which is often considered helpful in rapid development and prototyping. However, it was also reported that some dynamic feature code tends to be change-prone or error-prone. We present the first study that analyzes the changes of dynamic feature code and the roles of dynamic features in bug-fix activities for the Python language. We used an AST-based differencing tool to capture fine-grained source code changes from 17926 bug-fix commits in 17 Python projects. Using this data, we conducted an empirical study on the changes of dynamic feature code when fixing bugs in Python. First, we investigated the characteristics of dynamic feature code changes, by comparing the changes between dynamic feature code and non-dynamic feature code when fixing bugs, and comparing dynamic feature changes between bug-fix and non-bugfix activities. Second, we explored 226 bug-fix commits to investigate the motivation and behaviors of dynamic feature changes when fixing bugs. The study results reveal that(1) the changes of dynamic feature code are significantly related to bug-fix activities rather than non-bugfix activities;(2) compared with non-dynamic feature code, dynamic feature code is inserted or updated more frequently when fixing bugs;(3) developers often insert dynamic feature code as type checks or attribute checks to fix type errors and attribute errors;(4) the misuse of dynamic features introduces bugs in dynamic feature code, and the bugs are often fixed by adding a check or adding an exception handling. As a benefit of this paper, we gain insights into the manner in which developers and researchers handle the changes of dynamic feature code when fixing bugs. | Zhifei CHEN Wanwangying MA Wei LIN Lin CHEN Yanhui LI Baowen XU | 2018 | Science China(Information Sciences)2018,61,1: | 4 |
| 9 | A New Feature Selection Method for Text Clustering显示文摘Feature selection methods have been successfully ap-plied to text categorization but seldom applied to text clustering due to the unavailability of class label information. In this paper,a new feature selection method for text clustering based on expecta-tion maximization and cluster validity is proposed. It uses super-vised feature selection method on the intermediate clustering result which is generated during iterative clustering to do feature selec-tion for text clustering;meanwhile,the Davies-Bouldin's index is used to evaluate the intermediate feature subsets indirectly. Then feature subsets are selected according to the curve of the Davies-Bouldin's index. Experiment is carried out on several popular datasets and the results show the advantages of the proposed method. | XU Junling XU Baowen ZHANG Weifeng CUI Zifeng ZHANG Wei | 2007 | Wuhan University Journal of Natural Sciences2007,12,5: | 3 |
| 10 | Empirical analysis of network measures for predicting high severity software faults显示文摘Network measures are useful for predicting fault-prone modules. However, existing work has not distinguished faults according to their severity. In practice, high severity faults cause serious problems and require further attention. In this study, we explored the utility of network measures in high severity faultproneness prediction. We constructed software source code networks for four open-source projects by extracting the dependencies between modules. We then used univariate logistic regression to investigate the associations between each network measure and fault-proneness at a high severity level. We built multivariate prediction models to examine their explanatory ability for fault-proneness, as well as evaluated their predictive effectiveness compared to code metrics under forward-release and cross-project predictions. The results revealed the following:(1) most network measures are significantly related to high severity fault-proneness;(2) network measures generally have comparable explanatory abilities and predictive powers to those of code metrics; and(3) network measures are very unstable for cross-project predictions. These results indicate that network measures are of practical value in high severity fault-proneness prediction. | Lin CHEN Wanwangying MA Yuming ZHOU Lei XU Ziyuan WANG Zhifei CHEN Baowen XU | 2016 | Science China Earth Sciences2016,59,12: | 3 |
| 11 | An empirical study on constraint optimization techniques for test generation显示文摘Constraint solving is a frequent, but expensive operation with symbolic execution to generate tests for a program. To improve the efficiency of test generation using constraint solving, four optimization techniques are usually applied to existing constraint solvers, which are constraint independence, constraint set simplification, constraint caching, and expression rewriting. In this paper, we conducted an empirical study, using these four constraint optimization techniques in a well known test generation tool KLEE with 77 GNU Coreutils applications, to systematically investigate how these optimization techniques affect the efficiency of test generation. The experimental results show that these constraint optimization techniques as well as their combinations cannot improve the efficiency of test generation significantly for ALL-SIZED programs. Moreover, we studied the constraint optimization techniques with respect to two static metrics, lines of code(LOC) and cyclomatic complexity(CC), of programs. The experimental results show that the 'constraint set simplification' technique can improve the efficiency of test generation significantly for the programs with high LOC and CC values. The'constraint caching' optimization technique can improve the efficiency of test generation significantly for the programs with low LOC and CC values. Finally, we propose four hybrid optimization strategies and practical guidelines based on different static metrics. | Zhiyi ZHANG Zhenyu CHEN Ruizhi GAO Eric WONG Baowen XU | 2017 | Science China(Information Sciences)2017,60,1: | 3 |
| 12 | Measuring the thermal conductivity and interfacial thermal resistance of suspended MoS2 using electron beam self-heating technique显示文摘Establishment of a new technique or extension of an existing technique for thermal and thermoelectric measurements to a more challenging system is an important task to explore the thermal and thermoelectric properties of various materials and systems. The bottleneck lies in the challenges in measuring the thermal contact resistance. In this work, we applied electron beam self-heating technique to derive the intrinsic thermal conductivity of suspended Molybdenum Disulfide(MoS_2) ribbons and the thermal contact resistance, with which the interfacial thermal resistance between few-layer MoS_2 and Pt electrodes was calculated. The measured room temperature thermal conductivity of MoS_2 is around ~30 W/(m K),while the estimated interfacial thermal resistance is around ~2 × 10^(-6)m^2 K/W. Our experiments extend a useful branch in application of this technique for studying thermal properties of suspended layered ribbons and have potential application in investigating the interfacial thermal resistance of different twodimensional(2 D) heterojunctions. | Adili Aiyiti Xue Bai Jing Wu Xiangfan Xu Baowen Li | 2018 | Science Bulletin2018,63,7: | 3 |
| 13 | A Testing Method for Web Services Composition Based on Data-Flow显示文摘This paper proposes a method of data-flow testing for Web services composition. Firstly, to facilitate data flow analysis and constraints collecting, the existing model representation of business process execution language (BPEL) is modified in com-pany with the analysis of data dependency and an exact represen-tation of dead path elimination (DPE) is proposed, which over-comes the difficulties brought to dataflow analysis. Then defining and using information based on data flow rules is collected by parsing BPEL and Web services description language (WSDL) documents and the def-use annotated control flow graph is created. Based on this model, data-flow anomalies which indicate potential errors can be discovered by traversing the paths of graph, and all-du-paths used in dynamic data flow testing for Web services composition are automatically generated, then testers can design the test cases according to the collected constraints for each path selected. | HOU Jun XU Baowen XU Lei WANG Di XU Junling | 2008 | Wuhan University Journal of Natural Sciences2008,13,4: | 2 |
| 14 | Thermal transport in organic/inorganic composites显示文摘因为他们的优秀机械性质,合成材料,由器官、无机的部件组成,广泛地在各种各样的地里被使用,抵抗到腐蚀,便宜制造,等等。器官 / 无机的 composites 的热性质为微电子的包装,为发电和制冷的为传感器开发的 nano 多孔的材料,为太空的热绝缘体,和高效的热电的材料在象热接口材料那样的一些应用程序起一个关键作用。在过去几年里,许多研究被进行了在器官 / 无机的合成材料揭示热运输的物理机制以便刺激他们的实际应用。在这份报纸,这个领域里的理论、试验性的进步被考察。而且,影响器官 / 无机的 composites 的热传导性的主要因素被讨论,包括器官的矩阵的内在的性质,装载体积部分并且无机的 fillers, composites 的拓扑的结构,和在 fillers 和器官的矩阵之间的界面的热抵抗。 | Bin LIU Lan DONG Qing Xi Xiangfan XU Jun ZHOU Baowen LI | 2018 | Frontiers in Energy2018,12,1: | 2 |
| 15 | ISTC: A New Method for Clustering Search Results显示文摘A new common phrase scoring method is proposed according to term frequency-inverse document frequency (TFIDF) and independence of the phrase. Combining the two properties can help identify more reasonable common phrases, which improve the accuracy of clustering. Also, the equation to measure the in-dependence of a phrase is proposed in this paper. The new algo-rithm which improves suffix tree clustering algorithm (STC) is named as improved suffix tree clustering (ISTC). To validate the proposed algorithm, a prototype system is implemented and used to cluster several groups of web search results obtained from Google search engine. Experimental results show that the im-proved algorithm offers higher accuracy than traditional suffix tree clustering. | ZHANG Wei XU Baowen ZHANG Weifeng XU Junling | 2008 | Wuhan University Journal of Natural Sciences2008,13,4: | 2 |
| 16 | A fuzzy extension for SHOIQ based on comparisons between degrees of membership显示文摘The current fuzzy extensions for description logics do not support representing and reasoning with complex fuzzy knowledge about comparisons between degrees of membership,which is very useful in practical applications.We investigate a novel approach of extending the description logic SHOIQ to SHOIQ FC by annotating concepts and roles based on comparison expressions.SHOIQ FC provides the ability to represent complex fuzzy knowledge,in addition to the expressive power of the fuzzy description logic FSHOIQ.The main contributions are a decidability proof for the consistency problem of SHOIQ FC knowledge bases,as well as its tableau-based reasoning algorithm. | KANG DaZhou XU BaoWen LI YanHui | 2013 | Science China(Information Sciences)2013,56,8: | 2 |
| 17 | On the ability of complexity metrics to predict fault-prone classes in object- oriented systems显示文摘 | Zhou Yuming Xu Baowen Leung H | 2010 | Journal of Systems and Software2010,83,4: | 1 |
| 18 | An improved accuracy measure for rough sets显示文摘 | Xu Baowen Zhou Yuming Lu Hongmin | 2005 | Journal of Computer and System Sciences2005,71,2: | 1 |
| 19 | An Overview of Methods for Dependence Analysis of Concurrent Programs显示文摘 | Chen Zhenqiang Xu Baowen Zhao Jianjun | 2002 | SIGPLAN Notices2002,37,8: | 1 |
| 20 | Slicing concurrent java programs 显示文摘 | CHEN Zhenqiang XU Baowen | 2001 | ACM SIGPLAN Notices2001,36,4: | 1 |