地震波散射非线性反演问题不动点理论及方法的研究

How to create a new method to solve the problem or reduce the influence of that the result of the seismic waves scattering nonlinear inversion is not uniqueness is a main purpose of this research work in the paper. On the background of research into the seismic inversion, new progress of the nonlinear inversion is introduced at the first chapter in this paper. Especially, the development, basic theories and assumptions on some major theories of seismic inversion are analyzed, discussed and summarized in mathematics and physics. Also, the problems faced by the mathematical basis of investigations of the seismic inversion are discussed, and inverse questions of strongly seismic scattering due to strong heterogeneous media in the Earth interior are analyzed and viewed. What the kernel of paper is that gathers all our attention making a new nonlinear inversion method of seismic scattering. The paper provides a theory and method of how to introduce the fixed-point theory into the nonlinear seismic scattering inversion and how to obtain the solution, and gives the actually method to create a serials of contractive mappings of velocity parameter's in the mapping space of wave. Therefore, the results testify the existence of fixed point of velocity parameter and give the method the find it. Further, the paper proves the conclusion that the value obtained by taking the fixed point of velocity parameter into wave equation is the fixed point of the wave of the contractive mapping. Thence, the fixed point is the global minima since the stabilities quality of the fixed point. Based on the new theory, in the chapter three, many inverse results are obtained in the numerical value test. By analysis the results one could find a basic facts that all the results, which are inversed by the different initial model, are tended to the true value in theoretical true model. In other words, the new method mostly eliminates the non-uniqueness that which is existed in seismic waves scattering nonlinear inversion in degree. But, since the test results are quite finite now, more test is need here to positive our theory. As a new theoretical method, it must be existed many weaken in it. The chapter four points out all the questions which is bother us. We hope more people to join us to solve the problem together.

Foundations of Actor Semantics

The actor message-passing model of concurrent computation has inspired new ideas in the areas of knowledge-based systems, programming languages and their semantics, and computer systems architecture. The model itself grew out of computer languages such as Planner, Smalltalk, and Simula, and out of the use of continuations to interpret imperative constructs within A-calculus. The mathematical content of the model has been developed by Carl Hewitt, Irene Greif, Henry Baker, and Giuseppe Attardi. This thesis extends and unifies their work through the following observations. The ordering laws postulated by Hewitt and Baker can be proved using a notion of global time. The most general ordering laws are in fact equivalent to an axiom of realizability in global time. Independence results suggest that some notion of global time is essential to any model of concurrent computation. Since nondeterministic concurrency is more fundamental than deterministic sequential computation, there may be no need to take fixed points in the underlying domain of a power domain. Power domains built from incomplete domains can solve the problem of providing a fixed point semantics for a class of nondeterministic programming languages in which a fair merge can be written. The event diagrams of Greif's behavioral semantics, augmented by Baker's pending events, form an incomplete domain. Its power domain is the semantic domain in which programs written in actor-based languages are assigned meanings. This denotational semantics is compatible with behavioral semantics. The locality laws postulated by Hewitt and Baker may be proved for the semantics of an actor-based language. Altering the semantics slightly can falsify the locality laws. The locality laws thus constrain what counts as an actor semantics.

Birkhoff normal forms for Fourier integral operators II

Iantchenko, A.; Sj?strand, J., (2001) 'Birkhoff normal forms for Fourier integral operators II', American Journal of Mathematics 124(4) pp.817-850 RAE2008

Asymptotic behaviour of the elastic solution near the tip of a crack situated at a nonideal interface

Mishuris, G; Kuhn, G., (2001) 'Asymptotic behaviour of the elastic solution near the tip of a crack situated at a nonideal interface', Zeitschrift f?r Angewandte Mathematik und Mechanik 81(12) pp.811-826 RAE2008

Twierdzenia o punktach stałych pewnych klas operatorów nieliniowych wraz z ich zastosowaniami

Wydział Matematyki i Informatyki

Mapping Parallel Iterative Algorithms onto Workstation Networks

For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.

Broadband chaos generated by an optoelectronic oscillator.

We study an optoelectronic time-delay oscillator that displays high-speed chaotic behavior with a flat, broad power spectrum. The chaotic state coexists with a linearly stable fixed point, which, when subjected to a finite-amplitude perturbation, loses stability initially via a periodic train of ultrafast pulses. We derive approximate mappings that do an excellent job of capturing the observed instability. The oscillator provides a simple device for fundamental studies of time-delay dynamical systems and can be used as a building block for ultrawide-band sensor networks.

Quantum homogenization for continuous variables: Realization with linear optical elements

Recently Ziman et al. [Phys. Rev. A 65, 042105 (2002)] have introduced a concept of a universal quantum homogenizer which is a quantum machine that takes as input a given (system) qubit initially in an arbitrary state rho and a set of N reservoir qubits initially prepared in the state xi. The homogenizer realizes, in the limit sense, the transformation such that at the output each qubit is in an arbitrarily small neighborhood of the state xi irrespective of the initial states of the system and the reservoir qubits. In this paper we generalize the concept of quantum homogenization for qudits, that is, for d-dimensional quantum systems. We prove that the partial-swap operation induces a contractive map with the fixed point which is the original state of the reservoir. We propose an optical realization of the quantum homogenization for Gaussian states. We prove that an incoming state of a photon field is homogenized in an array of beam splitters. Using Simon's criterion, we study entanglement between outgoing beams from beam splitters. We derive an inseparability condition for a pair of output beams as a function of the degree of squeezing in input beams.

Image processing chip for small object detection

A new, front-end image processing chip is presented for real-time small object detection. It has been implemented using a 0.6 µ, 3.3 V CMOS technology and operates on 10-bit input data at 54 megasamples per second. It occupies an area of 12.9 mm×13.6 mm (including pads), dissipates 1.5 W, has 92 I/O pins and is to be housed in a 160-pin ceramic quarter flat-pack. It performs both one- and two-dimensional FIR filtering and a multilayer perceptron (MLP) neural network function using a reconfigurable array of 21 multiplication-accumulation cells which corresponds to a window size of 7×3. The chip can cope with images of 2047 pixels per line and can be cascaded to cope with larger window sizes. The chip performs two billion fixed point multiplications and additions per second.

Head injury from a bungee run

An adaptation of bungee jumping, 'bungee running', involves participants attempting to run as far as they can whilst connected to an elastic rope which is anchored to a fixed point. Usually considered a safe recreational activity, we report a potentially life-threatening head injury following a bungee running accident.

Stressed Web Environments as Strategic Games: Risk Profiles and Weltanschauung

We consider the behaviour of a set of services in a stressed web environment where performance patterns may be difficult to predict. In stressed environments the performances of some providers may degrade while the performances of others, with elastic resources, may improve. The allocation of web-based providers to users (brokering) is modelled by a strategic non-cooperative angel-daemon game with risk profiles. A risk profile specifies a bound on the number of unreliable service providers within an environment without identifying the names of these providers. Risk profiles offer a means of analysing the behaviour of broker agents which allocate service providers to users. A Nash equilibrium is a fixed point of such a game in which no user can locally improve their choice of provider – thus, a Nash equilibrium is a viable solution to the provider/user allocation problem. Angel daemon games provide a means of reasoning about stressed environments and offer the possibility of designing brokers using risk profiles and Nash equilibria.

Asset Tracking in Critical Power Communications Infrastructures using Passive Techniques

Active network scanning injects traffic into a network and observes responses to draw conclusions about the network. Passive network analysis works by looking at network meta data or by analyzing traffic as it traverses a fixed point on the network. It may be infeasible or inappropriate to scan critical infrastructure networks. Techniques exist to uniquely map assets without resorting to active scanning. In many cases, it is possible to characterize and identify network nodes by passively analyzing traffic flows. These techniques are considered in particular with respect to their application to power industry critical infrastructure.

Quantization effects in the polyphase N-path IIR structure

Polyphase IIR structures have recently proven themselves very attractive for very high performance filters that can be designed using very few coefficients. This, combined with their low sensitivity to coefficient quantization in comparison to standard FIR and IIR structures, makes them very applicable for very fast filtering when implemented in fixed-point arithmetic. However, although the mathematical description is very simple, there exist a number of ways to implement such filters. In this paper, we take four of these different implementation structures, analyze the rounding noise originating from the limited arithmetic wordlength of the mathematical operators, and check the internal data growth within the structure. These analyses need to be done to ensure that the performance of the implementation matches the performance of the theoretical design. The theoretical approach that we present has been proven by the results of the fixed-point simulation done in Simulink and verified by an equivalent bit-true implementation in VHDL.

Implementação em hardware reconfigurável de método de separação de dados hiperespetrais

Relatório do Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Electrónica e Telecomunicações

Sistema de reconhecimento de impressões digitais baseado em FPGA

Trabalho de Projeto para obtenção do grau de Mestre em Engenharia de Eletrónica e Telecomunicações