Adjusted Ratio and Regression Type Estimators for Estimation of Population Mean when some Observations are missing

Ratio and regression type estimators have been used by previous authors to estimate a population mean for the principal variable from samples in which both auxiliary x and principal y variable data are available. However, missing data are a common problem in statistical analyses with real data. Ratio and regression type estimators have also been used for imputing values of missing y data. In this paper, six new ratio and regression type estimators are proposed for imputing values for any missing y data and estimating a population mean for y from samples with missing x and/or y data. A simulation study has been conducted to compare the six ratio and regression type estimators with a previous estimator of Rueda. Two population sizes N = 1,000 and 5,000 have been considered with sample sizes of 10% and 30% and with correlation coefficients between population variables X and Y of 0.5 and 0.8. In the simulations, 10 and 40 percent of sample y values and 10 and 40 percent of sample x values were randomly designated as missing. The new ratio and regression type estimators give similar mean absolute percentage errors that are smaller than the Rueda estimator for all cases. The new estimators give a large reduction in errors for the case of 40% missing y values and sampling fraction of 30%.

The Mutated Distance between Two Mixture Trees

The evolutionary tree is an important topic in bioinformation. In 2006, Chen and Lindsay proposed a new method to build the mixture tree from DNA sequences. Mixture tree is a new type evolutionary tree, and it has two additional information besides the information of ordinary evolutionary tree. One of the information is time parameter, and the other is the set of mutated sites. In 2008, Lin and Juan proposed an algorithm to compute the distance between two mixture trees. Their algorithm computes the distance with only considering the time parameter between two mixture trees. In this paper, we proposes a method to measure the similarity of two mixture trees with considering the set of mutated sites and develops two algorithm to compute the distance between two mixture trees. The time complexity of these two proposed algorithms are O(n2 × max{h(T1), h(T2)}) and O(n2), respectively

Algorithms for the Fast Computation of PWL and PHL Transforms

In this paper, the construction of fast algorithms for the computation of Periodic Walsh Piecewise-Linear PWL transform and the Periodic Haar Piecewise-Linear PHL transform will be presented. Algorithms for the computation of the inverse transforms are also proposed. The matrix equation of the PWL and PHL transforms are introduced. Comparison of the computational requirements for the periodic piecewise-linear transforms and other orthogonal transforms shows that the periodic piecewise-linear transforms require less number of operations than some orthogonal transforms such as the Fourier, Walsh and the Discrete Cosine transforms.

An Analysis of Acoustic Function and Navier-Stokes Equations in Aerodynamic

Acoustic function plays an important role in aerodynamic mechanical engineering. It can classify the kind of air-vehicle such as subsonic or supersonic. Acoustic velocity relates with velocity and Mach number. Mach number relates again acoustic stability or instability condition. Mach number plays an important role in growth or decay in energy system. Acoustic is a function of temperature and temperature is directly proportional to pressure. If we control the pressure, we can control acoustic function. To get pressure stability condition, we apply Navier-Stokes equations.

Equatorial Symmetry of Chaotic Solutions in Boussinesq Convection in a Rotating Spherical Shell

We investigate properties of convective solutions of the Boussinesq thermal convection in a moderately rotating spherical shell allowing the inner and outer sphere rotation due to the viscous torque of the fluid. The ratio of the inner and outer radii of the spheres, the Prandtl number and the Taylor number are fixed to 0.4, 1 and 5002, respectively. The inertial moments of the inner and outer spheres are fixed to about 0.22 and 100, respectively. The Rayleigh number is varied from 2.6 × 104 to 3.4 × 104. In this parameter range, convective solutions transit from equatorially symmetric quasiperiodic ones to equatorially asymmetric chaotic ones as the Rayleigh number is increased. The transition route in the system allowing rotation of both the spheres is different from that in the co-rotating system, which means the inner and outer spheres rotate with the same constant angular velocity: the convective solutions transit as equatorially symmetric quasi-periodic solution → equatorially symmetric chaotic solution → equatorially asymmetric chaotic solution in the system allowing both the spheres rotation, while equatorially symmetric quasi-periodic solution → equatorially asymmetric quasiperiodic solution → equatorially asymmetric chaotic solution in the co-rotating system.

Study on the Optimization of Completely Batch Water-using Network with Multiple Contaminants Considering Flow Change

This work addresses the problem of optimizing completely batch water-using network with multiple contaminants where the flow change caused by mass transfer is taken into consideration for the first time. A mathematical technique for optimizing water-using network is proposed based on source-tank-sink superstructure. The task is to obtain the freshwater usage, recycle assignments among water-using units, wastewater discharge and a steady water-using network configuration by following steps. Firstly, operating sequences of water-using units are determined by time constraints. Next, superstructure is simplified by eliminating the reuse and recycle from water-using units with maximum concentration of key contaminants. Then, the non-linear programming model is solved by GAMS (General Algebra Model System) for minimum freshwater usage, maximum water recycle and minimum wastewater discharge. Finally, numbers of operating periods are calculated to acquire the steady network configuration. A case study is solved to illustrate the applicability of the proposed approach.

Thermal Analysis of Toroidal Transformers Using Finite Element Method

In this paper a three dimensional thermal model of a power toroidal transformer is proposed for both steady-state or transient conditions. The influence of electric current and ambient temperature on the temperature distribution, has been investigated. To validate the three dimensional thermal model, some experimental tests have been done. There is a good correlation between experimental and simulation results.

Existence and Stability of Anti-periodic Solutions for an Impulsive Cohen-Grossberg SICNNs on Time Scales

By using the method of coincidence degree and constructing suitable Lyapunov functional, some sufficient conditions are established for the existence and global exponential stability of antiperiodic solutions for a kind of impulsive Cohen-Grossberg shunting inhibitory cellular neural networks (CGSICNNs) on time scales. An example is given to illustrate our results.

Stability of Alliances between Service Providers

Three service providers in competition, try to optimize their quality of service / content level and their service access price. But, they have to deal with uncertainty on the consumers- preferences. To reduce their uncertainty, they have the opportunity to buy information and to build alliances. We determine the Shapley value which is a fair way to allocate the grand coalition-s revenue between the service providers. Then, we identify the values of β (consumers- sensitivity coefficient to the quality of service / contents) for which allocating the grand coalition-s revenue using the Shapley value guarantees the system stability. For other values of β, we prove that it is possible for the regulator to impose a per-period interest rate maximizing the market coverage under equal allocation rules.

A Novel Multiresolution based Optimization Scheme for Robust Affine Parameter Estimation

This paper describes a new method for affine parameter estimation between image sequences. Usually, the parameter estimation techniques can be done by least squares in a quadratic way. However, this technique can be sensitive to the presence of outliers. Therefore, parameter estimation techniques for various image processing applications are robust enough to withstand the influence of outliers. Progressively, some robust estimation functions demanding non-quadratic and perhaps non-convex potentials adopted from statistics literature have been used for solving these. Addressing the optimization of the error function in a factual framework for finding a global optimal solution, the minimization can begin with the convex estimator at the coarser level and gradually introduce nonconvexity i.e., from soft to hard redescending non-convex estimators when the iteration reaches finer level of multiresolution pyramid. Comparison has been made to find the performance of the results of proposed method with the results found individually using two different estimators.

Study of Water on the Surface of Nano-Silica Material: An NMR Study

Water 2H NMR signal on the surface of nano-silica material, MCM-41, consists of two overlapping resonances. The 2H water spectrum shows a superposition of a Lorentzian line shape and the familiar NMR powder pattern line shape, indicating the existence of two spin components. Chemical exchange occurs between these two groups. Decomposition of the two signals is a crucial starting point for study the exchange process. In this article we have determined these spin component populations along with other important parameters for the 2H water NMR signal over a temperature range between 223 K and 343 K.

The Comparisons of Average Outgoing Quality Limit between the MCSP-2-C and MCSP-C

This paper presents a comparison of average outgoing quality limit of the MCSP-2-C plan with MCSP-C when MCSP-2-C has been developed from MCSP-C. The parameters used in MCSP-2- C are: i (the clearance number), c (the acceptance number), m (the number of conforming units to be found before allowing c nonconforming units in the sampling inspection), f1 and f2 (the sampling frequency at level 1 and 2, respectively). The average outgoing quality limit (AOQL) values from two plans were compared and we found that for all sets of i, r, and c values, MCSP-2-C gives higher values than MCSP-C. For all sets of i, r, and c values, the average outgoing quality values of MCSP-C and MCSP-2-C are similar when p is low or high but is difference when p is moderate.

Correlation-based Feature Selection using Ant Colony Optimization

Feature selection has recently been the subject of intensive research in data mining, specially for datasets with a large number of attributes. Recent work has shown that feature selection can have a positive effect on the performance of machine learning algorithms. The success of many learning algorithms in their attempts to construct models of data, hinges on the reliable identification of a small set of highly predictive attributes. The inclusion of irrelevant, redundant and noisy attributes in the model building process phase can result in poor predictive performance and increased computation. In this paper, a novel feature search procedure that utilizes the Ant Colony Optimization (ACO) is presented. The ACO is a metaheuristic inspired by the behavior of real ants in their search for the shortest paths to food sources. It looks for optimal solutions by considering both local heuristics and previous knowledge. When applied to two different classification problems, the proposed algorithm achieved very promising results.

Improvement of Gregory's formula using Particle Swarm Optimization

Consider the Gregory integration (G) formula with end corrections where h Δ is the forward difference operator with step size h. In this study we prove that can be optimized by minimizing some of the coefficient k a in the remainder term by particle swarm optimization. Experimental tests prove that can be rendered a powerful formula for library use.

Automatic Map Simplification for Visualization on Mobile Devices

The visualization of geographic information on mobile devices has become popular as the widespread use of mobile Internet. The mobility of these devices brings about much convenience to people-s life. By the add-on location-based services of the devices, people can have an access to timely information relevant to their tasks. However, visual analysis of geographic data on mobile devices presents several challenges due to the small display and restricted computing resources. These limitations on the screen size and resources may impair the usability aspects of the visualization applications. In this paper, a variable-scale visualization method is proposed to handle the challenge of small mobile display. By merging multiple scales of information into a single image, the viewer is able to focus on the interesting region, while having a good grasp of the surrounding context. This is essentially visualizing the map through a fisheye lens. However, the fisheye lens induces undesirable geometric distortion in the peripheral, which renders the information meaningless. The proposed solution is to apply map generalization that removes excessive information around the peripheral and an automatic smoothing process to correct the distortion while keeping the local topology consistent. The proposed method is applied on both artificial and real geographical data for evaluation.

Numerical Study of Iterative Methods for the Solution of the Dirichlet-Neumann Map for Linear Elliptic PDEs on Regular Polygon Domains

A generalized Dirichlet to Neumann map is one of the main aspects characterizing a recently introduced method for analyzing linear elliptic PDEs, through which it became possible to couple known and unknown components of the solution on the boundary of the domain without solving on its interior. For its numerical solution, a well conditioned quadratically convergent sine-Collocation method was developed, which yielded a linear system of equations with the diagonal blocks of its associated coefficient matrix being point diagonal. This structural property, among others, initiated interest for the employment of iterative methods for its solution. In this work we present a conclusive numerical study for the behavior of classical (Jacobi and Gauss-Seidel) and Krylov subspace (GMRES and Bi-CGSTAB) iterative methods when they are applied for the solution of the Dirichlet to Neumann map associated with the Laplace-s equation on regular polygons with the same boundary conditions on all edges.

Fast Calculation for Particle Interactions in SPH Simulations: Outlined Sub-domain Technique

A simple and easy algorithm is presented for a fast calculation of kernel functions which required in fluid simulations using the Smoothed Particle Hydrodynamic (SPH) method. Present proposed algorithm improves the Linked-list algorithm and adopts the Pair-Wise Interaction technique, which are widely used for evaluating kernel functions in fluid simulations using the SPH method. The algorithm is easy to be implemented without any complexities in programming. Some benchmark examples are used to show the simulation time saved by using the proposed algorithm. Parametric studies on the number of divisions for sub-domains, smoothing length and total amount of particles are conducted to show the effectiveness of the present technique. A compact formulation is proposed for practical usage.

Rear Separation in a Rotating Fluid at Moderate Taylor Numbers

The motion of a sphere moving along the axis of a rotating viscous fluid is studied at high Reynolds numbers and moderate values of Taylor number. The Higher Order Compact Scheme is used to solve the governing Navier-Stokes equations. The equations are written in the form of Stream function, Vorticity function and angular velocity which are highly non-linear, coupled and elliptic partial differential equations. The flow is governed by two parameters Reynolds number (Re) and Taylor number (T). For very low values of Re and T, the results agree with the available experimental and theoretical results in the literature. The results are obtained at higher values of Re and moderate values of T and compared with the experimental results. The results are fourth order accurate.

Algebraic Specification of Serializability for Partitioned Transactions

The usual correctness condition for a schedule of concurrent database transactions is some form of serializability of the transactions. For general forms, the problem of deciding whether a schedule is serializable is NP-complete. In those cases other approaches to proving correctness, using proof rules that allow the steps of the proof of serializability to be guided manually, are desirable. Such an approach is possible in the case of conflict serializability which is proved algebraically by deriving serial schedules using commutativity of non-conflicting operations. However, conflict serializability can be an unnecessarily strong form of serializability restricting concurrency and thereby reducing performance. In practice, weaker, more general, forms of serializability for extended models of transactions are used. Currently, there are no known methods using proof rules for proving those general forms of serializability. In this paper, we define serializability for an extended model of partitioned transactions, which we show to be as expressive as serializability for general partitioned transactions. An algebraic method for proving general serializability is obtained by giving an initial-algebra specification of serializable schedules of concurrent transactions in the model. This demonstrates that it is possible to conduct algebraic proofs of correctness of concurrent transactions in general cases.