• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5594
  • 2203
  • 1170
  • 549
  • 376
  • 294
  • 238
  • 152
  • 145
  • 103
  • 100
  • 88
  • 76
  • 74
  • 32
  • Tagged with
  • 13125
  • 1954
  • 1568
  • 1440
  • 1335
  • 1170
  • 1161
  • 1093
  • 929
  • 901
  • 887
  • 734
  • 723
  • 673
  • 648
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
601

Multi-analyte Lab on a Chip Detection Utilizing Optical and Electro-chemical Methods

Ratterman, Michael E. 19 October 2015 (has links)
No description available.
602

Multi-Objective Optimization of Conventional Surface Water Treatment Processes

Kennedy, Marla J. January 2016 (has links)
No description available.
603

A New Simulation of Multi-State Fading Channels

Mendu, Arjun 18 August 2003 (has links)
No description available.
604

Search for rare multi-pion decays of the tau lepton using the BABAR detector

Ter-Antonyan, Ruben 14 July 2006 (has links)
No description available.
605

Compile-time and Run-time Optimizations for Enhancing Locality and Parallelism on Multi-core and Many-core Systems

Baskaran, Muthu Manikandan 05 November 2009 (has links)
No description available.
606

Architecture-Based Software Evolution: A Multi-Dimensional Approach

Wang, Huan 08 1900 (has links)
<p> Software Evolution is unavoidable because software systems are subject to continuous change, continuing growth and increasing complexity. As software systems become mission-critical and large in size, the complexity in software development is now focused on software evolution rather than construction. In this work, we view a software system as an entity that is evolving throughout its lifetime, during development and maintenance. Based on a broad survey of software evolution approaches, we propose an architecture-based solution for software evolution, which is defined in terms of evolution specific operations on architectural elements, that is, adding, removing, replacing components and (or) connectors, transforming configurations according to the required changes. In our view of software architectures, connectors are more likely to change since they are the architectural elements which reflect business rules. This work is focused on the evolution of connectors in architectures describing detailed design. Coordination contracts are introduced by Fiadeiro et al. as a realization of connectors at this detailed architecture level, which enables a three-layer architecture to separate concerns of components, connectors and configuration during evolution. Furthermore, to constrain the evolution in a predictable direction, we have established a matching scheme for justifying behavioral relationships between coordination contracts by specification matching based on pre- and postconditions of contracts and methods. A number of specification matches, with various degrees of similarity between the evolved and evolving contracts, have been developed for system behaviors after evolution operations. Case studies are exhibited give a better understanding of these matches.</p> / Thesis / Master of Science (MSc)
607

Software Approaches to Optimize Energy Consumption for a Team of Distributed Autonomous Mobile Robots

Vu, Anh-Duy January 2019 (has links)
In recent years, we have seen the applications of distributed autonomous mobile robots (DAMRs) in a broad spectrum of areas like search and rescue, disaster management, warehouse, and delivery systems. Although each type of systems employing DAMRs has its specific challenges, they are all limited by energy since the robots are powered by batteries which have not advanced in decades. This motivates the development of energy efficiency for such systems. Although there has been research on optimizing energy for robotic systems, their approaches are from low-level (e.g., mechanic, system control, or avionic) perspectives. They, therefore, are limited to a specific type of robots and not easily adjusted to apply for different types of robots. Moreover, there is a lack of work studying the problem from a software perspective and abstraction. In this thesis, we tackle the problem from a software perspective and are particularly interested in DAMR systems in which a team of networked robots navigating in a physical environment and acting in concert to accomplish a common goal. Also, the primary focus of our work is to design schedules (or plans) for the robots so that they can achieve their goal while spending as little energy as possible. To this end, we study the problem in three different contexts: - Managing reliability and energy consumption tradeoff. That is, we propose that robots verify computational results of one another to increase the corroboration of outputs of our DAMR systems. However, this new feature requires robots to do additional tasks and consume more energy. Thus, we propose approaches to reach a balance between energy consumption and the reliability of results obtained by our DAMR systems. - Extending the operational time of robots. We first propose that our DAMR systems should employ charging stations where robots can come to recharge their batteries. Then, we aim to design schedules for the robots so that they can finish all their tasks while consuming as little energy and time (including the time spent for recharging) as possible. Moreover, we model the working space by a connected (possibly incomplete) graph to make the problem more practical. - Coping with environmental changes. This path planning problem takes into account not only energy limits but also changes in the physical environment, which may result in overheads (i.e., additional time and energy) that robots incur while doing their tasks. To tackle the problem from a software perspective, we first utilize Gaussian Process and Polynomial Regression to model disturbances and energy consumption, respectively, then proposed techniques to generate plans and adjust them when robots detect environmental changes. For each problem, we give a formal description, a transformation to integer (linear) programming, online algorithms, and an online algorithm. Moreover, we also rigorously analyze the proposed techniques by conducting simulations and experiments in a real network of unmanned aerial vehicles (UAVs). / Thesis / Candidate in Philosophy
608

Image Processing Algorithms for a Tiled Multi-projection Screen

GUO, DAWEI January 2020 (has links)
Nowadays the development of the screen technology is really fast, there are lcd, led, oled screen and many kinds of screens. They all have their own advantages and disadvantages, LCD screen is usually constrained by the size, and the LED screen is usually constrained by the resolution. In this thesis I will introduce a tiled projection screen which combined LED and LCD together. My major work is to develop algorithms which are used to solve three major problems. The first problem is the radial distortion caused by the lens. This problem is different from the usual distortion correction problem, the method used in this thesis is a reverse process of the camera calibration and the key is to simulate the distortion formula. The second problem is the complex brightness condition of the tiled projected image. In the thesis a non-linear edge blending method is applied so the projected images could merge together seamlessly. The third problem is combination of the LED and the LCD without harming the resolution of the whole picture. The result shows that the size and the resolution have been improved greatly. / Thesis / Master of Applied Science (MASc)
609

EXTENDED TARGET TRACKING METHODS IN MODERN SENSOR APPLICATIONS

Heidarpour, Mehrnoosh January 2020 (has links)
With the recent advances in sensor technology and resulting sensor resolution, conven- tional point-based target tracking algorithms are becoming insufficient, particularly in application domains such as autonomous vehicles, visual tracking and surveillance using high resolution sensors. This has renewed the interest in extended target (ET) tracking, which aims to track not only the centroid of a target, but also its shape and size over time. This thesis addresses three of the most challenging problems in the domain of ET tracking applications. The first investigated challenge is the need for an accu- rate shape and centre estimate for the ET object with an arbitrary unknown star- convex shape in presence of non-Gaussian noise. The proposed method is based on a Student’s-t process regression algorithm which is defined in a recursive framework to be applicable for on-line tracking problems. The second problem tries to relax any constraints, including the star-convex con- straint, that is imposed on the shape of the ET object during the course of estimation by defining a novel Random Polytopes shape descriptor. Also, the proposed solution introduces a method to mitigate the troubles caused as a result of self-occlusion in ET tracking applications which its ignorance may cause catastrophic divergence in the ET state estimate.Finally, a framework for tracking multiple ET objects in the presence of clutter and occlusion is studied and a solution is proposed. The proposed method can estimate the centre and shape of the ET objects in a realistically scenario with the self- and mutual-occlusion challenges being considered. The proposed approach defines a time varying state-dependent probability of detection for each ET that enables the track to prolong even under adverse conditions caused due to mutual-occlusion. Plus, the proposed algorithm uses set-membership uncertainty models to bound the association and target shape uncertainties of occluded ET, to obtain more accurate state and shape estimates of an ET object. The performance of the proposed methods are quantified on realistically simulated scenarios with self- and mutual-occlusions and their results are compared against existing state-of-the-art methods for ET tracking applications. / Thesis / Doctor of Philosophy (PhD)
610

DESIGNING AGORA: A SHARED MULTI-USER PROGRAMMING ENVIRONMENT

Thomas Allen Kennell (13806892) 19 September 2022 (has links)
<p>Shared programming systems typically fall into one of two categories: systems to distribute code between users, and systems to allow shared access to editing or debugging facilities. Version-control systems allow distribution of code and are often more than adequate for large-scale software development occurring over a long period of time, but they can become unwieldy for fast iterative or exploratory development in which multiple users wish to participate. In these situations, shared editors or pair programming tools may suffice,with the caveat that any user of the system can typically modify any of the code at will. Rather than connecting several users to the same editor session, it would be more effective to allow users to maintain separate sessions while quickly sharing selected chunks of code at will.</p> <p>To enable this paradigm, we have designed a new interpreter to allow distributed users to selectively share code and data at run-time. Our solution consists of a bytecode virtual machine <em>back-end </em>with access to a shared environment and a management mechanism to control creation and usage of these resources. By providing access to interpreter sessions overa network connection, we do not tie our interpreter to executing code from any one particular programming language, allowing any conforming <em>front-end</em> compiler and user interface to be used. This solution allows the development burden of shared programs to be distributed dynamically between users at run-time through the shared environment while still affording control over what and when to share, thereby facilitating more effective incremental or experimental multi-user programming.</p>

Page generated in 0.0481 seconds