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

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Yu Gu Hengchang Liu Fei Song Baohua Zhao Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China Department of Computer Science University of Virginia Charlottesville VA USA

In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularly challenging since we need to consider both mobility scheme and storage constraint. Previous works suggest to use a simple single-hop routing model in which source nodes can only communication with the sink node directly in those mobile networks. However, we notice that this statement is unsuitable for sensor networks with storage constraint because we prove it is a NP-complete problem under single-hop routing model by reducing the traveling salesman problem (TSP) to it in polynomial time. Hence, we try a different way. First we analyze this problem and give a lifetime upperbound, so whether this upperbound is tight is what we concern mostly. Thus, we first construct a 2-approximation O(n 2 ) algorithm to solve the TSP problem, then a novel data diffusion mechanism is built to achieve this upperbound. We prove that under some reasonable assumptions, our algorithm can output this optimal lifetime.

关键词： Wireless sensor networks Routing Computer networks Constraint optimization Computer science Mobile communication NP-complete problem Traveling salesman problems Polynomials Monitoring

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient TDMA MAC for Wireless Sensor Networks

An Energy-Efficient TDMA MAC for Wireless Sensor Networks

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Rong Gang Bai Yu Gui Qu Yang Guo Bao Hua Zhao Department of Electronic Engineering and Information Science University of Science and Technology Hefei Anhui China Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China

This paper proposes an energy-efficient and collision-free medium access control protocol TDMA-WSN for wireless sensor networks. The protocol is based on time division multiple access (TDMA) principle and reduces energy consumption by avoiding overhearing, collision and idle listening. Nodes in TDMA-WSN build schedules based on information about their neighborhood to determine when they can transmit to their neighbors and when they should listen to the channel or sleep. TDMA-WSN proposes a novel resolution with three-d-hop neighborhood information to avoid collision caused by the two-hop collision-free principle used in some protocols. TDMA-WSN can accelerate passing message by arranging schedule based on routing information from the upper-layer. The simulation results indicate that TDMA-WSN outperforms contention-based protocols (e.g., S-MAC) and scheduling-based protocols (e.g., NAMA) with significant energy savings.

关键词： Energy efficiency Time division multiple access Wireless sensor networks Access protocols Media Access Protocol Wireless application protocol Energy consumption Sleep Energy resolution Acceleration

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach for Signal Transduction Networks Simulation at a Mesoscopic Level

A Novel Approach for Signal Transduction Networks Simulation...

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Chenxi Shao Hongli Deng MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology Hefei Anhui China University of Science and Technology of China Hefei Anhui CN

Signal transduction (ST) networks simulation is important to medical research. However, owing to the complexity of the networks, most methods presented for the simulation are not desirable. Here, based on multi-agent system (MAS), we proposed a novel approach characterized by a multi-level discrete space and mesoscopic molecule-agents for describing ST networks at a mesoscopic level. The space is developed for the representation of the cellular space; it provides a relatively sufficient spatial representation with less computational cost. The mesoscopic molecule-agents model the active components within the networks, which will offer new potentials to overcome the combinatorial complexity as well as make computation feasible. To validate this method, the simulations of a composition/decomposition system and the Mitogen-Activated Protein Kinase (MAPK) signal transduction pathway are implemented. Finally, an in-silico experiment with perturbation in the MAPK pathway is made. The results obtained from the simulations demonstrate the validity of the approach.

关键词： Computational modeling Laboratories Computer networks Computational efficiency Computer simulation Multimedia computing Medical simulation Proteins Diseases Predictive models

来源：评论

学校读者我要写书评

暂无评论

The Frequency-Time Pre-Allocation in Unlicensed Spectrum Based on the Games Learning

The Frequency-Time Pre-Allocation in Unlicensed Spectrum Bas...

引用

International Conference on Cognitive Radio Oriented Wireless Networks and communications

作者： Kun Han Jinlong Li Ping Zhu Xufa Wang Anhui Province Key Laboratory of Software in Computing and Communication Department of Computer Science and Technology University of Science and Technology Hefei China Department of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781424408146;1424408156

In the wireless network of finite spectrum resource, some communication users probably do not allocate the spectrum so that their communication should be delayed. Thus it is necessary to arrange the communication time of the systems when we allocate the communication frequency. We construct a frequency-time spectrum model and propose a joint pre-allocation in a two-dimension space. Through the distributed games learning algorithm, each system could obtain its communication schedule, which makes the bandwidth utilization achieve a quite high level and arranges the global communication time as short as possible. The experiments show that our results have obvious superiorities in both bandwidth utilization and temporal performance relative to other allocation algorithms.

关键词： Frequency Radio spectrum management Resource management Wireless networks Bandwidth Delay Laboratories Computer networks Computer science Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Quality Assessment for Image Coding Based on Matching Pursuit

Quality Assessment for Image Coding Based on Matching Pursui...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Jianxin Pang Rong Zhang Lu Lu Zhengkai Liu MOE-Microsoft Key Laboratory of Multimedia Computing and Communication Department of Electronic Engineering and Information Science University of Science and Technology Hefei Anhui China

Valuation of image coding relies on not only the efficiency of the coding, but also the quality of the coded image. We present a new objective quality assessment metric for image coding based on matching pursuit. First of all, we get the characteristics of the most important structure by projecting the reference image onto the base functions from a dictionary using matching pursuit. Secondly, we process the reference image and gain the structure information of the images in the order of importance, projecting the images onto the structural characteristics. Finally the objective quality score is given by comparing the differences of structure information between the reference and coded images. Experimental results show that the proposed approach is well consistent with the subjective quality score.

关键词： Quality assessment Image coding Matching pursuit algorithms Image quality Humans Layout Image segmentation PSNR Laboratories Multimedia computing

来源：评论

学校读者我要写书评

暂无评论

Immune genetic programming based on register-stack structure

Immune genetic programming based on register-stack structure

引用

Congress on Evolutionary Computation

作者： Zeming Zhang Wenjian Luo Xufa Wang Nature Inspired Computation and Applications Laboratory Department of Computer Science and Technology University of Science and Technology Hefei China Nature Inspired Computation and Applications Laboratory Department of Computer Science and Technology and Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei China

Inspired by biological immune principles, a novel Immune Genetic Programming based on Register-Stack structure (rs-IGP) is proposed in this paper. In rs-IGP, an antigen represents a problem to be solved, and an antibody represents a candidate solution. A flexible and efficient antibody representation based on register-stack structure is designed for rs-IGP. Three populations are adopted in rs-IGP, i.e. the common population, the elitist population and the self set. The immune genetic operators are also developed, including clone operator, recombination operator, mutation operator, hypermutation operator, crossover operator and negative selection operator. The experimental results demonstrate that rs-IGP has better performance.

关键词： Genetic programming Evolutionary computation Genetic mutations Cloning Biological system modeling Problem-solving Genetic algorithms Gene expression

来源：评论

学校读者我要写书评

暂无评论

Study on The Property of Training Samples and Learning Space with Genetic Algorithms

Study on The Property of Training Samples and Learning Space...

引用

ACIS International Conference on software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Jingsong He Jian Tang QianSheng Fang MOE-Microsoft Key Laboratory of Multimedia Computing and Communication Department of Electronic Science and Technology University of Science and Technology China Anhui Institute of Architecture and Industry China

Historically, the empirical risk of a pattern classifier was asked to be made zero, therefor the default property of training samples were limited to a separable ones. Nowadays on the contrary, the major idea of learning classification no longer ask the empirical risk of classifier must be made zero. In this situation, inseparable feature sets may not be detrimental to the performance of classifier. However, so far no experimental studies and analytical results show whether an inseparable feature set is available or not. This paper firstly analyzes the interaction between learning algorithms and feature selection, and gives a proof by both the analytical analysis and experimental studies.

关键词： Genetic algorithms Industrial training Space technology Risk analysis Algorithm design and analysis Law Legal factors Classification tree analysis software engineering Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

ParzenWindows Estimation Using Laplace Kernel: A Novel Parametric Analysis with Information Content

ParzenWindows Estimation Using Laplace Kernel: A Novel Param...

引用

ACIS International Conference on software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Jingsong He Jian Tang QianSheng Fang MOE-Microsoft Key Laboratory of Multimedia Computing and Communication China Department of Electronic Science and Technology University of Science and Technology China Anhui Institute of Architecture and Industry China

Parzen windows estimation is one of the classical non- parametric methods in the field of machine learning and pattern classification, and usually uses Gaussian density function as the kernel. Although the relation between the kernel density estimation (KDE) and low-pass filtering is well known, it is vary difficult to setting the parameters of the other kinds of density functions. This paper proposes a novel method to deal with the parameters of Laplace kernel through measuring the degree of exchanged information among interpolating points. Experimental results showed that the proposed method can improve the performance of Parzen windows significantly.

关键词： Kernel Information analysis Density functional theory Low pass filters Machine learning Frequency estimation Cutoff frequency Bandwidth Artificial intelligence Pattern classification

来源：评论

学校读者我要写书评

暂无评论

Dynamic protocol conformance test method based on local error diagnostic information

引用

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications 2007年第1期30卷 140-144页

作者： Lin, Hua-Hui Zhou, Hao Pan, Quan-Ke Zhao, Bao-Hua Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

To enhance the reliability and the fault coverage of the test results, a local error diagnostic mechanism was introduced into dynamic protocol conformance test, a new dynamic test method was proposed, whose principle and correctness was analyzed on determinate FSM model. The new method took full advantage of the dynamic information generated during test to avoid the incorrect locating of local error. Also a local error diagnostic method was presented on error sub-sequence, which was not restricted to single error assumption and more practical. The experimental results showed that the method can effectively avoid the descending of the test reliability and give better fault coverage.

关键词： Transmission control protocol

来源：评论

学校读者我要写书评

暂无评论

keywords Extracting as Text Chance Discovery

Keywords Extracting as Text Chance Discovery

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Zhenya Zhang Honemei Cheng Schoold of Electronic and Information Engineering Anhui Institute of Architecture and Industry Hefei China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology Hefei China Department of AIA Hefei China

keyword auto-extracting is focused by researchers on information retrieval, data mining, chance discovery and others application. In this paper, new algorithm, CCG(Cognition & Concept Graph, for text chance discovery is presented based on cognition with data depth as measurement. When the keywords in a document are treated as chances in the document, those keywords can be extracted by CGC automatically. In CGC, concepts of a document are represented as maximum connected sub graphs of the basic graph for the document and the cognition of reader/author on a term is weighted with data depth. The correlation for word and concept is defined and the formula for the correlation calculating is given. Experimental results show that keywords extracted by CCG can describe the document and author/reader's cognition much better than keywords extracted by others technologies such as frequency accumulating or key Graph.

关键词： Data mining Cognition Frequency Data engineering Information retrieval Visualization Man machine systems Laboratories Multimedia computing Industrial electronics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：