A note on the evaluation of dielectric dispersion parameters of non-debije type liquids

A simple method for evaluating dielectric relaxation parameters ie given whioh can be used for analyeing the arelaxation times of a liquid into two absorptions.

Optimal popular matchings

In this paper we consider the problem of computing an “optimal” popular matching. We assume that our input instance View the MathML source admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness in which case we are required to return a fair popular matching. We show an O(n2+m) algorithm for this problem, assuming that the preference lists are strict, where m is the number of edges in G and n is the number of applicants.

Optimal maintenance and replacement via a semi-Markov decision model

Optimal bang-coast maintenance policies for a machine, subject to failure, are considered. The approach utilizes a semi-Markov model for the system. A simplified model for modifying the probability of machine failure with maintenance is employed. A numerical example is presented to illustrate the procedure and results.

A Comparative Study of Electrochemical Kinetic Parameters by the Potential Step Method. Electrode Reactions of CyDTA and EDTA Complexes of Cu(II) at DME

By using the same current-time (I-t) curves, electrochemical kinetic parameters are determined by two methods, (a) using the ratio of current at a given potential to the diffusion-controlled limiting current and (b) curve fitting method, for the reduction of Cu(II)–CyDTA complex. The analysis by the method (a) shows that the rate determining step involves only one electron although the overall reduction of the complex involves two electrons suggesting thereby the stepwise reduction of the complex. The nature of I-t curves suggests the adsorption of intermediate species at the electrode surface. Under these circumstances more reliable kinetic parameters can be obtained by the method (a) compared to that of (b). Similar observations are found in the case of reduction of Cu(II)–EDTA complex.

Constrained linear filter and its relation to singular optimal control

This paper presents an analysis of an optimal linear filter in the presence of constraints on the moan squared values of the estimates from the viewpoint of singular optimal control. The singular arc has been shown to satisfy the generalized Legcndrc-Clebseh condition and Jacobson's condition. Both the cases of white measurement noise and coloured measurement noise are considered. The constrained estimate is shown to be a linear transformation of the unconstrained Kalman estimate.

Study of third-order non-linear systems- Variation of parameters approach

In this paper, the transient response of a third-order non-linear system is obtained by first reducing the given third-order equation to three first-order equations by applying the method of variation of parameters. On the assumption that the variations of amplitude and phase are small, the functions are expanded in ultraspherical polynomials. The expansion is restricted to the constant term. The resulting equations are solved to obtain the response of the given third-order system. A numerical example is considered to illustrate the method. The results show that the agreement between the approximate and digital solution is good thus vindicating the approximation.

Optimal maintenance policy for equipment subject to random deterioration and random failure A modern control theory approach.

The stochastic version of Pontryagin's maximum principle is applied to determine an optimal maintenance policy of equipment subject to random deterioration. The deterioration of the equipment with age is modelled as a random process. Next the model is generalized to include random catastrophic failure of the equipment. The optimal maintenance policy is derived for two special probability distributions of time to failure of the equipment, namely, exponential and Weibull distributions Both the salvage value and deterioration rate of the equipment are treated as state variables and the maintenance as a control variable. The result is illustrated by an example

An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms

In this paper, we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we describe two well-known mechanisms for sponsored search auction-Generalized Second Price (GSP) and Vickrey-Clarke-Groves (VCG). We then derive a new mechanism for sponsored search auction which we call optimal (OPT) mechanism. The OPT mechanism maximizes the search engine's expected revenue, while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We then undertake a detailed comparative study of the mechanisms GSP, VCG, and OPT. We compute and compare the expected revenue earned by the search engine under the three mechanisms when the advertisers are symmetric and some special conditions are satisfied. We also compare the three mechanisms in terms of incentive compatibility, individual rationality, and computational complexity. Note to Practitioners-The advertiser-supported web site is one of the successful business models in the emerging web landscape. When an Internet user enters a keyword (i.e., a search phrase) into a search engine, the user gets back a page with results, containing the links most relevant to the query and also sponsored links, (also called paid advertisement links). When a sponsored link is clicked, the user is directed to the corresponding advertiser's web page. The advertiser pays the search engine in some appropriate manner for sending the user to its web page. Against every search performed by any user on any keyword, the search engine faces the problem of matching a set of advertisers to the sponsored slots. In addition, the search engine also needs to decide on a price to be charged to each advertiser. Due to increasing demands for Internet advertising space, most search engines currently use auction mechanisms for this purpose. These are called sponsored search auctions. A significant percentage of the revenue of Internet giants such as Google, Yahoo!, MSN, etc., comes from sponsored search auctions. In this paper, we study two auction mechanisms, GSP and VCG, which are quite popular in the sponsored auction context, and pursue the objective of designing a mechanism that is superior to these two mechanisms. In particular, we propose a new mechanism which we call the OPT mechanism. This mechanism maximizes the search engine's expected revenue subject to achieving Bayesian incentive compatibility and individual rationality. Bayesian incentive compatibility guarantees that it is optimal for each advertiser to bid his/her true value provided that all other agents also bid their respective true values. Individual rationality ensures that the agents participate voluntarily in the auction since they are assured of gaining a non-negative payoff by doing so.

A Modified Dubins Method for Optimal Path Planning of a Miniature Air Vehicle Converging to a Straight Line Path

This paper presents a Dubins model based strategy to determine the optimal path of a Miniature Air Vehicle (MAV), constrained by a bounded turning rate, that would enable it to fly along a given straight line, starting from an arbitrary initial position and orientation. The method is then extended to meet the same objective in the presence of wind which has a magnitude comparable to the speed of the MAV. We use a modification of the Dubins' path method to obtain the complete optimal solution to this problem in all its generality.

Determination of optimal trajectory under design constraints for a satellite launch vehicle

An optimal pitch steering programme of a solid-fuel satellite launch vehicle to maximize either (1) the injection velocity at a given altitude, or (2) the size of circular orbit, for a given payload is presented. The two-dimensional model includes the rotation of atmosphere with the Earth, the vehicle's lift and drag, variation of thrust with time and altitude, inverse-square gravitational field, and the specified initial vertical take-off. The inequality constraints on the aerodynamic load, control force, and turning rates are also imposed. Using the properties of the central force motion the terminal constraint conditions at coast apogee are transferred to the penultimate stage burnout. Such a transformation converts a time-free problem into a time-fixed one, reduces the number of terminal constraints, improves accuracy, besides demanding less computer memory and time. The adjoint equations are developed in a compact matrix form. The problem is solved on an IBM 360/44 computer using a steepest ascent algorithm. An illustrative analysis of a typical launch vehicle establishes the speed of convergence, and accuracy and applicability of the algorithm.

Optimal iterative schemes for computing the Moore-Penrose matrix inverse

Among the iterative schemes for computing the Moore — Penrose inverse of a woll-conditioned matrix, only those which have an order of convergence three or two are computationally efficient. A Fortran programme for these schemes is provided.

Influence of adhesive non-linearities on the performance and optimal length of adhesive bonded joints

An analytical study for the static strength of adhesive lap joints is presented. The earlier solutions of Volkersen [i], DeBruyne[2] and others were limited to linear adhesives. The influence of adhesive non-linearity was first considered by Grimes' et al[3] and Dickson et al [4]. Recently Hart-Smith[5] successfully introduced elastic-plastic behaviour of the adhesive. In the present study the problem is formulated for general non-linear adhesive behaviour and an efficient numerical algorithm is written for the solution. Bilinear and trilinear models for the nonlinearity yield closed form analytical solutions.

An approximate mathematical procedure for the determination of characteristic parameters for a general case in three dimensional photoelasticity

In cases whazo zotatLon of the seoondazy pztncipal 8tzo,ae axes along tha light path ,exists, it is always poaeible to detezmlna two dizactions along which plane-polazlaad light ,antazlng the model ,amerCe8 as plene-pela~l,aed light fzom the model. Puzth,az the nat zstazdatton Pot any light path is dlff,azant Prom the lntsgtatad zetazd,ation Pat the l£ght path nogZsctlng the ePfsct or z,atation.

Launch Envelope Optimization of Virtual Sliding Target Guidance Scheme

This paper presents an optimization of the performance of a recently proposed virtual sliding target (VST) guidance scheme in terms of maximization of its launch envelope for three- dimensional (3-D) engagements. The objective is to obtain the launch envelope of the missile using the VST guidance scheme for different lateral launch angles with respect to the line of sight (LOS) and demonstrate its superiority over kinematics-based guidance laws like proportional navigation (PN). The VST scheme uses PN as its basic guidance scheme and exploits the relation between the atmospheric properties, missile aerodynamic characteristics, and the optimal trajectory of the missile. The missile trajectory is shaped by controlling the instantaneous position and the speed of a virtual target which the missile pursues during the midcourse phase. In the proposed method it is shown that an appropriate value of initial position for the virtual target in 3-D, combined with optimized virtual target parameters, can significantly improve the launch envelope performance. The paper presents the formulation of the optimization problem, obtains the approximate models used to make the optimization problem more tractable, and finally presents the optimized performance of the missile in terms of launch envelope and shows significant improvement over kinematic-based guidance laws. The paper also proposes modification to the basic VST scheme. Some simulations using the full-fledged six degrees-of-freedom (6-DOF) models are also presented to validate the models and technique used.