ppxscal/embedding_network huggingface dataset:
Research on Control of the Data Quality in Digital Land Spatial Database Based on GIS
Authors: Chen Weigong
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

GIS as the platform is beingwidely used in current construction of geoscience spatial database in China, and the quality ofits spatial data directly influences the quality of the spatial database of geoscience. Precision of spatial data, validity and integrality of attribute data, and validity of the spatial database's topological relations are the main factors which influence the quality of the spatial database. Through practical summarize, the article discusses concrete means and methods to control the data quality of the three aspects mentioned above. By the means and methods, the data quality can be guaranteed to meet the needs for setting up spatial database of geoscience and building up a spatial database of geoscience with good quality.
On Adapting the Tensor Voting Framework to Robust Color Image Denoising
Authors: Rodrigo Moreno, Miguel Angel Garcia, Domenec Puig, Carme Julià
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

This paper presents an adaptation of the tensor voting framework for color image denoising, while preserving edges. Tensors are used in order to encode the CIELAB color channels, the uniformity and the edginess of image pixels. A specific voting process is proposed in order to propagate color from a pixel to its neighbors by considering the distance between pixels, the perceptual color difference (by using an optimized version of CIEDE2000), a uniformity measurement and the likelihood of the pixels being impulse noise. The original colors are corrected with those encoded by the tensors obtained after the voting process. Peak to noise ratios and visual inspection show that the proposed methodology has a better performance than state-of-the-art techniques. 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
On the decoding of binary cyclic codes with the Newton identities
Authors: Daniel Augot, Magali Bardet, Jean-Charles Faugère
Venue: Journal of Symbolic Computation (2009)

We revisit in this paper the concept of decoding binary cyclic codes with Grobner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Grobner bases. Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas. Then we consider the so-called online Grobner basis decoding, where the work of computing a Grobner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred).
A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem
Authors: Yannis Marinakis, Magdalene Marinaki
Venue: Computers and Operations Research (2010)

The Probabilistic Traveling Salesman Problem (PTSP) is a variation of the classic Traveling Salesman Problem (TSP) and one of the most significant stochastic routing problems. In the PTSP, only a subset of potential customers need to be visited on any given instance of the problem. The number of customers to be visited each time is a random variable. In this paper, a new hybrid algorithmic nature inspired approach based on Particle Swarm Optimization (PSO), Greedy Randomized Adaptive Search Procedure (GRASP) and Expanding Neighborhood Search (ENS) Strategy is proposed for the solution of the PTSP. The proposed algorithm is tested on numerous benchmark problems from TSPLIB with very satisfactory results. Comparisons with the classic GRASP algorithm, the classic PSO and with a Tabu Search algorithm are also presented. Also, a comparison is performed with the results of a number of implementations of the Ant Colony Optimization algorithm from the literature and in 13 out of 20 cases the proposed algorithm gives a new best solution.
Early Detection of the Alzheimer Disease Combining Feature Selection and Kernel Machines
Authors: J. Ramírez, J. M. Górriz, M. López, D. Salas-Gonzalez, 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)

Alzheimer disease (AD) is a progressive neurodegenerative disorder first affecting memory functions and then gradually affecting all cognitive functions with behavioral impairments. As the number of patients with AD has increased, early diagnosis has received more attention for both social and medical reasons. However, currently, accuracy in the early diagnosis of certain neurodegenerative diseases such as the Alzheimer type dementia is below 70% and, frequently, these do not receive the suitable treatment. Functional brain imaging including single-photon emission computed tomography (SPECT) is commonly used to guide the clinician's diagnosis. However, conventional evaluation of SPECT scans often relies on manual reorientation, visual reading and semiquantitative analysis of certain regions of the brain. These steps are time consuming, subjective and prone to error. This paper shows a fully automatic computer-aided diagnosis (CAD) system for improving the accuracy in the early diagnosis of the AD. The proposed approach is based on feature selection and support vector machine (SVM) classification. The proposed system yields clear improvements over existing techniques such as the voxel as features (VAF) approach attaining a 90% AD diagnosis accuracy.
A class of nth-order BVPs with nonlocal conditions
Authors: John R. Graef, Toufik Moussaoui
Venue: Computers Mathematics with Applications (2009)

The aim of this paper is to present some existence results for a nonlinear nth-order boundary value problem with nonlocal conditions. Various fixed point theorems are used in the proofs. Examples are included to illustrate the results.
Attribution and the (non-)alignment of syntactic and discourse arguments of connectives
Authors: Nikhil Dines, Alan Lee, Eleni Miltsakaki, Rashmi Prasad, Aravind Joshi, Bonnie Webber
Venue: Proceedings of the Workshop on Frontiers in Corpus Annotations II: Pie in the Sky (2005)

The annotations of the Penn Discourse Treebank (PDTB) include (1) discourse connectives and their arguments, and (2) attribution of each argument of each connective and of the relation it denotes. Because the PDTB covers the same text as the Penn TreeBank WSJ corpus, syntactic and discourse annotation can be compared. This has revealed significant differences between syntactic structure and discourse structure, in terms of the arguments of connectives, due in large part to attribution. We describe these differences, an algorithm for detecting them, and finally some experimental results. These results have implications for automating discourse annotation based on syntactic annotation.
Removing image artifacts due to dirty camera lenses and thin occluders
Authors: Jinwei Gu, Ravi Ramamoorthi, Peter Belhumeur, Shree Nayar
Venue: ACM Transactions on Graphics (TOG) (2009)

Dirt on camera lenses, and occlusions from thin objects such as fences, are two important types of artifacts in digital imaging systems. These artifacts are not only an annoyance for photographers, but also a hindrance to computer vision and digital forensics. In this paper, we show that both effects can be described by a single image formation model, wherein an intermediate layer (of dust, dirt or thin occluders) both attenuates the incoming light and scatters stray light towards the camera. Because of camera defocus, these artifacts are low-frequency and either additive or multiplicative, which gives us the power to recover the original scene radiance pointwise. We develop a number of physics-based methods to remove these effects from digital photographs and videos. For dirty camera lenses, we propose two methods to estimate the attenuation and the scattering of the lens dirt and remove the artifacts -- either by taking several pictures of a structured calibration pattern beforehand, or by leveraging natural image statistics for post-processing existing images. For artifacts from thin occluders, we propose a simple yet effective iterative method that recovers the original scene from multiple apertures. The method requires two images if the depths of the scene and the occluder layer are known, or three images if the depths are unknown. The effectiveness of our proposed methods are demonstrated by both simulated and real experimental results.
Refinement of Interface Automata Strengthened by Action Semantics
Authors: Sebti Mouelhi, Samir Chouali, Hassan Mountassir
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Interface automata are light-weight models that capture the temporal interface behavior of software components. They have the ability to model both the input requirements and the output behavior of a component. They support the compatibility check between interface models to ensure a correct interaction between components and they adopt an alternating simulation approach to design refinement. In this paper, we extend our previous works on checking interface automata interoperability by adapting their alternating refinement relation to the action semantics. We show the relation between pre and post-conditions of transitions in the abstract version of an interface and their corresponding ones in its concrete version. We illustrate our extensions by a case study of the CyCab car component-based system.
An Object-Oriented Development Process and UML Modeling Tools
Authors: Ye Peilei
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

The software development nowadays exhibits some noticeable characteristics: model based development, team work, parallel development, incremental and iterative development, transregional development and so on. The development process becomes so complicated that a CASE environment is requested to support some mechanisms: mass tools integration, staff cooperation, process management, extensive data sharing, data management etc. So it comes naturally that not only mass, cooperating integrative development tools, but also the management environment with the ability to accomplish the above-mentioned tasks are in great demand. UML (Unified Modeling language) is one of the latest achievements in the field of software engineering these years. Basing on the experience of process engineering, we are constructing a development and management environment supporting UML. We’ll discuss in detail how this environment effectively supports the object-oriented (OO) development process based on UML, and how this environment satisfies the characteristics listed above. Especially, we will devote ourselves into solving the problems in the process management and the collaboration on data.
Fuzzy arrow-type results without the Pareto principle based on fuzzy pre-orders
Authors: Louis Aimé Fono, Véronique Donfack-Kommogne, Nicolas Gabriel Andjiga
Venue: Fuzzy Sets and Systems (2009)

In this paper, we introduce appropriate properties of fuzzy preferences and fuzzy aggregation rules. We use them to provide fuzzy counterparts of Malawski and Zhou's [A note on social choice theory without the pareto principle, Social Choice and Welfare 16 (1994)] and Wilson's [Social choice theory without the pareto principle, Journal of Economic Theory 5 (1972) 478-486] impossibility results concerning the aggregation of individual preferences, which do not assume the Pareto principle. By weakening conditions on fuzzy social preferences, we obtain a possibility result.
Adaptive Tips for Helping Domain Experts
Authors: Alana Cordick, Judi Mccuaig
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Workers from all sectors use software applications to complete day-to-day tasks. The mastery of new software applications can be frustrating to users who are otherwise job-experts and can temporarily decrease productivity. Job and task experts are not well served by tutoring approaches that combine instruction about the task with instruction about the tool. This work presents an architecture and prototype implementation that selects timely, task-appropriate hints for expert users as they work with an application to complete real tasks. The architecture maintains models of user and task, as well as a specialized model of tutoring-for-experts that was created by observing human tutors. This research shows that domain experts can be successfully scaffolded with adaptive hints while doing their work and that they endure less cognitive load than users for whom the scaffolding is not adapted to the task.
Evaluation Platform for a Multimedia Content Suggestion System
Authors: Virginie Galtier, Erwan Baynaud
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

"MediaTic project" aims at developing a service to suggest additional contents to a televiewer watching a program on his cell-phone, computer or TV based on his declared or inferred preferences. This article presents a demonstration platform to easily integrate and evaluate components of that recommender system both on a functional as well as on a performance points of view. The platform is based on a modular software architecture supported by a powerful generic purpose hardware installation.
Distortion analysis of analog multiplier circuits using two-dimensional integral nonlinear function
Authors: Luciano A. de Lacerda, Edson P. Santana, Cleber Vinícius A. de Almeida, Ana Isabela A. Cunha
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

This work presents an adaptation to the definition of the Integral Nonlinear Function (INLF) for distortion analysis of analog multipliers. Up to this time distortion in two-input multipliers has been evaluated by applying a constant signal to one of the inputs and verifying the linearity of the response with respect to the other input. This method however proves to be ineffective for assuring undistorted multiplying operation. Moreover, the conventional procedures, involving noisy and extensive AC measurements or FFT computation, are time-consuming and cumbersome, particularly if both multiplier input signals are taken into account simultaneously. Current-mode CMOS analog multiplier designs are simulated and analyzed concerning distortion by means of the proposed figure of merit (2D-INFL) and through a conventional procedure.
An Accelerated IHS Transform Fusion of Remote Sensing Image Data Based on GPU
Authors: Jun Lu, Baoming Zhang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

In this paper we designed a remote sensing image data fusion algorithm on GPU (Graphics Processing Unit) using the programmability of GPU which is a parallel vector processor. Both of the forward IHS and inverse IHS transform computation were mapped into GPU. We realized parallel rendering and output of the three components of the IHS, and the inverse IHS transformation using RTT (Render To Texture) and MTR (Multiple Render Targets) method to speed up the computation. The result shows that this algorithm on GPU is much faster than the previous CPU-based IHS transforming algorithm in the case of large data. And with the fusion images getting bigger the advantage of the velocity is more obvious in GPU implementation.
Morphemes as necessary concept for structures discovery from untagged corpora
Authors: Hervé Déjean
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

This paper describes an overview of a method which allows discovery of syntactic structures from untagged corpora. It is composed of three main steps: the discovery of the grammatical morphemes of the language. Then the construction of the chunks which are a multilingual conceptual level allowing the bypass of the limping notion of words. And Finally the discovery of the relations between chunks. We give an overview of the different procedures realized and we especially describe the discovery of morphemes. This operation is divided into three steps: the discovery of the most frequent morphemes of the language. Then the discovery of the other morphemes, and finally the segmentation of the words of the corpus. We concluded with the procedure of correction which required the chunk level. The concepts and algorithms were tested on a twenty natural languages like English, German, Turkish, Vietnamese, Swahili, Finnish, Latin, Indonesian.
A Secure and Survivable Architecture for SCADA Systems
Authors: I. Nai Fovino, A. Carcano, M. Masera
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

Industrial Systems are nowadays exposed to new kinds of malicious threats. The cause of this is related to the large number of new vulnerabilities and architectural weaknesses introduced by the extensive use of ICT and Networking Technologies for the operation and monitoring of such complex systems. Several scientific works, have showed how Supervisory Control And Data Acquisition Systems (SCADA), i.e. the systems which control industrial installations, are exposed to cyber attacks. These, due to the intrinsic nature of SCADA systems, cannot be avoided by using traditional ICT security measures. In this paper, we present a first prototype of survivable SCADA architecture, conceived in order to be resilient and robust to cyber SCADA attacks.
Research on Ecological Reconstruction of Subsided Land in Mining Area Based on Location Theory Taking Pingdingshan City as a Case
Authors: Liu Guiming, Li Cheng, Wang Hongzhi, Wu Liping
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

The subsided land of mining area is not only the land and ecological environment damage caused by the exploit of mineral resources but the very important land resource to sustainable development of the Resource-based cities. A view is put forward that the ecological reconstruction of collapsed land of the Resource-based cities should be planed based on its zones. Taken the Pingdingshan City as a case, the zoning ecological reconstruction plan of the collapsed land was made based on location theory, being accord to the urban function zones and development planning. The zoning plan will change the spontaneous agricultural reclamation to integrity of multi-use and from the single benefit of agriculture to the multi-gain of ecology and economy.
Research and Implementation of NURBS Real-Time and Look-Ahead Interpolation Algorithm
Authors: Haitao Wang, Dongbiao Zhao
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In order to meet the numerical control process requirements of high speed and high precision of three dimensional curves, the paper studied on a real-time and look-ahead interpolation algorithm for NURBS (non-uniform rational B-spline) curves. The federate is changed adaptive according to the shape of the curves. A real time look-ahead algorithm is introduced to detect the sharp corners. It is found that the values of the feedrate of the down stream sharp corners have profound effect on the down stream up corners causing ripple effect. By using two look-ahead distances strategy to eliminate all the ripple effect and obtain a continuous velocity and acceleration profile. In this way the impact on the machine is greatly reduced. This is compared with the adaptive NURBS interpolator to show the effectiveness of the proposed method. The experimental results show that the consideration of ripple effect is important in avoiding jerk and thereby increasing the machining accuracy.
Study on Constant Apparent Power Control Technology of Double-Fed Machine
Authors: Chengwu Lin, Hao Zheng
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

In this paper, constant apparent power control technique of the double-fed machine is studied theoretica-lly, and the mathematical model of constant apparent power control is presented according to the principle of vector control. Theoretical analysis and simulation results show that the model and control strategy is feasible. It not only can make full use of reserve capacity of the motor, but also can save about 30% energy and improve operating efficiency of the system.
Text Processing in Video Frames with Complex Background
Authors: Shuicai Shi, Tao Cheng, Shibin Xiao, Xueqiang Lv
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Information deficiency is a huge problem when researching on video indexing and retrieval. On the other hand, text in video frames implies lots of semantics inherently, and can provide supplemental but important information for video data processing. In this paper, we present a fast and robust approach for text detection, localization, extraction, and reorganization in video frames with complex background. Here, block change rate (BCR for short) is imported to realize text detection and localization, smoothness model is used to narrow the scope of the text stroke, element image division in Lab color space is implied in binary text extraction, and Langue model is imported to evaluate the text extraction results. Experiments based on a large amount of video frames from different sources show that this approach is robust, effective and compatible for variety videos with complex background.
A Simulation Approach to Understand the Viability of RFID Technology in Reducing Medication Dispensing Errors
Authors: Esther Jun, Jonathan Lee, Xiaobo Shi
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

RFID technology has the potential to reduce medication dispensing errors in hospitals. To determine possible uses for tracking medication within a hospital, we interviewed a pharmacist with knowledge of such processes. Due to cost considerations, the most viable place to use RFID technology is to track medication upon leaving the pharmacy, which can help reduce lost or misplaced medication and ensure that the right medication is given to the right patient. A simulation model that compares the benefits with and without RFID is also discussed.