Treatment of incarcerated, sexually-abused adolescent females: an outcome study

This study examined the psychosocial functioning of 100 adolescent females (ages 12-17) sentenced to secure care in a southeastern state and the impact of gender-specific, cognitive-behavioral therapy (CBT) intervention on the psychosocial functioning of subjects who reported a history of sexual abuse. The Multidimensional Adolescent Assessment Scale (MAAS) was used to assess psychosocial functioning. Pre-test scores on the MAAS revealed significantly higher scores on 12 of 16 dimensions of psychosocial functioning and higher rates of serious criminal behavior for youth who subsequently disclosed sexual abuse histories as compared to those without such histories. At post-test, statistically significant improvements in psychosocial functioning were observed on 14 of 16 MAAS subscales for those who received the CBT intervention. Thus, incarcerated female adolescents who reported a history of sexual abuse demonstrated more impairment in their functioning as compared to those without a reported history of sexual abuse and responded positively to gender-specific, CBT-based intervention.     

Obsessive-Compulsive Features in Pathological Lottery and Scratch-Ticket Gamblers

The results of this study support the notion that pathological gamblers drawn from the community would score higher on all three scores from the YBOCS than light gamblers. Consistent with hypotheses, pathological gamblers (lottery and scratch ticket) reported more obsessions, compulsions, and avoidance behavior than the light gamblers, and also reported having more urges to engage in injurious behaviors to themselves and others. These findings provide evidence that pathological gambling falls in a spectrum or family of disorders which have obsessive-compulsive disorder at its core. These findings support McElroy, Hudson, Philips, et al.'s (1993) suggestions of similarities between OCD and Impulse Control Disorders, and extend Blaszczynski (1999) findings of overlap between pathological gamblers and OCD in a treatment population. Heavy gamblers also reported significantly more hoarding symptoms and compulsive buying than light gamblers. More research in this area may show further evidence of a spectrum of disorders with obsessive compulsive disorder at its core, and show further links between impulse control disorders (such as pathological gambling) and OCD.     

On the outer-connected domination in graphs

A set S of vertices of a graph G is an outer-connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by V?S is connected. The outer-connected domination number $\widetilde{\gamma}_{c}(G)$ is the minimum size of such a set. We prove that if δ(G)≥2 and diam?(G)≤2, then $\widetilde{\gamma}_{c}(G)\le (n+1)/2$ , and we study the behavior of $\widetilde{\gamma}_{c}(G)$ under an edge addition.     

The topology aware file distribution problem

We present theoretical results for large-file distribution on general networks of known topology (known link bandwidths and router locations). We show that the problem of distributing a file in minimum time is NP-hard in this model, and we give an O(logn) approximation algorithm, where n is the number of workstations that require the file. We also characterize our method as optimal amongst the class of “no-link-sharing” algorithms.     

Resource smoothing: A cost minimization approach

From the available literature, there seems to be no defined approach to resource smoothing exercise except those attempted by Weist (1967, Management Science, 13, B359-B377) and Burgess and Killebrew (1962, Journal of Industrial Engineering, 13, 76-83). The aim of the smoothing exercise is to achieve optimal resource usage by avoiding high peaks and deep valleys in the project resource profile. The general approach has always been to move some activities with floats in the high peak regions to be started at a later date, and as this is done, the valleys will be filled to smooth the resource profile subject of course to time constraint. If this approach is followed as it is, it would be difficult to determine optimality especially when many resources are involved. A cost minimization approach is envisaged in the present study with no limitation on the number of resource inputs. In a situation where the resources are assumed to have the same value, the cost assigned to each of them should be similar. The method follows the general concept but with a difference; cost of the activity in question is considered. The exercise is continued until all the floats are exhausted. The optimum result would then be the one with the minimum cost profile. From examples used for the evaluation, the results obtained are comparable to those of the above two researchers, and some with better results in the majority of cases.     

Constrained production lot-size model with trade-credit policy: 'A comparison geometric programming approach via Lagrange'

In this paper our main objective is to investigate a deterministic inventory production lot-size model with a permissible delay in payment under a restriction. We analyse our deterministic inventory model under a restriction which will be assumed as the average inventory level. In fact we use in our analysis two approaches: the geometric programming approach; and the Lagrange method. Then a comparison between these two approaches is performed, which is our aim. Finally we deduce some previously published works of other researchers as special cases.     

Multi-item EOQ inventory model with varying holding cost under two restrictions: A geometric programming approach

In this paper we provide a simple method to determine the inventory policy of multiple items having varying holding cost using a geometric programming approach. The varying holding cost is considered to be a continuous function of the order quantity. The EOQ inventory model with constant holding cost and the classical EOQ inventory model without constraints are derived.     

One-machine scheduling to minimize mean tardiness with minimum number tardy

In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed. An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal.