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

作者： Liao, Bo Jiang, Yan Liang, Wei Peng, Lihong Peng, Li Hanyurwimfura, Damien Li, Zejun Chen, Min Key Laboratory for Embedded and Network Computing of Hunan Province College of Information Science and Engineering Hunan University Changsha Hunan410082 China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan411201 China Department of Computer Science and Engineering Changsha Medical University Changsha Hunan410219 China

Efficient mining of high-throughput data has become one of the popular themes in the big data era. Existing biology-related feature ranking methods mainly focus on statistical and annotation information. In this study, two efficient feature ranking methods are presented. Multi-target regression and graph embedding are incorporated in an optimization framework, and feature ranking is achieved by introducing structured sparsity norm. Unlike existing methods, the presented methods have two advantages: (1) the feature subset simultaneously account for global margin information as well as locality manifold information. Consequently, both global and locality information are considered. (2) Features are selected by batch rather than individually in the algorithm framework. Thus, the interactions between features are considered and the optimal feature subset can be guaranteed. In addition, this study presents a theoretical justification. Empirical experiments demonstrate the effectiveness and efficiency of the two algorithms in comparison with some state-of-the-art feature ranking methods through a set of real-world gene expression data sets. © 2015 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Research on the design of the effective transmission scheduling algorithm based on the factory wireless sensor network

引用

Open Automation and Control Systems Journal 2014年第1期6卷 1426-1434页

作者： Zhang, Yunyi Liu, Shuru Zhang, Ran Wei, Wei College of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou China School of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory for Network Computing and Security Technology China

In order to make the sensing data in the monitoring equipment’s sensor nodes reach to the monitoring center as soon as possible and deal with the equipment which has some problems, the network time delay should be guaranteed in the accessible Time Delay Bound. The paper mainly researches the transmission scheduling algorithm with the chain framework, which adopts the Token to do the transmission in the chain and then arranges the transmission order in each node for avoiding the occurrence of the collision and offering the guarantee of the time delay. The node order in each chain is the order of data packets which are transmitted by nodes, while the route of the data packet transmission is according to the shortest route in the Sink Tree for reducing the time delay. © Zhang et al.;Licensee Bentham Open.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Identification and Addressing of the Internet of Things

Research on Identification and Addressing of the Internet of...

引用

International Conference on P2P, Parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Rui Ma Yue Liu Chun Shan Xiao Lin Zhao Xu An Wang School of Software Beijing Institute of Technology Beijing China Key Laboratory of Information and Network Security Engineering University of Chinese Armed Police Force Xi'an Shanxi China

ISBN: (纸本)9781467394741

It is a key issue that identification and addressing the entity which access the Internet through the wireless network with various short distance transmission protocols. To solve the problem, combining with the existing identification and addressing technology of the Internet and the IOT, this paper proposes a method based on distributed ID. This method can be divided into two stages. It first designs the structure of distributed ID. Using the distributed address allocation algorithm, it implements the automatic allocation of the distributed ID as well as the distributed ID resolution among the global IOT. After that, an addressing scheme is designed to meet demands of the IOT addressing. It first defines the structure of addressing and then implements the routing addressing algorithm which combines Cluster-Tree with Ad-hoc On-demand Distance Vector Routing. This scheme could improve the routing efficiency as well as achieve lower cost, lower energy consumption and higher reliability of the addressing. By the simulation on NS-2 platform, the experimental results highlight the feasibility and effectiveness of the proposed method from three aspects: the correctness of identification allocation, the effectiveness of addressing scheme, and the stability of data transmission.

关键词： Routing Resource management Clustering algorithms Internet Encoding Protocols Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

PEVTS: Privacy-Preserving Electric Vehicles Test-Bedding Scheme

PEVTS: Privacy-Preserving Electric Vehicles Test-Bedding Sch...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xu Yang Joseph K. Liu Wei Wu Man Ho Au Willy Susilo Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University China and State Key Laboratory of Cryptology Beijing China Faculty of Information Technology Monash University Australia Department of Computing Hong Kong Polytechnic University Hong Kong School of Computer Science and Software Engineering University of Wollongong Australia

Electric Vehicle (EV) infrastructure is relatively new in many countries. Due to the recency of an EV infrastructure, it is important to carry out a series of testing programs. Furthermore, authenticity for collection of data is necessary for testing programs in order to provide accurate results. At the same time, user privacy should not cease since tracing one's daily logistic movements or behaviour from the EV testing programs means breaching one's privacy. In this paper, we propose a novel solution PEVTS for enabling both data authenticity and user privacy concurrently. Our proposed system provides great flexibility to the authority to choose any arbitrary set of authenticated users for testing in every time period. At the same time, it provides anonymity for all participating users. Yet it can trace any vehicle within a time period for statistical purpose. We give a detailed description of our system. We also implement the prototype of our system to show its practicality.

关键词： Testing Privacy Cryptography Electric vehicles Data privacy Authentication

来源：评论

学校读者我要写书评

暂无评论

Author Correction: The FLUXNET2015 dataset and the ONEFlux processing pipeline for eddy covariance data

引用

Scientific data 2021年第1期8卷 72页

作者： Gilberto Pastorello Carlo Trotta Eleonora Canfora Housen Chu Danielle Christianson You-Wei Cheah Cristina Poindexter Jiquan Chen Abdelrahman Elbashandy Marty Humphrey Peter Isaac Diego Polidori Markus Reichstein Alessio Ribeca Catharine van Ingen Nicolas Vuichard Leiming Zhang Brian Amiro Christof Ammann M Altaf Arain Jonas Ardö Timothy Arkebauer Stefan K Arndt Nicola Arriga Marc Aubinet Mika Aurela Dennis Baldocchi Alan Barr Eric Beamesderfer Luca Belelli Marchesini Onil Bergeron Jason Beringer Christian Bernhofer Daniel Berveiller Dave Billesbach Thomas Andrew Black Peter D Blanken Gil Bohrer Julia Boike Paul V Bolstad Damien Bonal Jean-Marc Bonnefond David R Bowling Rosvel Bracho Jason Brodeur Christian Brümmer Nina Buchmann Benoit Burban Sean P Burns Pauline Buysse Peter Cale Mauro Cavagna Pierre Cellier Shiping Chen Isaac Chini Torben R Christensen James Cleverly Alessio Collalti Claudia Consalvo Bruce D Cook David Cook Carole Coursolle Edoardo Cremonese Peter S Curtis Ettore D'Andrea Humberto da Rocha Xiaoqin Dai Kenneth J Davis Bruno De Cinti Agnes de Grandcourt Anne De Ligne Raimundo C De Oliveira Nicolas Delpierre Ankur R Desai Carlos Marcelo Di Bella Paul di Tommasi Han Dolman Francisco Domingo Gang Dong Sabina Dore Pierpaolo Duce Eric Dufrêne Allison Dunn Jiří Dušek Derek Eamus Uwe Eichelmann Hatim Abdalla M ElKhidir Werner Eugster Cacilia M Ewenz Brent Ewers Daniela Famulari Silvano Fares Iris Feigenwinter Andrew Feitz Rasmus Fensholt Gianluca Filippa Marc Fischer John Frank Marta Galvagno Mana Gharun Damiano Gianelle Bert Gielen Beniamino Gioli Anatoly Gitelson Ignacio Goded Mathias Goeckede Allen H Goldstein Christopher M Gough Michael L Goulden Alexander Graf Anne Griebel Carsten Gruening Thomas Grünwald Albin Hammerle Shijie Han Xingguo Han Birger Ulf Hansen Chad Hanson Juha Hatakka Yongtao He Markus Hehn Bernard Heinesch Nina Hinko-Najera Lukas Hörtnagl Lindsay Hutley Andreas Ibrom Hiroki Ikawa Marcin Jackowicz-Korczynski Dalibor Janouš Wilma Jans Rachhpal Jassal Shicheng Jiang Tomomichi Kato Myr Computational Research Division Lawrence Berkeley National Laboratory Berkeley CA 94720 USA. gzpastorello@lbl.gov. DIBAF University of Tuscia Viterbo 01100 Italy. Euro-Mediterranean Centre on Climate Change Foundation (CMCC) Lecce 73100 Italy. Climate & Ecosystem Sciences Division Lawrence Berkeley National Laboratory Berkeley CA 94720 USA. Computational Research Division Lawrence Berkeley National Laboratory Berkeley CA 94720 USA. Department of Civil Engineering California State University Sacramento CA 95819 USA. Department of Geography Environment and Spatial Sciences Michigan State University East Lansing MI 48823 USA. Department of Computer Science University of Virginia Charlottesville VA 22904 USA. TERN Ecosystem Processes Menzies Creek VIC3159 Australia. Max Planck Institute for Biogeochemistry Jena 07701 Germany. Laboratoire des Sciences du Climat et de l'Environnement (LSCE) CEA CNRS UVSQ UPSACLAY Gif sur Yvette 91190 France. Key Laboratory of Ecosystem Network Observation and Modeling Institute of Geographic Sciences and Natural Resources Research Chinese Academy of Sciences Beijing 100101 China. Department of Soil Science University of Manitoba Winnipeg MB R3T2N2 Canada. Department of Agroecology and Environment Agroscope Research Institute Zürich 8046 Switzerland. School of Geography and Earth Sciences McMaster University L8S4K1 Hamilton ON Canada. Department of Physical Geography and Ecosystem Science Lund University Lund 22362 Sweden. Department of Agronomy and Horticulture University of Nebraska-Lincoln Lincoln NE 68583 USA. School of Ecosystem and Forest Sciences The University of Melbourne Richmond VIC3121 Australia. Department of Biology Research Group PLECO University of Antwerp Antwerp 2610 Belgium. Joint Research Centre European Commission Ispra 21027 Italy. TERRA Teaching and Research Center University of Liege Gembloux B-5030 Belgium. Finnish Meteorological Institute Helsinki 00560 Finland. ES

来源：评论

学校读者我要写书评

暂无评论

A face recognition algorithm based on invariant features of trace transform

引用

Journal of Computational Information Systems 2014年第3期10卷 911-920页

作者： Zhang, Liang Dong, Jiwen Wang, Lei Shandong Provincial Key Laboratory of Network based Intelligent Computing Department of Computer Science and Technology University of Jinan Jinan 250022 China

In order to improve the recognition rate in single training sample, a face recognition algorithm based on invariant features of trace transform (IFT) is developed. In feature extraction, with application of Scharr operator and scale-adapted Laplacian of Gaussian (LoG) & Harris corner detector, keypoints are detected. Proper functionals are chosen to do trace transform in the circular region around each keypoint so as to obtain feature descriptors which are invariant to rotation and scaling. In feature matching, a coarse-to-fine matching strategy is executed by using the descriptors' feature vector and coordinate value. The identity of test image is obtained by comparing the matching score, which avoids the problem of parameters selection. Results show that it successfully improves the recognition rate under variations of illumination, occlusion, pose and expression. It also effectively reduces computational complexity and running time. © 2014 Binary Information Press.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Typical universal entanglers

引用

Science China(Physics,Mechanics & Astronomy) 2014年第10期57卷 1913-1917页

作者： WANG Feng LUO MingXing CHEN XiuBo YANG YiXian WANG XiaoJun College of mathematical sciences Dezhou University Information Security and National Computing Grid Laboratory Southwest Jiaotong University State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications School of Electronic Engineering Dublin City University

A universal entangler is a very powerful fault-tolerant entangling device for generating quantum entanglements from any joint states. Our paper aims to address the construction of universal entanglers. We prove that universal entanglers may be obtained from random unitary gates according to the Harr measure. The success probability is close to 1 for large system spaces. This result represents the typical density of entanglement subspaces in large state spaces. It also partially solves an open problem of universal bipartite entanglers and is explained by some experiment simulations.

关键词： universal bipartite entangler random unitary gate entanglement

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Appearance-based bidirectional representation for palmprint recognition

引用

Multimedia Tools and Applications 2015年第24期74卷 11003-11005页

作者： Cui, Jinrong Wen, Jiajun Fan, Zizhu Bio-Computing Research Center Harbin Institute of Technology Shenzhen Graduate School Shenzhen China Key Laboratory of Network Oriented Intelligent Computation Shenzhen China School of Basic Science East China Jiaotong University Nanchang China

来源：评论

学校读者我要写书评

暂无评论

Hybrid quantum-state joining and splitting assisted by quantum dots in one-side optical microcavities

引用

Physical Review A 2015年第4期91卷 042326-042326页

作者： Ming-Xing Luo Song-Ya Ma Xiu-Bo Chen Xiaojun Wang Information Security and National Computing Grid Laboratory School of Information Science and Technology Southwest Jiaotong University Chengdu 610031 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China School of Mathematics and Statistics Henan University Kaifeng 475004 China School of Electronic Engineering Dublin City University Dublin 9 Ireland

Quantum state joining has been recently experimentally demonstrated [C. Vitelli et al., Nat. Photon. 7, 521 (2013)] which can transfer two input photonic qubits into a photonic ququart. Here, we revisit these processes from a hybrid point of view. By exploring the giant optical circular birefringence induced by quantum-dot spins in one-sided optical microcavities, we introduce some deterministic joining schemes including two quantum-dot spin joining, hybrid photon and quantum-dot spin joining, and two-photon joining. The input quantum information is represented by one photon with polarization and spatial mode degrees of freedom (DOFs). These schemes are also adapted to the inverse processes called quantum state splitting because all the joining procedures are unitary and do not require projection and feed-forward steps. The fused photon is convenient for realizing elementary logic gates such as the controlled-not (cnot) gate, swap gate, and Toffoli gate. These hybrid fusion and splitting schemes provide flexible synthesis of the quantum-dot spin and photon in quantum applications. The transmission superiority of photons and storage superiority of the quantum-dot spin may be combined for quantum network communication or quantum computations.

关键词： QUANTUM states QUANTUM systems QUANTUM theory QUBITS DEGREES of freedom

来源：评论

学校读者我要写书评

暂无评论

A New Secure Data Deduplication Approach Supporting User Traceability

A New Secure Data Deduplication Approach Supporting User Tra...

引用

International Conference on Broadband, Wireless computing, Communication and Applications (BWCCA)

作者： Jianfeng Wang Xiaofeng Chen Jin Li Kamil Kluczniak Miroslaw Kutylowski Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou PRChina State Key Laboratory of Integrated Service Networks (ISN) Xidian University Xi'an China School of Computer Science Guangzhou University Guangzhou China Wroclaw University of Technology Wroclaw Poland

ISBN: (纸本)9781467383165

The notion of data deduplication enables a user to eliminate duplicate copies of data so that it can save the amount of storage space and network bandwidth. Convergent encryption, as the state-of-art approach, has been widely adopted to perform secure deduplication in the cross-user scenario. However, all the existing solutions cannot support user traceability. That is, there is no way to trace the identities of malicious users for instance in case a user performed a duplicate faking attack. To cope with this issue, in this paper, we propose a novel secure deduplication scheme supporting user traceability by incorporating traceable signatures with the state of the art deduplication technique, such as interactive randomized convergent encryption and proof of ownership.

关键词： Encryption Servers Concrete Generators Cloud computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：