ppxscal/embedding_network huggingface dataset:
Open Courseware as a Tool for Teaching and Learning in Africa
Authors: Camilius Sanga, Edda T. Lwoga, Isabella M. Venter
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

Open Source Software (OSS) shows great promise for future technological innovation and application especially in the area of teaching and learning in Africa. It provides readily available software such as learning management systems (LMS) and learning content management systems (LCMs). Higher Learning Institutions (HLI) in developing countries can benefit from these OSS initiatives. This paper, based on two case studies (The University of the Western Cape (UWC) in South Africa and the University of Dar es Salaam (UDSM) in Tanzania), discusses the application of OSS in teaching and learning and reflects on why the adoption of Open Courseware (OC) by HLI in Africa is very slow. The UWC Free Software Innovation Unit was visited and information was collected from the websites of both UWC and UDSM. It is anticipated that the findings of the study will be of interest to all stakeholders in the education sector in Africa. It will be useful when planning cost-effective and efficient technology implementation at district level and at national level specifically in Tanzania.
HDPS, an XML/XSLT based hierarchal modeling system
Authors: Richard Curry, Kiriakos Vlahos
Venue: Proceedings of the 36th conference on Winter simulation (2004)

HDPS is a practical system for designing modeling paradigms, creating hierarchal model definitions, and evaluating multi-paradigm models - particularly in business and finance. HDPS relies on XML (W3C 2004) to create model types, definitions, and instances. A type defines a modeling paradigm; for example, one type might define discrete event simulation while another may specify linear programming. A definition describes a system such as a firm's pricing decision process. A model instance is the state and history of a definition when operated upon by a type. Further, each type relies on one or more implementations to provide its functionality. xHDPS, a .NET version of HPDS, implements several modeling paradigms including simulation (discrete event, continuous time, and Monte-Carlo), optimization (linear and non-linear), knowledge-based expert systems, and general calculation (spreadsheet) models. A multi-generation service adoption model demonstrates a typical HDPS model structure with several interconnected models utilizing different modeling paradigms.
Real-time adaptive A*
Authors: Sven Koenig, Maxim Likhachev
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Characters in real-time computer games need to move smoothly and thus need to search in real time. In this paper, we describe a simple but powerful way of speeding up repeated A* searches with the same goal states, namely by updating the heuristics between A* searches. We then use this technique to develop a novel real-time heuristic search method, called Real-Time Adaptive A*, which is able to choose its local search spaces in a fine-grained way. It updates the values of all states in its local search spaces and can do so very quickly. Our experimental results for characters in real-time computer games that need to move to given goal coordinates in unknown terrain demonstrate that this property allows Real-Time Adaptive A* to follow trajectories of smaller cost for given time limits per search episode than a recently proposed real-time heuristic search method [5] that is more difficult to implement.
Collaborative Mixed Reality Exposure Therapy
Authors: Holger Regenbrecht, Daniel Wickeroth, Brian Dixon, Stefan Mueller
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

In addition to established methods, the treatment of mental disorders using Virtual Reality Exposure Therapy is becoming commonplace. We present an approach, which extends this concept in three ways: (1) the provision of maximum control for the therapist over the exposure environment, (2) the inclusion of different media and mediation elements in the virtuality continuum in Mixed Reality, and (3) support for co-located and remote collaboration between therapist and client. This paper gives a brief overview of related work in the field, describes our conceptual approach and a first implementation, and highlights initial findings and issues. Empirical results of our work in progress will be presented at the conference.
Application Driven Software Development
Authors: Teodor Rus, Donald Ephraim Curtis
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Even in its very infancy computer technology has been seen as a collection of tools destined to solve problems of a given application domain (AD) 1. The problem solving process using computers is (and has been) carried out within the computer environment and requires the AD experts to formalize their problems in computer terms. The effort put forth so far toward making this process easier for AD experts has generated a rich and well-defined information technology (IT) domain, populated by computer artifacts such as programming languages and program generation tools. Successes of this approach to problem-solving led to the development of current computer technology whose complexity overwhelms computer experts themselves. Nevertheless, the usage of current IT for problem solving still requires AD experts to manipulate IT domain concepts and tools rather than AD concepts and tools. To further help this process, more and more complex IT tools are generated thus increasing software complexity to a level where only with formidable difficulties can AD experts manage to develop their application systems. Among the side effects of this situation are the lack of efficiency in application system development, poor performance in computer utilization, and even threat to the future evolution of computer technology itself. Our conjecture is that in order to break this vicious circle we need to rethink the problem solving process. We need to abandon the requirement that AD experts manipulate computer terms and to allow them to manipulate AD specific terms using AD specific languages. The recent advances created by computing research makes it feasible to move the problem solving process from the IT domain into the AD domain.
Improving the performance of dispatching rules in semiconductor manufacturing by iterative simulation
Authors: Lars Mönch, Jens Zimmermann
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In this paper, we consider semiconductor manufacturing processes that can be characterized by a diverse product mix, heterogeneous parallel machines, sequence-dependent setup times, a mix of different process types, i.e. single-wafer vs. batch processes, and reentrant process flows. We use dispatching rules that require the estimation of waiting times of the jobs. Based on the lead time iteration concept of Vepsalainen and Morton (1988), we obtain good waiting time estimates by using exponential smoothing techniques. We describe a database-driven architecture that allows for an efficient implementation of the suggested approach. We present results of computational experiments for reference models of semiconductor wafer fabrication facilities. The results demonstrate that the suggested approach leads to high quality solutions.
Learning Patch Dependencies for Improved Pose Mismatched Face Verification
Authors: Simon Lucey, Tsuhan Chen
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Most pose robust face verification algorithms, which employ 2D appearance, rely heavily on statistics gathered from offline databases containing ample facial appearance variation across many views. Due to the high dimensionality of the face images being employed, the validity of the assumptions employed in obtaining these statistics are essential for good performance. In this paper we assess three common approaches in 2D appearance pose mismatched face recognition literature. In our experiments we demonstrate where these approaches work and fail. As a result of this analysis, we additionally propose a new algorithm that attempts to learn the statistical dependency between gallery patches (i.e. local regions of pixels) and the whole appearance of the probe image. We demonstrate improved performance over a number of leading 2D appearance face recognition algorithms.
Sequential?
Authors: Sylvain Lombardy, Jacques Sakarovitch
Venue: Theoretical Computer Science (2006)

This paper is a survey where we try to organise the known answers to the question whether a given finite automaton with multiplicity in a semiring K is equivalent to a sequential, or input deterministic, one. We shall see that depending on K, the question goes from obvious to open, that the answer goes from yes to undecidable. We review results on sequentiality in the cases of series of finite image, of series with multiplicity in fields, and of series with multiplicity in idempotent semirings.
Free-Riding Analysis of BitTorrent-Like Peer-to-Peer Networks
Authors: Jiadi Yu, Minglu Li, Feng Hong, Guangtao Xue
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

BitTorrent is a very popular P2P file sharing system.It has been successful at distributing large files quickly and efficiently. Embedded in BitTorrent is a set of incentive mechanisms to encourage sharing and contribute, and prevent systematic free-riding. In this paper, a fluid model with two classes of peers is used to capture the effect of free-riding in a BitTorrent system. With the model, we explore how does free-riding influenced the BitTorrent system. From results, it is shown that BitTorrent mechanism is successful to guard against free-riding. Finally, we discuss the dying process of a BitTorrent system and the probability of system dead that is induced by free-riding.
From PSL to NBA: a Modular Symbolic Encoding
Authors: Alessandro Cimatti, Marco Roveri, Simone Semprini, Stefano Tonetta
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

The IEEE standard Property Specification Language (PSL) allows to express all !-regular properties mixing Linear Temporal Logic (LTL) with Sequential Extended Regular Expressions (SEREs), and is increasingly used in many phases of the hardware design cycle, from specification to verification. Many verification engines are able to manipulate Nondeterministic Büchi Automata (NBA), that can represent !-regular properties. Thus, the ability to convert PSL into NBA is an important enabling factor for the reuse of a large wealth of verification tools. Recent works propose a two-step conversion from PSL to NBA: first, the PSL property is encoded into an Alternating Buchi Automaton (ABA); then, the ABA is converted into an NBA with variants of Miyano-Hayashi's construction. These approaches are problematic in practice: in fact, they are often unable to carry out the conversion in acceptable time, even for PSL specifications of moderate size. In this paper, we propose a modular encoding of PSL into symbolically represented NBA. We convert a PSL property into a normal form that separates the LTL and the SERE components. Each of these components can be processed separately, so that the NBA corresponding to the original PSL property is presented in the form of an implicit product, delaying composition until search time. Our approach has two other advantages: first, we can leverage mature techniques for the LTL components; second, we leverage the particular form of the PSL components that appear in the normal form to improve over the general translation. The transformation is proved correct. A thorough experimental analysis over large sets of paradigmatic properties (from patterns of properties commonly used in practice) shows that our approach drastically reduces the construction time of the symbolic NBA, and positively affects the overall verification time.
Audiovisual Integration in Patients with Visual Deficit
Authors: Francesca Frassinetti, Nadia Bolognini, Davide Bottari, Annalisa Bonora, Elisabetta Làdavas
Venue: Journal of Cognitive Neuroscience (2005)

In the present study, we investigated the possibility that bimodal audiovisual stimulation of the affected hemifield can improve perception of the visual events in the blind hemifield of hemianopic patients, as it was previously demonstrated in neglect patients. Moreover, it has been shown that "hetero-modal" and "sensory-specific" cortices are involved in cross-modal integration. Thus, the second aim of the present study was to examine whether audiovisual integration influences visual detection in patients with different cortical lesions responsible of different kinds of visual disorders. More specifically, we investigated cross-modal, audiovisual integration in patients with visual impairment due to a visual field deficit (e.g., hemianopia) or visuospatial attentional deficit (e.g., neglect) and patients with both hemianopia and neglect. Patients were asked to detect visual stimuli presented alone or in combination with auditory stimuli that could be spatially aligned or not with the visual ones. The results showed an enhancement of visual detection in cross-modal condition (spatially aligned condition) comparing to unimodal visual condition only in patients with hemianopia or neglect; by contrast, the multisensory integration did not occur when patients presented both deficits. These data suggest that patients with visual disorders can enormously benefit the multisensory integration. Moreover, they showed a different influence of cortical lesion on multisensory integration. Thus, the present results show the important adaptive meaning of multisensory integration and are very promising with respect to the possibility of recovery from visual and spatial impairments.
Dissociating Hippocampal versus Basal Ganglia Contributions to Learning and Transfer
Authors: Catherine E. Myers, Daphna Shohamy, Mark A. Gluck, Steven Grossman, Alan Kluger, Steven Ferris, James Golomb, Geoffrey Schnirman, Ronald Schwartz
Venue: Journal of Cognitive Neuroscience (2003)

Based on prior animal and computational models, we propose a double dissociation between the associative learning deficits observed in patients with medial temporal (hippocampal) damage versus patients with Parkinson's disease (basal ganglia dysfunction). Specifically, we expect that basal ganglia dysfunction may result in slowed learning, while individuals with hippocampal damage may learn at normal speed. However, when challenged with a transfer task where previously learned information is presented in novel recombinations, we expect that hippocampal damage will impair generalization but basal ganglia dysfunction will not. We tested this prediction in a group of healthy elderly with mild-to-moderate hippocampal atrophy, a group of patients with mild Parkinson's disease, and healthy controls, using an "acquired equivalence" associative learning task. As predicted, Parkinson's patients were slower on the initial learning but then transferred well, while the hippocampal atrophy group showed the opposite pattern: good initial learning with impaired transfer. To our knowledge, this is the first time that a single task has been used to demonstrate a double dissociation between the associative learning impairments caused by hippocampal versus basal ganglia damage/dysfunction. This finding has implications for understanding the distinct contributions of the medial temporal lobe and basal ganglia to learning and memory.
Continuous Super-Resolution for Recovery of 1-D Image Features: Algorithm and Performance Modeling
Authors: Frederic Champagnat, Guy Le Besnerais, Caroline Kulcsar
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We consider the recovery of 1-D image features. Such features can be described by a noisy, blurred and undersampled image of a unique 1-D profile. The profile's recovery is modeled as a 1-D continuous super-resolution (SR) problem. We adopt a functional estimation within a Tikhonov regularization framework. A linear closed-form solution is derived and applied to real data for bar code recovery from low-resolution video frames. Performance modeling in then considered. Thanks to a continuous stochastic model of the input profile, we define a quantitative performance measure which is a mean-square error averaged over a class of profiles with tunable regularity. As a result, an expected SR resolution enhancement ratio is computed, which depends on experimental parameters: SNR, number of input images, sampling rate. A good agreement is found between this theoretical study and empirical performance in experimental SR recovery of bar code profiles.
Toward effective depot transformation: leveraging simulation to enhance transition planning
Authors: Perakath Benjamin, Michael Graul, Michael Painter, Frank Boydstun
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The goal of depot transformation is variability elimination over the production life-cycle. Forced to "ride the bike while we fix it," the depot must transform the current batch and queue production style to a lean, cellular paradigm. Major challenges include transforming the infrastructure, work force, facilities, and supply chain. Further, unlike manufacturing production where the "work content" in a production item has been engineered from the ground up, work content for a repair item is highly variable and creates a ripple effect across the production system. This paper describes depot-MRO transformation according to a series of carefully designed transitions that mitigate variability and provide the modeling needs and requirements that, if met, would enable effective modeling and analysis of MRO production scenarios, providing engineers with a Transformation Design Assistant [TDA] for designing and testing production control strategies. TDA components are currently employed at OC-ALC, NASA-KSC, and within UH-60 MRO programs.
Advances in Protein Ontology Project
Authors: Amandeep S. Sidhu, Tharam S. Dillon, Elizabeth Chang
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Advances in proteomics and protein expression techniques have lead to the elucidation of large amounts of protein data. Various data mining algorithms and mathematical models provide methods for analyzing this data; however, there are two issues that need to be addressed: (1) the need for standards for defining protein data description and exchange formats so they can be exchanged across the World Wide Web, and also read into data mining software in a consistent format and (2) eliminating errors which arise with the data integration methodologies for complex queries. Protein Ontology is designed to meet these needs by providing a structured protein data specification for Protein Data Representation. Protein Ontology is a standard for representing protein data in a way that helps in defining data integration and data mining models for Protein Structure and Function. In this paper we summarize the structure of Protein Ontology we developed earlier, its current applications to various protein families, and its future development.
Issues in the application of software safety standards
Authors: Matthew John Squair
Venue: Proceedings of the 10th Australian workshop on Safety critical systems and software - Volume 55 (2006)

The application of software safety standards as part of the development of safety critical software is usually considered an essential element of any safety program. Yet it is fairly rare for safety practitioners to step back and critically evaluate both the effectiveness and limitations of such standards.Naive implementations of safety standards can lead to over reliance on weak inductive arguments as to the safety of the software. Whilst incorrect requirements have been identified as a major cause of software accidents it appears that current software safety standards do not place a proportionate emphasis upon this causal factor. Additionally focusing upon the definition of process as opposed to the documentation of lessons learned the majority of software safety standards also appear inadequate to serve as repositories of the 'state of the art'.This paper examines the limitations, practical problems and issues associated with the use of current software safety standards. The evolution of software safety standards is reviewed and contrasted to the safety standards of other engineering disciplines. The paper then goes onto discuss problems with the current process based software safety standards and considers whether these standards in fact address the real causes of software related accidents. Finally the often overlooked pragmatic issues of applying safety standards are discussed. Due to space considerations the primary standards discussed are DEF-STAN 00-55 and 00-56, MIL-STD-882C, ARP 4761, ARP 4754, IEC 61508, DEF AUST 5679 and RTCA/DO-178B.
A service-oriented language for programming mobile agents
Authors: Hervé Paulino, Luís Lopes
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper we present MOB, a service-oriented scripting language for programming mobile agents in distributed systems. The main feature of the language is the integration of the service-oriented and the mobile agent paradigms. MOB is encoded onto a process calculus with a well studied semantics which provides us with a tool to prove the soundness of the language relative to the underlying calculus.
Spectral analysis for characterizing program power and performance
Authors: R. Joseph, M. Martonosi, Zhigang Hu
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Performance and power analysis in modern processors requires managing a large amount of complex information across many time-scales. For a example, thermal control issues are a power subproblem with relevant time constants of millions of cycles or more, while the so-called dI/dT problem is also a power subproblem but occurs because of current variability on a much finer granularity: tens to hundreds of cycles. Likewise, for performance issues, program phase analysis for selecting simulation regions requires looking for periodicity on the order of millions of cycles or more, while some aspects of cache performance optimization requires understanding repetitive patterns on much finer granularities. Fourier analysis allows one to transform waveform into a sum of component (usually sinusoidal) waveforms in the frequency domain; in this way, the waveform's fundamental frequencies (periodicities of repetition) can be clearly identified. This paper shows how one can use Fourier analysis to produce frequency spectra for some of the time waveforms seen in processor execution. By working in the frequency domain, one can easily identify key application tendencies. For example, we demonstrate how to use spectral analysis to characterize the power behavior of real programs. As we show, this is useful for understanding both the temperature profile of a program and its voltage stability. These are particularly relevant issues for architects since thermal concerns and the dI/dT problem have significant influence on processor design. Frequency analysis can also be used to examine program performance. In particular, it can also identify periodic occurrences of important microarchitectural events like cache misses. Overall, the paper demonstrates the value of using frequency analysis in different research efforts related to characterizing and optimizing application performance and power.