ppxscal/embedding_network huggingface dataset:
Evolving the memory of a criminal&#x2019;s face: methods to search a face space more effectively
Authors: Charlie Frowd, Vicki Bruce, Melanie Pitchford, Carol Gannon, Mark Robinson, Colin Tredoux, Jo Park, Alex Mcintyre, Peter J. B. Hancock
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Witnesses and victims of serious crime are often required to construct a facial composite from their memory, a visual likeness of a suspect&#x2019;s face. The traditional method is for them to select individual facial features to build a face, but often these images are of poor quality. We have developed a new method whereby witnesses repeatedly select instances from an array of complete faces and a composite is evolved over time by searching a face model built using Principal Components Analysis. While past research suggests that the new approach is superior, performance is far from ideal. In the current research, face models are built which match a witness&#x2019;s description of a target. It is found that such &#x2018;tailored&#x2019; models promote better quality composites, presumably due to a more effective search, and also that smaller models may be even better. The work has implications for researchers who are using statistical modelling techniques for recognising faces.
Applying game achievement systems to enhance user experience in a photo sharing service
Authors: Markus Montola, Timo Nummenmaa, Andrés Lucero, Marion Boberg, Hannu Korhonen
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

Achievement systems are reward structures providing additional goals for players, and thus extending the play time of videogames. In this paper, we explore how applications other than games could benefit from achievement systems, and how users perceive this additional content in a service. For this purpose, we added an achievement system to a geo-tagged photo sharing service called Nokia Image Space. The results suggest that there is some potential in achievement systems outside the game domain. The achievements triggered some friendly competition and comparison between users. However, many users were not convinced, expressing concerns about the achievements motivating undesirable usage patterns. Therefore, an achievement system poses certain design considerations when applied in nongame software.
Improve Semantic Web Services Discovery through Similarity Search in Metric Space
Authors: Minghui Wu, Fanwei Zhu, Jia Lv, Tao Jiang, Jing Ying
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Most current semantic web services (SWS) discovery approaches focus on the matchmaking of services in a specific description language while in practical application the advertised services are often heterogeneous and distributed. This paper proposes a metric space approach to resolve this problem in which all heterogeneous web services are modeled as metric objects regardless of concrete description languages, and thereby the discovery problem can be treated as similarity search in metric space with a uniform criterion. In the matchmaking process, both the functional semantics and non-functional semantics of the web services are integrated as selection conditions for similarity query. And two types of similarity queries: range query and an improved nearest neighbor query are combined to produce a sorted result set.
Generating politeness in task based interaction: an evaluation of the effect of linguistic form and culture
Authors: Swati Gupta, Marilyn A. Walker, Daniela M. Romano
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

Politeness is an integral part of human language variation, e.g. consider the difference in the pragmatic effect of realizing the same communicative goal with either "Get me a glass of water mate!" or "I wonder if I could possibly have some water please?" This paper presents POLLy (Politeness for Language Learning), a system which combines a natural language generator with an AI Planner to model Brown and Levinson's theory of politeness (B&L) in collaborative task-oriented dialogue, with the ultimate goal of providing a fun and stimulating environment for learning English as a second language. An evaluation of politeness perceptions of POLLy's output shows that: (1) perceptions are generally consistent with B&L's predictions for choice of form and for discourse situation, i.e. utterances to strangers need to be much more polite than those to friends; (2) our indirect strategies which should be the politest forms, are seen as the rudest; and (3) English and Indian native speakers of English have different perceptions of the level of politeness needed to mitigate particular face threats.
Fast and Secure CBC-Type MAC Algorithms
Authors: Mridul Nandi
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

The CBC ¿ MAC or cipher block chaining message authentication code, is a well-known method to generate message authentication codes. Unfortunately, it is not forgery-secure over an arbitrary domain. There are several secure variants of CBC ¿ MAC, among which OMAC is a widely-used candidate. To authenticate an s-block message, OMAC costs (s + 1) block cipher encryptions (one of these is a zero block encryption), and only one block cipher key is used. In this paper, we propose two secure and efficient variants of CBC ¿ MAC: namely, GCBC1 and GCBC2. Our constructions cost only s block cipher encryptions to authenticate an s-block message, for all s ¿ 2. Moreover, GCBC2 needs only one block cipher encryption for almost all single block messages, and for all other single block messages, it costs two block cipher encryptions. We have also defined a class of generalized CBC-MAC constructions, and proved a sufficient condition for prf-security. In particular, we have provided an unified prf-security analysis of CBC-type constructions, e.g., XCBC, TMAC and our proposals GCBC1 and GCBC2.
Analysis and Design for Data Integration System of Urbanization Based on GIS Open Source Technology and Arc Engine
Authors: Lingli Zhao, Renliang Zhao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

With the rapid development of urbanization and the rapid development of information technologies, the amount of valuable data captured in different systems and different structures grew and technical progress made it possible to exchange and share data by these different systems and different structures. Urban information is a kind of multi-sources data, which not only contains spatial data, but also contains nonspatial data. These information have the characteristic of multiple types, multiple scales, large data, different data formats etc. The variety of these data demands that the data integration system could read all types of data, frame uniform standard to classify these data, establish the data relationship among them and integrate usable data resource. In search of solutions for these problems, the paper discusses how to design the frame of the urbanization system and how to manage and store multisources data. The paper implements the data integration system in the environment of .NET combined of GDAL/OGR library and ArcGIS Engine. In this paper, data are stored into the database in the form of a binary and metadata table are constructed to manage the multi-sources data. Application proves that the design of system and data management in the system is feasible, and something useful is concluded.
Probabilistic inference for machine translation
Authors: Phil Blunsom, Miles Osborne
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We advance the state-of-the-art for discriminatively trained machine translation systems by presenting novel probabilistic inference and search methods for synchronous grammars. By approximating the intractable space of all candidate translations produced by intersecting an ngram language model with a synchronous grammar, we are able to train and decode models incorporating millions of sparse, heterogeneous features. Further, we demonstrate the power of the discriminative training paradigm by extracting structured syntactic features, and achieving increases in translation performance.
CRIOP: A Human Factors Verification and Validation Methodology That Works in an Industrial Setting
Authors: Andreas Lumbe Aas, Stig Ole Johnsen, Torbjørn Skramstad
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

We evaluated CRIOP, a Human Factors (HF) based methodology, for the purpose of capturing the Norwegian Oil Gas (O G) industry's opinion of CRIOP to identify how it is used and suggest potential improvements. CRIOP has been a preferred method in the Norwegian O G industry and is used for Verification and Validation (V V) of a Control Centre's ability to safely and effectively handle all modes of operations. CRIOP consists of one introduction part, one checklist part and one scenario based part. We based our study on interviews of 21 persons, an online survey with 23 respondents and firsthand experience in workshops. The results showed that CRIOP is an effective Control Centre design V V tool. Highlighted issues were timing, stakeholders, planning and preparation of the analysis, adapting the checklists and the workshop facilitators' competence. We conclude that CRIOP is an effective V V tool, applied and appreciated by the Norwegian O G industry.
Feature Extraction and Selection from Vibration Measurements for Structural Health Monitoring
Authors: Janne Toivola, Jaakko Hollmén
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

Structural Health Monitoring (SHM) aims at monitoring buildings or other structures and assessing their condition, alerting about new defects in the structure when necessary. For instance, vibration measurements can be used for monitoring the condition of a bridge. We investigate the problem of extracting features from lightweight wireless acceleration sensors. On-line algorithms for frequency domain monitoring are considered, and the resulting features are combined to form a large bank of candidate features. We explore the feature space by selecting random sets of features and estimating probabilistic classifiers for damage detection purposes. We assess the relevance of the features in a large population of classifiers. The methods are assessed with real-life data from a wooden bridge model, where structural problems are simulated with small added weights.
Neural networks letter: Effects of spectral radius and settling time in the performance of echo state networks
Authors: Ganesh K. Venayagamoorthy, Bashyal Shishir
Venue: Neural Networks (2009)

Echo State Networks (ESNs) have tremendous potential on a variety of problems if successfully designed. The effects of varying two important ESN parameters, the spectral radius (@a) and settling time (ST) are studied in this letter. Spectral radius of an ESN is the maximum of all eigenvalues of the reservoir weights whereas ST is measured by the number of iterations allowed in the reservoir after its excitation by an input and before the sampling of the ESN output. The influence of these parameters on the performance of an ESN is illustrated using three different types of problems. These problems include a function approximation, a time series prediction and a complex system monitoring/estimation. An @a of 0.8 gives best result in all of these experiments and the performance of the ESN degrades when ST is increased. This degradation in the ESN's performance is due to the decaying of the echoes and attenuation in the reservoir. The increase in ST adversely affects the ESN performance and as such no long-term echoing arrangement is desired. Reducing ST greatly reduces the computational requirement making ESNs suitable even for tasks that require a high frequency of operation.
Generalized Bernstein polynomials with Pollaczek weight
Authors: B. Della Vecchia, G. Mastroianni, J. Szabados
Venue: Journal of Approximation Theory (2009)

Bernstein polynomials are a useful tool for approximating functions. In this paper, we extend the applicability of this operator to a certain class of locally continuous functions. To do so, we consider the Pollaczek weight w(x)@?exp(-1x(1-x)),0
A general upper bound for the cyclic chromatic number of 3-connected plane graphs
Authors: Hikoe Enomoto, Mirko Horňák
Venue: Journal of Graph Theory (2009)

The cyclic chromatic number of a plane graph G is the smallest number &chi;c(G) of colors that can be assigned to vertices of G in such a way that whenever two distinct vertices are incident with a common face, they receive distinct colors. It was conjectured by Plummer and Toft in 1987 that, for every 3-connected plane graph G, &chi;c(G)&le;&Delta;*(G) + 2, where &Delta;*(G) is the maximum face degree of G. The best upper bound known so far was &Delta;*(G) + 8. In the paper this bound is improved to &Delta;*(G) + 5. &copy; 2009 Wiley Periodicals, Inc. J Graph Theory 62: 1&ndash;25, 2009
Reconstruction of Worm Propagation Path by Causality
Authors: Wei Shi, Qiang Li, Jian Kang, Dong Guo
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Fast and accurate online tracing of network worm during its propagation is essential for worm containment and reducing the loss. Though worm is randomly spread, there exists implicit causality between adjacent infected nodes. Using this causality can help to enhance the performance of worm tracing algorithm. Bayesian Network can be a very good probability description of the current results and prior conditions. Based on the analysis of causality, we present an improved online tracing algorithm -- Bayesian Network Correlation Algorithm to acquire worm propagation path, and analyze and verify its accuracy and performance through simulation experiments. Experiment result indicates that the detection accuracy of Bayesian Network Correlation Algorithm has risen by 10% compared to our previous work, this improved algorithm is more suitable for online detection.
Poster abstract: Making sensor data available using Web feeds
Authors: Erik Wilde
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

The setup of and processing within sensor networks often requires sophisticated and specialized system designs and implementations, but the service provided by them should be as accessible and repurposable as possible. If the increasing number of available sensor-based data sources can be accessed in a simple and universal way, the network effect of aggregating, filtering, and republishing data from these sources will significantly increase their value. We propose an architecture where sensor-based data sources publish their data based on feeds, but extended with query capabilities. Using the well-known and widely supported Atom feed format and extending it with query capabilities allows us to lower the barrier-of-entry to sensor-based data sources, opening this data to a wider audience of clients.
An Information System for Provincial Mineral Resources Planning and Management Based on ArcGIS
Authors: Shengjun Zhong, Zhufang Wang, Tianping Bi
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Mineral resources are important parts of national land resources. It’s very important to establish mineral resources planning and management system for utilization of mineral resources efficiently and reasonably. The information system for mineral resources planning and management system (MRMIS) in Liaoning province was developed based on ArcGIS and Oracle. The developed system has three levels, which are provincial, municipal, and county level respectively, including a mineral resources planning and management system running on Windows forms (desktop application), and a web publishing system based on browser/server architecture (web application). The desktop application was developed based on ArcObjects component library, ArcSDE, Oracle using Visual Basic. The web application was developed based on ArcSDE, ArcIMS using ASP.Net and JavaScript. The main framework, data management, data transfer mechanism and functional modules were introduced.
On the Quantitative Estimation of Short-Term Aging in Human Faces
Authors: Marcos Ortega, Linda Brodo, Manuele Bicego, Massimo Tistarelli
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Facial aging has been only partially studied in the past and mostly in a qualitative way. This paper presents a novel approach to the estimation of facial aging aimed to the quantitative evaluation of the changes in facial appearance over time. In particular, the changes both in face shape and texture, due to short-time aging, are considered. The developed framework exploits the concept of "distinctiveness" of facial features and the temporal evolution of such measure. The analysis is performed both at a global and local level to define the features which are more stable over time.Several experiments are performed on publicly available databases with image sequences densely sampled over a time span of several years. The reported results clearly show the potential of the methodology to a number of applications in biometric identification from human faces.
Exception Handling in Electronic Contracting
Authors: Carlos Molina-Jimenez, Santosh Shrivastava, Massimo Strano
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

In a contract, exceptional clauses specify sanctions that come in force when the primary obligations are not fulfilled. An important aspect of exception handling is their resolution: determining which particular exception clause should be enforced when a violation is detected. This paper presents a specification and resolution technique for electronic contracts that can be used by a third party exception resolution service.
Randomized Routing Algorithms in Mobile Ad Hoc Networks: A comprehensive study
Authors: Israat Tanzeena Haque
Venue:  (2009)

In this book, the problem of finding a path from a source to a destination node in a mesh of mobile wireless nodes is considered. One class of solutions to this problem is based on the position-based routing paradigm, whereby the forwarding nodes rely solely on the knowledge of their geographical location (which can be established, e.g., via GPS), the location of their neighbors, and the location of the destination. This book proposes several new randomized position-based algorithms for routing in mobile ad-hoc networks. The proposed algorithms incorporate two heuristics: greedy aimed at minimizing the remaining distance of the packet to the destination, and compass striving to minimize the packet?s deviation from the direction towards the destination. Additionally, the routing decisions are randomized ? for improved flexibility and reliability communication. Experimental results obtained for various network topologies show that the delivery rates of our randomized algorithms are significantly better than those attained by the deterministic variants of the same heuristics. 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
Aligning medical domain ontologies for clinical query extraction
Authors: Pinar Wennerberg
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop (2009)

Often, there is a need to use the knowledge from multiple ontologies. This is particularly the case within the context of medical imaging, where a single ontology is not enough to provide the complementary knowledge about anatomy, radiology and diseases that is required by the related applications. Consequently, semantic integration of these different but related types of medical knowledge that is present in disparate domain ontologies becomes necessary. Medical ontology alignment addresses this need by identifying the semantically equivalent concepts across multiple medical ontologies. The resulting alignments can then be used to annotate the medical images and related patient text data. A corresponding semantic search engine that operates on these annotations (i.e. alignments) instead of simple keywords can, in this way, deliver the clinical users a coherent set of medical image and patient text data.
Automatic annotation for all semantic layers in FrameNet
Authors: Richard Johansson, Pierre Nugues
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

We describe a system for automatic annotation of English text in the FrameNet standard. In addition to the conventional annotation of frame elements and their semantic roles, we annotate additional semantic information such as support verbs and prepositions, aspectual markers, copular verbs, null arguments, and slot fillers. As far as we are aware, this is the first system that finds this information automatically.
Shot Boundary Detection and Keyframe Extraction Based on Scale Invariant Feature Transform
Authors: Gentao Liu, Xiangming Wen, Wei Zheng, Peizhou He
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

In shot boundary detection, the key technology is to compute the visual content discontinuity values between consecutive video frames. In this paper, a unified framework is proposed to detect the shot boundaries and extract the keyframes of a shot. Firstly, the Scale invariant feature transform (SIFT) is adopted to compute the visual content discontinuity values. Then a new method, which is called the Local Double Threshold Shot Boundary Detection (LDT-SBD), is used to detect shot boundaries. Lastly, two mechanisms are proposed to extract keyframe. Experimental results show the framework is effective and has a good performance.
An on-line electronic check system with mutual authentication
Authors: Chin-Chen Chang, Shih-Chang Chang, Jung-San Lee
Venue: Computers and Electrical Engineering (2009)

Electronic check (e-check) is an important component of electronic commerce. It was first proposed by Chaum in 1988. Till now, engineers have provided many improvements to enhance the security and functionality of the e-check system. The face value of a check and the identification of a payee, however, have to be determined previously in these improved versions. This results in the inflexibility of the system. In this paper, we aim to propose a novel e-check mechanism which allows a payer attaching the face value and the information of a payee to an e-check when dealing with a transaction. The security of this novel system is based on several cryptographic techniques including the secure one-way hash function, blind signature, and RSA cryptosystems.