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

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.

来源：评论

学校读者我要写书评

暂无评论

Index Based Sequential Multiple Pattern Matching Algorithm Using Pair Indexing

Index Based Sequential Multiple Pattern Matching Algorithm U...

引用

International Conference on Life science and technology（ICLST 2011）

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

The current research in life science area is producing large amount of genetic *** related pattern matching in a given sequence is one of the fundamental problems in computational *** often search DNA sequences to identify use full information available from protein and genes for the functional and structural *** algorithms have been proposed but more efficient and robust methods are needed for the exact pattern matching *** the proposed work an index based sequential multiple pattern matching using pair indexing algorithm gives very good performance when compared with some of the existing *** current technique avoids unnecessary DNA comparisons as a result the number of comparisons and CPC ratio gradually decreases and overall performance increases.

关键词： Characters matching patterns sequence

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Color features integrated with line detection for object extraction and recognition in traffic images retrieval

引用

International Journal of computer science Issues 2011年第6 6-3期8卷 192-198页

作者： Wang, Hui Hui Mohamad, Dzulkifli Ismail, N.A. Department Of Software Engineering and Multimedia Computing Faculty of Computer Science and Information Technology Universiti Malaysia Sarawak 94300 Kota Samarahan Sarawak Malaysia Department of Computer Graphics and Multimedia Faculty of Computer Science and Information Technology Universiti Teknologi Malaysia 81300 Skudai Johor Bahru Malaysia

This paper proposes a simple object extraction and recognition method with efficient searching for identifying and extracting the objects in a complex scene based on the color features. The background of the images is needed to be extracted and recognized in order to get the object of the interested in the images first. This can be achieved by getting the best separation line between building and road, followed by the interested objects (vehicles) on the road. The vehicle objects are represented by using Minimum Bound Rectangle (MBR) and the vehicle object representative points will be the left bottom coordinate of the MBR. The color of the vehicles will be used as the attributes of the objects. Experiments have been conducted to demonstrate that single and multiple known objects in complex scenes can be extracted by using this approach.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Iterative process to improve simple adaptive subdivision surfaces method with butterfly scheme

引用

World Academy of science, Engineering and technology 2011年 79卷 622-626页

作者： Husain, Noor Asma Rahim, Mohd Shafry Mohd Bade, Abdullah Department of Computer Graphics and Multimedia Faculty of Computer Science and Information System University of Technology Malaysia 81310 Skudai Johor Malaysia School of Engineering and Information System University of Malaysia Sabah 88400 Kota Kinabalu Sabah Malaysia

Subdivision surfaces were applied to the entire meshes in order to produce smooth surfaces refinement from coarse mesh. Several schemes had been introduced in this area to provide a set of rules to converge smooth surfaces. However, to compute and render all the vertices are really inconvenient in terms of memory consumption and runtime during the subdivision process. It will lead to a heavy computational load especially at a higher level of subdivision. Adaptive subdivision is a method that subdivides only at certain areas of the meshes while the rest were maintained less polygons. Although adaptive subdivision occurs at the selected areas, the quality of produced surfaces which is their smoothness can be preserved similar as well as regular subdivision. Nevertheless, adaptive subdivision process burdened from two causes;calculations need to be done to define areas that are required to be subdivided and to remove cracks created from the subdivision depth difference between the selected and unselected areas. Unfortunately, the result of adaptive subdivision when it reaches to the higher level of subdivision, it still brings the problem with memory consumption. This research brings to iterative process of adaptive subdivision to improve the previous adaptive method that will reduce memory consumption applied on triangular mesh. The result of this iterative process was acceptable better in memory and appearance in order to produce fewer polygons while it preserves smooth surfaces.

关键词： Cracks

来源：评论

学校读者我要写书评

暂无评论

Sampling step importance in hierarchical semantic segmentation of microscopic images

Sampling step importance in hierarchical semantic segmentati...

引用

International Conference on System Theory, Control, and Computing (ICSTCC)

作者： Cristian Smochina Vasile Manta Walter Kropatsch Department of Computer Science and Engineering Gheorghe Asachi Technical University of Iasi Romania Pattern Recognition and Image Processing Group Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

The objective of semantic segmentation in microscopic images is to extract the cellular, nuclear or tissue components. This problem is challenging due to the large variations of these components features (size, shape, orientation or texture). In this paper we improve the technique presented in [17] used to identify the epithelial nuclei (crypt) against interstitial nuclei in microscopic images taken from colon tissues. In the proposed enhanced approach, the crypt inner boundary is detected using the closing morphological pyramid instead of morphological hierarchy. The outer crypt border is determined by the epithelial nuclei, overlapped by the maximal isoline of the inner boundary. The use of sampling in building the pyramid offers computational efficiency, reduces the amount of used memory, increase the robustness and preserve the quality results. An analysis of the two approaches is performed considering the number of pixels processed to create each level. Also the relation between the levels of the hierarchical structures is established.

关键词： Cryptography Image segmentation Image reconstruction Image resolution Microscopy Buildings Shape

来源：评论

学校读者我要写书评

暂无评论

Formal specification for spatial information databases integration framework (SIDIF)

引用

Telkomnika 2011年第1期9卷 81-88页

作者： Man, Mustafa Jusuh, Julaily Aida Rahim, Mohd Shafry Mohd Zakaria, Mohammad Zaidi Dept. of Computer Science Fac. of Science and Technology Universiti Malaysia Terengganu 21030 Kuala Terengganu Terengganu Malaysia Det. of Computer Science Fac. of Computer Science and Information Technology Sultan Zainal Abidin 21030 Kuala Terengganu Terengganu Malaysia Dept. of Computer Graphics and Multimedia FSKSM Universiti Teknologi Malaysia 81310 UTM Skudai Johor Bahru Malaysia Dept. of Fisheries Science Fac. of Agro Technology and Food Science Universiti Malaysia Terengganu 21030 Kuala Terengganu Terengganu Malaysia

This paper discusses the formal validation for spatial information databases integration framework (SIDIF). A SIDIF database is a large, organized body of persistent data, usually associated with computerized software designed to update, query, and retrieve components of the data stored within the system. One of the common difficulties faced by the developer is in designing a robust database system. Even so, in order to solve this matter, developers have to focus their efforts on the formal specifications. The formal specification is supposed to reduce the overall development time. Formal specifications can be used to provide an unambiguous and precise supplement to natural language descriptions. Besides, it can be rigorously validated and verified leading to the early detection of specification errors. Consequently, to validate this problem formally, we specify the SIDIF database framework using Z language and prove by using Z/EVES theorem proven tool. By using this kind of tools, it may help to reduce time, energy and mistake compared to manual theorem proving which can be error task and tedious.

关键词： Formal specification

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Designing an integrated order fulfillment system for configure-to-order production

Designing an integrated order fulfillment system for configu...

引用

IEEE International Conference on Industrial Engineering and Engineering Management

作者： Linda Zhang Qianli Xu Department of Management IESEG School of Management Lille France Department of Computer Graphics & Interfaces Institute for Infocomm Research Agency for Science Technology and Research Singapore

ISBN: (纸本)9781457707407

In accordance with diverse customized products, an increased attention has been paid to the order fulfilment process in configure-to-order production. However, most of the solutions reported either focus on isolated areas without considering the impacts from/on the related issues or approach order fulfilment processes from a strategic level. In view of the limitations of existing solutions and the significance of order fulfilment activity automation and integration, this study proposes an integrated order fulfillment system (IOFS) by considering the entire spectrum of order fulfilment process at an operational level. The IOFS is designed to automatically execute order processing, configure products and process plans based on product and process family models. It assists companies to quickly respond to diverse customer requirements and deliver the expected products at low costs. An industrial example of turn unit assemblies is presented to demonstrate the feasibility and potential of the IOFS.

关键词： Databases Production Assembly Servers Companies computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：