Diagnostic assessment of children’s proportional reasoning

A proportional reasoning item bank was created from the relevant literature and tested in various forms. Rasch analyses of 303 pupils’ test results were used to calibrate the bank, and data from 84 pupils’ interviews was used to confirm our diagnostic interpretations. A number of sub-tests were scaled, including parallel ‘without models’ and ‘with models’ forms. We provide details of the 13-item ‘without models’ test which was formed from the ‘richest’ diagnostic items and verified on a further test sample (N=212, ages 10-13). Two scales were constructed for this test, one that measures children’s ‘ratio attainment’ and one that measures their ‘tendency for additive strategy.’ Other significant errors — ‘incorrect build-up,’ ‘magical doubling/halving,’ ‘constant sum’ and ‘incomplete reasoning’ — were identified. Finally, an empirical hierarchy of pupils’ attainment of proportional reasoning was formed, incorporating the significant errors and the additive scale.     

Integrated crossover rules in real coded genetic algorithms

Modifications in crossover rules and localization of searches are suggested to the real coded genetic algorithms for continuous global optimization. Central to our modifications is the integration of different crossover rules within the genetic algorithm. Numerical experiments using a set of 50 test problems indicate that the resulting algorithms are considerably better than the previous version considered and offer a reasonable alternative to many currently available global optimization algorithms, especially for problems requiring ‘direct search type’ methods.     

Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing

This paper describes new models and exact solution algorithms for the fixed destination multidepot salesmen problem defined on a graph with n nodes where the number of nodes each salesman is to visit is restricted to be in a predefined range. Such problems arise when the time to visit a node takes considerably longer as compared to the time of travel between nodes, in which case the number of nodes visited in a salesman’s tour is the determinant of their ‘load’. The new models are novel multicommodity flow formulations with O(n²) binary variables, which is contrary to the existing formulations for the same (and similar) problems that typically include O(n³) binary variables. The paper also describes Benders decomposition algorithms based on the new formulations for solving the problem exactly. Results of the computational experiments on instances derived from TSPLIB show that some of the proposed algorithms perform remarkably well in cases where formulations solved by a state-of-the-art optimization code fail to yield optimal solutions within reasonable computation time.     

A simulated annealing driven multi-start algorithm for bound constrained global optimization

A derivative-free simulated annealing driven multi-start algorithm for continuous global optimization is presented. We first propose a trial point generation scheme in continuous simulated annealing which eliminates the need for the gradient-based trial point generation. We then suitably embed the multi-start procedure within the simulated annealing algorithm. We modify the derivative-free pattern search method and use it as the local search in the multi-start procedure. We study the convergence properties of the algorithm and test its performance on a set of 50 problems. Numerical results are presented which show the robustness of the algorithm. Numerical comparisons with a gradient-based simulated annealing algorithm and three population-based global optimization algorithms show that the new algorithm could offer a reasonable alternative to many currently available global optimization algorithms, specially for problems requiring ‘direct search’ type algorithm.     

First vs. best improvement: An empirical study

When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first improvement, if the initial solution is chosen at random. However, starting with ‘greedy’ or ‘nearest neighbor’ constructive heuristics, the best improvement is better and faster on average. Reasons for this behavior are investigated. It appears to be better to use exchanges introducing into the solution a very small edge and fairly large one, which can easily be removed later, than two small ones which are much harder to remove.     

Inspection scheduling for imperfect production processes under free repair warranty contract

The paper considers scheduling of inspections for imperfect production processes where the process shift time from an ‘in-control’ state to an ‘out-of-control’ state is assumed to follow an arbitrary probability distribution with an increasing failure (hazard) rate and the products are sold with a free repair warranty (FRW) contract. During each production run, the process is monitored through inspections to assess its state. If at any inspection the process is found in ‘out-of-control’ state, then restoration is performed. The model is formulated under two different inspection policies: (i) no action is taken during a production run unless the system is discovered in an ‘out-of-control’ state by inspection and (ii) preventive repair action is undertaken once the ‘in-control’ state of the process is detected by inspection. The expected sum of pre-sale and post-sale costs per unit item is taken as a criterion of optimality. We propose a computational algorithm to determine the optimal inspection policy numerically, as it is quite hard to derive analytically. To ease the computational difficulties, we further employ an approximate method which determines a suboptimal inspection policy. A comparison between the optimal and suboptimal inspection policies is made and the impact of FRW on the optimal inspection policy is investigated in a numerical example.     

A multivariate version of the Benjamini-Hochberg method

We propose a multivariate method for combining results from independent studies about the same ‘large scale’ multiple testing problem. The method works asymptotically in the number of hypotheses and consists of applying the Benjamini-Hochberg procedure to the p-values of each study separately by determining the ‘individual false discovery rates’ which maximize power subject to a restriction on the (global) false discovery rate. We show how to obtain solutions to the associated optimization problem, provide both theoretical and numerical examples, and compare the method with univariate ones.     

On the parallel between normality and extremal disconnectedness

Several familiar results about normal and extremally disconnected (classical or pointfree) spaces shape the idea that the two notions are somehow dual to each other and can therefore be studied in parallel. This paper investigates the source of this ‘duality’ and shows that each pair of parallel results can be framed by the ‘same’ proof. The key tools for this purpose are relative notions of normality, extremal disconnectedness, semicontinuity and continuity (with respect to a fixed class of complemented sublocales of the given locale) that bring and extend to locale theory a variety of well-known classical variants of normality and upper and lower semicontinuities in an illuminating unified manner. This approach allows us to unify under a single localic proof all classical insertion, as well as their corresponding extension results.     

Multiple-input dual-output adjustment scheme for semiconductor manufacturing processes using a dynamic dual-response approach

This paper presents an optimization-based, multiple-input dual-output (MIDO) run-to-run (R2R) controller for general semiconductor manufacturing processes. This controller, termed ‘adaptive dual-response optimizing controller’ (ADROC), can serve as a recipe regulator between consecutive runs of wafer fabrication. In ADROC, an on-line estimation technique is implemented in a self-tuning (ST) control manner for the adaptation purpose. Subsequently, an ad hoc global optimization algorithm based on the dual-response approach is used to seek the optimum recipe within the acceptability region for the execution of next run. In addition, a ‘responsive-type’ adjustment method is devised, serving as a post hoc filter to alleviate the over-control problem and maintain a better trade-off between two potentially conflicting process responses in MIDO R2R situations. Typical applications of R2R control to chemical mechanical planarization (CMP) in semiconductor manufacturing are demonstrated through simulated processes to illustrate ADROC. The procedure is compared to three benchmark methods (OAQC, single- and double-EWMA controllers) in a simulation experiment.     

“I’m not very good at solving problems”: An exploration of students’ problem solving behaviours

This paper reports one aspect of a larger study which looked at the strategies used by a selection of grade 6 students to solve six non-routine mathematical problems. The data revealed that the students exhibited many of the behaviours identified in the literature as being associated with novice and expert problem solvers. However, the categories of ‘novice’ and ‘expert’ were not fully adequate to describe the range of behaviours observed and instead three categories that were characteristic of behaviours associated with ‘naïve’, ‘routine’ and ‘sophisticated’ approaches to solving problems were identified. Furthermore, examination of individual cases revealed that each student's problem solving performance was consistent across a range of problems, indicating a particular orientation towards naïve, routine or sophisticated problem solving behaviours. This paper describes common problem solving behaviours and details three individual cases involving naïve, routine and sophisticated problem solvers.     

Bayesian modeling of several covariance matrices and some results on propriety of the posterior for linear regression with correlated and/or heterogeneous errors

We explore simultaneous modeling of several covariance matrices across groups using the spectral (eigenvalue) decomposition and modified Cholesky decomposition. We introduce several models for covariance matrices under different assumptions about the mean structure. We consider ‘dependence’ matrices, which tend to have many parameters, as constant across groups and/or parsimoniously modeled via a regression formulation. For ‘variances’, we consider both unrestricted across groups and more parsimoniously modeled via log-linear models. In all these models, we explore the propriety of the posterior when improper priors are used on the mean and ‘variance’ parameters (and in some cases, on components of the ‘dependence’ matrices). The models examined include several common Bayesian regression models, whose propriety has not been previously explored, as special cases. We propose a simple approach to weaken the assumption of constant dependence matrices in an automated fashion and describe how to compute Bayes factors to test the hypothesis of constant ‘dependence’ across groups. The models are applied to data from two longitudinal clinical studies.     

Global attractivity and permanence of a delayed SVEIR epidemic model with pulse vaccination and saturation incidence

In this study, we formulate and analyze a new SVEIR epidemic disease model with time delay and saturation incidence, and analyze the dynamic behavior of the model under pulse vaccination. Using the discrete dynamical system determined by the stroboscopic map, we obtain an ‘infection-free’ periodic solution, further, show that the ‘infection-free’ periodic solution is globally attractive for some parameters of the model under appropriate conditions. The permanence of the model is investigated analytically. By computer simulation it is concluded that a large vaccination rate or a short pulse of vaccination or a long latent period are each a sufficient condition for the extinction of the disease.     

A group based solution strategy for multi-physics simulations in parallel

Multi-physics simulation often requires the solution of a suite of interacting physical phenomena, the nature of which may vary both spatially and in time. For example, in a casting simulation there is thermo-mechanical behaviour in the structural mould, whilst in the cast, as the metal cools and solidifies, the buoyancy induced flow ceases and stresses begin to develop. When using a single code to simulate such problems it is conventional to solve each ‘physics’ component over the whole single mesh, using definitions of material properties or source terms to ensure that a solved variable remains zero in the region in which the associated physical phenomenon is not active. Although this method is secure, in that it enables any and all the ‘active’ physics to be captured across the whole domain, it is computationally inefficient in both scalar and parallel. An alternative, known as the ‘group’ solver approach, involves more formal domain decomposition whereby specific combinations of physics are solved for on prescribed sub-domains. The ‘group’ solution method has been implemented in a three-dimensional finite volume, unstructured mesh multi-physics code, which is parallelised, employing a multi-phase mesh partitioning capability which attempts to optimise the load balance across the target parallel HPC system. The potential benefits of the ‘group’ solution strategy are evaluated on a class of multi-physics problems involving thermo-fluid–structural interaction on both a single and multi-processor systems. In summary, the ‘group’ solver is a third faster on a single processor than the single domain strategy and preserves its scalability on a parallel cluster system.     

A Numerical Comparison of Some Modified Controlled Random Search Algorithms

In this paper we propose a new version of the Controlled Random Search(CRS) algorithm of Price. The new algorithmhas been tested on thirteen global optimization test problems. Numericalexperiments indicate that the resulting algorithm performs considerablybetter than the earlier versions of the CRS algorithms. The algorithm,therefore, could offer a reasonable alternative to many currently availablestochastic algorithms, especially for problems requiring direct searchtype methods. Also a classification of the CRS algorithms is made based onglobal technique – local technique and the relative performance ofclasses is numerically explored.     

Line-of-sight rendezvous

We consider the rendezvous problem faced by two mobile agents, initially placed according to a known distribution on intersections in Manhattan (nodes of the integer lattice Z²). We assume they can distinguish streets from avenues (the two axes) and move along a common axis in each period (both to an adjacent street or both to an adjacent avenue). However they have no common notion of North or East (positive directions along axes). How should they move, from node to adjacent node, so as to minimize the expected time required to ‘see’ each other, to be on a common street or avenue. This is called ‘line-of-sight’ rendezvous. It is equivalent to a rendezvous problem where two rendezvousers attempt to find each other via two means of communication.     

A note on the minimum bounded edge-partition of a tree

Minimum bounded edge-partition divides the edge set of a tree into the minimum number of disjoint connected components given a maximum weight for any component. It is an adaptation of the uniform edge-partition of a tree. An optimization algorithm is developed for this NP-hard problem, based on repeated bin packing of inter-related instances. The algorithm has linear running time for the class of ‘balanced trees’ common for the stochastic programming application which motivated investigation of this problem.Fast 2-approximation algorithms are formed for general instances by replacing the optimal bin packing with almost any bin packing heuristic. The asymptotic worst-case ratio of these approximation algorithms is never better than the absolute worst-case ratio of the bin packing heuristic used.     

Weekly self-scheduling,forward contracting,and pool involvement for an electricity producer. An adaptive robust optimization approach

This paper addresses the optimization under uncertainty of the self-scheduling, forward contracting, and pool involvement of an electricity producer operating a mixed power generation station, which combines thermal, hydro and wind sources, and uses a two stage adaptive robust optimization approach. In this problem the wind power production and the electricity pool price are considered to be uncertain, and are described by uncertainty convex sets. To solve this problem, two variants of a constraint generation algorithm are proposed, and their application and characteristics discussed. Both algorithms are used to solve two case studies based on two producers, each operating equivalent generation units, differing only in the thermal units’ characteristics. Their market strategies are investigated for three different scenarios, corresponding to as many instances of electricity price forecasts. The effect of the producers’ approach, whether conservative or more risk prone, is also investigated by solving each instance for multiple values of the so-called budget parameter. It was possible to conclude that this parameter influences markedly the producers’ strategy, in terms of scheduling, profit, forward contracting, and pool involvement. These findings are presented and analyzed in detail, and an attempted rationale is proposed to explain the less intuitive outcomes. Regarding the computational results, these show that for some instances, the two variants of the algorithms have a similar performance, while for a particular subset of them one variant has a clear superiority.     

Auditors’ evidence evaluation and aggregation using beliefs and probabilities

This paper examines possible differences in auditors’ performance when they make belief-based versus probability-based risk assessments by focusing on two phases of the financial statement audit process: the assessment of two attributes of audit evidence (‘strength’ and ‘direction’) and the aggregation of evidence. Based on an experiment in which 48 experienced auditors participated, three important findings were observed. First, there was no significant difference in the mean assessment of strength of evidence measured using the likelihood ratio. However, the difference in the assessed direction of evidence, that is whether the evidence is interpreted as being confirming or disconfirming, is significant for one of the cases examined. This result shows that auditors making belief-based assessments are able to assess the direction of the evidence more accurately than auditors making probability-based assessments. Third, the auditors’ aggregation of evidence was not in accordance with ‘AND’ logic for either auditors making belief-based or probability-based assessments. These empirical results raise issues which need to be addressed in practice and in future research.     

Efficiency and equity in private and public education: A nonparametric comparison

We present a nonparametric approach for (1) efficiency and (2) equity evaluation in education. Firstly, we use a nonparametric (Data Envelopment Analysis) model that is specially tailored to assess educational efficiency at the pupil level. The model accounts for the fact that typically minimal prior structure is available for the behavior (objectives and feasibility set) under evaluation. It allows for uncertainty in the data, while it corrects for exogenous ‘environmental’ characteristics that are specific to each pupil. Secondly, we propose two multidimensional stochastic dominance criteria as naturally complementary aggregation criteria for comparing the performance of different school types (private and public schools). While the first criterion only accounts for efficiency, the second criterion also takes equity into consideration. The model is applied for comparing private (but publicly funded) and public primary schools in Flanders. Our application finds that no school type robustly dominates another type when controlling for the school environment and taking equity into account. More generally, it demonstrates the usefulness of our nonparametric approach, which includes environmental and equity considerations, for obtaining ‘fair’ performance comparisons in the public sector context.     

Construction of a model towards EOQ and pricing strategy for gradually obsolescent products

Due to the rapid advance of technology, manufacturers’ marketing models and quickly changing consumer tastes, products such as apparel, clothing accessories and consumer electronics are likely to face the problem of short product life cycles. This study deals with the problem of determining order quantity and multi-discount selling prices for these types of gradually obsolescent products, in which two novel proposals are presented as follows: (1) without considering any exogenous factors that could affect demand, we develop a time-dependent demand model that appropriately portrays an integrated demand behavior associated with the characteristic of obsolescence; (2) we then treat the selling price as an exogenous factor influencing demand and, referring to the linear demand D = α − βp, the effect that “the increase of demand due to price change is linearly correlated with the difference between two consecutive selling prices” is incorporated, so as to make the demand model be a function of both time and selling price. Afterwards, optimization models are hereby formulated to predetermine pricing strategy with a limited number of price changes by maximizing retailer’s profit. As a result, numerical examples illustrate that the multi-discount model indeed provides higher total profit than a single discount one. This is presented along with the result analysis conducted to gain some managerial insights.