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

International Conference on Data science & engineering (ICDSE)

作者： Syed Mujib Rahaman Mohammad Farhatullah Dept. of Computer Science Engineering Dr.L.Bullayya College of Engineering for Women Visakhapatnam India Assistant Professor Dept. of Computer Science Engineering Al-Ameer College of Engineering & I.T. Visakhapatnam India

The widespread focus on the Cloud Computing has necessitated the corresponding mechanisms to ensure privacy and security. Various attempts have been made in the past to safeguard the privacy of the individual or agency trying to utilize the services being provided by the cloud. The most challenging task is to provide services to the users while also preserving the privacy of the user's information. In this paper a model that incorporates a three-level architecture, Preserving cloud computing Privacy (PccP) model is proposed which aims to preserve privacy of information pertaining to cloud users. The Consumer Layer deals with all the aspects which relate to enabling the user of the cloud to access the cloud services being provided by the cloud service provider. The Network Interface Layer creates an appropriate mapping between the original IP addresses of the users with a modified IP address, and thereby ensuring the privacy of the IP address of the users. The Privacy Preserved Layer utilizes the functionality of the Unique User Cloud Identity Generator for which an algorithm is proposed in this paper to generate an unique User Service Dependent Identity(USID) with privacy check by establishing mapping among the existing user identity(ID), if any to ID's available in a pool of User ID's to enhance the privacy of sensitive user information. A Privacy check method based on information privacy is being proposed which contributes significantly in maintaining user control over the generated user identities (USID's).

关键词： Privacy Cloud computing IP networks Data privacy Computational modeling Boolean functions Insurance

来源：评论

学校读者我要写书评

暂无评论

Distributed Voronoi partitioning for multi-robot systems with limited range sensors

Distributed Voronoi partitioning for multi-robot systems wit...

引用

IEEE/RSJ International Conference on Intelligent Robotics and Systems

作者： K.R. Guruprasad Prithviraj Dasgupta Assistant Professor at the Department of Mechanical Engineering National Institute of Technology Karnataka Surathkal India. Associate Professor at the Department of Computer Science University of Nebraska at Omaha NE USA.

ISBN: (纸本)9781467317375

We consider the problem of distributed partitioning of an environment by a set of robots so that each robot performs its operations in the region within the corresponding cell. Voronoi partitioning is one of the most attractive techniques that has been used to solve this problem. It has been used in several distributed multi-robotic system and sensor network applications, such as sensor coverage, search and rescue, and coverage path planning. For a truly distributed implementation of such problems, each robot should be able to compute the corresponding Voronoi cell in a distributed manner. Further, in a practical application, the robots' sensors may have limited range, thus each robot may operate within a portion of its Voronoi cell constrained by the sensor range. We describe a distributed algorithm for computation of this range constrained Voronoi cell where each robot independently constructs chords corresponding to other robots that are within a distance of twice its sensor circle radius. A robot then uses a simple and fast technique to remove inessential chords to calculate the vertices of its Voronoi cell. We prove completeness and correctness of the proposed algorithm, and also provide the upper and lower bounds on the computational complexity of our algorithm. The theoretical results are validated with the help of experiments to show that for different values of sensor ranges, our proposed algorithm incurs a time complexity that is significantly lower than that of the existing full Voronoi partition computation algorithm. The maximum number of steps required by our algorithm is also shown to be within a constant times the lower bound given by the number of neighbors of each node.

关键词： correctness rescue sensor network Robot Rescue accuracy class Sensor networks multi-robot systems Sensors complexity classes Distribute operating range Lower bound range sensor partitions Path planning

来源：评论

学校读者我要写书评

暂无评论

An approach for efficient multimedia transmission using cache in mobile ad hoc networks

引用

Journal of Computational Information Systems 2012年第18期8卷 7567-7578页

作者： Vijayakumar, P.D.R. Ravichandran, D.T. Research Scholar and Assistant Professor Dept. of Computer Science and Engineering Info Institute of Engineering Coimbatore Tamil Nadu India India Principal Hindusthan Institute of Technology Coimbatore Tamil Nadu India India

Problem Statement: Mobile ad hoc networks have been the subject of active research for a number of years. Mobile ad hoc networking (MANET) community provides us with a wealth of technologies that enable the source and the destination nodes to route the data through a number of intermediate forwarding nodes. Approach: This paper proposes a cross layer based caching technique for transmitting multimedia data in mobile ad hoc networks (CBC). Cross layer technique is used to increase the packet delivery ratio by sharing the data using common database. Caching technique the buffer management decreases the average delay in the data transmission. Results: The simulation results prove that the proposed algorithm (CBC) outperforms when compared to the CCCL, Cooperative caching with cross layering and prefetching approach and hybrid cache in terms of packet delivery ratio and the average delay. Conclusions: The proposed algorithm is compared with CCCL and hybrid cache in terms of packet delivery ratio and average delay and shown that CBC performs better. The cross layer technique and buffer management helps in increasing the packet delivery ratio and caching technique and buffer management, prior detection of the link failure using signal strength helps in reducing the delay of the transmission in the system. © 2012 Binary Information Press.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Affective Response Identification for Hearing Threshold Detection

Adaptive Affective Response Identification for Hearing Thres...

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society

作者： Thomas E. Doyle David Musson Faculty of Electrical and Computer Engineering McMaster University Hamilton Ontario Canada Centre for Simulation-Based Learning and an Assistant Professor in Faculty of Health Science McMaster University Hamilton Ontario Canada

ISBN: (纸本)9781424441198

Emotional arousal, or affective patterns, can be probed using observable bioelectric signals, in particular using the fluctuations of electroencephalographic potentials from the human scalp. Hearing impairment related to increased threshold of audio tone detection may cause the loss of intelligibility of speech resulting in an innate automatic emotional response. An adaptive support vector machine can be trained to identify a subject’s unique affective response based upon an audiogram hearing test. This paper presents the efficacy of our model, initial SVM classification data, and discusses potential application.

关键词： affective patterns observable bioelectric classification

来源：评论

学校读者我要写书评

暂无评论

Traffic light control by using GIS and estimated traffic load in an area

Traffic light control by using GIS and estimated traffic loa...

引用

CSI International Conference on Software engineering (CONSEG)

作者： Alok Tiwari Suresh Jain Amitabh Mishra Vijendra Mishra School of Computer Science &IT Devi Ahilya University Indore Madhya Pradesh INDIA Institute of Engineering Technology Devi Ahilya University Indore Madhya Pradesh INDIA Assistant Research Professor Department of CSJohns Hopkins University Baltimore Maryland Rajiv Gandhi Technical University Bhopal Madhya Pradesh INDIA

Traffic is rigorous problem in the city of any developing country today. And it is increasing day by day as new vehicle are being added to the roads rapidly but accordingly infrastructure is not increasing. The main reasons behind this is buying capacity of person has increased, the vehicle cost has reduced, the driving license issued without proper testing, people do not know the rules properly or some of them doesn't want to follow it, etc. There are many limitations to control the above cause. With the use of technology available it is possible to control the traffic of the concern area. In this paper we try to calculate the traffic volume at any junction and its nearby junctions. With the use of theses data we can control the signals of these junctions to clear the traffic in the area. This may also help to avoid the traffic jams in the area.

关键词： Telecommunication traffic Junctions Educational institutions Cities and towns Vegetation Roads computer science

来源：评论

学校读者我要写书评

暂无评论

Study of Thermodynamic Quantities in Horava-Lifshitz and f(R) gravity Theories

引用

Journal of Physics: Conference Series 2012年第1期405卷

作者： Samarpita Bhattacharya Ujjal Debnath Surajit Chattopadhyay Research Scholar Department of Mathematics Bengal Engineering and Science University Shibpur Howrah-711 103 India Assistant Professor Department of Mathematics Bengal Engineering and Science University Shibpur Howrah-711 103 India Assistant Professor Department of Computer Application Pailan College of Management and Technology Kolkata 700 104 India

The present paper reports studies on thermodynamic quantities like temperature of the universe, heat capacity and squared speed of sound in f(R) and Horava-Lifshitz gravity theories. Considering the universe to be filled with dark matter and dark energy we have shown that in all cases the equation of state behaves like quintessence. The thermodynamic quantities have been studied graphically by plotting them against redshift z.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cluster based bit vector mining algorithm for finding frequent itemsets in temporal databases

引用

Procedia computer science 2011年 3卷 513-523页

作者： M. Krishnamurthy A. Kannan R. Baskaran M. Kavitha Assistant Professor Department of Computer Applications Sri Venkateswara College of Engineering Sriperumbudur 602105 India Professor Department of Information Science and Technology AnnaUniversity Chennai 600025 India Assistant Professor Department of Computer Science and Engineering AnnaUniversity Chennai 600025 India Final Year MCA Student Sri Venkateswara College of Engineering Sriperumbudur 602105 India

In this paper, we introduce an efficient algorithm using a new technique to find frequent itemsets from a huge set of itemsets called Cluster based Bit Vectors for Association Rule Mining (CBVAR). In this work, all the items in a transaction are converted into bits (0 or 1). A cluster is created by scanning the database only once. Then frequent 1-itemsets are extracted directly from the cluster table. Moreover, frequent k-itemsets, where k ≥ 2 are obtained by using Logical AND between the items in a cluster table. This approach reduces main memory requirement since it considers only a small cluster at a time and as scalable for any large size of database. The overall performance of this method is significantly better than that of the previously developed algorithms for effective decision making.

关键词： Frequent itemsets Association rule Clustering Cluster table Bit vector Temporal database

来源：评论

学校读者我要写书评

暂无评论

An intelligent Analysis of a City Crime Data Using Data Mining

An intelligent Analysis of a City Crime Data Using Data Mini...

引用

International Conference on Information and Electronics engineering（ICIEE 2011）

作者： Malathi.A S.Santhosh Baboo Anbarasi.A Assistant professor Department of Comuter ScienceGovt Arts CollegeCoimbatoreIndia Readers Department of Computer ScienceD.G.Vaishnav CollegeChennaiIndia.Dr Associative Professor Department of Civil EngineeringKumaraguru college of TechnologyCoimbatoreIndia

ISBN: (纸本)9789810886370

There had been an enormous increase in the crime in the recent *** concern about national security has increased significantly since the 26/11 attacks at Mumbai,***,information and technology overload hinders the effective analysis of criminal and terrorist *** deterrence has become an upheaval *** cops in their role to catch criminals are required to remain convincingly ahead in the eternal race between law breakers and law *** mining applied in the context of law enforcement and intelligence analysis holds the promise of alleviating such *** this paper we use a clustering/classify based model to anticipate crime *** data mining techniques are used to analyze the city crime data from Police *** results of this data mining could potentially be used to lessen and even prevent crime for the forth coming years.

关键词： Cluster,Classify,Crime Analysis and weka

来源：评论

学校读者我要写书评

暂无评论

An Index Based Sequential Multiple Pattern Matching Algorithm Using Least Count

An Index Based Sequential Multiple Pattern Matching Algorith...

引用

International Conference on Life science and Technology（ICLST 2011）

作者： Raju Bhukya DVLN Somayajulu Assistant Professor Department of Computer Science and EngineeringNational Institute of TechnologyWarangal.A.P India Professor Department of Computer Science and Engineering National Institute of Technology Warangal.A.P.India

Pattern matching is one of the emerging areas in computational *** biology is a central research in many sequence *** DNA related data is a common activity for molecular biologists to retrieve necessary and use full information from the *** most of the techniques do not provide straight forward methods for searching DNA *** this paper we introduce a new pattern matching technique called index based sequential multiple pattern matching algorithm using least *** present technique avoids unnecessary DNA comparisons as a result the number of comparisons and CPC ratio gradually decreases and overall performance increases.

关键词： Characters patterns sequence

来源：评论

学校读者我要写书评

暂无评论

An Index Based Sequential Multiple Pattern Matching Algorithm

An Index Based Sequential Multiple Pattern Matching Algorith...

引用

International Conference on Bioscience, Biochemistry and Bioinformatics（ICBBB 2011）

作者： Raju Bhukya DVLN Somayajulu Department of Computer Science and Engineering National Institute of TechnologyWarangal.A.P.IndiaAssistant Professor Department of Computer Science and Engineering National Institute of TechnologyWarangal.A.P.IndiaProfessor

Pattern matching is well known and fundamental problem in *** is one of the emerging areas in computational *** DNA related data is a common activity for molecular biologists for finding the structural and functional behavior in protein and *** this research we propose a new pattern matching technique called an index based sequential multiple pattern matching *** algorithms have been proposed but more efficient and robust methods are needed for the multiple pattern matching *** the current approach we explore a new technique which avoids unnecessary comparisons in the DNA *** to this,the number of comparisons gradually decreases and comparison per character ratio of the proposed algorithm reduces accordingly when compared to the some of the existing popular *** experimental results show that there is considerable amount of performance improvement due to this the overall performance increases.

关键词： DNA Sequence Index Partition Pattern.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：