Self-Reported Gambling-Related Suicidality Among Gambling Helpline Callers.

Problem gamblers often attribute suicidal ideation or attempts to their gambling. Logistic regression analyses were applied to data from problem gamblers (N = 986) calling a helpline. Problem gamblers reporting gambling-related suicidality (n = 252; 25.6%) were more likely than those denying it (n = 734; 74.4%) to acknowledge family, financial, legal, and mental and substance-related problems. Of problem gamblers acknowledging gambling-related suicidality, those reporting gambling-related suicide attempts (n = 53; 21.5%) were more likely than those denying them (n = 193; 78.5%) to acknowledge gambling-related illegal behaviors, mental health and substance abuse treatment, and family histories of alcohol problems, and were less likely to report prior gambling treatment. The findings suggest that increased gambling severity is associated with gambling-related suicidality. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

EnvironalPlanning: Analytic Network Process Model for Environmentally Conscious Construction Planning

Although the construction pollution index has been put forward and proved to be an efficient approach to reducing or mitigating pollution level during the construction planning stage, the problem of how to select the best construction plan based on distinguishing the degree of its potential adverse environmental impacts is still a research task. This paper first reviews environmental issues and their characteristics in construction, which are critical factors in evaluating potential adverse impacts of a construction plan. These environmental characteristics are then used to structure two decision models for environmental-conscious construction planning by using an analytic network process (ANP), including a complicated model and a simplified model. The two ANP models are combined and called the EnvironalPlanning system, which is applied to evaluate potential adverse environmental impacts of alternative construction plans.     

The Advice and Influence Networks of Transformational Leaders.

Existing transformational leadership research has focused primarily on the behaviors of leaders and their effects on followers. The authors extended this research by examining the social networks of managers who exhibit transformational leadership behaviors. Their focus was on the network of relationships that managers develop and whether they hold key positions in the organization's informal social networks. In a field study using data from 39 managers and 130 nonmanagement employees of 6 organizations, the authors found that managers who score higher on transformational leadership tend to hold more central positions in organizational advice and influence networks. Furthermore, the direct reports of these leaders were also more central in informal organizational networks. These results illuminate one of the ways that managers who exhibit transformational leadership behaviors may exert influence in organizations. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

L'échelle de dramatisation face à la douleur PCS-CF: Adaptation canadienne en langue fran?aise de l'échelle Pain Catastrophizing Scale.

This study examined the psychometric properties of the PCS-CF, a French-Canadian adaptation of the Pain Catastrophizing Scale (Sullivan, Bishop & Pivik, 1995). One hundred and twenty undergraduate students (83 women; 37 men) completed the PCS-CF and measures of anxiety and depression prior to immersing their hand in ice water for 1-minute. A subset of 39 participants (28 females; 11 males) also completed a second pain task involving an ascending series of electrocutaneous stimulations. Participants' verbal and non-verbal pain behaviours during and immediately after the immersion task were recorded and subsequently independently coded. Reliability analyses revealed that the PCS-CF total score and subscale scores have a high degree of internal consistency and test-retest reliabilities that are comparable to the original Pain Catastrophizing Scale. PCS-CF scores were associated with higher levels of self-reported pain during the ice water immersion task and decreased pain tolerance during electrocutaneous stimulation. Individuals with elevated PCS-CF scores also displayed a more diverse repertoire of pain behaviours than their low PCS-CF counterparts. Previous findings that catastrophizing scores are able to discriminate criterion groups of males and females were also replicated. Given the highly correlated factors obtained in analyses of the dimensionality of the PCS-CF, the structure suggested by the authors of the original scale is only partially supported. However, the results taken together suggest that the PCS-CF is both a reliable and valid measure of the pain catastrophizing construct that is psychometrically comparable to the original PCS. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

An integrated model for supplier selection process

0　ＩＮＴＲＯＤＵＣＴＩＯＮＩｎｔｏｄａｙ’ｓｈｉｇｈｌｙｃｏｍｐｅｔｉｔｉｖｅｍａｎｕｆａｃｔｕｒｉｎｇｅｎ ｖｉｒｏｎｍｅｎｔ,ｍａｎｕｆａｃｔｕｒｉｎｇｃｏｍｐａｎｉｅｓｍｕｓｔｃｏｎｓｔａｎｔｌｙａｓｋｔｈｅｍｓｅｌｖｅｓｔｈｅｓｅｔｏｕｇｈｑｕｅｓｔｉｏｎｓ :Ｄｏｗｅｈａｖｅｔｈｅｂｅｓｔｓｕｐｐｌｉｅｒｓａｔｔｈｅｌｏｗｅｓｔｐｏｓｓｉｂｌｅｐｒｉｃｅｓ?Ａｒｅｗｅｇｅｔｔｉｎｇａｎｄｓｅｎｄｉｎｇｍａｔｅｒｉａｌｓａｓｑｕｉｃｋｌｙａｓｐｏｓｓｉｂｌｅ ?Ａｄｄｉｔｉｏｎａｌｌｙ ,ｔｈｅ…     

Structurally noise resistant classifier for multi-modal person verification

In this letter we propose a piece-wise linear (PL) classifier for use as the decision stage in a two-modal verification system, comprised of a face and a speech expert. The classifier utilizes a fixed decision boundary that has been specifically designed to account for the effects of noisy audio conditions. Experimental results on the VidTIMIT database show that in clean conditions, the proposed classifier is outperformed by a traditional weighted summation decision stage (using both fixed and adaptive weights). Using white Gaussian noise to corrupt the audio data resulted in the PL classifier obtaining better performance than the fixed approach and similar performance to the adaptive approach. Using a more realistic noise type, namely “operations room” noise from the NOISEX-92 corpus, resulted in the PL classifier obtaining better performance than both the fixed and adaptive approaches. The better results in this case stem from the PL classifier not making a direct assumption about the type of noise that causes the mismatch between training and testing conditions (unlike the adaptive approach). Moreover, the PL classifier has the advantage of having a fixed (non-adaptive, thus simpler) structure.     

Remotely sensed indicators of habitat heterogeneity: Use of synthetic aperture radar in mapping vegetation structure and bird habitat

An integrated remote sensing/field ecology project linked the use of synthetic aperture radar (SAR) and aerial photography to studies of landscape spatial heterogeneity and bird community ecology. P-, L-, and C-band SAR data, collected over a section of Kakadu National Park in Australia's Northern Territory during the Joint NASA/Australia DC-8 data acquisition campaign, were analyzed in light of field data integrating vegetation structure and floristics with bird abundances across a heterogeneous study site. Results indicate that SAR data are able to discern structural differences relevant to bird habitat quality within floristically homogeneous stands, while multispectral sensors successfully identified floristic differences among habitat types. Simplifying indices of bird diversity showed ambiguous changes across the site; however, the abundances of individual species were observed to change significantly across both floristic and structural gradients. These results suggest that efforts to map bird diversity should focus on species-specific habitat relationships and that some measure of vegetation structure is needed to understand bird habitat. The approach employed here advances the use of SAR data in the three-dimensional mapping of animal habitats from remotely sensed data, and extends current capabilities for mapping and modeling large-scale patterns in the distribution of biological diversity.     

Preserving Topology by a Digitization Process

The main task of digital image processing is to recognize properties of real objects based on their digital images. These images are obtained by some sampling device, like a CCD camera, and represented as finite sets of points that are assigned some value in a gray-level or color scale. Based on technical properties of sampling devices, these points are usually assumed to form a square grid and are modeled as finite subsets of Z². Therefore, a fundamental question in digital image processing is which features in the digital image correspond, under certain conditions, to properties of the underlying objects. In practical applications this question is mostly answered by visually judging the obtained digital images. In this paper we present a comprehensive answer to this question with respect to topological properties. In particular, we derive conditions relating properties of real objects to the grid size of the sampling device which guarantee that a real object and its digital image are topologically equivalent. These conditions also imply that two digital images of a given object are topologically equivalent. This means, for example, that shifting or rotating an object or the camera cannot lead to topologically different images, i.e., topological properties of obtained digital images are invariant under shifting and rotation.     

Compact Mathematical Formulation for Graph Partitioning

The graph partitioning problem consists of dividing the vertices of a graph into clusters, such that the weight of the edges crossing between clusters is minimized. We present a new compact mathematical formulation of this problem, based on the use of binary representation for the index of clusters assigned to vertices. This new formulation is almost minimal in terms of the number of variables and constraints and of the density of the constraint matrix. Its linear relaxation brings a very fast computational resolution, compared with the standard one.Experiments were conducted on classical large benchmark graphs designed for comparing heuristic methods. On one hand, these experiments show that the new formulation is surprisingly less time efficient than expected on general k-partitioning problems. On the other hand, the new formulation applied on bisection problems allows to obtain the optimum solution for about ten instances, where only best upper bounds were previously known.