关于线性互补问题的迭代算法

建立了一类求解线性互补问题的迭代算法。在一定条件下,研究了保证原问题的解存在唯一的充分条件,并且证明了新算法的收敛性。     

线性矩阵不等式问题的进化计算解决方法

针对决定模糊控制中稳定性的线性矩阵不等式问题,提出了用进化计算来解决模糊控制中线性矩阵不等式的新算法。实验证明,该算法解“用于实现模糊控制的增益调度和稳定性的线性矩阵不等式”是有效的。     

Generalized additive models for location, scale and shape

Summary.  A general class of statistical models for a univariate response variable is presented which we call the generalized additive model for location, scale and shape (GAMLSS). The model assumes independent observations of the response variable y given the parameters, the explanatory variables and the values of the random effects. The distribution for the response variable in the GAMLSS can be selected from a very general family of distributions including highly skew or kurtotic continuous and discrete distributions. The systematic part of the model is expanded to allow modelling not only of the mean (or location) but also of the other parameters of the distribution of y , as parametric and/or additive nonparametric (smooth) functions of explanatory variables and/or random-effects terms. Maximum (penalized) likelihood estimation is used to fit the (non)parametric models. A Newton–Raphson or Fisher scoring algorithm is used to maximize the (penalized) likelihood. The additive terms in the model are fitted by using a backfitting algorithm. Censored data are easily incorporated into the framework. Five data sets from different fields of application are analysed to emphasize the generality of the GAMLSS class of models.     

Marginal and association regression models for longitudinal binary data with drop‐outs: A likelihood‐based approach

Longitudinal data often contain missing observations, and it is in general difficult to justify particular missing data mechanisms, whether random or not, that may be hard to distinguish. The authors describe a likelihood‐based approach to estimating both the mean response and association parameters for longitudinal binary data with drop‐outs. They specify marginal and dependence structures as regression models which link the responses to the covariates. They illustrate their approach using a data set from the Waterloo Smoking Prevention Project They also report the results of simulation studies carried out to assess the performance of their technique under various circumstances.     

Bayesian analysis of a marked point process: Application in seismic hazard assessment

Point processes are the stochastic models most suitable for describing physical phenomena that appear at irregularly spaced times, such as the earthquakes. These processes are uniquely characterized by their conditional intensity, that is, by the probability that an event will occur in the infinitesimal interval (t, t+Δt), given the history of the process up tot. The seismic phenomenon displays different behaviours on different time and size scales; in particular, the occurrence of destructive shocks over some centuries in a seismogenic region may be explained by the elastic rebound theory. This theory has inspired the so-called stress release models: their conditional intensity translates the idea that an earthquake produces a sudden decrease in the amount of strain accumulated gradually over time along a fault, and the subsequent event occurs when the stress exceeds the strength of the medium. This study has a double objective: the formulation of these models in the Bayesian framework, and the assignment to each event of a mark, that is its magnitude, modelled through a distribution that depends at timet on the stress level accumulated up to that instant. The resulting parameter space is constrained and dependent on the data, complicating Bayesian computation and analysis. We have resorted to Monte Carlo methods to solve these problems.     

Bayesian updating of atmospheric dispersion after a nuclear accident

Summary.  We consider a Bayesian forecasting system to predict the dispersal of contamination on a large scale grid in the event of an accidental release of radioactivity. The statistical model is built on a physical model for atmospheric dispersion and transport called MATCH. Our spatiotemporal model is a dynamic linear model where the state parameters are the (essentially, deterministic) predictions of MATCH; the distributions of these are updated sequentially in the light of monitoring data. One of the distinguishing features of the model is that the number of these parameters is very large (typically several hundreds of thousands) and we discuss practical issues arising in its implementation as a realtime model. Our procedures have been checked against a variational approach which is used widely in the atmospheric sciences. The results of the model are applied to test data from a tracer experiment.     

Temporal pattern in number of staff on sick leave: the effect of downsizing

Summary.  The pattern of absenteeism in the downsizing process of companies is a topic in focus in economics and social science. A general question is whether employees who are frequently absent are more likely to be selected to be laid off or in contrast whether employees to be dismissed are more likely to be absent for the remaining time of their working contract. We pursue an empirical and microeconomic investigation of these theses. We analyse longitudinal data that were collected in a German company over several years. We fit a semiparametric transition model based on a mixture Poisson distribution for the days of absenteeism per month. Prediction intervals are considered and the primary focus is on the period of downsizing. The data reveal clear evidence for the hypothesis that employees who are to be laid off are more frequently absent before leaving the company. Interestingly, though, no clear evidence is seen that employees being selected to leave the company are those with a bad absenteeism profile.     

大中专在校学生考试分数的正态化线性转换

本文分析了考试记分方法中传统的绝对百分体制的缺陷，给出了一种正态化转换分数的算法，较适合于在校大中专学生学习水平的横向评价。     

一般Gauss－Markov模型下一般可估函数的线性充分性和线性完全性

发展了Ｂａｋｓａｌａｒｙ和Ｄｒｙｇａｓ提出的一般Ｇａｕｓｓ－Ｍａｒｋｏｖ模型中线性充分性、最小充分性和完全性的概念，用Ｒａｏ的最小二乘统一理论，给出了这些概念的刻划定理。     

Improving flexibility and efficiency by adding parallelism to genetic algorithms

In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our motivation is to bring some uniformity to the proposal, comparison, and knowledge exchange among the traditionally opposite kinds of serial and parallel GAs. We comparatively analyze the properties of steady-state, generational, and cellular genetic algorithms. Afterwards, this study is extended to consider a distributed model consisting in a ring of GA islands. The analyzed features are the time complexity, selection pressure, schema processing rates, efficacy in finding an optimum, efficiency, speedup, and resistance to scalability. Besides that, we briefly discuss how the migration policy affects the search. Also, some of the search properties of cellular GAs are investigated. The selected benchmark is a representative subset of problems containing real world difficulties. We often conclude that parallel GAs are numerically better and faster than equivalent sequential GAs. Our aim is to shed some light on the advantages and drawbacks of various sequential and parallel GAs to help researchers using them in the very diverse application fields of the evolutionary computation.