In [3], they gave necessary and sufficient condition for T 1 C and then as applications T 1 C for weakly dependent sequences was established. In this note, based on Gozlan-L′eonard characterization for W 1 H -inequal...In [3], they gave necessary and sufficient condition for T 1 C and then as applications T 1 C for weakly dependent sequences was established. In this note, based on Gozlan-L′eonard characterization for W 1 H -inequalities, we extends this result to W 1 H inequalities.展开更多
Some dominance rules are proposed for the problems of scheduling N jobs on a single machine with due dates, sequence dependent setup times and no preemption. Two algorithms based on Ragatz' s branch and bound scheme ...Some dominance rules are proposed for the problems of scheduling N jobs on a single machine with due dates, sequence dependent setup times and no preemption. Two algorithms based on Ragatz' s branch and bound scheme are developed including the dominance rules where the objective is to minimize the maximum tardiness or the total tardiness. Computational experiments demonstrate the effectiveness of the dominance rules.展开更多
This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph-<span style="font-family:;" "=""> </span&...This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph-<span style="font-family:;" "=""> </span><span style="font-family:Verdana;">based and sequence-based, of the well-known scheduling problem<img src="Edit_41010f25-7ca5-482c-89be-790fad4616e1.png" alt="" /></span><span style="font-family:Verdana;text-align:justify;">. Two upper bounds of job completion times are introduced. A numerical test result analysis is conducted with a two-fold objective 1) testing the performance of each solving methods, and 2) identifying and analyzing the tractability of an instance according to the instance structure in terms of the number of machines, of the jobs setup time lengths and of the jobs release date distribution over the scheduling horizon.</span> <div> <span style="font-family:Verdana;text-align:justify;"><br /> </span> </div>展开更多
In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We no...In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We note that total customer demands for each type should be satisfied, and total required production time in each cell cannot exceed the capacity of the cell. This problem is formulated as an integer programming model and an interface is designed to provide integrity between data and software. Mathematical model is tested by both randomly generated data set and real-world data set from a factory that produce automotive components. As a result of this study, the solution which gives the best alternative production schedule is obtained.展开更多
Some exponential inequalities and complete convergence are established for extended negatively dependent(END) random variables. The inequalities extend and improve the results of Kim and Kim(On the exponential inequal...Some exponential inequalities and complete convergence are established for extended negatively dependent(END) random variables. The inequalities extend and improve the results of Kim and Kim(On the exponential inequality for negative dependent sequence.Communications of the Korean Mathematical Society, 2007, 22(2): 315-321) and Nooghabi and Azarnoosh(Exponential inequality for negatively associated random variables. Statistical Papers, 2009, 50(2): 419-428). We also obtain the convergence rate O(n-1/2ln1/2n) for the strong law of large numbers, which improves the corresponding ones of Kim and Kim,and Nooghabi and Azarnoosh.展开更多
In the paper,we get the precise results of Hájek-Rényi type inequalities for the partial sums of negatively orthant dependent sequences,which improve the results of Theorem 3.1and Corollary 3.2 in Kim(2006)a...In the paper,we get the precise results of Hájek-Rényi type inequalities for the partial sums of negatively orthant dependent sequences,which improve the results of Theorem 3.1and Corollary 3.2 in Kim(2006)and the strong law of large numbers and strong growth rate for negatively orthant dependent sequences.展开更多
A double helix model of charge transport in DNA molecule is given and the transmission spectra of four DNA sequences are obtained.The calculated results show that the transmission characteristics of DNA are not only r...A double helix model of charge transport in DNA molecule is given and the transmission spectra of four DNA sequences are obtained.The calculated results show that the transmission characteristics of DNA are not only related to the longitudinal transport but also to the transverse transport of molecule.The periodic sequence with the same composition has stronger conduction ability.With the increasing of bases composition,the conductive ability reduces,but the weight of θ direction rises in charge transfer.展开更多
In this paper, we obtain the Hejek-Renyi-type inequality for a class of random variable sequences and give some applications for associated random variable sequences, strongly positive dependent stochastic sequences a...In this paper, we obtain the Hejek-Renyi-type inequality for a class of random variable sequences and give some applications for associated random variable sequences, strongly positive dependent stochastic sequences and martingale difference sequences which generalize and improve the results of Prakasa Rao and Soo published in Statist. Probab. Lett., 57(2002) and 78(2008). Using this result, we get the integrability of supremum and the strong law of large numbers for a class of random variable sequences.展开更多
Some probability inequalities are established for extended negatively dependent(END) random variables. The inequalities extend some corresponding ones for negatively associated random variables and negatively orthant ...Some probability inequalities are established for extended negatively dependent(END) random variables. The inequalities extend some corresponding ones for negatively associated random variables and negatively orthant dependent random variables. By using these probability inequalities, we further study the complete convergence for END random variables. We also obtain the convergence rate O(n-1/2ln1/2n) for the strong law of large numbers, which generalizes and improves the corresponding ones for some known results.展开更多
We consider the problem of estimating an unknown density and its derivatives in a regression setting with random design. Instead of expanding the function on a regular wavelet basis, we expand it on the basis , a warp...We consider the problem of estimating an unknown density and its derivatives in a regression setting with random design. Instead of expanding the function on a regular wavelet basis, we expand it on the basis , a warped wavelet basis. We investigate the properties of this new basis and evaluate its asymptotic performance by determining an upper bound of the mean integrated squared error under different dependence structures. We prove that it attains a sharp rate of convergence for a wide class of unknown regression functions.展开更多
We study the following model: . The aim is to estimate the distribution of X when only are observed. In the classical model, the distribution of is assumed to be known, and this is often considered as an i...We study the following model: . The aim is to estimate the distribution of X when only are observed. In the classical model, the distribution of is assumed to be known, and this is often considered as an important drawback of this simple model. Indeed, in most practical applications, the distribution of the errors cannot be perfectly known. In this paper, the author will construct wavelet estimators and analyze their asymptotic mean integrated squared error for additive noise models under certain dependent conditions, the strong mixing case, the β-mixing case and the ρ-mixing case. Under mild conditions on the family of wavelets, the estimator is shown to be -consistent and fast rates of convergence have been established.展开更多
Rosenthal inequality for NOD (negatively' orthant dependent) random variable sequences is established. As its applications, two theorems of complete convergence of weighted sums for arrays of NOD random variables a...Rosenthal inequality for NOD (negatively' orthant dependent) random variable sequences is established. As its applications, two theorems of complete convergence of weighted sums for arrays of NOD random variables are given, which extend the corresponding known results.展开更多
文摘In [3], they gave necessary and sufficient condition for T 1 C and then as applications T 1 C for weakly dependent sequences was established. In this note, based on Gozlan-L′eonard characterization for W 1 H -inequalities, we extends this result to W 1 H inequalities.
文摘Some dominance rules are proposed for the problems of scheduling N jobs on a single machine with due dates, sequence dependent setup times and no preemption. Two algorithms based on Ragatz' s branch and bound scheme are developed including the dominance rules where the objective is to minimize the maximum tardiness or the total tardiness. Computational experiments demonstrate the effectiveness of the dominance rules.
文摘This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph-<span style="font-family:;" "=""> </span><span style="font-family:Verdana;">based and sequence-based, of the well-known scheduling problem<img src="Edit_41010f25-7ca5-482c-89be-790fad4616e1.png" alt="" /></span><span style="font-family:Verdana;text-align:justify;">. Two upper bounds of job completion times are introduced. A numerical test result analysis is conducted with a two-fold objective 1) testing the performance of each solving methods, and 2) identifying and analyzing the tractability of an instance according to the instance structure in terms of the number of machines, of the jobs setup time lengths and of the jobs release date distribution over the scheduling horizon.</span> <div> <span style="font-family:Verdana;text-align:justify;"><br /> </span> </div>
文摘In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We note that total customer demands for each type should be satisfied, and total required production time in each cell cannot exceed the capacity of the cell. This problem is formulated as an integer programming model and an interface is designed to provide integrity between data and software. Mathematical model is tested by both randomly generated data set and real-world data set from a factory that produce automotive components. As a result of this study, the solution which gives the best alternative production schedule is obtained.
基金Supported by the NSF of Anhui Province(1308085QA03,1408085QA02,1208085QA03)Supported by the Youth Science Research Fund of Anhui University+1 种基金Supported by the Students Innovative Training Project of Anhui University(201410357118)Supported by the Students Science Research Training Program of Anhui University(kyxl2013003)
文摘Some exponential inequalities and complete convergence are established for extended negatively dependent(END) random variables. The inequalities extend and improve the results of Kim and Kim(On the exponential inequality for negative dependent sequence.Communications of the Korean Mathematical Society, 2007, 22(2): 315-321) and Nooghabi and Azarnoosh(Exponential inequality for negatively associated random variables. Statistical Papers, 2009, 50(2): 419-428). We also obtain the convergence rate O(n-1/2ln1/2n) for the strong law of large numbers, which improves the corresponding ones of Kim and Kim,and Nooghabi and Azarnoosh.
基金Foundation of Anhui Educational Committee(No.KJ2013Z225)
文摘In the paper,we get the precise results of Hájek-Rényi type inequalities for the partial sums of negatively orthant dependent sequences,which improve the results of Theorem 3.1and Corollary 3.2 in Kim(2006)and the strong law of large numbers and strong growth rate for negatively orthant dependent sequences.
基金supported by National Natural Science Foundation of China under Grant No.60571062the Natural Science Foundation of Shandong Province under Grant No.Y2004G09
文摘A double helix model of charge transport in DNA molecule is given and the transmission spectra of four DNA sequences are obtained.The calculated results show that the transmission characteristics of DNA are not only related to the longitudinal transport but also to the transverse transport of molecule.The periodic sequence with the same composition has stronger conduction ability.With the increasing of bases composition,the conductive ability reduces,but the weight of θ direction rises in charge transfer.
基金The NSF(10871001,60803059) of ChinaTalents Youth Fund(2010SQRL016ZD) of Anhi Province Universities+2 种基金Youth Science Research Fund(2009QN011A) of Anhui UniversityProvincial Natural Science Research Project of Anhui Colleges(KJ2010A005)Academic innovation team of Anhui University (KJTD001B)
文摘In this paper, we obtain the Hejek-Renyi-type inequality for a class of random variable sequences and give some applications for associated random variable sequences, strongly positive dependent stochastic sequences and martingale difference sequences which generalize and improve the results of Prakasa Rao and Soo published in Statist. Probab. Lett., 57(2002) and 78(2008). Using this result, we get the integrability of supremum and the strong law of large numbers for a class of random variable sequences.
基金Supported by the Project of the Feature Specialty of China(TS11496)Supported by the Scientific Research Projects of Fuyang Teacher’s College(2009FSKJ09)
文摘Some probability inequalities are established for extended negatively dependent(END) random variables. The inequalities extend some corresponding ones for negatively associated random variables and negatively orthant dependent random variables. By using these probability inequalities, we further study the complete convergence for END random variables. We also obtain the convergence rate O(n-1/2ln1/2n) for the strong law of large numbers, which generalizes and improves the corresponding ones for some known results.
文摘We consider the problem of estimating an unknown density and its derivatives in a regression setting with random design. Instead of expanding the function on a regular wavelet basis, we expand it on the basis , a warped wavelet basis. We investigate the properties of this new basis and evaluate its asymptotic performance by determining an upper bound of the mean integrated squared error under different dependence structures. We prove that it attains a sharp rate of convergence for a wide class of unknown regression functions.
文摘We study the following model: . The aim is to estimate the distribution of X when only are observed. In the classical model, the distribution of is assumed to be known, and this is often considered as an important drawback of this simple model. Indeed, in most practical applications, the distribution of the errors cannot be perfectly known. In this paper, the author will construct wavelet estimators and analyze their asymptotic mean integrated squared error for additive noise models under certain dependent conditions, the strong mixing case, the β-mixing case and the ρ-mixing case. Under mild conditions on the family of wavelets, the estimator is shown to be -consistent and fast rates of convergence have been established.
基金Supported by the National Natural Science Foundation of China (10671149,60574002)
文摘Rosenthal inequality for NOD (negatively' orthant dependent) random variable sequences is established. As its applications, two theorems of complete convergence of weighted sums for arrays of NOD random variables are given, which extend the corresponding known results.