• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2120
  • 299
  • 272
  • 267
  • 174
  • 110
  • 58
  • 40
  • 36
  • 36
  • 34
  • 30
  • 25
  • 19
  • 16
  • Tagged with
  • 4283
  • 811
  • 743
  • 645
  • 365
  • 345
  • 339
  • 337
  • 307
  • 298
  • 298
  • 297
  • 287
  • 278
  • 269
  • 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.
101

Addressing Track Coalescence in Sequential K-Best Multiple Hypothesis Tracking

Palkki, Ryan D. 22 May 2006 (has links)
Multiple Hypothesis Tracking (MHT) is generally the preferred data association technique for tracking targets in clutter and with missed detections due to its increased accuracy over conventional single-scan techniques such as Nearest Neighbor (NN) and Probabilistic Data Association (PDA). However, this improved accuracy comes at the price of greater complexity. Sequential K-best MHT is a simple implementation of MHT that attempts to achieve the accuracy of multiple hypothesis tracking with some of the simplicity of single-frame methods. Our first major objective is to determine under what general conditions Sequential K-best data association is preferable to Probabilistic Data Association. Both methods are implemented for a single-target, single-sensor scenario in two spatial dimensions. Using the track loss ratio as our primary performance metric, we compare the two methods under varying false alarm densities and missed-detection probabilities. Upon implementing a single-target Sequential K-best MHT tracker, a fundamental problem was observed in which the tracks coalesce. The second major thrust of this research is to compare different approaches to resolve this issue. Several methods to detect track coalescence, mostly based on the Mahalanobis and Kullback-Leibler distances, are presented and compared.
102

Cooperative Modeling and Design History Tracking Using Design Tracking Matrix

Kim, Jonghyun 2009 August 1900 (has links)
This thesis suggests a new framework for cooperative modeling which supports concurrency design protocol with a design history tracking function. The proposed framework allows designers to work together while eliminating design conflicts and redundancies, and preventing infeasible designs. This framework provides methods to track optimal design path and redundant design history in the overall design process. This cooperative modeling architecture consists of a modeling server and voxel-based multi-client design tool. Design change among server and multiple clients are executed using the proposed concurrency design protocol. The design steps are tracked and analyzed using Design Tracking Graph and Design Tracking Matrix (DTM), which provide a design data exchange algorithm allowing seamless integration of design modifications between participating designers. This framework can be used for effective cooperative modeling, and helps identify and eliminate conflicts and minimize delay. The proposed algorithm supports effective cooperative design functions. First, it provides a method to obtain the optimal design path which can be stored in a design library and utilized in the future design. Second, it helps capture modeling pattern which can be used for analyzing designer's performance. Finally, obtained redundancies can be used to evaluate designer?s design efficiency.
103

Tracking Stocks im deutschen Aktienrecht : unter besonderer Berücksichtigung eines Mischbeteiligungsmodells durch quotale Ausschüttung des Spartengewinns an mehrere Aktiengattungen /

Kuhn, Christian. January 2007 (has links)
Universiẗat, Diss.--Düsseldorf, 2006. / Literaturverz. S. XVII - XLIX.
104

System modeling of CMOS power amplifier employing envelope and average power tracking for efficiency enhancement

Tintikakis, Dimitri 03 December 2013 (has links)
In the past decade, there has been great motivation to improve the efficiency of power amplifiers (PAs) in handset transmitter systems in order to address critical issues such as poor battery life and excessive heat. Currently, the focus lies on high data rate applications such as wideband code division multiple access (WCDMA) and long term evolution (LTE) standards due to the stringent efficiency and linearity requirements on the PA. This thesis describes a simulation-based study of techniques for enhancing the efficiency of a CMOS power amplifier for WCDMA and LTE applications. The primary goal is to study the concepts of envelope and average power tracking in simulation and to demonstrate the effectiveness of these supply modulation techniques on a CMOS PA design. The P1dB and IMD performance of a Class A/AB CMOS PA has been optimized to operate with high peak-to-average modulation with WCDMA and LTE signals. Behavioral models of envelope and average power tracking are implemented using proposed algorithms, and a system-level analysis is performed. Envelope tracking is seen to offer a peak PAE improvement of 15% for WCDMA, versus a fixed voltage supply, while average power tracking renders a maximum efficiency gain of 9.8%. Better than -33dBc adjacent channel leakage-power ratio (ACLR) at 5MHz offset and EVM below 4% are observed for both supply tracking techniques. For LTE, envelope and average power tracking contribute to a peak PAE enhancement of 15.3% and 7%, respectively. LTE ACLR begins failing the -30dBc specification above 22.5dBm output power during envelope tracking operation in the PA implementation described here. / text
105

Algorithm Design for Driver Attention Monitoring

Sjöblom, Olle January 2015 (has links)
The concept driver distraction is diffuse and no clear definition exists, which causes troubles when it comes to driver attention monitoring. This thesis takes an approach where eyetracking data from experienced drivers along with radar data has been used and analysed in an attempt to set up adaptive rules of how and how often the driver needs to attend to different objects in its surroundings, which circumvents the issue of not having a clear definition of driver distraction. In order to do this, a target tracking algorithm has been implemented that refines the output from the radar, subsequently used together with the eye-tracking data to in a statistical manner, in the long term, try to answer the question for how long is the driver allowed to look away in different driving scenarios? The thesis presents a proof of concept of this approach, and the results look promising.
106

Multiple target tracking using neural networks and set estimation

Mauroy, Gilles Patrick 12 1900 (has links)
No description available.
107

Vehicle tracking using scale invariant features

Wang, Jue, Computer Science & Engineering, Faculty of Engineering, UNSW January 2008 (has links)
Object tracking is an active research topic in computer vision and has appli- cation in several areas, such as event detection and robotics. Vehicle tracking is used in Intelligent Transport System (ITS) and surveillance systems. Its re- liability is critical to the overall performance of these systems. Feature-based methods that are used to represent distinctive content in visual frames are one approach to vehicle tracking. Existing feature-based tracking systems can only track vehicles under ideal conditions. They have difficulties when used under a variety of conditions, for example, during both the day and night. They are highly dependent on stable local features that can be tracked for a long time period. These local features are easily lost because of their local property and image noise caused by factors such as, headlight reflections and sun glare. This thesis presents a new approach, addressing the reliability issues mentioned above, tracking whole feature groups composed of feature points extracted with the Scale Invariant Feature Transform (SIFT) algorithm. A feature group in- cludes several features that share a similar property over a time period and can be tracked to the next frame by tracking individual feature points inside it. It is lost only when all of the features in it are lost in the next frame. We cre- ate these feature groups by clustering individual feature points using distance, velocity and acceleration information between two consecutive frames. These feature groups are then hierarchically clustered by their inter-group distance, velocity and acceleration information. Experimental results show that the pro- posed vehicle tracking system can track vehicles with the average accuracy of over 95%, even when the vehicles have complex motions in noisy scenes. It gen- erally works well even in difficult environments, such as for rainy days, windy days, and at night. We are surprised to find that our tracking system locates and tracks motor bikes and pedestrians. This could open up wider opportunities and further investigation and experiments are required to confirm the tracking performance for these objects. Further work is also required to track more com- plex motions, such as rotation and articulated objects with different motions on different parts.
108

Maintenance of behaviour when reinforcement becomes delayed

Costa, Daniel January 2009 (has links)
Doctor of Philosophy (Phd) / Despite an abundance of evidence demonstrating that the temporal relationship between events is a key factor in an organism learning an association between those events, a general theoretical account of temporal contiguity has remained elusive. A particular question that has received little attention is whether behaviour established with strong contiguity can be maintained when contiguity is weakened. The primary aims of this thesis were to examine the mechanisms underlying both the effects of contiguity on learning in rats and humans and the maintenance effect described above. The experiments reported in this thesis demonstrated that rats’ lever-pressing for food/sucrose acquired with immediate reinforcement persisted when a trace/delay that would have prevented acquisition was subsequently introduced, provided the lever was a valid signal for reinforcement. In classical conditioning with a 10-second trace, rats performed magazine-entry during lever-insertion (goal-tracking) instead of lever-pressing (sign-tracking); with zero-trace, rats both sign- and goal-tracked if lever-insertion time was 10 seconds, while goal-tracking dominated with 5-second lever-insertion time. Furthermore, while it was found that context-US associations may interfere with CS-US learning, context conditioning did not contribute to the retardation of sign-tracking in trace conditioning. Overall, these results are consistent with the theory that a localisable manipulandum that signals an appetitive outcome with strong contiguity acquires hedonic value, and that such hedonic value drives lever-pressing behaviour that is resistant to changes in the conditions of reinforcement. Human performance in a conditioned suppression task was inversely related to trace interval, but this apparent contiguity effect was at least partially mediated by the number of distractors during the trace interval, as predicted by Revusky’s concurrent interference theory. Furthermore, some transfer of conditioned suppression was observed when the trace was subsequently lengthened. Despite the different explanations proposed to account for rat and human performance in these experiments, the results suggest that the effects of contiguity on learning may be driven by similar underlying mechanisms across species.
109

Tracking Stock Strukturen im US-amerikanischen und deutschen Aktienrecht /

Nolte, Alexander F. January 1900 (has links) (PDF)
Univ., Diss.-2003--Trier, 2002. / Literaturverz. S. [403] - 422. - Text überw. dt., teilw. engl.
110

Kalman filtering methods for moving vehicle tracking

Obolensky, Nicolas. January 2002 (has links)
Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Includes vita. Includes bibliographical references.

Page generated in 0.0842 seconds