ppxscal/embedding_network huggingface dataset:
Investigation of facial artifacts on face biometrics using eigenface based single and multiple neural networks
Authors: K. Sundaraj
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

Biometrics has been an important issue pertaining to security in the last few decades. Departments or agencies entrusted with national security are increasingly installing surveillance cameras in strategic or critical areas to monitor the identities of the general public. Upon locating suspicious characters in the video feed, they are compared with existing databases to find a match. These databases are generally compiled from the National Registration Department (NRD), Immigration, intelligence agencies, etc. Unfortunately, as mentioned in most reports of tragic events, suspicious characters do not resemble anything like what has been stored in the databases. There is a high chance that the face biometric identification software will miss these culprits. In this paper we propose to investigate the effects of facial artifacts on the recognition rate of eigenface based neural networks. It has been found that eigenfaces coupled with Euclidean distance can be successfully used to recognize the human face in almost real-time. However, facial artifacts can cause the features that characterize a face to be distorted. Hence, it is desirable to identify problematic facial artifacts that can cause false identification or no identification. The main focus of this paper is the investigation of common facial artifacts on the performance of recognition and the proposition of modification to existing databases to improve the positive rate of identification. A professional graphic artist was used to modify the images used in the experiments. We use a single and multiple eigenface based neural network as the classifier in our experiments.
Kinetic Collision Detection for Convex Fat Objects
Authors: Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann
Venue: Algorithmica (2009)

We design compact and responsive kinetic data structures for detecting collisions between n convex fat objects in 3-dimensional space that can have arbitrary sizes. Our main results are: If the objects are 3-dimensional balls that roll on a plane, then we can detect collisions with a KDS of size O(nlog n) that can handle events in O(log 2 n) time. This structure processes O(n 2) events in the worst case, assuming that the objects follow constant-degree algebraic trajectories. If the objects are convex fat 3-dimensional objects of constant complexity that are free-flying in ℝ3, then we can detect collisions with a KDS of O(nlog 6 n) size that can handle events in O(log 7 n) time. This structure processes O(n 2) events in the worst case, assuming that the objects follow constant-degree algebraic trajectories. If the objects have similar sizes then the size of the KDS becomes O(n) and events can be handled in O(log n) time.
Methodological Steps and Issues When Deriving Individual Based-Models from Equation-Based Models: A Case Study in Population Dynamics
Authors: Ngoc Doanh Nguyen, Alexis Drogoul, Pierre Auger
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

An important question in the simulation of complex systems concerns the emergence of global behaviours and how to model them. Individual-based models (IBM), on one hand, are designed precisely for exploring emergent phenomena, but they must be simulated (sometimes extensively) in order to detect the behaviours that could emerge at the global level. Moreover, there are no "theories of IBM" that would allow modellers to make predictions about the long-term emerging behaviours they can observe. On the other hand, equation-based models (EBM), while not exploring the same causes of emergence, represent a useful tool for making predictions about global emerging behaviours of a system, especially in the long term. In this paper, we will explore the methodological issues that arise when attempting to derive an IBM from an existing EBM model in population dynamics, dedicated to exploring the dynamics of two competing populations in a "two-patch" environment.
A standard tool for information resource management
Authors: Michael E. Meyer
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Information resource management has emerged from the 1970's as the term that accurately describes the methodology used for managing an enterprise's information resource. The term itself indicates that we have raised our level of comprehension from only data in the computer environment to the total information resource, which includes computer and non-computer entities consisting of data, the processes that use it, and their relationships. It is a synthesis of previous terms like database management, data management, etc., which have roots far back into the origins of electronic data processing. The origin, evolution, and growth of this methodology are traced for the purpose of establishing the need for standard tools in this age of multivendor enterprises. With the expansion of data independence to include nondatabase files, where programmer productivity is becoming a real issue and the approach of distributed systems and databases is imminent, a standard information resource management tool is an absolute requirement. Current efforts to develop an information resource dictionary system (IRDS) standard will be discussed with some ideas on the directions being taken.
The Worst Page-Replacement Policy
Authors: Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
Venue: Theory of Computing Systems (2009)

In this paper, we consider the following question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of page faults as compared to the worst offline strategy. We show that there is no deterministic, online page-replacement strategy that is competitive with the worst offline strategy. We give a randomized strategy based on the &#x201c;most-recently-used&#x201d; heuristic and show that this strategy is the worst possible online page-replacement strategy.
Simulation and experimental design applied to sizing supermarket cashiers in Colombia
Authors: Jorge A. Alvarado, Luis M. Pulido
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

A framework for Colombian supermarkets challenges in order to find an adequate number of cashiers and baggers was developed, translated to a simulation model using Promodel&reg; and proved through an experiment varying register item time, number of cashiers and number of baggers for eight real Colombian supermarkets. The framework proved to be successful in finding a cashier-bagger combination for average waiting and system times, but not powerful enough for service promises involving all of the most part of the clients due to variability of maximum times. An interaction among cashiers and baggers combination was found that makes valuable to increase the number of baggers only for some specific number of cashiers working.
Research and practice of distributed test platform
Authors: Feng Qin-qun, Yun Wen-fang, Peng She-qiang
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

After concise introduction of Software test and its significance, an integration environment of Distributed Test Platform for software testing is proposed and its two departments, including Test Server and Test Driver, are described subsequently. The composition of Test Server based on Metadata Service is presented. The Metadata Service's element and its runtime principle are described in details. Finally summarization is listed.
iPhone For Dummies, 2nd edition
Authors: Edward C. Baig, Bob LeVitus
Venue: For Dummies (2008)

The iPhone 3G is here! Youll want to make the most of it, and iPhone For Dummies, 2nd Edition is ready to help. Master the multitouch interface, send text messages, enjoy rich-HTML e-mail, use GPS maps, and more, with this full-color guide to show you how!Edward C. Baig and Dr. Mac Bob LeVitus, two giants of Mac-dom, have packed this colorful little book with tips on every cool feature of the iPhone 3G. Theyll show you how to find and download hundreds of cool apps from the new Apps Store, sync up your contact lists with MobileMe, browse the Internet, take photos, download music, and much more. For example:Use 3G wireless technology to surf the Web faster, send and receive e-mail, and talk on the phone, all at once Play music, watch videos on the widescreen display, or download a game from the App Store Navigate Web sites or photos using tap, flick, and pinch Get turn-by-turn directions, view a map, get live traffic information, or find services near your location with the GPS feature Synchronize data, calendar entries, and address books between your desktop and your iPhone Snap, share, sync, and save photos See how the touch screen lets you type, surf, dial, download, play music, and more, all with a simple tap Use the new scientific calculator Find out what Microsoft Exchange has to offer You already love your iPhone. With iPhone For Dummies, 2nd Edition, youll find more to love!
Decision Procedures for a Deontic Logic Modeling Temporal Inheritance of Obligations
Authors: Philippe Balbiani, Jan Broersen, Julien Brunel
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In nowadays applications of temporal deontic logic to the verification of security policies, an issue arises concerning the temporal inheritance of future directed obligations that have net yet been met. We investigate decision procedures for temporal deontic logics that account for this particular interaction between time and obligation.
Integration of Co-expression Networks for Gene Clustering
Authors: Malay Bhattacharyya, Sanghamitra Bandyopadhyay
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Simultaneous overexpression or underexpression of multiplegenes, used in various forms as probes in the highthroughput microarray experiments, facilitates the identification of their underlying functional proximity. This kind of functional associativity (or conversely the separability) between the genes can be represented roficiently using coexpression networks. The extensive repository of diversified microarray data encounters a recent problem of multiexperimental data integration for the aforesaid purpose. This paper highlights a novel integration method of gene coexpression networks, based on the search for their consensus network, derived from diverse microarray experimental data for the purpose of clustering. The proposed methodology avoids the bias arising from missing value estimation. The method has been applied on microarray datasets arising from different category of experiments to integrate them. The consensus network, thus produced, reflects robustness based on biological validation.
Introduction to computing: a fresh breadth of disciplines
Authors: Kian L. Pokorny
Venue: Journal of Computing Sciences in Colleges (2009)

This paper describes a breadth-first introduction to the computing disciplines. This approach differs from the breadth-first approach as given in the Computing Curriculum 2001 report in that it is the first course for students majoring in Computer Science (CS), Computer Information Systems (CIS), Information Technology (IT), Interactive Media (IM) or Computational Science (COS). The small university at which the course is offered has limited resources and limited student enrollment for the degree programs. Thus, courses must overlap in the degree programs. The new approach introduces computing, funnels students into the most appropriate major, increases retention and presents a more holistic picture of what is encompassed in the various computing disciplines. In the first offering of the course with the new approach, there has been a significant increase in the retention of students that continue in one of the computing majors.
Counting distance permutations
Authors: Matthew Skala
Venue: Journal of Discrete Algorithms (2009)

Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a permutation naming the closest site, the second-closest, and so on. We examine how many distinct permutations can occur as a function of the number of sites and the size of the space. We give theoretical results for tree metrics and vector spaces with L"1, L"2, and L"~ metrics, improving on the previous best known storage space in the vector case. We also give experimental results and commentary on the number of distance permutations that actually occur in a variety of vector, string, and document databases.
Remote detection of bottleneck links using spectral and statistical methods
Authors: Xinming He, Christos Papadopoulos, John Heidemann, Urbashi Mitra, Usman Riaz
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Persistently saturated links are abnormal conditions that indicate bottlenecks in Internet traffic. Network operators are interested in detecting such links for troubleshooting, to improve capacity planning and traffic estimation, and to detect denial-of-service attacks. Currently bottleneck links can be detected either locally, through SNMP information, or remotely, through active probing or passive flow-based analysis. However, local SNMP information may not be available due to administrative restrictions, and existing remote approaches are not used systematically because of their network or computation overhead. This paper proposes a new approach to remotely detect the presence of bottleneck links using spectral and statistical analysis of traffic. Our approach is passive, operates on aggregate traffic without flow separation, and supports remote detection of bottlenecks, addressing some of the major limitations of existing approaches. Our technique assumes that traffic through the bottleneck is dominated by packets with a common size (typically the maximum transfer unit, for reasons discussed in Section 5.1). With this assumption, we observe that bottlenecks imprint periodicities on packet transmissions based on the packet size and link bandwidth. Such periodicities manifest themselves as strong frequencies in the spectral representation of the aggregate traffic observed at a downstream monitoring point. We propose a detection algorithm based on rigorous statistical methods to detect the presence of bottleneck links by examining strong frequencies in aggregate traffic. We use data from live Internet traces to evaluate the performance of our algorithm under various network conditions. Results show that with proper parameters our algorithm can provide excellent accuracy (up to 95%) even if the traffic through the bottleneck link accounts for less than 10% of the aggregate traffic.
Board of Governors Votes to Amend Bylaws
Authors: Bob Ward
Venue: Computer (2009)

In addition to 13 technical magazines, 12 transactions, and one letters publication, in 2009 the IEEE Computer Society will also publish cutting-edge papers and articles from more than 300 conferences.
Word Sequence Models for Single Text Summarization
Authors: René Arnulfo García-Hernández, Yulia Ledeneva
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

The main problem for generating an extractive automatic text summary is to detect the most relevant information in the source document. For such purpose, recently some approaches have successfully employed the word sequence information from the self-text for detecting the candidate text fragments for composing the summary. In this paper, we employ the so-called n-grams and maximal frequent word sequences as features in a vector space model in order to determine the advantages and disadvantages for extractive text summarization.
Categorizing web queries
Authors: Stephen Nelson, Coşkun Bayrak
Venue: ACM SIGSOFT Software Engineering Notes (2009)

Over the past ten years, the user base for the World Wide Web (WWW) has grown over 400% [1]. This increased user base has naturally led to an enormous amount of data available for users to search. Corporations, such as Google, often store user search records and there are many concerns, as well as positive aspects, for how search records may be used. One aspect in particular, categorizing web queries, presents several challenges. This paper will discuss the challenging aspects of categorizing web queries, review previous categorical research, and conclude with a method for tackling one of the challenging aspects.
A UTP semantics for Circus
Authors: Marcel Oliveira, Ana Cavalcanti, Jim Woodcock
Venue: Formal Aspects of Computing (2009)

Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP constructs. Previously, a denotational semantics has been given to Circus; however, a shallow embedding of Circus in Z, in which the mapping from Circus constructs to their semantic representation as a Z specification, with yet another language being used as a meta-language, was not useful for proving properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a final reference for the Circus denotational semantics based on Hoare and He&#x2019;s Unifying Theories of Programming (UTP); as such, it allows the proof of meta-theorems about Circus including the refinement laws in which we are interested. Its correspondence with the CSP semantics is illustrated with some examples. We also discuss the library of lemmas and theorems used in the proofs of the refinement laws. Finally, we give an account of the mechanisation of the Circus semantics and of the mechanical proofs of the refinement laws.
Effect of deposition conditions on charging processes in SiNx: Application to RF-MEMS capacitive switches
Authors: Richard Daigler, Eleni Papandreou, Matroni Koutsoureli, George Papaioannou, John Papapolymerou
Venue: Microelectronic Engineering (2009)

The paper presents a systematic investigation of dielectric charging in low temperature silicon nitride for RF-MEMS capacitive switches. The dielectric charging is investigated with the aid of Metal-Insulator-Metal (MIM) capacitors with different thickness dielectric film and symmetric and asymmetric metal contacts. The experimental results demonstrate that the charging process is almost symmetric in low temperature deposited silicon nitride. Experiments performed in both MIM and MEMS reveal that the charging process is strongly affected by temperature. Specifically at high temperatures the charging rate increases exponentially with temperature.
Application of platform for electronic education on securing systems in railroad transport
Authors: Maria Hristova, Stanimir Stoyanov, Asya Stoyanova-Doycheva
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

With the increasing role of the systems for electronic and distance learning the question of reaching certain interactivness in them it is of great importance. The current paper demonstrates the capabilities of the software platform for creating dynamic presentations and simulations of various technological processes eLSEBuilder. The initial results of the adaptation of this platform for personalized electronic and distance learning in the field of railroad transport are presented.
Using the flux splitting and high resolution schemes for soliton and shockwave solutions
Authors: R. Naidoo
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

A splitting scheme is used for a numerical solution of a hyperbolic system of one dimensional electrostatic plasma fluid equations. Illustrations as to how the splitting method captures the formation and evolution of ion acoustic solitons and shockwaves were performed. In this study we perform a comparison between a fully discrete NNT high resolution scheme and the splitting scheme which is constructed in the present study. The results indicate that the splitting scheme demonstrates clear superiority over the second order NNT scheme in the soliton solution where the numerical noise of the electron is reduced significantly. For the shock wave solution the NNT scheme is slightly better to the splitting scheme which exhibits a little oscillation at the contact. However the splitting scheme exhibit a smaller computational time than the NNT scheme.
Position paper: Roadmap to tracking based business and intelligent products
Authors: Jan Holmström, Risto Kajosaari, Kary Främling, Erik Langius
Venue: Computers in Industry (2009)

Item-centric tracking is an opportunity to increase visibility and control in different operations of a company. The economical feasibility of item-centric tracking is based on recent technological developments for monitoring the material flow on the item-level instead of the material type-level. It enables companies to track and trace assets over their lifecycle and manage supply chain operations across organizational boundaries. However, the challenge in practice is to find the right areas to start the development of business applications. In this viewpoint paper a means-ends framework for introducing item-centric tracking in business is proposed based on realized track and trace cases. Based on the framework a roadmap for introducing tracking in businesses operations is outlined. The proposed roadmap circumvents the most challenging business cases for introducing tracking and RFID-technology in the supply chain and focuses on asset management as a more accessible route for business.
Energy-Predicted Shortest Routing Tree Algorithm in Wireless Sensor Networks
Authors: Ming Zhang, Chenglong Gong, Yuan Feng, Chao Liu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Wireless sensor networks (WSNs) consists of unattended sensors with limited storage, energy (battery power) and computational and communication capabilities. Since battery power is the most crucial resource for sensor nodes, the energy prediction and the shortest path is special important. In this paper, we present an energy-predicted shortest routing tree algorithm (EP-SRT) for wireless sensor networks. it improves energy utility by changing the activity of wireless communication module of sensor nodes, energy prediction model and state transition of sensor nodes, while employs clustering and the principle of Prim and Djkstra to build the shortest routing tree to prolong network lifetime. Simulation results show that EP-SRT performs better than MIP and SRT algorithm with high-density deployment and high traffic.
Representation insensitivity in immediate prediction under exchangeability
Authors: Gert de Cooman, Enrique Miranda, Erik Quaeghebeur
Venue: International Journal of Approximate Reasoning (2009)

We consider immediate predictive inference, where a subject, using a number of observations of a finite number of exchangeable random variables, is asked to coherently model his beliefs about the next observation, in terms of a predictive lower prevision. We study when such predictive lower previsions are representation insensitive, meaning that they are essentially independent of the choice of the (finite) set of possible values for the random variables. We establish that such representation insensitive predictive models have very interesting properties, and show that among such models, the ones produced by the Imprecise Dirichlet-Multinomial Model are quite special in a number of ways. In the Conclusion, we discuss the open question as to how unique the predictive lower previsions of the Imprecise Dirichlet-Multinomial Model are in being representation insensitive.