ppxscal/embedding_network huggingface dataset:
A Support Vector Machine Based Online Learning Approach for Automated Visual Inspection
Authors: Jun Sun, Qiao Sun
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

In manufacturing industry there is a need for an adaptable automated visual inspection (AVI) system that can be used for different inspection tasks under different operation condition without requiring excessive retuning or retraining. This paper proposes an adaptable AVI scheme using an efficient and effective online learning approach. The AVI scheme uses a novel inspection model that consists of the two sub-models for localization and verification. In the AVI scheme, the region localization module is implemented by using a template-matching technique to locate the subject to be inspected based on the localization sub-mode. The defect detection module is realized by using the representative features obtained from the feature extraction module and executing the verification sub-model built in the model training module. A support vector machine (SVM) based online learning algorithm is proposed for training and updating the verification sub-model. In the case studies, the adaptable AVI scheme demonstrated its promising performances with respect to the training efficiency and inspection accuracy. The expected outcome of this research will be beneficial to the manufacturing industry.
Development of ISEE: An Information Security Engineering Environment
Authors: Daisuke Horie, Yuichi Goto, Jingde Cheng
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

This paper presents a requirement analysis, design, and implementation of ISEE: an information security engineering environment. ISEE integrates various tools and functions for supporting continuous and consistent design, development, management, maintenance, and abolition of security facilities of information systems with high security requirements, and forces users to perform their tasks according to ISO standards and a regular sequence. We defined requirements for ISEE to achieve continuous and consistent design, development, management, maintenance, and abolition of security facilities. We also designed ISEE according to the requirements, and implemented some tools of ISEE. Users of ISEE can ensure the whole security of a system by continuously and consistently performing their tasks.
Computer Aided Diagnosis of Alzheimer Disease Using Support Vector Machines and Classification Trees
Authors: D. Salas-Gonzalez, J. M. Górriz, J. Ramírez, M. López, I. Álvarez, F. Segovia, C. G. Puntonet
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This paper presents a computer-aided diagnosis technique for improving the accuracy of the early diagnosis of the Alzheimer type dementia. The proposed methodology is based on the combination of support vector machine learning with linear kernels and classification trees. The classification tree technique allows to choose wisely the most discriminant set of voxels in the images. Thus, the classification tree produces a considerably improvement upon considering the support vector machine classifier only.
An Efficient Local Invariant Region Detector for Image Retrieval
Authors: Ling Shao
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

An efficient algorithm for detecting invariant and salient image regions is presented. The detected regions are highly repeatable under various viewpoint and illumination variations. With the proposed implementation technique, the region detector becomes much more efficient and practical. Coupled with the distinctiveness and robustness of the detector, fast indexing and retrieval become possible. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Pre-stretching Simulation and Residual Stresses Measurement in Aluminum Alloy Thick Plates
Authors: Kai Liao, Yun-xin Wu, Hai Gong
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

In order to present the characteristics of stress field in pre-stretching thick plate, This paper discusses that both residual stresses of water bath and spraying quenching, after stretching 1.8%, 2.3% and 2.5% respectively, were measured and analyzed based on the analysis of the elastic-plastic constitutive relationship and simulation model. The author finds that residual stresses, from the surface to center, makes elastic energy represent the differences through-depth, and asymmetrical deformation achieves reduction and redistribution of residual stresses for stretching plates. The further research shows that the influence of quenching residual stresses intensity of thick plate on the effect of pre-stretching can be neglected and the final stress is controlled to a range fitting processing.
Overview of the INEX 2008 Book Track
Authors: Gabriella Kazai, Antoine Doucet, Monica Landoni
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

This paper provides an overview of the INEX 2008 Book Track. Now in its second year, the track aimed at broadening its scope by investigating topics of interest in the fields of information retrieval, human computer interaction, digital libraries, and eBooks. The main topics of investigation were defined around challenges for supporting users in reading, searching, and navigating the full texts of digitized books. Based on these themes, four tasks were defined: 1) The Book Retrieval task aimed at comparing traditional and book-specific retrieval approaches, 2) the Page in Context task aimed at evaluating the value of focused retrieval approaches for searching books, 3) the Structure Extraction task aimed to test automatic techniques for deriving structure from OCR and layout information, and 4) the Active Reading task aimed to explore suitable user interfaces for eBooks enabling reading, annotation, review, and summary across multiple books. We report on the setup and results of each of these tasks.
Low-Power Multiplier Design Using a Bypassing Technique
Authors: Chua-Chin Wang, Gang-Neng Sung
Venue: Journal of Signal Processing Systems (2009)

This paper presents a low power digital multiplier design by taking advantage of a 2-dimensional bypassing method. The proposed bypassing cells constituting the multiplier skip redundant signal transitions as well as computations when the horizontally partial product or the vertical operand is zero. Hence, it is a 2-dimensional bypassing method. Thorough post-layout simulations of a 8×8 digital multiplier using the proposed 2-dimensional bypassing method show that the power dissipation of the proposed design is reduced by more than 75% compared to prior designs. Physical measurements on silicon reveal that the proposed digital multiplier saves more than 28% even with pads' power dissipation compared to the prior works.
Tracking Extrema in Dynamic Environments with Quantum-behaved Particle Swarm Optimization
Authors: Ji Zhao, Jun Sun, Wei Chen, Wenbo Xu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

This paper present a global searching performance algorithm-- Quantum-behaved Particle Swarm Optimization (QPSO) algorithm applied to the complex dynamic environment. A number of experiments are performed to test the performance of the QPSO. The environments used in the experiments are generated by Dynamic Function # 1(DF1). The results of the experiments indicate that QPSO is more adaptive than Particle Swarm Optimizer (PSO) in dynamic environment.
A Heuristic Address Assignment Algorithm Based on Probability in a Network
Authors: Shu Wang, Changjia Chen
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

With the fast growth of the routing table sizes in backbone routers, reducing the size of routing tables on network becomes to be a basic problem in networking. After optimizing the content of a routing table, further reduction can be achieved by renumbering the address assigned to networks. In this paper, we propose a heuristic address assignment algorithm based on probability in order to reduce the routing table size. Our algorithm can guarantee the high probability that each node uses the same next hop to the nodes assigned with consecutive addresses, and then these consecutive addresses can be compressed to compact the routing tables. To evaluate this algorithm in practice, we implement it on real Internet inter-domain topology. The experimental results have shown that our method could reduce the size of the table to 24 % of the complete routing table while keeping the routes shortest paths. Moreover, we extend the routing method to allow the suboptimal routes, for each node only keeping a simpler routing table storing the routing state: O(d), where d is the node degree. By comparison with the algorithmic routing which uses a spanning tree to compute next hop for any source and destination pair, our routing method using this simpler routing table can provide the lower stretch.
On Improving the Efficiency of Eigenface Using a Novel Facial Feature Localization
Authors: Aleksey Izmailov, Adam Krzyżak
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Face recognition is the most popular non-intrusive biometric technique with numerous applications in commerce, security and surveillance. Despite its good potential, most of the face recognition methods in the literature are not practical due to the lack of robustness, slow recognition, and semi-manual localizations. In this paper, we improve the robustness of eigenface-based systems with respect to variations in illumination level, pose and background. We propose a new method for face cropping and alignment which is fully automated and we integrate this method in Eigenface algorithm for face recognition. We also investigate the effect of various preprocessing techniques and several distance metrics on the overall system performance. The evaluation of this method under single-sample and multi-sample recognition is presented. The results of our comprehensive experiments on two databases, FERET and JRFD, show a significant gain compared to basic Eigenface method and considerable improvement with respect to recognition accuracy when compared with previously reported results in the literature.
Finite Element Analysis for Gate Rotor Shaft of Single Screw Compressor
Authors: Bin Zhao, Ke Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The gate rotor shaft is main part of single screw compressor. In order to analyze the properties of it the finite element analysis is applied. Firstly the static mechanics analysis is completed by ANSYS software. The results show that the strength and stiffness satisfy the safety require. Secondly the residual and bending stresses analysis is done based on finite element method. The rules of the maximum normal stress distributions in depth planes are obtained. The SWT equivalent stress distribution along the surface of the gate rotor shaft is simulated. Then model analysis for the gate rotor shaft is finished by ANSYS software. The fatigue life of gate rotor shaft under different rotation speed is calculated depending on numerical method.
Design of Clinical Support Systems Using Integrated Genetic Algorithm and Support Vector Machine
Authors: Yung-Fu Chen, Yung-Fa Huang, Xiaoyi Jiang, Yuan-Nian Hsu, Hsuan-Hung Lin
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Clinical decision support system (CDSS) provides knowledge and specific information for clinicians to enhance diagnostic efficiency and improving healthcare quality. An appropriate CDSS can highly elevate patient safety, improve healthcare quality, and increase cost-effectiveness. Support vector machine (SVM) is believed to be superior to traditional statistical and neural network classifiers. However, it is critical to determine suitable combination of SVM parameters regarding classification performance. Genetic algorithm (GA) can find optimal solution within an acceptable time, and is faster than greedy algorithm with exhaustive searching strategy. By taking the advantage of GA in quickly selecting the salient features and adjusting SVM parameters, a method using integrated GA and SVM (IGS), which is different from the traditional method with GA used for feature selection and SVM for classification, was used to design CDSSs for prediction of successful ventilation weaning, diagnosis of patients with severe obstructive sleep apnea, and discrimination of different cell types form Pap smear. The results show that IGS is better than methods using SVM alone or linear discriminator. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Intelligent Method of Partition of Urban Fringe - A Case Study in Nanjing City
Authors: Cai Dong, Li Man-chun, Wei Wei, Hu Wei, Chen Qian
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Urban fringe is a special area with interaction of urban and rural areas. So far how to identify urban fringe automatically from urban area and rural areas is one of the major fields that urban geography concern. In this paper, remote sensing images of Nanjing district in 2003 is the calculating base. At the same time, the ERDAS Imagine and Visual C++ software are applied to program and recognize the image. The Breakpoint method, considering ratios of urban land-use as the only index, is used to divide the urban fringe of Nanjing city. Then this paper concludes a comparatively boundary between urban area and urban fringe. However, this paper also points out that the boundary of urban fringe is dynamic and in fact, subjective distinguishing with experience is needed in this process, this method is new effective way to divide and supervise urban fringe with mutation detection of land-use ratio and has great feasibility in practice.
Remote Electric Power Network Monitoring System Based on GPRS
Authors: Anan Fang, Jianchun Guo, Liping Luo
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

In the past, the managers of the electric power department know the situation whether electric power network works well, by recording all kinds of monitoring data artificially, or setting some observations for video surveillance with the aid of ISDN. While video surveillance has a lot of advantages, there are still many inadequacies, such as, requiring complex digital terminal, responding slowly, building the network on a small scale and costing highly. These constrain the development of it. Through a large number of experimental studies, using the China Mobile's GPRS wireless communication technology to transmit data, we can simply use the cell phone to complete the data reception. It is fast and cheap, making a good solution to the shortcomings of the video surveillance. In addition, in the aspect of data acquisition, we usually choose expensive A/D converter chip to ensure data's high accuracy. The author has used V/F chip to meet the required precision through massive successful experiments.
On the Training Patterns Pruning for Optimum-Path Forest
Authors: João P. Papa, Alexandre X. Falcão
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

The Optimum-Path Forest (OPF) classifier is a novel graph-based supervised pattern recognition technique that has been demonstrated to be superior to Artificial Neural Networks and similar to Support Vector Machines, but much faster. The OPF classifier reduces the problem of pattern recognition to a computation of an optimum-path forest in the feature space induced by a graph, creating discrete optimal partitions, which are optimum-path trees rooted by prototypes, i.e., key samples that will compete among themselves trying to conquer the remaining samples. Some applications, such that medical specialist systems for image-based diseases identification, need to be constantly re-trained with new instances (diagnostics) to achieve a better generalization of the problem, which requires large storage devices, due to the high number of generated data (millions of voxels). In that way, we present here a pruning algorithm for the OPF classifier that learns the most irrelevant samples and eliminate them from the training set, without compromising the classifier's accuracy.
Research on Web Information Filtering Based on DCM Algorithm
Authors: Luo Chang-ri, Zhang Xin-hua, Luo Shi-guang
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

In the past few years, the volume of junk information on the internet has grown tremendously, researchers' begun to handle this issue. In this paper, DCM (Discriminative Category Matching) algorithm is employed to filter the web information according to the content of information. To our knowledge, the algorithm is the first introduced into filtering. It takes the relative importance of a feature in a category, across categories and the average importance of a feature in a category into account, and modifies the traditional TF-IDF term weighting scheme to compute the domain class central vector. Experiments indicate that the algorithm is suitable for information filtering.
Towards Business and IT Alignment in the Future Internet: Managing Complexity in E-Business
Authors: Wilfrid Utz, Dimitris Karagiannis
Venue: Proceedings of the 2009 First International Conference on Advances in Future Internet (2009)

Managing complexity in the provision of business services through internet technology is regarded as the key success factor to establish services in the future internet. Numerous actors from different domains, working in different business settings and using heterogeneous IT technologies have to be integrated according to the business strategy identified. The paper at hand identifies the "E-BPMS Modeling and Analysis Framework" as an integration approach for the design and analysis of such complex environments. The E-BPMS framework is based on meta-modeling concepts allowing the flexible extension and adaptation of the framework. The paper shows the applicability of E-BPMS by providing application scenarios from a complex e-business project in the insurance sector and the modelling framework within the EC project BREIN.
A new incomplete method for CSP inconsistency checking
Authors: Belaïd Benhamou, Mohamed Réda Saïdi
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete methods which make an exhaustive search on the solution space. These methods have the advantage to prove CSP inconsistency, but their complexity grows exponentially when the problem size increases. The second family includes the incomplete methods that make a local search on the solution space. These methods have been efficiently used to find solutions for large size consistent CSPs that complete methods can not solve. One major drawback of the incomplete methods, is their inability to prove CSP inconsistency. One of the challenges that have been put forward by the CP community (Selman et al. 1997) is to provide incomplete methods that can deal with CSP inconsistency efficiently. The work that we present here, is a contribution towards an answer to this hard challenge. We introduce a new incomplete method for CSP inconsistency checking that is based on both a new notion of dominance between CSPs and a coloration of the CSP micro-structure. We experimented the method on randomly generated CSP instances and the results obtained are very promising.
Metacommunication Patterns in Online Communities
Authors: Arto Lanamäki, Tero Päivärinta
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

This paper discusses about contemporary literature on computer-mediated metacommunication and observes the phenomenon in two online communities. The results contribute by identifying six general-level patterns of how metacommunication refers to primary communication in online communities. A task-oriented, user-administrated, community (Wikipedia in Finnish) involved a remarkable number of specialized metacommunication genres. In a centrally moderated discussion-oriented community (Patientslikeme), metacommunication was intertwined more with primary ad hoc communication. We suggest that a focus on specialized metacommunication genres may appear useful in online communities. However, room for ad hoc (meta)communication is needed as well, as it provides a basis for user-initiated community development.
Simple Comparison of Spectral Color Reproduction Workflows
Authors: Jérémie Gerhardt, Jon Yngve Hardeberg
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

In this article we compare two workflows for spectral color reproduction : colorant separation (CS) followed by halftoning by scalar error diffusion (SED) of its resulting multi-colorant channel image and a second workflow by spectral vector error diffusion (sVED). Identical filters are used in both SED and sVED to diffuse the error. Gamut mapping is performed as pre-processing and the reproductions are compared to the gamut mapped spectral data. The inverse spectral Yule-Nielsen modified Neugebauer (YNSN) model is used for the colorant separation. To bring the improvement of the YNSN model upon the regular Neugebauer model into the sVED halftoning the n factor is introduced in the sVED halftoning. The performances of both workflows are evaluated in term of spectral and color differences but also visually with the dot distributions obtained by the two halftoning techniques. Experimental results have shown close performances for the compared workflows in term of color and spectral differences but visually cleaner and more stable dot distributions obtained by sVED.
GRID-ENABLED TRANSPORTATION ROUTING WITH REAL-TIME EVENTS
Authors: Ying Cao
Venue:  (2009)

Transportation routing has been enhanced by the research and development in both Geographic Information System (GIS) and network analysis. This book furthers the advancement by tackling transportation routing for an extensive area with real-time events. An open framework was introduced by: 1) leveraging microscopic transportation simulation for travel time estimation and prediction; 2) incorporating road weather information as an example of real-time event; 3) identifying the shortest-path in a space-time network; 4) enabling Grid computing in both traffic simulation over large areas and routing for massive concurrent user requests; and 5) integrating web-based GIServices based upon interoperability approaches. This book is for people who are interested in research and developments of cyber-infrastructure applications, transportation networks and topology analyses, distributed geospatial information processing, and geospatial interoperability. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player