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

9th International Conference on Distributed Computing and Internet Technology, ICDCIT 2013

作者： Dian, S. Moses Ramadoss, B. Department of Computer Science and Engineering National Institute of Technology Tiruchirapalli 620015 Tamilnadu India Department of Computer Applications National Institute of Technology Tiruchirapalli 620015 Tamilnadu India

ISBN: (纸本)9783642360701

P2P networking has emerged as a successful Internet based computing paradigm, which can provide an inexpensive platform for distributed computing. The success of P2P network is directly affected by the selfish behaviours of the peers of the P2P network. To solve this issue, we propose a modified grade based incentive mechanism to reward the cooperating peers and to encourage the free rider to become a good contributor based on the peer contribution to network function. Further if the free rider continues to act against the principles of P2P network, it will lose its credit points and eventually it will be eliminated from the P2P network. It also addresses the issue of starvation and introduces the mechanism of trading of incentives to avoid starvation. We design a simulation to verify this approach and the results shows the improvement of fairness in resource sharing and robustness in P2P network. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

LOG-grid based off-line signature verification system

LOG-grid based off-line signature verification system

引用

4th International Conference on Signal and Image Processing 2012, ICSIP 2012

作者： Shekar, B.H. Bharathi, R.K. Department of Computer Science Mangalore University Mysore Karnataka India Department of Master of Computer Applications S. J. College of Engineering Mysore Karnataka India

ISBN: (纸本)9788132209997

This paper presents a LOG-processed local feature based off-line signature verification system. The proposed approach has three major phases: Preprocessing, Feature extraction and Classification. The contour of the signature is divided into equal grids of size M M and the 4-directional chain code histogram of each grid is extracted, thus fed into laplacian of Gaussian filter to enhance the feature representing the signature image. These enhanced feature vectors are fed as an input to the multi-layer-perceptrons (MLP) for training purpose. The MLP is used as a recognition tool and trained with different number of training samples including genuine, skilled and random forgeries and hence tested. This model was successfully tested on two datasets, namely, CEDAR, a publicly available English signature dataset and MUKOS, a regional language (Kannada) dataset and compared with well-known approaches to exhibit the performance of the proposed approach. © 2013 Springer.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Global network alignment in the context of aging 13

Global network alignment in the context of aging

引用

2013 4th ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013

作者： Milenković, Tijana Zhao, Han Faisal, Fazle E. Department of Computer Science and Engineering Interdisciplinary Center for Network Science and Applications University of Notre Dame Notre Dame IN 46556 United States Department of Computer Science and Engineering University of Notre Dame Notre Dame IN 46556 United States Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9781450324342

Analogous to sequence alignment, network alignment (NA) can be used to transfer biological knowledge across species between conserved network regions. NA faces two algorithmic challenges: 1) Which cost function to use to capture "similarities" between nodes in different networks? 2)Which alignment strategy to use to rapidly identify "high-scoring" alignments from all possible alignments? We "break down" existing state-of-the-art methods that use both different cost functions and different alignment strategies to evaluate each combination of their cost functions and alignment strategies. We find that a combination of the cost function of one method and the alignment strategy of another method beats the existing methods. Hence, we propose this combination as a novel superior NA method. Then, since human aging is hard to study experimentally due to long lifespan, we use NA to transfer aging-related knowledge from well annotated model species to poorly annotated human between aligned network regions. By doing so, we produce novel agingrelated information, which complements currently available information about aging that has been obtained mainly by sequence alignment, especially in human. To our knowledge, we are the first to use NA to learn more about aging. Copyright © 2007 by the Association for Computing Machinery.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Q-grams suffix type single pattern string matching algorithms

Q-grams suffix type single pattern string matching algorithm...

引用

2012 International Conference on Information Technology and Software engineering, ITSE 2012

作者： Zhang, Zhiwei Liu, Lijun Fan, Hongbo Huang, Qingsong Department of Computer Science Kunming University of Science and Technology Kunming China Yunnan Key Laboratory of Computer Technology Applications Kunming University of Science and Technology Kunming China Department of Biomedical Engineering Kunming University of Science and Technology Kunming China

ISBN: (纸本)9783642345210

String Matching is one of the most basic problems in computer science. This paper presented a general research method for calculating the jump distance of q-grams bad-char rule which is named figure example method for q-grams suffix type algorithms. Using this method, we applied q-grams on TVSBS and gained TVSBSq. And by fully utilizing the information of characters in the sliding window, we presented a serial of algorithms called FQ-Hash. Experimental results indicated that above algorithms is faster than TVSBS and they are faster than other known algorithms in some cases on our platform. © 2013 Springer-Verlag.

关键词： String searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Effective web-service discovery using K-means clustering

Effective web-service discovery using K-means clustering

引用

9th International Conference on Distributed Computing and Internet Technology, ICDCIT 2013

作者： Vijayan, A. Santhana Balasundaram, S.R. Department of Computer Science and Engineering National Institute of Technology Tiruchirappalli 620 015 Tamilnadu India Department of Computer Applications National Institute of Technology Tiruchirappalli 620 015 Tamilnadu India

ISBN: (纸本)9783642360701

Web Services are proving to be a convenient way to integrate distributed software applications. As service-oriented architecture is getting popular, vast numbers of web services have been developed all over the world. But it is a challenging task to find the relevant or similar web services using web services registry such as UDDI. Current UDDI search uses keywords from web service and company information in its registry to retrieve web services. This information cannot fully capture user's needs and may miss out on potential matches. Underlying functionality and semantics of web services need to be considered. In this study, we explore the resemblance among web services using WSDL document features such as WSDL Content and Web Services name. We compute the similarity of web services and use this data to generate clusters using K-means clustering algorithm. This approach has really yielded good results and can be efficiently used by any web service search engine to retrieve similar or related web services. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： WSDL

来源：评论

学校读者我要写书评

暂无评论

Chiral Metafoils for Terahertz Broadband High-Contrast Flexible Circular Polarizers

引用

Physical Review Applied 2014年第1期2卷 014005-014005页

作者： Jianfeng Wu Binghao Ng Haidong Liang Mark B. H. Breese Minghui Hong Stefan A. Maier Herbert O. Moser Ortwin Hess Department of Electrical and Computer Engineering National University of Singapore 4 Engineering Drive 3 117576 Singapore Singapore Department of Physics Center for Ion Beam Applications (CIBA) National University of Singapore 2 Science Drive 3 117542 Singapore Singapore The Blackett Laboratory Department of Physics Imperial College London London SW7 2AZ United Kingdom Singapore Synchrotron Light Source (SSLS) National University of Singapore 4 Engineering Drive 3 117576 Singapore Singapore Karlsruhe Institute of Technology (KIT) Institute of Microstructure Technology (IMT) Postfach 3640 D-76021 Karlsruhe Germany

Metamaterial concepts have opened the door to high-optical anisotropy beyond levels of naturally occurring materials but usually with limited spectral bandwidth. Here, we report on the design, realization, and experimental and numerical characterization of broadband chiral metafoils exhibiting at the same time exceptionally high-contrast circular polarization in the THz range. We demonstrate that the observed chirality is achieved by a simple modification of the structure of well-established metafoils, namely, through a shift of interconnecting lines by half a unit cell length between each row. The bandwidth of the observed circular-polarization-selective response is demonstrated to be up to about one octave at a center frequency of 2.4 THz and the ratio of the transmission of oppositely circularly polarized radiation is shown to reach about 700%, with the maximum transmittance being approximately 70%. Although implemented here at THz frequencies, broadband chiral metafoils may be extended to higher infrared and optical frequencies by hot embossing or nanoimprinting. They may be used as circular polarizers and beam stops in THz optical and infrared systems.

关键词： Circular polarization

来源：评论

学校读者我要写书评

暂无评论

Dynamic networks reveal key players in aging 13

Dynamic networks reveal key players in aging

引用

2013 4th ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013

作者： Faisal, Fazle E. Milenković, Tijana Department of Computer Science and Engineering Interdisciplinary Center for Network Science and Applications ECK Institute for Global Health University of Notre Dame Notre Dame IN 46556 United States

ISBN: (纸本)9781450324342

Motivation: Since susceptibility to diseases increases with age, studying aging gains importance. Analyses of gene expression or sequence data, which have been indispensable for investigating aging, have been limited to studying genes and their protein products in isolation, ignoring their connectivities. However, proteins function by interacting with other proteins, and this is exactly what biological networks (BNs) model. Thus, analyzing the proteins' BN topologies could contribute to understanding of aging. Current methods for analyzing systems-level BNs deal with their static representations, even though cells are dynamic. For this reason, and because different data types can give complementary biological insights, we integrate current static BNs with aging-related gene expression data to construct dynamic, age-specific BNs. Then, we apply sensitive measures of topology to the dynamic BNs to study cellular changes with age. Results: While global BN topologies do not significantly change with age, local topologies of a number of genes do. We predict such genes as aging-related. We demonstrate credibility of our aging-related predictions by: 1) observing significant overlap between the predictions and "ground truth" aging-related genes;2) showing that our predictions group by functions and diseases that are different than functions and diseases of genes that we do not predict as aging- related;3) observing significant overlap between functions and diseases that are enriched in our predictions and those that are enriched in "ground truth" aging-related data;4) providing evidence that diseases which are enriched in our predictions are linked to human aging;and 5) validating our predictions in the literature. Copyright © 2007 by the Association for Computing Machinery.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Parallel Algorithm for Solving the System of Simultaneous Linear Equations by Jacobi Method on Extended Fibonacci Cubes

Parallel Algorithm for Solving the System of Simultaneous Li...

引用

IEEE International Advance Computing Conference

作者： Alok Ranjan Tripathy B. N. B. Ray Department of Computer Science & Engineering College of Engineering Bhubaneswar Department of Computer Science and Applications Utkal University

ISBN: (纸本)9781467345279

This work suggests parallel algorithms for solving a sparse system of N - linear equations in N - unknowns by Jacobi method on Extended Fibonacci Cube EFC_1(n) [3]. Where n is the degree of EFC_1(n) and N is the number of processors of EFC_1(n). Two parallel versions of the algorithm are discussed. The single pass of the first algorithm involves 2 (N-1) data communications in N steps. Whereas the second algorithm achieves the same number of data communications in N/2 + logN steps. Further each pass of both algorithms have 3N/2 + 1 additions, N/2 - 1 subtractions, N - 1 multiplications and N divisions.

关键词： Jacobi Method Hamiltonian cycle Extended Fibonacci Cube Parallel Algorithm

来源：评论

学校读者我要写书评

暂无评论

Near-Lossless Compression Based on a Full Range Gaussian Markov Random Field Model for 2D Monochrome Images

引用

Journal of Signal and Information Processing 2013年第1期4卷 10-23页

作者： K. Seetharaman V. Rekha Department of Computer Applications Mailam Engineering College Mailam India Department of Computer Science and Engineering Annamalai University Annamalai Nagar India

This paper proposes a Full Range Gaussian Markov Random Field (FRGMRF) model for monochrome image compression, where images are assumed to be Gaussian Markov Random Field. The parameters of the model are estimated based on Bayesian approach. The advantage of the proposed model is that it adapts itself according to the nature of the data (image) because it has infinite structure with a finite number of parameters, and so completely avoids the problem of order determination. The proposed model is fitted to reconstruct the image with the use of estimated parameters and seed values. The residual image is computed from the original and the reconstructed images. The proposed FRGMRF model is redefined as an error model to compress the residual image to obtain better quality of the reconstructed image. The parameters of the error model are estimated by employing the Metropolis-Hastings (M-H) algorithm. Then, the error model is fitted to reconstruct the compressed residual image. The Arithmetic coding is employed on seed values, average of the residuals and the model coefficients of both the input and residual images to achieve higher compression ratio. Different types of textured and structured images are considered for experiment to illustrate the efficiency of the proposed model. The results obtained by the FRGMRF model are compared to the JPEG2000. The proposed approach yields higher compression ratio than the JPEG whereas it produces Peak Signal to Noise Ratio (PSNR) with little higher than the JPEG, which is negligible.

关键词： Image Compression FRGMRF Model Bayesian Approach Seed Values Error Model

来源：评论

学校读者我要写书评

暂无评论

Prediction of customer buying nature from frequent itemsets generation using quinemccluskey method 4

Prediction of customer buying nature from frequent itemsets ...

引用

IET Chennai 4th International Conference on Sustainable Energy and Intelligent Systems, SEISCON 2013

作者： Krishnamurthy, M. Rajalakshmi, E. Baskaran, R. Kannan, A. Dept. of Computer Science and Engineering KCG College of Technology Chennai Tamil Nadu India Dept. of Master of Computer Applications Sri Venkateswara College of Engineering Pennalur Sriperumbudur602 105 India Department of Computer Science and Engineering Anna University Chennai600 025 India Department of Information Science and Technology Anna University Chennai600 025 India

ISBN: (纸本)9781785610301

Finding frequent itemsets is one of the most important fields of data mining and also finding the rules associated with the itemset is another important ground in association rule mining. The process of finding new techniques to reduce candidate generation in order to generate frequent itemsets efficiently is a challenging task and generating rules in order to know the purchase behaviour of the customer to improve the business. In this paper, an efficient and optimized algorithm called Customer Purchase Behaviour (CPB) has been introduced for finding frequent itemsets using minimum scans, time and memory and the rules are generated. The subset invention process is used for the generation of frequent itemsets which reduces the intermediate tables. This approach reduces main memory requirement since it considers only a small cluster at a time. The purchase behaviour of the customer can be easily judged by using the Quine-McCluskey method. This algorithm is very efficient because of redundancy elimination and rule generation then compared with Apriori, Cluster-Based Bit Vector Mining for Association Rule Generation (CBVAR) and Improved Cluster-based Bit vector mining algorithm for Frequent Itemsets Generation (ICBV).

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：