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

International Conference on Pervasive Computing (ICPC)

作者： Lengare, Pankaj S. Rane, Milind E. Vishwkarma Inst Technol Dept Elect & Telecommun Pune Maharashtra India

ISBN: (纸本)9781479962723

Hand tracking system gets so much attention in recent time because of its great applications. This method can be implemented by so many techniques. Here we show a straight forward technique of tracking the human hand using the robotic arm. This paper shows the interfacing of human hand using robot arm. With this method the robotic hand can be controlled using human hand. Its demonstration is done by using image processing technique to detect different colors at different axis of human hand. This technique is very useful since it takes real time video of hand and tracks it to get interface with robotic arm. A laptop camera will get the video and track the RGB (red, green and blue) colures at different axis of hand denoting X and Y axis. Tracking of such hand will interface the controller with robotic arm. The main aim behind this approach to program a robotic arm, so that it should be controlled by human hand and will reach the locations where human will not be able to reach and do the given task by direct interfacing with human hand. In this we can see the real time movement of robotic arm.

关键词： color coding human hand tracking interfacing controller robotic arm

来源：评论

学校读者我要写书评

暂无评论

Feasibility of Text Visualization in Text Steganalysis 13

Feasibility of Text Visualization in Text Steganalysis

引用

13th International Conference on Intelligent Software Methodologies, Tools, and Techniques (SoMeT)

作者： Ab Rauf, Rose Hafsah Jamal, Nurhafizah Univ Teknol Mara Fac Comp & Math Sci Selangor Malaysia

ISBN: (纸本)9781614994343;9781614994336

Text steganography was never a threat until it has been manipulated by cyber criminals or terrorist for their own benefit. Secret messages sent through steganography with bad intent can cause harm and to the extent jeopardizing the security of a company or country. Thus, text steganalysis is critically needed for forensic investigation purposes due to the tremendous usage of digital media in accessing and disseminating information. Apparently, there has not been much research done on text steganalysis and mostly researches are based on statistical approach. The aim of the research is to propose a new text steganalysis technique in detecting format-based steganography using a simple and effective approach. This paper introduces a novel text steganalysis technique based on color-coded text visualization. An encoding scheme for the text visualization is designed by analyzing text features with respect to colors to detect whitespace pattern. The aim here is to distinguish between natural and stegano text by color-coded visualization. Experiments show that the detection performance accuracy successfully reaches 96.67% with remarkably high precision and recall. This finding has proved that the text visualization technique is capable in detecting text steganography effectively by simply looking at the text visualization image. It is evidently shown that a simple text steganalysis technique is successfully discovered and it is feasible.

关键词： Text visualization text steganalysis text steganography format-based method color coding

来源：评论

学校读者我要写书评

暂无评论

Quantifying Systemic Evolutionary Changes by color coding Confidence-Scored PPI Networks

引用

9th International Workshop on Algorithms in Bioinformatics (WABI 2009)

作者： Dao, Phuong Schoenhuth, Alexander Hormozdiari, Fereydoun Hajirasouliha, Iman Sahinalp, S. Cenk Ester, Martin Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783642042409

A current major challenge in systems biology is to compute statistics on biomolecular network motifs, since this can reveal significant systemic differences between organisms. We extend the "color coding" technique to weighted edge networks and apply it to PPI networks where edges are weighted by probabilistic confidence scores, as provided by the STRING database. This is a substantial improvement over the previously available studies on, still heavily noisy, binary-edge-weight data. Following up on such a study, we compute the expected number of occurrences of non-induced subtrees with k <= 9 vertices. Beyond the previously reported differences between unicellular and multicellular organisms, we reveal major differences between prokaryotes and unicellular eukaryotes. This establishes, for the first time on a statistically sound data basis, that evolutionary distance can be monitored in terms of elevated systemic arrangements.

关键词： Biomolecular Network Motifs color coding Evolutionary Systems Biology Protein-Protein Interaction Networks

来源：评论

学校读者我要写书评

暂无评论

The Parameterized Complexity of Unique Coverage and Its Variants

引用

ALGORITHMICA 2013年第3期65卷 517-544页

作者： Misra, Neeldhara Moser, Hannes Raman, Venkatesh Saurabh, Saket Sikdar, Somnath Inst Math Sci Madras 600113 Tamil Nadu India Univ Jena Jena Germany Rhein Westfal TH Aachen Aachen Germany

In this paper we study the parameterized complexity of the Unique Coverage problem, a variant of the classic Set Cover problem. This problem admits several parameterizations and we show that all, except the standard parameterization and a generalization of it, are unlikely to be fixed-parameter tractable. We use results from extremal combinatorics to obtain the best-known kernel for Unique Coverage and the well-known color-coding technique of Alon et al. (J. ACM 42(4), 844-856, 1995) to show that a weighted version of this problem is fixed-parameter tractable. Our application of color-coding uses an interesting variation of s-perfect hash families called (k,s)-hash families which were studied by Alon et al. (J. Comb. Theory Ser. A 104(1), 207-215, 2003) in the context of a class of codes called parent identifying codes (Barg et al. in SIAM J. Discrete Math. 14(3), 423-431, 2001). To the best of our knowledge, this is the first application of (k,s)-hash families outside the domain of coding theory. We prove the existence of such families of size smaller than the best-known s-perfect hash families using the probabilistic method (Alon and Spencer in The Probabilistic Method, Wiley, New York, 2000). Explicit constructions of such families of size promised by the probabilistic method is open.

关键词： Parameterized algorithms Unique coverage Budgeted unique coverage color coding Hash functions

来源：评论

学校读者我要写书评

暂无评论

Subgraph Enumeration in Dynamic Graphs

Subgraph Enumeration in Dynamic Graphs

引用

IEEE 13th International Conference on Data Mining (ICDM)

作者： Adiga, Abhijin Vullikanti, Anil Kumar S. Wiggins, Dante Virginia Tech Virginia Bioinformat Inst Blacksburg VA 24061 USA

ISBN: (纸本)9781479913282

A fundamental problem in many applications involving social and biological networks is to identify and count the number of embeddings of a given small subgraph in a large graph. Often, they involve dynamic graphs, in which the graph changes incrementally (e. g., by edge addition/deletion). We study the Dynamic Subgraph Enumeration (DSE) Problem, where the goal is to maintain a dynamic data structure to solve the subgraph enumeration problem efficiently when the graph changes incrementally. We develop a new data structure that combines two techniques: (i) the color-coding technique of Alon et al., 2008, for enumerating trees, and (ii) a dynamic data structure for maintaining the h-index of the graph (developed by Eppstein and Spiro, 2009). We derive worst case bounds for the update time in terms of the h-index of the graph and the maximum degree. We also study the empirical performance of our algorithm in a large set of real networks, and find significant improvement over the static methods.

关键词： Subgraph enumeration color coding h-index

来源：评论

学校读者我要写书评

暂无评论

Fast Approximate Subgraph Counting and Enumeration

Fast Approximate Subgraph Counting and Enumeration

引用

42nd Annual International Conference on Parallel Processing (ICPP)

作者： Slota, George M. Madduri, Kamesh Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

ISBN: (纸本)9780769551173

We present a new shared-memory parallel algorithm and implementation called FASCIA for the problems of approximate subgraph counting and subgraph enumeration. The problem of subgraph counting refers to determining the frequency of occurrence of a given subgraph (or template) within a large network. This is a key graph analytic with applications in various domains. In bioinformatics, subgraph counting is used to detect and characterize local structure (motifs) in protein interaction networks. Exhaustive enumeration and exact counting is extremely compute-intensive, with running time growing exponentially with the number of vertices in the template. In this work, we apply the color coding technique to determine approximate counts of non-induced occurrences of the subgraph in the original network. color coding gives a fixed-parameter algorithm for this problem, using a dynamic programming-based counting approach. Our new contributions are a multilevel shared-memory parallelization of the counting scheme and several optimizations to reduce the memory footprint. We show that approximate counts can be obtained for templates with up to 12 vertices, on networks with up to millions of vertices and edges. Prior work on this problem has only considered out-of-core parallelization on distributed platforms. With our new counting scheme, data layout optimizations, and multicore parallelism, we demonstrate a significant speedup over the current state-of-the-art for subgraph counting.

关键词： subgraph counting motifs color coding

来源：评论

学校读者我要写书评

暂无评论

Fringe projection profilometry based on complementary color-encoded fringe patterns

引用

OPTICS AND LASER TECHNOLOGY 2012年第8期44卷 2332-2339页

作者： Da, Feipeng Wang, Luyang Hu, Luyao Southeast Univ Sch Automat Nanjing 210096 Jiangsu Peoples R China

3D measurement techniques based on color-encoded fringe pattern projection have been widely used in various fields of engineering recently. There is one problem that the surface color of measured object may interfere with the color of projected fringe pattern. To solve this problem, a novel method based on complementary color-encoded fringe projection is proposed. Two color-encoded fringe patterns whose fringe colors are complementary are designed. The first pattern is with the sinusoidal fringe embedding into the green color channel which is used to evaluate phases by Fourier transform method. The fringe color of the captured image is established with the help of the complementary color fringe pattern, which is based on the feature of color complementation. Thus, the influence brought by the color of object surface can be eliminated, and decoding errors can be further reduced. Experiment results indicate that the proposed method is valid and can be applied to the measured colorful objects. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Optical inspection Phase unwrapping color coding

来源：评论

学校读者我要写书评

暂无评论

Periodic long range proton conduction pathways in pseudo-cubic and orthorhombic perovskites

引用

SOLID STATE IONICS 2012年 213卷 8-13页

作者： Gomez, Maria A. Shepardson, Dylan Nguyen, Luong T. Kehinde, Tolu Mt Holyoke Coll Dept Chem S Hadley MA 01075 USA Mt Holyoke Coll Dept Math & Stat S Hadley MA 01075 USA

Dynamic programming is used to find periodic proton conduction paths in pseudo-cubic and orthorhombic perovskites. Periodic paths through a large periodic simulation box are compared to periodic paths through a smaller simulation box and pathways stitched from small simulation box periodic and aperiodic paths. For both size systems in the 900-1300 K temperature range, overall average limiting barriers over the N-step periodic pathways considered are 0.3, 0.4, and 0.6 eV for BaZr0.875Y0.125O3 , SrZr0.875Y0.125O3 and SrZr0.875-Al0.125O3, respectively, in good relative agreement with earlier experiments. However, differences in the ensemble weighted fraction of rotation, intraoctahedral transfer, and interoctahedral transfer limiting steps highlights differences in the small and large system periodic path ensembles. In contrast, the averages over the stitched ensemble are in excellent agreement with the large system averages. This suggests that a careful combining of small system pathways can yield pathways representative of a large system. (c) 2011 Elsevier B.V. All rights reserved.

关键词： Proton conduction Yttrium Dopant Perovskite color coding

来源：评论

学校读者我要写书评

暂无评论

Periodic long range proton conduction pathways in pseudo-cubic and orthorhombic perovskites

Periodic long range proton conduction pathways in pseudo-cub...

引用

15th International Conference on Solid State Protonic Conductors (SSPC)

作者： Gomez, Maria A. Shepardson, Dylan Nguyen, Luong T. Kehinde, Tolu Mt Holyoke Coll Dept Chem S Hadley MA 01075 USA Mt Holyoke Coll Dept Math & Stat S Hadley MA 01075 USA

关键词： Proton conduction Yttrium Dopant Perovskite color coding

来源：评论

学校读者我要写书评

暂无评论

STUDY OF PROTEIN STRUCTURE ALIGNMENT PROBLEM IN PARAMETERIZED COMPUTATION

STUDY OF PROTEIN STRUCTURE ALIGNMENT PROBLEM IN PARAMETERIZE...

引用

International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS)

作者： Ashby, Cody Wang, Kun Cramer, Carole L. Huang, Xiuzhen Arkansas State Univ MBS PhD Program Jonesboro AR USA

ISBN: (纸本)9789898425904

Motivated by the practical application of protein structure-structure alignment, we have studied the problem of maximum common subgraph within the framework of parameterized complexity. We investigated the lower bound for the exact algorithms of the problem. We proved it unlikely that there is an algorithm of time p(n,m) * k(o(m)) for the problem, where p is a polynomial function, k is a parameter of map width, and m and n are the numbers of vertices of the the two graphs respectively. In consideration of the upper bound of p(n,m)*k(m) based on the brute-force approach, our lower bound result is asymptotically tight. Although the algorithm with the running time p(n,m) k(m) could not be significantly improved from our lower bound result, it is still possible to develop efficient algorithms or the practical application of the protein structure-structure alignment. We developed an efficient algorithm integrating the color coding method and parameterized computation for identifying the maximum common subgraph of two prot structure graphs. We have applied the algorithm to protein structure-structure alignment and conducted experimental testing of more than 600 protein pairs. Our parameterized approach shows improvement in structure alignment efficiency and will be very useful for structure comparisons of proteins with large sizes.

关键词： Protein structure-structure alignment color coding Parameterized computation Maximum common subgraph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：