A perspectiva linear e orgãnica na conceção do desenho de paisagem

This dissertation was primarily engaged in the study of linear and organic perspective applied to the drawing of landscape, considering the perspective as a fundamental tool in order to graphically materialize sensory experiences offered by the landscape / place to be drawn. The methodology consisted initially in the investigation of perspective theories and perspective representation methods applied to landscape drawing, followed by practical application to a specific case. Thus, within the linear perspective were analyzed and explained: the visual framing, the methods of representation based on the descriptive geometry and also the design of shadows and reflections within the shadows. In the context of organic perspective were analyzed and described techniques utilizing depth of field, the color, or fading and overlapping and light-dark so as to add depth to the drawing. It was also explained a set of materials, printing techniques and resources, which by means of practical examples executed by different artists over time, show the perspectives’ drawings and application of theory. Finally, a set of original drawings was prepared in order to represent a place of a specific case, using for this purpose the theories and methods of linear and organic perspective, using different materials and printing techniques. The drawings were framed under the "project design", starting with the horizontal and vertical projections of a landscape architecture design to provide different views of the proposed space. It can be concluded that the techniques and methods described and exemplified, were suitable, with some adjustments, to the purpose it was intended, in particular in the landscape design conception, bringing to reality the pictorial sense world perceived by the human eye

A influência dos aplicativos móveis no negócio das empresas prestadoras de serviço de táxis em São Paulo: um estudo de caso

Este estudo pretende identificar as mudanças relevantes no mercado e qual o valor percebido pelos clientes e taxistas, considerando-se a inserção das empresas prestadoras de serviços de táxis da cidade de São Paulo no mundo virtual, através do uso de aplicativos. Para tanto, explanamos o conceito de cadeia de valor, incluindo cadeia de valor virtual e rede de valor, a fim de um melhor entendimento da estrutura em que se embasam as empresas desse novo ambiente, bem como explicamos os conceitos de modelo de negócio e Business Model Canvas. Com esse embasamento teórico propomos um framework com a finalidade de auxiliar o processo de extração e análise das informações que permitiram identificar as mudanças relevantes que ocorreram nesse mercado e o valor percebido pelos clientes e taxistas, fazendo uso de um estudo de caso. O tema é relevante, por se tratar de uma mudança significativa na forma como as empresas se relacionam com seus clientes e prestadores; e por permitir observar que valor agregado esse modelo tem propiciado, que fez com que cerca de 30 mil taxistas, dos 35 mil da cidade de São Paulo, optassem pelo uso de aplicativos, fazendo com que uma das empresas estudadas nessa dissertação atingisse mais de 2.5 milhões de downloads em todo o Brasil. Espera-se, com este estudo, identificar as mudanças relevantes que a inserção dos aplicativos trouxeram aos usuários e taxistas e apresentar um framework que pode ser utilizado como um facilitador na análise da cadeia de valor e cadeia de valor virtual do mercado de prestação de serviços de taxis, esclarecendo que esse modelo não é apenas um modismo ao qual se pode atribuir uma série de benefícios, mas, sim, uma tendência que está redefinindo o formato das empresas desse mercado.

European War pamphlets

A collection of miscellaneous pamphlets on World War I.

Genetic algorithms with applications in wireless communications

Genetic algorithms (GAs) are known to locate the global optimal solution provided sufficient population and/or generation is used. Practically, a near-optimal satisfactory result can be found by Gas with a limited number of generations. In wireless communications, the exhaustive searching approach is widely applied to many techniques, such as maximum likelihood decoding (MLD) and distance spectrum (DS) techniques. The complexity of the exhaustive searching approach in the MLD or the DS technique is exponential in the number of transmit antennas and the size of the signal constellation for the multiple-input multiple-output (MIMO) communication systems. If a large number of antennas and a large size of signal constellations, e.g. PSK and QAM, are employed in the MIMO systems, the exhaustive searching approach becomes impractical and time consuming. In this paper, the GAs are applied to the MLD and DS techniques to provide a near-optimal performance with a reduced computational complexity for the MIMO systems. Two different GA-based efficient searching approaches are proposed for the MLD and DS techniques, respectively. The first proposed approach is based on a GA with sharing function method, which is employed to locate the multiple solutions of the distance spectrum for the Space-time Trellis Coded Orthogonal Frequency Division Multiplexing (STTC-OFDM) systems. The second approach is the GA-based MLD that attempts to find the closest point to the transmitted signal. The proposed approach can return a satisfactory result with a good initial signal vector provided to the GA. Through simulation results, it is shown that the proposed GA-based efficient searching approaches can achieve near-optimal performance, but with a lower searching complexity comparing with the original MLD and DS techniques for the MIMO systems.

Blind multiuser receiver for DS-CDMA wireless system

We consider blind signal detection in an asynchronous code-division multiple-access (CDMA) system employing short spreading sequences in the presence of unknown multipath fading. This approach is capable of countering the presence of multiple-access interference (MAI) in CDMA fading channels. The proposed blind multiuser detector is based on an independent component analysis (ICA) to mitigate both MAI and noise. This algorithm has been utilised in blind source separation (BSS) of unknown sources from their mixtures. It can also be used for estimating the basis vectors of BSS. The aim is to include an ICA algorithm within a wireless receiver in order to reduce the level of interference in wideband systems. This blind multiuser detector requires no training sequence compared with the conventional multiuser detection receiver. The proposed ICA blind multiuser detector is made robust with respect to knowledge of signature waveforms and the timing of the user of interest. Several experiments are performed in order to verify the validity of the proposed ICA algorithm.

Performance comparisons between greedy and lagrange algorithms in adaptive MIMO MC-CDMA systems

This paper describes two algorithms for adaptive power and bit allocations in a multiple input multiple output multiple-carrier code division multiple access (MIMO MC-CDMA) system. The first is the greedy algorithm, which has already been presented in the literature. The other one, which is proposed by the authors, is based on the use of the Lagrange multiplier method. The performances of the two algorithms are compared via Monte Carlo simulations. At present stage, the simulations are restricted to a single user MIMO MC-CDMA system, which is equivalent to a MIMO OFDM system. It is assumed that the system operates in a frequency selective fading environment. The transmitter has a partial knowledge of the channel whose properties are measured at the receiver. The use of the two algorithms results in similar system performances. The advantage of the Lagrange algorithm is that is much faster than the greedy algorithm. ©2005 IEEE

Hop selection in peer-to-peer WPAN networks

Currently, wireless technology is revolutionizing the way we share information and communicate. The demands for mobility have made wireless technology the primary source for voice communication. Code-division multiple-access (CDMA) is a very popular spread spectrum application due to its claims of low transmission power, higher system capacity, ability to mitigate multipath fading and user interference. In that case, frequency-hopping code-division multiple access (FH-CDMA) has received considerable attention over the past few years. This technique will allow a better performance over a fading channel, message privacy, and immunity to narrowband interference. This paper addresses the characteristics of FH-CDMA in WPAN networks, with an emphasis on frequency-hopped Bluetooth systems. A performance evaluation of FH-CDMA is discussed and simulated. The analysis shows the interaction between the designed parameters and their effect on the network system. Most specifically, the FH-CDMA scheme provides frequency and temporal diversity to combat the effects of interference.

Genetic algorithm based distance spectrum technique for performance union bound of space-time trellis coded OFDM

This paper derives the performance union bound of space-time trellis codes in orthogonal frequency division multiplexing system (STTC-OFDM) over quasi-static frequency selective fading channels based on the distance spectrum technique. The distance spectrum is the enumeration of the codeword difference measures and their multiplicities by exhausted searching through all the possible error event paths. Exhaustive search approach can be used for low memory order STTC with small frame size. However with moderate memory order STTC and moderate frame size the computational cost of exhaustive search increases exponentially, and may become impractical for high memory order STTCs. This requires advanced computational techniques such as Genetic Algorithms (GAS). In this paper, a GA with sharing function method is used to locate the multiple solutions of the distance spectrum for high memory order STTCs. Simulation evaluates the performance union bound and the complexity comparison of non-GA aided and GA aided distance spectrum techniques. It shows that the union bound give a close performance measure at high signal-to-noise ratio (SNR). It also shows that GA sharing function method based distance spectrum technique requires much less computational time as compared with exhaustive search approach but with satisfactory accuracy.

Digital video transmission over wireless networks

The advent of the Integrated Services Digital Network (ISDN) led to the standardisation of the first video codecs for interpersonal video communications, followed closely by the development of standards for the compression, storage and distribution of digital video in the PC environment, mainly targeted at CD-ROM storage. At the same time the second-generation digital wireless networks, and the third-generation networks being developed, have enough bandwidth to support digital video services. The radio propagation medium is a difficult environment in which to deploy low bit error rate, real time services such as video. The video coding standards designed for ISDN and storage applications, were targeted at low bit error rate levels, orders of magnitude lower than the typical bit error rates experienced on wireless networks. This thesis is concerned with the transmission of digital, compressed video over wireless networks. It investigates the behaviour of motion compensated, hybrid interframe DPCM/DCT video coding algorithms, which form the basis of current coding algorithms, in the presence of high bit error rates commonly found on digital wireless networks. A group of video codecs, based on the ITU-T H.261 standard, are developed which are robust to the burst errors experienced on radio channels. The radio link is simulated at low level, to generate typical error files that closely model real world situations, in a Rayleigh fading environment perturbed by co-channel interference, and on frequency selective channels which introduce inter symbol interference. Typical anti-multipath techniques, such as antenna diversity, are deployed to mitigate the effects of the channel. Link layer error control techniques are also investigated.

Packet voice/data in local broadcast networks

A local area network that can support both voice and data packets offers economic advantages due to the use of only a single network for both types of traffic, greater flexibility to changing user demands, and it also enables efficient use to be made of the transmission capacity. The latter aspect is very important in local broadcast networks where the capacity is a scarce resource, for example mobile radio. This research has examined two types of local broadcast network, these being the Ethernet-type bus local area network and a mobile radio network with a central base station. With such contention networks, medium access control (MAC) protocols are required to gain access to the channel. MAC protocols must provide efficient scheduling on the channel between the distributed population of stations who want to transmit. No access scheme can exceed the performance of a single server queue, due to the spatial distribution of the stations. Stations cannot in general form a queue without using part of the channel capacity to exchange protocol information. In this research, several medium access protocols have been examined and developed in order to increase the channel throughput compared to existing protocols. However, the established performance measures of average packet time delay and throughput cannot adequately characterise protocol performance for packet voice. Rather, the percentage of bits delivered within a given time bound becomes the relevant performance measure. Performance evaluation of the protocols has been examined using discrete event simulation and in some cases also by mathematical modelling. All the protocols use either implicit or explicit reservation schemes, with their efficiency dependent on the fact that many voice packets are generated periodically within a talkspurt. Two of the protocols are based on the existing 'Reservation Virtual Time CSMA/CD' protocol, which forms a distributed queue through implicit reservations. This protocol has been improved firstly by utilising two channels, a packet transmission channel and a packet contention channel. Packet contention is then performed in parallel with a packet transmission to increase throughput. The second protocol uses variable length packets to reduce the contention time between transmissions on a single channel. A third protocol developed, is based on contention for explicit reservations. Once a station has achieved a reservation, it maintains this effective queue position for the remainder of the talkspurt and transmits after it has sensed the transmission from the preceeding station within the queue. In the mobile radio environment, adaptions to the protocols were necessary in order that their operation was robust to signal fading. This was achieved through centralised control at a base station, unlike the local area network versions where the control was distributed at the stations. The results show an improvement in throughput compared to some previous protocols. Further work includes subjective testing to validate the protocols' effectiveness.

Transmission of image data over digital networks involving mobile terminals

There is a growing demand for data transmission over digital networks involving mobile terminals. An important class of data required for transmission over mobile terminals is image information such as street maps, floor plans and identikit images. This sort of transmission is of particular interest to the service industries such as the Police force, Fire brigade, medical services and other services. These services cannot be applied directly to mobile terminals because of the limited capacity of the mobile channels and the transmission errors caused by the multipath (Rayleigh) fading. In this research, transmission of line diagram images such as floor plans and street maps, over digital networks involving mobile terminals at transmission rates of 2400 bits/s and 4800 bits/s have been studied. A low bit-rate source encoding technique using geometric codes is found to be suitable to represent line diagram images. In geometric encoding, the amount of data required to represent or store the line diagram images is proportional to the image detail. Thus a simple line diagram image would require a small amount of data. To study the effect of transmission errors due to mobile channels on the transmitted images, error sources (error files), which represent mobile channels under different conditions, have been produced using channel modelling techniques. Satisfactory models of the mobile channel have been obtained when compared to the field test measurements. Subjective performance tests have been carried out to evaluate the quality and usefulness of the received line diagram images under various mobile channel conditions. The effect of mobile transmission errors on the quality of the received images has been determined. To improve the quality of the received images under various mobile channel conditions, forward error correcting codes (FEC) with interleaving and automatic repeat request (ARQ) schemes have been proposed. The performance of the error control codes have been evaluated under various mobile channel conditions. It has been shown that a FEC code with interleaving can be used effectively to improve the quality of the received images under normal and severe mobile channel conditions. Under normal channel conditions, similar results have been obtained when using ARQ schemes. However, under severe mobile channel conditions, the FEC code with interleaving shows better performance.

Transmission of data under multipath transmission conditions

The explosive growth in microprocessor technology and the increasing use of computers to store information has increased the demand for data communication channels. Because of this, data communication to mobile vehicles is increasing rapidly. In addition, data communication is seen as a method of relieving the current congestion of mobile radio telephone bands in the U.K. Highly reliable data communication over mobile radio channels is particularly difficult to achieve, primarily due to fading caused by multipath interference. In this thesis a data communication system is described for use over radio channels impaired by multipath interference. The thesis first describes radio communication in general, and multipath interference In particular. The practical aspects of fading channels are stressed because of their importance in the development of the system. The current U.K. land mobile radio scene is then reviewed, with particular emphasis on the use of existing mobile radio equipment for data communication purposes. The development of the data communication system is then described. This system is microprocessor based and uses an advanced form of automatic request repeat (ARQ) operation. It can be configured to use either existing radio-telephone equipment, totally new equipment specifically designed for data communication, or any combination of the two. Due to its adaptability, the system can automatically optimise itself for use over any channel, even if the channel parameters are changing rapidly. Results obtained from a particular implementation of the system, which is described in full, are presented. These show how the operation of the system has to change to accomodate changes in the channel. Comparisons are made between the practical results and the theoretical limits of the system.

Models and performances of wireless MIMO and cooperative communication systems

Multiple-antenna systems offer significant performance enhancement and will be applied to the next generation broadband wireless communications. This thesis presents the investigations of multiple-antenna systems – multiple-input multiple-output (MIMO) and cooperative communication (CC) – and their performances in more realistic propagation environments than those reported previously. For MIMO systems, the investigations are conducted via theoretical modelling and simulations in a double-scattering environment. The results show that the variations of system performances depend on how scatterer density varies in flat fading channels, and that in frequency-selective fading channels system performances are affected by the length of the coding block as well as scatterer density. In realistic propagation environments, the fading correlation also has an impact on CC systems where the antennas can be further apart than those in MIMO systems. A general stochastic model is applied to studying the effects of fading correlation on the performances of CC systems. This model reflects the asymmetry fact of the wireless channels in a CC system. The results demonstrate the varied effects of fading correlation under different protocols and channel conditions. Performances of CC systems are further studied at the packet level, using both simulations and an experimental testbed. The results obtained have verified various performance trade-offs of the cooperative relaying network (CRN) investigated in different propagation environments. The results suggest that a proper selection of the relaying algorithms and other techniques can meet the requirements of quality of service for different applications.

Long-range and high-resolution correlation optical time-domain reflectometry utilizing an all optical chaotic source

A high resolution optical time domain reflectometry (OTDR) based on an all-fiber chaotic source is demonstrated. We analyze the key factors limiting the operational range of such an OTDR, e.g., integral Rayleigh backscattering and the fiber loss, which degrade the optical signal to noise ratio at the receiver side, and then the guideline for counter-act such signal fading is discussed. The experimentally demonstrated correlation OTDR presents ability of 100km sensing range and 8.2cm spatial resolution (1.2 million resolved points), as a verification of the theoretical analysis. To the best of our knowledge, this is the first time that correlation OTDR measurement is performed over such a long distance with such high precision.

Long-range and high-precision correlation optical time-domain reflectometry utilizing an all-fiber chaotic source

We propose a long range, high precision optical time domain reflectometry (OTDR) based on an all-fiber supercontinuum source. The source simply consists of a CW pump laser with moderate power and a section of fiber, which has a zero dispersion wavelength near the laser's central wavelength. Spectrum and time domain properties of the source are investigated, showing that the source has great capability in nonlinear optics, such as correlation OTDR due to its ultra-wide-band chaotic behavior, and mm-scale spatial resolution is demonstrated. Then we analyze the key factors limiting the operational range of such an OTDR, e. g., integral Rayleigh backscattering and the fiber loss, which degrades the optical signal to noise ratio at the receiver side, and then the guideline for counter-act such signal fading is discussed. Finally, we experimentally demonstrate a correlation OTDR with 100km sensing range and 8.2cm spatial resolution (1.2 million resolved points), as a verification of theoretical analysis.