31 research outputs found

    Applying genetic algorithms to convoy scheduling

    Get PDF
    We present the results of our work on applying genetic algorithms combined with a discrete event simulation to the problem of convoy scheduling. We show that this approach can automatically remove conflicts from a convoy schedule thereby providing to the human operator the ability to search for better solutions after an initial conflict free schedule is obtained. We demonstrate that it is feasible to find a conflict free schedule for realistic problems in a few minutes on a common workstation or laptop. The system is currently being integrated into a larger Transportation Information System that regulates highway movement for the militaryIFIP International Conference on Artificial Intelligence in Theory and Practice - Industrial Applications of AIRed de Universidades con Carreras en Informática (RedUNCI

    Applying genetic algorithms to convoy scheduling

    Get PDF
    We present the results of our work on applying genetic algorithms combined with a discrete event simulation to the problem of convoy scheduling. We show that this approach can automatically remove conflicts from a convoy schedule thereby providing to the human operator the ability to search for better solutions after an initial conflict free schedule is obtained. We demonstrate that it is feasible to find a conflict free schedule for realistic problems in a few minutes on a common workstation or laptop. The system is currently being integrated into a larger Transportation Information System that regulates highway movement for the militaryIFIP International Conference on Artificial Intelligence in Theory and Practice - Industrial Applications of AIRed de Universidades con Carreras en Informática (RedUNCI

    Safeguarding the transmission of biometric measurements used for authenticating individuals

    Get PDF
    Various biometric measurements can be used to establish the identity of individuals. Common to many of them is the fact that a significant amount of information is collected and transmitted; this information is then used to compare the captured biometric data with the previously recorded information identifying a particular individual. If the two pieces of information are similar, it is assumed that the identification is carried out correctly. An important problem in this process is the safeguarding of the transmission of the captured information. In many cases, it cannot be assumed that the channel over which this information is transmitted is secure. Therefore it is crucial that the process be viable even if the channel is insecure. We outline an approach that ensures the security and integrity of this process. We demonstrate that this approach is highly effective in that it requires only minimal additional storage capacity and virtually no additional processing capacity to be functional. Support of this research under NSF grants DUE 0313880, SCI 0453498, and OISE 0519316 is acknowledged.5th IFIP International Conference on Network Control & Engineering for QoS, Security and MobilityRed de Universidades con Carreras en Informática (RedUNCI

    Performance Evaluation of Load-Balanced Routing via Bounded Randomization

    Get PDF
    Future computer networks are expected to carry bursty traffic. Shortest-path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inherent single-path routing. That is, the uniformly selected shortest path between a source and a destination may become highly congested even when many other paths have low utilization. We propose a family of routing schemes that distribute data traffic over the whole network via bounded randomization; in this way, they remove bottlenecks and consequently improve network performance. For each data message to be sent from a source s to a destination d, each of the proposed routing protocols randomly choose an intermediate node e from a selected set of network nodes, and routes the data message along a shortest path from s to e. Then, it routes the data message via a shortest path from e to d. Intuitively, we would expect that this increase the effective bandwidth between each source-destination pair. Our simulation results indicate that the family of proposed load-balanced routing protocols distribute traffic evenly over the whole network and, in consequence, increases network performance with respect to throughput, message loss, message delay and link utilization. Moreover, implementing our scheme requires only a simple extension to any shortest-path routing protocol

    Applying genetic algorithms to convoy scheduling

    Get PDF
    We present the results of our work on applying genetic algorithms combined with a discrete event simulation to the problem of convoy scheduling. We show that this approach can automatically remove conflicts from a convoy schedule thereby providing to the human operator the ability to search for better solutions after an initial conflict free schedule is obtained. We demonstrate that it is feasible to find a conflict free schedule for realistic problems in a few minutes on a common workstation or laptop. The system is currently being integrated into a larger Transportation Information System that regulates highway movement for the militaryIFIP International Conference on Artificial Intelligence in Theory and Practice - Industrial Applications of AIRed de Universidades con Carreras en Informática (RedUNCI

    The Comparison Of Dome And HMD Delivery Systems: A Case Study

    Get PDF
    For effective astronaut training applications, choosing the right display devices to present images is crucial. In order to assess what devices are appropriate, it is important to design a successful virtual environment for a comparison study of the display devices. We present a comprehensive system, a Virtual environment testbed (VET), for the comparison of Dome and Head Mounted Display (HMD) systems on an SGI Onyx workstation. By writing codelets, we allow a variety of virtual scenarios and subjects' information to be loaded without programming or changing the code. This is part of an ongoing research project conducted by the NASA / JSC

    A Virtual Environment System for the Comparison of Dome and HMD Systems

    Get PDF
    For effective astronaut training applications, choosing the right display devices to present images is crucial. In order to assess what devices are appropriate, it is important to design a successful virtual environment for a comparison study of the display devices. We present a comprehensive system for the comparison of Dome and head-mounted display (HMD) systems. In particular, we address interactions techniques and playback environments

    Preface to CLEI 2011 Special Issue

    Full text link
    This special issue contains papers from CLEI 2011 w hich took place in October 2011 in Quito, Ecuador. The editors for this special issue w ere the chairs of the six symposia that constituted the conference CLEI 2011, plus the general chair of the program committee.Aguilar, J.; Atkinson, J.; Donoso, Y.; Fernández-Baca, D.; Leiss, EL.; Marin, G.; Nedel, L.... (2012). Preface to CLEI 2011 Special Issue. CLEI Electronic Journal. 15(2):1-3. http://hdl.handle.net/10251/46570S1315

    A programmer's companion to algorithm analysis

    No full text
    corecore