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

18th Pacific Asia Conference on Information Systems, PACIS 2014

作者： Wang, Changyu Zuo, Meiyun Quan, Xuefei Key Laboratory of Data Engineering and Knowledge Engineering School of Business Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China

The aging of population has become a global trend and the critical knowledge of enterprises may be lost with the retirement of senior employees. Task-based cooperation is an important method to prevent the loss of knowledge and to promote the knowledge sharing behavior between senior employees and young ones. This paper constructs the knowledge contribution payoff functions of senior employees and young ones in the context of task-based cooperation and analyzes the knowledge contribution behavior using static game theory with complete information, and then we obtain Nash equilibrium solutions under different conditions. The results suggest that enterprises can promote knowledge contribution of senior employees and young ones in the process of task-based cooperation by improving social rate of return(e.g., creating a good cultural atmosphere), reducing cost rate of knowledge contribution (e.g., training on knowledge expression), raising economic rate of return and providing monetary compensation according to the contribution of knowledge, whether the marginal payoff of employees' knowledge contribution is increasing, invariant or diminishing. Since the formation of social return is difficult in the short term, giving economic incentives can be an effective way at the beginning. With the progress of task-based cooperation between senior employees and young ones, the amount of employees' knowledge (especially of young ones'), the productivity of knowledge contribution, the collaborative efficiency and social rate of return will increase and therefore economic incentives contributing to cooperation between both players may decrease appropriately. The findings of this paper are beneficial to understand knowledge sharing behavior in the context of task-based cooperation, and provide several incentive mechanisms for enterprises to promote knowledge sharing between senior employees and young ones.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

A Secure Collusion-Aware and Probability-Aware Range Query Processing in Tiered Sensor Networks

A Secure Collusion-Aware and Probability-Aware Range Query P...

引用

Reliable Distributed Systems

作者： Lei Dong Xuan Chen Jianxiang Zhu Hong Chen Ke Wang Cuiping Li Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing China School of Information Renmin University of China Beijing China School of Computing Science Simon Fraser University Burnaby BC Canada Key Lab. of Data Eng. & Knowledge Eng. of Minist. of Educ. Beijing China

With high expansibility and efficient power usage, tiered wireless sensor networks are widely deployed in many fields as an important part of Internet of Things (IoTs). It is challenging to process range query while protecting sensitive data from adversaries. Moreover, most existing work focuses on privacy-preserving range query neglecting collusion attacks and probability attacks, which are more threatening to network security. In this paper, we first propose a secure range query protocol called secRQ, which not only protects data privacy, but also resists collusion attacks and probability attacks in tiered wireless sensor networks. Generalized inverse matrices and distance-based range query mechanism are used to guarantee security as well as high efficiency and accuracy. Besides, we propose the mutual verification scheme to verify the integrity of query results. Finally, both theoretical analysis and experimental results confirm the security, efficiency and accuracy of secRQ.

关键词： Wireless sensor networks Protocols data privacy Biomedical monitoring Query processing Monitoring Heart rate

来源：评论

学校读者我要写书评

暂无评论

A Part-of-speech Tagging Model Employing Word Clustering and Syntactic Parsing

引用

Chinese Journal of Electronics 2014年第1期23卷 109-114页

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

Part-Of-Speech tagging is a basic task in the field of natural language processing. This paper builds a POS tagger based on improved Hidden Markov model,by employing word clustering and syntactic parsing ***, In order to overcome the defects of the classical HMM, Markov family model(MFM), a new statistical model was introduced. Secondly, to solve the problem of data sparseness, we propose a bottom-to-up hierarchical word clustering algorithm. Then we combine syntactic parsing with part-of-speech tagging. The Part-ofSpeech tagging experiments show that the improved PartOf-Speech tagging model has higher performance than Hidden Markov models(HMMs) under the same testing conditions, the precision is enhanced from 94.642% to97.235%.

关键词： Part-of-speech tagging Hidden Markov model Markov family model Word clustering

来源：评论

学校读者我要写书评

暂无评论

Research on the Design of Food Safety Supervision Information System in Beijing

Research on the Design of Food Safety Supervision Informatio...

引用

2015 5th International Conference on Computer Sciences and Automation engineering(ICCSAE 2015)

作者： Jiaji Yu Li Wang Xiaoyi Wang Jiping Xu Huiyan Zhang Jiabin Yu Beijing Key Laboratory of Big Data Technology for Food Safety School of Computer and Informat ion Engineering Beijing Technology and Business University

Currently, there are still many problems in food safety supervision of Beijing, more than 80% of the foods are depending on the outer supply which has increased difficulty in the effective control from the source of food safety. The planning levels of food safety management are still in need, the food safety risk evaluation and warning are scarcely used. With the development of the investment to the outer supply base, the food safety supervision mechanism should be perfected while the food input risk should be controlled. This paper build the food safety supervision information system in Beijing by using the HACCP theory based on the intelligent information processing technology and the food safety data platform, in order to improve the management level and efficiency, and then to realize the overall monitoring of food safety through the all-process supervision of the outer supply and food circulation.

关键词： food safety input risk data platform supervision information HACCP

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-aware breach-free barrier construction with VANET nodes for realtime fugitive search

Bandwidth-aware breach-free barrier construction with VANET ...

引用

MILCOM, Military Communications Conference

作者： Donghyun Kim Junggab Son Wei Wang Deying Li Alade O. Tokuta Sunghyun Cho North Carolina Central University Durham NC US North Carolina Central University Durham USA School of Mathematics and Statistics Xi'an Jiaotong University Xi'an China Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University) Renmin University of China P.R. China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China China Hanyang University South Korea

ISBN: (纸本)9781509000746

In this paper, we introduce a new strategy of using VANET nodes with visual sensors and wireless transceivers to build an instant camera barrier for a given mission period. Given a set of properly equipped VANET nodes whose drivers voluntarily join the protocol by exposing their future travel plans and use onboard equipment to transmit realtime video to the authority, we aim to maintain the barrier of VANET nodes during a given mission period. Under the constraints that the mobility of each VANET node is not controllable and the size of barrier, i.e. the number of concurrent participants, cannot exceed a given number due to the network system capacity limit, we propose a polynomial time algorithm for the problem. To the best of our knowledge, this is the first work to consider the construction of camera barriers in pure mobile camera sensor network.

关键词： Sensors Vehicular ad hoc networks Cameras Wireless sensor networks Mobile communication Visualization Vehicles

来源：评论

学校读者我要写书评

暂无评论

Market Value of Innovation: An Empirical Analysis on China's Stock Market

引用

Procedia Computer Science 2015年 55卷 1275-1284页

作者： Meng Xiangying Zhang Yueyan Wei Xianhua School of Management University of Chinese Academy Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Science The State Key Laboratory of Automotive Safety and Energy Tsinghua University Department of Automotive Engineering Tsinghua University Beijing 100084 China

Studies on market value of innovation investment have been based on US and European database. However, few re-searchers investigate Chinese stock market about the market value of firm's expected R&D performance. In this paper, we use constructed panel dataset from three representative stock markets in China: Main Board Market, Small and Media-sized Enterprise Board Market and Growth Enterprise Market and then use intangible assets increment as innovation indicator to examine the innovation investment-firm performance association in both manufacturing and service industries by a dataset over an 11-year period covering 1455 firms to evaluate the differences in their relative contribution to market performance. By comparing the results of these three stock markets, we find out the effect of R&D investment and increasing R&D input to market value is insignificant in all three stock markets, resulting from the weak protection for minority investors and loose regulation of information disclosure. Different constructions of intangible assets of listed firms on MBM and GEM account for market's relatively low efficiency to reflect real value of R&D investment. On industry-level, we conclude that R&D investment in both service and manufacturing sector contributes positively to market performance of firms and R&D investment in service industry shows stronger and more significant linkage to market value than manufacturing industry.

关键词： Market value Innovation R&D China's stock market

来源：评论

学校读者我要写书评

暂无评论

Which One Is Better, Simple or Complex Metrics?

引用

Journal of Computer and Communications 2015年第11期3卷 52-57页

作者： Fangjun Wu School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China High Level Engineering Research Center of Electronic-Commerce Jiangxi Provincial Colleges and Universities Nanchang China

At the early stage of software lifecycle, the complexity measurement of UML class diagrams plays an important role in software development, testing and maintenance, and provides guidance for developing high quality software. In order to study which one is better, simple or complex metrics, this paper analyzes and compares four typical metrics of UML class diagrams from experimental software engineering view points. Understandability, analyzability and maintainability were classified and predicted for 27 class diagrams related to a banking system by means of algorithm C5.0 within the famous toolkit Weka. Results suggest that the performance of simple metrics is not inferior to that of complex metrics, in some cases even better than that of complex metrics.

关键词： Software Measurement UML Class Diagram Empirical Validation Classification

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition

A better constant approximation for minimum 3-connected m-do...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Wei Wang Bei Liu Donghyun Kim Deying Li Jingyi Wang Yaolin Jiang School of Mathematics and Statistics Xi'an Jiaotong University Xi'an China Department of Mathematics and Physics North Carolina Central University Durham USA Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University) Renmin University of China Beijing P.R. China

Over years, virtual backbone has attracted lots of attentions as a promising approach to deal with the broadcasting storm problem in wireless networks. One popular way to construct a quality virtual backbone is to solve the minimum connected dominating set problem. However, a virtual backbone computed in this way is not resilient against topology change since the induced graph by the connected dominating set is one-vertex-connected. As a result, the minimum k-connected m-dominating set problem is introduced to construct a fault-tolerant virtual backbone. Currently, the best known approximation algorithm for the problem in unit disk graph assumes k ≤ 3 and m ≥ 1 and its performance ratio is 280 when k = m = 3. In this paper, we use a classical result from graph theory, Tutte decomposition, to design a new approximation algorithm for the problem in unit disk graph for k ≤ 3 and m ≥ 3. In particular, the algorithm features with much simpler structure and much smaller performance ratio, e.g. nearly 66 when k = m = 3. We also conduct simulation to evaluate the performance of our algorithm.

关键词： Particle separators Approximation algorithms Algorithm design and analysis Approximation methods Wireless networks Conferences Computers

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation via Improving Clustering Algorithms with Density and Distance

引用

Procedia Computer Science 2015年 55卷 1015-1022页

作者： Zhensong Chen Zhiquan Qi Fan Meng Limeng Cui Yong Shi School of Management University of Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management CAS Beijing 100190 China Sino-Danish Center for Education and Research Beijing 100190 China Research Center on Fictitious Economy and Data Science CAS Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 100190 China

Image segmentation problem is a fundamental task and process in computer vision and image processing applications. It is well known that the performance of image segmentation is mainly influenced by two factors: the segmentation approaches and the feature presentation. As for image segmentation methods, clustering algorithm is one of the most popular approaches. However, most current clustering-based segmentation methods exist some problems, such as the number of regions of image have to be given prior, the different initial cluster centers will produce different segmentation results and so on. In this paper, we present a novel image segmentation approach based on DP clustering algorithm. Compared with the current methods, our method has several improved advantages as follows: 1) This algorithm could directly give the cluster number of the image based on the decision graph; 2) The cluster centers could be identified correctly; 3) We could simply achieve the hierarchical segmentation according to the applications requirement. A lot of experiments demonstrate the validity of this novel segmentation algorithm.

关键词： Image Segmentation Clustering Algorithm Feature Representation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：