ppxscal/embedding_network huggingface dataset:
Iris feature extraction using directional filter bank for personal identification
Authors: C. R. Prashanth, S. P. Ganavi, T. D. Mahalakshmi, K. B. Raja, K. R. Venugopal, L. M. Patnaik
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

Iris Recognition is a biometric tool, which has great emphasis in both research and practical applications. In this paper an Iris Recognition System using Directional Filter Bank (IRSDFB) is proposed. The normalized Iris is fragmented into three regions. The most distinctive features of the region nearer to the pupil are encoded to form the feature vector using Directional Filter Bank, instead of considering the entire Iris including the occluded portion. Therefore the Iris images captured with lesser cooperation can also be verified successfully. The decidability index of IRSDFB model is more compared to the existing algorithm using Gabor filter bank.
Malicious Bayesian Congestion Games
Authors: Martin Gairing
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

In this paper, we introduce malicious Bayesian congestion games as an extension to congestion games where players might act in a malicious way. In such a game each player has two types. Either the player is a rational player seeking to minimize her own delay, or --- with a certain probability --- the player is malicious in which case her only goal is to disturb the other players as much as possible.We show that such games do in general not possess a Bayesian Nash equilibrium in pure strategies (i.e. a pure Bayesian Nash equilibrium). Moreover, given a game, we show that it is NP-complete to decide whether it admits a pure Bayesian Nash equilibrium. This result even holds when resource latency functions are linear, each player is malicious with the same probability, and all strategy sets consist of singleton sets of resources. For a slightly more restricted class of malicious Bayesian congestion games, we provide easy checkable properties that are necessary and sufficient for the existence of a pure Bayesian Nash equilibrium.In the second part of the paper we study the impact of the malicious types on the overall performance of the system (i.e. the social cost). To measure this impact, we use the Price of Malice. We provide (tight) bounds on the Price of Malice for an interesting class of malicious Bayesian congestion games. Moreover, we show that for certain congestion games the advent of malicious types can also be beneficial to the system in the sense that the social cost of the worst case equilibrium decreases. We provide a tight bound on the maximum factor by which this happens. 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
Modeling scenario variability as crosscutting mechanisms
Authors: Rodrigo Bonifácio, Paulo Borba
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Variability management is a common challenge for Software Product Line (SPL) adoption, since developers need suitable mechanisms for specifying and implementing variability that occurs at different SPL artifacts (requirements, design, implementation, and test). In this paper, we present a novel approach for use case scenario variability management, enabling a better separation of concerns between languages used to manage variabilities and languages used to specify use case scenarios. The result is that both representations can be understood and evolved in a separate way. We achieve such a goal by modeling variability management as a crosscutting phenomenon, for the reason that artifacts such as feature models, product configurations, and configuration knowledge crosscut each other with respect to each specific SPL member. After applying our approach to different case studies, we achieved a better feature modularity and scenario cohesion.
Conflict-free coloring of unit disks
Authors: Nissan Lev-Tov, David Peleg
Venue: Discrete Applied Mathematics (2009)

The paper considers the geometric conflict-free coloring problem, introduced in [G. Even, Z. Lotker, D. Ron, S. Smorodinsky, Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks, SIAM J. Comput. 33 (2003) 94-133]. The input of this problem is a set of regions in the plane and the output is an assignment of colors to the regions, such that for every point p in the total coverage area, there exist a color i and a region D such that p@?D, the region D is colored i, and every other region D^' that contains p is not colored i. The target is to minimize the number of colors used. This problem arises from issues of frequency assignment in radio networks. The paper presents an O(1) approximation algorithm for the conflict-free coloring problem where the regions are unit disks.
Modeling Internet Link Delay Based on Measurement
Authors: Hongli Zhang, Yu Zhang, Ying Liu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Understanding Internet link delay is an important key of taking full advantage of Internet resources. In this paper, we find that the link delay follows Gammadistribution using Maximum Likelihood Estimation based on data measured in a large-scale network. The correlations between the link delay and the edge load, the node degree, and the betweenness are analyzed respectively. The link delay distribution parameters for different ranges of edge load are calculated. We findthat the edge load is correlated positively with the shape parameter of link delay Gamma distribution and negatively with the scale parameter.
Weighted quadrature rules for finite element methods
Authors: Saulo P. Oliveira, Alexandre L. Madureira, Frederic Valentin
Venue: Journal of Computational and Applied Mathematics (2009)

We discuss the numerical integration of polynomials times non-polynomial weighting functions in two dimensions arising from multiscale finite element computations. The proposed quadrature rules are significantly more accurate than standard quadratures and are better suited to existing finite element codes than formulas computed by symbolic integration. We validate this approach by introducing the new quadrature formulas into a multiscale finite element method for the two-dimensional reaction-diffusion equation.
Analysis of random walks with an absorbing barrier and chemical rule
Authors: Ahmed M. K. Tarabia
Venue: Journal of Computational and Applied Mathematics (2009)

Recently Tarabia and El-Baz [A.M.K. Tarabia, A.H. El-Baz, Transient solution of a random walk with chemical rule, Physica A 382 (2007) 430-438] have obtained the transient distribution for an infinite random walk moving on the integers -~0. In random walk terminology, the busy period concerns the first passage time to zero. This relation of these walks to queuing problems is pointed out and the distributions of the queue length in the system and the first passage time (busy period) are derived. As special cases of our result, the Conolly et al. [B.W. Conolly, P.R. Parthasarathy, S. Dharmaraja, A chemical queue, Math. Sci. 22 (1997) 83-91] solution and the probability density function (PDF) of the busy period for the M/M/1/~ queue are easily obtained. Finally, numerical values are given to illustrate the efficiency and effectiveness of the proposed approach.
Direct conversion transceiver design in the 863-870-Mhz band application: wireless sensor network
Authors: Hatem Trabelsi, Ghazi Bouzid, Faouzi Derbel, Mohamed Masmoudi
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Simulation results of a 863-870-MHz frequency-hopped spread-spectrum transceiver with binary frequency shift keying (BFSK) modulation at 20 kb/s for wireless sensor applications is presented. The various blocks parameters of the transmit/receive RF front end like noise figure (NF), gain, 1 dB compression point (P-1dB), and IIP3 are simulated and optimized to meet transceiver specifications. The receiver simulations show 51.1 dB conversion gain, -7 dBm IIP3, -15 dB return loss (S11) and 10 dB NF. The transmitter simulations show an output ACPR (Adjacent Channel Power Ratio) of -22 dBc, 3.3 dBm P-1dB of PA and transmitted power of 0 dBm. The transceiver simulations show an RMS frequency error of 1.45 Khz. Correlating BFSK detector and Arctangent-differentiated BFSK demodulator have been chosen and their BER performances have been co simulated with the analog receiver. The receiver achieves a BER of 10-3 at 10.5 dB of EbtoNo.
Implementing conditional conference call use case over IMS and non IMS testbed: an experimental results through comparison approach
Authors: Cheng-Suan Lee, Hui-Na Chua, Karyn Wei-Ju Khoo
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

IP Multimedia Subsystems (IMS) is a technology leading towards Next Generation Networks (NGN) which has the ability to provide converged service regardless of any access networks. This paper presents a conference call use case application and the realization of the application based on both IMS and non-IMS infrastructure design approaches. This paper also presents our findings in comparing the two approaches, and the identification of technical gaps and potential issues on IMS in supporting conferencing services through our exploratory and developmental research.
On the properties of the identically singular Lagrange problem
Authors: V. F. Chistyakov, M. Peshich
Venue: Automation and Remote Control (2009)

We consider the identically singular Lagrange problem of the calculus of variations. It is investigated how the conjugate points and the Jacobi equation index are related to the solvability conditions of the appropriate matrix Riccati equation and the reducibility of the functional to a perfect square. The criterion of the trajectory variation smallness at a small variation of the functional in the neighborhood of the extremal is obtained.
Complete Axiomatizations of MSO, FO(TC1) and FO(LFP1) on Finite Trees
Authors: Amélie Gheerbrant, Balder Cate
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

We propose axiomatizations of monadic second-order logic (MSO), monadic transitive closure logic (FO(TC 1 )) and monadic least fixpoint logic (FO(LFP 1 )) on finite node-labeled sibling-ordered trees. We show by a uniform argument, that our axiomatizations are complete, i.e., in each of our logics, every formula which is valid on the class of finite trees is provable using our axioms. We are interested in this class of structures because it allows to represent basic structures of computer science such as XML documents, linguistic parse trees and treebanks. The logics we consider are rich enough to express interesting properties such as reachability. On arbitrary structures, they are well known to be not recursively axiomatizable.
A multiprocessor with replicated shared memory
Authors: Sigurd L. Lillevik, John L. Easterday
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

A multiprocessor includes five 8086 microprocessors interconnected with replicated shared memory. Such a memory structure consists of a set of memories, one for each processor, with identical contents. This minimizes read interference since each processor simply accesses its own private copy of the shared memory. To ensure shared memory integrity, write requests transfer data over the MULTIBUS to all copies in parallel. Overall, replicated shared memory structures provide improved concurrency. An HP 64000 Logic Development System serves as a host computer for program development and a bulk storage device. A power-on and restart monitor in shared PROM provides a run-time debug and method for down-loading the operating system and application programs. The real-time, multi-tasked operating system (called MPX) distributes a sequence of high and low priority tasks, with possible preemption, among the processors. MPX floats from processor to processor while balancing the system load for maximum concurrency and throughput.
Research on passenger information system security management of the subway
Authors: Miao Jian, He Deqiang, Zhang Zhenrong
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The totally secure goal of building the Passenger information system of subway is proposed; the security management principle of the subway PIS is analyzed; the safe system structure of the subway PIS is studied. Finally, the safe solutions of the subway PIS is proposed. The method that constructs efficient network security protection system in the PIS designing process is proposed, which thus can ensure the security operation of the whole system and network.
MPEG-21 and Its Interoperability with Rights-Information Standards
Authors: Hogab Kang, Keunyoung Lee, Taehyun Kim, Xin Wang
Venue: IEEE MultiMedia (2009)

Providing effective protection and management for broadcast content is an important issue. However, multiple standards for managing protected broadcast programs exist today. Heterogeneous devices with different content-protection mechanisms face an interoperability problem in exchanging and interpreting various types of rights information that have different syntax and semantics. This article analyzes several rights information standards and demonstrates the promise of achieving convergence of the rights information and interoperability between these standards through the MPEG-21 Rights-Expression-Languages Dissemination-and-Capture profile.
Understanding the software problem
Authors: John B. Slaughter
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In addressing the question of the high cost of software it is essential, first of all, to surround the issue in such a way that it is possible to achieve some understanding of the problem and its causes. The first question to be answered is that of whether or not software costs are, in fact, too high. In order to answer this question requires a definition of software itself. Continuing this vein of questioning obviously can lead to a circuitous path which never leads to anything but tangential conclusions about pseudo problems and pseudo causes.
A social network approach to resolving group-level conflict in context-aware services
Authors: Ohbyung Kwon
Venue: Expert Systems with Applications: An International Journal (2009)

Group conflict that occurs when delivering context-aware services negatively affects service usage within a specific service space, and researchers have proposed few conflict resolution methods to address the issue. This paper presents a methodology to autonomously resolve the conflict arising between users in identical contexts, such as place and computing resources. To do so, a two-phase case-based reasoning method is proposed. To minimize privacy concerns, a social network model is applied to produce key social context data, secondary to personal data, and which is used in place of the users' personal data for case-based reasoning. To show the feasibility of the idea proposed in this paper, a prototype system with simulation-based validation is tested to determine conflict resolution strategies and a simulation test has been performed.
MythVideo: managing your videos
Authors: Michael J. Hammel
Venue: Linux Journal (2009)

Too many videos in your MythTV menu? With a little planning, finding your favorite movies can be a breeze
2009 Special Issue: Cortical basis of communication: Local computation, coordination, attention
Authors: Frederic Alexandre
Venue: Neural Networks (2009)

Human communication emerges from cortical processing, known to be implemented on a regular repetitive neuronal substratum. The supposed genericity of cortical processing has elicited a series of modeling works in computational neuroscience that underline the information flows driven by the cortical circuitry. In the minimalist framework underlying the current theories for the embodiment of cognition, such a generic cortical processing is exploited for the coordination of poles of representation, as is reported in this paper for the case of visual attention. Interestingly, this case emphasizes how abstract internal referents are built to conform to memory requirements. This paper proposes that these referents are the basis for communication in humans, which is firstly a coordination and an attentional procedure with regard to their congeners.
Coupling Interaction Resources in Ambient Spaces: There Is More Than Meets the Eye!
Authors: Nicolas Barralon, Joëlle Coutaz
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Coupling is the action of binding two entities so that they can operate together to provide new functions. In this article, we propose a formal definition for coupling and present two complementary conceptual tools to reason about coupling interaction resources. The first tool is a graph theoretic and algebraic notation that can be used to identify the consequents of causal couplings so that the side-effects of the creation of a coupling can be analyzed in a formal and systematic way. The second tool formulates the problem of coupling using an 8 state automaton that models the life cycle of a coupling and provides designers with a structure to verify that usability properties have been satisfied for each state. We conclude with the concept of meta-UI, an overarching interactive system that shows that coupling is only one aspect of a larger problem space.
Too Soon To Tell: Essays for the End of The Computer Revolution
Authors: David A. Grier
Venue: Perspectives (2009)

Based on author David A. Grier's column "In Our Time," which runs monthly in Computer magazine, Too Soon To Tell presents a collection of essays skillfully written about the computer age, an era that began February 1946. Examining ideas that are both contemporary and timeless, these chronological essays examine the revolutionary nature of the computer, the relation between machines and human institutions, and the connections between fathers and sons to provide general readers with a picture of a specific technology that attempted to rebuild human institutions in its own image.
Single Machine Precedence Constrained Scheduling Is a&#x00a0;Vertex Cover Problem
Authors: Christoph Amb&#x00fc;hl, Monaldo Mastrolilli
Venue: Algorithmica (2009)

In this paper we study the single machine precedence constrained scheduling problem of minimizing the sum of weighted completion time. Specifically, we settle an open problem first raised by Chudak and Hochbaum and whose answer was subsequently conjectured by Correa and Schulz. As shown by Correa and Schulz, the proof of this conjecture implies that the addressed scheduling problem is a special case of the vertex cover problem. This means that previous results for the scheduling problem can be explained, and in some cases improved, by means of vertex cover theory. For example, the conjecture implies the existence of a polynomial time algorithm for the special case of two-dimensional partial orders. This considerably extends Lawler&#x2019;s result from 1978 for series-parallel orders.
Prefetching into Smart-Disk Caches for High Performance Media Servers
Authors: Peter Triantafillou, Stavros Harizopoulos
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper presents techniques, which exploit recent magnetic disk-drive technological developments (such as the existence of embedded drive-level caches and powerful controllers, and the ever-increasing transfer rates). It contributes prefetching techniques into host- and drive-level caches to improve the maximum number of continuous data streams that a drive can support. We show how our techniques can achieve significant performance improvements while guaranteeing the uninterrupted display of the continuous data. In addition, despite our techniques' utilization of drive-level caches, the performance improvements do not come at the expense of additional cache memory (at the host and/or the drive). Given current technology trends, the benefits of our techniques are expected to become even greater.
On Classifying Mappings Induced by Granular Structures
Authors: Lech Polkowski, Piotr Artiemjew
Venue: Transactions on Rough Sets IX (2008)

In this work the subject of granular computing is pursued beyond the content of the previous paper [21]. We study here voting on a decision by granules of training objects, granules of decision rules, granules of granular reflections of training data, and granules of decision rules induced from granular reflections of training data. This approach can be perceived as a direct mapping of the training data on test ones which is induced by granulation of knowledge on the training data. Some encouraging results were already presented in [21], and here the subject is pursued systematically.Granules of knowledge are defined and computed according to a previously used scheme due to Polkowski in the framework of theory of rough inclusions.On the basis of presented results, one is justified in concluding that the presented methods offer a very good quality of classification, comparable fully with best results obtained by other rough set based methods, like templates, adaptive methods, hybrid methods etc.
A study of multicast congestion control for UMTS
Authors: Antonios Alexiou, Christos Bouras, Andreas Papazois
Venue: International Journal of Communication Systems (2009)

In this paper, we study the applicability of multicast congestion control over universal mobile telecommunications system (UMTS) networks. We analyze two well-known multicast congestion control schemes for fixed networks, namely TCP-friendly multicast congestion control and pragmatic general multicast congestion control. We investigate their behavior when they are employed in UMTS networks and we analyze the problems arose when these mechanisms are applied over the wireless links of the UMTS terrestrial radio-access network. Additionally, we propose necessary improvements to these legacy schemes and explain the necessity of these modifications. The proposed schemes are implemented in the ns-2 network simulator and are evaluated under various network conditions and topologies. Finally, we measure the performance of the proposed modified schemes and compare them with the corresponding legacy mechanisms. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Automatic Motherese Detection for Face-to-Face Interaction Analysis
Authors: Ammar Mahdhaoui, Mohamed Chetouani, Cong Zong, Raquel Sofia Cassel, Catherine Saint-Georges, Marie-Christine Laznik, Sandra Maestro, Fabio Apicella, Filippo Muratori, David Cohen
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

This paper deals with emotional speech detection in home movies. In this study, we focus on infant-directed speech also called "motherese" which is characterized by higher pitch, slower tempo, and exaggerated intonation. In this work, we show the robustness of approaches to automatic discrimination between infant-directed speech and normal directed speech. Specifically, we estimate the generalization capability of two feature extraction schemes extracted from supra-segmental and segmental information. In addition, two machine learning approaches are considered: k-nearest neighbors (k-NN) and Gaussian mixture models (GMM). Evaluations are carried out on real-life databases: home movies of the first year of an infant.