Design and realization of threshold secret sharing scheme with random weights

A new threshold secret sharing scheme is constructed by introducing the concept of share vector, in which the number of shareholders can be adjusted by randomly changing the weights of them. This kind of scheme overcomes the limitation of the static weighted secret sharing schemes that cannot change the weights in the process of carrying out and the deficiency of low efficiency of the ordinary dynamic weighted sharing schemes for its resending process. Thus, this scheme is more suitable to the case that the number of shareholders needs to be changed randomly during the scheme is carrying out.

Multi-objective reservoir operation using particle swarm optimization with adaptive random inertia weights

Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.

On the rate of complete convergence for weighted sums of NSD random variables and an application

In this paper, the complete convergence is established for the weighted sums of negatively superadditive-dependent random variables. As an application, the Marcinkiewicz-Zygmund strong law of large numbers for the random weighted average is also achieved, and a simulation study is done for the asymptotic behaviour of random weighting estimator.

Random weighting error estimation for the inversion result of finite-fault rupture history

Since the non-unique solution exists in the inversion for finite-fault rupture history, the random weighting method hasbeen used to estimate error of the inversion results in this paper. The resolution distributions of slip amplitude, rake,rupture time and rise time on the finite fault were deduced quantitatively by model calculation. By using the randomweighting method, the inversion results of Taiwan Strait earthquake and Myanmar-China boundal earthquake showthat the parameters related to the rupture centers of two events have the highest resolution, and the solutinn are the mostreliable(otherwise the resolution of the slip amplitudes and rise time on the finite-fault boundary is low.

THE LAW OF THE ITERATED LOGARITHM OF RANDOM WEIGHTING APPROXIMATION FOR MEAN ERROR──NON．I．I．D．SITUATION

For the dislribulion if mean error under independent but not identicallydislribuled conditions. its approximating dislribution whose precision reachO is obtained.

EDGEWORTH EXPANSION FOR NEAREST NEIGHBOR- KERNEL ESTIMATE AND RANDOM WEIGHTING APPROXIMATION OF CONDITIONAL DENSITY

In this paper,Edgeworth expansion for the nearest neighbor\|kernel estimate and random weighting approximation of conditional density are given and the consistency and convergence rate are proved.

RandWPSO-LSSVM optimization feedback method for large underground cavern and its engineering applications

According to the characteristics of large underground caverns, by using the safety factor of surrounding rock mass point as the control standard of cavern stability, RandWPSO-LSSVM optimization feedback method and flow process of large underground cavern anchor parameters were established. By applying the optimization feedback method to actual project, the best anchor parameters of large surge shaft five-tunnel area underground cavern of the Nuozhadu hydropower station were obtained through optimization. The results show that the predicted effect of LSSVM prediction model obtained through RandWPSO optimization is good, reasonable and reliable. Combination of the best anchor parameters obtained is 114131312, that is, the locked anchor bar spacing is 1 m x 1 m, pre-stress is 100 kN, elevation 580.45-586.50 m section anchor bar diameter is 36.00 mm, length is 4.50 m, spacing is 1.5 m × 2.5 m; anchor bar diameter at the five-tunnel area side wall is 25.00 mm, length is 7.50 m, spacing is 1 m× 1.5 m, and the shotcrete thickness is 0.15 m. The feedback analyses show that the optimization feedback method of large underground cavern anchor parameters is reasonable and reliable, which has important guiding significance for ensuring the stability of large underground caverns and for saving project investment.

A comparative study of fuzzy weights of evidence and random forests for mapping mineral prospectivity for skarn-type Fe deposits in the southwestern Fujian metallogenic belt, China

Recent studies have pointed out that the widespread iron deposits in southwestern Fujian metallogenic belt(SFMB)(China) are skarn-type deposits associated with the Yanshanian granites. There is still excellent potential for mineral exploration because large areas in this belt are covered by forest. A new predictive model for mapping skarn-type Fe deposit prospectivity in this belt was developed and focused on in this study, using five criteria as evidence:(1) the contact zones of Yanshanian granites(GRANITE);(2) the contact zones within the late Paleozoic marine sedimentary rocks and the carbonate formations(FORMATION);(3) the NE-NNE-trending faults(FAULT);(4) the zones of skarn alterations(SKARN); and(5) the aeromagnetic anomaly(AEROMAGNETIC). The fuzzy weights of evidence(FWof E) method, developed from the classical weights of evidence(Wof E) and based on fuzzy sets and fuzzy probabilities, could provide smaller variances and more accurate posterior probabilities and could effectively minimize the uncertainty caused by omitted or wrongly assigned data and be more flexible than the Wof E. It is an efficient and widely used method for mineral potential mapping. Random forests(RF) is a new and useful method for data-driven predictive mapping of mineral prospectivity method, and needs further scrutiny. Both prospectivity results respectively using the FWof E and RF methods reveal that the prediction model for the skarn-type Fe deposits in the SFMB is successful and efficient. Both methods suggested that the GRANITE and FORMATION are the most valuable evidence maps, followed by SKARN, AEROMAGNETIC, and FAULT. This is coincident with the skarn-type Fe deposit mineral model in the SFMB. The unstable performance experienced when FORMATION was omitted might indicate that the highest uncertainty and risk in follow-up exploration is related to the sequences. In addition, the performance of the RF method for the skarn-type Fe deposits prospectivity in the SFMB is better than the FWof E; therefore, it could be used to guide further exploration of skarn-type Fe prospects in the SFMB.

Contact process on regular tree with random vertex weights

This paper is concerned with the contact process with random vertex weights on regular trees, and studies the asymptotic behavior of the critical infection rate as the degree of the trees increasing to infinity. In this model, the infection propagates through the edge connecting vertices x and y at rate λp（x）p（y） for someλ 〉0, where {ρ（x）, x∈ Td} are independent and identically distributed （i.i.d.） vertex weights. We show that when d is large enough, there is a phase transition at At（d）∈ （0, ec） such that for λ 〈 λc（d）, the contact process dies out, and for λ 〉 λc（d）, the contact process survives with a positive probability. Moreover, we also show that there is another phase transition at λe（d） such that for λ 〈 λe（d）, the contact process dies out at an exponential rate. Finally, we show that these two critical values have the same asymptotic behavior as d increases.

A Unit Root Test for an AR(1)Process with AR Errors by Using Random Weighted Bootstrap

A great deal of economic problems are related to detecting the stability of time series data,where the main interest is in the unit root test.In this paper,we consider the unit root testing problem with errors being long-memory processes with the LARCH structure.A new test statistic is developed by using the random weighted bootstrap method.It turns out that the proposed statistic has a chisquared distribution asymptotically regardless of the process being stationary or nonst at ionary,and with or without an intercept term.The simulation results show that the statistic has a desired finite sample performance in terms of both size and power.A real data application is also given relying on the inflation rate data of 17 countries.

APPROXIMATION RATES OF ERROR DISTRIBUTION OF DOUBLE KERNEL ESTIMATES OF CONDITIONAL DENSITY

In this paper, the normal approximation rate and the random weighting approximation rate of error distribution of the kernel estimator of conditional density function f(y|x) are studied. The results may be used to construct the confidence interval of f(y|x) .

Random Weighting Estimation Method for Dynamic Navigation Positioning

This paper presents a new random weighting estimation method for dynamic navigation positioning. This method adopts the concept of random weighting estimation to estimate the covariance matrices of system state noises and observation noises for controlling the disturbances of singular observations and the kinematic model errors. It satisfies the practical requirements of the residual vector and innovation vector to sufficiently utilize observation information, thus weakening the disturbing effect of the kinematic model error and observation model error on the state parameter estimation. Theories and algorithms of random weighting estimation are established for estimating the covariance matrices of observation residual vectors and innovation vec- tors. This random weighting estimation method provides an effective solution for improving the positioning accuracy in dynamic navigation. Experimental results show that compared with the Kalman filtering, the extended Kalman filtering and the adaptive windowing filtering, the proposed method can adaptively determine the covariance matrices of observation error and state error, effectively resist the disturbances caused by system error and observation error, and significantly improve the positioning accu- racy for dynamic navigation.

RANDOM WEIGHTING METHOD FOR CENSORED REGRESSION MODEL

Rao and Zhao (1992) used random weighting method to derive the approximate distribution of the M-estimator in linear regression model.In this paper we extend the result to the censored regression model (or censored “Tobit” model).

Random weighting method for Cox’s proportional hazards model

Variance of parameter estimate in Cox’s proportional hazards model is based on asymptotic variance. When sample size is small, variance can be estimated by bootstrap method. However, if censoring rate in a survival data set is high, bootstrap method may fail to work properly. This is because bootstrap samples may be even more heavily censored due to repeated sampling of the censored observations. This paper proposes a random weighting method for variance estimation and confidence interval estimation for proportional hazards model. This method, unlike the bootstrap method, does not lead to more severe censoring than the original sample does. Its large sample properties are studied and the consistency and asymptotic normality are proved under mild conditions. Simulation studies show that the random weighting method is not as sensitive to heavy censoring as bootstrap method is and can produce good variance estimates or confidence intervals.

Approximation by random weighting method for M-test in linear models

The M-test has been in common use and widely studied in testing the linear hypotheses in linear models. However, the critical value for the test is usually related to the quantities of the unknown error distribution and the estimate of the nuisance parameters may be rather involved, not only for the M-test method but also for the existing bootstrap methods. In this paper we suggest a random weighting resampling method for approximating the null distribution of the M-test statistic. It is shown that, under both the null and the local alternatives, the random weighting statistic has the same asymptotic distribution as the null distribution of the M-test. The critical values of the M-test can therefore be obtained by the random weighting method without estimating the nuisance parameters. A distinguished feature of the proposed method is that the approximation is valid even the null hypothesis is not true and the power evaluation is possible under the local alternatives.

L_1-Norm Estimation and Random Weighting Method in a Semiparametric Model

In this paper, the L_1-norm estimators and the random weighted statistic fora semiparametric regression model are constructed, the strong convergence rates of estimators areobtain under certain conditions, the strong efficiency of the random weighting method is shown. Asimulation study is conducted to compare the L_1-norm estimator with the least square estimator interm of approximate accuracy, and simulation results are given for comparison between the randomweighting method and normal approximation method.

Dynamic weighted random load balancing algorithm for SIP application server

A new load balancing algorithm named dynamic weighed random （DWR） algorithm for the session initiation protocol （SIP） application server cluster is proposed. It uses weighted hashing random algorithm that supports dialog in the SIP protocol to distribute messages. The weight of each server is dynamic adaptive with feedback mechanism. DWR insures that the cluster is balanced, and it performs better than the limited resource vector （LRV） algorithm and minimum sessions first （MSF） algorithm.

Jackknifed random weighting for Cox proportional hazards model

The Cox proportional hazards model is the most used statistical model in the analysis of survival time data.Recently,a random weighting method was proposed to approximate the distribution of the maximum partial likelihood estimate for the regression coefficient in the Cox model.This method was shown not as sensitive to heavy censoring as the bootstrap method in simulation studies but it may not be second-order accurate as was shown for the bootstrap approximation.In this paper,we propose an alternative random weighting method based on one-step linear jackknife pseudo values and prove the second accuracy of the proposed method.Monte Carlo simulations are also performed to evaluate the proposed method for fixed sample sizes.

Choice of Optimal Trimming Proportion by the Random Weighting Method

In this paper, a strongly consistent estimation of the optimal trimming proportion in trimmed mean is found by the random weighting method. In addition, using the same method a strongly consistent estimation for the distribution of some adaptive estimator is also obtained.

Approximation to the Distribution of the Least Squares Estimators in Two Dimensional Cosine Models by Randomly Weighted Bootstrap

Recently, Kundu and Gupta （Metrika, 48：83 C 97, 1998） established the asymptotic normality of the least squares estimators in the two dimensional cosine model. In this paper, we give the approximation to the general least squares estimators by using random weights which is called the Bayesian bootstrap or the random weighting method by Rubin （Annals of Statistics, 9：130 C 134, 1981） and Zheng （Acta Math. Appl. Sinica （in Chinese）, 10（2）： 247 C 253, 1987）. A simulation study shows that this approximation works very well.