A spanning heuristic for the unordered and ordered matching identification problem

The matching identification problem (MIP) is a combinatoric search problem related to the fields of learning from examples, boolean functions, and knowledge acquisition. The MIP involves identifying a single “goal” item from a large set of items. Because there is commonly a cost associated with evaluating each guess, the goal item should be identified in as few guesses as possible. As in most search problems, the items have a similar structure, which allows an evaluation of each guessed item. In other words, each guessed item elicits partial information about the goal item, i.e. how similar the guess is to the goal. With this information the goal is more quickly identified.The unordered MIP has been studied by Mehrez and Steinberg (ORSA J. Comput. 7 (1995) 211) in which they proposed two different types of algorithms. The purpose of the present paper is to suggest an improved Spanning Heuristic algorithm. Its improvement increases as the problem size increases. Further results and comparisons are derived for the unordered and ordered cases.This research shows that when the search space is very large, it is better to inquire from items that are known not to be the goal (they have been ruled out by previous guesses), for the purpose of acquiring more information about the goal. As the search space is narrowed, it is better to guess items that have not been ruled out.     

Using a capabilities approach to understand poverty and social exclusion of psychiatric survivors

The purpose of this project is to better understand poverty and social exclusion of psychiatric survivors using a capabilities approach to social justice as part of a larger mixed-methods longitudinal study (N=380) in Ontario, Canada. Using thematic coding, four themes emerged: poverty, ‘You just try to survive’; stigma, ‘People treat you like trash’; belonging, ‘You feel like you don’t belong’; and shared concern and advocacy, ‘Everyone deserves housing’. This analysis provides a deeper understanding of poverty and other social determinants of experiences of psychiatric survivors, including the synergism of poverty and social exclusion.     

An algorithmic approach to construct D-optimal saturated designs for logistic model

In this paper, locally D-optimal saturated designs for a logistic model with one and two continuous input variables have been constructed by modifying the famous Fedorov exchange algorithm. A saturated design not only ensures the minimum number of runs in the design but also simplifies the row exchange computation. The basic idea is to exchange a design point with a point from the design space. The algorithm performs the best row exchange between design points and points form a candidate set representing the design space. Naturally, the resultant designs depend on the candidate set. For gain in precision, intuitively a candidate set with a larger number of points and the low discrepancy is desirable, but it increases the computational cost. Apart from the modification in row exchange computation, we propose implementing the algorithm in two stages. Initially, construct a design with a candidate set of affordable size and then later generate a new candidate set around the points of design searched in the former stage. In order to validate the optimality of constructed designs, we have used the general equivalence theorem. Algorithms for the construction of optimal designs have been implemented by developing suitable codes in R.     

Testofen,a specialised Trigonella foenum-graecum seed extract reduces age-related symptoms of androgen decrease,increases testosterone levels and improves sexual function in healthy aging males in a double-blind randomised clinical study

This study examined the effect of Testofen, a specialised Trigonella foenum-graecum seed extract on the symptoms of possible androgen deficiency, sexual function and serum androgen concentrations in healthy aging males. This was a double-blind, randomised, placebo-controlled trial involving 120 healthy men aged between 43 and 70 years of age. The active treatment was standardised Trigonella foenum-graecum seed extract at a dose of 600?mg/day for 12 weeks. The primary outcome measure was the change in the Aging Male Symptom questionnaire (AMS), a measure of possible androgen deficiency symptoms; secondary outcome measures were sexual function and serum testosterone. There was a significant decrease in AMS score over time and between the active and placebo groups. Sexual function improved, including number of morning erections and frequency of sexual activity. Both total serum testosterone and free testosterone increased compared to placebo after 12 weeks of active treatment. Trigonella foenum-graecum seed extract is a safe and effective treatment for reducing symptoms of possible androgen deficiency, improves sexual function and increases serum testosterone in healthy middle-aged and older men.     

Parameter estimation of Lindley step stress model with independent competing risk under type 1 censoring

Abstract

In literature, Lindley distribution is considered as an alternative to exponential distribution to fit lifetime data. In the present work, a Lindley step-stress model with independent causes of failure is proposed. An algorithm to generate random samples from the proposed model under type 1 censoring scheme is developed. Point and interval estimation of the model parameters is carried out using maximum likelihood method and percentile bootstrap approach. To understand the effectiveness of the resulting estimates, numerical illustration is provided based on simulated and real-life data sets.     

Soziologische Theorie,Handlungstheorie, Methoden,Familiensoziologie, Sozialstrukturanalyse,Raumsoziologie, Stadtsoziologie,Gedächtnissoziologie,Religionssoziologie

Literaturbesprechungen

Soziologische Theorie, Handlungstheorie, Methoden, Familiensoziologie, Sozialstrukturanalyse, Raumsoziologie, Stadtsoziologie, Ged?chtnissoziologie, Religionssoziologie     

A characterization of linearizable instances of the quadratic minimum spanning tree problem

We investigate special cases of the quadratic minimum spanning tree problem (QMSTP) on a graph \(G=(V,E)\) that can be solved as a linear minimum spanning tree problem. We give a characterization of such problems when G is a complete graph, which is the standard case in the QMSTP literature. We extend our characterization to a larger class of graphs that include complete bipartite graphs and cactuses, among others. Our characterization can be verified in \(O(|E|^2)\) time. In the case of complete graphs and when the cost matrix is given in factored form, we show that our characterization can be verified in O(|E|) time. Related open problems are also indicated.     

Rewriting dominant narratives of the academy: women faculty of color and identity management

Drawing on Delgado and Yosso’s counterstory, Yosso’s community cultural wealth, and Alsup’s borderland discourses, the authors, who are women of color academics, use narratives from their lives to discuss the ways in which they draw on resources in managing and reconfiguring their multiple identities within the academy. These include identities of scholars, mentors, teachers, community members, mothers, and partners. They suggest that rather than merely being socialized into cultural reproduction, as much of the literature oriented toward women of color advises them to do in order to become successful, they seek to actually engage in transforming their roles and that of the academy by consciously and repeatedly making present and visible facets of identity that have previously been more-or-less absent in higher education. By presenting these counter-narratives the authors attempt to engage with ways of self-positioning that are, especially for women of color in academia, not frequently discussed or presented.     

Global Robustness with Respect to the Loss Function and the Prior

We propose a class [I,S] of loss functions for modeling the imprecise preferences of the decision maker in Bayesian Decision Theory. This class is built upon two extreme loss functions I and S which reflect the limited information about the loss function. We give an approximation of the set of Bayes actions for every loss function in [I,S] and every prior in a mixture class; if the decision space is a subset of , we obtain the exact set.