ppxscal/embedding_network huggingface dataset:
Multi-cue Facial Feature Detection and Tracking
Authors: Jingying Chen, Bernard Tiddeman
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

An efficient and robust facial feature detection and tracking system is presented in this paper. The system is capable of locating a human face automatically. Six facial feature points (pupils, nostrils and mouth corners) are detected and tracked using multiple cues including facial feature intensity and its probability distribution, geometric characteristics and motion information. In addition, in order to improve the robustness of the tracking system, a simple facial feature model is employed to estimate the relative face poses. This system has the advantage of automatically detecting the facial features and recovering the features lost during the tracking process. Encouraging results have been obtained using the proposed system.
Ebay hacks, 2nd edition, Second edition
Authors: David A. Karp
Venue:  (2005)

Whatever you call it--an online auction house, the world's largest flea market, or a vast social experiment--no metaphor completely describes the huge trading community that is eBay. Underneath it all, eBay is also a computer program and a complex socio-economic system, requiring experience, finesse, and the right tools to master. eBay Hacks, 2nd Edition has been completely revised and updated to make use of an array of new tools and features, as well as to reflect the changes in the eBay API, eBay's policies, and general practices of its increasingly sophisticated users. In all, the new edition of eBay Hacks sports 30 brand-new hacks plus dozens of hacks that have been expanded, deepened, or otherwise completely rewritten. eBay Hacks shows you how to become a more efficient buyer and seller with clever tricks and shortcuts that will surprise even the most experienced eBayers. The book's wide range of topics covers all aspects of using eBay, such as advanced searching techniques, sniping tools, selling strategies, photography tips, and even research techniques for PowerSellers. But eBay Hacks doesn't just cover the basics; you'll learn how to write scripts to automate tedious tasks, take better photos, and tap into the eBay API to develop your own custom tools. Unlike any other book, eBay Hacks, 2nd Edition also provides insight into the social aspects of the eBay community, with diplomatic tools to help to get what you want with the least hassle and risk of negative feedback. This bestseller supplies you with the tools you need to master eBay, whether as a buyer or seller, casual surfer or serious collector, novice or seasoned expert. With this guide, you will become a savvy power user who trades smarter and safer, makes more money, enjoys successes, and has fun doing it.
Approach for Dynamically Composing Decentralised Service Architectures with Cross-Cutting Constraints
Authors: Varvana Myllärniemi, Christian Prehofer, Mikko Raatikainen, Jilles Gurp, Tomi Männistö
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

The emergence of open, composable Internet services and mashups means that services cannot be composed in a centralised manner. Despite this, cross-cutting constraints might exist between services, stemming from, e.g., security. Especially when used with mobile devices, these service compositions need to be constructed at runtime. This paper proposes a knowledge-based approach for dynamically finding and validating decentralised service compositions while taking into account cross-cutting constraints. The approach is exemplified with a case of a shopping mall portal.
On the Voiceless Aspirated Stops in Brazilian Portuguese
Authors: Mariane Antero Alves, Izabel Christine Seara, Fernando Santana Pacheco, Simone Klein, Rui Seara
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

This research work presents a study on voiceless stop variants for Brazilian Portuguese (BP). The analysis of these variants is based on voice onset time (VOT) measurements. By considering a semi-spontaneous speech corpus, the presence of aspiration in BP voiceless stops is verified. Concerning velar and alveolar stops, the aspirated variant is more frequent than the unaspirated one. Through VOT measurements, the presence of slightly aspirated stops is pointed out in such an analysis. The distribution of the variants with respect to the stress position in the syllable is also assessed.
The Architecture of Ant-Based Clustering to Improve Topographic Mapping
Authors: Lutz Herrmann, Alfred Ultsch
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

This paper analyzes the popular ant-based clustering approach of Lumer/Faieta. Analysis of formulae unveils that ant-based clustering is strongly related to Kohonen's Self-Organizing Batch Map. Known phenomena, e.g. formation of too many and too small clusters, can be explained due to that. Furthermore it is shown how topographic mapping of ant-based methods is substantially improved by means of a modified error function. This is demonstrated on few selected fundamental clustering problems.
A Novel Approach to Image Reconstruction Problem from Fan-Beam Projections Using Recurrent Neural Network
Authors: Robert Cierniak
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper presents a novel approach to the problem of image reconstruction from projections using recurrent neural network. The reconstruction process is performed during the minimizing of the energy function in this network. Our method is of a great practical use in reconstruction from discrete fan-beam projections. Experimental results show that the appropriately designed neural network is able to reconstruct an image with better quality than obtained from conventional algorithms. 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
A Unified Compressed Cache Hierarchy Using Simple Frequent Pattern Compression and Partial Cache Line Prefetching
Authors: Xinhua Tian, Minxuan Zhang
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In this paper, we propose a novel compressed cache hierarchy that uses a unified compression algorithm in both L1 data cache and L2 cache, called Simple Frequent Pattern Compression(S-FPC). This scheme can increase the cache capacity of L1 data cache and L2 cache without any sacrifice of the L1 cache access latency. The layout of compressed data in L1 data cache enables partial cache line prefetching and does not introduce prefetch buffers or increase cache pollution and memory traffic. Compared to a baseline cache hierarchy not supporting data compression in cache, on average, our cache hierarchy design increases the average L1 cache capacity(in terms of the average number of valid words in cache per cycle) by about 33%, reduces the data cache miss rate by 21%, and speeds up program execution by 13%.
Multiuser receivers for MC-CDMA MIMO systems with space-time block codes
Authors: Jung-Lang Yu, Ming-Feng Lee, Chih-Chan Lin
Venue: Signal Processing (2009)

In this paper, we examine the multiuser detection for quasi-synchronous multi-carrier code-division multiple-access (MC-CDMA) multiple-input multiple-output (MIMO) systems with space-time block codes (STBC). Considering Alamouti's STBC scheme which involves two transmit and multiple receive antennas, the Hermitian persymmetric-like property of the received signal is derived first. The forward-backward averaging technique and weighting analysis are then proposed for the blind constrained minimum output energy (CMOE), subspace-based and diagonal loading (DL)-based CMOE receivers. The forward-backward averaging technique, which uses twice the equivalent STBC blocks to design the multiuser receivers, reduces the bit-error-rate (BER) tremendously for the compared receivers. Besides, the weighting analyses are performed in which half of the computational cost is saved in the calculation of weight vectors. Finally, numerical simulations are given to evaluate and demonstrate the superiority of the multiuser receivers with forward-backward averaging technique and the correctness of weighting analyses.
GAF: Generic Adaptation Framework
Authors: Evgeny Knutov
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

The Generic Adaptation Framework research project aims to develop a new reference model for the adaptive information systems research field. The new model will extend the well known AHAM reference model, taking into account newly developed techniques and methodologies in this area as well as attempts to capture them in architecture models such as the Munich Reference Model [4], LAOS/LAG [2], [5] and the extension from pure adaptive hypermedia to adaptive information systems, as studied in the Hera research program for instance [6].
Combining Different Product Line Models to Balance Needs of Product Differentiation and Reuse
Authors: Juha Savolainen, Juha Kuusela, Mike Mannion, Tuomo Vehkomäki
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Software reuse is a key enabler for producing successful software intensive consumer products. Initially, just adopting reuse was enough to achieve competitive advantage; today an efficiently running product line is almost expected for any organization producing widely varying, software intensive consumer products. The major source for competitive advantage has shifted to product line management, and especially an organization's ability to optimize the alignment of its product line development approach with its competitive strategy. In this paper, we explore ways to match product line development for an organization pursuing differentiation strategy. In this context, the success of the product line is determined by the success of the resulting products, their ability to gain differentiation against the competition as well as within the product portfolio. If all products appear too similar to each other, market segmentation fails. In this paper, we first discuss the problems hounding real industrial product lines. All the experiences are based on experiences gathered being closely involved with more than ten operating product lines and observing multiple failures in being able to realize true benefits of reuse. Then we show how a product line organization can be tuned so that the benefits of reuse are attainable while supporting significantly varying set of products. Finally, we give examples of product lines that have evolved into the direction suggested by us.
Directed Network Representation of Discrete Dynamical Maps
Authors: Fragiskos Kyriakopoulos, Stefan Thurner
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

We suggest a network representation of dynamical maps (such as the logistic map) on the unit interval. The unit interval is partitioned into N subintervals, which are associated with 'nodes' of the network. A link from node i to j is defined as a possible transition of the dynamical map from one interval i, to another j. In this way directed networks more generally allow phasespace representations (i.e. representations of transitions between different phasespace cells), of dynamical maps defined on finite intervals. We compute the diameter of these networks as well as the average path length between any two nodes. We numerically demonstrate that these network characteristics seem to diverge at the (first) zeros of the Lyapunov exponent and could thus provide an alternative measure to detect the 'edge of chaos' in dynamical systems.
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Authors: Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

Given an undirected graph G = (V,E) and a weight function w : E ¿¿ + , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all vertices is minimized. In this paper (1) we prove that the problem is strongly NP-hard if all edge weights belong to the set {1,k}, where k is any integer greater than or equal to 2, and that there exists no pseudo-polynomial time approximation algorithm for this problem whose approximation ratio is smaller than (1 + 1/k) unless P=NP; (2) we present a polynomial time algorithm that approximates the general version of the problem within a factor of (2 ¿ 1/k), where k is the maximum weight of an edge in G; (3) we show how to approximate the special case in which all edge weights belong to {1,k} within a factor of 3/2 for k = 2 (note that this matches the inapproximability bound above), and (2 ¿ 2/(k + 1)) for any k ¿ 3, respectively, in polynomial time.
Quantum Computing without Magic: Devices
Authors: Zdzislaw Meglicki
Venue: Scientific And Engineering Computation (2008)

This text offers an introduction to quantum computing, with a special emphasis on basic quantum physics, experiment, and quantum devices. Unlike many other texts, which tend to emphasize algorithms, Quantum Computing without Magic explains the requisite quantum physics in some depth, and then explains the devices themselves. It is a book for readers who, having already encountered quantum algorithms, may ask, "Yes, I can see how the algebra does the trick, but how can we actually do it?" By explaining the details in the context of the topics covered, this book strips the subject of the "magic" with which it is so often cloaked. Quantum Computing without Magic covers the essential probability calculus; the qubit, its physics, manipulation and measurement, and how it can be implemented using superconducting electronics; quaternions and density operator formalism; unitary formalism and its application to Berry phase manipulation; the biqubit, the mysteries of entanglement, nonlocality, separability, biqubit classification, and the Schroedinger's Cat paradox; the controlled-NOT gate, its applications and implementations; and classical analogs of quantum devices and quantum processes. Quantum Computing without Magic can be used as a complementary text for physics and electronic engineering undergraduates studying quantum computing and basic quantum mechanics, or as an introduction and guide for electronic engineers, mathematicians, computer scientists, or scholars in these fields who are interested in quantum computing and how it might fit into their research programs.
Lattice Population and Optimality of Sex Ratio: Effect of Sterile Male
Authors: Tokiya Nitta, Kei-Ichi Tainaka, Yukio Sakisaka, Bungo Saito, Tatsuya Togashi, Jin Yoshimura
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

To know the optimality under given conditions is one of most important problems in various fields. In the present paper, we focus on the optimality of sex ratio ¿ in animals. So far, the optimal sex ratio has been obtained by evolutionarily stable strategy (ESS) in most cases. Recently, however, our coauthors have presented a lattice model of mating population to explain the optimality not by ESS but by the sustainability. They mainly studied the symmetrical case between male and female. In the present paper, we deal with asymmetrical cases: there are sterile male. Our results relatively well explain the evolution of animal sex ratio.
Convergence Verification: From Shared Memory to Partially Synchronous Systems
Authors: K. Mani Chandy, Sayan Mitra, Concetta Pilotto
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies a subclass of such systems for which convergence properties can be verified based on the proof of convergence for the corresponding discrete-time shared state system. The proof technique extends to the class of systems in which an agent's state evolves continuously over time. The proof technique has been formalized in the PVS interface for timed I/O automata and applied to verify convergence of a mobile agent pattern formation algorithm.
A Mechanism for Ensuring the Validity and Accuracy of the Billing Services in IP Telephony
Authors: Dimitris Geneiatakis, Georgios Kambourakis, Costas Lambrinoudakis
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

The current penetration, but also the huge potential, of Voice over IP (VoIP) telephony services in the market, boosts the competition among telecommunication service providers who promote new services through many different types of offers. However, this transition from the closed Public Switched Telephone Network (PSTN) architecture to the internet based VoIP services, has resulted in the introduction of several threats both intrinsic i.e. VoIP specific, and Internet oriented. In the framework of this paper, we are considering threats that may affect the accuracy and validity of the records of the billing system that the service provider is using for charging the users. We are proposing a simple, practical and effective mechanism for protecting telecommunication service providers and end users from malicious activities originated from the end users and telecommunication service providers respectively. In both cases the malicious activity concerns fraud through the billing system. The proposed mechanism focuses on VoIP services that are based on the Session Initiation Protocol (SIP). However, it can be easily amended to cover other VoIP signaling protocols, as it takes advantage of the underlying AAA network infrastructure to deliver robust time stamping services to SIP network entities.
Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem
Authors: Heiko Hamann, Heinz Wörn
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

It is becoming state-of-the-art to form large-scale multi-agent systems or artificial swarms showing adaptive behavior by constructing high numbers of cooperating, embodied, mobile agents (robots). For the sake of space- and cost-efficiency such robots are typically miniaturized and equipped with only few sensors and actuators resulting in rather simple devices. In order to overcome these constraints, bio-inspired concepts of self-organization and emergent properties are applied. Thus, accuracy is usually not a trait of such systems, but robustness and fault tolerance are. It turns out that they are applicable to even hard problems and reliably deliver approximated solutions. Based on these principles we present a heuristic for the Euclidean Steiner tree problem which is NP-hard. Basically, it is the problem of connecting objects in a plane efficiently. The proposed system is investigated from two different viewpoints: computationally and behaviorally. While the performance is, as expected, clearly suboptimal but still reasonably well, the system is adaptive and robust.
A new study in maintenance for transmission lines based on independent component analysis
Authors: Lijia Ren, Xiuchen Jiang, Gehao Sheng, Wu Bo
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

It is important to monitor transmission towers and prevent increasingly common line break caused by human activity, in order to ensure the reliability and safety of the power grid operation. A new function is proposed to enhance the state maintenance of transmission lines. It relies on the monitoring of the high-voltage transmission towers to ensure the reliability and safety of the power grid operation. An approach which combines Independent Component Analysis (ICA) with neural network based on Particle Swarm Optimization (PSO) algorithm is presented to extract the vibration source signals caused by the destruction of the towers. The proposed algorithm separates the source vibration signals based on the FastICA. In order to distinguish the vibration pulse signal from other similar interference pulses, the algorithm of the feed forward neural network (FFNN) is used to identify the vibration pulses. Numerical results show that the algorithm is effective in extracting and identifying the vibration signals.
Classification Agent-Based Techniques for Detecting Intrusions in Databases
Authors: Cristian Pinzón, Yanira Paz, Rosa Cano
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper presents an agent specially designed for the prevention and detection of SQL injection at the database layer of an application. The agent incorporates a Case-based reasoning mechanism whose main characteristic involves a mixture of neural networks that carry out the task of filtering attacks. The agent had been tested and the results obtained are presented in this study.
An anytime approximation method for the inverse Shapley value problem
Authors: Shaheen Fatima, Michael Wooldridge, Nicholas R. Jennings
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Coalition formation is the process of bringing together two or more agents so as to achieve goals that individuals on their own cannot, or to achieve them more efficiently. Typically, in such situations, the agents have conflicting preferences over the set of possible joint goals. Thus, before the agents realize the benefits of cooperation, they must find a way of resolving these conflicts and reaching a consensus. In this context, cooperative game theory offers the voting game as a mechanism for agents to reach a consensus. It also offers the Shapley value as a way of measuring the influence or power a player has in determining the outcome of a voting game. Given this, the designer of a voting game wants to construct a game such that a player's Shapley value is equal to some desired value. This is called the inverse Shapley value problem. Solving this problem is necessary, for instance, to ensure fairness in the players' voting powers. However, from a computational perspective, finding a player's Shapley value for a given game is #P-complete. Consequently, the problem of verifying that a voting game does indeed yield the required powers to the agents is also #P-complete. Therefore, in order to overcome this problem we present a computationally efficient approximation algorithm for solving the inverse problem. This method is based on the technique of 'successive approximations'; it starts with some initial approximate solution and iteratively updates it such that after each iteration, the approximate gets closer to the required solution. This is an anytime algorithm and has time complexity polynomial in the number of players. We also analyze the performance of this method in terms of its approximation error and the rate of convergence of an initial solution to the required one. Specifically, we show that the former decreases after each iteration, and that the latter increases with the number of players and also with the initial approximation error.