On traceable iterated line graph and hamiltonian path index

Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph L^(n)(G)is hamiltonian,for n≥2.In this paper,we study the existence of a hamiltonian path in L^(n)(G),and give a characterization of G for which L^(n)(G)has a hamiltonian path.As applications,we use this characterization to give several upper bounds on the hamiltonian path index of a graph.

Improved Adaptive Iterated Extended Kalman Filter for GNSS/INS/UWB-Integrated Fixed-Point Positioning

To provide stable and accurate position information of control points in a complex coastal environment,an adaptive iterated extended Kalman filter(AIEKF)for fixed-point positioning integrating global navigation satellite system,inertial navigation system,and ultra wide band(UWB)is proposed.In thismethod,the switched global navigation satellite system(GNSS)and UWB measurement are used as the measurement of the proposed filter.For the data fusion filter,the expectation-maximization(EM)based IEKF is used as the forward filter,then,the Rauch-Tung-Striebel smoother for IEKF filter’s result smoothing.Tests illustrate that the proposed AIEKF is able to provide an accurate estimation.

A fixed point theorem for Proinov mappings with a contractive iterate

In this paper,we consider the fixed point theorem for Proinov mappings with a contractive iterate at a point.In other words,we combine and unify the basic approaches of Proinov and Sehgal in the framework of the complete metric spaces.We consider examples to illustrate the validity of the obtained result.

THE LAW OF THE ITERATED LOGARITHM FOR SPATIAL AVERAGES OF THE STOCHASTIC HEAT EQUATION

Let u(t,x)be the solution to the one-dimensional nonlinear stochastic heat equation driven by space-time white noise with u(0,x)=1 for all x∈R.In this paper,we prove the law of the iterated logarithm(LIL for short)and the functional LIL for a linear additive functional of the form∫[0,R]u(t,x)dx and the nonlinear additive functionals of the form∫[0,R]g(u(t,x))dx,where g:R→R is nonrandom and Lipschitz continuous,as R→∞for fixed t>0,using the localization argument.

A NONCLASSICAL LAW OF ITERATED LOGARITHM FOR NEGATIVELY ASSOCIATED RANDOM VARIABLES

A nonclassical law of iterated logarithm that holds for a stationary negatively associated sequence of random variables with finite variance is proved in this paper. The proof is based on a Rosenthal type maximal inequality and the subsequence method.This result extends the work of Klesov,Rosalsky (2001) and Shao,Su (1999).

Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets

To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to appropriate vehicles. In the second phase, the iterated dynasearch algorithm is adopted to route each selected vehicle with the assigned customers. The iterated dynasearch algorithm combines dynasearch algorithm with iterated local search algorithm based on random kicks. The second methodplogy adopts the idea of cyclic transfer which is performed by using dynamic programming algorithm, and the iterated dynasearch algorithm is also embedded in it. The test results show that both methodologies generate better solutions than the traditional method, and the second methodology is superior to the first one.

Cantor Type Fixed Sets of Iterated Multifunction Systems Corresponding to Self-Similar Networks

We propose a new approach to the investigation of deterministic self-similar networks by using contractive iterated multifunction systems (briefly IMSs). Our paper focuses on the generalized version of two graph models introduced by Barabási, Ravasz and Vicsek ([1] [2]). We generalize the graph models using stars and cliques: both algorithm construct graph sequences such that the next iteration is always based on n replicas of the current iteration, where n is the size of the initial graph structure, being a star or a clique. We analyze these self-similar graph sequences using IMSs in function of the size of the initial star and clique, respectively. Our research uses the Cantor set for the description of the fixed set of these IMSs, which we interpret as the limit object of the analyzed self-similar networks.

A Modi ed Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem

The flexible job shop scheduling problem(FJSP) is considered as an important problem in the modern manufacturing system. It is known to be an NP-hard problem. Most of the algorithms used in solving FJSP problem are categorized as metaheuristic methods. Some of these methods normally consume more CPU time and some other methods are more complicated which make them di cult to code and not easy to reproduce. This paper proposes a modified iterated greedy(IG) algorithm to deal with FJSP problem in order to provide a simpler metaheuristic, which is easier to code and to reproduce than some other much more complex methods. This is done by separating the classical IG into two phases. Each phase is used to solve a sub-problem of the FJSP: sequencing and routing sub-problems. A set of dispatching rules are employed in the proposed algorithm for the sequencing and machine selection in the construction phase of the solution. To evaluate the performance of proposed algorithm, some experiments including some famous FJSP benchmarks have been conducted. By compared with other algorithms, the experimental results show that the presented algorithm is competitive and able to find global optimum for most instances. The simplicity of the proposed IG provides an e ective method that is also easy to apply and consumes less CPU time in solving the FJSP problem.

THE LAW OF ITERATED LOGARITHM FOR R/S STATISTICS

A law of iterated logarithm for R/S statistics with the help of the strong approximations of R/S statistics by functions of a Wiener process is shown.

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem（PFSP with time lags） is concentrated but non-permutation problem（non-PFSP with time lags） seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algo- rithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation（IGTLP） and iterated greedy algorithm for non-permutation （IGTLNP）. The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% com- putational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

PRECISE ASYMPTOTICS IN SELF-NORMALIZED SUMS OF ITERATED LOGARITHM FOR MULTIDIMENSIONALLY INDEXED RANDOM VARIABLES

In the case of Z＋^d（d ≥ 2）-the positive d-dimensional lattice points with partial ordering ≤, {Xk,k∈ Z＋^d} i.i.d, random variables with mean 0, Sn =∑k≤nXk and Vn^2 = ∑j≤nXj^2, the precise asymptotics for ∑n1/｜n｜（log｜n｜dP（｜Sn/Vn｜≥ε√log log｜n｜） and ∑n（logn｜）b/｜n｜（log｜n｜）^d-1P（｜Sn/Vn｜≥ε√log n）,as ε↓0,is established.

PRECISE RATES IN THE LAW OF THE ITERATED LOGARITHM FOR R/S STATISTICS

Let{Xn;n≥1}be a sequence of i.i.d, random variables with finite variance,Q（n）be the related R/S statistics. It is proved that lim ε↓0 ε^2 ∑n=1 ^8 n log n/1 P{Q（n）≥ε√2n log log n}=2/1 EY^2,where Y=sup0≤t≤1B（t）-inf0≤t≤sB（t）,and B（t） is a Brownian bridge.

A LAW OF ITERATED LOGARITHM FOR THE MLE IN A RANDOM CENSORING MODEL WITH INCOMPLETE INFORMATION

In this article, a law of iterated logarithm for the maximum likelihood estimator in a random censoring model with incomplete information under certain regular conditions is obtained.

DISCUSSION ON THE C^r－SOLUTIONS OF THE ITERATED EQUATION λ_1f（x）＋λ_2f^2（x）＝F（x）

In this paper, we consider the iterated equationλ1f(x) + λ2f2(x)=F(x)where f2(x)= f(f(x)), F (x) denotes known function and f(x) denotes the unknown function. There are given conditions for the existence, uniqueness and stability of C'-solutions ofthe iterated equation (*) and also there is a proved theorem for the continuous dependence of Cr-solutions of iterated equation (*) on the given function.

PRECISE RATE IN THE LAW OF ITERATED LOGARITHM FOR ρ-MIXING SEQUENCE

Let {X,X n;n≥1} be a strictly stationary sequence of ρ-mixing random variables with mean zero and finite variance. Set S n=n k=1X k,M n=max k≤n｜S k｜,n≥1. Suppose lim n→∞ES2 n/n=∶σ2>0 and ∞n=1ρ 2/d(2n)<∞, where d=2,if -1<b<0 and d>2(b+1),if b≥0. It is proved that,for any b>-1, limε0ε 2(b+1)∞n=1(loglogn)bnlognP{M n≥εσ2nloglogn}= 2(b+1)πГ(b+3/2)∞k=0(-1)k(2k+1) 2b+2,where Г(·) is a Gamma function.

ON COMPACTNESS FOR ITERATED COMMUTATORS

The authors study the iterated commutators on the weighted Bergman spaces A2（φ）, and prove that Cnh is compact on A2（φ） if and only if h ∈ B0.

An iterated local coordinate-exchange algorithm for constructing experimental designs for multi-dimensional constrained spaces

Iterated local search(ILS)is used to construct the optimal experimental designs for multi-dimensional constrained spaces,in which the inner loop is based on the stochastic coordinate-exchange(SCE)algorithm.Every time a local optimal solution is found by the SCE algorithm,the perturbation operator is applied to it,and then a new solution is explored in the areas where the exchange of coordinates may produce improvement,so as to retain the features and attributes of the current optimal solution and avoid the defects of random restart.We implement the iterated local coordinate-exchange algorithm for experimental designs in the multi-dimensional constrained spaces.In addition,sensitivity analysis was conducted to analyze the impacts of the parameters on the performance of the proposed algorithm.Also we compared the performance of the proposed algorithm to the SCE algorithm using the random restart strategy.The analysis shows that the proposed algorithm is better than the SCE algorithm in terms of efficiency and quality,especially in the experimental designs for high-dimensional constrained space.

Some New Fixed Point Theorems for Fuzzy Iterated Contraction Maps in Fuzzy Metric Spaces

The purpose of this paper is to introduce the notion of fuzzy iterated contraction maps in fuzzy metric spaces and establish some new fixed point theorems for fuzzy iterated contraction maps in fuzzy metric spaces.

Simulation for chaos game representation of genomes by recurrent iterated function systems

Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequences from complete genomes: whole genome DNA sequences, linked coding DNA sequences and linked protein sequences. Some fractal patterns are found in these CGRs. A recurrent iterated function systems (RIFS) model is proposed to simulate the CGRs of these sequences from genomes and their induced measures. Numerical results on 50 genomes show that the RIFS model can simulate very well the CGRs and their induced measures. The parameters estimated in the RIFS model reflect information on species classification.

ERGODIC THEOREM FOR INFINITE ITERATED FUNCTION SYSTEMS

A set of contraction maps of a metric space is called an iterated function systems. Iterated function systems with condensation, can be considered infinite iterated function systems. Infinite iterated function systems on compact metric spaces were studied. Using the properties of Banach limit and uniform contractiveness, it was proved that the random iterating algorithms for infinite iterated function systems on compact metric spaces-satisfy ergodicity. So the random iterating algorithms for iterated function systems with condensation satisfy ergodicity, too.