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

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Mo, Shangfeng Chen, Hong Zhang, Xiaoying Li, Cuiping 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: (纸本)9783642385612

Wireless Sensor Networks (WSNs) can be viewed as a new type of distributed databases. data management technology is one of the core technologies of WSNs. In this demo we show a Query Processing system based on TinyOS in WSNs, which is called TinyQP. TinyQP provides the in-network processing of several complex queries including real time query, historical query, event detection, aggregate query, top-k query, etc. TinyQP displays the network topology in a graphical way. TinyQP allows the user to remotely execute query commands and browse query result. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

ParaCube: A scalable OLAP model based on distributed aggregate computing with sibling cubes

ParaCube: A scalable OLAP model based on distributed aggrega...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Zhang, Yansong Wang, Shan Huang, Wei Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Department of Computer Harbin Financial College Harbin Helongjiang 150030 China

ISBN: (纸本)9780769540122

The requirements of OLAP applications increase rapidly by dramatically increased data volume, users, query volume and query complexity. The requirement for shortening update period in data warehouse is another crucial factor for a scalable OLAP application. In this paper, we propose a scalable OLAP prototype to support the query processing with increasing data volume by distributing the whole fact tuples to multiple servers to construct a set of sibling cubes which can be merged together to obtain the whole cube. We employ a light weight distribution policy with fully duplicated dimension tables in each sibling server on the observation of very low proportion of space cost for dimension tables. OLAP query with distributed aggregate functions can be transformed into queries to be performed parallel in sibling servers. For non-distributed computing aggregate functions, such as median, the optimized median aggregate computing algorithm is proposed to reduce transmission volume between servers while computing the global median values. We also present a three-level framework in data warehouse to meet the requirement of shorter update period in "operational business intelligence". An asynchronous tunnel model is proposed to reduce update latency by pre-fetching updated tuples to OLAP processing server. Finally, we set up prototype system ParaCube to evaluate performance in SN (shared-nothing) system and multi-core platforms. © 2010 IEEE.

关键词： data warehouses

来源：评论

学校读者我要写书评

暂无评论

A Multiple-Blockchains based Service Monitoring Framework in Edge-Cloud Computing 23

A Multiple-Blockchains based Service Monitoring Framework in...

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

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

ISBN: (纸本)9781665494571

In the edge-cloud computing, the applications usually are delivered as services, each of which runs independently and can cooperate to construct the complicated applications. However, it is difficult to monitor the services in the decentralized edge-cloud environment since there usually does not exist the central authorization to guarantee trustiness of the service quality data collected. To address the trust issue, the blockchain techniques have been introduced to the service monitoring. Considering the services usually are distributed on the edge nodes, if we deploy only a blockchain on the edge nodes near to the services, it may have to support both the service registration and monitoring because of the loose-coupling principle. That would influence the performance, even would crash the edge nodes. In this paper, we propose a multiple-blockchains based framework, including a registration blockchain that focuses on the service registration and discovery, and a set of monitoring blockchains that focus on the service invocation and monitoring. The registration blockchain is deployed on the cloud nodes, and the monitoring blockchains are deployed on the edge nodes near to the services for collecting efficiently and precisely the service quality data. Based on the cross-chain technology, we design a cross-chain service discovery between the monitoring blockchain and the registration blockchain for finding the services the requesters need. Finally, we implement the registration and monitoring blockchains based on the blockchain platform Cosmos and conduct a set of experiments to show the effectiveness of the proposed framework. © 2021 IEEE.

关键词： Authorization Cloud computing Smart cities Computer crashes Blockchains Monitoring

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards comprehensive integration management of business continuity, records and knowledge

Towards comprehensive integration management of business con...

引用

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

DGA-Net: Dynamic Gaussian Attention Network for Sentence Semantic Matching 1st

DGA-Net: Dynamic Gaussian Attention Network for Sentence Se...

引用

1st CAAI International Conference on Artificial Intelligence, CICAI 2021

作者： Zhang, Kun Lv, Guangyi Wang, Meng Chen, Enhong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9783030930486

Sentence semantic matching requires an agent to determine the semantic relation between two sentences, where much recent progress has been made by advancement of representation learning techniques and inspiration of human behaviors. Among all these methods, attention mechanism plays an essential role by selecting important parts effectively. However, current attention methods either focus on all the important parts in a static way or only select one important part at one attention step dynamically, which leaves a large space for further improvement. To this end, in this paper, we design a novel Dynamic Gaussian Attention Network (DGA-Net) to combine the advantages of current static and dynamic attention methods. More specifically, we first leverage pre-trained language model to encode the input sentences and construct semantic representations from a global perspective. Then, we develop a Dynamic Gaussian Attention (DGA) to dynamically capture the important parts and corresponding local contexts from a detailed perspective. Finally, we combine the global information and detailed local information together to decide the semantic relation of sentences comprehensively and precisely. Extensive experiments on two popular sentence semantic matching tasks demonstrate that our proposed DGA-Net is effective in improving the ability of attention mechanism. © 2021, Springer Nature Switzerland AG.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Terminal Ranking for Sparsification of Interference Coordination Parameters in Ultra-Dense Networks 10th

Graph-Based Terminal Ranking for Sparsification of Interfere...

引用

10th EAI International Conference on Mobile Networks and Management, MONAMI 2020

作者： Gou, Junxiang Wang, Lusheng Lin, Hai Peng, Min Ministry of Education School of Computer Science and Information Engineering Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei230601 China Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan University Wuhan430072 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei230601 China

ISBN: (纸本)9783030640019

In the future mobile communication system, inter-cell interference becomes a serious problem due to the intensive deployment of cells and terminals. Traditional interference coordination schemes take long time for optimization in ultra-dense networks. Meanwhile, due to the increase of factors affecting communication and in order to better meet the communication needs of each terminal, an interference coordination scheme needs to fully consider multiple characteristic parameters of the terminal, which will further increase the scheme’s computational time. Therefore, we should compress all the data through sparsification of parameters before optimization. There are many terminal parameters, and the essence of sparsification of parameters is to rank terminals. In this paper, a graph-based terminal ranking scheme is designed. First, each terminal can be represented by its multiple parameters. Then, all terminals are used as the vertexes in the graph to form a complete weighted graph, and edge weights represent the degree of dissimilarity between terminals. A ranking of terminals is obtained by finding a minimum Hamiltonian path in the graph. Finally, the ranking of all parameter sequences is obtained according to terminals ranking, which makes the sparsity of all parameter sequences better. Simulation results show that the proposed scheme can accomplish sparsification of parameter sequences effectively, especially when the number of sequences increases. In addition, compared with the optimal coordination of traditional scheme, this scheme improves the fairness of the system while ensuring high system capacity, and dramatically reduces the computational time of interference coordination. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering 2020.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An approximate sequential pattern mining approach over data stream based on Levenshtein-Automata

引用

Journal of Computational Information Systems 2007年第5期3卷 2025-2030页

作者： Li, Haifeng Chen, Hong School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering China

Sequential pattern mining is an important method in data mining. Traditional mining algorithms are not adapted to the fast, unlimited, continuous and dynamic data stream because they are multiple pass in scanning database. Some approximate sequential pattern mining algorithms are proposed recently which cost too many system resources in sequence compare process. A sequential compare method based on Levenshtein-Automata is proposed in this paper. This method build state conversion model with pretreatment which can finish computing the sequences' similarity in linear time. A combination of Levenshtein-Automata computation and common computation of edit distance is presented in allusion to the Levenshtein-Automata's problem of using too much memory, so a tradeoff between time cost and space cost is implemented. The experiment result shows this method is effective and efficient.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：