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

International Conference on BioMedical Engineering and Informatics (BMEI)

作者： Fei Li Wenjian Xu Peng Li XiaoChen Bo Yuxing Peng Department of Computer Science National Laboratory of Parallel & Distributed Processing National University of Defense Technology Changsha China Beijing Institute of Radiation Medicine Beijing China

Due to the existence of systematic bias in the measurements, inter-chip normalization is required before integrated data analysis of multiple microarray datasets. Current inter-chip normalization methods rely on some assumptions, which can rarely be verified by experiments, such as the invariant expression level of housekeeping genes or the stability of statistical data distribution. In this paper, we present a highly verifiable inter-chip normalization method using genetic optimization algorithm, which depends only on a small number of housekeeping genes, and therefore facilitates experimental validation without any accuracy lost.

关键词： Genetic algorithms Gene expression Laboratories Data analysis Optimization methods Genomics Bioinformatics Statistical distributions Probes computer science

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Description Logic-Based Formalism for RBAC

A Dynamic Description Logic-Based Formalism for RBAC

引用

International Conference on computer sciences and Convergence Information technology (ICCIT)

作者： Li Ma Shilong Ma Jianghua Lv Yuefei Sui Department of Computer Science Beihang University Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

ISBN: (纸本)9781424452446

Applications in the open and dynamic environment become more intelligent and complicated. To secure these applications is a big challenge. RBAC model, as a de facto standard in access control field, is widely used in many applications. But the lack of dynamic and formal method to describe RBAC makes the model can't completely adapt to the open and dynamic environment. To solve this problem, we introduce a three level RBAC model which unifies the administrative components, the administrative actions and the regular RBAC components, and also proposes a dynamic description logic, called DDL RBAC , to formalize the three level model. Based on the formal description of RBAC with DDL RBAC , an executable action decision algorithm to guarantee the dynamic consistency of systems is also presented.

关键词： Logic Access control Authorization Data security Information security Mathematical model Permission Information technology computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

Deterministic algorithm for the reordering problem using tile assembly

Deterministic algorithm for the reordering problem using til...

引用

International Conference on Bio-Inspired Computing: Theories and Applications, BICTA

作者： Yufang Huang Jin Xu Zhen Cheng Zhihua Chen Xuncai Zhang Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan Hubei China School of Electronics Engineering and Computer Science Peking University Beijing China

Algorithmic self-assembly, a generalization of crystal growth, has been proposed as a mechanism for the bottom-up fabrication of autonomous DNA computation. In theory, growth can be programmed by designing a set of molecular tiles with binding interactions that enforce assembly rules. There are many interesting applications of the reordering problem in Mathematics, as well as computer sciences. It is a useful primitive operation for computation and construction in the field of science and engineering. It is worth exploring more efficient approach to solve this problem. In this paper, we provide a description of a novel method for the reordering problem by use of the programmable tile assembly model. We propose the thought of block assembly model which takes full advantage of the huge parallelism inherent in the tile assembly. On the basis of the structural property, we delicately devise a rule to produce a long reporter strand which can connect all the inputs of the given problem with the final results. It is proved that this method can be extended to any reordering problem with arbitrary size in theory. The great advantage of our schema is that it only needs a constant number of tile types and in time linear with the size of the input problem to solve any reordering problem.

关键词： Tiles Assembly Self-assembly DNA computing Molecular computing Fabrication Logic Biology computing Laboratories Intelligent control

来源：评论

学校读者我要写书评

暂无评论

Achieving Close-Capacity Performance with Simple Concatenation Scheme on Multiple-Antenna Channels

Achieving Close-Capacity Performance with Simple Concatenati...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Nghi H. Tran Tho Le-Ngoc Tad Matsumoto Ha H. Nguyen Department of Electrical & Computer Engineering McGill University Montreal QUE Canada Information Theory and Signal Processing Laboratory School of Information Science Japan Advanced Institute of Science and Technology Japan Department of Electrical & Computer Engineering University of Saskatchewan Saskatoon SAS Canada

This paper proposes a simple yet capacity-approaching concatenation of a mixture of short memory length convolutional codes and simple rate-1 block code followed by either complex 1-dimensional (1-D) anti-Gray or Gray mapping over multiple antenna channels with quadrature phase-shift keying (QPSK). By interpreting rate-1 code together with 1-D mapping as a multi-D mapping employed over multiple transmit antennas, the error performance is analyzed in two regions, the error-floor and turbo pinch-off regions. In the former one, a tight union bound and design criterion on the asymptotic performance are first derived, which provide an useful tool to predict the error performance. Based on the design criterion, an optimal rate-1 code for each 1-D mapping is then constructed to achieve the best asymptotic performance. In the turbo pinch-off area, by using extrinsic information transfer (EXIT) chart, the most suitable mixed codes are selected for both symmetric and asymmetric antenna setups. It is demonstrated that the simple concatenation scheme can achieve near-capacity. Furthermore, its error performance is comparable to that obtained by using well-designed irregular low-density parity-check (LDPC) and repeat accumulate (RA) codes, and thereby, outperforms a scheme employing a parallel concatenated turbo code.

关键词： Parity check codes Convolutional codes Block codes Phase shift keying Quadrature phase shift keying Transmitting antennas Error analysis Performance analysis Concatenated codes Turbo codes

来源：评论

学校读者我要写书评

暂无评论

Real-time processing of simplex growing algorithm

Real-time processing of simplex growing algorithm

引用

2009 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2009

作者： Wu, Chao-Cheng Chang, Chein-I. Ren, Husen Chang, Yang Lang Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD 21250 United States Department of Electrical Engineering National Chung Hsing University Taichung Taiwan Center for Space and Remote Sensing Research National Central University Jhong-Li Tao-Yuan Taiwan Department of Electrical Engineering National Taipei University of Technology Taipei Taiwan

ISBN: (纸本)9781424433957

Simplex growing algorithm (SGA) was recently developed as an alternative to the N-finder algorithm (N-FINDR) which is shown to be a promising endmember extraction technique. This paper further extends the SGA to a real-time processing algorithm, referred to as real-time SGA (RT SGA) that can effectively address four major issues arising in practical implementation for N-FINDR, (1) use of random initial endmembers which causes inconsistent final results, (2) very high computational complexity which results from an exhaustive search for finding all endmembers simultaneously, (3) requirement of dimensionality reduction because of enormous data volumes to be processed and (4) lack of real-time capability. ©2009 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Single vs. population cell coding: Gaze movement control in target search

Single vs. population cell coding: Gaze movement control in ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Jun Miao Laiyun Qing Lijuan Duan Baixian Zou Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China School of Information Science and Engineering Chinese Academy of Sciences Beijing China College of Computer Science and Technology University of Technology Beijing China Department of Information Science and Technology College of Art and Science Beijing Union Technology Beijing China

Gaze movement plays an important role in human visual search system. In literature, the winner-take-all method is wildly used to simulate the controlling of the gaze movement. The winner-take-all is a type of single-cell coding method, which uses one cell (grandmother cell) or one response to represent an object. However, eye movement is affected by the visual context which includes more than one object in images, especially in target search. Therefore, we propose to use the population coding with more than one response rather than the single-cell coding on gaze movement control. The proposed method is supported by the theoretical analysis and experiments on a real image database which show the population-cell-coding improves the target locating accuracy by 44.4% only at the cost of coding 22.4% more information than that of single-cell-coding.

关键词： Humans Image coding Image databases Costs Information science Educational institutions Biological neural networks Control systems Image analysis Information analysis

来源：评论

学校读者我要写书评

暂无评论

High capacity reversible data hiding based on histogram shifting and non-local means

High capacity reversible data hiding based on histogram shif...

引用

International Workshop on Local and Non-Local Approximation in Image processing, LNLA

作者： V. Conotter G. Boato M. Carli K. Egiazarian Department of Information Engineering and Computer Science University of Trento Trento Italy Applied Electronics Department University of Roma TRE Rome Italy Institute of Signal Processing Tampere University of Technology Tampere Finland

In this paper we propose a new reversible data hiding framework which applies prediction in the embedding procedure by suitably modifying the prediction errors and exploits non-local similarity in the prediction phase to estimate the to-be-predicted value. This results in a scheme which can be jointly used with different predictors and allows reaching high embedding capacity while preserving a high image quality. Extensive simulations demonstrate the effectiveness of the proposed approach.

关键词： Data encapsulation Histograms

来源：评论

学校读者我要写书评

暂无评论

Model for Predictive Analysis of Heat Absorbed by Oxalic Acid Solution Relative to the Solution Temperature during Leaching of Iron Oxide Ore

引用

Journal of Minerals and Materials Characterization and Engineering 2009年第7期8卷 531-539页

作者： C. I. Nwoye C. S. Nwobodo C. Nlebedim U.C. Nwoye R. A. Umana G. C. Obasi 1Department of Materials and Metallurgical Engineering Federal University of Technology Owerri Nigeria. Data Processing Modelling and Simulation Unit Weatherford Nig. Ltd. Port-Harcourt Nigeria. Department of Material Science Aveiro University Portugal. Department of Material Science University of Cadiff Wales United Kingdom Department of Materials and Metallurgical Engineering Federal University of Technology Owerri Nigeria. Department of Mathematics and Computer Science Federal University of TechnologyOwerri Nigeria.

来源：评论

学校读者我要写书评

暂无评论

Empirical Probability Functions Derived from Dihedral Angles for Protein Structure Prediction

Empirical Probability Functions Derived from Dihedral Angles...

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Qiwen Dong Xin Geng Shuigeng Zhou Jihong Guan Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China Department of Computer Science and Technology University of Tongji Shanghai China Fudan University Shanghai Shanghai CN

The development and evaluation of functions for protein energetics is an important part of current research aiming at understanding protein structures and functions. Knowledgebase mean force potentials are derived from statistical analysis of interacting groups in experimentally determined protein structures. Current knowledge-based mean force potentials are based on the inverse Boltzmannpsilas law, which calculate the ratio of the observed probability with respect to the probability of the reference state. In this study, a general probability framework is presented with the aim to develop novel energy scores. A class of empirical probability functions is derived by decomposing the joint probability of backbone dihedral angles and amino acid sequences. The neighboring interactions are modeled by conditional probabilities. Such probability functions are based on the strict probability theory and some suitable suppositions for convenience of computation. Experiments are performed on several well-constructed decoy sets and the results show that the empirical probability functions presented here outperform previous statistical potentials based on dihedral angles. Such probability functions will be helpful for protein structure prediction,model quality evaluation, transcription factors identification and other challenging problems in computational biology.

关键词： Probability Amino acids Protein engineering Spine Sequences Bioinformatics computer science Biological system modeling Computational biology Bonding

来源：评论

学校读者我要写书评

暂无评论

Recent development of the HMM-based speech synthesis system (HTS)

Recent development of the HMM-based speech synthesis system ...

引用

Asia-Pacific Signal and Information processing Association 2009 Annual Summit and Conference, APSIPA ASC 2009

作者： Zen, Heiga Oura, Keiichiro Nose, Takashi Yamagishi, Junichi Sako, Shinji Toda, Tomoki Masuko, Takashi Black, Alan W. Tokuda, Keiichi Department of Computer Science Nagoya Institute of Technology Nagoya 466-8555 Japan Department of Information Processing Interdisciplinary Tokyo Institute of Technology Yokohama 226-8502 Japan Centre for Speech Technology Research University of Edinburgh Edinburgh EH8-9LW United Kingdom Graduate School of Information Science Nara Institute of Science and Technology Ikoma 630-0192 Japan Language Technologies Institute Carnegie Mellon University Pittsburgh PA 15213 United States Cambridge Research Laboratory Toshiba Research Europe Limited Cambridge CB4 0GZ United Kingdom Corporate Research and Development Center Toshiba Corporation Kawasaki 212-8582 Japan

A statistical parametric approach to speech synthesis based HMMs has grown in popularity over the last few years. In this approach, spectrum, excitation, and duration of speech are simultaneously modeled by context-dependent HMMs, and speech waveforms are generated from the HMMs themselves. Since December 2002, we have publicly released an opensource software toolkit named "HMM-based speech synthesis system (HTS)" to provide a research and development toolkit for statistical parametric speech synthesis. This paper describes recent developments of HTS in detail, as well as future release plans.

关键词： Speech synthesis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：