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

2013 5th International Conference on Computational and Information Sciences, ICCIS 2013

作者： Yang, Hengxiang Wang, Xiujin Bai, Lifang School of Computer Science and Technology Tianjin Key Laboratory of Cognitive Computing and Application Tianjin University Tianjin China Department of Software Engineering Tianjin University Tianjin China

ISBN: (纸本)9780769550046

The composition of the landscape image can convey the emotion of cameramen. Proposed in this article is one novel technique for landscape image composition analysis, which could lay the foundation for the further analysis of image emotion. This method is mainly aimed at analyzing the composition of landscape image with no foregrounds compos. Firstly, the image segmentation method based on edge detection and k-means clustering algorithm is used to extract the contour of each mountain. Secondly, curve fitting method is used to determine the curve type of each mountain in the landscape image. Finally, the normal distribution model is constructed to assign a weight to each pixel of the image from its location information, We can determine the composition of the whole image based on total weight comparison of each curve type which combined the contour information and location information. In this paper, we differentiated the curve from five types: Level-style, Inclined-style, Vertical-style, C-style and W-style. Corresponding, the composition of the whole image is divided into these five types. As a result, we can determine the composition type of landscape image. Experimental results demonstrate that this method is effective and meaningful in practice. © 2013 IEEE.

关键词： Normal distribution

来源：评论

学校读者我要写书评

暂无评论

TBox-replication partition method for Web scaled RDF data

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and technology (Natural Science Edition) 2013年第SUPPL.2期41卷 42-47页

作者： Meng, Qingyi Feng, Zhiyong Rao, Guozheng Wang, Xin School of Computer Science and Technology Tianjin Key Laboratory of Cognitive Computing and Application Tianjin University Tianjin 300072 China

Special properties such as small size, stable content, high in-degree, high access frequency, and integrity of terminology box were analyzed. Proposes terminology box replication preprocessing, and then design a partition framework according to properties of the web scaled resource description framework (RDF) data. In comparison with the classical multilevel graph partitioning algorithm, experiment results show that the partition framework is good for web scaled RDF data partition, dramatically decrease the edge cut by small redundancy. This partition framework provides a good data distribution management for high level computing.

关键词： Terminology

来源：评论

学校读者我要写书评

暂无评论

Discriminative multi-task feature selection

Discriminative multi-task feature selection

引用

27th AAAI Conference on Artificial Intelligence, AAAI 2013

作者： Han, Yahong Zhang, Jianguang Xu, Zhongwen Yu, Shoou-I. School of Computer Science and Technology Tianjin University China College of Computer Science Zhejiang University China School of Computer Science Carnegie Mellon University United States Tianjin Key Laboratory of Cognitive Computing and Application China

ISBN: (纸本)9781577356288

The effectiveness of supervised feature selection degrades in low training data scenarios. We propose to alleviate this problem by augmenting per-task feature selection with joint feature selection over multiple tasks. Our algorithm builds on the assumption that different tasks have shared structure which could be utilized to cope with data sparsity. The proposed trace-ratio based model not only selects discriminative features for each task, but also finds features which are discriminative over all tasks. Extensive experiment on different data sets demonstrates the effectiveness of our algorithm in low training data scenarios. Copyright © 2013, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Robust tensor clustering with non-greedy maximization

Robust tensor clustering with non-greedy maximization

引用

23rd International Joint Conference on Artificial Intelligence, IJCAI 2013

作者： Cao, Xiaochun Wei, Xingxing Han, Yahong Yang, Yi Lin, Dongdai Tianjin Key Laboratory of Cognitive Computing and Application School of Computer Science and Technology Tianjin University China School of Information Technology and Electrical Engineering University of Queensland Australia State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences China

ISBN: (纸本)9781577356332

Tensors are increasingly common in several areas such as data mining, computer graphics, and computer vision. Tensor clustering is a fundamental tool for data analysis and pattern discovery. However, there usually exist outlying data points in realworld datasets, which will reduce the performance of clustering. This motivates us to develop a tensor clustering algorithm that is robust to the outliers. In this paper, we propose an algorithm of Robust Tensor Clustering (RTC). The RTC firstly finds a lower rank approximation of the original tensor data using a L1 norm optimization function. Because the L1 norm doesn't exaggerate the effect of outliers compared with L2 norm, the minimization of the L1 norm approximation function makes RTC robust to outliers. Then we compute the HOSVD decomposition of this approximate tensor to obtain the final clustering results. Different from the traditional algorithm solving the approximation function with a greedy strategy, we utilize a non-greedy strategy to obtain a better solution. Experiments demonstrate that RTC has better performance than the state-ofthe- art algorithms and is more robust to outliers.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Controller design based on linear matrix inequalities for hypersonic reentry vehicle driven by reaction control system

Controller design based on linear matrix inequalities for hy...

引用

AIAA Guidance, Navigation, and Control (GNC) Conference

作者： Gaohua, Cai Jianmei, Song Dong, Liang Xianxiang, Chen School of Aerospace Engineering Key Laboratory of Dynamics and Control of Flight Vehicle Ministry of Education Beijing Institute of Technology Beijing 100081 China Beijing Institute of Computer Application Beijing 100089 China

ISBN: (纸本)9781624102240

An angle-of-attack tracking autopilot for Hypersonic Reentry Vehicle (HRV) driven by Reaction Control System (RCS) is designed based on Linear Matrix Inequalities in this paper. During the initial reentry phase of hypersonic vehicle, the efficacy of aerodynamics surface is insufficient due to low dynamic pressure. Thus RCS is utilized to act as the control actuator, with saturating and quantizing output. A control design technique based on Linear Matrix Inequalities is employed in this paper to determine a state feedback stabilizing gain through solving an optimization problem. The domain of attraction of the control system relating to the stabilizing gain can be estimated simultaneously. In the design process, the level of saturation and quantization error bound of RCS can be considered explicitly. Input-to-State Stability of the closed-loop system is proved by selecting appropriate comparison functions. The performance of the designed controller is demonstrated by simulations with linear and nonlinear dynamics model of HRV.

关键词： Hypersonic vehicles

来源：评论

学校读者我要写书评

暂无评论

Adaptive video super-resolution based on superpixel-guided auto-regressive model

Adaptive video super-resolution based on superpixel-guided a...

引用

14th Pacific-Rim Conference on Multimedia, PCM 2013

作者： Zhu, Yanming Li, Kun Jiang, Jianmin Yang, Jingyu Tianjin Key Laboratory of Cognitive Computing and Application School of Computer Science and Technology Tianjin University Tianjin 300072 China School of Electronic Information Engineering Tianjin University Tianjin 300072 China

ISBN: (纸本)9783319037301

This paper proposes an adaptive video super-resolution (SR) method based on superpixel-guided auto-regressive (AR) model. The keyframes are automatically selected and super-resolved by a sparse regression method. The non-key-frames are super-resolved by simultaneously exploiting the spatiotemporal correlations: The temporal correlation is exploited by a GPU-based optical flow method while the spatial correlation is modelled by a superpixel-guided AR model. Experimental results show that the proposed method outperforms the existing benchmark in terms of both subjective visual quality and objective peak-to-peak signal-to-noise ratio (PSNR). At the same time, the running time of the proposed method is the shortest in comparison with the state-of-the-art methods, which makes the proposed method suitable for practical applications. © Springer International Publishing Switzerland 2013.

关键词： Superpixels

来源：评论

学校读者我要写书评

暂无评论

Hybridizing biogeography-based optimization with differential evolution for motif discovery problem

引用

ICIC Express Letters 2013年第12期7卷 3343-3348页

作者： Feng, Si-Ling Zhu, Qing-Xin Gong, Xiu-Jun Zhong, Sheng School of Computer Science and Engineering University of Electronic Science and Technology of China No. 4 Section 2 North Jianshe Road Chengdu 610054 China College of Information Science and Technology Hainan University No. 58 Renmin Avenue Haikou 570228 China School of Computer Science and Technology Tianjin University No. 92 Weijin Road Tianjin 300072 China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin China

The computational discovery of DNA motifs for previously uncharacterized transcription factors in groups of co-regulated genes is a well-studied problem with a great deal of practical relevance to the biologist. In this paper, we apply an improved hybridization of Biogeography-Based Optimization (BBO) with differential evolution (DE) approach, namely BBO/DE, to predict motifs from DNA sequences. BBO/DE combines the exploitation of BBO with the exploration of DE effectively, and hence it can generate the promising candidate solutions. And the migration operators of BBO are modified based on number of iteration to meet motif discovery requirements. Statistical comparisons with some typical existing approaches on three commonly used datasets are provided, which demonstrates the validity and effectiveness of the proposed improved hybrid algorithm. © 2013 ISSN 1881-803X.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Multipartite entanglement and hypergraph states of three qubits

引用

Physical Review A 2013年第3期87卷 032329-032329页

作者： Ri Qu Zong-shang Li Juan Wang Yan-ru Bao []School of Computer Science and Technology Tianjin University Tianjin 300072 China and Tianjin Key Laboratory of Cognitive Computing and Application Tianjin 30072 China

Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into six classes and only one of them is not equivalent to any graph state; (ii) under stochastic local operations with classical communication, for the single-copy case hypergraph states of three qubits, partitioned into five classes which cannot be converted into a W state, are equivalent to graph states; and (iii) when bipartite entanglement in three qubits is considered, hypergraph states of three qubits are split into five classes and only one of them has the same entangled graph as the W state.

关键词： QUANTUM entanglement HYPERGRAPHS QUBITS EQUIVALENCE principle (Physics) QUANTUM communication STOCHASTIC analysis

来源：评论

学校读者我要写书评

暂无评论

Encoding hypergraphs into quantum states

引用

Physical Review A 2013年第2期87卷 022311-022311页

作者： Ri Qu Juan Wang Zong-shang Li Yan-ru Bao []School of Computer Science & Technology Tianjin University Tianjin 300072 China and Tianjin Key Laboratory of Cognitive Computing and Application Tianjin 300072 China

Ionicioiu and Spiller [Phys. Rev. A 85, 062313 (2012)] have recently presented an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Based on their study, we first extend the axiomatic framework to hypergraphs by means of modifying its axioms and consistency conditions. Then we use the axiomatic approach to encode hypergraphs into a different family of quantum states, called the hypergraph states. Moreover, we also try to do the following: (i) show that real equally weighted states, which occur in Grover and Deutsch-Jozsa algorithms, are equivalent to hypergraph states; (ii) describe the relations among hypergraph states, graph states, and stabilizer states; (iii) provide some transformation rules, stated in purely hypergraph theoretical terms, which completely characterize the evolution of hypergraph states under some local operations, including operators in the Pauli group and some special local Pauli measurements; and (iv) investigate some properties of multipartite entanglement of hypergraph states by hypergraph theory.

关键词： HYPERGRAPHS QUANTUM theory ALGORITHMS PHYSICS THERMODYNAMICS

来源：评论

学校读者我要写书评

暂无评论

Relationship among locally maximally entangleable states, W states, and hypergraph states under local unitary transformations

引用

Physical Review A 2013年第5期87卷 052331-052331页

作者： Ri Qu Yi-ping Ma Bo Wang Yan-ru Bao []School of Computer Science and Technology Tianjin University Tianjin 300072 China and Tianjin Key Laboratory of Cognitive Computing and Application Tianjin 300072 China

Kruszynska and Kraus [Phys. Rev. A 79, 052304 (2009)] have recently introduced the so-called locally maximally entangleable (LME) states of n qubits which can be maximally entangled with local auxiliary qubits using controlled operations. We characterize the local entangleability of hypergraph states and W states using the approach of Kruszynska and Kraus. We show that (i) all hypergraph states are LME; (ii) hypergraph states and LME states are not equivalent under local unitaries; (iii) a W state of n qubits is not LME; and (iv) no hypergraph state of n qubits can be converted into the W state under local unitary transformations. Moreover, we also present an approach for encoding weighted hypergraphs into LME states.

关键词： QUANTUM entanglement QUBITS UNITARY transformations HYPERGRAPHS QUANTUM states NUCLEAR physics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：