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

2nd IEEE Symposium on Privacy-Aware Computing, PAC 2018

作者： Pu, Yuwen Luo, Jin Wang, Ying Hu, Chunqiang Huo, Yan Zhang, Jiong School of Big Data and Software Engineering Chongqing University Chongqing China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University Chongqing China School of Electronic and Information Engineering Beijing Jiaotong University Beijing China Ningbo Branch of Agricultural Bank of China Ningbo China

ISBN: (纸本)9781538684429

Location based services pose strong security and privacy requirements but achieving privacy protection at the client side is a non-trial problem. In this paper, we propose an efficient and reliable location privacy preserving scheme using cryptographic approach. It can preserve users' privacy data by making their identity be anonymity for LBS provider and fog server. For communication, both AES with One-Time-Pad keys and IBE are employed to guarantee confidentiality and integrity of request and response data. Besides, we also provide security analysis to demonstrate that our scheme can resist internal attack, external attack and colluding attack. © 2018 IEEE.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Empirical topological investigation of practical supply chains based on complex networks

引用

Chinese Physics B 2017年第11期26卷 144-150页

作者：廖好沈婧吴兴桐陈博奎周明洋 National Engineering Laboratory for Big Data Computing Systems Guangdong Province Key Laboratory of Popular High Performance ComputersCollege of Computer Science and Software Engineering Shenzhen University Department of Computer Science School of Computing National University of Singapore

The industrial supply chain networks basically capture the circulation of social resource, dominating the stability and efficiency of the industrial system. In this paper, we provide an empirical study of the topology of smartphone supply chain network. The supply chain network is constructed using open online data. Our experimental results show that the smartphone supply chain network has small-world feature with scale-free degree distribution, in which a few high degree nodes play a key role in the function and can effectively reduce the communication cost. We also detect the community structure to find the basic functional unit. It shows that information communication between nodes is crucial to improve the resource utilization. We should pay attention to the global resource configuration for such electronic production management.

关键词： China supply chain networks complex networks data science network science

来源：评论

学校读者我要写书评

暂无评论

Identifying significant edges via neighborhood information

arXiv

引用

arXiv 2019年

作者： Zhao, Na Li, Jie Wang, Jian Li, Tong Yu, Yong Zhou, Tao Key Laboratory in Software Engineering of Yunnan Province School of Software Yunnan University Kunming650091 China Electric Power Research Institute of Yunnan Power Grid Kunming650217 China College of Information Engineering and Automation Kunming University of Science and Technology Kunming650504 China School of Big Data Yunnan Agricultural University Kunming650201 China CompleX Lab University of Electronic Science and Technology of China Chengdu611471 China

Heterogeneous nature of real networks implies that different edges play different roles in network structure and functions, and thus to identify significant edges is of high value in both theoretical studies and practical applications. We propose the so-called second-order neighborhood (SN) index to quantify an edge's significance in a network. We compare SN index with many other benchmark methods based on 15 real networks via edge percolation. Results show that the proposed SN index outperforms other well-known methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Solvents

来源：评论

学校读者我要写书评

暂无评论

A secure rational quantum state sharing protocol

引用

Science China(Information Sciences) 2018年第2期61卷 204-215页

作者： Zhao DOU Gang XU Xiu-Bo CHEN Xin LIU Yi-Xian YANG Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications School of Software Engineering Beijing University of Posts and Telecommunications Gui Zhou University Guizhou Provincial Key Laboratory of Public Big Data School of Computer Science Shaanxi Normal University School of Information Engineering Inner Mongolia University of Science and Technology

A novel rational protocol to share two arbitrary qubits among multiple parties is investigated in this paper. First, the protocol is presented, which is learned from Li et al.'s protocol. Second, the utility,security, correctness, fairness, Nash equilibrium, and Pareto optimality of our scheme are discussed in detail,where the utility, correctness, and fairness of rational quantum state sharing protocols are creatively given because the agent who recovers the state plays a different and more important role. Another important point is that assumptions about our protocol are more practical and suitable than existing protocols.

关键词： rational quantum state sharing Nash equilibrium secure correct

来源：评论

学校读者我要写书评

暂无评论

Controllability analysis of transcriptional regulatory networks for Saccharomyces cerevisiae 44

Controllability analysis of transcriptional regulatory netwo...

引用

44th Annual Conference of the IEEE Industrial Electronics Society, IECON 2018

作者： Liu, Suling Wang, Pei Xu, Qiong Chen, Aimin Lü, Jinhu School of Mathematics and Statistics Henan University Kaifeng China School of Mathematics and Statistics Institute of Applied Mathematics Laboratory of Data Analysis Technology Henan University Kaifeng China School of Mathematics and Statistics Institute of Applied Mathematics Henan University Kaifeng China School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Big Data Brain Machine Intelligence Beihang University Beijing China

ISBN: (纸本)9781509066841

Structural controllability of complex networks has been a research focus in recent years. However, few works considered the structural controllability of biological networks, especially for dynamic biological networks. In this paper, structural controllability of one static and five dynamic transcriptional regulatory networks (TRNs) for Saccharomyces cerevisiae (S. cerevisiae) have been investigated. The five dynamic networks included two endogenous and three exogenous ones. We clarified the controllability properties of these networks, as well as explored the differences among different types of networks. Our results revealed that the structural properties of different types of networks are significantly different. We found that the TRNs are rather difficult to be fully controlled. However, the dynamic TRNs were relatively easier to be controlled than the static one, and one needs relatively more external inputs to control the exogenous TRNs than the endogenous ones. Based on the structural controllability analysis of subnetworks with the same sizes, as well as randomly perturbed networks by preserving degree distributions, we further illustrated that the structural controllability of the six networks may be mainly dominated by their degree distributions. Our investigations clarify the control properties of TRNs in S. cerevisiae, it provides some insights on real-world control of biological networks. © 2018 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Strict pattern matching under non-overlapping condition

引用

Science China(Information Sciences) 2017年第1期60卷 5-20页

作者： Youxi WU Cong SHEN He JIANG Xindong WU School of Computer Science and Engineering Hebei University of Technology Hebei Province Key Laboratory of Big Data Calculation School of Computer Science and Technology Tianjin University School of Software Dalian University of Technology School of Computer Science and Information Engineering Hefei University of Technology School of Computing and Informatics University of Louisiana at Lafayette

Pattern matching(or string matching) is an essential task in computer science, especially in sequential pattern mining, since pattern matching methods can be used to calculate the support(or the number of occurrences) of a pattern and then to determine whether the pattern is frequent or not. A state-of-the-art sequential pattern mining with gap constraints(or flexible wildcards) uses the number of non-overlapping occurrences to denote the frequency of a pattern. Non-overlapping means that any two occurrences cannot use the same character of the sequence at the same position of the pattern. In this paper, we investigate strict pattern matching under the non-overlapping condition. We show that the problem is in P at first. Then we propose an algorithm, called NETLAP-Best, which uses Nettree structure. NETLAP-Best transforms the pattern matching problem into a Nettree and iterates to find the rightmost root-leaf path, to prune the useless nodes in the Nettree after removing the rightmost root-leaf path. We show that NETLAP-Best is a complete algorithm and analyse the time and space complexities of the algorithm. Extensive experimental results demonstrate the correctness and efficiency of NETLAP-Best.

关键词： pattern matching sequential pattern mining gap constraint flexible wildcard non-overlapping occurrence Nettree

来源：评论

学校读者我要写书评

暂无评论

OpenHI2 - Open source histopathological image platform

OpenHI2 - Open source histopathological image platform

引用

IEEE International Conference on Bioinformatics and Biomedicine

作者： Pargorn Puttapirat Haichuan Zhang Jingyi Deng Yuxin Dong Jiangbo Shi Hongyu He Zeyu Gao Chunbao Wang Xiangrong Zhang Chen Li National Engineering Lab for Big Data Analytics Xi'an Jiao tong University Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D Xi'an Jiaotong University Department of Power System and Automation School of Electrical Engineering Xi'an Jiaotong University Department of Pathology the First Affiliated Hospital of Xi'an Jiaotong University Institute of Intelligent Information Processing Xidian University

ISBN: (纸本)9781728118680

Transition from conventional to digital pathology requires a new category of biomedical informatic infrastructure which could facilitate delicate pathological routine. Pathological diagnoses are sensitive to many external factors and is known to be subjective. Only systems that can meet strict requirements in pathology would be able to run along pathological routines and eventually digitized the area, and the developed platform should comply with existing pathological routines and international standards. Currently, there are a number of available software tools which can perform histopathological tasks including virtual slide viewing, annotating, and basic image analysis, however, none of them can serve as a digital platform for pathology. Here we describe OpenHI2, an enhanced version Open Histopathological Image platform which is capable of supporting all basic pathological tasks and file formats;ready to be deployed in medical institutions on a standard server environment or cloud computing infrastructure. In this paper, we also describe the development decisions for the platform and propose solutions to overcome technical challenges including responsive region retrieval and viewing, virtual slide magnification, recording of diagnostic areas. These factors would promote OpenHI2 be used as a platform for histopathological images in real-world clinical settings. Furthermore, in research, OpenHI2 inherited the annotation functionality from the previous version, thus acquired annotations can be directly utilized by the newly added machine learning module which include popular machine learning models to perform tasks such as histology image classification and segmentation in the same environment. Addition can be made to the platform since each component is modularized and fully documented. OpenHI2 is free, open-source, and available at .

关键词： OpenHI digital pathology histopathological image analysis open source software open source software pathology Platform software Tools open source Religious Missions External factors images

来源：评论

学校读者我要写书评

暂无评论

An advanced operating environment for mathematics education resources

引用

中国科学（信息科学） 2018年第9期61卷 256-258页

作者： Yongsheng RAO Jingzhong ZHANG Yu ZOU Yanchun SUN Xiangping CHEN Songhua XU School of Data and Computer Science Sun Yat-Sen University Guangzhou 510275 China Academy for Intelligent Software Guangzhou University Guangzhou 510006 China Institute of Mathematics and Computer Science Guizhou Normal College Guiyang 550018 China Academy for Intelligent Software Guangzhou University Guangzhou 510006 China Institute of Mathematics and Computer Science Guizhou Normal College Guiyang 550018 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing Beijing 100871 China School of Data and Computer Science Sun Yat-Sen University Guangzhou 510275 China College of Computer Sciences New Jersey Institute of Technology Newark 07102 USA Academy for Intelligent Software Guangzhou University Guangzhou 510006 China

The potential of information technology (IT) in education modernization has been widely *** the broad efforts for advancing education IT,digital education resources continue to receive a high level of attention,with the goal of making high-quality education resources pervasively accessible anytime and ***,the amount of such high-quality resources is still limited,particularly those suitable for mathematics education [1].General expectations for high-quality digital mathematics education resources (MERs) include interactivity,openness,and transparency,all of which benefit enhancing the sustainability of MERs [2].In this case,openness of an MER refers to the resource being easily edited and extended;transparency means that users have convenient access to the original development process of the *** these features,MERs can be continuously improved and augmented according to users' individual *** development and utilization of such MEPs often rely on the deployment of a specialized 'software or platform',which is commonly referred to as the 'operating environment (OE)'.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning from history and present: Next-item recommendation via discriminatively exploiting user behaviors

arXiv

引用

arXiv 2018年

作者： Li, Zhi Zhao, Hongke Liu, Qi Huang, Zhenya Mei, Tao Chen, Enhong Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China School of Software Engineering University of Science and Technology of China JD AI Research

In the modern e-commerce, the behaviors of customers contain rich information, e.g., consumption habits, the dynamics of preferences. Recently, session-based recommendations are becoming popular to explore the temporal characteristics of customers’ interactive behaviors. However, existing works mainly exploit the short-term behaviors without fully taking the customers’ long-term stable preferences and evolutions into account. In this paper, we propose a novel Behavior-Intensive Neural Network (BINN) for next-item recommendation by incorporating both users’ historical stable preferences and present consumption motivations. Specifically, BINN contains two main components, i.e., Neural Item Embedding, and Discriminative Behaviors Learning. Firstly, a novel item embedding method based on user interactions is developed for obtaining an unified representation for each item. Then, with the embedded items and the interactive behaviors over item sequences, BINN discriminatively learns the historical preferences and present motivations of the target users. Thus, BINN could better perform recommendations of the next items for the target users. Finally, for evaluating the performances of BINN, we conduct extensive experiments on two real-world datasets, i.e., Tianchi and JD. The experimental results clearly demonstrate the effectiveness of BINN compared with several state-of-the-art methods. Copyright © 2018, The Authors. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

An efficient quantum circuits optimizing scheme compared with QISKit

arXiv

引用

arXiv 2018年

作者： Zhang, Xin Xiang, Hong Xiang, Tao Fu, Li Sang, Jun School of Big Data and Software Engineering Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Ministry of Education School of Computer Science Chongqing University

Recently, the development of quantum chips has made great progress-the number of qubits is increasing and the fidelity is getting higher. However, qubits of these chips are not always fully connected, which sets additional barriers for implementing quantum algorithms and pro-gramming quantum programs. In this paper, we introduce a general circuit optimizing scheme, which can efficiently adjust and optimize quantum circuits according to arbitrary given qubits' layout by adding additional quantum gates, exchanging qubits and merging single-qubit gates. Compared with the optimizing algorithm of IBM's QISKit, the quantum gates consumed by our scheme is 74.7%, and the execution time is only 12.9% on average. Copyright © 2018, The Authors. All rights reserved.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：