ppxscal/embedding_network huggingface dataset:
Finger vein recognition using minutia-based alignment and local binary pattern-based feature extraction
Authors: Eui Chul Lee, Hyeon Chang Lee, Kang Ryoung Park
Venue: International Journal of Imaging Systems and Technology (2009)

With recent increases in security requirements, biometrics such as fingerprints, faces, and irises have been widely used in many recognition applications including door access control, personal authentication for computers, Internet banking, automatic teller machines, and border-crossing controls. Finger vein recognition uses the unique patterns of finger veins to identify individuals at a high level of accuracy. This article proposes a new finger vein recognition method using minutia-based alignment and local binary pattern (LBP)-based feature extraction. Our study makes three novelties compared to previous works. First, we use minutia points such as bifurcation and ending points of the finger vein region for image alignment. Second, instead of using the whole finger vein region, we use several extracted minutia points and a simple affine transform for alignment, which can be performed at fast computational speed. Third, after aligning the finger vein image based on minutia points, we extract a unique finger vein code using a LBP, which reduces false rejection error and thus the equal error rate (EER) significantly. Our resulting EER was 0.081&percnt; with a total processing time of 118.6 ms. &copy; 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 179&ndash;186, 2009
Conceptual Graph Rules and Equivalent Rules: A Synthesis
Authors: Marie-Laure Mugnier
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

This paper is an extended abstract of the talk given at ICCS'09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual graph rules and on the semantically equivalent knowledge constructs in logic and databases, namely rules with existential variables and tuple-generating dependencies. The aim of this presentation is to synthesize main decidability, complexity and algorithmic results obtained on this kind of rules. We emphasize the fact that the graph vision of rules has led to new results.
Mining Proximal Social Network Intelligence for Quality Decision Support
Authors: Yuan-Chu Hwang
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

The concepts of proximity have been utilized for exploring both psychological and geographical incentives for users within social networks to collaborate with others for mutual goals. The massive information does not facilitate quality decision support. In this paper, we focus on mining the proximal social network intelligence for quality decision support. The utilization of investigating both the context and the content of the application domain from social network relationships would highly improve the information quality for better decisions.Mining proximal social network intelligence from both context and content enable quality decision making. We illustrate a case of leisure recommendation e-service for bicycle exercise entertainment in Taiwan. We introduce the proximity e-service as well as its theoretical support.The most recent personalized experience according to its context provides remarkable perceptual data from unique information sources. Moreover, the social network relationships extend the power of the unique perceptual information to converge as the collective social network intelligence.
Improving and Extending SMR Technique for Solving Monotonic Problems
Authors: Atieh Mirshahvalad, Majid Noorhosseini
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

State matrix representation (SMR) model is an efficient technique to find an optimum plan for a monotonic problem introduced in 1994 in [2]. One of the prominent aspects of this technique is that robot action planning could be performed efficiently with simple matrix manipulation. Another important characteristic of SMR is that unlike most planning methods the actions involved in the planning process are not defined in advance but are generated at planning time. The syntax used for the actions while directly reflecting the semantics of actions, they can be easily manipulated by the planner. This paper presents extension and improvement of the SMR technique to generate more efficient plans. In this paper shortcomings of SMR technique are highlighted and an extension is provided to overcome the shortcomings. In addition, application of the improved version which we called ISMR to a new variation of the block world problem with different restriction is presented and the results are discussed.
Supporting collaborative activity
Authors: Meirav Hadad, Gilad Armon-Kest, Gal A. Kaminka, Sarit Kraus
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

This paper presents a model--SharedActivity--for collaborative agents acting in a group. The model suggests mental states for agents with different levels of cooperation and permits the formation of groups in which members increase individual benefits. Unlike previous models, the model covers group member behavior where group members do not have a joint goal, but act collaboratively. The model defines key components of a collaborative activity and provides a platform for supporting such activity. We studied the behavior of the model in a simulation environment. Results show how the benefit attained by cooperation is influenced by the complexity of the environment, the number of group members, and the social dependencies between the members. The results demonstrate that the model covers social behavior both in settings previously addressed, as well as in novel settings.
Dynamic Tension Allocation of Ship Mobile Mooring System under Sea Wind
Authors: Wangqiang Niu, Yan Zhang, Wei Gu, Jianxin Chu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

The mobile mooring system of ships usually consists of dozen of anchor windlasses, and it is an important question how these windlasses coordinate to fulfill the commanded tension input. The tension allocation of mobile mooring system with eight anchor windlasses is formulated in this study. The tension allocation problem is defined as an optimization problem and an active set method is adopted to find the optimized solutions. The simulation results show that the mobile mooring system is able to allocate dynamically the tension of each anchor windlass, and keep the ship at the desired position under sea wind.
The Heat Transfer Characteristics of Varied-Section Tube Heat Exchanger
Authors: Li Xuemei, Lv Jin-hu, Ding Lixing
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

The varied-section tube heat exchanger (VSTHE) that enhances the shell-side and tube-side heat transfer simultaneously provides high heat transfer performance, cuts tube vibration failures and saves material since it does not require tube-support elements. Experiments were conducted on the baffle shell-and-tube heat exchanger (STHE) and VSTHE under different flow rates to compare the heat transfer performance and pressure drop. The air side Nusselt number (Nu) and the overall heat transfer coefficient per pressure drop of VSTHE are approximately 20% and 25% respectively greater than that of the baffle STHE at the same Rea. The experimental results show that the performance of VSTHEs is superior to that of the baffle STHEs. The experimental heat transfer correlation for VSTHEs is obtained, which provides reference for further study on VSTHEs.
Clustered sub-matrix singular value decomposition
Authors: Fang Huang, Yorick Wilks
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

This paper presents an alternative algorithm based on the singular value decomposition (SVD) that creates vector representation for linguistic units with reduced dimensionality. The work was motivated by an application aimed to represent text segments for further processing in a multi-document summarization system. The algorithm tries to compensate for SVD's bias towards dominant-topic documents. Our experiments on measuring document similarities have shown that the algorithm achieves higher average precision with lower number of dimensions than the baseline algorithms - the SVD and the vector space model.
The Design and Analysis of IN Disaster Tolerant System Based on Birth-Death Process
Authors: Hong-man Wang, Fang-chun Yang, Gu-yue Han
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

Key technologies of Disaster Tolerant Intelligent Network are briefly introduced at first. After the hot-standby Disaster Tolerant IN architecture is analyzed, a load-sharing mode is proposed which has no downtime during switchover. By constructing the availability models of local clustered subsystem and the load-sharing Disaster Tolerant IN system based on Birth-Death process, it is proved that the load-sharing- based Disaster Tolerant IN system can meet the high availability requirement for disaster tolerance.
Preconditioned Gauss-Seidel Iterative Method for Linear Systems
Authors: He Hhonghao, Yuan Dongjin, Hou Yi, Xu Jinqiu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

The large scale sparse linear systems often appear in a wide variety of areas of mathematics, physical, fluid dynamics and economics science. So, solving efficiently these systems aroused many authors, interests. The iterative method which can take full advantage of the sparse matrix, thereby saving memory cell, so it is a more practical way to solve large sparse linear algebraic equations. The rule whether the iterative is good is usually described by convergence and convergence rate, thus, we should find an iterative method which has good convergence and fast convergence rate, this owns practical value. In order to solve linear system faster and better, we accelerate the convergence rate of iterative method. For solving the linear system Ax=b, different preconditioned AOR methods have been proposed by many authors. In this paper, we will give comparison of spectral radius between preconditioned Gauss-Seidel iterative methods with basic Gauss-Seidel method and basic AOR with a new preconditioner. Numerical example is also given to illustrate our results.
A Model for Saliency Detection Using NMFsc Algorithm
Authors: Jian Liu, Yuncai Liu
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Saliency mechanism has been considered crucial in the human visual system and helpful to object detection and recognition. This paper addresses an information theoretic model for visual saliency detection. It consists of two steps: first, using the Non-negative Matrix Factorization with sparseness constraints (NMFsc) algorithm to learn the basis functions from a set of randomly sampled natural image patches; and then, applying information theoretic principle to generate the saliency map by the Salient Information (SI) which is calculated from the coefficients represented by basis functions. We compare our model with the previous methods on natural images. Experimental results show that our model performs better than existing approaches.
Sensor Network for Gas Meter Application
Authors: David C. Ni, Chou Hsin Chin
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

This paper presents a real world case of implementing a sensor network for fulfilling the requirements of gas meter application. We propose a hierarchical network, which includes the functionalities such as receiving, transmitting, routing, auto-reconfiguring, scheduling, and deep-sleeping under the stringent requirement of power consumption. We are currently conducting tests on this system and collecting problems for further improvements. This architecture is expected to meet the application requirements.
Diagnosability Test for Nonlinear Systems Using the Characteristic Set
Authors: Zhang Jiafan, Liu Xiang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Differential algebra tools have been applied to study the identifiability of dynamic systems described by polynomial or rational equations, but have hardly ever been considered to check the diagnosability of nonlinear systems. The diagnosability here is given by the algebraic observability of the variable modelling the fault. In this note, the differential polynomials defining dynamical systems are considered as the generators of a differential ideal in a differential ring. The characteristic set of this ideal describes the same solution set of the original system. Its special structure allows to construct the exhaustive summary of the model used to test the diagnosability.
Casper*: Query processing for location services without compromising privacy
Authors: Chi-Yin Chow, Mohamed F. Mokbel, Walid G. Aref
Venue: ACM Transactions on Database Systems (TODS) (2009)

In this article, we present a new privacy-aware query processing framework, Capser&ast;, in which mobile and stationary users can obtain snapshot and/or continuous location-based services without revealing their private location information. In particular, we propose a privacy-aware query processor embedded inside a location-based database server to deal with snapshot and continuous queries based on the knowledge of the user's cloaked location rather than the exact location. Our proposed privacy-aware query processor is completely independent of how we compute the user's cloaked location. In other words, any existing location anonymization algorithms that blur the user's private location into cloaked rectilinear areas can be employed to protect the user's location privacy. We first propose a privacy-aware query processor that not only supports three new privacy-aware query types, but also achieves a trade-off between query processing cost and answer optimality. Then, to improve system scalability of processing continuous privacy-aware queries, we propose a shared execution paradigm that shares query processing among a large number of continuous queries. The proposed scalable paradigm can be tuned through two parameters to trade off between system scalability and answer optimality. Experimental results show that our query processor achieves high quality snapshot and continuous location-based services while supporting queries and/or data with cloaked locations.
Design of Intelligent Dissolved Oxygen Detecting System Based on CAN Bus and Embedded USB Host
Authors: Xingqiao Liu, Yang Liu, Xiaoxia Gong, Hailian Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In order to collect dissolved oxygen (DO) content, transmit far away and store reliably in fish culture, this paper introduces an intelligent dissolved oxygen detecting system based on CAN bus and embedded USB host. Here, CAN bus is applied to field environment of aquaculture. Using real-time, reliability and flexibility of the CAN bus, DO content could be monitored real-time and reliably in water environment. Embedded USB host can operate without PC and store the collected data to USB storage equipment, which extends storage capacity of the system. Reliable data for control of DO concentration could be obtained by the system, and it could be applied to other situation which needs DO content.
Implementation of a Text-to-Speech System for Kurdish Language
Authors: Fatemeh Daneshfar, Wafa Barkhoda, Bahram Zahir Azami
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

Nowadays the concatenative synthesis method is becoming more popular for the text to speech systems. The quality of synthetic speech is improving steadily, and the application field is also expanding rapidly. Today, speech synthesizers of various qualities are available as several different products for many common languages. In this paper, we give an overview of the Kurdish Text-to-Speech (TTS) system that we have developed at the University of Kurdistan. This system is based on the state-of-the-art of concatenative speech synthesizers. A brief review of the major system components is presented with emphasis on the features that are more relevant to the Kurdish language. Remaining challenges and future research directions are also discussed.
Parsing coordinations
Authors: Sandra Kübler, Wolfgang Maier, Erhard Hinrichs, Eva Klett
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

The present paper is concerned with statistical parsing of constituent structures in German. The paper presents four experiments that aim at improving parsing performance of coordinate structure: 1) reranking the n-best parses of a PCFG parser, 2) enriching the input to a PCFG parser by gold scopes for any conjunct, 3) reranking the parser output for all possible scopes for conjuncts that are permissible with regard to clause structure. Experiment 4 reranks a combination of parses from experiments 1 and 3. The experiments presented show that n-best parsing combined with reranking improves results by a large margin. Providing the parser with different scope possibilities and reranking the resulting parses results in an increase in F-score from 69.76 for the baseline to 74.69. While the F-score is similar to the one of the first experiment (n-best parsing and reranking), the first experiment results in higher recall (75.48% vs. 73.69%) and the third one in higher precision (75.43% vs. 73.26%). Combining the two methods results in the best result with an F-score of 76.69.
A Practical RF Propagation Model for Wireless Network Sensors
Authors: Tsenka Stoyanova, Fotis Kerasiotis, Aggeliki Prayati, George Papadopoulos
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

In the present work, we propose a practical RF propagation model – Free-space Outdoor Model – suitable for WSN due to the fact that it considers the most important WSN constraints and RF signal propagation path loss factors. The model is based on combining four path loss factors, which cause distortion and weakening of the RF signal, i.e. free-space path loss, ground reflection path loss, RSS uncertainty and antenna pattern irregularity. The proposed model is verified with actual measurements realized with Tmote Sky sensor node equipped with 2.4GHz CC2420 radio module.
Decentralized supply chain formation: a market protocol and competitive equilibrium analysis
Authors: William E. Walsh, Michael P. Wellman
Venue: Journal of Artificial Intelligence Research (2003)

Supply chain formation is the process of determining the structure and terms of exchange relationships to enable a multilevel, multiagent production activity. We present a simple model of supply chains, highlighting two characteristic features: hierarchical subtask decomposition, and resource contention. To decentralize the formation process, we introduce a market price system over the resources produced along the chain. In a competitive equilibrium for this system, agents choose locally optimal allocations with respect to prices, and outcomes are optimal overall. To determine prices, we define a market protocol based on distributed, progressive auctions, and myopic, non-strategic agent bidding policies. In the presence of resource contention, this protocol produces better solutions than the greedy protocols common in the artificial intelligence and multiagent systems literature. The protocol often converges to high-value supply chains, and when competitive equilibria exist, typically to approximate competitive equilibria. However, complementarities in agent production technologies can cause the protocol to wastefully allocate inputs to agents that do not produce their outputs. A subsequent decommitment phase recovers a significant fraction of the lost surplus.
Discussion of Present Isotopic Hydrograph Separation (IHS) Method
Authors: Weimin Bao, Tao Wang, Haiying Hu, Simin Qu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Runoff sources and dominant flow paths are still poorly understood in most catchments. Consequently, isotope hydrograph separation methods are widely used to improve our understanding about runoff generation. Isotope hydrograph separation (IHS) is based on the mass balance equation of water flux and isotope tracer concentration. The isotope analysis machine (for example, mass spectrum) available can only get the δ-value of the isotope tracer. An analysis is presented for quantifying the error in two- and three- component tracer-based hydrograph separation. This analysis compared the error between ratio balance method and mass balance method in computing mixed fractions to determine which method is more accurate. In the ratio balance method, the ratio of isotope tracer in used in concentration mass balance equation; comparatively, in the mass balance method, the concentration of isotope tracer is used in the same equation. Many studies about two- and three-component tracer-based hydrograph separation are used to illustrate the application of the analysis. Because of the abundance of rare isotopes are so negligible, the difference between two methods is small in the isotopic hydrograph separation studies. In scientific research, it is not appropriate to substitute ratio for concentration in the isotope tracer concentration mass balance equation. Therefore, we recommend the use of mass balance method in the application of isotope hydrograph separation research to improve the degree of accuracy.
Rendering surface details with diffusion curves
Authors: Stefan Jeschke, David Cline, Peter Wonka
Venue: ACM Transactions on Graphics (TOG) (2009)

Diffusion curve images (DCI) provide a powerful tool for efficient 2D image generation, storage and manipulation. A DCI consist of curves with colors defined on either side. By diffusing these colors over the image, the final result includes sharp boundaries along the curves with smoothly shaded regions between them. This paper extends the application of diffusion curves to render high quality surface details on 3D objects. The first extension is a view dependent warping technique that dynamically reallocates texture space so that object parts that appear large on screen get more texture for increased detail. The second extension is a dynamic feature embedding technique that retains crisp, anti-aliased curve details even in extreme closeups. The third extension is the application of dynamic feature embedding to displacement mapping and geometry images. Our results show high quality renderings of diffusion curve textures, displacements, and geometry images, all rendered interactively.
A Coordination Risk Analysis Method for Multi-site Projects: Experience Report
Authors: Matthew Bass, James D. Herbsleb, Christian Lescher
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

It has been widely recognized that coordination amongst the people involved in developing a software intensive system is required for successful completion. Many projects, particularly those with team members separated by geographic distance, have an impeded ability to coordinate amongst some project members, which may cause a mismatch between the need of the project to coordinate and the ability to coordinate resulting in coordination break downs. This paper presents a Coordination Risk Analysis method for determining the significant coordination mismatches before they become an issue and experiences applying this method to geographically distributed projects.