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

作者： An, Xiaomi Wang, Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing 100872 China School of Information Resource Management Renmin University of China Beijing 100872 China

ISBN: (纸本)9788988678251

Many of management systems for business continuity, records and knowledge (BRK) are standalone. Connections and networks of business continuity management systems (BCMS), records management systems (RMS) and knowledge management systems (KMS) are expected to study for facing challenges from evidence-based collaborations in a networked working environment, in terms of control of documented information for business efficiency;guarantee of evidentiality and quality of documented information for organizational effectiveness;and sharing, protecting and increasing values of records as business and knowledge assets for knowledge economy. Based on review of ideas of integration management thinking, best practice frameworks of business continuity management, records management and knowledge management, management models of BCMS, RMS and KMS, an architecture framework towards comprehensive integration management of BRK is proposed by vertical integration design and crosswise integration operations. Case studies demonstrate that such architecture framework has implications to enhance controls of efficiency, effectiveness, and economy of organizational resources and assets adaptable to complex global competition;to improve quality assurance of documented information for supporting evidence-based governance adaptable to dynamic changing of information and communication technologies;to consistent accumulation, sharing and exchanging evidence, memory and knowledge along e-business processes to promote collaboration, optimization and innovation of BCMS, RMS and KMS.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

Marginal Value-Based Edge Resource Pricing and Allocation for Deadline-Sensitive Tasks 42

Marginal Value-Based Edge Resource Pricing and Allocation fo...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Wang, Puwei Sun, Zhouxing Zhan, Ying Li, Haoran Du, Xiaoyong Renmin University of China School of Information China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing100872 China Guizhou University of Finance and Economics Guiyang City550025 China

ISBN: (纸本)9798350334142

In edge computing (EC), resource allocation is to allocate computing, storage and networking resources on the edge nodes (ENs) efficiently and reasonably to tasks generated by users. Due to the resource-limitation of ENs, the tasks often need to compete for the resources. Pricing mechanisms are widely used to deal with the resource allocation problem, and the valuations of tasks play a critical role in the price mechanisms. However, users naturally are not willing to expose the valuations of their tasks due to conflicts of interests. Current research works usually adopt truthful auctions to motivate the users to report honestly the valuations of their tasks. In this paper, we introduce the marginal value to estimate the valuations of tasks, and propose a marginal value-based pricing mechanism using the incentive theory, which motivates the tasks with higher marginal values to actively request more resources. The EC platform sets the resource prices using the price mechanism, and then the users determine their resource requests relying on the resource prices and the valuations of their tasks. After receiving the deadline-sensitive tasks from the users, the resource allocation can be modeled as a knapsack problem with the deadline constraints. Extensive experimental results demonstrate that our approach is computationally efficient and is promising in enhancing the utility of the EC platform and the tasks. © 2023 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

引用

18th International World Wide Web Conference, WWW 2009

作者： Markines, Benjamin Benz, Dominik Cattuto, Ciro Hotho, Andreas Menczer, Filippo Stumme, Gerd School of Informatics Indiana University Bloomington IN United States Complex Networks Lagrange Laboratory Institute for Scientific Interchange Foundation Torino Italy Knowledge and Data Engineering Group University of Kassel Germany

ISBN: (纸本)9781605584874

Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focuson similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We find that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable;per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity. Copyright is held by the International World Wide Web Conference Committee (IW3C2).

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Topology-based data compression in wireless sensor networks

Topology-based data compression in wireless sensor networks

引用

13th International Conference on Web-Age Information Management, WAIM 2012

作者： Mo, Shangfeng Chen, Hong Li, Yinglong Key Laboratory of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Hunan University of Science and Technology Xiangtan 411201 China

ISBN: (纸本)9783642322808

In this paper, we address the problem of data Compression which is critical in wireless sensor networks. We proposed a novel Topology-based data Compression (TDC) algorithm for wireless sensor networks. We utilize the topological structure of routing tree to reduce the transmission of message packets. We analyzed the differences and relations between our algorithm and other compression algorithms. Extensive experiments are conducted to evaluate the performance of the proposed TDC approach by using two kinds of data sets: real data set and synthetic data set. The results show that the TDC algorithm substantially outperforms Non-compression algorithm in terms of packets transmitted. © 2012 Springer-Verlag.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient approximate skyline computation in sensor networks

引用

Journal of Computational Information Systems 2007年第5期3卷 1821-1826页

作者： Xie, Tingting Lai, Yongxuan Chen, Hong School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering China

The skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset It is one of the most important query methods for database, datastream, P2P networks. However, it has not been implemented in sensor networks due to limited energy of the sensor nodes. This paper presents an energy-efficient approximate skyline query scheme for sensor networks. According to the experiments, this scheme can greatly improve the lifetime of sensor networks compared to the naive skyline query.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Automatic extraction of foreground objects from Mars images

引用

Geo-Spatial Information Science 2012年第1期15卷 17-25页

作者： WANG Shuliang LIU Chang WU Shangru NIE Qianqian WANG Yongtao ZENG Shi ZHU Haifeng International School of Software Wuhan University129 Luoyu RoadWuhan 430079China Key Laboratory of Data Mining and Knowledge Engineering Inner Mongolia Autonomous RegionInner Mongolia UniversityHohhot 010021China Department of Geography East Michigan UniversityYpsilantiMI 48197USA

A novel method is proposed to automatically extract foreground objects from Martian surface *** characteristics of Mars images are distinct,*** illumination,low contrast between foreground and background,much noise in the background,and foreground objects with irregular *** the context of these characteristics,an image is divided into foreground objects and background *** filtering is first applied to rectify ***,wavelet transformation enhances contrast and denoises the ***,edge detection and active contour are combined to extract contours regardless of the shape of the *** results show that the method can extract foreground objects from Mars images automatically and accurately,and has many potential applications.

关键词： automatic object extraction Mars images homomorphic filtering wavelet transformation active contour edge detection

来源：评论

学校读者我要写书评

暂无评论

A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem

引用

Neural Computing and Applications 2024年第22期36卷 13833-13852页

作者： Li, Ruizhi He, Jintao Lin, Cuisong Liu, Ying Hu, Shuli Yin, Minghao Jilin University of Finance and Economics Changchun130117 China Northeast Normal University Changchun130117 China Business Big Data Research Center of Jilin Province Changchun130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

The minimum weakly connected dominating set problem is a typical NP-hard problem with a wide range of applications. To solve this problem, we propose a frequency property and two-hop configuration checking strategy-driven local search algorithm (FCC2LS). In this algorithm, we first propose a lock-vertex-based initial solution construction procedure. This procedure guarantees that certain vertices, which must be included in the optimal solution, are added to the solution. Second, we propose a two-hop configuration checking strategy and a frequency property. The two-hop configuration checking strategy is a new variant of the original configuration checking strategy, which prohibits vertices with unchanged configuration from being added to the candidate solution. The frequency property is used to record the number of times for each vertex is added to the solution, which can increase the diversity of selected vertices. Third, we combine two scoring functions, Dscore and Nscore, with the above strategies and propose effective vertex selection methods to help the algorithm select suitable vertices to add into or remove from the candidate solutions. Finally, we evaluate the proposed algorithm FCC2LS with four state-of-the-art algorithms on four groups of benchmark instances. Experimental results show that our algorithm performs better on four classical benchmark instances. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Research on access control decision model of Internet of Things based on attribute exploration

Research on access control decision model of Internet of Thi...

引用

2021 International Conference on Signal Processing and Communication Technology, SPCT 2021

作者： Shen, XiaJiong Zhang, Peng Zhang, YanFeng Henan Key Laboratory of Big Data Analysis and Processing Henan Univ. HA Kaifeng475004 China School of Computer and Information Engineering Henan Univ. HA Kaifeng475004 China Institute of Data and Knowledge Engineering Henan Univ. HA Kaifeng475004 China

ISBN: (数字)9781510653344

ISBN: (纸本)9781510653337

With the rapid development of the Internet of things, the problem of access control has become increasingly prominent. In order to solve the problems of high redundancy and low integrity caused by the traditional Role-Based Access Control model, this paper proposes an access control model of Internet of things based on attribute exploration. Firstly, the decision model is established based on attribute exploration algorithm, and finally merged into a complete decision model. The model has the function of dynamically modifying access rights in the process of building decision model. It is a new exploration in the field of access control model. © 2022 SPIE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Social Group Query Based on Multi-Fuzzy-Constrained Strong Simulation

引用

ACM Transactions on knowledge Discovery from data 2021年第3期16卷 1–27页

作者： Guliu Liu Lei Li Guanfeng Liu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education and Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province (Hefei University of Technology) and Hefei University of Technology Macquarie University NSW Australia Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education and Mininglamp Academy of Sciences Mininglamp Technology

Traditional social group analysis mostly uses interaction models, event models, or other social network analysis methods to identify and distinguish groups. This type of method can divide social participants into different groups based on their geographic location, social relationships, and/or related events. However, in some applications, it is necessary to make more specific restrictions on the members and the interactions between members of the group. Generally, Graph Pattern Matching (GPM) technique is used to solve this problem. However, the existing GPM methods rarely consider the rich contextual information of nodes and edges to measure the credibility between members. In this article, first, a social group query problem that needs to consider the trust between members of the group is proposed. Then, to solve this problem, a multi-fuzzy-constrained strong simulation matching model is proposed based on multi-constrained simulation, and a Strong Simulation GPM algorithm (NTSS) based on the exploration of pattern Node Topological ordered sequence is proposed. Aiming at the inefficiency of the NTSS algorithm when pattern graph with multiple nodes with zero in-degree and the problem of repeated calculation of matching edges shared by multiple matching subgraphs, two optimization strategies are proposed. Finally, we conduct verification experiments on the effectiveness and efficiency of the NTSS algorithm and the algorithms with the optimization strategies on four social network datasets in real applications. Experimental results show that the NTSS algorithm is significantly better than the existing multi-constrained GPM algorithm, and the NTSS_Inv_EdgC algorithm, which combines two optimization strategies, greatly improves the efficiency of the NTSS algorithm.

关键词： Graph pattern matching contextual social network multi-fuzzy-constrained strong simulation social group query

来源：评论

学校读者我要写书评

暂无评论

Assisted Diagnostic Learning Based on Concept Lattice

Assisted Diagnostic Learning Based on Concept Lattice

引用

2021 International Conference on Signal Processing and Communication Technology, SPCT 2021

作者： Shen, Xiajiong Li, Xingchen Han, Daojun Zhang, Yanfeng Henan Key Laboratory of Big Data Analysis and Processing Henan Univ. HA Kaifeng475004 China School of Computer and Information Engineering Henan Univ. HA Kaifeng475004 China Institute of Data and Knowledge Engineering Henan Univ. HA Kaifeng475004 China

ISBN: (数字)9781510653344

ISBN: (纸本)9781510653337

With the continuous development of education, online education is becoming more and more popular with learners because of its convenience. However, online education has the problem of insufficient interaction with students. Students still need to rely on the students themselves to judge the lack of knowledge in practice tasks, which will greatly affect the learning efficiency. In this paper, we propose a method based on formal concept analysis to analyze the knowledge that may not be mastered, and a method of intensive practice for students. First of all, establishing the formal context of student error test questions, construct the concept lattice to calculate the degree of importance of the knowledge concept that may not be mastered, judge the student's mastery of the knowledge concept, and give feedback. Secondly, construct the concept lattice of the unpractised test set, and calculate the similarity of the concept extension set that meets the threshold, find similar topics and push them, and realize targeted training for students who have not mastered the knowledge concepts. © 2022 SPIE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：