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

IEEE International Conference on Software Quality, Reliability and Security (Companion Volume)

作者： Liu, Pan Xu, Zhenning (Jimmy) Ai, Jun Wang, Fei Shanghai Business Sch Coll Informat & Comp Shanghai Peoples R China Shanghai Key Lab Comp Software Testing & Evaluati Shanghai Peoples R China Univ Southern Maine Sch Business Portland ME 04103 USA Beihang Univ Sch Reliabil & Syst Engn Beijing Peoples R China

ISBN: (纸本)9781538620724

In the enterprise marketing process, on-line data plays more and more important role. As a type of data, spam (or fake) reviews of the products, however, have been seriously affecting the reliability of both decision making and data analysis of the enterprise. To detect spam reviews, the paper presents a set of opinion spam detection's identification indicators based on behavior features of the spammer. Two algorithms are then proposed to recognize similar reviews and relevant reviews from all reviews. Compared to the traditional algorithm, our review identification algorithm achieves shorter execution time. More importantly, the proposed algorithm for recognizing relevant reviews can be used to analyze the relevancy between the review content and the given review topic by using the automatic word segmentation technique. The Experimental results show that the number of fake reviews by our algorithms is higher than that of the traditional algorithm. Moreover, we found that about 46% of the mobile phone reviews on the Amazon website were irrelevant to the product's topic, and 54.7% of the reviews were similar to other reviews.

关键词： spam review similar review relevant review recognition algorithm behavior features of spammers

来源：评论

学校读者我要写书评

暂无评论

An algorithm of Extracting Signature and Seal of Electric Power Marketing Inspection Documents 6

An Algorithm of Extracting Signature and Seal of Electric Po...

引用

6th IEEE Advanced Information Technology, Electronic and Automation Control Conference (IEEE IAEAC)

作者： Liu, Guanyao Li, Jianyi Guangdong Power Grid Co Ltd Zhongshan Power Supply Bur Zhongshan Peoples R China

ISBN: (数字)9781665458641

ISBN: (纸本)9781665458641

At present, in the on-site inspection of electric power marketing data, manual inspection is needed to check whether documents conform to specifications, mainly to check whether there is a corresponding seal in the approval area of documents and whether there is a signature of the relevant person in charge. With the traditional technology, the inspectors check documents manually and pick out documents that do not meet the approval standards through visual inspection, which brings heavy workload, low efficiency, and a good chance to make mistakes. To realize automatic inspection, we need to scan printed documents into electronic document image, and extract the signature and seal from the image. However, some documents have both the seal and signature requirements, and the signature and the seal often have overlapping areas. The color of the area is different from the color of the original signature and the color of the seal. Therefore, when the signature and seal are extracted through color recognition, the complete seal outline and signature outline cannot be extracted. Based on this, this paper has proposed an algorithm for identifying signatures and seals, the Overlapping Signature and Seal Extraction algorithm (OSSEA). When the signature and the seal are present on the document, and the signature and the seal have overlapping areas, the image of signature and the outline of the seal can be completely extracted.

关键词： recognition algorithm Alarketing Inspection Image Extraction

来源：评论

学校读者我要写书评

暂无评论

Characterization of balanced graphs within claw-free graphs 12

Characterization of balanced graphs within claw-free graphs

引用

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

作者： Busolini, Lucia Duran, Guillermo Safe, Martin D. Univ Buenos Aires Fac Ciencias Exactas & Nat Dept Matemat Buenos Aires DF Argentina UBA CONICET Inst Calculo Buenos Aires DF Argentina UNS Dept Matemat Bahia Blanca Buenos Aires Argentina UNS CONICET INMABB Bahia Blanca Buenos Aires Argentina

A graph is balanced when its clique matrix is balanced. Bonomo, Duran, Lin and Szwarcfiter (2006) proved that a graph is balanced if and only if it contains no induced subgraphs known as extended odd suns. However, a characterization of balanced graphs by minimal forbidden induced subgraphs is not known. In this work, we find such a characterization when restricted to the class of claw-free graphs. As a consequence, we prove that there is an O(m(2) + n)-time algorithm that, given any graph, either decides that it is balanced or gives a certificate of the fact that it is not claw-free balanced. (C) 2023 The Authors. Published by Elsevier B.V.

关键词： balanced graphs claw-free graphs forbidden subgraphs recognition algorithm

来源：评论

学校读者我要写书评

暂无评论

Design of digital hardware system for pulse signals

引用

Journal of Medical Systems 2001年第6期25卷 385-394页

作者： Lee, Junyoung Kim, Jeonghoon Lee, Myoungho Dept. of Elec. and Electron. Eng. Graduate School of Yonsei University Seoul Korea South Korea Dept. of Electron. and Communication Shinheung College Kyungki-Do Korea South Korea

In this study, we have developed the digital hardware system which performs signal processing necessary for the filtering to eliminate noises by inputting pulse wave signals from the sensor group. With a view to obtain clinically effective information, we analyzed structural elements of pulse waveform and, thus, conducted a systematic classification. What is more, we performed the modeling of the digital filter by using the Steiglitz-McBride iteration method in order to get the same results with output signals coming out of an galvanometer of analog type of existing Pulse diagnosis system with input signals entering into galvanometer and coming out of the amp group of the Pulse diagnosis system.

关键词： digital hardware system pulse diagnosis recognition algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficiency of pregroups and the french noun phrase

引用

Journal of Logic, Language and Information 2005年第4期14卷 423-444页

作者： Degeilh, Sylvain Preller, Anne LIRMM/CNRS Montpellier France

We study mathematical and algorithmic properties of Lambek's pregroups and illustrate them by the French noun phrase. An algorithm of complexity n 3 to solve the reduction problem in an arbitrary free pregroup as ... 详细信息

We study mathematical and algorithmic properties of Lambek's pregroups and illustrate them by the French noun phrase. An algorithm of complexity n ³ to solve the reduction problem in an arbitrary free pregroup as well as recognition by a pregroup grammar is presented. This algorithm is then specified to run in linear time. A sufficient condition for a language fragment that makes the linear algorithm complete is given. © Springer 2005.

关键词： algorithmic complexity Categorial grammars Decision procedure French noun phrase Pregroups recognition algorithm

来源：评论

学校读者我要写书评

暂无评论

Polynomial Time recognition of Uniform Cocircuit Graphs

引用

Electronic Notes in Discrete Mathematics 2009年第C期35卷 29-34页

作者： Aiza, Ricardo Gómez Montellano Ballesteros, Juan José Strausz, Ricardo Knauer, Kolja Instituto de Matemáticas Universidad Nacional Autónoma de México México D.F. Mexico Institut für Mathematik Technische Universität Berlin Berlin Germany

We present an algorithm which takes a graph as input and decides in polynomial time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed co... 详细信息

关键词： cocircuit graph Oriented matroid polynomial algorithm recognition algorithm

来源：评论

学校读者我要写书评

暂无评论

A polynomial algorithm for recognizing perfect graphs

A polynomial algorithm for recognizing perfect graphs

引用

44th Annual IEEE Symposium on Foundations of Computer Science

作者： Cornuéjols, G Liu, XM Vuskovic, K Univ Marseille Dept Informat Marseille France

ISBN: (纸本)0769520405

We present a polynomial algorithm for recognizing whether a graph is perfect, thus settling a long standing open question. The algorithm uses a decomposition theorem of Conforti, Cornuejols and Vuskovic. Another polynomial algorithm for recognizing perfect graphs, which does not use decomposition, was obtained simultaneously by Chudnovsky and Seymour. Both algorithms need a first phase developed jointly by Chudnovsky, Cornuejols, Liu, Seymour and Vuskovic.

关键词： perfect graph odd hole recognition algorithm decomposition cleaning

来源：评论

学校读者我要写书评

暂无评论

recognition of Arithmetic Line Segments and Hyperplanes Using the Stern-Brocot Tree 3rd

Recognition of Arithmetic Line Segments and Hyperplanes Usin...

引用

3rd International Joint Conference on Discrete Geometry and Mathematical Morphology (DGM)

作者： Laboureix, Bastien Debled-Rennesson, Isabelle Univ Lorraine CNRS LORIA F-54000 Nancy France

ISBN: (纸本)9783031577925;9783031577932

The classic problem of discrete structure recognition is revisited in this article. We focus on naive digital straight segments (DSS) and, more generally, naive arithmetic hyperplanes, and we present a new approach to recognise these discrete structures based on the Stern-Brocot tree. The algorithm for DSS recognition proposes an alternative method to the state of the art, keeping the linear complexity and incremental character. While most of the concepts can be generalised to planes in dimension 3 and hyperplanes in higher dimensions, certain points in the process of descending in the Stern-Brocot tree need to be explored further. The proposed algorithm calculates separating chords characterising the membership of planes to cones generated by the branch of the Stern-Brocot tree. This generalisation shows the close link between arithmetic hyperplanes and the generalised Stern-Brocot tree and opens up interesting perspectives for the recognition of pieces of arithmetic hyperplanes.

关键词： digital straight segments arithmetic hyperplanes recognition algorithm Stern-Brocot tree

来源：评论

学校读者我要写书评

暂无评论

Comparison of families of algorithms for recognizing abnormal behavior of dynamic systems

引用

Moscow University Computational Mathematics and Cybernetics 2015年第1期39卷 41-47页

作者： Shcherbinin, V.V. Department of Computational Mathematics and Cybernetics Moscow State University Moscow 119992 Russian Federation

The problem of recognizing segments with abnormal behavior in multidimensional phase trajectories of dynamic systems is considered. algorithms solving this problem with the help of the axiomatic approach to abnormal behavior recognition in dynamic systems are described. Two parametric families of recognition algorithms based on this approach are considered. For the first parametric family, a necessary condition for the existence of a recognition algorithm making a bounded number of errors on an arbitrary phase trajectory is proved. It is shown that this condition can be violated in the course of learning the first family, but this cannot take place with the second family. Results of a numerical study are presented that demonstrate that the second family provides a better recognition quality and requires less time for training an algorithm than the first family. © 2015, Allerton Press, Inc.

关键词： multidimensional phase trajectory parametric family of algorithms recognition algorithm sample-based learning problem training sample

来源：评论

学校读者我要写书评

暂无评论

Research and Development of Vision Based Target System with Somatosensory Control 33

Research and Development of Vision Based Target System with ...

引用

33rd Chinese Control and Decision Conference (CCDC)

作者： Hou, Minrui Li, Yongbin Wang, Ding Heilongjiang Univ Coll Elect Engn Harbin 150080 Heilongjiang Peoples R China Key Lab Informat Fus Estimat & Detect Harbin 15008 Heilongjiang Peoples R China Harbin Huade Univ Harbin 150500 Heilongjiang Peoples R China

ISBN: (纸本)9781665440899

At present, the somatosensory target system game equipment in the market is still in its infancy. According to the current market situation and future development trends, this paper designs a home somatosensory target system. This design uses computer vision technology to realize somatosensory operation, discarding the throwing objects in traditional target system games, making it convenient, safe and improving its entertainment. This thesis first analyzes the requirements and performance index of the home somatosensory target, determines the overall design concept, and then designs the recognition algorithm, using computer vision technology to determine the thrower's throwing posture, and then determine it the accuracy of its throw. Finally, the system is programmed to realize its various functions, and to debug the various functions of the system. Experiments have proved that the system can determine the posture of the body after the throw is completed by the relative positional relationship between the hand and the head in the image, and use this as a basis to determine the accuracy of the throw, and then give the corresponding score. The system functions well and achieve the expected results.

关键词： Somatosensory control Computer vision recognition algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：