Youth gambling behaviors: An examination of the role of resilience.

The study of resilient children has overturned many deficit-focused models concerning the ontogenesis of children raised in adversity. This study explored the relationship between risk and protective factors, resilience, and youth gambling behavior. More specifically, this study examined the relative contribution of various risk and protective domains in relation to problem gambling behavior and examined whether youth identified as resilient (high risk exposure- high internalized protection) were as likely as those identified as vulnerable (high risk exposure-low internalized protection) to engage in excessive gambling behavior. The sample consisted of 1,273 students ages 12 to 19. The findings demonstrated that risk and protective factors each provide a unique contribution to the prediction model of gambling problems. Resilient and vulnerable youth differed significantly in their self-reported gambling severity. As well, resilient youth were not statistically distinguishable from low-risk exposure groups in terms of their gambling severity. Findings are interpreted with respect to resilience and prevention research. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Bin Packing with Rejection Revisited

We consider the following generalization of bin packing. Each item has a size in (0,1] associated with it, as well as a rejection cost, that an algorithm must pay if it chooses not to pack this item. The cost of an algorithm is the sum of all rejection costs of rejected items plus the number of unit sized bins used for packing all other items. We first study the offline version of the problem and design an APTAS for it. This is a non-trivial generalization of the APTAS given by Fernandez de la Vega and Lueker for the standard bin packing problem. We further give an approximation algorithm of an absolute approximation ratio 3/2, where this value is best possible unless P=NP.     

Two-dimensional online bin packing with rotation

In two-dimensional bin packing problems, the input items are rectangles which need to be packed in a non-overlapping manner. The goal is to assign the items into unit squares using an axis-parallel packing. Most previous work on online packing concentrated on items of fixed orientation, which must be assigned such that their bottom side is parallel to the bottom of the bin. In this paper we study the case of rotatable items, which can be rotated by ninety degrees. We give almost tight bounds on the (asymptotic) competitive ratio of bounded space bin packing of rotatable items, and introduce a new unbounded space algorithm. This improves the results of Fujita and Hada.     

Beyond performance: Feature awareness in personalized interfaces

Personalized graphical user interfaces have the potential to reduce visual complexity and improve interaction efficiency by tailoring elements such as menus and toolbars to better suit an individual user's needs. When an interface is personalized to make useful features more accessible for a user's current task, however, there may be a negative impact on the user's awareness of the full set of available features, making future tasks more difficult. To assess this tradeoff we introduce awareness as an evaluation metric to be used in conjunction with performance. We then discuss three studies we have conducted, which show that personalized interfaces tradeoff awareness of unused features for performance gains on core tasks. The first two studies, previously published and presented only in summary, demonstrate this tradeoff by measuring awareness using a recognition test of unused features in the interface. The studies also evaluated two different types of personalized interfaces: a layered interfaces approach and an adaptive split menu approach. The third study, presented in full, focuses on adaptive split menus and extends results from the first two studies to show that different levels of awareness also correspond to an impact on performance when users are asked to complete new tasks. Based on all three studies and a survey of related work, we outline a design space of personalized interfaces and present several factors that could affect the tradeoff between core task performance and awareness. Finally, we provide a set of design implications that should be considered for personalized interfaces.     

Investigating haptic distance-to-break using linear and nonlinear materials in a simulated minimally invasive surgery task

Accurate detection of mediated haptic information in minimally invasive surgery (MIS) is critical for applying appropriate force magnitudes onto soft tissue with the aim of minimising tissue trauma. Force perception in MIS is a dynamic process, with surgeons’ administration of force into tissue revealing information about the remote surgical site which further informs the surgeons’ haptic interactions. The relationship between applied force and material deformation rate provides biomechanical information specifying the deformation distance remaining until a tissue will fail: which is termed distance-to-break (DTB). The current study demonstrates that observers can detect DTB while deforming simulated tissues and stop before reaching the tissues’ failure points. The design of training simulators, control devices and automated robotic systems for applications outside of MIS is discussed.

Practitioner Summary: In MIS, haptic information is critical for applying appropriate forces onto soft tissue to minimise tissue trauma. Observers used force information to detect how far they could deform a virtual tissue before it would break. The design of training simulators, control devices and automated robotic systems is discussed.     

Selfish Bin Packing

Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by selfish agents. Each agent is charged with a cost according to the fraction of the used bin space its item requires. That is, the cost of the bin is split among the agents, proportionally to their sizes. Thus, the selfish agents prefer their items to be packed in a bin that is as full as possible. The social goal is to minimize the number of the bins used. The social cost in this case is therefore the number of bins used in the packing.     

Online scheduling with rejection and withdrawal

We study an online scheduling problem with rejection, in which some rearrangement of the solution is allowed. This problem is called scheduling with rejection and withdrawal. Each arriving job has a processing time and a rejection cost associated with it, and it needs to be either assigned to a machine or rejected upon arrival. At termination, it is possible to choose at most a fixed number of scheduled jobs and withdraw them (i.e., decide to reject them). We study the minimization version, where the goal is to minimize the sum of the makespan and the total rejection cost (which corresponds to the penalty), and the maximization problem, where the goal is to maximize the sum of the minimum load and the total rejection cost (which corresponds to profit). We study environments of machines, which are the case of m identical machines and the case of two uniformly related machines, and show a strong relation between these problems and the related classic online scheduling problems which they generalize, in contrast to standard scheduling with rejection, which typically makes the scheduling problems harder.     

Dieldrin in fish and shellfish from the Mersey Estuary and Liverpool Bay

OBJECT: The authors studied the reliability of a new method for noninvasive assessment of cerebral perfusion pressure (CPP) in head-injured patients in which mean arterial blood pressure (ABP) and transcranial Doppler middle cerebral artery mean and diastolic flow velocities are measured. METHODS: Cerebral perfusion pressure was estimated (eCPP) over periods of continuous monitoring (20 minutes-2 hours, 421 daily examinations) in 96 head-injured patients (Glasgow Coma Scale score < 13) who were admitted to the intensive care unit. All patients were sedated, paralyzed, and ventilated. The eCPP and the measured CPP (ABP minus intracranial pressure, measured using an intraparenchymal microsensor) were compared. The correlation between eCPP and measured CPP was r=0.73; p < 10(-6). In 71% of the examinations, the estimation error was less than 10 mm Hg and in 84% of the examinations, the error was less than 15 mm Hg. The method had a high positive predictive power (94%) for detecting low CPP (< 60 mm Hg). The eCPP also accurately reflected changes in measured CPP over time (r > 0.8; p < 0.001) in situations such as plateau and B waves of intracranial pressure, arterial hypotension, and refractory intracranial hypertension. A good correlation was found between the average measured CPP and eCPP when day-by-day variability was assessed in a group of 41 patients (r=0.71). CONCLUSIONS: Noninvasive estimation of CPP by using transcranial Doppler ultrasonography may be of value in situations in which monitoring relative changes in CPP is required without invasive measurement of intracranial pressure.