ppxscal/embedding_network huggingface dataset:
An Effective Shape-Texture Weighted Algorithm for Multi-view Face Tracking in Videos
Authors: Wing-Pong Choi, Kin-Man Lam
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

In this paper, an effective face tracking algorithm based on the combination of shape and texture information is proposed. The edge map is used to represent the shape of a face, while the texture information is characterized by the local binary pattern (LBP). As the face patterns to be tracked in consecutive frames are highly correlated, an accurate tracking can be achieved by searching for the shortest weighted feature distance between the face pattern and the possible face candidates. The weights of the shape and texture can be adapted for real-time tracking. Both the edge map and the LBP can, to a certain extent, alleviate the illumination effect. Moreover, skin-color-like objects will not be falsely tracked as a face. Our proposed algorithm complements the AdaBoost face detection algorithm to form a multi-view face-tracking system. Experimental results show that our algorithm can track faces in varying poses (tilted or rotated) in real time.
Cooperative Arrival Management in Air Traffic Control - A Coloured Petri Net Model of Sequence Planning
Authors: Hendrik Oberheid, Dirk Söffker
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

A Coloured Petri Net model implemented in CPN Tools is presented which simulates a potential future arrival planning process in air traffic control. The planning process includes a cooperation between airborne and ground side in which the aircraft involved provide information e.g. with regard to their estimated earliest and latest times of arrival at the airport. This information is then used by a planning system on the ground to establish a favorable sequence in which aircraft will be led to the runway. The model has been built in order to acquire a better understanding of how the behavior of individual actors (i.e. aircraft) within the cooperation influences the outcome of the overall sequence planning process. A peculiarity of the CP-net from a modeling point of view lies in the fact that state space analysis is used repeatedly during each cycle of the planning process to generate and evaluate the potential solutions to the sequence planning problem. The results gained through queries on the state space are then re-fed into the simulation and analysis for the next planning cycle. The results from the model will in future be used to build realistic scenarios and assumptions on how different actors will interact with the system from a human factors point of view.
Refactoring Tools: Fitness for Purpose
Authors: Emerson Murphy-Hill, Andrew P. Black
Venue: IEEE Software (2008)

Refactoring tools can improve the speed and accuracy with which developers create and maintain software—but only if they are used. In practice, tools are not used as much as they could be; this seems to be because sometimes they do not align with the refactoring tactic preferred by most programmers, a tactic the authors call "floss refactoring." They propose five principles that characterize successful floss-refactoring tools—principles that can help programmers to choose the most appropriate refactoring tools and also help toolsmiths to design tools that fit the programmer's purpose.
Feel the Difference: A Guide with Attitude!
Authors: Mei Yii Lim, Ruth Aylett
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

This paper describes a mobile context-aware `intelligent affective guide with attitude' that guides visitors touring an outdoor attraction. Its behaviour is regulated by a biologically inspired architecture of emotion, allowing it to adapt to the user's needs and feelings. In addition to giving an illusion of life, the guide emulates a real guide's behaviour by presenting stories based on the user's interests, its own interests, its belief and its current memory activation. A brief description of the system focusing on the core element - the guide's emotional architecture - is given followed by findings from an evaluation with real users.
Meaningful Composite Structures
Authors: Arnaud Cuccuru, Sébastien Gérard, Ansgar Radermacher
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

UML2 composite structures are a natural solution for the basic modeling issues associated with component-oriented approaches. They provide mechanisms for defining reusable "pieces" of design, which are well-encapsulated through explicit interaction ports. While intuitive in principle, the semantics of request propagation across ports may cause semantic ambiguities if the composition mechanisms are not used consistently, thus leading to meaningless composite structures (that cannot be safely reused within the context of a particular environment). To ensure consistent usage, this article proposes an empirical study that provides an intuitive description of composite structure semantics focusing on request propagations across ports. It supplements this description by highlighting cases conducive to semantic ambiguities and offers practical solutions and a rationale for building composite structures that avoid them. Among possible solutions, the opportuneness of encapsulating explicit behaviors in ports is discussed.
John Mauchly's Early Years
Authors: Kathleen R. Mauchly
Venue: IEEE Annals of the History of Computing (1984)

The paper describes John W. Mauchly's experiences and experiments that led to his concept of an electronic digital computer based on mechanical desk calculators during the years he was teaching at Ursinus College (1933-1941), his interaction with John V. Atanasoff of Iowa State College, and the environment at the Moore School of Electrical Engineering at the University of Pennsylvania that led to the eventual proposal (1943) for building the electronic ENIAC.
Developing a reconfigurable network lab
Authors: Sam Abbott-McCune, A. J. Newtson, Jeffrey Girard, Bryan S. Goda
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

Providing adequate hands-on experience of a network is a major component of an Information Technology program. Course requirements, limited budgets, time intensive classroom setup, reconfiguration, and rapidly changing computing technology poses several challenges for most academic institutions. This paper examines designing a reconfigurable network lab to support multiple network courses. Our lab requires the use of equipment with various configurations while minimizing transition time between class periods for different course requirements or student projects. The multipurpose lab can be utilized for hands-on student learning, simple instructor demonstrations, demonstrations of multi-tiered networks with real time analysis, and site-to-site intercollegiate network-based competitions. In the future, our lab will provide students visual real time feedback similar to a network operations center (NOC); exposing the impact of their efforts in administrating and configuring their network design. This paper discusses strengths and weaknesses of the design and covers in detail the configuration of the classroom lab. Beneficial goals are to integrate software visualization tools, such as ""Nagios"" (a network monitoring tool) and virtual machines (for ease of operating system changes). The lab creates a multifunctional network classroom to facilitate education of cross discipline classes as well as focusing students with a deeper understanding of network science concepts. Our students will be able to apply their knowledge learned in the classroom during academic internships with industry. A more flexible lab means lower overall cost because of lab reuse and the ability to meet future needs.
PRESENT: An Ultra-Lightweight Block Cipher
Authors: A. Bogdanov, L. R. Knudsen, G. Leander, C. Paar, A. Poschmann, M. J. Robshaw, Y. Seurin, C. Vikkelsoe
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

With the establishment of the AES the need for new block ciphers has been greatly diminished; for almost all block cipher applications the AES is an excellent and preferred choice. However, despite recent implementation advances, the AES is not suitable for extremely constrained environments such as RFID tags and sensor networks. In this paper we describe an ultra-lightweight block cipher, present. Both security and hardware efficiency have been equally important during the design of the cipher and at 1570 GE, the hardware requirements for present are competitive with today's leading compact stream ciphers.
Higher Confidence in Event Correlation Using Uncertainty Restrictions
Authors: Gerald G. Koch, Boris Koldehofe, Kurt Rothermel
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Distributed cooperative systems that use event notification for communication can benefit from event correlation within the notification network. In the presence of uncertain data, however, correlation results easily become unreliable. The handling of uncertainty is therefore an important challenge for event correlation in distributed event notification systems. In this paper, we present a generic correlation model that is aware of uncertainty. We propose uncertainty constraints that event correlation can take into account and show how they can lead to higher confidence in the correlation result. We demonstrate that the application of this model allows to obtain a qualitative description of event correlation.
A Two-Stage Flexible Flowshop Problem with Deterioration
Authors: Hua Gong, Lixin Tang
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We study a scheduling problem under considering deterioration on a two-stage flexible flowshop of particular structure (parallel machines in the first stage and a single batching machine in the second stage). The deterioration of a job means that its processing time on the batching machine is dependent on its waiting time, i.e., the time between the completion of the job in the first stage and the start of the job in the second stage. The objective is to minimize the makespan plus the total penalty cost of batching-machine utilization ratio. First, we prove the problem is strongly NP-hard. An efficient heuristic algorithm for the general problem is constructed and its worst-case bound is analyzed. Computational experiments show that the heuristic algorithm performs well on randomly generated problem instances.
DVDSleuth: A Case Study in Applied Formal Concept Analysis for Navigating Web Catalogs
Authors: Jon Ducrou
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

Browsing images using Formal Concept Analysis (FCA) for conceptual representation, navigation and clustering was shown in the ImageSleuth projects [1,2,3]. To showcase the ideas and knowledge gained through ImageSleuth, the same techniques were applied to an information space built from a dynamic collection sourced from the Amazon.com on-line store. Using the Amazon.com catalog, conceptually similar DVDs are able to be discovered and viewed, and then used to explore the information space of their conceptual neighbourhood. A case study of the project --- called DVDSleuth --- is presented in this paper focusing on the history, results and difficulties encountered by the project. The shortcomings of our approach are analysed and reported as a guide for future projects using FCA techniques for information exploration using on-line Web catalogs.
ACM Computer and Communication Security Conference
Authors: Ashish Popli
Venue: IEEE Security and Privacy (2004)

The tenth ACM Computer and Communications Security (CCS 2003) Conference (www.acm.org/sigs/sigsac/ccs) took place on 27-31 October 2003 in Washington D.C. ACM's Special Interest Group on Security Audit and Control organizes CCS conference every year to further develop the information-security profession. With eight workshops, two tutorials, three invited talks, and 35 research papers, CCS 2003 had something for more than 275 attendees.
Sound field analysis and simulation for fluid machines
Authors: Shao-Yi Hsia, Shih-Ming Chiu, Jyin-Wen Cheng
Venue: Advances in Engineering Software (2009)

Fluid machines, such as pumps, fans, and internal combustion engines, are widely used in duct systems for air-conditioning, cooling, ventilating, heat releasing, and dust collecting. Vibration and noise will be created when the fluid machine works with fans at various rotating speeds. Noise problems associated with fan installation are a concern in fluid machines. Methods to analyze the sound field and simulation of fan installation are, therefore, important for the design to reduce the noise output from fluid machines. The sound field is simulated by using the boundary element method (BEM), which is a numerical technique to reduce the boundary integral equations using the fundamental solution and Green's transfer functions, for sound field analysis in this paper. For the sound field analysis, the geometry of the fluid machines (the axial fan and centrifugal fan) and the acoustic properties are modeled in Beasy software based on the boundary element method technology. The 1/1 octave frequency band from 63Hz to 8kHz ranges are selected on sound field analysis. The sound pressure of the fan and the motor in each octave band are calculated by the parameters of rotating speed, flow volume, horse power and number of blades used. The results show that there is a high level sound pressure inside the housing of the axial fan due to the sound source located there. The higher sound pressure level is observed on both the inlet and outlet. The results for the centrifugal fan are the higher the frequency, the heavier energy that is found to radiate around the sound source.
An interactive solution approach for a bi-objective semi-desirable location problem
Authors: Esra Karasakal, Deniz Nadirler
Venue: Journal of Global Optimization (2008)

In this study, we consider a semi-desirable facility location problem in a continuous planar region considering the interaction between the facility and the existing demand points. A facility can be defined as semi-desirable if it has both undesirable and desirable effects to the people living in the vicinity. Our aim is to maximize the weighted distance of the facility from the closest demand point as well as to minimize the service cost of the facility. The distance between the facility and the demand points is measured with the rectilinear metric. For the solution of the problem, a three-phase interactive geometrical branch and bound algorithm is suggested to find the most preferred efficient solution. In the first two phases, we aim to eliminate the parts of the feasible region the inefficiency of which can be proved. The third phase has been suggested for an interactive search in the remaining regions with the involvement of a decision maker (DM). In the third phase, the DM is given the opportunity to use either an exact or an approximate procedure to carry out the search. The exact procedure is based on the reference point approach and guarantees to find an efficient point as the most preferred solution. On the other hand, in the approximate procedure, a hybrid methodology is used to increase the efficiency of the reference point approach. The approximate procedure can be used when the DM prefers to see locally efficient solutions so as to save computation time. We demonstrate the performance of the proposed method through example problems.
Endowing Artificial Systems with Anticipatory Capabilities: Success Cases
Authors: Giovanni Pezzulo, Martin V. Butz, Cristiano Castelfranchi, Rino Falcone, Gianluca Baldassarre, Christian Balkenius, Alexander Förster, Maurice Grinberg, Oliver Herbort, Kiril Kiryazov, Boicho Kokinov, Birger Johansson, Emilian Lalev, Emiliano Lorini, Carlos Martinho, Maria Miceli, Dimitri Ognibene, Ana Paiva, Georgi Petkov, Michele Piunti, Vin Thorsteinsdottir
Venue: The Challenge of Anticipation: A Unifying Framework for the Analysis and Design of Artificial Cognitive Systems (2008)

This book has provided various theoretical perspectives on anticipatory processes in natural and artificial cognitive systems. Advantages have been proposed and confirmed in various detailed case studies, which may have given the reader detailed insights into anticipatory processes and their importance in various cognitive systems tasks. To wrap up these advantages and give a concluding overview of various current anticipatory process advantages, this final chapter highlights a concise collection of precise success stories of anticipations in artificial cognitive systems.We survey fourteen case studies, which were developed during the EU project MindRACES. In these studies, simulated or real robots were tested in different environmental tasks, which required advanced sensorimotor and cognitive abilities. These abilities included the initiation and control of goal-directed actions, the orientation of attention, finding and reaching goal locations, and performing mental experiments for action selection. All the studies have shown advantages of anticipatory mechanisms compared to reactive mechanisms in terms of increased robot autonomy and adaptivity. In some cases, anticipations even caused the development of new cognitive abilities, which were simply impossible without anticipatory mechanisms. For each case study, we indicate relevant associated publications, in which the interested reader may find further details on the relevant computational architectures, the involved anticipatory mechanisms, as well as on the analytical and quantitative results.While the book as a whole has laid out the theoretical principles and design methodology for such advancements, this final chapter thus provides various possible starting points for further developments in both the surveyed system architectures and the presented solutions to the cognitive tasks addressed.
Diagnosis of IP-Service Anomalies Based on BGP-Update Temporal Analysis
Authors: Osamu Akashi, Atsushi Terauchi
Venue: Proceedings of the 8th IEEE international workshop on IP Operations and Management (2008)

Diagnosing IP-service anomalies requires network operators to analyze routing and service-application behavior at the protocol level from multiple viewpoints. For analyzing anomalies whose effects can be observed as static inconsistency among BGP routing tables, the multi-agent-based diagnostic system called ENCORE has been developed and successfully applied to actual autonomous systems (ASes). This system can integrate BGP routing information observed at multiple ASes and verify whether the routing information is being correctly distributed throughout the Internet. However, actual IP-service failures sometimes require temporal analysis of routing updates to identify specific causes and, moreover, comprehensive analysis from the viewpoint of interaction with other protocols than BGP. Thus, we have integrated such functions in the ENCORE architecture and developed a comprehensive diagnostic system called IP-MIND. It can consider historical BGP routing updates and the behavior of other protocols in conjunction with BGP-information reachability analysis in order to identify specific causes. It also enables diagnosis of a class of anomalies that cause reachability failures while not creating any inconsistency among the current BGP routing tables at multiple ASes.
A procedure with stepsize control for solving n one-dimensional IVPs
Authors: Davod Khojasteh Salkuyeh, Faezeh Toutounian, Hamed Shariat Yazdi
Venue: Mathematics and Computers in Simulation (2008)

Finite precision computations may affect the stability of algorithms and the accuracy of computed solutions. In this paper we first obtain a relation for computing the number of common significant digits between the exact solution and a computed solution of a one-dimensional initial-value problem obtained by using a single-step or multi-step method. In fact, by using the approximate solutions obtained with stepsizes h and h /2, the number of common significant digits between approximate solution with stepsize h and exact solution is estimated. Then by using the stochastic arithmetic, the CESTAC method, and the CADNA library we propose an algorithm to control the round-off error effect on the computed solution. This method can easily apply to a system of n one-dimensional initial-value problems. Finally some numerical examples are given to show the efficiency of the method.
Artificial wavelet neural network and its application in neuro-fuzzy models
Authors: Ahmad Banakar, Mohammad Fazle Azeem
Venue: Applied Soft Computing (2008)

In the proposed work, two types of artificial neural networks are proposed by using well-known advantages and valuable features of wavelets and sigmoidal activation functions. Two neurons are derived by adding and multiplying the outputs of the wavelet and the sigmoidal activation functions. These neurons in a feed-forward single hidden layer network result summation wavelet neural network (SWNN) and multiplication wavelet neural network (MWNN). An algorithm is introduced for structure determination of the proposed networks. Approximation properties of SWNN and MWNN have been evaluated with different wavelet functions. The above networks in the consequent part of the neuro-fuzzy model result summation wavelet neuro-fuzzy (SWNF) and multiplication wavelet neuro-fuzzy (MWNF) models. Different types of wavelet function are tested with the proposed networks and fuzzy models on four different dynamical examples. Convergence of the learning process is also guaranteed by adaptive learning rate and performing stability analysis using Lyapunov function.
Software Testing Forever: Old and New Processes and Techniques for Validating Today's Applications
Authors: Antonia Bertolino
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

Software testing is a very complex activity deserving a first-class role in software development. Testing related activities encompass the entire development process and may consume a large part of the effort required for producing software. In this talk, I will first organize into a coherent framework the many topics and tasks forming the software testing discipline, pointing at relevant open issues [1]. Then, among the outlined challenges, I will focus on some hot ones posed by the testing of modern complex and highly dynamic systems [2]. What is assured is that software testers do not risk to remain without their job, and testing researchers are not at short of puzzles. Software testing is and will forever be a fundamental activity of software engineering: notwithstanding the revolutionary advances in the way it is built and employed (or perhaps exactly because of), the software will always need to be eventually tried and monitored. In the years, software testing has evolved from an "art" to a discipline, but test practice largely remains a trial-and-error methodology. We will never find a test approach that is guaranteed to deliver a "perfect" product, whichever is the effort we employ. However, what we can and must pursue is to transform testing from "trial-and-error" to a systematic, cost-effective and predictable engineering practice.
Data Integration in the Life Sciences: Fun, Findings and Frustrations
Authors: Norman W. Paton
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

This paper concerns the research topic of data integration in the life sciences. The paper presents no technical results, but rather provides a classification of research activities in terms of the contributions they seek to make to the life sciences, bioinformatics or computer science.