Approximate fixed point sequence for a finite family of asymptotically pseudocontractive mappings

Let E be a real Banach space and K be a nonempty, closed, convex, and bounded subset of E. Let T_i:K→K, i=1,2,…,N, be N uniformly L-Lipschitzian, uniformly asymptotically regular with sequences {ε_n}, and asymptotically pseudocontractive mappings with sequences , where {ε_n} and , i=1,2,…,N, satisfy certain mild conditions. Let a sequence {x_n} be generated from x₁K by

for all integers n1, where T_n=T_n(modN), {u_n} be a sequence in K, and {λ_n}, {θ_n} and {μ_n} are three real sequences in [0,1] satisfying appropriate conditions; then x_n−T_lx_n→0 as n→∞ for each l{1,2,…,N}.     

The query complexity of order-finding

We consider the problem where π is an unknown permutation on {0,1,…,2ⁿ−1}, y₀{0,1,…,2ⁿ−1}, and the goal is to determine the minimum r>0 such that π^r(y₀)=1. Information about π is available only via queries that yield π^x(y) from any x{0,1,…,2^m−1} and y{0,1,…,2ⁿ−1} (where m is polynomial in n). The main resource under consideration is the number of these queries. We show that the number of queries necessary to solve the problem in the classical probabilistic bounded-error model is exponential in n. This contrasts sharply with the quantum bounded-error model, where a constant number of queries suffices.     

Turbulent boundary layer structure of flow over a smooth-curved ramp

The effects of a convex-curved wall followed by a recovery over a flat surface on a turbulent boundary layer structure are addressed via large-eddy simulation (LES). The curved wall constitutes a smooth ramp formed by a portion of circular arc. The statistically two-dimensional upstream boundary layer flow is realistically fed by an injected inflow boundary condition. The inflow is extracted from a simultaneously simulated flat-plate boundary layer which is computed based on a compressible rescaling method. After flowing over the curved surface the flow is allowed to recover its realistic condition by passing over a downstream flat surface. The Reynolds number introduced at the inlet section of the computational domain which starts 4 times the ramp length (L_r) upstream of the curved surface is Re_δo=U_∞δ_o/ν=9907. The Reynolds number is based on the inflow boundary layer thickness δ_o, the free-stream velocity U_∞ and the kinematic viscosity ν.Mean flow predictions obtained using the present LES with the rescaling–recycling inflow condition agree well with the available experimental data from literature. The Reynolds stress components match the experimental one. However, small deviation occurs due to the smaller-domain height used in the present simulation. The experiments showed that there is a generated pressure gradient on the upper wall and this in return affects the turbulence energy on the other wall. The numerical data as well as the experiments show an enhancement of the turbulent stresses in the adverse pressure gradient region. The increased level of turbulent stresses is accompanied with large peaks aligned with the inflection point of the velocity profiles. The high stress levels are nearly unchanged by reattachment process, decaying only after the mean velocity recovered and the high production of turbulence near the outer layer drops. The recovery of the outer layer is due to the turbulent eddies generated by the separation region. Numerical visualizations show strong elongation and lifting of eddies in the region of the adverse pressure gradient generated by the curved wall. Computations of two-point correlations are also performed to represent the formation and deformation of the turbulent eddies before, over and after the curved wall. Different effects on the eddy size and its structure angle are presented.     

Detecting Algebraic Curves in Bad Position

Two affine algebraic curves over the complex numbers are in bad position if they have at least two distinct common points on some vertical line, i.e. for some α  C there are distinctβ₁ , β₂  C such that (α,β₁ ) and (α, β₂) are common points of the curves. We describe a method for detecting this situation and use it to develop an algorithm for finding the common points of two algebraic curves along with their multiplicities. We also give a worst case runtime analysis for the two algorithms and include a brief comparison of the second one with an approach using Gröbner bases.     

Fully Scalable Fault-Tolerant Simulations for BSP and CGM

In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The BSP (or CGM) machine is a parallel multicomputer consisting of p processors for which a memory of n words is evenly distributed and each processor can send and receive at most h messages in a superstep. The faults are deterministic (i.e., worst-case distributions of faults are considered) and static (i.e., they do not change in the course of computation). We assume that a constant fraction of processors are faulty.  We present two fault-tolerant simulation techniques for BSP and CGM:  1. A deterministic simulation that achieves O(1) slowdown for local computations and O((log_h p)²) slowdown for communications per superstep, provided that a preprocessing is done that requires O((log_h p)²) supersteps and linear (in h) computation per processor in each superstep.  2. A randomized simulation that achieves O(1) slowdown for local computations and O(log_h p) slowdown for communications per superstep with high probability, after the same (deterministic) preprocessing as above.  Our results are fully scalable over all values of p from Θ(1) to Θ(n). Furthermore, our results imply that if pn for 0<<1 and h=Θ((n/p)^δ) for 0<δ1 (which hold in almost all practical BSP and CGM computations), algorithms can be made resilient to a constant fraction of processor faults without any asymptotic slowdown.     

A unified presentation of some classes of meromorphically multivalent functions

The authors introduce and investigate various properties of a general class

U_k[p,a,β,A,B]

p, k ε N {1, 2, 3,…,}; 0 α < p; β 0

;

−1 A < B 1; 0 < B 1)

,which unifies and extends several (known or new) subclasses of meromorphically multivalent functions. The properties and characteristics of this general class, which are presented here, include growth and distortion theorems; they also involve Hadamard products (or convolution) of functions belonging to the class U_k[p,α,β,A,B].     

Elements of small norm in Shanks’ cubic extensions of imaginary quadratic fields

Let be an imaginary quadratic number field with ring of integers Z_k and let k(α) be the cubic extension of k generated by the polynomial f_t(x)=x³−(t−1)x²−(t+2)x−1 with tZ_k. In the present paper we characterize all elements γZ_k[α] with norms satisfying |N_k(α)/k|≤|2t+1| for |t|≥14. This generalizes a corresponding result by Lemmermeyer and Pethő for Shanks’ cubic fields over the rationals.     

Evaluation of Canopy Biophysical Variable Retrieval Performances from the Accumulation of Large Swath Satellite Data

The objective of this study was to compare the retrieval performances of several biophysical variables from the accumulation of large swath satellite data, the VEGETATION/SPOT4 sensor being taken as an example. This included leaf area index (LAI), fraction of photosynthetically active radiation (fAPAR) and chlorophyll content integrated over the canopy (C_ab·LAI), gap fraction in any direction [P₀(θ)], or in particular directions (nadir [P₀(0)], sun direction [P₀(θ_s)], or 58° [P₀(58°)] for which the gap fraction is theoretically independent of the LAI). A database of top of canopy BRDF (bidirectional reflectance distribution function) of homogeneous canopies was built using simulations by the SAIL, PROSPECT, and SOILSPECT radiative transfer models for a large range of input variables (LAI, mean leaf inclination angle, hot spot parameter, leaves and soil optical properties, date and latitude of observations) considering the accumulation of observations during an orbit cycle of 26 days. Walthall's BRDF model was used to estimate nadir (ρ₀) and hemispherical reflectance (ρ_h). Results showed that ρ₀ and ρ_h were estimated with a good accuracy (RMSE=0.02) even when few observations within a sequence were available due to cloud masking. The ρ₀ and ρ_h estimates in the blue (445 nm), the red (645 nm), near-infrared (835 nm), and middle infrared (1665 nm) were then used as inputs to neural networks calibrated for estimation of the canopy biophysical variables using part of the data base. Performances evaluated over the rest of the database showed that variables such as nadir gap fraction (P₀(58°)P₀(θ_s)fAPAR) were accurately estimated by neural networks (relative RMSE<0.05). Results of the estimation of LAI (LAI·Cab) was less satisfactory since the level of reflectance saturates for high values of LAI (relative RMSE<0.08). The estimation of the directional variation of the gap fraction was not accurate because the amount of directional information contained in the input variables of the neural network was not sufficient. We also investigated the problem of mixed pixels due to the low spatial resolution associated with large swath sensors. Results showed that variables such as nadir gap fraction were not as sensitive to high levels of heterogeneity in pixels as variables such as leaf area index.     

A generalization of ACP using Belnap’s logic

ACP is combined with Belnap’s four-valued logic via conditional composition (if–then–else). We show that the operators of ACP can be seen as instances of more general, conditional operators. For example, both the choice operator + and δ (deadlock) can be seen as instances of conditional composition, and the axiom x + δ = x follows from this perspective. Parallel composition is generalized to the binary conditional merge _ψ where covers the choice between interleaving and synchronization, and ψ determines the order of execution. The instance _BB is ACP’s parallel composition, where B (both) is the truth value that models both true and false in Belnap’s logic. Other instances of this conditional merge are sequential composition, pure interleaving and synchronous merge. We investigate the expression of scheduling strategies in the conditions of the conditional merge.     

A new test against an umbrella alternative and the associated simultaneous confidence intervals

For the usual balanced one-way fixed effects analysis of variance (ANOVA) model, a new test of the null hypothesis H₀: μ₁==μ_k against the umbrella alternative H_h:μ₁≤≤μ_h≥≥μ_k with at least one strict inequality is proposed. More usefully, this new test can be easily inverted to produce a set of one-sided simultaneous confidence intervals (SCIs) for all the ordered pairwise differences μ_j−μ_i for 1≤i<j≤h and h≤j<i≤k, and therefore enables the experimenter to infer which μ_i's are different when H₀ is rejected. A table of critical values is provided to allow immediate and simple implementation of this new inference procedure.     

Asymptotic and oscillatory behavior of solutions of general nonlinear difference equations of second order

The asymptotic and oscillatory behavior of solutions of some general second-order nonlinear difference equations of the form

δ(a_nh(y_n+1)δy_n)+p_nδy_n+q_n+1f(y_σ(n+1))=0 nZ,

is studied. Oscillation criteria for their solutions, when “p_n” is of constant sign, are established. Results are also presented for the damped-forced equation

δ(a_nh(y_n+1)δy_n)+p_nδy_n+q_n+1f(y_σ(n+1))=e_n nZ.

Examples are inserted in the text for illustrative purposes.     

Three-dimensional analysis of Marangoni flow and radial segregation in Ge<Subscript><Emphasis Type="Italic">x</Emphasis></Subscript>Si<Subscript>1-<Emphasis Type="Italic">x</Emphasis></Subscript> melt with Czochralski configuration

In order to examine the flow field and the radial segregation of silicon (Si) in a Ge _x Si_1-x melt with an idealized Czochralski (Cz) configuration, we conducted a series of unsteady three-dimensional (3-D) numerical simulations under zero-gravity conditions. The effect of convection driven by surface tension on the free surface of the melt was included in the model, by considering thermal, as well as solutal Marangoni convection. The concentration and flow fields at several stages during crystal growth are presented for several temperature differences, driving the Marangoni convection. The simulation results indicate that the flow and concentration fields are axisymmetric for Ma _T < 625 and become oscillatory and 3-D for higher values. It was found that the maximum Si concentration difference at the growth interface decreases as thermal Marangoni number increases due to higher flow velocities in the vicinity of the interface. However, temporal fluctuations of Si concentration at the interface increase at higher thermal Marangoni numbers. The effects of aspect ratio (A _r) were also considered in the model. It was found that the aspect ratio of the melt in the crucible has a prominent influence on the flow pattern in the melt which, in turn, effects the Si concentration at the growth interface.     

Semiparametric analysis of survival data with left truncation and right censoring

Let T, C and V denote the lifetime, censoring and truncation variables, respectively. Assume that (C,V) is independent of T and P(C≥V)=1. Let F, Q and G denote the common distribution functions of T, C and V, respectively. For left-truncated and right-censored (LTRC) data, one can observe nothing if T<V and observe (X,δ,V), with X=min(T,C) and δ=I_[T≤C], if T≥V. For LTRC data, the truncation product-limit estimate is the maximum likelihood estimate (MLE) for nonparametric models. If the distribution of V is parameterized as G(x;θ) and the distributions of T and C are left unspecified, the product-limit estimate is not the MLE for this semiparametric model. In this article, for LTRC data, two semiparametric estimates are proposed for the semiparametric model. A simulation study is conducted to compare the performances of the two semiparametric estimators against that of . The proposed semiparametric method is applied to a Channing House data.     

Monotone properties of certain classes of solutions of second-order difference equations

The authors consider the difference equations

δ(a_nδx_n)=q_nx_n+1

and

δ(a_nδx_n)=q_nf(x_n+1),

where a_n > 0, q_n > 0, and f: R å R is continuous with uf(u) > 0 for u ≠ 0. They obtain necessary and sufficient conditions for the asymptotic behavior of certain types of nonoscillatory solutions of (*) and sufficient conditions for the asymptotic behavior of certain types of nonoscillatory solutions of (**). Sufficient conditions for the existence of these types of nonoscillatory solutions are also presented. Some examples illustrating the results and suggestions for further research are included.     

Wireless network design via 3-decompositions

We consider some network design problems with applications for wireless networks. The input for these problems is a metric space (X,d) and a finite subset UX of terminals. In the Steiner Tree with Minimum Number of Steiner Points (STMSP) problem, the goal is to find a minimum size set SX−U of points so that the unit-disc graph of S+U is connected. Let Δ be the smallest integer so that for any finite VX for which the unit-disc graph is connected, this graph contains a spanning tree with maximum degree Δ. The best known approximation ratio for STMSP was Δ−1 [I.I. Măndoiu, A.Z. Zelikovsky, A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points, Information Processing Letters 75 (4) (2000) 165–167]. We improve this ratio to (Δ+1)/2+1+ε.In the Minimum Power Spanning Tree (MPST) problem, V=X is finite, and the goal is to find a “range assignment” on the nodes so that the edge set contains a spanning tree, and ∑_vVp(v) is minimized. We consider a particular case {0,1}-MPST of MPST when the distances are in {0,1}; here the goal is to find a minimum size set SV of “active” nodes so that the graph (V,E₀+E₁(S)) is connected, where , and E₁(S) is the set the edges in with both endpoints in S. We will show that the (5/3+ε)-approximation scheme for MPST of [E. Althaus, G. Calinescu, I. Măndoiu, S. Prasad, N. Tchervenski, A. Zelikovsky, Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks, Wireless Networks 12 (3) (2006) 287–299] achieves a ratio 3/2 for {0,1}-distances. This answers an open question posed in [E. Lloyd, R. Liu, S. Ravi, Approximating the minimum number of maximum power users in ad hoc networks, Mobile Networks and Applications 11 (2006) 129–142].     

The mean-shift outlier model in general weighted regression and its applications

Consider the general weighted linear regression model y=Xβ+, where E()=0, Cov()=Vσ², σ² is an unknown positive scalar, and V is a symmetric positive-definite matrix not necessary diagonal. Two models, the mean-shift outlier model and the case-deletion model, can be employed to develop multiple case-deletion diagnostics for the linear model. The multiple case-deletion diagnostics are obtained via the mean-shift outlier model in this article and are shown to be equivalent to the deletion diagnostics via the case deletion model obtained by Preisser and Qaqish (1996, Biometrika, 83, 551–562). In addition, computing the multiple case-deletion diagnostics obtained via the mean-shift outlier model is faster than computing the one based on the more commonly used case-deletion model in some situations. Applications of the multiple deletion diagnostics developed from the mean-shift outlier model are also given for regression analysis with the likelihood function available and regression analysis based on generalized estimating equations. These applications include survival models and the generalized estimating equations of Liang and Zeger (1986, Biometrika, 73, 13–22). Several numerical experiments as well as a real example are given as illustrations.     

Drag and lift coefficients of inclined finite circular cylinders at moderate Reynolds numbers

The flow around two-dimensional cylinders at moderate Reynolds numbers has been much studied, both for cylinders perpendicular to the flow and for cylinders yawed to the flow. In contrast, yawed finite aspect ratio cylinders have received little attention. In this article we describe computer simulations of cylinders with aspect ratios 2  L/D  20 yawed at angles 0°  α  90° relative to a free stream. The simulations were carried out for Reynolds numbers in the range 1  Re  40. The simulations show that the Independence Principle [Zdravkovich MM. Flow around circular cylinders, vol. 2: applications. New York: Oxford University Press; 2003[1]] is not accurate for α  45°. We have also found that for all aspect ratios, the ratio of the lift to drag force reaches a maximum for 40° < α < 50°. Finally, we present C_L and C_D relationships as best curve fits to computational data.     

Stability and boundedness in difference systems with finite delay

In this paper, stability and boundedness theorems for delay difference systems with the condition

δV(n,x(n))≤-W₂(|x(n)|)+σ

are given, where Δ is the backward difference operator. Some known results are generalized.     

Generating fuzzy rules from training instances for fuzzy classification systems

In recent years, many methods have been proposed to generate fuzzy rules from training instances for handling the Iris data classification problem. In this paper, we present a new method to generate fuzzy rules from training instances for dealing with the Iris data classification problem based on the attribute threshold value α, the classification threshold value β and the level threshold value γ, where α  [0, 1], β  [0, 1] and γ  [0, 1]. The proposed method gets a higher average classification accuracy rate than the existing methods.     

Robust stabilization of infinite dimensional systems by finite dimensional controllers

The problem of robustly stabilizing an infinite dimensional system with transfer function G, subject to an additive perturbation Δ is considered. It is assumed that: G ε ₀(σ) of systems introduced by Callier and Desoer [3]; the perturbation satisfies |W₁ΔW₂| < ε, where W₁ and W₂ are stable and minimum phase; and G and G + Δ have the same number of poles in ⁺. Now write W₁GW₂=G₁ + G₁, where G₁ is rational and totally unstable and G₂ is stable. Generalizing the finite dimensional results of Glover [12] this family of perturbed systems is shown to be stabilizable if and only if ε σ_min (G^*₁)( = the smallest Hankel singular value of G^*₁). A finite dimensional stabilizing controller is then given by where 2 is a rational approximation of G₂ such that

Full-size image

) and K₁ robustly stabilizes G₁ to margin ε. The feedback system (G, K) will then be stable if |W₁ΔW₂| _∞< ε − Δ.