Assumptions and Consequences of Treating Providers in Therapy Studies as Fixed Versus Random Effects: Reply to Crits-Christoph, Tu, and Gallop (2003) and Serlin, Wampold, and Levin (2003).

In their comments on the authors' article (see record 2003-10163-009), R. C. Serlin, B. E. Wampold, and J. R. Levin (see record 2003-10163-011) and P. Crits-Christoph, X. Tu, and R. Gallop (see record 2003-10163-010) took issue with the authors' suggestion to evaluate therapy studies with nested providers with a fixed model approach. In this rejoinder, the authors' comment on Serlin et al's critique by showing that their arguments do not apply, are based on misconceptions about the purpose and nature of statistical inference, or are based on flawed reasoning. The authors also comment on Crits-Christoph et al's critique by showing that the proposed approach is very similar to, but less inclusive than, their own suggestion. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

EIGENVECTORS-BASED PARALLELISATION OF NESTED LOOPS WITH AFFINE DEPENDENCES

Abstract

This paper presents a method for parallelising nested loops with affine dependences. The data dependences of a program are represented exactly using a dependence matrix rather than an imprecise dependence abstraction. By a careful analysis of the eigenvectors and eigenvalues of the dependence matrix, we detect the parallelism inherent in the program, partition the iteration space of the program into sequential and parallel regions, and generate parallel code to execute these regions. For a class of programs considered in the paper, the proposed method can expose more coarse-grain and fine-grain parallelism than a hyperplane-based loop transformation.     

On Hypotheses Testing for the Selection of Spatio‐Temporal Models

Abstract. Several models have been proposed in recent years for analysing spatial data and also, to some extent, spatio‐temporal data. One of the important problems, namely the choice of an appropriate model for describing real data sets, remains unsolved. Here we consider the analysis of spatio‐temporal processes from which observations over space and time are available. We propose statistical tests for discriminating between space–time autoregressive processes and multivariate autoregressive processes. The sampling properties of the proposed tests are considered. We illustrate the methods with a real example. We use the above tests to find the best model to describe spatio‐temporal variations of hourly carbon monoxide measurements at four locations in London in January 2004.     

嵌套分割算法在随机需求车辆路径问题中的应用研究

对需求量满足二项分布的随机需求车辆路径问题进行了研究,在服务失败时采取允许部分服务的策略,并将嵌套分割算法与扫描算法相结合,给出了一种新的求解随机需求车辆路径问题的两阶段算法,数值试验验证了该算法的有效性。同时,该算法也拓展了车辆路径问题的算法空间。     

Flow shop问题的嵌套分区优化调度方法

介绍了嵌套分区算法(NP)的基本思想, 并用于求解流水作业优化调度问题. 算法用嵌套分区树来描述流水作业调度问题, 对可行域进行系统性分区, 然后集中搜索有优良解的区域. 在每一步迭代中, 算法跟踪最有希望的分区, 并结合启发式算法和邻域搜索来实现分区转移. 仿真实验表明, 该算法比单纯的启发式算法和邻域搜索有较好的寻优能力.     

化学虚拟实验中序列化技术的应用与研究

虚拟实验室是教育领域的一个研究热点,其中实验的存储是系统一个十分重要的功能模块。文中以采用VC 和OpenGL技术开发的中学化学实验仿真系统(CVExperiment)为例,详细介绍比较复杂的对象的序列化,并根据对象之间的不同关系,提出不同的序列化方法。     

An activity-list-based nested partitions algorithm for resource-constrained project scheduling

The resource-constrained project scheduling problem (RCPSP) has received wide attention. In this paper, an activity-list-based nested partitions algorithm (ALNP) is developed for solving the RCPSP and a P-ALNP is proposed to improve ALNP with local adjustment. In the algorithms, to improve the search efficiency, a partial double justification is employed as local search mechanism. The computational experiments on the PSPLIB and analysis on robustness of the algorithms show that ALNP outperforms the traditional serial scheduling scheme for solving the large-scale, complex RCPSPs, and P-ALNP can improve ALNP and obtain better results. P-ALNP is a competitive algorithm for solving the RCPSP.     

CAD/CAM 中 Undo/Redo 技术的研究

介绍了一种基于实体模型的ＣＡＤ／ＣＡＭ系统的Ｕｎｄｏ／Ｒｅｄｏ操作实现技术．它支持多层次嵌套的ＣＡＤ／ＣＡＭ建模环境．因而当用户在ＣＡＤ／ＣＡＭ系统环境中建模时,可以方便地对模型进行Ｕｎｄｏ／Ｒｅｄｏ编辑操作．     

Analysis and design of delta operator systems with nested actuator saturation

In this paper, the problem of estimating the domain of attraction is considered for delta operator systems subject to nested actuator saturation. A set invariance condition is established for the delta operator system with nested actuator saturation in terms of auxiliary feedback matrices. Based on the set invariance condition, an optimisation approach is proposed to estimate the domain of attraction for the delta operator system. Thereby, the partial results of nested actuator saturation for both continuous-time systems and discrete-time systems are extended to delta operator system framework. A numerical example is provided to illustrate the effectiveness of the proposed design techniques.     

Generation of Efficient Nested Loops from Polyhedra

Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target space-time domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a significant impact on the quality of the final code. It involves making a trade-off between code size and control code simplification/optimization. Previous methods of doing code generation are based on loop splitting, however they have nonoptimal behavior when working on parameterized programs. We present a general parameterized method for code generation based on dual representation of polyhedra. Our algorithm uses a simple recursion on the dimensions of the domains, and enables fine control over the tradeoff between code size and control overhead.