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

作者： Yang, Menghui Liu, Hua Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Resources Management Renmin University of China Beijing 100872 China

In an effort to provide lawful interception for session initiation protocol (SIP) voice over Internet protocol (VoIP), an interception architecture using session border controller (SBC) is proposed. Moreover, a prototype based on the proposed architecture is implemented. A testbed is set up and tests are carried out in order to analyze the performance and the capability of function entities and interfaces in the proposed architecture. Test results show that SBC interception capability in SIP signaling is superior to that in real-time transport protocol (RTP) media stream. In order to eliminate the possible bottleneck of RTP packets interception in SBC, an analytic model is proposed to investigate the mechanism in which RTP packet's traffics are shared among different SBC media functions. Analysis results show that multiple SBC media functions can share the RTP packets arrival and can significantly decrease RTP packets service time in SBC. Test results also show that delivery function, collect function and their interfaces in the proposed interception architecture have corresponding interception performance and capability with SBC. © 2013 Springer Science+Business Media New York.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Author Name Disambiguation Based on Rule and Graph Model 9th

Author Name Disambiguation Based on Rule and Graph Model

引用

9th CCF International Conference on Natural Language Processing and Chinese Computing, NLPCC 2020

作者： Zhang, Lizhi Ban, Zhijie Inner Mongilia A.R. Key Laboratory of Data Mining and Knowledge Engineering College of Computer Science Inner Mongolia University Huhhot China

ISBN: (纸本)9783030604493

Author name disambiguation has long been viewed as a challenging problem in scientific literature management, and with the substantial growth of the scientific literature, the solution to this problem has become increasingly difficult and urgency. In this paper, we conduct research on the author name disambiguation problem in large-scale academic papers. In our method, we combine the paper feature information and the relation information between the papers for disambiguation. Based on the Aminers disambiguation framework, we present a novel method to constructing the paper relation graph based on atomic cluster and propose an efficient post processing algorithm, aiming to improve the disambiguation performance by rule-based clustering, this algorithm utilizes similarity features based on metadata information and implement two types of disambiguation rules. We carefully evaluate the proposed disambiguation method on real-world large data and experimental result shows that our method achieves clearly better performance than the state-of-the-art methods. © 2020, Springer Nature Switzerland AG.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Electronic Medical Record Sharing System Based on Hyperledger Fabric and InterPlanetary File System 2021

Electronic Medical Record Sharing System Based on Hyperledge...

引用

5th International Conference on Compute and data Analysis, ICCDA 2021

作者： Li, Lei Yue, Zhengxiang Wu, Gongqing Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9781450389112

Electronic Medical Records (EMR) and other medical data contain important and sensitive privacy information of patients, which provide important basis and reference for their doctors to diagnose and treat them. With the continuous development of data sharing, big data applications and other technologies, new requirements are proposed for the storage of medical privacy data. At present, medical data have the characteristics of obstructed sharing and exchange, difficult data tracing and data sensitivity, which increases the cost and difficulty of each diagnosis. Moreover, patients lack the right to know and control their own medical data, which is easy to cause data fraud or data leakage. As a decentralized, tamper proof and traceable distributed ledger system, blockchain brings new solutions to these problems. This paper designs a medical data fusion and distributed privacy management system based on the Hyperledger Fabric blockchain development platform and InterPlanetary File System. It can not only solve the problem of mutual distrust in the traditional system, but also realize the safe data storage and the safe sharing of medical record data between medical organizations which is a beneficial attempt to overcome the disadvantages of traditional hospital data separation. At the same time, according to the requirements of different levels and types of medical users or groups for data security and personal privacy protection, the access control technology of users is studied to ensure personal privacy data. © 2021 ACM.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Recovering accurate labeling information from partially valid data for effective multi-label learning 29

Recovering accurate labeling information from partially vali...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Li, Ximing Wang, Yang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University China Key Laboratory of Knowledge Engineering With Big Data Ministry of Education Hefei University of Technology China School of Computer Sci and Information Engineering Hefei University of Technology China

ISBN: (纸本)9780999241165

Partial Multi-label Learning (PML) aims to induce the multi-label predictor from datasets with noisy supervision, where each training instance is associated with several candidate labels but only partially valid. To address the noisy issue, the existing PML methods basically recover the ground-truth labels by leveraging the ground-truth confidence of the candidate label, i.e., the likelihood of a candidate label being a ground-truth one. However, they neglect the information from non-candidate labels, which potentially contributes to the ground-truth label recovery. In this paper, we propose to recover the ground-truth labels, i.e., estimating the ground-truth confidences, from the label enrichment, composed of the relevance degrees of candidate labels and irrelevance degrees of non-candidate labels. Upon this observation, we further develop a novel two-stage PML method, namely Partial MultiLabel Learning with Label Enrichment-Recovery (PML3ER), where in the first stage, it estimates the label enrichment with unconstrained label propagation, then jointly learns the ground-truth confidence and multi-label predictor given the label enrichment. Experimental results validate that PML3ER outperforms the state-of-the-art PML methods. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Location selection for utility maximization with capacity constraints 12

Location selection for utility maximization with capacity co...

引用

21st ACM International Conference on Information and knowledge Management, CIKM 2012

作者： Sun, Yu Huang, Jin Chen, Yueguo Zhang, Rui Du, Xiaoyong School of Information Renmin University of China Beijing China University of Melbourne Melbourne VIC Australia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)9781450311564

Given a set of client locations, a set of facility locations where each facility has a service capacity, and the assumptions that: (i) a client seeks service from its nearest facility;(ii) a facility provides service to clients in the order of their proximity, we study the problem of selecting all possible locations such that setting up a new facility with a given capacity at these locations will maximize the number of served clients. This problem has wide applications in practice, such as setting up new distribution centers for online sales business and building additional base stations for mobile subscribers. We formulate the problem as location selection query for utility maximization. After applying three pruning rules to a baseline solution,we obtain an efficient algorithm to answer the query. Extensive experiments confirm the efficiency of our proposed algorithm. © 2012 ACM.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

A RFID mixed coding scheme based on huffman algorithm

A RFID mixed coding scheme based on huffman algorithm

引用

2011 International Conference on Management of e-Commerce and e-Government, ICMeCG 2011

作者： Jian, Jiang Guoqiong, Liao Hao, Wang Qizhi, Wan School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang Nanchang China

ISBN: (纸本)9780769545448

In RFID application systems with multiple packaging layers, labeling packaging relationship of objects in different packaging layers by encoding methods is a important technology field. Prefix-based labeling scheme is a method by which the packaging relationship of objects amounts to testing whether one object is an prefix of the other, whereas the region numbering scheme is a method by which an ancestor query amount to an interval containment test on the labels. This paper first presents a mixed-encoding scheme based on Huffman algorithm, then propose a variant of this encoding scheme in which new "virtual nodes" are involved in order to improve the stability of encoding. Our experiments prove that the mixed-based encoding scheme is effective due to the enhancement of update performance and query efficiency. © 2011 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Formal analysis of trusted computing: One case study

Formal analysis of trusted computing: One case study

引用

International Conference on Communications and Mobile Computing

作者： Zhou, HongWei Yuan, JinHui Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing China School of Information Renmin University of China Beijing China Institute of Electronic Technology Zhengzhou Information Engineering University of China Zhengzhou China

ISBN: (纸本)9780769543574

LS2 is the logic to reason about the property of trusted computing. However, it lacks the capability of modeling the isolation provided by virtualization which is often involved in previous trusted computing system. With the support of changed LS2, we model three types of isolation. Moreover, we formally analyze the integrity measurement property of Trust Visor proposed recently which provides the isolated execution environment for security-sensitive code. © 2011 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

B-IRP: An improving integrity report protocol for remote attestation

B-IRP: An improving integrity report protocol for remote att...

引用

International Conference on Communications and Mobile Computing

ISBN: (纸本)9780769543574

Trusted platform module (TPM) has little computation capability, and it is the performance bottleneck of remote attestation. In the scenario where the server is the attestation-busy entity which answers attestation requirement frequently, the massive delay is inevitable. Without the modification to TPM, we propose Batch Integrity Report Protocol (BIRP) to overcome the performance bottleneck. B-IRP bundles these requirements in interval as a batch requirement, and creates the response messages for these requirements with one expensive TPM operation. Discussion shows that B-IRP has improved the performance without loss of security. © 2011 IEEE.

关键词： Trusted computing

来源：评论

学校读者我要写书评

暂无评论

NUITS: A Novel User Interface for Efficient Keyword Search over databases

NUITS: A Novel User Interface for Efficient Keyword Search o...

引用

32nd International Conference on Very Large data Bases, VLDB 2006

作者： Wang, Shan Peng, Zhaohui Zhang, Jun Qin, Lu Wang, Sheng Yu, Jeffrey Xu Ding, Bolin School of Information Renmin Univ. of China Key Laboratory of Data Engineering and Knowledge Engineering MOE of China Beijing China Department of Systems Engineering and Engineering Management The Chinese Univ. of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)1595933859

The integration of database and information retrieval techniques provides users with a wide range of high quality services. We present a prototype system, called NUITS, for efficiently processing keyword queries on top of a relational database. Our NUITS allows users to issue simple keyword queries as well as advanced keyword queries with conditions. The efficiency of keyword query processing and the user-friendly result display will also be addressed in this paper. Copyright 2006 VLDB Endowment, ACM

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Multicomponent Similarity Graphs for Cross-Network Node Classification

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第3期5卷 1411-1424页

作者： Zhang, Yuhong Shi, Congmei Li, Xinzheng Zhang, Zan Hu, Xuegang School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230088 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei230009 China

Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution, i.e., most nodes in the network are tail nodes with sparse neighborhoods. The established methods focus on either the discrepancy cross network or the long tail in a single network. As for the cross-network node classification under long tail, the coexistence of sparsity of tail nodes and the discrepancy cross-network challenges existing methods for long tail or methods for the cross-network node classification. To this end, a multicomponent similarity graphs for cross-network node classification (MS-CNC) is proposed in this article. Specifically, in order to address the sparsity of the tail nodes, multiple component similarity graphs, including attribute and structure similarity graphs, are constructed for each network to enrich the neighborhoods of the tail nodes and alleviate the long-tail phenomenon. Then, multiple representations are learned from the multiple similarity graphs separately. Based on the multicomponent representations, a two-level adversarial model is designed to address the distribution difference across networks. One level is used to learn the invariant representations cross network in view of structure and attribute components separately, and the other level is used to learn the invariant representations in view of the fused structure and attribute graphs. Extensive experimental results show that the MS-CNC outperforms the state-of-the-art methods. Impact Statement-Node classification is an important task in graph mining. With the unavailability of labels, some researchers propose cross-network node classification, using one labeled network to assist the node classification of another unlabeled network. However, the long-tail of nodes leads to unsatisfactory performance and challenges the recent cross-network node classification m

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：