Sliding Mode Control-Based Autopilots for Leaderless Consensus of Unmanned Aerial Vehicles

In this brief, decentralized sliding mode controllers that enable a connected and leaderless swarm of unmanned aerial vehicles (UAVs) to reach a consensus in altitude and heading angle are presented. In addition, sliding mode control-based autopilot designs to control those states for which consensus is not required are also presented. By equipping each UAV with this combination of controllers, it can autonomously decide on being a member of the swarm or fly independently. The controllers are designed using a coupled nonlinear dynamic model, derived for the YF-22 aircraft, where the aerodynamic forces and moments are linear functions of the states and inputs.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Anisotropic thermopiezoelectric solids with an elliptic inclusion or a hole under uniform heat flow

The two-dimensional problem of a thermopiezoelectric material containing an elliptic inclusion or a hole subjected to a remote uniform heat flow is studied. Based on the extended Lekhnitskii formulation for thermopiezoelectricity, conformal mapping and Laurent series expansion, the explicit and closed-form solutions are obtained both inside and outside the inclusion (or hole). For a hole problem, the exact electric boundary conditions on the hole surface are used. The results show that the electroelastic fields inside the inclusion or the electric field inside the hole are linear functions of the coordinates. When the elliptic hole degenerates into a slit crack, the electroelastic fields and the intensity factors are obtained. The effect of the heat how direction and the dielectric constant of air inside the crack on the thermal electroelastic fields are discussed. Comparison is made with two special cases of which the closed solutions exist and it is shown that our results are valid.

Active dendrites: Adaptation to spike-based communication

Computational analyses of dendritic computations often assume stationary inputs to neurons, ignoring the pulsatile nature of spike-based communication between neurons and the moment-to-moment fluctuations caused by such spiking inputs. Conversely, circuit computations with spiking neurons are usually formalized without regard to the rich nonlinear nature of dendritic processing. Here we address the computational challenge faced by neurons that compute and represent analogue quantities but communicate with digital spikes, and show that reliable computation of even purely linear functions of inputs can require the interplay of strongly nonlinear subunits within the postsynaptic dendritic tree.Our theory predicts a matching of dendritic nonlinearities and synaptic weight distributions to the joint statistics of presynaptic inputs. This approach suggests normative roles for some puzzling forms of nonlinear dendritic dynamics and plasticity.

多波多分量地震资料走时近似方法的研究与应用

Compared with the conventional P wave, multi-component seismic data can markedly provide more information, thus improve the quality of reservoir evaluation like formation evaluation etc. With PS wave, better imaging result can be obtained especially in areas involved with gas chimney and high velocity formation. However, the signal-to-noise of multi-component seismic data is normally lower than that of the conventional P wave seismic data, while the frequency range of converted wave is always close to that of the surface wave which adds to the difficulty of removing surface wave. To realize common reflection point data stacking from extracted common conversion point data is a hard nut to crack. The s wave static correction of common receiver point PS wave data is not easy neither. In a word, the processing of multi-component seismic data is more complicated than P wave data. This paper shows some work that has been done, addressing those problems mentioned above. (1) Based on the AVO feature of converted wave, this paper has realized the velocity spectrum of converted waves by using Sarkar’s generalized semblance method taking into account of AVO factor in velocity analysis. (2)We achieve a method of smoothly offset division normal method.Firstly we scan the stacking velocities in different offset divisions for a t0, secondly obtain some hyperbolas using these stacking velocities, then get the travel time for every trace using these hyperbolas; in the end we interpolate the normal move out between two t0 for every trace. (3) Here realize a method of stepwise offset division normal moveout.It is similar to the method of smoothly offset division normal moveout.The main difference is using quadratic curve, sixth order curve or fraction curve to fit these hyperbolas. (4)In this paper, 4 types of travel time versus distance functions in inhomogeneous media whose velocity or slowness varies with depth and vertical travel time have been discussed and used to approximate reflection travel time. The errors of ray path and travel time based on those functions in four layered models were analyzed, and it has shown that effective results of NMO in synthetic or real data can be obtained. (5) The velocity model of converted PS-wave can be considered as that of P -wave based on the ghost source theory, thus the converted wave travel time can be approximated by calculation from 4 equivalent velocity functions: velocity or slowness vary linearly with depth or vertical travel time. Then combining with P wave velocity analysis, the converted wave data can be corrected directly to the P-wave vertical travel time. The improvements were shown in Normal Move out of converted waves with numerical examples and real data. (6) This paper introduces the methods to compute conversion point location in vertical inhomogeneous media based on linear functions of velocity or slowness versus depth or vertical travel time, and introduce three ways to choose appropriate equivalent velocity methods, which are velocity fitting, travel time approximation and semblance coefficient methods.

Jamming for a 2D granular material

This paper focuses on the nature of jamming, as seen in two-dimensional frictional granular systems consisting of photoelastic particles. The photoelastic technique is unique at this time, in its capability to provide detailed particle-scale information on forces and kinematic quantities such as particle displacements and rotations. These experiments first explore isotropic stress states near point J through measurements of the mean contact number per particle, Z, and the pressure, P as functions of the packing fraction, . In this case, the experiments show some but not all aspects of jamming, as expected on the basis of simulations and models that typically assume conservative, hence frictionless, forces between particles. Specifically, there is a rapid growth in Z, at a reasonable which we identify with as c. It is possible to fit Z and P, to power law expressions in - c above c, and to obtain exponents that are in agreement with simulations and models. However, the experiments differ from theory on several points, as typified by the rounding that is observed in Z and P near c. The application of shear to these same 2D granular systems leads to phenomena that are qualitatively different from the standard picture of jamming. In particular, there is a range of packing fractions below c, where the application of shear strain at constant leads to jammed stress-anisotropic states, i.e. they have a non-zero shear stress, τ. The application of shear strain to an initially isotropically compressed (hence jammed) state, does not lead to an unjammed state per se. Rather, shear strain at constant first leads to an increase of both τ and P. Additional strain leads to a succession of jammed states interspersed with relatively localized failures of the force network leading to other stress-anisotropic states that are jammed at typically somewhat lower stress. The locus of jammed states requires a state space that involves not only and τ, but also P. P, τ, and Z are all hysteretic functions of shear strain for fixed . However, we find that both P and τ are roughly linear functions of Z for strains large enough to jam the system. This implies that these shear-jammed states satisfy a Coulomb like-relation, τ = μP. © 2010 The Royal Society of Chemistry.

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

The paper considers the single machine due date assignment and scheduling problems with n jobs in which the due dates are to be obtained from the processing times by adding a positive slack q. A schedule is feasible if there are no tardy jobs and the job sequence respects given precedence constraints. The value of q is chosen so as to minimize a function ϕ(F,q) which is non-decreasing in each of its arguments, where F is a certain non-decreasing earliness penalty function. Once q is chosen or fixed, the corresponding scheduling problem is to find a feasible schedule with the minimum value of function F. In the case of arbitrary precedence constraints the problems under consideration are shown to be NP-hard in the strong sense even for F being total earliness. If the precedence constraints are defined by a series-parallel graph, both scheduling and due date assignment problems are proved solvable in time, provided that F is either the sum of linear functions or the sum of exponential functions. The running time of the algorithms can be reduced to if the jobs are independent. Scope and purpose We consider the single machine due date assignment and scheduling problems and design fast algorithms for their solution under a wide range of assumptions. The problems under consideration arise in production planning when the management is faced with a problem of setting the realistic due dates for a number of orders. The due dates of the orders are determined by increasing the time needed for their fulfillment by a common positive slack. If the slack is set to be large enough, the due dates can be easily maintained, thereby producing a good image of the firm. This, however, may result in the substantial holding cost of the finished products before they are brought to the customer. The objective is to explore the trade-off between the size of the slack and the arising holding costs for the early orders.

A aprendizagem da função afim no 8º ano : uma proposta apoiada nas tecnologias e na educação financeira

Trabalho de projeto de mestrado, Educação (Área de especialidade em Didática da Matemática), Universidade de Lisboa, Instituto de Educação, 2015

Design of New Materials for Passive Vibration Control

The aim of this contribution is to extend the techniques of composite materials design to non-linear material behaviour and apply it for design of new materials for passive vibration control. As a first step a computational tool allowing determination of macroscopic optimized one-dimensional isolator behaviour was developed. Voigt, Maxwell, standard and more complex material models can be implemented. Objective function considers minimization of the initial reaction and/or displacement peak as well as minimization of the steady-state amplitude of reaction and/or displacement. The complex stiffness approach is used to formulate the governing equations in an efficient way. Material stiffness parameters are assumed as non-linear functions of the displacement. The numerical solution is performed in the complex space. The steady-state solution in the complex space is obtained by an iterative process based on the shooting method which imposes the conditions of periodicity with respect to the known value of the period. Extension of the shooting method to the complex space is presented and verified. Non-linear behaviour of material parameters is then optimized by generic probabilistic meta-algorithm, simulated annealing. Dependence of the global optimum on several combinations of leading parameters of the simulated annealing procedure, like neighbourhood definition and annealing schedule, is also studied and analyzed. Procedure is programmed in MATLAB environment.

Bootstrapping prediction intervals for autoregressive models

Methods of improving the coverage of Box–Jenkins prediction intervals for linear autoregressive models are explored. These methods use bootstrap techniques to allow for parameter estimation uncertainty and to reduce the small-sample bias in the estimator of the models’ parameters. In addition, we also consider a method of bias-correcting the non-linear functions of the parameter estimates that are used to generate conditional multi-step predictions.

Semiclassical evolution of dissipative Markovian systems

A semiclassical approximation for an evolving density operator, driven by a `closed` Hamiltonian operator and `open` Markovian Lindblad operators, is obtained. The theory is based on the chord function, i.e. the Fourier transform of the Wigner function. It reduces to an exact solution of the Lindblad master equation if the Hamiltonian operator is a quadratic function and the Lindblad operators are linear functions of positions and momenta. Initially, the semiclassical formulae for the case of Hermitian Lindblad operators are reinterpreted in terms of a (real) double phase space, generated by an appropriate classical double Hamiltonian. An extra `open` term is added to the double Hamiltonian by the non-Hermitian part of the Lindblad operators in the general case of dissipative Markovian evolution. The particular case of generic Hamiltonian operators, but linear dissipative Lindblad operators, is studied in more detail. A Liouville-type equivariance still holds for the corresponding classical evolution in double phase space, but the centre subspace, which supports the Wigner function, is compressed, along with expansion of its conjugate subspace, which supports the chord function. Decoherence narrows the relevant region of double phase space to the neighbourhood of a caustic for both the Wigner function and the chord function. This difficulty is avoided by a propagator in a mixed representation, so that a further `small-chord` approximation leads to a simple generalization of the quadratic theory for evolving Wigner functions.

A new family of generalized distributions

Kumaraswamy [Generalized probability density-function for double-bounded random-processes, J. Hydrol. 462 (1980), pp. 79-88] introduced a distribution for double-bounded random processes with hydrological applications. For the first time, based on this distribution, we describe a new family of generalized distributions (denoted with the prefix `Kw`) to extend the normal, Weibull, gamma, Gumbel, inverse Gaussian distributions, among several well-known distributions. Some special distributions in the new family such as the Kw-normal, Kw-Weibull, Kw-gamma, Kw-Gumbel and Kw-inverse Gaussian distribution are discussed. We express the ordinary moments of any Kw generalized distribution as linear functions of probability weighted moments (PWMs) of the parent distribution. We also obtain the ordinary moments of order statistics as functions of PWMs of the baseline distribution. We use the method of maximum likelihood to fit the distributions in the new class and illustrate the potentiality of the new model with an application to real data.

A model for compressing probabilities in belief networks

Probabilistic reasoning with belief (Bayesian) networks is based on conditional probability matrices. Thus it suffers from NP-hard implementations. In particular, the amount of probabilistic information necessary for the computations is often overwhelming. So, compressing the conditional probability table is one of the most important issues faced by the probabilistic reasoning community. Santos suggested an approach (called linear potential functions) for compressing the information from a combinatorial amount to roughly linear in the number of random variable assignments. However, much of the information in Bayesian networks, in which there are no linear potential functions, would be fitted by polynomial approximating functions rather than by reluctantly linear functions. For this reason, we construct a polynomial method to compress the conditional probability table in this paper. We evaluated the proposed technique, and our experimental results demonstrate that the approach is efficient and promising.

Monotone approximation of aggregation operators using least squares splines

The need for monotone approximation of scattered data often arises in many problems of regression, when the monotonicity is semantically important. One such domain is fuzzy set theory, where membership functions and aggregation operators are order preserving. Least squares polynomial splines provide great flexbility when modeling non-linear functions, but may fail to be monotone. Linear restrictions on spline coefficients provide necessary and sufficient conditions for spline monotonicity. The basis for splines is selected in such a way that these restrictions take an especially simple form. The resulting non-negative least squares problem can be solved by a variety of standard proven techniques. Additional interpolation requirements can also be imposed in the same framework. The method is applied to fuzzy systems, where membership functions and aggregation operators are constructed from empirical data.

Knowledge extraction from a mixed transfer function artificial neural network

One of the main problems with Artificial Neural Networks (ANNs) is that their results are not intuitively clear. For example, commonly used hidden neurons with sigmoid activation function can approximate any continuous function, including linear functions, but the coefficients (weights) of this approximation are rather meaningless. To address this problem, current paper presents a novel kind of a neural network that uses transfer functions of various complexities in contrast to mono-transfer functions used in sigmoid and hyperbolic tangent networks. The presence of transfer functions of various complexities in a Mixed Transfer Functions Artificial Neural Network (MTFANN) allow easy conversion of the full model into user-friendly equation format (similar to that of linear regression) without any pruning or simplification of the model. At the same time, MTFANN maintains similar generalization ability to mono-transfer function networks in a global optimization context. The performance and knowledge extraction of MTFANN were evaluated on a realistic simulation of the Puma 560 robot arm and compared to sigmoid, hyperbolic tangent, linear and sinusoidal networks.