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

Approximate String Search in Large Spatial Database

Procedia computer science 2015年 47卷 92-100页

作者： M. TamilSelvi R. Renuga PG Scholar Department of Computer Science and Engineering Coimbatore Institute of Technology Coimbatore - 641014 India Associate Professor Department of Computer Science and Engineering Coimbatore Institute of Technology Coimbatore - 641014 India

Applications are featured with both text and location information, which leads to a search like: spatial approximate string search (SAS). Mainly four issues are identified in the general area of SAS. They are: (i) Spatial approximate string search in Euclidean space (E sas ); (ii) Spatial approximate string search on road networks (R SAS ); (iii) Selectivity Estimation for E sas Range Queries; (iv) Multi-Approximate-Keyword Routing query on road networks. For efficiently answering spatial approximate string queries in Euclidean space, SAS propose a novel index structure, IR 2 -tree, which is based on the R-tree augmented with the min-wise signature and the linear hashing technique. Extensive experiments on large real data sets demonstrate the efficiency and effectiveness of the proposed approach.

关键词： Spatial Database Spatial Queries Min-wise signature Range Query Road Networks

来源：评论

学校读者我要写书评

暂无评论

Proposal to Provide Security in MANET's DSRRouting Protocol

引用

Procedia computer science 2015年 48卷 440-446页

作者： Milan Kumar Dholey G.P. Biswas Assistant Professor Computer Science & Engineering Hooghly Engineering & Technology College Hooghly 712103 India Computer Science & Engineering Indian School of Mines Dhanbad 826004 India

Mobile Ad-hoc network (MANET) is infrastructure less, self-organizing bandwidth constraint on demand wireless network. MANET is a multi-hop wireless network therefore, needs an efficient routing protocol to transmit data packet from source to destination. MANET routing protocol can be divided as proactive, reactive and hybrid. In an ad-hoc network a node cannot identify the nodes that are beyond its radio range. The nodes in MANET are movable so, a fixed path cannot be defined in between source to a destination. In MANET's reactive routing protocol, like Dynamic Source Routing (DSR), a source node locate the destination before data transmission take place by broadcasting/flooding route request (RREQ) control message and establishes the path after receiving route reply (RREP) control message. During route discovery using DSR routing protocol a malicious node may enter in between source-destination path as an intermediate node or eavesdrop to the source by sending RREP control message before original RREPs (multiple path exists between source to destination) reach to the source with unexpected path information. As a result, without knowing anything source may deliver data packet to a different destination. In this paper, we identified the issues and proposed a solution to prevent to enter the malicious node in between source-destination path. In our proposal, initially we formed a group by considering neighbour nodes of an individual node from the original network and presented the way of communication by the group member using Diffie-Hellman group key (GDH) management scheme in the network through our proposed algorithm. Our proposed algorithm will prevent a malicious node to enter in between source-destination path during route discovery using DSR routing protocol. Further our technique prevents to gainaccess to any node in the network except the group member hence malicious node cannot identify the source to sent RREP control message with wrong path information.

关键词： MANET Routing Protocol DSR GDH

来源：评论

学校读者我要写书评

暂无评论

Automatic Characterization of Benign and Malignant Masses in Mammography

引用

Procedia computer science 2015年 46卷 1762-1769页

作者： K. Vaidehi T.S. Subashini Research Scholar Department of Computer Science and Engineering Faculty of Engineering and Technology Annamalai University India Associate Professor Department of Computer Science and EngineeringFaculty of Engineering and Technology Annamalai University India

The paper aims to develop an automated breast mass characterization system for assisting the radiologist to analyze the digital mammograms. Mammographic Image Analysis Society (MIAS) database images are used in this study. Fuzzy C-means technique is used to segment the mass region from the input image. GLCM texture features namely contrast, correlation, energy and homogeneity are obtained from the region of interest. The texture features extracted from gray level co-occurrence matrix (GLCM) are computed at distance d=1 and θ=0 o , 45 o , 90 o , 135 o . These with three classifiers namely adaboost, back propagation neural network and sparse representation classifiers are used for characterizing the region containing either benign mass or malignant mass. The experimental results show the SRC classifier is more effective with an accuracy of 93.75% and with the Mathew's correlation coefficient (MCC) of 87.35%.

关键词： Benign and malignant mass classification Fuzzy C-Means clustering Sparse representation classifier Mathews correlation coefficient.

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Parallel Computing Using Cuda for Chemical Process

引用

Procedia computer science 2015年 47卷 237-246页

作者： S. Sosutha D. Mohana PG Scholar Department of Computer Science and EngineeringCoimbatore Institute of Technology Coimbatore and 641014 India Associate Professor Department of Computer Science and Engineering Coimbatore Institute of Technology Coimbatore and 641014 India

CUDA ( Compute Unified Device Architecture ) is a parallel computing platform and programming model created by NVIDIA and implemented by the graphics processing units (GPUs) that they produce. Using CUDA, the GPUs can be used for general purpose processing which involves parallel computation. CUDA has been used to accelerate non-graphical applications in computational biology, cryptography and other fields by an order of magnitude or more. Chemical processes need validation of their experimental data. It was found that Chemical process could become one such application where CUDA can be efficiently used. These validations of Chemical processes normally involve calculation of many coefficients. The chemical process that has been chosen for parallelizing is Heat Transfer process. This process involves calculation of coefficients for multiple iterations. As each of these iterations is independent of one another, CUDA was used to parallelize the calculation process. The execution time analysis shows that though CPU outperforms GPU when the numbers of iterations are less, when the number of iterations increase the GPU outperforms CPU greatly.

关键词： Heterogeneous Computing CUDA Heat transfer application

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Neighbor Coverage Protocol for Reducing Rebroadcast in MANET

引用

Procedia computer science 2015年 47卷 417-423页

作者： R. Ragul Ravi V. Jayanthi PG Scholar Department of Computer science and Engineering Coimbatore institute of technology Coimbatore and 641014 India Assistant Professor Department of Computer science and Engineering Coimbatore institute of technology Coimbatore and 641014 India

Wireless networks adapt easily to changes and offers flexibility in the configuration of the network. In MANET, each node will change its location dynamically and configure itself according to the environment. An effective mechanism for route discovery in such networks is broadcasting, but routing overhead associated with broadcasting can be large in high dynamic networks. To reduce this routing overhead in MANETs, a neighbor coverage based probabilistic rebroadcast protocol is used. To determine the rebroadcast order, a novel rebroadcast delay is used and it obtains the more accurate additional coverage ratio by sensing neighbor coverage knowledge. The rebroadcast probability is calculated by merging the additional coverage ratio and connectivity factor. In the proposed method Energy Efficient Neighbor Coverage Protocol(EENCP) is introduced. In this, the node does not forward RREQ unless there is sufficient energy (battery lifetime), and until the node density in its surrounding exceeds a particular threshold. These two parameters are defined taking into consideration various statistics. EENCP analyzes these two parameters, when implementing routing discovery, and avoiding the unnecessary information sending efficiently and avoid unnecessary information transfer.

关键词： AODV DSR MANET NCPR Overhead coverage ratio

来源：评论

学校读者我要写书评

暂无评论

Energy Optimization in Manets Using On-demand Routing Protocol

引用

Procedia computer science 2015年 47卷 460-470页

作者： K. Sumathi A. Priyadharshini PG Scholar Department of Computer Science and Engineering Coimbatore Institute of Technology Coimbatore and 641014 India Assistant professor Department of Computer Science and Engineering Coimbatore Institute of Technology Coimbatore and 641014 India

Mobile Ad hoc networks (MANET) allow a set of wireless hosts to exchange information without any special infrastructure. The projct entitled “ Energy Optimization in Manets using On-Demand Routing Protocol” motivates the need for energy management in ad hoc wireless networks. Limited battery power is one of the most important issues in mobile ad hoc network as the mobile nodes operate in limited battery power. Also there occurs a problem of broken links due to the lack of energy which cause disorder in network system. Such problem occurs due to the unawareness of energy of mobile neighbor nodes. This paper presents the implementation of Adaptive HELLO messaging scheme to determine the local link connectivity information for monitoring the link status between nodes along with the incorporation of Dynamic On Demand Routing Protocol to reduce the energy consumption of mobile nodes to certain extent.

关键词： Mobile ad hoc networks Routing Hello messge DYMO Energy management On demand routing.

来源：评论

学校读者我要写书评

暂无评论

A Suigeneris Automated Software Testing Methodology

引用

Procedia computer science 2015年 62卷 21-22页

作者： Shivanand M. Handigund Professor of Computer Science & Engineering and Dean-Research & Development Bangalore Institute of Technology Bengaluru India

The software testing is the process of detecting & correcting errors in the transformation of programming system to software. The programming system is the executable code as per the developer. It contains the limited syntactics, semantics of the programming language as per the pragmatics visualized by the developer. This has to be transformed into the software to incorporate pragmatics of all types of users of the system and also the robustness. The current software testing methodology is carried out manually through human skill based test cases and test oracles. This has the limitation in the correctness, completeness, efficiency and robustness. In the suigeneris methodology, the structural testing is carried out as a byproduct. The methodology uses reverse engineering technique to limit the semiotics of the programming system. The reverse engineered UML diagrams, each have been developed automatically with suigeneris purpose which can be used for testing tampered sequence, lapse in behavior, lack of inclusion of other semiotics, robustness in activities and handling exceptional data. The class diagram which is hither to used as ornamental, has been transformed to very resourceful diagram that identifies imbrication of different work processes, different works and different usecases. The entire tutorial is developed with automated tools supported by sound mathematical empiricism. The tutorial explains the methodology with typical case study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Classification of Cardiac Views in Echocardiogram Using Histogram and Statistical Features

引用

Procedia computer science 2015年 46卷 1569-1576页

作者： G.N. Balaji T.S. Subashini N. Chidambaram Research scholar Department of computer science and Engineering Faculty of Engineering and Technology Annamalai University India Associate professor Department of computer science and Engineering Faculty of Engineering and Technology Annamalai University India Professor and Head Department of Cardiology Faculty of Medicine Annamalai University India

Automatic classification cardiac views is the first step to automate wall motion analysis, computer aided disease diagnosis, measurement computation etc. In this paper a fully automatic classification of cardiac view in echocardiogram is proposed. The system is built based on a machine learning approach which characterizes two features 1) Histogram features and 2) Statistical features. In this system four standard views parasternal short axis (PSAX), parasternal long axis (PLAX), apical two chamber (A2C) and apical four chamber (A4C) views are classified. Experiments over 200 echocardiogram images show that the proposed method with an accuracy of 87.5% can be effectively used in cardiac view classification.

关键词： parasternal short axis (PSAX) parasternal long axis (PLAX) apical two chamber (A2C) and apical four chamber (A4C).

来源：评论

学校读者我要写书评

暂无评论

A streaming execution method for multi-services in mobile cloud computing 15th

A streaming execution method for multi-services in mobile cl...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Li, Lei Xiong, Yonghua Guo, Shufan Jiang, Keyuan Tang, Yongbing School of Automation China University of Geosciences Wuhan430074 China School of Information Science and Engineering Central South University Changsha410083 China Department of Computer Information Technology and Graphics Purdue University Calumet Hammond46323 United States

ISBN: (纸本)9783319271361

Commercially available mobile devices with various kinds of hardware and software platforms have resulted in a huge amount of mobile services. This has a new challenge in designing multiple services that are compatible with heterogeneous devices and operating systems (OSes). This paper presents a method of multi-services mobile cloud computing (MSMCC) for mobile device, which regards OS as a service to improve user experience. A multi-services pre-boot firmware (MSPF) is designed to stream multi-OS images and multi-application images to the mobile devices over wireless network. After that, we use the MSMCC method to run on the S3C6410 board equipped with MSPF, results illustrated that MSPF is able to support remote boot and streaming execution of multi-services with stable performance © Springer International Publishing Switzerland 2015.

关键词： Firmware

来源：评论

学校读者我要写书评

暂无评论

Enhanced Load Balanced Min-min Algorithm for Static Meta Task Scheduling in Cloud Computing

引用

Procedia computer science 2015年 57卷 545-553页

作者： Gaurang Patel Rutvik Mehta Upendra Bhoi Computer Science & Engineering Department Parul Institute of Engineering &TechnologyVadodara Guajarat India. Assistant Professor Information TechnlogyDepartment Parul Institute of Engineering &TechnologyVadodara Guajarat India. Assistant Professor Computer Science & Engineering Department Parul Institute of TechnologyVadodara Guajarat India.

For today's most demanding service of cloud computing, there are many tasks required to be executed by the available resources to achieve best performance, reduce response time and utilize resources. There is a need of designing a new task scheduling algorithm that outperform appropriate allocation map of task. to achieve these challenges. As Load Balanced Min-Min Algorithm selects the task with minimum completion time and assigns it to appropriate resource, it sometimes does not produce better makespan and does not utilize resources effectively. This paper represents study of variety of task scheduling algorithms and modification of Load balanced Min-Min (ELBMM) algorithm for Static Meta-Task Scheduling. The modified algorithm is built based on comprehensive study of the impact of Load balanced Min-Min algorithm for Static Meta-Task Scheduling in grid computing. Enhanced Load balanced Min-Min algorithm (ELBMM) is based on Min-Min strategy and tasks rescheduling to use the unutilized resources effectively. It selects the task with maximum completion time and assigns it to appropriate resource to produce better makespan and utilize resource effectively.

关键词： Cloud Computing Meta Task Scheduling ELBMM Min-Min algorithm .

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：