ppxscal/embedding_network huggingface dataset:
Similarity of Names Across Scripts: Edit Distance Using Learned Costs of N-Grams
Authors: Bruno Pouliquen
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

Any cross-language processing application has to first tackle the problem of transliteration when facing a language using another script. The first solution consists of using existing transliteration tools, but these tools are not usually suitable for all purposes. For some specific script pairs they do not even exist. Our aim is to discriminate transliterations across different scripts in a unified way using a learning method that builds a transliteration model out of a set of transliterated proper names. We compare two strings using an algorithm that builds a Levenshtein edit distance using n-grams costs. The evaluations carried out show that our similarity measure is accurate.
A Secure YS-Like User Authentication Scheme
Authors: Tzung-Her Chen, Gwoboa Horng, Ke-Chiang Wu
Venue: Informatica (2007)

Recently, there are several articles proposed based on Yang and Shieh's password authentication schemes (YS for short) with the following features: (1) A user can choose password freely. (2) The server does not need to maintain a password table. (3) There is no need to involve a trusted third party. Although there were several variants of the YS-like schemes claimed to address the forgery attacks, this paper analyzes their security and shows that they still suffer from forgery attacks. Furthermore, a new scheme based on the concept of message authentication is proposed to foil the forgery attack.
Scheduling of Updates in an IP Forwarding Engine with Partitioned Prefix Tables
Authors: Junghwan Kim, Jinsoo Kim
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Many IP forwarding engines have used TCAM(Ternary Content Addressable Memory) for IP address lookup. While TCAM has the advantage of parallel lookup in a single step, it has a difficulty in updating a prefix table. TCAM requires the prefix table to be ordered for the longest prefix matching, so each update may incur several memory movements to maintain the ordering. For the fast updating of the prefix table, it is needed to eliminate the ordering constraint. If a prefix table is partitioned into several sets each of which contains disjoint prefixes, there is at most one match in each set and the ordering of prefixes is not needed any more for the longest prefix matching. Prefixes of each partitioned table should be kept disjoint after updating as well as in the initial configuration. In this paper we present several algorithms for scheduling of updates to keep prefixes of partitioned tables disjoint. We compare and evaluate our scheduling algorithms by simulation with a real-world routing table and updates. Experiment results show that most of updates can be scheduled to the partitioned tables having disjoint prefixes so good update performance can be achieved.
Integrated process simulation of primary shaping: multi scale approaches
Authors: D. Kauzlari&#x0107;, J. Lienemann, L. Pastewka, A. Greiner, J. G. Korvink
Venue: Microsystem Technologies (2008)

We investigate simulation approaches for the modelling of the primary shaping processes micro powder injection moulding and micro casting. We could reproduce the segregation during micro powder injection moulding (MicroPIM) with a simulation using particle methods. The phase field method allows for accurate prediction of the dynamics of solidification of a melt, whereby model order reduction is used to limit the computational effort. The results give valuable advice for the process conduct and the dimensioning of the micro parts.
Value Creation and Capture: A Model of the Software Development Process
Authors: Todd Little
Venue: IEEE Software (2004)

Understanding software development dynamics can help managers and project team members maximize value delivery. Using functions and parameters applied in a spreadsheet, this process model facilitates this understanding by examining value creation and value capture in the presence of uncertainty. Items to explore include project staffing, optimal release dates, and potential impacts of process improvements such as pair programming.
Formal Semantics in the Real World
Authors: Johan Bos
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

Formal methods for the analysis of the meaning of natural language expressions have long been restricted to the ivory tower built by semanticists, logicians, and philosophers of language. It is only in exceptional cases that these methods make their way straight into open-domain natural language processing tools. Recently, however, this situation has changed. Thanks to (i) the development of treebanks, i.e., large collections of texts annotated with syntactic structures, (ii) robust statistical parsers trained on such treebanks, and (iii) the development of large-scale semantic lexica such as WordNet [1], VerbNet [2], PropBank [3], and FrameNet [4], we now have witnessed the development of wide-coverage systems that are able to produce formal semantic representations for open-domain texts.
Composition of Model Programs
Authors: Margus Veanes, Colin Campbell, Wolfram Schulte
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

Model programs are a useful formalism for software testing and design analysis. They are used in industrial tools, such as SpecExplorer, as a compact, expressive and precise way to specify complex behavior. One of the challenges with model programs has been the difficulty to separate contract modeling from scenario modeling. It has not been clear how to separate those concerns in a clean way. In this paper we introduce composition of model programs, motivate why it is useful to be able to compose model programs, and what composition of model programs formally means.
Invariant Object Recognition with Slow Feature Analysis
Authors: Mathias Franzius, Niko Wilbert, Laurenz Wiskott
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Primates are very good at recognizing objects independently of viewing angle or retinal position and outperform existing computer vision systems by far. But invariant object recognition is only one prerequisite for successful interaction with the environment. An animal also needs to assess an object's position and relative rotational angle. We propose here a model that is able to extract object identity, position, and rotation angles, where each code is independent of all others. We demonstrate the model behavior on complex three-dimensional objects under translation and in-depth rotation on homogeneous backgrounds. A similar model has previously been shown to extract hippocampal spatial codes from quasi-natural videos. The rigorous mathematical analysis of this earlier application carries over to the scenario of invariant object recognition.
Auditing Inference Based Disclosures in Dynamic Databases
Authors: Vikram Goyal, S. K. Gupta, Manish Singh, Anand Gupta
Venue: Proceedings of the 5th VLDB workshop on Secure Data Management (2008)

A privacy violation in an information system could take place either through explicit access or inference over already revealed facts using domain knowledge. In a post violation scenario, an auditing framework should consider both these aspects to determine exact set of minimal suspicious queries set. Update operations in database systems add more complexity in case of auditing, as inference rule applications on different data versions may generate erroneous information in addition to the valid information. In this paper, we formalize the problem of auditing inference based disclosures in dynamic databases, and present a sound and complete algorithm to determine a suspicious query set for a given domain knowledge, a database, an audit query, updates in the database. Each element of the output set is a minimal set of past user queries made to the database system such that data revealed to these queries combined with domain knowledge can infer the valid data specified by the audit query.
Virtual Avatar Enhanced Nonverbal Communication from Mobile Phones to PCs
Authors: Jiejie Zhu, Zhigeng Pan, Guilin Xu, Hongwei Yang, David Adrian Cheok
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Nonverbal communication is a special kind of communication using wordless messages such as gesture, body language, posture, facial expression and eye contact. Such communications are specially attractive in virtual environments (VEs) which incorporating 3D avatars. Many of techniques for nonverbal communication in VEs have been studied and reported. However, transferring existing techniques to mobile platform are seldom reported. In this paper, we introduce our approach of creating a nonverbal communication environment between mobile phone and normal PCs. 3D face modeling is taken as an example to explain the system architecture. This modeling process is integrated with 3 platforms. The prior knowledge of modeling only uses one front view image which can be captured by built-in phone camera without high quality constrain. The two ends,between phone to phone or phone to PC, can download models from server and share the communication environment. Key techniques such as facial features detecting, face model personalizing are presented and experiment results show a lifelike face-to-face conversation can be simulated.
Semantic Turkey: A Semantic Bookmarking Tool (System Description)
Authors: Donato Griesi, Maria Teresa Pazienza, Armando Stellato
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

In this work we introduce Semantic Turkey, a Semantic Extension for the popular web browser Mozilla Firefox. Semantic Turkey can be used to keep track of relevant information from visited web sites and organize collected content according to a personally defined ontology. Clear separation between knowledge data (the WHAT) and web links (the WHERE) is established into the knowledge model of the system, which allows for innovative navigation of both the acquired information and of the pages where it has been collected. This paper describes the architecture of the Semantic Turkey extension for Firefox, analyzes its development, shows its most interesting features and presents our plans for future improvements of the tool.
Design principles for opportunistic communication in constrained computing environments
Authors: Earl A. Oliver, Srinivasan Keshav
Venue: Proceedings of the 2008 ACM workshop on Wireless networks and systems for developing regions (2008)

Constrained computing environments, such as smartphones and embedded wireless devices, are becoming increasingly prevalent. Driven by the need to minimize power usage, these devices are characterized by their low-power CPUs, limited memory, slow yet vast amounts of persistent storage, and one or more wireless network interfaces. As the dominant form of future computing, understanding and adapting to the trade offs that exist between computing and communication resources and energy consumption will become increasingly important. In this paper we consider the effect of a constrained computing environment on opportunistic communication. Drawing from our experiences with two existing mobile systems, we detail the constraints that inhibit opportunistic communication. We also show how these constraints can be satisfied using a set of design principles for systems that depend on opportunistic communication.
A New Hybrid Ant Colony Optimization Algorithm for the Traveling Salesman Problem
Authors: Xiaoxia Zhang, Lixin Tang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper presents a novel hybrid ant colony optimization approach (ACO PR) to solve the traveling salesman problem (TSP). The main feature of this hybrid algorithm is to hybridize the solution construction mechanism of the ACO with path relinking (PR), an evolutionary method, which introduces progressively attributes of the guiding solution into the initial solution to obtain the high quality solution as quickly as possible. Moreover, the hybrid algorithm considers both solution diversification and solution quality, and it adopts the dynamic updating strategy of the reference set and the criterion function restricting the frequencies of using the path-relinking procedure to accelerate the convergence towards high-quality regions of the search space. Finally, the experimental results for benchmark TSP instances have shown that our proposed method is very efficient and competitive to solve the traveling salesman problem compared with the best existing methods in terms of solution quality.
AWT: Aspiration with Timer Search Algorithm in Siguo
Authors: Hui Lu, Zhengyou Xia
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

Game playing is one of the classic problems of artificial intelligence. The Siguo game is an emerging field of research in the area of game-playing programs. It provides a new test bed for artificial intelligence with imperfect information. To improve search efficiency for Siguo with more branches and the uncertain payoff in the game tree, this paper presents a modified Alpha-Beta Aspiration Search algorithm, which is called Alpha-Beta Aspiration with Timer Algorithm (AWT). The AWT can quickly find a suboptimal payoff (acceptable value) from the game tree by adjusting a window with a timer. The timer is controlled by two parameters (M, N) that vary with the chess-board status of Siguo. Experiments show that AWT achieves the goals of the improvability of time efficiency, although it costs a little more memory and does not lead to the best payoff, but to an acceptable payoff.
Dual-Energy X-Ray Absorptiometry Method Using a Full Field Digital Mammography System
Authors: Aurelie Laidevant, Serghei Malkov, Alfred Au, John Shepherd
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

We report on the design of a dual-energy X-ray absorptiometry (DXA) method applied to Hologic Selenia digital mammography systems. The aim of the project is to quantify breast composition without thickness assumptions. The method is intended to be applied to standard mammography views as well as ex vivo breast samples. We established the calibration and accuracy using novel calibration phantoms. In this paper, we present our method and preliminary results using an excised whole breast sample. Results showed an average accuracy on the measurements to be less than 3% in the determination of the percent density of the breast phantoms. The chemical analysis of the excised breast and the DXA results agreed within 2%.
Divergence versus Convergence of Intelligent Systems: Contrasting Artificial Intelligence with Cognitive Psychology
Authors: Stefan Artmann
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Artificial Intelligence (AI) and Cognitive Psychology (CP) are two sciences of intelligent systems that share many features. If we want, nevertheless, to contrast AI with CP, we must investigate differences between the strategies they follow in exploring intelligence. To do so, I transform the Turing Test into a more adequate intelligence test based on a necessary condition for intelligence, namely that intensions of second-order intentional predicates are observable in a system (sect. 2). I then contrast CP and AI by their criteria for progress in research on this necessary condition for intelligence (sect. 3). 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
About acyclic edge colourings of planar graphs
Authors: Anna Fiedorowicz, Mariusz Hałuszczak, Narayanan Narayanan
Venue: Information Processing Letters (2008)

Let G=(V,E) be any finite simple graph. A mapping C:E->[k] is called an acyclic edge k-colouring of G, if any two adjacent edges have different colours and there are no bichromatic cycles in G. In other words, for every pair of distinct colours i and j, the subgraph induced by all the edges which have either colour i or j is acyclic. The smallest number k of colours, such that G has an acyclic edge k-colouring is called the acyclic chromatic index of G and is denoted by @g"a^'(G). In 1991, Alon et al. [N. Alon, C.J.H. McDiarmid, B.A. Reed, Acyclic coloring of graphs, Random Structures and Algorithms 2 (1991) 277-288] proved that @g"a^'(G)=
Hyper-Minimization in O(n2)
Authors: Andrew Badr
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

Two formal languages are f-equivalent if their symmetric difference L 1 ¿ L 2 is a finite set -- that is, if they differ on only finitely many words. The study of f-equivalent languages, and particularly the DFAs that accept them, was recently introduced [1]. First, we restate the fundamental results in this new area of research. Second, our main result is a faster algorithm for the natural minimization problem: given a starting DFA D, find the smallest (by number of states) DFA D¿ such that L(D) and L(D¿) are f-equivalent. Finally, we present a technique that combines this hyper-minimization with the well-studied notion of a deterministic finite cover automaton [2---4], or DFCA, thereby extending the application of DFCAs from finite to infinite regular languages. 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
Vehicle systems: comfort & security enhancement of face/speech fusion with compensational biometric modalities
Authors: Michael Biermann, Tobias Hoppe, Jana Dittmann, Claus Vielhauer
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

Biometric modalities can be used to improve security, safety and comfort in different applications. For example it is possible to restrict access to computer systems or buildings by biometric authentication. Since the usage of biometric modalities is considered more and more also for vehicles, in this paper we review two existing approaches of fusing speech, face and additional biometric modalities in automotive applications. We also combine them to an extended concept for an improvement of the achievable comfort and security. Especially we include additional soft biometric modalities to compensate failures of the biometric sensors to ensure business continuity through enhanced availability. However, enhancements of the comfort of biometric authentication systems on one side, often lead to a decrease of their security on the other. In a first theoretical simulation we show the overall comfort improvement, compare the new concept with the selected two existing approaches and discuss potential security implications.
Authoring Educational Games with Greenmind
Authors: Brent Martin
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

We present Greenmind, an authoring tool for developing intelligent educational games. Greenmind separates game development from ITS delivery, allowing specialist game developers or teachers to create their own game front-end clients for the WETAS ITS server, and making it possible for a game interface to be added to existing tutoring systems.
Potential Field Approach of a Cellular Automaton Evacuation Model and Its FPGA Implementation
Authors: Ioakeim G. Georgoudas, Georgios Ch. Sirakoulis, Ioannis Th. Andreadis
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Crowd evacuation from constructions can be modelled with the use of Cellular Automata. The crowd consists of individuals and its behaviour is modelled by the response of each individual to a simple updating rule that directs a person to the nearest exit as facilitates any object avoidance. Individual interactions are defined locally while the crowd motion evolves. In this paper, this motion approach is based on the concept of virtual potential fields that are defined by the location of exits, other pedestrians or objects. Electric charges located at exit and obstacle positions generate such fields. Characteristic features of crowd dynamics, such as incoherent-to-coherent pedestrian motion, blockings in front of exits and mass behaviour are successfully simulated. Finally, the paper presents the main architectural concepts of the corresponding dedicated FPGA processor, as the major structural part of an integrated, interactive, decision-support system.
How to Know if a Linear Code Is a Group Code?
Authors: José Joaquín Bernal, Ángel Río, Juan Jacobo Simón
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

We present an intrinsecal characterization of when a linear code C is a (left) group code, i.e. the ambient space can be identified with a group algebra in which the standard basis is the group basis such that C is a (left) ideal in this group algebra. As application we obtain a class containing properly the class of metacyclic groups such that every group code is an abelian group code. We also use the characterization to describe all the possible group structures on some classes of generalized Reed-Solomon codes.
Multi-bidding Strategy in Sponsored Keyword Auction
Authors: Tian-Ming Bu, Xiaotie Deng, Qi Qi
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

The generalized second price auction has recently become a much studied model for sponsored keyword auctions for Internet advertisement. Though it is known not to be incentive compatible, properties of its pure Nash equilibria have been well characterized under the single bidding strategy of each bidder.In this paper, we study the properties of pure Nash equilibria of the generalized second price auction when each bidder is allowed to submit more than one bid. This multi-bidding strategy is noted to have been adopted by companies for keyword advertisements on search engines. In consideration of the pure Nash equilibria, we completely characterize conditions on the number of selling slots for a pure Nash equilibrium to exist, assuming all the advertisers are allowed to use multi-bidding strategies or only one advertiser will use a multi-bidding strategy.Our findings reveal interesting properties of limitation and potentials of the market place of online advertisement.