To see the other types of publications on this topic, follow the link: Ranvej.
Dissertations / Theses on the topic 'Ranvej'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Ranvej.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Zubrvalčík, Jan. "Současný stav a směry rozvoje metod a technického zabezpečení navigace civilních letadel po ploše letiště." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-443773.
Full textAbstract:
This diploma thesis deals with navigation on airport surface. In thesis there are described main surveillance systems, which are used for navigation on airport surface and systems for prediction and avoiding collisions. For all systems is listed principle of action, their usage, advantages and disadvantages and informations, which are provided by these systems. In last chapter there are compared properties of main surveillance systems.
2
Eslinger, Brian, and Tom Young. "BRINGING RANGES CLOSER TOGETHER – NEW OPPORTUNITIES IN RANGE INTERCONNECTIVITY." International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/606748.
Full textAbstract:
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, NevadaTest and training ranges have sought the holy grail of large-scale range interconnectivity for many years. The ability to test at any range and transmit the information to the engineers at the home base and control the mission without sending the entire test team to a remote location improves the test schedules, reduces the cost of testing and improves the testing capabilities. New opportunities of interconnecting ranges are changing the business of open air range testing and the resulting capabilities. Two predominant opportunities will be discussed in this paper. First, is taking advantage of the fiber glut that the US is currently experiencing along with opportunities for government-acquired assets to service the testing community. This approach provides the government the ability to fiber-optically create a virtual test range and provide full interconnectivity of all data. Second is to take advantage of the existing networks such as the Defense Research Engineering Network (DREN) to make efficient on-demand type connectivity where, otherwise, it would be cost prohibitive.
3
Grasby, Stephen E. (Stephen Edward). "Stratigraphy of the Miette group and tectonic history of the southern Selwyn Range, western Main Ranges, British Columbia." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=60512.
Full textAbstract:
In the southern Selwyn Range, Hadrynian Miette Group strata form a thick conformable sequence. A distinctive carbonate unit in the middle Miette Group is assigned to the Old Fort Point Formation. Facies variations in the middle Miette Group, from grit dominated in the east to pelite dominated in the west, delineate a channel or fan lobe margin.Structures in the southern Selwyn Range developed during three main phases of deformation. The Fraser River Antiform, the dominant structure, formed during D$ sb2$. The Selwyn Range Fault cross-cut the earlier Fraser River Antiform during early D$ sb3$. The Fraser River Antiform tightened during late D$ sb3$, when the Selwyn Range Fault was reactivated, forming a 100m thick shear zone. The Chatter Creek Fault (D$ sb3$ or latter) has compressional and dextral motion, both with minor displacement.
Metamorphism was initiated during D$ sb2$ and peaked during D$ sb3$.
4
Wagenhofer, Markus. "Block numerical ranges." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=98404972X.
Full text
5
Moore, Maximo A. "Ranger Air Load Planner." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA380251.
Full text
6
鄭金木 and Kam-muk Cheng. "Plotting generalized numerical ranges." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31220514.
Full text
7
Fish, Richard James. "RANTES derivatives and CCR5." Thesis, University of York, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369362.
Full text
8
Cheng, Kam-muk. "Plotting generalized numerical ranges /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20792736.
Full text
9
PORTAS, DANUSA DEPES. "IMÁGENES MI(G)RANTES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2014. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=29990@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO
Esta tese se propõe à construção de uma perspectiva teórica que observe as aporias e antinomias reveladas pelo regime contemporâneo das imagens. As imagens constituem um ponto de peculiar fricção e desconforto junto às ciências humanas, não só como um tópico de estudo, mas como característica cultural divisada. Esse campo vem se definindo de modo interdisciplinar e alargando sua perspectiva na linha de pesquisa denominada Cultura Visual (Visual Culture). T.W. Mitchell fala de um pictorial turn ou inclusive um visual turn que estariam relacionados com um enfoque apoiado por infiltrações mútuas entre duas epistemologias, a visual e a linguística, o que problematiza a premissa naturalizada de se entender o ato interpretativo como o núcleo da competência profissional dos especialistas de nossa área. As imagens ou as visualidades demandam seus próprios modos de análise e exigem do investigador um tratamento operacional e uma consequente definição de termos que suportem suas particularidades. Ao tópico, acrescenta-se a reinstalação warburguiana que coincide, não por acaso, com este giro e induz à pesquisa fundamental atenção em algumas vertentes heurísticas do trabalho de Aby Warburg, pensador alemão que ao princípio do século XX explorou um campo de inter-relações entre a antropologia, imagens e arte. No exemplo do projeto Der Bilderatlas Mnemosyne, antecipa-se a reflexão atual. As proposições de Warburg, bem como as pesquisas teóricas de importante exegeta de sua obra George Didi-Huberman, buscam entender qualquer imagem como um cruzamento de múltiplas migrações – tanto em seu modelo de tempo, Nachleben, como em seu modelo de sentido, Pathosformel – e oferecem ferramenta metodológica central a essa investigação. A partir de uma moldura teórica sistêmica, a tese enfoca o projeto de artistas visuais, como Harun Farocki, cujo trabalho realiza uma arqueologia do saber visual através da prospecção e montagem de tempos heterogêneos, mediante imagens animadas por uma energia expressiva e por uma enorme espessura histórico-cultural. A análise desses agenciamentos procura delinear sua inserção ambivalente na cena contemporânea em que o sistema de comunicação impõe-se como força estruturante de novas formas de socialização através de práticas culturais e tecnologia, com amplas consequências para o campo humanístico, oferecendo enfoques inovadores à dinâmica de articulação de formas de vida e de cultura com as tecnologias de imediação. A dimensão transnacional do tráfico e da produção de imagens situa a imagem no centro dos debates sobre o papel da representação nas culturas globais. Estas questões poderiam cumprir-se em dois problemas fundamentais, a hibridação dos campos disciplinares e a relação entre a imagem e o arquivo com relação à memória, à história, à justiça. No horizonte destes problemas, o objetivo da tese é distinguir o papel constitutivo das sobrevivências (Nachleben) na dinâmica da imaginação ocidental e as funções politicas dos agenciamentos memorialísticos de que se revelam portadores.
Esta tesis se propone a la construcción de una perspectiva teórica que amaitine las aporías y antinomias reveladas por el régimen contemporáneo de imágenes. Las imágenes son un punto de fricción y desasosiego junto de las ciencias humanas, no sólo como un tema de estudio, sino como característica cultural percebida. Este campo se ha definido de manera interdisciplinaria y amplía su perspectiva a una línea de investigación denominada Cultura Visual (Visual Culture). T. W. Mitchell habla de un pictorial turn o incluso un visual turn que estarían relacionados con un enfoque respaldado por infiltraciónes recíprocas entre dos epistemologías, visual y lingüística, lo que cuestiona la premisa naturalizada de comprender el acto interpretativo como el núcleo de la competencia profesional de los especialistas en nuestra área. Las imágenes o visualidades exigen sus propios modos de análisis y requieren del investigador un tratamiento operativo y una consecuente definición de términos que sostenga sus particularidades. Al tema, se suma la reinstalación warburguiana que coincide, no por causalidad, con este giro e induce a investigación fundamental atención sobre la figura y algunas vertientes heurística del trabajo de Aby Warburg, pensador alemán que exploró a principios del siglo XX, un campo de interrelaciones entre antropología, imágenes y arte. En el exemplo Der Bilderatlas Mnemosyne, se anticipa todo una reflexión actual. Las proposiciones de Warburg, así como la investigación teórica de importante exégeta de su obra George Didi-Huberman buscan entender cualquier imagen como un cruce de múltiples migraciones – tanto en su modelo de tiempo, Nachleben, como en su modelo de sentido, Pathosformel – y ofrecen herramienta metodológica central a esta investigación. Desde un marco teórico sistémico, la tesis enfoca el proyecto de artistas visuales, como Harun Farocki, cuyo trabajo realiza una arqueología del saber visual a través de la prospección y montaje de tiempos heterogéneos, mediante imágenes animadas por una potencia expresiva y por un enorme espesor histórico-cultural. La análisis de estos agenciamientos busca delinear su inserción ambivalente en la escena contemporánea, donde se impone el sistema de comunicación como una fuerza estructurante de nuevas formas de socialización a través de prácticas culturales y tecnología, con amplias consecuencias para el campo humanístico, ofrecendo enfoques innovadores a dinámica de articulación de formas de vida y de cultura con las tecnologías de inmediación. La dimensión transnacional del tráfico y la producción de imágenes situa la imagen en el centro de los debates sobre el papel de la representación en las culturas globales. Estas cuestiones podrían cumplirse en dos problemas fundamentales, la hibridación de los campos disciplinarios, la relación entre la imagen y el archivo con respecto a la memoria, la historia, la justicia. En el horizonte de estos problemas, el objetivo de este trabajo consiste en distinguir el papel constitutivo de supervivencias (Nachleben) en la dinámica de la imaginación occidental y las funciones políticas de los agenciamientos de que se revelan portadores.
10
Turner, Lynn. "RANTES and T lymphocytes." Thesis, University of Bath, 1996. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307048.
Full text
11
Mauf, Pascal, and Martin Sladeczek. "Straßennamen des städtischen Randes." Deutsche Gesellschaft für Namenforschung e.V, 2013. https://ul.qucosa.de/id/qucosa%3A12859.
Full textAbstract:
This text contains a comparative evaluation of street names of the urban periphery. Starting with Erfurt, street names of other Thuringian and German cities of the late Middle Ages and the early modern period are examined. In doing so, different groups of people are contemplated, such as prostitutes, barber surgeons and knackers, whose appellatives finally found their way into street names. The focus is on accumulations of such names in certain areas of a city; differences between large and small cities are illustrated as well. In the end, the conclusion highlights the hitherto underutilised significance of these street names.
12
Smith, Tabrina M. "Operator Ranges and Porosity." Kent State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=kent1215466700.
Full text
13
Mauf, Pascal, and Martin Sladeczek. "Straßennamen des städtischen Randes." Universitätsbibliothek Leipzig, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-151103.
Full textAbstract:
This text contains a comparative evaluation of street names of the urban periphery. Starting with Erfurt, street names of other Thuringian and German cities of the late Middle Ages and the early modern period are examined. In doing so, different groups of people are contemplated, such as prostitutes, barber surgeons and knackers, whose appellatives finally found their way into street names. The focus is on accumulations of such names in certain areas of a city; differences between large and small cities are illustrated as well. In the end, the conclusion highlights the hitherto underutilised significance of these street names.
14
at, Klaus Schmidt@univie ac. "Invariant Cocycles have Abelian Ranges." ESI preprints, 2001. ftp://ftp.esi.ac.at/pub/Preprints/esi935.ps.
Full text
15
Haq, Abdul. "Improvements in ranked set sampling." Thesis, University of Canterbury. Mathematics and Statistics, 2014. http://hdl.handle.net/10092/9661.
Full textAbstract:
The main focus of many agricultural, ecological and environmental studies is to develop well designed, cost-effective and efficient sampling designs. Ranked set sampling (RSS) is one of those sampling methods that can help accomplish such objectives by incorporating prior information and expert knowledge to the design. In this thesis, new RSS schemes are suggested for efficiently estimating the population mean. These sampling schemes can be used as cost-effective alternatives to the traditional simple random sampling (SRS) and RSS schemes. It is shown that the mean estimators under the proposed sampling schemes are at least as efficient as the mean estimator with SRS. We consider the best linear unbiased estimators (BLUEs) and the best linear invariant estimators (BLIEs) for the unknown parameters (location and scale) of a location-scale family of distributions under double RSS (DRSS) scheme. The BLUEs and BLIEs with DRSS are more precise than their counterparts based on SRS and RSS schemes. We also consider the BLUEs based on DRSS and ordered DRSS (ODRSS) schemes for the unknown parameters of a simple linear regression model using replicated observations. It turns out that, in terms of relative efficiencies, the BLUEs under ODRSS are better than the BLUEs with SRS, RSS, ordered RSS (ORSS) and DRSS schemes.
Quality control charts are widely recognized for their potential to be a powerful process monitoring tool of the statistical process control. These control charts are frequently used in many industrial and service organizations to monitor in-control and out-of-control performances of a production or manufacturing process. The RSS schemes have had considerable attention in the construction of quality control charts. We propose new exponentially weighted moving average (EWMA) control charts for monitoring the process mean and the process dispersion based on the BLUEs obtained under ORSS and ODRSS schemes. We also suggest an improved maximum EWMA control chart for simultaneously monitoring the process mean and dispersion based on the BLUEs with ORSS scheme. The proposed EWMA control charts perform substantially better than their counterparts based on SRS and RSS schemes. Finally, some new EWMA charts are also suggested for monitoring the process dispersion using the best linear unbiased absolute estimators of the scale parameter under SRS and RSS schemes.
16
Chan, Kong, and 陳鋼. "Preservers of generalized numerical ranges." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B50662181.
Full textAbstract:
Let B(H) denote the C^*-algebra of all bounded linear operators on a complex Hilbert space H. For A ∈ B(H) and c = 〖(c1, . . . , cn)〗^t ∈ C^n with n being a positive integer such that n ≤ dim H, the c-numerical range and c-numerical radius of A are defined by
W_e (A)= {∑_(i=1)^n▒c_i 〈〖Ax〗_i, x_i 〉 : {x_1, …, x_n } is an orthonormal set in H}
and
W_C (A)={|z| :z ∈W_(c ) (A)}
respectively. When c = 〖(1, 0, . . . , 0)〗^t, Wc(A) reduces to the classical numerical
range W(A).
Preserver problems concern the characterization of maps between spaces of bounded linear operators that leave invariant certain functions, subsets, or relations etc. In this thesis, several preserver problems related to the numerical range or its generalizations were studied.
For A ∈ B(H), the diameter of its numerical range is
d_w(A) = sup{|a - b| : a, b ∈ W(A)}.
The first result in this thesis was a characterization of linear surjections on B(H) preserving the diameter of the numerical range, i.e., linear surjections T : B(H) → B(H) satisfying
d_w(T(A)) =d_w(A)
for all A ∈ B(H) were characterized.
Let Mn be the set of n × n complex matrices and Tn the set of upper triangular matrices in Mn. Suppose c = 〖(c1, . . . , cn)〗^t ∈ R^n. When wc(·) is a norm on Mn, mappings T on Mn (or Tn) satisfying
wc(T(A) - T(B)) = wc(A - B)
for all A,B were characterized.
Let V be either B(H) or the set of all self-adjoint operators in B(H). Suppose V^n is the set of n-tuples of bounded operators  = (A1, . . . ,An), with each Ai ∈ V. The joint numerical radius of  is defined by
w(Â) = sup{||(⟨A1x, x⟩, . . . , ⟨Anx, x⟩)∥ : x ∈ H, ∥x∥ = 1},
where ∥ · ∥ is the usual Euclidean norm on F^n with F = C or R. When H is infinite-dimensional, surjective linear maps T : V^n→V^n satisfying
w(T(Â)) = w(Â)
for all  ∈ V^n were characterized.
Another generalization of the numerical range is the Davis-Wielandt shell. For A ∈ B(H), its Davis-Wielandt shell is
DW(A) = {(⟨Ax, x⟩, ⟨Ax, Ax⟩): x ∈ H and∥x∥= 1}.
Define the Davis-Wielandt radius of A by
dw(A) = sup{(√(|⟨Ax, x⟩ |^2 + |⟨Ax, Ax⟩ |^2) : x ∈ H and ∥x∥= 1}.
Its properties and relations with normaloid matrices were investigated. Surjective mappings T on B(H) satisfying
dw(T(A) - T(B))= dw(A - B)
for all A,B ∈ B(H) were also characterized.
A characterization of real linear surjective isometries on B(H) by Dang was used to prove the preserver result about the Davis-Wielandt radius. The result of Dang is proved by advanced techniques and is applicable on a more general setting than B(H). In this thesis, the characterization of surjective real linear isometries on B(H) was re-proved using elementary operator theory techniques.published_or_final_version
Mathematics
Doctoral
Doctor of Philosophy
17
Varadarajan, Ramakrishna R. "Ranked Search on Data Graphs." FIU Digital Commons, 2009. http://digitalcommons.fiu.edu/etd/220.
Full textAbstract:
Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships. Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML documents in the World Wide Web. One of the key advantages of keyword search querying is its simplicity – users do not have to learn a complex query language, and can issue queries without any prior knowledge about the structure of the underlying data. The purpose of this dissertation was to develop techniques for user-friendly, high quality and efficient searching of graph structured databases. Several ranked search methods on data graphs have been studied in the recent years. Given a top-k keyword search query on a graph and some ranking criteria, a keyword proximity search finds the top-k answers where each answer is a substructure of the graph containing all query keywords, which illustrates the relationship between the keyword present in the graph. We applied keyword proximity search on the web and the page graph of web documents to find top-k answers that satisfy user’s information need and increase user satisfaction. Another effective ranking mechanism applied on data graphs is the authority flow based ranking mechanism. Given a top-k keyword search query on a graph, an authority-flow based search finds the top-k answers where each answer is a node in the graph ranked according to its relevance and importance to the query. We developed techniques that improved the authority flow based search on data graphs by creating a framework to explain and reformulate them taking in to consideration user preferences and feedback. We also applied the proposed graph search techniques for Information Discovery over biological databases. Our algorithms were experimentally evaluated for performance and quality. The quality of our method was compared to current approaches by using user surveys.
18
Lam, Tsz-mang, and 林梓萌. "The joint numerical range and the joint essential numerical range." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B49858853.
Full textAbstract:
Let B(H) denote the algebra of bounded linear operators on a complex Hilbert space H. The (classical) numerical range of T ∈ B(H) is the set
W(T) = {〈T x; x〉: x ∈ H; ‖x‖ = 1}
Writing T= T_1 + iT_2 for self-adjoint T_1, T_2 ∈ B(H), W(T) can be identified with the set
{(〈T_1 x, x〉,〈T_2 x, x〉) : x ∈ H, ‖x‖ = 1}.
This leads to the notion of the joint numerical range of T= 〖(T〗_1, T_2, …, T_n) ∈ 〖B(H)〗^n. It is defined by
W(T) = {(〈T_1 x, x〉,〈T_2 x, x〉, …, 〈T_n x, x〉) : x ∈ H, ‖x‖ = 1}.
The joint numerical range has been studied extensively in order to understand the
joint behaviour of operators.
Let K(H) be the set of all compact operators on a Hilbert space H. The essential numerical range of T ∈ B(H) is defined by
W_(e ) (T)=∩{W(T+K) :K∈K(H) }.
The joint essential numerical range of T= 〖(T〗_1, T_2, …, T_n) ∈〖 B(H)〗^n is defined analogously by
W_(e ) (T)=∩{ /W(T+K) :K∈〖K(H)〗^n }.
These notions have been generalized to operators on a Banach space. In Chapter 1 of this thesis, the joint spatial essential numerical range were introduced. Also the notions of the joint algebraic numerical range V(T) and the joint algebraic essential numerical range Ve(T) were reviewed. Basic properties of these sets were given.
In 2010, Müller proved that each n-tuple of operators T on a separable Hilbert space has a compact perturbation T + K so that We(T) = W(T + K). In Chapter 2, it was shown that any n-tuple T of operators on lp has a compact perturbation T +K so that Ve(T) = V (T +K), provided that Ve(T) has an interior point. A key step was to find for each n-tuple of operators on lp a compact perturbation and a sequence of finite-dimensional subspaces with respect to which it is block 3 diagonal. This idea was inspired by a similar construction of Chui, Legg, Smith and Ward in 1979.
Let H and L be separable Hilbert spaces and consider the operator D_AB=A⨂I_L⨂B on the tensor product space H ⨂▒L. In 1987 Magajna proved that W_(e ) (D_AB )=co[W_(e ) (A)- /(W(B)))∪/W(A) - W_(e ) (B))] by considering quasidiagonal operators. An alternative proof of the equality was given in Chapter 3 using block 3 diagonal operators.
The maximal numerical range and the essential maximal numerical range of T ∈ B(H) were introduced by Stampi in 1970 and Fong in 1979 respectively. In 1993, Khan extended the notions to the joint essential maximal numerical range.
However the set may be empty for some T ∈ B(H). In Chapter 4, the kth joint essential maximal numerical range, spatial maximal numerical range and algebraic numerical range were introduced. It was shown that kth joint essential maximal numerical range is non-empty and convex. Also, it was shown that the kth joint algebraic maximal numerical range is the convex hull of the kth joint spatial maximal numerical range. This extends the corresponding result of Fong.published_or_final_version
Mathematics
Master
Master of Philosophy
19
FLOYD, DONALD WINTERS. "THE POLICY OF EXPERIMENTAL STEWARDSHIP ON PUBLIC RANGELANDS." Diss., The University of Arizona, 1986. http://hdl.handle.net/10150/183950.
Full textAbstract:
Between July and September, 1985, 70 ranchers, environmentalists and agency officials participating in three chartered Experimental Stewardship Program (ESP) areas were interviewed. Committee records and agency documents were also examined. As a result of the field work three conclusions were reached: (1) conflicts over grazing decisions have been significantly reduced by the stewardship process, (2) available data is insufficient to support conclusions about changes in the ecological status of the plant communities within the stewardship areas and (3) the annual economic value of rangeland recreation exceeds all other rangeland outputs on all three areas studied.
20
Suryanarayanan, Vinoth. "Synchronised range queries." Thesis, University of Birmingham, 2012. http://etheses.bham.ac.uk//id/eprint/3768/.
Full textAbstract:
Computer simulations have been used more than ever before to embark on developing and understanding complex systems such as Multi-Agent Systems (MAS). As simulation systems become larger and more complex, scalability becomes an important issue for their successful deployment. PDES-MAS (Parallel and Discrete Event Simulations for Multi-Agent Systems) framework is, implemented based on distributed shared memory architecture, a parallel and discrete event simulation kernel to distribute and run parallel simulation of Multi-Agent Systems (MAS). There are several issues within such system and this thesis presents a notion of logical time synchronised range queries to address the issue of data access. Accessing data efficiently in a latency-sensitive and large scale network overlay is a vital requirement for the scalability of the system. So, this thesis presents a notion of synchronised range queries with algorithms to manage distributed data structures consistently and in a time ordered fashion across the system. To localise data access in such a large scale simulation system, algorithms are provided to distribute shared state such that the distribution reflects access patterns of simulating nodes. The algorithms are evaluated within the implementation of PDES-MAS framework using various agent based simulation traces.
21
Obaid, Arif. "Range image compression." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10131.
Full textAbstract:
Range Images, which are a representation of the surface of a 3-D object, are gaining popularity in many applications including CAD/CAM, multimedia and virtual reality. There is, thus, a need for compression of these 3-D images. Current standards for still image compression, such as JPEG, are not appropriate for such images because they have been designed specifically for intensity images. This has led us to develop a new compression method for range images. It first scans the image so that the pixels are arranged into a sequence. It then approximates this sequence by straight line segments within a user-specified maximum tolerance level. The extremities of the straight-line segments within a user-specified maximum tolerance level. The extremities of the straight-line segments are non-redundant points (NRPs). Huffman coding, with a fixed Huffman tree, is used to encode the distance between NRPs and their altitudes. A plane-filling scanning technique, known as Peano scanning, is used to improve performance. The algorithms performance is assessed on range images acquired from the Institute for Information Technology of the National Research Council of Canada. The proposed method performs better than JPEG for any given maximum tolerance level. The adaptive mode of the algorithm is also presented along with its performance assessment.
22
Reid, Robert J. "FIXED RANGE DEVELOPMENT." International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604526.
Full textAbstract:
ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, NevadaIn FY07 the Naval Undersea Warfare Center in Newport Rhode Island began the development of 2 major undersea tracking range replacements programs. The first program is called the Southern California ASW Range (SOAR) Refurbishment (SOAR-R) and the second program is called the Barking Sands Undersea Range Expansion (BSURE) Refurbishment (BSURE-R). These ranges will be located off the coast of San Clemente Island, California and Kauai, Hawaii respectively. The in-water instrumentation of the undersea tracking range is a series acoustic receive and transmit sensors nodes that are interconnected electrically and optically through a cable. These sensors make up arrays. A wavelength division multiplexing (WDM) telemetry schema is being developed for these arrays.
23
Goulet, Dennis A., and Harriet Coleman. "UNDER RANGE INTEROPERABILITY." International Foundation for Telemetering, 1994. http://hdl.handle.net/10150/608574.
Full textAbstract:
International Telemetering Conference Proceedings / October 17-20, 1994 / Town & Country Hotel and Conference Center, San Diego, CaliforniaThe U.S. Naval Undersea Warfare Center (NUWC) has established a secure network linking training and Research, Development, Test and Evaluation (RDT&E) ranges with sponsor sites. These links allow the remote monitoring and archiving of range data and audio, access to Center modeling, simulation and analysis facilities, the ability to remotely upgrade development and operating system software, and the ability to perform remote diagnostics and trouble-shooting of range resources from the Exercise Communications Center (ECC) located in Newport, RI, which serves as the hub of the network. The Training, Test and Evaluation Analysis Laboratory (TEAL) was developed to coordinate access to shipboard and land-based trainers and modeling and simulation facilities, as well as undersea ranges. By this process, TEAL integrates undersea ranges, laboratory simulation, and training systems into a seamless communications network. The Australian Underwater Range Activity (AURA) being installed in Western Australia has the capacity to become a participant in TEAL. The test and training flexibilities available with TEAL can enhance and expand the capabilities of AURA to the benefit of the Royal Australian Navy.
24
Mendis, Premalal J. "The origin of the geological structures, diapirs, grabens, and barite veins in the Flinders Ranges, South Australia." Title page, abstract and contents only, 2002. http://web4.library.adelaide.edu.au/theses/09PH/09phm5389.pdf.
Full textAbstract:
Bibliography: leaves [156-167] Map 1. Parachilna, sheet SH 54-13 / compiled by P. Reid and W.V. Preiss. 2nd ed. [Adelaide] : Primary Industries & Resources SA, 1999. 1 map : col ; 69 x 100 cm. (South Australia. Geological Survey. Geological atlas 1:250 000 series ; sheet SH 54-13) -- map 2. Geology of the Flinders Ranges National Park. Parkside, S. Aust. : Mines and Energy South Australia, 1994. 1 map : col. ; 84 x 60 cm. Scale: 1:75 000.
25
Kuhn, Zuzana. "Ranges of vector measures and valuations." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/30875.
Full text
26
Cheng, Kit-hung. "Top-k aggregation of ranked inputs." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B35506519.
Full text
27
Felton, A. J. "Biorthogonality and generalised k-numerical ranges." Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.636967.
Full textAbstract:
This thesis is presented in two parts followed by a brief Appendix. The two parts are independent, and each has its own bibliography. In Part I we introduce a concept of 'biorthogonality' in a smooth normed linear space. In Part II we look at generalisations of Halmos' k-numerical range and associated k-numerical radius for an operator on a Hilbert space. These generalisations again apply to Hilbert-space-operators. We study the rate of growth, as k tend to infinity, of these generalised k-numerical radii of von Neumann-Schatten class operators. In particular, for one such generalisation, we characterise trace-class operators in terms of this rate of growth. In the Appendix, we suggest a natural extension of Halmos' concept of k-numerical range to that for an operator on a general smooth normed linear space. Elementary properties are given, but a deeper development of the theory of such a k-numerical range is left as an open problem.
28
Neeves, K. F. "The safety of military firing ranges." Thesis, Cranfield University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.484167.
Full text
29
Cheng, Kit-hung, and 鄭傑雄. "Top-k aggregation of ranked inputs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B35506519.
Full text
30
Rocha, Júnior Antônio Gonçalves. "História e política em Ignácio Rangel." Universidade Federal de Goiás, 2010. http://repositorio.bc.ufg.br/tede/handle/tede/5401.
Full textAbstract:
Submitted by Cláudia Bueno (claudiamoura18@gmail.com) on 2016-03-30T21:20:21Z
No. of bitstreams: 2
Dissertação - Antônio Gonçalves Rocha Júnior - 2010.pdf: 3536431 bytes, checksum: 26b3b224f31edb6dbb8bb98c64e3b57a (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-04-04T11:33:59Z (GMT) No. of bitstreams: 2 Dissertação - Antônio Gonçalves Rocha Júnior - 2010.pdf: 3536431 bytes, checksum: 26b3b224f31edb6dbb8bb98c64e3b57a (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2016-04-04T11:33:59Z (GMT). No. of bitstreams: 2 Dissertação - Antônio Gonçalves Rocha Júnior - 2010.pdf: 3536431 bytes, checksum: 26b3b224f31edb6dbb8bb98c64e3b57a (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2010-12-10
This dissertation presents a systematic study of the work and thought of Ignácio Rangel, a leading Brazilian intellectuals of the twentieth century for having developed the original interpretations of the historical and political reality of Brazil. We seek in this paper to analyze some of the major theoretical formulations of the author, focusing primarily on two concepts: basic duality and the business cycle. It was whith the formulation of these and other concepts that he business cycle. It was with the formulation of these and other concepts that he could propose a structural understanding of the dynamics of inflation in Brazil and develop a new interpretation of the dynamics of inflation in Brazil and develop a new interpretation of the Brazilian agrarian structure, through the concept of Fourth Income. In its general sense, this paper therefore proposes a historiographical introduction of thought and overall word of Ignácio Rangel.
Esta dissertação apresenta um estudo sistemático sobre a obra e o pensamento de Ignácio Rangel, um dos mais importantes intelectuais brasileiros do século XX por ter desenvolvido originais interpretações sobre a realidade histórica e política do Brasil. Procuramos neste trabalho analisar algumas das principais formulações teóricas do autor, centradas fundamentalmente em dois conceitos: o de dualidade básica e o de ciclo econômico. Foi com a formulação desses e de outros conceitos que ele conseguiu propor um entendimento estrutural da dinâmica da inflação brasileira e elaborar uma nova interpretação da estrutura agrária brasileira, através do conceito de Quarta Renda. No seu sentido geral, esta dissertação propõe, portanto, uma introdução historiográfica do pensamento e conjunto da obra de Ignácio Rangel.
31
BENTZEN, Bruno. "Value-ranges, Julius Caesar and Indeterminacy." Universidade Federal de Pernambuco, 2014. https://repositorio.ufpe.br/handle/123456789/10802.
Full textAbstract:
Submitted by Paula Quirino (paula.quirino@ufpe.br) on 2015-03-05T17:15:48Z
No. of bitstreams: 1
DISSERTAÇÃO Bruno Bentzen Aguiar.pdf: 612020 bytes, checksum: 6f17bcdf8d18b27a6c1f6caa61ed5791 (MD5)Made available in DSpace on 2015-03-05T17:15:48Z (GMT). No. of bitstreams: 1 DISSERTAÇÃO Bruno Bentzen Aguiar.pdf: 612020 bytes, checksum: 6f17bcdf8d18b27a6c1f6caa61ed5791 (MD5) Previous issue date: 2014
As Grundgesetze der Arithmetik de Frege e o livro que cont em a vers~ao nal do sistema formal desenvolvido para provar a sua tese de que aritm etica e redut vel a l ogica. A m de evitar a indetermina c~ao levantada pelo problema Julius Caesar, a mais fundamental quest~ao los o ca encontrada pelo seu logicismo, Frege e levado a de nir os n umeros como extens~oes de conceitos, e, com isto, introduzir o Axioma V em seu sistema para governar a no c~ao de percurso de valores. Por em, no par agrafo 10 do livro, Frege encontra um novo problema de indetermina c~ao, a saber, o fato de que o Axioma V n~ao determina a refer^encia dos nomes de percurso de valores. Para resolver este problema, Frege executa a identi ca c~ao trans-sortal, que e a identi ca c~ao dos valores de verdade com percursos de valores de fun c~oes particulares. Entretanto, porque a identi ca c~ao n~ao nos fornece uma determina c~ao t~ao completa quanto a que dever amos esperar de seu famoso princ pio da completa determina c~ao (ela n~ao permite decidir se Julius Caesar e um percurso de valores), estudiosos como, principalmente, Dummett (1981) eWright (1983), t^em a rmado que Frege foi, a nal, incapaz de resolver o problema Julius Caesar em uma vers~ao persistente. O objetivo desta disserta c~ao se assenta em duas vertentes. Primeiro, queremos propor uma interpreta c~ao, sugerida por Greimann (2003), para conciliar a identi ca c~ao trans-sortal de Frege com o seu comprometimento com o princ pio da completa determina c~ao. Segundo, queremos concluir, acompanhando Ru no (2002), que n~ao h a problema Julius Caesar para percurso de valores.
32
Ketcham, Kwang B. "Group Frames and Partially Ranked Data." Scholarship @ Claremont, 2010. https://scholarship.claremont.edu/hmc_theses/19.
Full textAbstract:
We give an overview of finite group frames and their applications to calculating summary statistics from partially ranked data, drawing upon the work of Rachel Cranfill (2009). We also provide a summary of the representation theory of compact Lie groups. We introduce both of these concepts as possible avenues beyond finite group representations, and also to suggest exploration into calculating summary statistics on Hilbert spaces using representations of Lie groups acting upon those spaces.
33
Matthews, Michael J. "Extending Ranked Sampling in Inferential Procedures." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu149269869222179.
Full text
34
Steed, Arnold F. "A heuristic search method of selecting range-range sites for hydrographic surveys." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/27078.
Full text
35
Lin, Ismael. "Combining dense short range sensors and sparse long range sensors for mapping." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-223572.
Full textAbstract:
Mapping is one of the main components of autonomous robots, and consist in the construction of a model of their environment based on the information gathered by different sensors over time. Those maps will have different attributes depending on the type of sensor used for the reconstruction. In this thesis we focus on RGBD cameras and LiDARs. The acquired data with cameras is dense, but the range is short and the construction of large scale and consistent maps is more challenging. LiDARs are the exact opposite, they give sparse data but can measure long ranges accurately and therefore support large scale mapping better. The thesis presents a method that uses both types of sensors with the purpose of combine their strengths and reduce their weaknesses. The evaluation of the system is done in an indoor environment, and with an autonomous robot. The result of the thesis shows a map that is robust in large environments and has dense information of the surroundings.Kartläggning är en av huvudkomponenterna för autonoma robotar, och består av att bygga en modell av miljön utifrån informationen som samlats in av olika sensorer över tid. Dessa kartor kommer att ha olika attribut beroende på vilken typ av sensor som används för rekonstruktionen. I denna avhandling är fokus på RGBD-kameror och LiDARs. Datan från kameror är kompakt men kan bara mäta korta sträckor och det är utmanande att konstruera storskaliga och konsistenta kartor. LiDARs är exakt motsatta, de ger gles data men kan mäta långa avstånd noggrant och stödjer därför storskalig kartering bättre. Avhandlingen presenterar en metod som använder båda typerna av sensorer i syfte att kombinera deras styrkor och minska svagheterna. Utvärderingen av systemet sker i en inomhusmiljö och med en autonom robot. Resultatet av avhandlingen visar en karta som är robust i stora miljöer och har tät information om omgivningen.
36
Marler, Thomas M., Kelly Cooper, and William F. Lake. "A MODULAR RANGE INTERFACE FOR ACQUISITION AND DISTRIBUTION OF TEST RANGE DATA." International Foundation for Telemetering, 2001. http://hdl.handle.net/10150/607595.
Full textAbstract:
International Telemetering Conference Proceedings / October 22-25, 2001 / Riviera Hotel and Convention Center, Las Vegas, NevadaA flexible, modular method is needed to connect test range data systems to central real-time computer networks. This is achieved by the development of a real-time, networked, VME-based range interface system. Flexibility is achieved by a modular hardware and software design. The modular hardware consists of standard network interfaces, COTS VME interfaces, and a VME single board computer (with an onboard PCI bus). The modular software is implemented in C++ using the VxWorks real-time operating system. This paper describes the conceptual design and development of the Modular Range Interface (ModRI).
37
Ozyurek, Serkan. "Image Dynamic Range Enhancement." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613603/index.pdf.
Full textAbstract:
In this thesis, image dynamic range enhancement methods are studied in order to solve the problem of representing high dynamic range scenes with low dynamic range images. For this purpose, two main image dynamic range enhancement methods, which are high dynamic range imaging and exposure fusion, are studied. More detailed analysis of exposure fusion algorithms are carried out because the whole enhancement process in the exposure fusion is performed in low dynamic
range, and they do not need any prior information about input images. In order to evaluate the performances of exposure fusion algorithms, both objective and subjective quality metrics are used. Moreover, the correlation between the
objective quality metrics and subjective ratings is studied in the experiments.
38
Klasson, Martin. "Revision of Lacquer Range." Thesis, Örebro University, School of Science and Technology, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-11127.
Full textAbstract:
Detta examensarbete utfördes på lack- och tryckavdelningen på företaget
Emballator Ulricehamns Bleck med målet att undersöka om det fanns brister och
slöserier i det befintliga lacksortimentet.
Efter en noggrann nulägesanalys som inkluderade bland annat genomgång av
applicerbara datablad, arbetsplatsintroduktion och studiebesök hos en av
företagets lackleverantörer genomfördes arbetet utan missöden. Nulägesanalysen
resulterade i en översikt av dagens lacksortiment och efter det fortsatte arbetet
med att ta fram en egenskapsmatris innehållande samtliga lacker i sortimentet.
Efter att de lacker som föll inom författarens specifikation för dubbletter
identifierats togs ett antal rekommendationer för hur företaget bör agera för att ha
ett uppdaterat sortiment fram. Förutom detta har författaren tagit fram ett förslag
på hur företaget skall testa sina insideslacker för att i framtiden ha möjligheten att
undersöka om några av dessa kan tas ut ur sortimentet.
This degree project was performed in the coating and printing department at
Emballator Ulricehamns Bleck. The task was to investigate if any waste and
improvement opportunities in the lacquer range at Emballator Ulricehamns Bleck
exist.
A thorough analysis of the current situation including a review of applicable data,
work place introduction and a visit to one of the company´s suppliers was made.
This gave a good understanding of the current status. The result of the analysis
was an overview of the lacquer range that helped the author to compile a
characteristic matrix including all the products in the lacquer range. Following
this the author identified products that could be specified as duplicates.
Furthermore the degree project has resulted in 5 recommendations regarding
future work with the design of the lacquer range. The last part of the project
resulted in an analysis of today’s test schedule and a suggestion how to modify it
for future needs.
39
Nizami, Iftikhar Riaz. "On auditory dynamic range." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0006/NQ41258.pdf.
Full text
40
Glenn, Erik, and Cori Dolan. "Arizona's Open Range "Law"." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2010. http://hdl.handle.net/10150/146295.
Full textAbstract:
3 pp.Livestock are still an important part of rural life in Arizona. As more and more homes have been built adjacent to areas traditionally used for cattle grazing, the potential for conflict between livestock owners and homeowners has increased. Regardless of whether you yourself own large animals, you must be aware of your responsibilities towards your neighbors' livestock. The details of your responsibilities--and your liability--depend in large part upon where you live and whether you have a suitable fence around your property.
41
Kingdon, Lorraine B. "Success on the Range." College of Agriculture, University of Arizona (Tucson, AZ), 1989. http://hdl.handle.net/10150/295612.
Full text
42
Reichler, Thomas J. "Long-range atmospheric predictability /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3071001.
Full text
43
Frost, Duncan. "Long range monocular SLAM." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:af38cfa6-fc0a-48ab-b919-63c440ae8774.
Full textAbstract:
This thesis explores approaches to two problems in the frame-rate computation of a priori unknown 3D scene structure and camera pose using a single camera, or monocular simultaneous localisation and mapping. The thesis reflects two trends in vision in general and structure from motion in particular: (i) the move from directly recovered and towards learnt geometry; and (ii) the sparsification of otherwise dense direct methods. The first contributions mitigate scale drift. Beyond the inevitable accumulation of random error, monocular SLAM accumulates error via the depth/speed scaling ambiguity. Three solutions are investigated. The first detects objects of known class and size using fixed descriptors, and incorporates their measurements in the 3D map. Experiments using databases with ground truth show that metric accuracy can be restored over kilometre distances; and similar gains are made using a hand-held camera. Our second method avoids explicit feature choice, instead employing a deep convolutional neural network to yield depth priors. Relative depths are learnt well, but absolute depths less so, and recourse to database-wide scaling is investigated. The third approach uses a novel trained network to infer speed from imagery. The second part of the thesis develops sparsified direct methods for monocular SLAM. The first contribution is a novel camera tracker operating directly using affine image warping, but on patches around sparse corners. Camera pose is recovered with an accuracy at least equal to the state of the art, while requiring only half the computational time. The second introduces a least squares adjustment to sparsified direct map refinement, again using patches from sparse corners. The accuracy of its 3D structure estimation is compared with that from the widely used method of depth filtering. It is found empirically that the new method's accuracy is often higher than that of its filtering counterpart, but that the method is more troubled by occlusion.
44
Matos, Inês Pereira de. "Limited range coverage problems." Doctoral thesis, Universidade de Aveiro, 2009. http://hdl.handle.net/10773/2946.
Full textAbstract:
Doutoramento em MatemáticaTal como o título indica, esta tese estuda problemas de cobertura com alcance limitado. Dado um conjunto de antenas (ou qualquer outro dispositivo sem fios capaz de receber ou transmitir sinais), o objectivo deste trabalho é calcular o alcance mínimo das antenas de modo a que estas cubram completamente um caminho entre dois pontos numa região. Um caminho que apresente estas características é um itinerário seguro. A definição de cobertura é variável e depende da aplicação a que se destina. No caso de situações críticas como o controlo de fogos ou cenários militares, a definição de cobertura recorre à utilização de mais do que uma antena para aumentar a eficácia deste tipo de vigilância. No entanto, o alcance das antenas deverá ser minimizado de modo a manter a vigilância activa o maior tempo possível. Consequentemente, esta tese está centrada na resolução deste problema de optimização e na obtenção de uma solução particular para cada caso. Embora este problema de optimização tenha sido investigado como um problema de cobertura, é possível estabelecer um paralelismo entre problemas de cobertura e problemas de iluminação e vigilância, que são habitualmente designados como problemas da Galeria de Arte. Para converter um problema de cobertura num de iluminação basta considerar um conjunto de luzes em vez de um conjunto de antenas e submetê-lo a restrições idênticas. O principal tema do conjunto de problemas da Galeria de Arte abordado nesta tese é a 1-boa iluminação. Diz-se que um objecto está 1-bem iluminado por um conjunto de luzes se o invólucro convexo destas contém o objecto, tornando assim este conceito num tipo de iluminação de qualidade. O objectivo desta parte do trabalho é então minimizar o alcance das luzes de modo a manter uma iluminação de qualidade. São também apresentadas duas variantes da 1-boa iluminação: a iluminação ortogonal e a boa !-iluminação. Esta última tem aplicações em problemas de profundidade e visualização de dados, temas que são frequentemente abordados em estatística. A resolução destes problemas usando o diagrama de Voronoi Envolvente (uma variante do diagrama de Voronoi adaptada a problemas de boa iluminação) é também proposta nesta tese.
As the title implies, this thesis studies limited range coverage problems. Given a set of antennas (or any wireless device able to send or receive some sort of signal), the objective of the discussion that follows is to calculate the antennas’ minimum range so that a path between two points within a region is covered by the antennas, a path known as a safe route. The definition of coverage is variable and depends on the applications. In some instances, for example, when monitoring is critical as in the case of fires or military, the definition of coverage necessarily involves the use of multiple antennas to increase the effectiveness of monitoring. However, it is also desirable to extend a network’s lifespan, normally achieved by minimising the antennas’ range. Therefore the focus of this thesis will be the resolution of this dual problem and an affective solution is offered for each case. Although this question has been researched as an issue of coverage, it is also possible to establish a relation between coverage and illumination and visibility, known as Art Gallery problems. To conceptualise coverage problems as Art Gallery problems, all that is needed is to consider a set of lights instead of a set of antennas, which are subject to a similar set of restrictions. The main focus of the Art Gallery problems addressed in this thesis is 1-good illumination. An object is 1-well illuminated if it is fully contained by the convex hull of a set of lights, making this a type of quality illumination. The objective of the discussion that follows is therefore to minimise the lights’ range whilst maintaining a quality illumination. Moreover, two variants of 1-good illumination are also presented: orthogonal good illumination and good ! -illumination. The latter being related to data depth problems and data visualisation that are frequently used in statistics. The resolution of these problems using the Embracing Voronoi diagram (a variant of Voronoi diagrams adapted to good illumination) is also discussed in this thesis.
45
Luo, Yongfeng. "Range-Based Graph Clustering." University of Cincinnati / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1014606422.
Full text
46
Grace, Thomas, and Clay Fink. "METADATA FOR RANGE TELEMETRY." International Foundation for Telemetering, 2006. http://hdl.handle.net/10150/604128.
Full textAbstract:
ITC/USA 2006 Conference Proceedings / The Forty-Second Annual International Telemetering Conference and Technical Exhibition / October 23-26, 2006 / Town and Country Resort & Convention Center, San Diego, CaliforniaCTEIP has launched the integrated Network Enhanced Telemetry (iNET) project to foster advances in networking and telemetry technology to meet emerging needs of major test programs. This paper describes an approach for providing a unified means of describing telemetry systems. It will describe the motivation and framework for a metadata standard for specifying the components of an instrumented test article, its data and the flow of data through a telemetry system. The paper will also describe how this metadata standard can provide the means for describing different transmission formats for a common test article. The result of the task described by this paper will lead to a standard or set of standards that will optimize the use of commercial technology and tools.
47
Berard, Alfredo, Mark Buckley, and John Roach. "Range-Video Network (RNET)." International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/605989.
Full textAbstract:
ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, CaliforniaThe deployment of network-based airborne instrumentation systems is leading to cost-efficient replacement of legacy instrumentation systems. One application of airborne data acquisition that has been developed and maintained separately from traditional avionics and orange-wire data acquisition systems is high-speed camera packages. The development of network-based instrumentation systems has led to an opportunity to unify these two previously distinct airborne data acquisition activities. This paper describes the range-video network-based instrumentation system (rNET) being implemented by the 46th Test Wing, 846th Test Support Squadron at Eglin Air Force Base, FL to replace the existing Airborne Separation Video System (ASVS).
48
Pedroza, Moises, and Filiberto Macias. "OFF-RANGE CORRIDOR SUPPORT." International Foundation for Telemetering, 2000. http://hdl.handle.net/10150/606814.
Full textAbstract:
International Telemetering Conference Proceedings / October 23-26, 2000 / Town & Country Hotel and Conference Center, San Diego, CaliforniaWhite Sands Missile Range is supporting Ballistic Missile Defense Organization (BMDO) target firings from Ft. Wingate, NM. This two Off-Range Corridor allows BMDO to conduct long range testing within the continental U.S. The Transportable Range Augmentation and Control System (TRACS), consisting of a control van and one of two Mobile Telemetry Systems (MTS), provide the necessary on-site telemetry support. The Dual Remote Interferometer System (DRDAS) that tracks the telemetry RF carrier in support of Missile Flight Safety (MFS) is also included in this paper. This paper describes the telemetry support scenario in terms of preliminary simulations followed by real-time support. Real-time support consists of data distribution from the MTS to the Telemetry Distribution Center, TRACS Control van, Missile Flight Safety display van, Project Support vans, on-site data processing, as well as relaying raw data to the main WSMR Telemetry Data Center (TDC) for real-time analysis. As soon as telemetry data arrives at the TDC, it is converted into information. This information is used by MFS during real-time monitoring of vehicle performance. This paper includes the methods used for the conversion of data into information on-site and at TDC. Real-time data processing involves multiple independent systems performing their respective tasks on a particular segment of data.
49
Reid, Robert. "Shallow Water Training Range." International Foundation for Telemetering, 1999. http://hdl.handle.net/10150/608308.
Full textAbstract:
International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, NevadaDuring the cold war, undersea warfare (USW) was perceived as a large-area, deep-water operation. The need for USW has recently shifted to the shallow water, littoral environment. Consequently, US naval forces must train to operate in these littoral environments where regional conflicts are most likely to occur. In light of these requirements the Shallow Water Training Range (SWTR) has been initiated. Telemetry is used in the following areas of SWTR: fiber optic, microwave, RF and underwater. Only phase 1 of 8 phases of the program is executing therefore SWTR is a good opportunity for telemetry industry involvement.
50
Zimmerli, Dana W., and Steve Elston. "ADVANCED RANGE DATA LINK." International Foundation for Telemetering, 1985. http://hdl.handle.net/10150/615736.
Full textAbstract:
International Telemetering Conference Proceedings / October 28-31, 1985 / Riviera Hotel, Las Vegas, NevadaThis paper describes the design and performance of a flexible data link system for test and training range communications. To support a wide variety of range applications, this data link provides variable length messages, participant store-and-forward relays, remote data stations, three modes of operation - TDMA, polled, and carrier sense, and a transmitreceive range of more than 80 miles. The data link is adaptable to different message rates and sizes to support different types of missions. For example, a high dynamics aircraft mission can be supported by two-way 400 bit messages from 25 aircraft 10 times per second; a tactical armor mission can be supported by two-way 200 bit messages from 500 participants once per second. The data link is designed with packet radio and pseudonoise spread spectrum techniques to combat common range communication problems such as multipath fading, host vehicle obscuration, coexistence, interference, and vehicle dynamics. Data link performance is presented to show the flexibility and adaptability to various range communication requirements.