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

AN EXTENDED MODEL FOR PROJECT PORTFOLIO SELECTION WITH PROJECT DIVISIBILITY AND INTERDEPENDENCY

Journal of Systems Science and Systems engineering 2016年第1期25卷 119-138页

作者： Xingmei Li Shu-Cherng Fang Xiaoling Guo Zhibin Deng Jianxun Qi School of Economics and Management North China Electric Power University Beijing 102206 China Industrial and Systems Engineering Department North Carolina State University Raleigh NC 27695 USA College of Engineering andlnformation Technology University of Chinese Academy of Sciences Beijing100049 China School of Management University of Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing 100190 China

In this paper, we develop an extended model for the project portfolio selection problem over a planning horizon with multiple time periods. The model incorporates the factors of project divisibility and interdependency at the same time for real-life applications. The project divisibility is considered as a strategy, not an unfortunate event as in the literature, in choosing the best execution schedule for the projects, and the classical concept of＂project interdependencies＂ among fully executed projects is then extended to the portions of executed projects. Additional constraints of reinvestment consideration, setup cost, cardinality restriction, precedence relationship and scheduling are also included in the model. For efficient computations, an equivalent mixed integer linear programming representation of the proposed model is derived. Numerical examples under four scenarios are presented to highlight the characteristics of the proposed model. In particular, the positive effects of project divisibility are shown for the first time.

关键词： Project management project portfolio selection problem project divisibility project interdependency

来源：评论

学校读者我要写书评

暂无评论

BeCFI: Detecting hidden control flow with performance monitoring counters

引用

International Journal of High Performance Computing and Networking 2016年第5-6期9卷 470-479页

作者： Zhou, Hong Wei Shi, Wen Chang Yuan, Jin Hui Li, Fu Lin Institute of Electronic Technology Information Engineering University Zhengzhou China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China

Most of existing control flow integrity efforts target keeping intended control flow in good integrity. However, they fail to expose hidden control flow that may be introduced by the execution of rootkits, ROP gadgets, etc. To overcome the challenge, we propose an innovative approach BeCFI to detect hidden control flow based on cross-view principle. Since modern processors are capable of observing the execution of all branch instructions, BeCFI obtains the hardware view with the support of performance monitoring counters (PMCs). To obtain software view, we build a software-based counter by compiler-patching and binary-overwriting, and monitor the execution of branch instructions with software-based counters. If a control transfer only appears in hardware view, BeCFI considers that it is hidden control transfer. We have developed a prototype system on Intel x86 Linux kernel. Our evaluations show BeCFI is capable of detecting the hidden control flow introduced by kernel rootkits and ROP attacks. Furthermore our performance tests demonstrate that BeCFI incurs an acceptable overhead. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Tri-level combination for image representation 17th

Tri-level combination for image representation

引用

17th Pacific-Rim Conference on Multimedia, PCM 2016

作者： Li, Ruiying Zhang, Chunjie Huang, Qingming School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319488899

The context of objects can provide auxiliary discrimination beyond objects. However, this effective information has not been fully explored. In this paper, we propose Tri-level Combination for Image Representation (TriCoIR) to solve the problem at three different levels: object intrinsic, strongly-related context and weakly-related context. Object intrinsic excludes external disturbances and more focuses on the objects themselves. Strongly-related context is cropped from the input image with a more loose bound to contain surrounding context. Weaklyrelated one is recovered from the image other than object for global context. First, strongly and weakly-related context are constructed from input images. Second, we make cascade transformations for more intrinsical object information, which depends on the consistency between generated global context and input images in the regions other than object. Finally, a joint representation is acquired based on these three level features. The experiments on two benchmark datasets prove the effectiveness of TriCoIR. © Springer International Publishing AG 2016.

关键词： Image representation

来源：评论

学校读者我要写书评

暂无评论

Differentially private density estimation via Gaussian mixtures model

Differentially private density estimation via Gaussian mixtu...

引用

International Workshop on Quality of Service

作者： Yuncheng Wu Yao Wu Hui Peng Juru Zeng Hong Chen Cuiping Li Renmin University of China Beijing P.R. China Ministry of Education Key Laboratory of Data Engineering and Knowledge Engineering

ISBN: (纸本)9781509026357

Density estimation can construct an estimate of the probability density function from the observed data. However, such a function may compromise the privacy of individuals. A notable paradigm for offering strong privacy guarantees in data analysis is differential privacy. In this paper, we propose DPGMM, a parametric density estimation algorithm using Gaussian mixtures model (GMM) under differential privacy. GMM is a well-known model that could approximate any distribution and can be solved via Expectation-Maximization (EM) algorithm. The main idea of DPGMM is to add two extra steps after getting the estimated parameters in the M step of each iteration. The first step is the noise adding step, which injects calibrated noise to the estimated parameters according to their L 1 -sensitivities and privacy budgets. The second step is the post-processing step, which post-processes those noisy parameters that might break their intrinsic characteristics. Extensive experiments using both real and synthetic datasets evaluate the performance of DPGMM, and demonstrate that the proposed method outperforms a state-of-art approach.

关键词： Privacy Gaussian distribution Estimation data privacy Covariance matrices Noise measurement data analysis

来源：评论

学校读者我要写书评

暂无评论

Search Result Diversification Based on Query Facets

引用

Journal of Computer Science & Technology 2015年第4期30卷 888-901页

作者：胡莎窦志成王晓捷文继荣 School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China

In search engines, different users may search for different information by issuing the same query. To satisfy more users with limited search results, search result diversification re-ranks the results to cover as many user intents as possible. Most existing intent-aware diversification algorithms recognize user intents as subtopics, each of which is usually a word, a phrase, or a piece of description. In this paper, we leverage query facets to understand user intents in diversification, where each facet contains a group of words or phrases that explain an underlying intent of a query. We generate subtopics based on query facets and propose faceted diversification approaches. Experimental results on the public TREC 2009 dataset show that our faceted approaches outperform state-of-the-art diversification models.

关键词： query intent query facet search result diversification

来源：评论

学校读者我要写书评

暂无评论

Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exploration

Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exp...

引用

IEEE International Conference on data engineering

作者： Yu Sun Rui Zhang Andy Yuan Xue Jianzhong Qi Xiaoyong Du Department of Computing and Information Systems University of Melbourne Renmin University of China and Key Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)9781509020218

We study the problem of constructing a reverse nearest neighbor (RNN) heat map by finding the RNN set of every point in a two-dimensional space. Based on the RNN set of a point, we obtain a quantitative influence (i.e., heat) for the point. The heat map provides a global view on the influence distribution in the space, and hence supports exploratory analyses in many applications such as marketing and resource management. To construct such a heat map, we first reduce it to a problem called Region Coloring (RC), which divides the space into disjoint regions within which all the points have the same RNN set. We then propose a novel algorithm named CREST that efficiently solves the RC problem by labeling each region with the heat value of its containing points. In CREST, we propose innovative techniques to avoid processing expensive RNN queries and greatly reduce the number of region labeling operations. We perform detailed analyses on the complexity of CREST and lower bounds of the RC problem, and prove that CREST is asymptotically optimal in the worst case. Extensive experiments with both real and synthetic data sets demonstrate that CREST outperforms alternative algorithms by several orders of magnitude.

关键词： Heating Radio frequency Indexes

来源：评论

学校读者我要写书评

暂无评论

Biogeography-based optimization for cluster analysis

Biogeography-based optimization for cluster analysis

引用

International Conference on Computer, Communication and Computational Sciences, ICCCCS 2016

作者： Wu, Xueyan Wang, Hainan Chen, Zhimin Lu, Zhihai Phillips, Preetha Wang, Shuihua Zhang, Yudong School of Computer Science and Technology Nanjing Normal University NanjingJiangsu210023 China Key Laboratory of Statistical Information Technology & Data Mining State Statistics Bureau ChengduSichuan610225 China School of Computer and Information Engineering Henan Normal University XinxiangHenan453000 China School of Electronic Information Shanghai Dianji University Shanghai200240 China Key Laboratory of Symbolic Computation & Knowledge Engineering of Ministry of Education Jilin University ChangchunJilin130012 China Guangxi Key Laboratory of Manufacturing System & Advanced Manufacturing Technology GuilinGuangxi541004 China School of Natural Sciences and Mathematics Shepherd University ShepherdstownWV25443 United States West Virginia School of Osteopathic Medicine 400 N Lee St LewisburgWV24901 United States Department of Electrical Engineering The City College of New York CUNY New YorkNY10031 United States State Key Lab of CAD & CG Zhejiang University HangzhouZhejiang310027 China Manchester Metropolitan University ManchesterM156BH United Kingdom

ISBN: (纸本)9789811037696

With the aim of resolving the issue of cluster analysis more precisely and validly, a new approach was proposed based on biogeography-based optimization (abbreviated as BBO) algorithm. (Method) First, we reformulated the problem with an optimization model based on the variance ratio criterion (VARAC). Then, BBO was presented to search the optimal solution of the VARAC. There are 400 data of four groups in the experimental dataset, which have the degrees of overlapping of three distinct scales. The first one is nonoverlapping, the second one is partial overlapping, and the last is severely overlapping. BBO algorithm was compared with three different state-of-the-art approaches. We ran every algorithm 20 times. In this experiment, our results demonstrate the maximum VARAC values that can be found by BBO. The conclusion is that BBO is predominant which is extremely quick for the issue of clustering analysis. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Laplacian SVM for Learning from Label Proportions

Laplacian SVM for Learning from Label Proportions

引用

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Limeng Cui Zhensong Chen Fan Meng Yong Shi School of Computer and Control Engineering UCAS School of Economics and Management UCAS Key Laboratory on Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9781509059119

Proportion-SVM has been deeply studied due to its broad application prospects, such as modeling voting behaviors and spam filtering. However, the geometric information has been widely ignored. Thus, current methods usually show sensitivity to noises. To address these problems, in this paper, we combine the proportion learning framework with Laplacian term. We exploit the advantages of Laplacian term. Extensive experiments show the effectiveness of our method.

关键词： Support vector machines Laplace equations Kernel Training Optimization data models data mining

来源：评论

学校读者我要写书评

暂无评论

Formalizing UML Model Metrics Using Z Language

Formalizing UML Model Metrics Using Z Language

引用

作者： Fangjun Wu School of Information Technology Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics

Till now, a large variety of researchers have carried out lots of efforts on object-oriented and UML model metrics from different views. They put forward numerous of metrics and carried out some series of theoretical and experimental verifications on understandability, analyzability, maintainability, fault-proneness, change-proneness and reuse. However, there is no formal semantic specification for UML model metrics, which may lead to potential semantic inconsistency and ambiguity. To solve this problem, this paper provided formalization for UML model metrics at the level of UML Meta models. This formalization can not only help people to understand the meaning of UML model metrics, but also can be used in the application domain of UML model metrics in a more rigorous way.

关键词： software measurement object-oriented UML class diagrams Z language empirical validation theoretical verification

来源：评论

学校读者我要写书评

暂无评论

Random analysis of statistical rough set

Random analysis of statistical rough set

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Eric C. C. Tsang Su-Yun Zhao Faculty of Information Technology Macau University of Science and Technology Macau China MOE Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Beijing China

ISBN: (纸本)9781509003914

Attribute reduction is an inevitable problem in machine learning and statistical learning. To improve the traditional rough set reduction, statistical rough sets is then proposed by introducing random sampling into the rough approximation. Random sampling is the main contribution of statistical rough sets. As a result, it is necessary to analyze the randomness of statistical rough sets. In this paper, we analyze and demonstrate the influence of the randomness in the process of attribute reduction by a large number of experiments to test the effectiveness and stability of the random sampling.

关键词： Rough sets Standards Cybernetics Fluctuations Stability analysis Big data Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：