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

9th International Conference on Movement and Computing (MOCO) - Beyond Control

作者： Meshi, Avital Univ Calif Davis Performance Studies Davis CA 95616 USA

ISBN: (纸本)9798400709944

The New Vitruvian is a performative interplay, a duet between a human artist and an AI recognition algorithm. The artist dances in front of the AI system and its watchful gaze. As the system processes and classifies her physical form, an intimate relationship is formed between the two, an entanglement within which new subjectivities emerge, identities are deconstructed and reconstructed repeatedly, and a new potential for freedom is revealed. This essay delves into the nuances of the performative practice, examining the intricate layers of The New Vitruvian, inviting readers to ponder the notion of identity transformation through the evolving relationship between humans and technologies.

关键词： Creative AI Performance Art Dance Posthumanism recognition algorithms Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Edge intersection graphs of L-shaped paths in grids

引用

DISCRETE APPLIED MATHEMATICS 2016年 210卷 185-194页

作者： Cameron, Kathie Chaplick, Steven Hoang, Chinh T. Wilfrid Laurier Univ Dept Math Waterloo ON Canada Tech Univ Berlin Inst Math Berlin Germany Wilfrid Laurier Univ Dept Phys & Comp Sci Waterloo ON Canada

In this paper we continue the study of the edge intersection graphs of one (or zero) bend paths on a rectangular grid. That is, the edge intersection graphs where each vertex is represented by one of the following shapes left perpendicular inverted right perpendicular, right perpendicular inverted left perpendicular, and we consider zero bend paths (i.e., vertical bar and -) to be degenerate left perpendicular 's. These graphs, called B-1-EPG graphs, were first introduced by Golumbic et al. (2009). We consider the natural subclasses of B-1-EPG formed by the subsets of the four single bend shapes (i.e., {left perpendicular }, {left perpendicular, inverted right perpendicular }, {left perpendicular , inverted left perpendicular}, and {left perpendicular , inverted right perpendicular, inverted left perpendicular}) and we denote the classes by [left perpendicular], [left perpendicular, inverted right perpendicular], [left perpendicular , inverted left perpendicular], and [left perpendicular , inverted right perpendicular, inverted left perpendicular] respectively. Note: all other subsets are isomorphic to these up to 90 degree rotation. We show that testing for membership in each of these classes is NP-complete and observe the expected strict inclusions and incomparability (i.e., [left perpendicular] not subset of [left perpendicular, inverted right perpendicular], [left perpendicular, inverted left perpendicular] not subset of [left perpendicular, inverted right perpendicular, inverted left perpendicular] not subset of B-1-EPG and [left perpendicular, inverted right perpendicular] is incomparable with [left perpendicular, inverted left perpendicular] ). Additionally, we give characterizations and polytime recognition algorithms for special subclasses of Split boolean AND[left perpendicular]. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Edge intersection graphs Grid paths Split graphs NP-completeness recognition algorithms L-graphs

来源：评论

学校读者我要写书评

暂无评论

On algorithms for (P₅,gem)-free graphs

引用

THEORETICAL COMPUTER SCIENCE 2005年第1期349卷 2-21页

作者： Bodlaender, HL Brandstädt, A Kratsch, D Rao, M Spinrad, J Univ Metz Lab Informat Theor & Appl F-57045 Metz France Univ Utrecht Inst Informat & Comp Sci NL-3508 TB Utrecht Netherlands Univ Rostock Fachbereich Informat D-18051 Rostock Germany Vanderbilt Univ Dept Elect Engn & Comp Sci Nashville TN 37235 USA

A graph is (P-5,gem)-free, when it does not contain P-5 (an induced path with five vertices) or a gem (a graph formed by making an universal vertex adjacent to each of the four vertices of the induced path P-4) as an induced subgraph. We present O(n(2)) time recognition algorithms for chordal gem-free graphs and for (P-5,gem)-free graphs. Using a characterization of (P-5,gem)-free graphs by their prime graphs with respect to modular decomposition and their modular decomposition trees [A. Brandstadt, D. Kratsch, On the structure of (P-5,gem)-free graphs, Discrete Appl. Math. 145 (2005), 155-166], we give linear time algorithms for the following NP-complete problems on (P-5,gem)-free graphs: Minimum Coloring;Maximum Weight Stable Set;Maximum Weight Clique;and Minimum Clique Cover. (c) 2005 Elsevier B.V. All rights reserved.

关键词： (P(5,)gem)-free graphs recognition algorithms modular decomposition independent set clique coloring clique cover

来源：评论

学校读者我要写书评

暂无评论

Research on License Plate Character recognition Technology Based on Image Processing and Deep Learning

Research on License Plate Character Recognition Technology B...

引用

IEEE International Conference on Electrical Engineering, Big Data and algorithms (EEBDA)

作者： Chen, Chun Zhong, Xiaolei Honghe Vocat & Tech Coll Honghe 661100 Peoples R China Yunnan Univ Dianchi Coll Kunming 650228 Yunnan Peoples R China

ISBN: (纸本)9781665416061

Character recognition methods are applied in many fields, greatly improving work efficiency in daily life[1], such as license plate retrieval, invoice printing recognition, lottery betting codes, tax reports, etc. Digital recognition has been widely used in the field of computer vision and image recognition, and deep learning algorithms are currently popular image recognition algorithms. Deep learning has been widely studied and applied in target recognition and speech content recognition. With the rapid increase in production requirements and computer data processing speed, the application of character recognition in actual production and life is becoming more and more common[2]. It is also extremely important for automatic retrieval and real-time, fast and accurate character input. However, traditional pattern recognition and feature extraction algorithms cannot well meet the requirements of real-time and correctness in production. At the same time, due to the vigorous development of deep learning, character recognition technology based on deep learning has advantages that traditional recognition algorithms cannot match. This paper proposes a barcode recognition algorithm based on a deep neural network combined with a global optimization method. It uses a convolutional recurrent network to extract the characteristics of each character in the barcode and classify it. Compared with the traditional method, it has stronger adaptability and generalization. Chemical energy.

关键词： deep learning character recognition recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

A Multi-Surface Acoustic Wave Sensor platform for the Detection and Identification of Toxic Gases

A Multi-Surface Acoustic Wave Sensor platform for the Detect...

引用

IEEE Sensors Conference

作者： Slimani, Mariem Mer-Calfati, Christine Poli, Jean-Philippe Badets, Franck Friedman, Edwin Rat, Venceslass Laroche, Thierry Saada, Samuel Univ Paris Saclay CEA List F-91120 Palaiseau France Univ Grenoble Alpes CEA Leti F-38000 Grenoble France SOITEC Co F-25000 Besancon France

ISBN: (纸本)9798350303872

In this paper, we present a platform based on a modular approach coupled with powerful algorithms for accurate detection and identification of chemical compounds. The system relies on multi-SAW (Surface Acoustic Wave) sensors that are functionalized differently, resulting in multi-responses that collectively constitute a fingerprint of the chemical compound. A prototype has been developed and the overall system, including the design of SAW module, the acquisition system, learning algorithms and online recognition of various compounds, has been tested and validated. The results showed a reliable and accurate system with a perfect score of 100% recognition of DMMP.

关键词： Saw sensors chemical sensors toxic gases detection recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Edge intersection graphs of L-shaped paths in grids

Edge intersection graphs of <i>L</i>-shaped paths in grids

引用

7th Latin-American algorithms, Graphs, and Optimization Symposium (LAGOS)

关键词： Edge intersection graphs Grid paths Split graphs NP-completeness recognition algorithms L-graphs

来源：评论

学校读者我要写书评

暂无评论

Common Green Plants Identification System 8

Common Green Plants Identification System

引用

8th International Conference on Virtual Reality and Visualization (ICVRV)

作者： Wang, Yu Li, Changsheng Beijing Technol & Business Univ Beijing Key Lab Big Data Technol Food Safety Beijing Peoples R China

ISBN: (纸本)9781538684979

A plant identification system which is designed to integrate local edge algorithms with other classical recognition algorithms in a prototype system is mainly composed of the following two parts. One is the system interface and another is algorithm embedding. A convenient visual environment is provided for users by this system interface, and algorithm functions and other auxiliary functions are integrated. After selecting the system integration algorithms and setting the necessary parameters, the tested plant image is automatically recognized by this system and the corresponding plant images from the database with a brief description are displayed. The tested common green images can be accurately identified and good identification results are obtained by this system.

关键词： plant identification recognition algorithms automatically algorithm embedding

来源：评论

学校读者我要写书评

暂无评论

Radar signal classification algorithms synthesis and analysis 7

Radar signal classification algorithms synthesis and analysi...

引用

7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO)

作者： Dorosinskiy, Leonid Myasnikov, Filipp Ural Fed Univ Ekaterinburg Russia

ISBN: (纸本)9781509054541

The main role in the task of process remote sensing data of the Earth surface are played algorithms of forming and classification those data. From the statistical point of view the solution is based on the maximum-likelihood method. The paper presents analytical equations for likelihood coefficients and the structural scheme of their forming in the solution of radar signal recognition. To analyze the efficiency of the proposed algorithms are found boundary equations for probability calculating of correct signals with the usage of Chernoff-Kailath ratios. This ratios evaluate the upper and lower probability boundaries of correct and incorrect decisions in the case of classification of optional class number from different type surfaces.

关键词： recognition algorithms probability detection noise

来源：评论

学校读者我要写书评

暂无评论

On the hereditary (p, q)-Helly property of hypergraphs, cliques, and bicliques

引用

Electronic Notes in Discrete Mathematics 2015年 50卷 361-366页

作者： Dourado, Mitre C. Grippo, Luciano N. Safe, Martín D. Instituto de Matemática Universidade Federal do Rio de Janeiro Rio de Janeiro Brazil Instituto de Ciencias Universidad Nacional de General Sarmiento Los Polvorines Buenos Aires Argentina

We prove several characterizations of hereditary (p, q)-Helly hypergraphs, including one by minimal forbidden partial subhypergraphs, and show that the recognition of hereditary (p, q)-Helly hypergraphs can be solved in polynomial time for fixed p but is co-NP-complete if p is part of the input. We also give several characterizations of hereditary (p, q)-clique-Helly graphs, including one by forbidden induced subgraphs, and prove that the recognition of hereditary (p, q)-clique-Helly graphs can be solved in polynomial time for fixed p and q but is NP-hard if p or q is part of the input. We prove similar results for hereditary (p, q)-biclique-Helly graphs. © 2015 Elsevier B.V.

关键词： (p, q)-Helly property Forbidden induced subgraphs Forbidden partial subhypergraphs Maximal bicliques Maximal cliques recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Radarsignal classification algorythms synthesis and analysis 2

Radarsignal classification algorythms synthesis and analysis

引用

2nd IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

作者： Dorosinskiy, Leonid Myasnikov, Filipp Ural Fed Univ Ekaterinburg Russia

ISBN: (纸本)9781467389792

In the process of solving a wide range of tasks concerning the Earth surface remote sensing and its state monitoring, the main role is played by the algorithm of the surface image forming and the algorithm of images and their fragments classification as well. From the statistical point of view the solution is based on the maximum-likelihood method. The paper presents analytical equations for likelihood coefficients and the structural scheme of their forming in the solution of radar signal recognition. To analyze the efficiency of the proposed algorithms are found boundary equations for probability calculating of correct signals with the usage of Chernoff-Kailath ratios. This ratios evaluate the upper and lower probability boundaries of correct and incorrect decisions in the case of classification of optional class number from different type surfaces.

关键词： recognition algorithms probability detection noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：