988 resultados para padrão real
Resumo:
The problem of automatic face recognition is to visually identify a person in an input image. This task is performed by matching the input face against the faces of known people in a database of faces. Most existing work in face recognition has limited the scope of the problem, however, by dealing primarily with frontal views, neutral expressions, and fixed lighting conditions. To help generalize existing face recognition systems, we look at the problem of recognizing faces under a range of viewpoints. In particular, we consider two cases of this problem: (i) many example views are available of each person, and (ii) only one view is available per person, perhaps a driver's license or passport photograph. Ideally, we would like to address these two cases using a simple view-based approach, where a person is represented in the database by using a number of views on the viewing sphere. While the view-based approach is consistent with case (i), for case (ii) we need to augment the single real view of each person with synthetic views from other viewpoints, views we call 'virtual views'. Virtual views are generated using prior knowledge of face rotation, knowledge that is 'learned' from images of prototype faces. This prior knowledge is used to effectively rotate in depth the single real view available of each person. In this thesis, I present the view-based face recognizer, techniques for synthesizing virtual views, and experimental results using real and virtual views in the recognizer.
Resumo:
A partir dos anos 1970, a ocupação pelo homem do espaço do centro-oeste brasileiro apresentou um elevado crescimento devido a políticas de expansão agrícola. Este fato ocorreu por meio do alto grau de mecanização agrícola e aplicação de fertilizantes, visando elevados níveis de produção em diversas localidades, como o sudoeste do Estado de Goiás. Tal predicado da alta produtividade mantém-se até os dias atuais, indicando a grande intensidade da dinâmica de uso e cobertura das terras nesta região. Desta forma, tornase necessário o conhecimento da dinâmica e distribuição espacial dos padrões de uso e cobertura da terra, podendo fornecer subsídios a ações de planejamento agrícola sobre o espaço em alguns municípios do sudoeste goiano. Para isto, imagens orbitais do satélite Landsat TM-5 foram adquiridas em diferentes períodos do ciclo agrícola ao longo de 2007. Informações complementares acerca do uso regional foram utilizadas para apoiar a interpretação e classificação, principalmente a partir dos dados obtidos em campo. Os mapas de uso e cobertura da terra para os municípios de Rio Verde, Acreúna, Santo Antônio da Barra, Santa Helena de Goiás, Montividiu e Paraúna foram obtidos utilizando ferramentas do programa Spring 4.3.3 como a segmentação de imagens, bem como o classificador semi-automático Bhattacharya Distance, sendo estabelecidas dez classes temáticas, com base na legenda proposta pelo IBGE e Corine. A análise multitemporal, assim como a segmentação mostraram-se eficientes na distinção das classes de uso e cobertura da terra da região. A classe de uso destinada ao plantio da soja apresentou o maior percentual da área, mudando para culturas safrinha, solo exposto ou pousio no inverno. Outras classes também merecem destaque como a Pastagem e a Cana-de-açúcar, que apresentaram distribuição espacial bastante concentrada. Este mapeamento fornece subsídios ao planejamento do uso e ocupação das terras na região, considerando os aspectos ambientais e sociais, assegurando maior produtividade agrícola, visando um manejo sustentável das terras e a qualidade de vida ao homem do campo.
Resumo:
This report describes a knowledge-base system in which the information is stored in a network of small parallel processing elements ??de and link units ??ich are controlled by an external serial computer. This network is similar to the semantic network system of Quillian, but is much more tightly controlled. Such a network can perform certain critical deductions and searches very quickly; it avoids many of the problems of current systems, which must use complex heuristics to limit and guided their searches. It is argued (with examples) that the key operation in a knowledge-base system is the intersection of large explicit and semi-explicit sets. The parallel network system does this in a small, essentially constant number of cycles; a serial machine takes time proportional to the size of the sets, except in special cases.
Resumo:
De-excited dynamics of p-chlorotoluene and p-dichlorobenzene have been investigated by the femtosecond pump-probe method in a supersonic molecular beam. The yields of the parent ion and daughter ion are examined as a function of the delay time between the pump and probe laser pulses. The lifetime constants of excited p-chlorotoluene and p-dichlorobenzene are determined. Possible de-excitation mechanisms are suggested that the initially excited S-1 state is predissociative via the repulsive triplet state. The substituent effects of additional chlorine atom and methyl group are discussed. Moreover, for the first time, we observe a novel quantum beat oscillation in p-dichlorobenzene. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
A novel ligand modified heterogeneous catalyst has been developed for hydroformylation of propylene, which showed excellent activity, selectivity and stability and need not be separated from the product after reaction in a fixed-bed reactor. The coordination bonds between triphenyl phosphine (PPh3) and Rh/SiO2 were confirmed by means of thermogravimetric (TG), solid-state P-31 NMR, XPS and FT-IR. Two types of active species for hydroformylation were formed, which were proved by in situ FT-IR techniques. The problem of metal leaching was greatly reduced by directly fastening Rh particles on the support, and the active Rh species that was responsible for the outstanding performance of propylene hydroformylation was tightly bound by the very strong metal-metal bonds. No sign of deactivation was observed over a period of more than 1000 h on the condition that PPh3 was added at 300-350 h of time on stream. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
Uso de objetos de interação. Orientação para utilização de elementos gráficos. Disposição dos elementos gráficos. Espaçamentos dos elementos gráficos.
Resumo:
Walker,J. and Garrett,S. and Wilson,M.S., 'Evolving Controllers for Real Robots: A Survey of the Literature', Adaptive Behavior, 2003, volume 11, number 3, pp 179--203, Sage
Resumo:
Evans D A, Roberts O R, Vearey-Roberts A R, Langstaff D P, Twitchen D J and Schwitters M 2007 Direct observation of Schottky to ohmic transition in Al-diamond contacts using realtime photoelectron spectroscopy Appl. Phys. Lett. 91 132114 doi:10.1063/1.2790779
Resumo:
Iantchenko, A., (2007) 'Scattering poles near the real axis for two strictly convex obstacles', Annales of the Institute Henri Poincar? 8 pp.513-568 RAE2008
Resumo:
Real-time adaptive music is now well-established as a popular medium, largely through its use in video game soundtracks. Commercial packages, such as fmod, make freely available the underlying technical methods for use in educational contexts, making adaptive music technologies accessible to students. Writing adaptive music, however, presents a significant learning challenge, not least because it requires a different mode of thought, and tutor and learner may have few mutual points of connection in discovering and understanding the musical drivers, relationships and structures in these works. This article discusses the creation of ‘BitBox!’, a gestural music interface designed to deconstruct and explain the component elements of adaptive composition through interactive play. The interface was displayed at the Dare Protoplay games exposition in Dundee in August 2014. The initial proof-of- concept study proved successful, suggesting possible refinements in design and a broader range of applications.
Resumo:
10 hojas : cuadros.
Resumo:
http://www.archive.org/details/bypathstoforgott00haynrich
Resumo:
Sonic boom propagation in a quiet) stratified) lossy atmosphere is the subject of this dissertation. Two questions are considered in detail: (1) Does waveform freezing occur? (2) Are sonic booms shocks in steady state? Both assumptions have been invoked in the past to predict sonic boom waveforms at the ground. A very general form of the Burgers equation is derived and used as the model for the problem. The derivation begins with the basic conservation equations. The effects of nonlinearity) attenuation and dispersion due to multiple relaxations) viscosity) and heat conduction) geometrical spreading) and stratification of the medium are included. When the absorption and dispersion terms are neglected) an analytical solution is available. The analytical solution is used to answer the first question. Geometrical spreading and stratification of the medium are found to slow down the nonlinear distortion of finite-amplitude waves. In certain cases the distortion reaches an absolute limit) a phenomenon called waveform freezing. Judging by the maturity of the distortion mechanism, sonic booms generated by aircraft at 18 km altitude are not frozen when they reach the ground. On the other hand, judging by the approach of the waveform to its asymptotic shape, N waves generated by aircraft at 18 km altitude are frozen when they reach the ground. To answer the second question we solve the full Burgers equation and for this purpose develop a new computer code, THOR. The code is based on an algorithm by Lee and Hamilton (J. Acoust. Soc. Am. 97, 906-917, 1995) and has the novel feature that all its calculations are done in the time domain, including absorption and dispersion. Results from the code compare very well with analytical solutions. In a NASA exercise to compare sonic boom computer programs, THOR gave results that agree well with those of other participants and ran faster. We show that sonic booms are not steady state waves because they travel through a varying medium, suffer spreading, and fail to approximate step shocks closely enough. Although developed to predict sonic boom propagation, THOR can solve other problems for which the extended Burgers equation is a good propagation model.
Resumo:
In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that serializable schedules are found and executed as early as possible, thus, increasing the chances of a timely commitment of transactions with strict timing constraints. Due to its nature, we term our concurrency control algorithms Speculative. The aforementioned description encompasses many algorithms that we call collectively Speculative Concurrency Control (SCC) algorithms. SCC algorithms combine the advantages of both Pessimistic and Optimistic Concurrency Control (PCC and OCC) algorithms, while avoiding their disadvantages. On the one hand, SCC resembles PCC in that conflicts are detected as early as possible, thus making alternative schedules available in a timely fashion in case they are needed. On the other hand, SCC resembles OCC in that it allows conflicting transactions to proceed concurrently, thus avoiding unnecessary delays that may jeopardize their timely commitment.
Resumo:
Various concurrency control algorithms differ in the time when conflicts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency Control (PCC and OCC) alternatives represent two extremes. PCC locking protocols detect conflicts as soon as they occur and resolve them using blocking. OCC protocols detect conflicts at transaction commit time and resolve them using rollbacks (restarts). For real-time databases, blockages and rollbacks are hazards that increase the likelihood of transactions missing their deadlines. We propose a Speculative Concurrency Control (SCC) technique that minimizes the impact of blockages and rollbacks. SCC relies on the use of added system resources to speculate on potential serialization orders and to ensure that if such serialization orders materialize, the hazards of blockages and roll-backs are minimized. We present a number of SCC-based algorithms that differ in the level of speculation they introduce, and the amount of system resources (mainly memory) they require. We show the performance gains (in terms of number of satisfied timing constraints) to be expected when a representative SCC algorithm (SCC-2S) is adopted.