311 |
Approximation of Antenna Patterns With Gaussian Beams in Wave Propagation Models.Sherkat, Navid January 2011 (has links)
The topic of antenna pattern synthesis, in the context of beam shaping, is considered. One approach to this problem is to use the method of point matching. This method can be used to approximate antenna patterns with a set of uniformly spaced sources with suitable directivities. One specifies a desired antenna pattern and approximates it with a combination of beams. This approach results in a linear system of equations that can be solved for a set of beam coefficients. With suitable shifts between the matching points and between the source points, a good agreement between the assumed and the reproduced antenna patterns can be obtained along an observation line. This antenna modelling could be used in the program NERO to compute the field at the receiver antenna for a realistic 2D communication link. It is verified that the final result is not affected by the details of the antenna modelling.
|
312 |
Efficient and Flexible Search in Large Scale Distributed SystemsAhmed, Reaz January 2007 (has links)
Peer-to-peer (P2P) technology has triggered a wide range of
distributed systems beyond simple file-sharing. Distributed XML
databases, distributed computing, server-less web publishing and
networked resource/service sharing are only a few to name. Despite
of the diversity in applications, these systems share a common
problem regarding searching and discovery of information. This
commonality stems from the transitory nodes population and
volatile information content in the participating nodes. In such
dynamic environment, users are not expected to have the exact
information about the available objects in the system. Rather
queries are based on partial information, which requires the
search mechanism to be flexible. On the other hand, to scale with
network size the search mechanism is required to be bandwidth
efficient.
Since the advent of P2P technology experts from industry and
academia have proposed a number of search techniques - none of
which is able to provide satisfactory solution to the conflicting
requirements of search efficiency and flexibility. Structured
search techniques, mostly Distributed Hash Table (DHT)-based, are
bandwidth efficient while semi(un)-structured techniques are
flexible. But, neither achieves both ends.
This thesis defines the Distributed Pattern Matching (DPM)
problem. The DPM problem is to discover a pattern (\ie bit-vector)
using any subset of its 1-bits, under the assumption that the
patterns are distributed across a large population of networked
nodes. Search problem in many distributed systems can be reduced
to the DPM problem.
This thesis also presents two distinct search mechanisms, named
Distributed Pattern Matching System (DPMS) and Plexus, for solving
the DPM problem. DPMS is a semi-structured, hierarchical
architecture aiming to discover a predefined number of matches by
visiting a small number of nodes. Plexus, on the other hand, is a
structured search mechanism based on the theory of Error
Correcting Code (ECC). The design goal behind Plexus is to
discover all the matches by visiting a reasonable number of nodes.
|
313 |
OOMatch: Pattern Matching as Dispatch in JavaRichard, Adam January 2007 (has links)
We present a new language feature, specified as an extension to Java. The feature is a form of dispatch, which includes and subsumes multimethods, but which is not as powerful as general predicate dispatch. It is, however, intended to be more practical and easier to use than the latter. The extension, dubbed OOMatch, allows method parameters to be specified as patterns, which are matched against the arguments to the method call. When matches occur, the method applies; if multiple methods apply, the method with the more specific pattern overrides the others.
The pattern matching is very similar to that found in the "case" constructs of many functional languages, with an important
difference: functional languages normally allow pattern matching over variant types (and other primitives such as tuples), while OOMatch allows pattern matching on Java ob jects. Indeed, the wider goal here is the study of the combination of
functional and ob ject-oriented programming paradigms.
Maintaining encapsulation while allowing pattern matching is of special importance. Class designers should have the control needed to prevent implementation details (such as private variables) from being exposed to clients of the class.
We here present both an informal "tutorial" description of OOMatch, as well as a formal specification of the language, and a proof that the conditions specified guarantee run-time safety.
|
314 |
Geometric Approximation Algorithms - A Summary Based ApproachRaghvendra, Sharathkumar January 2012 (has links)
<p>Large scale geometric data is ubiquitous. In this dissertation, we design algorithms and data structures to process large scale geometric data efficiently. We design algorithms for some fundamental geometric optimization problems that arise in motion planning, machine learning and computer vision.</p><p>For a stream S of n points in d-dimensional space, we develop (single-pass) streaming algorithms for maintaining extent measures such as the minimum enclosing ball and diameter. Our streaming algorithms have a work space that is polynomial in d and sub-linear in n. For problems of computing diameter, width and minimum enclosing ball of S, we obtain lower bounds on the worst-case approximation ratio of any streaming algorithm that uses polynomial in d space. On the positive side, we design a summary called the blurred ball cover and use it for answering approximate farthest-point queries and maintaining approximate minimum enclosing ball and diameter of S. We describe a streaming algorithm for maintaining a blurred ball cover whose working space is linear in d and independent</p><p>of n.</p><p>For a set P of k pairwise-disjoint convex obstacles in 3-dimensions, we design algorithms and data structures for computing Euclidean shortest path between source s and destination t. The running time of our algorithm is linear in n and the size and query time of our data structure is independent of n. We follow a summary based approach, i.e., quickly compute a small sketch Q of P whose size is independent of n and then compute approximate shortest paths with respect to Q.</p><p>For d-dimensional point sets A and B, |A| |B| n, and for a parameter &epsilon > 0,</p><p>We give an algorithm to compute &epsilon-approximate minimum weight perfect matching of A and B under d(. , .) in time O(n<super>1.5</super>&tau(n)) ; here &tau(n) is the query/update time of a dynamic weighted nearest neighbor under d(. , .). When A, B are point sets from</p><p>a bounded integer grid, for L<sub>1</sub> and L<sub>infinity</sub>-norms, our algorithm computes minimum weight</p><p>perfect matching of A and B in time O(n<super>1.5</super>). Our algorithm also extends to a generalization of matching called the transportation problem.</p><p>We also present an O(n polylog n ) time algorithm that computes under any L<sub>p</sub>-</p><p>norm, an &epsilon-approximate minimum weight perfect matching of A and B with high probability; all previous algorithms take </p><p>O(n<super>1.5</super> time. We approximate the L<sub>p</sub> norm using a distance function, based on a randomly shifted quad-tree. The algorithm iteratively generates an approximate minimum-cost augmenting path under the new distance function in</p><p>time proportional to the length of the path. We show that the total length of the augmenting paths generated by the algorithm is O(n log n) implying a near-linear running time.</p><p>All the problems mentioned above have a history of more than two decades and algorithms presented here improve previous work by an order of magnitude. Many of these improvements are obtained by new geometric techniques that might have broader applications</p><p>and are of independent interest.</p> / Dissertation
|
315 |
A Unified Model of Pattern-Matching Circuits for Field-Programmable Gate ArraysClark, Christopher R. 28 August 2006 (has links)
The objective of this dissertation is to develop a methodology for describing the functionality, analyzing the complexity, and evaluating the performance of a large class of pattern-matching circuit design approaches for field-programmable gate arrays (FPGAs). The developed methodology consists of three elements. The first is a functional model and associated nomenclature that unifies a significant portion of published circuit design approaches while also illuminating many novel approaches. The second is a set of analytical expressions that model the area and time complexity of each circuit design approach based on attributes of a given pattern set. Third, software tools are developed that facilitate architectural design space exploration and circuit implementation. This methodology is used to conduct an extensive evaluation and comparison of design approaches under a wide range of conditions using pattern sets from multiple application domains as well as synthetic pattern sets. The results indicate strong dependences between pattern set properties and circuit performance and provide new insights on the fundamental nature of various design approaches.
A number of techniques have been proposed for designing pattern-matching hardware circuits with reconfigurable FPGA chips. The use of FPGAs enables high performance because the circuits can be customized for a particular application and pattern set. A relatively unstudied consequence of tailoring circuits for specific patterns is that circuit area and performance are affected by various properties of the patterns used. Most previous work in this field only considers a single design approach and a small number of pattern sets. Therefore, it is not clear how each design is affected by pattern set properties. For a given set of patterns, it is difficult to determine which approach would be the most efficient or provide the highest performance. Previous attempts to compare approaches using results from different publications are conflicting and inconclusive due to variations in the FPGA devices, patterns, and circuit optimizations used. There has been no attempt to evaluate a wide range of designs under a common set of conditions. The methodology presented in this dissertation provides a framework for studying multiple aspects of FPGA pattern-matching circuits in a controlled and consistent manner.
|
316 |
The matching mechanism under the online job banksTsai, Ya-chi 07 July 2010 (has links)
The aim of the paper is to discuss the way that the online job banks send resumes to businesses for job seekers, and most businesses and job seekers have chosen online job banks as channel management for job wanted due to the rapid development of information technology for recent years. What businesses find employees and job seekers find jobs through the online job banks can be classified into two kinds, one is active candidates for the job, and another is matching pair by the online job banks. The online job banks help job seekers to send resumes to businesses by means of both ways, and how the online job banks send resumes to businesses for job seekers will affect the outcome. Therefore, this paper focuses on original way of sending resumes used by the online job banks, and also uses Gale-Shapley algorithm to devise different way of sending resumes which the online job banks possibly use in the future and consequently by comparing two ways of sending resumes, it can analyze what ways of sending resumes can be adopted by the online job banks under different situations.
|
317 |
The Implementation and Applications of Multi-pattern Matching Algorithm over General Purpose GPUCheng, Yan-Hui 08 July 2011 (has links)
With the current technology more and more developed, in our daily life, whether
doing research or work, we often use a variety of computer equipment to help us deal
with some of our frequently used data. And the type and quantity of data have become
more and more, such as satellite imaging data, genetic engineering, the global climate
forecasting data, and complex event processing, etc. Some certain types of the data
require both accuracy and timeliness. That is, we hope to look for some data in a shorter
time.
According to MIT Technology Review in August 2010 reported that the relevant
published, complex event processing becomes a new research, and it also includes in
the part of data search. Data search often means data comparing. Given
specified keywords or key information which we are looking for, we design a pattern
matching algorithm to find the results within a shorter time, or even real-time.
In our research, the purpose is to use the general-purpose GPU, NVIDIA Tesla
C2050, with parallel computing architecture to implement parallelism of the pattern
matching. Finally, we construct a service to handle a large number of real-time data. We
also make some performance tests and compare the results with the well-known
software ¡§Apache Solr¡¨ to find the differences and the possible application in the future.
|
318 |
A 3.1~10.6 GHz UWB Low Noise AmplifierHsieh, Yi-Lung 27 July 2011 (has links)
The main contents of this thesis are improving a UWB LNA, and analyze the input-matching, the noise, and the gain.
First we increase the width of the input transistor, and remove source-degeneration inductor. Those ways can increase the gain and reduce the noise of the circuit. In the input matching, we use a shunt capacitor, a series inductor, and the impedance of the transistor itself to achieve high frequency matching. The lower frequency matching is achieved by negative feedback resistor.
The UWB LNA dissipates 10.14 mW power and achieves input return loss (S11) below -11.5 dB, output return loss (S22) below -11.9 dB, forward gain (S21) of 14.4¡Ó0.4 dB, reverse isolation (S12) below -26.7 dB, and noise figure (NF) of 2.6~3.5 dB over the 3.1~10.6 GHz band of interest. 1-dB compression point (P1dB) of -16.8 dBm and input third-order inter-modulation point (IIP3) of -8.1 dBm are achieved at 6.85 GHz.
|
319 |
Development of Novel Linear Ultrashort Pulse Measurement TechniquesChen, Chin-hao 10 September 2012 (has links)
Full field characterization is an important issue for ultrafast optoelectronics. By suitable nonlinear constrain, several approaches, such as FROG, SPIDERS, MIIPS and so on, have been developed for providing detail information of optical pulses. However, phase matching bandwidth of nonlinear material limit the functionality for broadband signal. In this thesis, linear approach without limitation of phase matching bandwidth is proposed. Theoretically, we successfully demonstrated the feasibility of proposed method. We analyzed the limitation and discussed the pulse compression power with the proposed method. Besides, we also proposed experimental method for this method.
|
320 |
Adaptive Search Range for Full-Search Motion EstimationChu, Kung-Hsien 17 August 2004 (has links)
Due to the progress of Internet technology and technical improvement, the growths of multimedia products and services ,such as Multimedia Message Service¡]MMS¡^, Multimedia on Demand¡]MoD¡^, Video Conferencing, and Digital TV, are very fast. All of these services need good video compression and audio compression standards to support. It is impossible to transmit source data of multimedia on networks. Motion Estimation needs the most computing complexity in the video compression. In our research, we focus on how to reduce candidate blocks and keep video quality.
We study some fast motion estimation algorithms and architectures, and design a fast motion estimation architecture which supports resolution of 1280x720 at 30fps frame rate in HDTV specification based on hierarchical motion estimation algorithm. In the limit of hardware resources and the compressed video quality, the architecture can improve inter-coding performance. Two adjacent MacroBlocks have similar Motion Vector in our observation. We arrange a 16x8 processing element array to deal with two adjacent MacroBlocks together. The design can reduce a lot of clock cycles in the hierarchical motion estimation architecture, and keep high video quality.
Furthermore, we propose a search range prediction method¡]called ASR¡^which reflect the motion behavior of video sequences into search range on MB-By-MB Basis. ASR can reduce the unnecessary operation of candidate blocks and keep very high video quality compared with Full Search Block Matching algorithm by the implementation in official software of the new video compression standard, Joint Model of H.264/AVC.
|
Page generated in 0.0184 seconds