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

Conference on the Future Computer and Control Systems

作者： Song, Jianhui Zhang, Guohua Sun, Peixin Feng, Naili Xu, Shaolin Shenyang Ligong Univ Sch Informat Sci & Engn Shenyang 110159 Peoples R China Shenyang Artillery Acad PLA Shenyang 110162 Peoples R China

ISBN: (纸本)9783642293894

The measuring accuracy of the TDR cable length measurement system relies on the recognition of the reflected wave. The reflected wave is susceptible to be affected by noise and the reflected wave detecting error is comparatively large. In order to correctly identifying and detecting the reflected wave, this dissertation studies four reflected wave recognition algorithms, which are established according to the threshold method, centroid method, polynomial fitting method and the wavelet modulus maxima method respectively. The advantages and disadvantages of these algorithms are analyzed. The repeatability and accuracies of the reflected wave arrival time for these algorithms are compared through practical applications.

关键词： TDR reflected wave recognition algorithms measuring accuracy

来源：评论

学校读者我要写书评

暂无评论

The Preliminary Survey of Ship recognition algorithms Using ISAR Images 17

The Preliminary Survey of Ship Recognition Algorithms Using ...

引用

17th International Radar Symposium (IRS)

作者： Kurowska, Anna Warsaw Univ Technol Inst Elect Syst Nowowiejska 15-19 PL-00665 Warsaw Poland

This paper provides a preliminary survey of the algoritms used in ISAR imaging for the ship recognition. It provides an overview of existing literature and summarises the current state on a topic. The author of the pa... 详细信息

ISBN: (纸本)9781509025183

关键词： ISAR imaging of the ships classification algorithms recognition algorithms radar imaging Inverse sythetic aperature radar

来源：评论

学校读者我要写书评

暂无评论

Look-alike humans identified by facial recognition algorithms show genetic similarities

引用

CELL REPORTS 2022年第8期40卷 000-000页

作者： Joshi, Ricky S. Rigau, Maria Garcia-Prieto, Carlos A. Castro de Moura, Manuel Pineyro, David Moran, Sebastian Davalos, Veronica Carrion, Pablo Ferrando-Bernal, Manuel Olalde, Inigo Lalueza-Fox, Carles Navarro, Arcadi Fernandez-Tena, Carles Aspandi, Decky Sukno, Federico M. Binefa, Xavier Valencia, Alfonso Esteller, Manel Josep Carreras Leukaemia Res Inst IJC Barcelona 08916 Spain Barcelona Supercomp Ctr BSC Barcelona 08034 Spain Ctr Invest Biomed Red Canc CIBERONC Madrid 28029 Spain Univ Pompeu Fabra Inst Evolutionary Biol CSIC Barcelona 08003 Spain Ctr Genom Regulat CNAG CRG Barcelona 08003 Catalonia Spain Inst Catalana Recerca & Estudis Avancats ICREA Barcelona 08010 Spain Herta Secur SL Barcelona 08037 Spain Univ Pompeu Fabra UPF Dept Tecnol Informacio & Comunicac DTIC Barcelona 08018 Spain Univ Barcelona UB Sch Med & Hlth Sci Physiol Sci Dept Barcelona 08907 Spain

The human face is one of the most visible features of our unique identity as individuals. Interestingly, mono -zygotic twins share almost identical facial traits and the same DNA sequence but could exhibit differences in other biometrical parameters. The expansion of the world wide web and the possibility to exchange pictures of humans across the planet has increased the number of people identified online as virtual twins or doubles that are not family related. Herein, we have characterized in detail a set of "look-alike"humans, defined by facial recognition algorithms, for their multiomics landscape. We report that these individuals share similar genotypes and differ in their DNA methylation and microbiome landscape. These results not only provide in-sights about the genetics that determine our face but also might have implications for the establishment of other human anthropometric properties and even personality characteristics.

关键词： look-alike humans face recognition algorithms genome epigenome microbiome

来源：评论

学校读者我要写书评

暂无评论

recognition AND COMBINATORIAL OPTIMIZATION algorithms FOR BIPARTITE CHAIN GRAPHS

引用

COMPUTING AND INFORMATICS 2013年第2期32卷 313-329页

作者： Talmaciu, Mihai Nechita, Elena Iantovics, Barna Vasile Alecsandri Univ Bacau Dept Math & Informat Bacau Romania Petru Maior Univ Targu Mures Dept Informat Targu Mures Romania

In this paper we give a recognition algorithm in O(n(n + m)) time for bipartite chain graphs, and directly calculate the density of such graphs. For their stability number and domination number, we give algorithms comparable to the existing ones. We point out some applications of bipartite chain graphs in chemistry and approach the Minimum Chain Completion problem.

关键词： Bipartite chain graphs weakly decomposition recognition algorithms combinatorial optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis of Cursive Text recognition Systems: A Systematic Literature Review

引用

ACM TRANSACTIONS ON ASIAN AND LOW-RESOURCE LANGUAGE INFORMATION PROCESSING 2023年第7期22卷 1-30页

作者： Khan, Sulaiman Nazir, Shah Khan, Habib Ullah Hamad Bin Khalifa Univ Qatar Fdn Coll Sci & Engn Doha Qatar Univ Swabi Dept Comp Sci Swabi Pakistan Qatar Univ Coll Business & Econ Dept Accounting & Informat Syst Doha Qatar

Regional and cultural diversities around the world have given birth to a large number of writing systems and scripts, which consist of varying character sets. Developing an optimal character recognition for such a varying and large character set is a challenging task. Unlimited variations in handwritten text due to mood swings, varying writing styles, changes in medium of writing, and many more puzzle the research community. To overcome this problem, researchers have proposed various techniques for the automatic recognition of cursive languages like Urdu, Pashto, and Arabic. With the passage of time, the field of text recognition matured, and the number of publications exponentially increased in the targeted field. It is very difficult to find all the techniques developed, calculate the time and resource consumptions, and understand the cost-benefit tradeoffs among these techniques. These tradeoffs resist making this technology able for practical use. To address these tradeoffs, this article systematic analysis to identify gaps in the literature and suggest new enhanced solution accordingly. A total of 153 of the most relevant articles from 2008 to 2022 are analyzed in this systematic literature review (SLR) work. This systematic review process shows (1) the list of techniques suggested for cursive text recognition purposes and its capabilities, (2) set of feature extraction techniques proposed, and (3) implementation tools used to design and simulate the empirical studies in this specialized field. We have also discussed the emerging trends and described their implications for the research community in this specialized domain. This systematic assessment will ultimately help researchers to perform an overview of the existing character/text recognition approaches, recognition capabilities, and time consumption and subsequently identify the areas that requires a significant attention in the near future.

关键词： Cursive languages recognition algorithms feature techniques systematic literature review

来源：评论

学校读者我要写书评

暂无评论

RECOGNIZING STRICT 2-THRESHOLD GRAPHS IN O(M) TIME

引用

INFORMATION PROCESSING LETTERS 1995年第4期54卷 193-198页

作者： PETRESCHIM, R STERBINI, A UNIV ROMA LA SAPIENZA DEPT COMP SCII-00198 ROMEITALY

In this paper we show an O(m) time recognition algorithm for a class of graphs named Strict 2-Threshold that have threshold number 2. Our algorithm improves the previously known O(m(2)) algorithm and generates the two threshold components. The algorithm can be easily adapted to recognize 2-threshold graphs with exactly three cutpoints.

关键词： algorithms recognition algorithms THRESHOLD GRAPHS THRESHOLD NUMBER

来源：评论

学校读者我要写书评

暂无评论

DECOMPOSITION OF QUATERNARY SIGNED-GRAPHIC MATROIDS

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 2024年第4期38卷 2599-2642页

作者： Papalamprou, Konstantinos Pitsoulis, Leonidas S. Vretta, Eleni-Maria E. Aristotle Univ Thessaloniki Dept Elect & Comp Engn Thessaloniki 54124 Greece

In this work we provide a decomposition theorem for a class of quaternary signed- graphic matroids. The decomposition is based on k- sums and a new operation called star composition, while the building blocks are graphic matroids and nongraphic matroids which become graphic upon the deletion of any co circuit. This result generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical basis for a recognition algorithm.

关键词： decomposition recognition algorithms signed-graphic matroids

来源：评论

学校读者我要写书评

暂无评论

Complexity of Finding Graph Roots with Girth Conditions

引用

ALGORITHMICA 2012年第1-2期62卷 38-53页

作者： Farzad, Babak Lau, Lap Chi Van Bang Le Nguyen Ngoc Tuy Brock Univ Dept Math St Catharines ON L2S 3A1 Canada Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China Univ Rostock Inst Informat Rostock Germany Hong Duc Univ Dept Comp Sci Thanh Hoa City Vietnam

Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H (2), however Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph H (of girth 3). In this paper we consider the characterization and recognition problems of graphs that are squares of graphs of small girth, i.e. to determine if G=H (2) for some graph H of small girth. The main results are the following. There is a graph theoretical characterization for graphs that are squares of some graph of girth at least 7. A corollary is that if a graph G has a square root H of girth at least 7 then H is unique up to isomorphism. There is a polynomial time algorithm to recognize if G=H (2) for some graph H of girth at least 6. It is NP-complete to recognize if G=H (2) for some graph H of girth 4.

关键词： Graph roots Graph powers recognition algorithms NP-completeness

来源：评论

学校读者我要写书评

暂无评论

On recognition of threshold tolerance graphs and their complements

引用

DISCRETE APPLIED MATHEMATICS 2017年第Part1期216卷 171-180页

作者： Golovach, Petr A. Heggernes, Pinar Lindzey, Nathan McConnell, Ross M. dos Santos, Vinicius Fernandes Spinrad, Jeremy P. Szwarcfiter, Jayme Luiz Univ Bergen Dept Informat POB 7803 N-5020 Bergen Norway Colorado State Univ Dept Math Ft Collins CO 80523 USA Colorado State Univ Dept Comp Sci Ft Collins CO 80523 USA Univ Estado Rio De Janeiro Dept Matemat Aplicada Rio De Janeiro Brazil Vanderbilt Univ Dept Elect Engn & Comp Sci 221 Kirkland Hall Nashville TN 37235 USA Univ Fed Rio de Janeiro Inst Matemat Caixa Postal 2324 BR-20001970 Rio De Janeiro RJ Brazil

A graph G = (V, E) is a threshold tolerance graph if each vertex v is an element of V can be assigned a weight w(v) and a tolerance t(v), such that two vertices x, y is an element of V are adjacent if w(x) + w(y) >= min(t(x), t(y)). Currently, the most efficient recognition algorithm for threshold tolerance graphs is the algorithm of Monma, Reed, and Trotter which has an O(n(4)) runtime. We give an O(n(2)) algorithm for recognizing threshold tolerance and their complements, the co-threshold tolerance (co-TT) graphs, resolving an open question of Golumbic, Weingarten, and Limouzy. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Graph classes recognition algorithms Threshold-tolerance graphs Strongly chordal graphs Interval graphs

来源：评论

学校读者我要写书评

暂无评论

Distance-hereditary comparability graphs

引用

DISCRETE APPLIED MATHEMATICS 2012年第18期160卷 2669-2680页

作者： Di Stefano, Gabriele Univ Aquila Dipartimento Ingn Elettr & Informaz I-67100 Laquila Italy

In this paper, we study the class of distance-hereditary comparability graphs, that is, those graphs which admit a transitive orientation and are completely decomposable with respect to the split decomposition. We provide a characterization based on a restricted number of forbidden subgraphs. We also provide further characterizations and one of them, based on the split decomposition, is used to devise a recognizing algorithm working in linear time. Finally, we show how to build distance-hereditary comparability graphs. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Comparability graphs Distance-hereditary graphs Split decomposition recognition algorithms Building algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：