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

IEEE Asia-Pacific Conference on Services Computing (APSCC)

作者： Hao Liu Jianxun Chen Processing and Real-time Industrial System Hubei Province Key Laboratory of Intelligent Information Wuhan China School of Computer Science and Technology Wuhan University of Science and Technology Wuhan China

Software testing is one of the most important techniques used to assure the quality of software service. An intricate issue in software testing is the determination of test orders for the integration test of classes, known as the class integration and test order (CITO) problem. The determination of such order has an influence on the cost of created stubs for classes, which is an error-prone and costly process. To minimize the cost of stubbing, this paper describes a coupling measure technique to estimate the complexity of each test stub, and presents a graph-based heuristic algorithm of removing node with the highest weights to break cycles for minimizing overall complexity of stubbing. Also, an adjacency matrix and depth-first search for finding all the paths is presented. Simulation experimental results show that the overall test stub complexity decreased which greatly improves test efficiency and reduces the test cost to some extent compared with others.

关键词： Couplings Complexity theory Testing Software Weight measurement Genetic algorithms Object oriented modeling

来源：评论

学校读者我要写书评

暂无评论

A novel plasmonic nanosensor based on electro-magnetically induced transparency of waveguide resonator systems

A novel plasmonic nanosensor based on electro-magnetically i...

引用

International Conference on Numerical Simulation of Optoelectronic Devices, (NUSOD)

作者： B. Ni X. Y. Chen D. Y. Xiong H. Liu G. H. Hua J. H. Chang J. H. Zhang H. Zhou Jiangsu Key Laboratory of Meteorological Observation and Information Processing Nanjing University of Information Science & Technology Nanjing China Laboratory of Advanced Material Fudan University Shanghai China Key Laboratory of Polar Materials and Devices East China Normal University Shanghai People's Republic of China

We propose a plasmonic refractive index-sensitive nanosensor based on the electromagnetically induced transparency (EIT) of waveguide resonator systems. The structure consists of one tooth-shaped cavity as well as the bus and stub metal-insulator-metal waveguides. By adjusting the structural geometry, it is demonstrated that the controllable transmission of EIT response can be obtained with the finite-difference-time-domain simulations. It is found that the transmission spectra dip can be strongly controlled by changing the refractive index filled in the stub waveguide. The calculated results show that the sensitivity of the plasmonic nanosensor is 733 nm/RIU.

关键词： Plasmons Optical waveguides Cavity resonators Nanobioscience Optical resonators Tomography

来源：评论

学校读者我要写书评

暂无评论

A Flexible and Efficient Algorithm for Regularized Marginal Fisher Analysis

A Flexible and Efficient Algorithm for Regularized Marginal ...

引用

International Joint Conference on Neural Networks

作者： Jinrong He Lixin Ding Lei Jiang Li Huang The School of Computer State Key Laboratory of Software Engineering Wuhan University Wuhan China State Key Laboratory of Software Engineering Wuhan University Wuhan China Key Laboratory of Knowledge Processing and Networked Manufacture Hunan University of Science and Technology Xiangtan China The School of Computer & Information Technology Shanxi University Shanxi China

Marginal Fisher analysis (MFA) is a well-known linear dimensionality reduction method. However, MFA does not utilize the local diversity information of the training data, which will degrade its performance. In order to enhance the discriminant power of MFA, this paper considers introducing local variation quantity to enlarge the distances between local neighborhood embeddings and proposes a flexible and efficient implementation of MFA (F-MFA) within the regularization framework. Therefore, the discriminant structure and diversity of data are preserved in low-dimensional subspace. Computationally, F-MFA is formulated as a trace differential optimization problem which can completely avoids the singularity problem as it exists in MFA. Further, an efficient algorithm is developed for implementing F-MFA via QR-decomposition. Experimental results on four face data sets demonstrate the effectiveness of our approach.

关键词： Algorithm design and analysis Symmetric matrices Linear programming Manifolds Eigenvalues and eigenfunctions Educational institutions TV

来源：评论

学校读者我要写书评

暂无评论

Copyright protection in named data networking

引用

International Conference on Wireless Communications and Signal processing (WCSP)

作者： Xiaobin Tan Zifei Zhou Cliff Zou Yukun Niu Xin Chen CAS Key Laboratory of Technology in Geo-spatial Information Processing and Application System University of Science and Technology of China China Department of Electrical Engineering and Computer Science University of Central Florida USA

As a new Internet architecture, Named Data Networking (NDN) decouples location from the data itself to achieve security, scalability, and mobility. Although router-side data caching used in NDN reduces data acquisition delay, it introduces a new copyright protection challenge: how to prevent unauthorized users to retrieve data cached in routers that are out of the control of its publisher? Current approaches that rely on a common encryption key among authorized users cannot protect copyright well since if one authorized user secretly leaks the key, we cannot tell who has leaked the key out. In this paper, we present a split-based scheme to solve this copyright protection problem for large-sized data. The data is split into a large part that could be cached in routers for all users to retrieve, and a small part that is unique for each authorized user. This scheme exploits the fact that in the bit-wise OR operation, both bit 0 and bit 1 can OR with 1 to generate the same result of bit 1. The analysis of our scheme shows that it has a good performance in terms of copyright protection, data retrieval efficiency, and overhead.

关键词： Copyright protection Encryption Watermarking Internet computer architecture Receivers

来源：评论

学校读者我要写书评

暂无评论

Obtaining a W State from a Greenberger-Horne-Zeilinger State via Stochastic Local Operations and Classical Communication with a Rate Approaching Unity

引用

Physical Review Letters 2014年第16期112卷 160401-160401页

作者： Nengkun Yu Cheng Guo Runyao Duan 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 Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney (UTS) New South Wales 2007 Australia UTS-AMSS Joint Research Laboratory for Quantum Computation and Quantum Information Processing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China

We introduce a notion of the entanglement transformation rate to characterize the asymptotic comparability of two multipartite pure entangled states under stochastic local operations and classical communication (SLOCC). For two well known SLOCC inequivalent three-qubit states |GHZ⟩=(1/2)(|000⟩+|111⟩) and |W⟩=(1/3)(|100⟩+|010⟩+|001⟩), we show that the entanglement transformation rate from |GHZ⟩ to |W⟩ is exactly 1. That means that we can obtain one copy of the W state from one copy of the Greenberg-Horne-Zeilinger (GHZ) state by SLOCC, asymptotically. We then apply similar techniques to obtain a lower bound on the entanglement transformation rates from an N-partite GHZ state to a class of Dicke states, and prove the tightness of this bound for some special cases which naturally generalize the |W⟩ state. A new lower bound on the tensor rank of the matrix permanent is also obtained by evaluating the tensor rank of Dicke states.

关键词： STOCHASTIC analysis TENSOR algebra TRANSFORMATION rate SCALAR field theory QUANTUM information theory

来源：评论

学校读者我要写书评

暂无评论

Expectation propagation based iterative group wise detection for large-scale multiuser MIMO-OFDM systems

Expectation propagation based iterative group wise detection...

引用

2014 IEEE Wireless Communications and Networking Conference, WCNC 2014

作者： Wu, Sheng Kuang, Linling Ni, Zuyao Lu, Jianhua Huang, Defeng David Guo, Qinghua Department of Electronic Engineering Tsinghua University Beijing China Tsinghua Space Center Tsinghua University Beijing China Research Institute of Information Technology Tsinghua University Beijing China Shenzhen Key Laboratory of Wireless Broadband Communication and Signal Processing Shenzhen China School of Electrical Electronic and Computer Engineering University of Western Australia Australia School of Electrical Computer and Telecommunications Engineering University of Wollongong Australia

ISBN: (纸本)9781479930838

For the spatially correlated multiuser MIMO-OFDM channels, the conventional iterative MMSE-SIC detection suffers from a considerable performance loss. In this paper, we use the factor graph framework to design robust detection algorithms by clustering a group of symbols to combat the spatial correlation and using the principle of expectation propagation to improve message passing. Furthermore, as the complexity of detection becomes one of the issues in the design of large-scale multiuser MIMO-OFDM systems, we propose a low-complexity approximate message-passing algorithm by opening the channel transition node, which eliminates the expensive matrix inversions involved in the MMSE-SIC based algorithms. Finally, numerical results are presented to verify the proposed algorithms. © 2014 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Exemplar-based linear discriminant analysis for robust object tracking

Exemplar-based linear discriminant analysis for robust objec...

引用

IEEE International Conference on Image processing

作者： Changxin Gao Feifei Chen Jin-Gang Yu Rui Huang Nong Sang National Key Laboratory of Science and Technology on Multispectral Information Processing Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering University of Nebraska-Lincoln Lincoln NE USA

ISBN: (纸本)9781479957521

Tracking-by-detection has become an attractive tracking technique, which treats tracking as a category detection problem. However, the task in tracking is to search for a specific object, rather than an object category as in detection. In this paper, we propose a novel tracking framework based on exemplar detector rather than category detector. The proposed tracker is an ensemble of exemplar-based linear discriminant analysis (ELDA) detectors. Each detector is quite specific and discriminative, because it is trained by a single object instance and massive negatives. To improve its adaptivity, we update both object and background models. Experimental results on several challenging video sequences demonstrate the effectiveness and robustness of our tracking algorithm.

关键词： Adaptation models Detectors Visualization Object detection Linear discriminant analysis Robustness Object tracking

来源：评论

学校读者我要写书评

暂无评论

Necessity of Oversampling Theorem for Affine Frames

引用

Journal of Applied Mathematics and Physics 2014年第2期2卷 18-23页

作者： Qiquan Fang Xianliang Shi Weicai Li College of Mathematics and Computer Science Key Laboratory of High Performance Computing and Stochastic Information Processing (Ministry of Education of China) Hunan Normal University Changsha China Department of Mathematics Zhejiang University of Science and Technology Hangzhou China

In this paper we prove that n is relatively prime to a which is also necessary.

关键词： Affine Frame Oversampling

来源：评论

学校读者我要写书评

暂无评论

ProvenanceLens: Service provenance management in the cloud

ProvenanceLens: Service provenance management in the cloud

引用

International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom)

作者： Tao Li Ling Liu Xiaolong Zhang Kai Xu Chao Yang Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System School of Computer Wuhan University of Science and Technology School of Computer Science. Georgia Institute of Technology Atlanta GA USA Computer Science and Information Engineering Hubei University Wuhan China

ISBN: (纸本)9781479953288

Service provenance can be defined as a profile of service execution history. Queries of service provenance data can answer questions such as when and by whom a server is invoked? which services operate on this data? What might be the root cause for the service failure? Most of the organizations today collect and manage their own service provenance in order to trace service execution failures, locate service bottlenecks, guide resource allocation, detect and prevent abnormal behaviors. As services become ubiquitous, there is an increasing demand for proving service provenance management as a service. This paper describes ProvenanceLens, a two-tier service provenance management framework. The top tier is the service provenance capturing and storage subsystem and the next tier provides analysis and inference capabilities of service provenance data, which are value-added functionality for service health diagnosis and remedy. Both tiers are built based on the service provenance data model, an essential and core component of ProvenanceLens, which categorizes all service provenance data into three broad categories: basic provenance, composite provenance and application provenance. In addition, ProvenanceLens provides a suite of basic provenance operations, such as select, trace, aggregate. The basic provenance data is collected through a light-weight service provenance capturing subsystem that monitors service execution workflows, collects service profiling data, encapsulates service invocation dependencies. The composite and application provenance data are aggregated through a selection of provenance operations. We demonstrate the effectiveness of ProvenanceLens using a real world educational service currently in operation for a dozen universities in China.

关键词： Silicon Analytical models Data models Computational modeling

来源：评论

学校读者我要写书评

暂无评论

On the theoretical properties of bipartition dissimilarity measure

引用

computer Modelling and New Technologies 2014年第12期18卷 322-327页

作者： Li, Shuguang Chen, Shuying Cui, Mengtian Key Laboratory of Intelligent Information Processing in Universities of Shandong Shandong Institute of Business and Technology Yantai China College of Computer Science and Technology Shandong Institute of Business and Technology Yantai China School of Computer Science and Technology Southwest University for Nationalities Chengdu China

Bipartition dissimilarity is a new measure introduced by Alix Boc et al. They proposed an algorithm for inferring horizontal gene transfer events which can rely on different optimization criteria. Simulation results suggested that the strategy based on bipartition dissimilarity provided better results than those based on other three existing tree comparison indices. However, no theoretical analysis on it has been conducted since then in the literature. The present paper reports some useful new results for this measure. The theoretical properties studied include minimum positive value, neighborhood, and local modifications.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：