Distance measure and the p-median problem in rural areas

The p-median model is used to locate P facilities to serve a geographically distributed population. Conventionally, it is assumed that the population patronize the nearest facility and that the distance between the resident and the facility may be measured by the Euclidean distance. Carling, Han, and Håkansson (2012) compared two network distances with the Euclidean in a rural region witha sparse, heterogeneous network and a non-symmetric distribution of thepopulation. For a coarse network and P small, they found, in contrast to the literature, the Euclidean distance to be problematic. In this paper we extend their work by use of a refined network and study systematically the case when P is of varying size (2-100 facilities). We find that the network distance give as gooda solution as the travel-time network. The Euclidean distance gives solutions some 2-7 per cent worse than the network distances, and the solutions deteriorate with increasing P. Our conclusions extend to intra-urban location problems.

Understanding criminal behaviour: identifying psychological differences between domestically violent offenders and non-offenders

Numerous theories have been formulated in an attempt to explain the psychological differences between violent offenders and non-offenders. Constructs that have emerged as salient in such scholarship include anger expression, social problem solving, locus of control, attitudes toward women, impulsivity and temper. Although a considerable amount of sound research has been conducted into 'violent offending' per se, in general terms, research into family and domestic violence is yet to be as methodologically and theoretically rigorous. In an attempt to link these areas of work, and to identify the risk factors (or 'criminogenic needs') of specific sub-groups of male offenders, this research compared: (I) property offenders, (2) those who had been· 'violent against strangers', (3) those who had been 'violent against intimates' and (4) non-offenders. In an effort to address one of the shortcomings of prior research, potentially confounding variables such as age, education level cultural identity, and socio-economic status were controlled for in an effort to arrive at more meaningful representations of each offender group's specific psychological deficits and abundances. A number of differences were highlighted between the groups, but few of these remained after demographic
covariates were controlled for. This paper details the nature of these differences, while also proposing that future studies adopt a similar methodology.

Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

The Asymmetric Travelling Salesman Problem with Replenishment Arcs (RATSP) is a new class of problems arising from work related to aircraft routing. Given a digraph with cost on the arcs, a solution of the RATSP, like that of the Asymmetric Travelling Salesman Problem, induces a directed tour in the graph which minimises total cost. However the tour must satisfy additional constraints: the arc set is partitioned into replenishment arcs and ordinary arcs, each node has a non-negative weight associated with it, and the tour cannot accumulate more than some weight limit before a replenishment arc must be used. To enforce this requirement, constraints are needed. We refer to these as replenishment constraints.

In this paper, we review previous polyhedral results for the RATSP and related problems, then prove that two classes of constraints developed in V. Mak and N. Boland [Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Technical Report TR M05/03, School of Information Technology, Deakin University, 2005] are, under appropriate conditions, facet-defining for the RATS polytope.

Not the same : a comparison of female and male clients seeking treatment from problem gambling counselling services

Previous studies of problem gamblers portray this group as being almost exclusively male. However, this study demonstrates that females comprised 46% of the population (n = 1,520) of persons who sought assistance due to concerns about their gambling from the publicly-funded BreakEven counselling services in the state of Victoria, Australia, in one 12-month period. This suggests that the model of service delivery which is community based counselling on a non-residential basis may be better able to attract female clients than treatment centres where males predominate such as veterans centres. A comparative analysis of the social and demographic characteristics of female and male gamblers within the study population was undertaken. As with previous studies, we have found significant differences between males and females who have sought help for problems associated with their gambling. Gender differences revealed in this study include females being far more likely to use electronic gaming machines (91.1% vs. 61.4%), older (39.6 years vs. 36.1 years), more likely to be born in Australia (79.4% vs. 74.7%), to be married (42.8% vs. 30.2%), living with family (78.9% vs. 61.5%) and to have dependent children (48.4% vs. 35.7%), than males who present at these services. Female gamblers (A$7,342) reported average gambling debts of less than half of that owed by males (A$19,091). These gender differences have implications for the development and conduct of problem gambling counselling services as it cannot be assumed that models of service which have demonstrated effectiveness with males will be similarly effective with females.

Fuzzy clustering of non-convex patterns using global optimization

This paper discusses various extensions of the classical within-group sum of squared errors functional, routinely used as the clustering criterion. Fuzzy c-means algorithm is extended to the case when clusters have irregular shapes, by representing the clusters with more than one prototype. The resulting minimization problem is non-convex and non-smooth. A recently developed cutting angle method of global optimization is applied to this difficult problem

Parallelization of the discrete gradient method of non-smooth optimization and its applications

We investigate parallelization and performance of the discrete gradient method of nonsmooth optimization. This derivative free method is shown to be an effective optimization tool, able to skip many shallow local minima of nonconvex nondifferentiable objective functions. Although this is a sequential iterative method, we were able to parallelize critical steps of the algorithm, and this lead to a significant improvement in performance on multiprocessor computer clusters. We applied this method to a difficult polyatomic clusters problem in computational chemistry, and found this method to outperform other algorithms.

Blind equalization of non-irreducible channels driven by MPSK signals

This paper deals with the problem of blind equalization of finite-impulse-response (FIR) and multiple-input multiple-output (MIMO) channels excited by M-ary phase shift keying (MPSK) signals. It is known that the algorithms based on the constant modulus (CM) criterion can equalize an FIR MIMO channel that is irreducible. The irreducible condition is restrictive since it requires that all source signals arrive at the receiving antennas simultaneously. In this paper, we show that the CM criterion can also be used to construct a zero-forcing equalizer for a channel that is non-irreducible. We also derive a lower bound for the order of the equalizer. The proposed result is validated by numerical simulations.

Problem of precision missile guidance: LQR and H‡ control frameworks

Addressed here is the precision missile guidance problem where the successful intercept criterion has been defined in terms of both minimizing the miss distance and controlling the missile body attitude with respect to the target at the terminal point. We show that the H∞ control theory, when suitably modified, provides an effective framework for the precision missile guidance problem. The existence of feedback controllers (guidance laws) is investigated for the case of finite horizon and non-zero initial conditions. Both state feedback and output feedback implementations are explored.

Sex-role traits and the comorbidity of symptoms of disordered eating and problem drinking

The symptoms of problem drinking and disordered eating were studied independently in relation to sex-role traits and also for evidence of comorbidity in a student sample of 217 women. The participants completed surveys that assessed positive and negative sex-role traits, reported drinking levels, alcohol dependence, problem drinking, bulimic symptoms, dietary restraint, and drive for thinness. Eating symptoms were related to both the negative and positive traits of Femininity, but self-descriptions involving negative traits (passivity, dependence, unassertiveness, etc.) showed the strongest relationship. High scores on identification with the traits typically labelled as Masculinity were related to drinking but there was an important difference between drinking per se (which was related to Positive Masculinity) and drinking found to be associated with drinking problems, which was related to Negative Masculinity (aggression, showing-off, rudeness, etc.). Feminine traits were also related to drinking. Low identification with the traits of Negative Femininity was associated with non-problem drinking, whereas low identification with the traits of Positive Femininity were associated with problem-related drinking. Young women who displayed comorbid symptoms described themselves by a high identification with the traits of both Negative Masculinity and Negative Femininity. It was argued that comorbidity reveals a more extreme form of the sex-role conflict previously described in relation to disordered control over both eating and drinking when considered independently.

Non-smooth optimization methods for computation of the conditional value-at-risk and portfolio optimization

We examine numerical performance of various methods of calculation of the Conditional Value-at-risk (CVaR), and portfolio optimization with respect to this risk measure. We concentrate on the method proposed by Rockafellar and Uryasev in (Rockafellar, R.T. and Uryasev, S., 2000, Optimization of conditional value-at-risk. Journal of Risk, 2, 21-41), which converts this problem to that of convex optimization. We compare the use of linear programming techniques against a non-smooth optimization method of the discrete gradient, and establish the supremacy of the latter. We show that non-smooth optimization can be used efficiently for large portfolio optimization, and also examine parallel execution of this method on computer clusters.

Problem and solution trees : a practical approach for identifying potential interventions to improve population nutrition

Population nutrition problems have a diversity of contributory factors and, ideally, multi-sectoral solutions should be developed by the relevant stakeholders, based on a common understanding of these factors. The problem and solution tree approach is a participatory process of working through the layers of determinants and then developing potential interventions for a specific issue, using the available data and expertise. We tailored this approach for non-communicable disease-related nutrition problems in Pacific Islands and applied it in several countries. The process led to the identification of a considerable range of determinants of unhealthy diets and potential interventions to improve the situation. This practical approach also offered the additional benefit of developing stakeholder awareness in the issues. Problem trees are a relatively simple tool to implement, easy to adapt to differing needs, can generate a wealth of information and can be more widely used.

A study of the concurrent execution of parallel and sequential applications on a non-dedicated cluster

Computers of a non-dedicated cluster are often idle (users attend meetings, have lunch or coffee breaks) or lightly loaded (users carry out simple computations to support problem solving activities). These underutilised computers can be employed to execute parallel applications. Thus, these computers can be shared by parallel and sequential applications, which could lead to the improvement of their execution performance. However, there is a lack of experimental study showing the applications’ performance and the system utilization of executing parallel and sequential applications concurrently and concurrent execution of multiple parallel applications on a non-dedicated cluster. Here we present the result of an experimental study into load balancing based scheduling of mixtures of NAS Parallel Benchmarks and BYTE sequential applications on a very low cost non-dedicated cluster. This study showed that the proposed sharing provided performance boost as compared to the execution of the parallel load in isolation on a reduced number of computers and better cluster utilization. The results of this research were used not only to validate other researchers’ result generated by simulation but also to support our research mission of widening the use of non-dedicated clusters. Our promising results obtained could promote further research studies to convince universities, business and industry, which require a large amount of computing resources, to run parallel applications on their already owned non-dedicated clusters.