Delivery of Devolve Social Services: Its Contributions to the Socio-economic Conditions of Women in Columbio Sultan Kudarat

This is an evaluative study on the delivery of devolved programs in health, agriculture and social welfare. It aimed to identify the major devolved programs/projects implemented by the LGU of Columbio, Sultan Kudarat; the responsiveness of the actual delivery of devolve services in terms of human resources, facilities and fund allocation; the status of devolve services implemented if it was effective and efficient; and the inadequacies encountered. The “expose facto” method of research was used. There were 49 implementers and 132 beneficiaries of the various devolved programs. There were 181 total respondents. A four-part questionnaire was constructed and the gathered data were supplemented by information extracted through interviews with Key Informants, Focus Group Discussions and document analysis. There were three departments implementing the devolved social services programs such as the Municipal Health Office with 6 devolved health programs; the Municipal Agriculturist Office with 6 devolved agricultural projects; and the Municipal Social Welfare and Development Office with 7 devolved social welfare programs. The respondents rated the implementation of devolve services in health, agriculture and social welfare programs between rank 5 to 9 for the aspects of human resources, facilities and fund allocations. The respondents assessed the implementation of devolved programs as Very Efficient and Most Responsive programs to the needs of the people specially the children, youths and women. The study also found some inadequacies observed during the implementation of devolved social services programs which were Agreed by the majority of the respondents. These findings implied that the implementation of various devolved social services for several years has made a significant difference in the lives of the people of the Municipality of Columbio, Sultan Kudarat, the Local Government of Columbio and program implementers with their commitment and solidarity to serve the people especially the marginalized is a manifestation of their unselfish dedication to uplift the socio-economic condition and well-being of the people. Hence, continuing projects should further be strengthened and supported to ensure the sustainability of the projects even if the support of different institutions has been terminated.     

Buchbesprechungen

Ohne Zusammenfassung     

Das Karriereplateau

The career-plateau as challenge to enterprises, employees and consultantsThe authors intend to link life-span-psychology to career-research in order to make understand the phenomenon of career-plateau and how individuals and organisations can deal with it. People take stock in the middle of their lives and assess their personal or professional targets. This process often relates to a personal crisis, especially when the success rate of a job is an important part of the self-concept and hierarchical development has stopped simultaneously. Nevertheless, the desire for a career continues to exist. On top of that what makes it even harder is that the individual has to work at least 20 more years because of demographic reasons. We assume that the way how to manage this crisis has a big influence on performance motivation and that life-span-orientated management development can help the individual to overcome the crisis or even prevent it.     

Coaching von Schlaganfallpatienten Ein integratives Beratungs- und Trainingskonzept

Coaching of patients after apoplexy — an integrative model of counselling and trainingIn contrast to common assessments of medical professionals, improvements in rehabilitation of patients after an apoplexy are possible even after a greater time interval. The progresses are small, but they improve gradually the quality of life of the patients. The author presents an integrative model of counselling and training for this clientele, in order to accompany the way of the patients to a successful professional rehabilitation and to a new conduct of life.     

Führung aus neuer Perspektive

New perspectives on leadership. Reflecting and constructing realities in the surplus reality of psychodramaThe authors show how the psychodramatic concept of surplus reality can be used as a frame of reference for action-oriented, experiential interventions in leadership coaching. The concept is shown to have four different facets: surplus reality as a term for (1) the intangible dimensions of reality, (2) the non-verbal dimensions of reality, (3) the action space of psychodrama, (4) human imagination. The use of mental imagery and metaphors is shown to be a realization of the surplus reality principle. Case studies and practical hints for leadership coaches illustrate how surplus reality can be used to open up new ways of learning.     

Beheimatungsprozesse begleiten — ein Werkstattbericht

Supporting processes of belonging in supervision and coachingThe contemporary employee has to cope with frequent changes. Not only does he lose his familiar environment, he also has to find ways to familiarize himself with new places and to develop a fresh sense of belonging. This process can be understood and facilitated by interpreting the German concept of “Heimat“ as something we have to create ourselves. First experiences demonstrate the usefulness of this approach in coaching processes.     

Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem

In the binary single constraint Knapsack Problem, denoted KP, we are given a knapsack of fixed capacity c and a set of n items. Each item j, j = 1,...,n, has an associated size or weight w_j and a profit p_j. The goal is to determine whether or not item j, j = 1,...,n, should be included in the knapsack. The objective is to maximize the total profit without exceeding the capacity c of the knapsack. In this paper, we study the sensitivity of the optimum of the KP to perturbations of either the profit or the weight of an item. We give approximate and exact interval limits for both cases (profit and weight) and propose several polynomial time algorithms able to reach these interval limits. The performance of the proposed algorithms are evaluated on a large number of problem instances.     

On nonlinear multi-covering problems

In this paper we define the exact k-coverage problem, and study it for the special cases of intervals and circular-arcs. Given a set system consisting of a ground set of n points with integer demands \(\{d_0,\dots ,d_{n-1}\}\) and integer rewards, subsets of points, and an integer k, select up to k subsets such that the sum of rewards of the covered points is maximized, where point i is covered if exactly \(d_i\) subsets containing it are selected. Here we study this problem and some related optimization problems. We prove that the exact k-coverage problem with unbounded demands is NP-hard even for intervals on the real line and unit rewards. Our NP-hardness proof uses instances where some of the natural parameters of the problem are unbounded (each of these parameters is linear in the number of points). We show that this property is essential, as if we restrict (at least) one of these parameters to be a constant, then the problem is polynomial time solvable. Our polynomial time algorithms are given for various generalizations of the problem (in the setting where one of the parameters is a constant).     

On the odd girth and the circular chromatic number of generalized Petersen graphs

A class \(\mathcal{G}\) of simple graphs is said to be girth-closed (odd-girth-closed) if for any positive integer g there exists a graph \(\mathrm {G} \in \mathcal{G}\) such that the girth (odd-girth) of \(\mathrm {G}\) is \(\ge g\). A girth-closed (odd-girth-closed) class \(\mathcal{G}\) of graphs is said to be pentagonal (odd-pentagonal) if there exists a positive integer \(g^*\) depending on \(\mathcal{G}\) such that any graph \(\mathrm {G} \in \mathcal{G}\) whose girth (odd-girth) is greater than \(g^*\) admits a homomorphism to the five cycle (i.e. is \(\mathrm {C}_{_{5}}\)-colourable). Although, the question “Is the class of simple 3-regular graphs pentagonal?” proposed by Ne?et?il (Taiwan J Math 3:381–423, 1999) is still a central open problem, Gebleh (Theorems and computations in circular colourings of graphs, 2007) has shown that there exists an odd-girth-closed subclass of simple 3-regular graphs which is not odd-pentagonal. In this article, motivated by the conjecture that the class of generalized Petersen graphs is odd-pentagonal, we show that finding the odd girth of generalized Petersen graphs can be transformed to an integer programming problem, and using the combinatorial and number theoretic properties of this problem, we explicitly compute the odd girth of such graphs, showing that the class is odd-girth-closed. Also, we obtain upper and lower bounds for the circular chromatic number of these graphs, and as a consequence, we show that the subclass containing generalized Petersen graphs \(\mathrm {Pet}(n,k)\) for which either k is even, n is odd and \(n\mathop {\equiv }\limits ^{k-1}\pm 2\) or both n and k are odd and \(n\ge 5k\) is odd-pentagonal. This in particular shows the existence of nontrivial odd-pentagonal subclasses of 3-regular simple graphs.     

The no-wait job shop with regular objective: a method based on optimal job insertion

The no-wait job shop problem (NWJS-R) considered here is a version of the job shop scheduling problem where, for any two operations of a job, a fixed time lag between their starting times is prescribed. Also, sequence-dependent set-up times between consecutive operations on a machine can be present. The problem consists in finding a schedule that minimizes a general regular objective function. We study the so-called optimal job insertion problem in the NWJS-R and prove that this problem is solvable in polynomial time by a very efficient algorithm, generalizing a result we obtained in the case of a makespan objective. We then propose a large neighborhood local search method for the NWJS-R based on the optimal job insertion algorithm and present extensive numerical results that compare favorably with current benchmarks when available.