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

1st International Conference on Cloud computing and Security, ICCCS 2015

作者： Zhu, Qi Dai, Baisheng Fan, Zizhu Zhang, Zheng College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Nanjing China School of Computing Science and Technology Harbin Institute of Technology Harbin China School of Basic Science East China Jiaotong University Nanchang China Shenzhen Graduate School Harbin Institute of Technology Shenzhen China

ISBN: (纸本)9783319270500

Under certain conditions, the sparsest solution to the combination coefficients can be achieved by L1-norm minimization. Many algorithms of L1-norm minimization have been studied in recent years, but they suffer from the expensive computational problem, which constrains the applications of SRC in large-scale problems. This paper aims to improve the computation efficiency of SRC by speeding up the learning of the combination coefficients. We show that the coupled representations in the original space and PCA space have the similar sparse representation model (coefficients). By using this trick, we successfully avoid the curse of dimensionality of SRC in computation and develop the Fast SRC (FSRC). Experimental results on several face datasets illustrate that FSRC has comparable classification accuracy to SRC. Compared to PCA +SRC, FSRC achieves higher classification accuracy. © Springer International Publishing Switzerland 2015.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

An R-Calculus for the logic programming

Advances in Intelligent Systems and Computing

引用

Advances in intelligent Systems and computing 2014年 255卷 863-870页

作者： Li, Wei Sui, Yuefei State Key Laboratory of Software Development Environment Beijing University of Aeronautics and Astronautics Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9788132217589

The AGM postulates are for the belief revision (revision by a single belief), and the DP postulates are for the iterated revision (revision by a finite sequence of beliefs). Li (The Computer Journal 50:378–390, 2007) gave an Rcalculus for R-configurations D|C, where D is a set of atomic formulas or the negations of atomic formulas, and C is a finite set of formulas in the first-order logic. This paper will give a set of axioms and deduction rules for the revision of logic programmings, based on the structure of formulas, so that the deduction system is sound and complete with respect to the maximal consistent subsets of the revised sets by the revising sets of formulas. Moreover, it will be showed that the deduction system satisfies the AGM postulates and the DP postulates. © Springer India 2014.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Discovery of ovarian cancer candidate genes using protein interaction information 11th

Discovery of ovarian cancer candidate genes using protein in...

引用

11th International Conference on intelligent computing, ICIC 2015

作者： Zhang, Di Wang, Qingbao Zhu, RongRong Li, Hai-Tao Zheng, Chun-Hou Xia, Junfeng Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Institute of Health Sciences School of Computer Science and Technology Anhui University Hefei Anhui230039 China Clinical Laboratory Center The First Affiliated Hospital Anhui University of Traditional Chinese Medicine Hefei Anhui230012 China College of Electrical Engineering and Automation Anhui University Hefei Anhui230601 China

ISBN: (纸本)9783319221854

Ovarian cancer (OVC) is one of the deadliest cancers in women. At present, effective clinical therapy for OVC is still limited. We adopted a computational method to identify OVC candidate genes based on subnetwork extraction algorithm in the protein interaction network. Of the final identified five genes, MSH3 and PIK3R3 genes have been reported to be implicated in OVC tumorigenesis, indicating that the method is effective, whereas the other three genes (MAPK8IP1, PICK1, and IQGAP3) might have potential roles in OVC development. The results provided a novel insight into identifying the OVC-related genes and exploring new methods for OVC therapy. © Springer International Publishing Switzerland 2015.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Energy efficient feedback design for coordinated multi-point transmission in downlink

International Journal of Signal Processing, Image Processing...

引用

International Journal of Signal processing, Image processing and Pattern Recognition 2015年第6期8卷 155-166页

作者： Wang, Yi Hu, Yanjun Zhou, Yiqing Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China School of Electronic Science and Technology Anhui University Hefei China Institute of Computing Technology Chinese Academy of Sciences Beijing China

Coordinated multi-point (CoMP) has been raised to increase the average cell throughput and the cell-edge user throughput. However, the energy consumption of mobile stations (MSs) is a key problem restricting the wide application of CoMP systems. Considering the energy consumption of feeding back channel state information (CSI) by MSs and the influence of CSI accuracy on the throughput of system, it is proposed to measure the relationship between feedback energy consumption and throughput with energy efficiency feedback utility (EEFU) function which can adapt to different application scenes by adjusting utilization coefficient. The feedback utilization of two precoders in CoMP systems is analyzed respectively, including the optimization allocation of feedback bits with utility function. The complete EEFU optimized expression and the optimizing flow path satisfying the actual application demands of CoMP systems are then derived. The simulation results illustrate the practicability and necessity of the EEFU function and verify the performance of EEFU with different precoders. © 2015 SERSC.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

On the encoding complexity of systematic polar codes

On the encoding complexity of systematic polar codes

引用

IEEE International SOC Conference

作者： Liping Li Wenyi Zhang Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education of China Anhui University China Chinese Academy of Sciences and Department of Electronic Engineering and Information Sciences University of Science and Technology of China

Systematic polar codes are proposed by Arikan and are shown to have better BER performance than non-systematic polar codes. From a recursive decomposition of the generator matrix of polar codes, Arikan showed that the encoding complexity of systematic polar codes is also O(N log N) where N is the code block length. But the recursive process involves some additional calculations in transforming the problem instances back and forth. In this paper, by using the sparsity property of the generator matrix, we propose an encoding process which has the same complexity as non-systematic polar codes in the presence of an additional memory array. Without the additional memory elements, the number of additions of the proposed encoding process increases compared with non-systematic polar codes. We also provide an analysis to quantify this additional increase of the complexity.

关键词： Encoding Systematics Complexity theory Decoding Generators Bit error rate Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Optimal simulation of Deutsch gates and the Fredkin gate

引用

Physical Review A 2015年第3期91卷 032302-032302页

作者： Nengkun Yu Mingsheng Ying Institute for Quantum Computing University of Waterloo Waterloo Ontario Canada Department of Mathematics & Statistics University of Guelph Guelph Ontario Canada Center for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW 2007 Australia State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 China

In this paper, we study the optimal simulation of the three-qubit unitary using two-qubit gates. First, we completely characterize the two-qubit gate cost of simulating the Deutsch gate (controlled-controlled gate) by generalizing our result on the two-qubit cost of the Toffoli gate. The function of any Deutsch gate is simply a three-qubit controlled-unitary gate and can be intuitively explained as follows: The gate outputs the states of the two control qubits directly, and applies the given one-qubit unitary u on the target qubit only if both the states of the control qubits are |1〉. Previously, it was only known that five two-qubit gates are sufficient for implementing such a gate [Sleator and Weinfurter, Phys. Rev. Lett. 74, 4087 (1995)]. We show that if the determinant of u is 1, four two-qubit gates are optimal. Otherwise, five two-qubit gates are required. For the Fredkin gate (the controlled-swap gate), we prove that five two-qubit gates are necessary and sufficient, which settles the open problem introduced in Smolin and DiVincenzo [Phys. Rev. A 53, 2855 (1996)].

关键词： QUANTUM gates PARTICLE interactions QUBITS QUANTUM information science QUANTUM fluctuations HAMILTONIAN systems QUANTUM states

来源：评论

学校读者我要写书评

暂无评论

An Interrupt Scheduling Mechanism of Virtual Network Interface Card for Xen-Based System

An Interrupt Scheduling Mechanism of Virtual Network Interfa...

引用

2015 5th International Conference on Computer Sciences and Automation Engineering(ICCSAE 2015)

作者： Liuzheng Lu Runze Wan Jinrong He School of Computer Hubei University of Education Co-Innovation Centre of Elementary Education Information Technology Services of Hubei Science Computing and Intelligent Information Processing of Guangxi Higher Education Key Laboratory Guangxi Teachers Education University

As one of typical paravirtualization hypervisors, Xen has received widespread attentions especially its scaling capability under some kinds of workload. In this paper, we focus on the problem that the most CPU resources are occupied by frequent interrupt from the NIC（Network Interface Card） and it will cause bottleneck of the system for Xen. To alleviate this problem, this paper proposes an adaptive interrupt latency scheduling mechanism based on XEN, which use the polling or interrupt method in accordance with the queue length of virtual buffer without supplementing any additional processing unit. Also, the method can guarantee different quality of service to some extent by means of the definition of the two types of priority virtual buffers. Simulation results show that the mechanism can reduce CPU overhead significantly and improve system performance effectively.

关键词： virtualization interrupt latency virtual buffer

来源：评论

学校读者我要写书评

暂无评论

ICON, a 3D-reconstruction algorithm using compressed sensing approach and its application in electron tomography

ICON, a 3D-reconstruction algorithm using compressed sensing...

引用

第四届全国冷冻电子显微学与结构生物学专题研讨会

作者： Yuchen Deng Yu Chen Yan Zhang Fa Zhang 孙飞 National Key Laboratory of Biomacromolecules Institute of BiophysicsChinese Academy of Sciences University of Chinese Academy of Sciences National Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences 中国科学院生物物理研究所

＜正＞Cryo-electron tomography（ET）plays an important role in revealing biological structures,ranging from macromolecule scale to subcellular *** acquiring series of pictures with different angular assignment,one per...

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Study on Apparent Age Estimation

A Study on Apparent Age Estimation

引用

International Conference on Computer Vision Workshops (ICCV Workshops)

作者： Yu Zhu Yan Li Guowang Mu Guodong Guo Lane Department of CSEE West Virginia University Morgantown WV USA Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

Age estimation from facial images is an important problem in computer vision and pattern recognition. Typically the goal is to predict the chronological age of a person given his or her face picture. It is seldom to study a related problem, that is, how old does a person look like from?the face photo? It is called apparent age estimation. A key difference between apparent age estimation and the traditional age estimation is that the age labels are annotated by human assessors rather than the real chronological age. The challenge for apparent age estimation is that there are?not many face images available with annotated age labels. Further, the annotated age labels for each face photo may not be consistent among different assessors. We study the problem of apparent age estimation by addressing the issues from different aspects, such as how to utilize a large number of face images without apparent age labels to learn a face representation using the deep neural networks, how to tune the deep networks using a limited number of examples with apparent age labels, and how well the machine learning methods can perform to estimate apparent ages. The apparent age data is from the ChaLearn Looking At People (LAP) challenge 2015. Using the protocol and time frame given by the challenge competition, we have achieved an error of 0.294835 on the final evaluation, and our result has been ranked the 3rd place in this competition.

关键词： Estimation Face Databases Training Neural networks Data models Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Segment and label indoor scene based on RGB-D for the visually impaired 1

引用

20th Anniversary International Conference on MultiMedia Modeling, MMM 2014

作者： Wang, Zhe Liu, Hong Wang, Xiangdong Qian, Yueliang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (数字)9783319041148

ISBN: (纸本)9783319041131

The growing study in RGB-D sensor and 3D point cloud have made new progress in obstacle avoidance for the visually impaired. However, it remains a challenging problem due to the difficulty in design a robust and real-time algorithm. In this paper, we focus on scene segmentation and labeling. As man-made indoor scene contains many planar area and structure, plane segmentation and classification is important for further scene analysis. This work propose a multiscale-voxel strategy to reduce the effects of noise and improve plane segmentation. Then the segmentation result is combined with depth data and color data to apply graph-based image segmentation algorithm. After that, a cascaded decision tree is trained to classify different segments into different semantical type. The method is tested on part of the NYU Depth Dataset. Experimental results show that the proposed method combines the advantages of depth data and the geometry characteristics of the scene, and improves scene segmentation and obstacle detection. © 2014 Springer International Publishing.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：