U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Bjorling problem for timelike surfaces in the Lorentz-Minkowski space

We solve the Bjorling problem for timelike surfaces in the Lorentz-Minkowski space through a split-complex representation formula obtained for this kind of surface. Our approach uses the split-complex numbers and natural split-holomorphic extensions. As applications, we show that the minimal timelike surfaces of revolution as well as minimal ruled timelike surfaces can be characterized as solutions of certain adequate Bjorling problems in the Lorentz-Minkowski space. (C) 2010 Elsevier Inc. All rights reserved.

A FREE BOUNDARY ISOPERIMETRIC PROBLEM IN HYPERBOLIC 3-SPACE BETWEEN PARALLEL HOROSPHERES

We investigate the isoperimetric problem of finding the regions of prescribed volume with minimal boundary area between two parallel horospheres in hyperbolic 3-space (the part of the boundary contained in the horospheres is not included). We reduce the problem to the study of rotationally invariant regions and obtain the possible isoperimetric solutions by studying the behavior of the profile curves of the rotational surfaces with constant mean curvature in hyperbolic 3-space. We also classify all the connected compact rotational surfaces M of constant mean curvature that are contained in the region between two horospheres, have boundary partial derivative M either empty or lying on the horospheres, and meet the horospheres perpendicularly along their boundary.

New classes of spatial central configurations for the n+3-body problem

In this paper, we show the existence of new families of spatial central configurations for the n + 3-body problem, n >= 3. We study spatial central configurations where n bodies are at the vertices of a regular n-gon T and the other three bodies are symmetrically located on the straight line that is perpendicular to the plane that contains T and passes through the center of T. The results have simple and analytic proofs. (c) 2010 Elsevier Ltd. All rights reserved.

Stacked central configurations for the spatial six-body problem

In this paper we show the existence of three new families of stacked spatial central configurations for the six-body problem with the following properties: four bodies are at the vertices of a regular tetrahedron and the other two bodies are on a line connecting one vertex of the tetrahedron with the center of the opposite face. (c) 2009 Elsevier B.V. All rights reserved.

Introducing Undergraduate Students to Science

Understanding the scientific method fosters the development of critical thinking and logical analysis of information. Additionally, proposing and testing a hypothesis is applicable not only to science, but also to ordinary facts of daily life. Knowing the way science is done and how its results are published is useful for all citizens and mandatory for science students. A 60-h course was created to offer undergraduate students a framework in which to learn the procedures of scientific production and publication. The course`s main focus was biochemistry, and it was comprised of two modules. Module I dealt with scientific articles, and Module II with research project writing. Module I covered the topics: 1) the difference between scientific knowledge and common sense, 2) different conceptions of science, 3) scientific methodology, 4) scientific publishing categories, 5) logical principles, 6) deductive and inductive approaches, and 7) critical reading of scientific articles. Module II dealt with 1) selection of an experimental problem for investigation, 2) bibliographic revision, 3) materials and methods, 4) project writing and presentation, 5) funding agencies, and 6) critical analysis of experimental results. The course adopted a collaborative learning strategy, and each topic was studied through activities performed by the students. Qualitative and quantitative course evaluations with Likert questionnaires were carried out at each stage, and the results showed the students` high approval of the course. The staff responsible for course planning and development also evaluated it positively. The Biochemistry Department of the Chemistry Institute of the University of Sao Paulo has offered the course four times.

Temperature and common-ion effect on magnesium oxide (MgO) hydration

MgO based refractory castables draw wide technological interest because they have the versatility and installation advantages of monolithic refractories with intrinsic MgO properties, such as high refractoriness and resistance to basic slag corrosion. Nevertheless, MgO easily reacts with water to produce Mg(OH)(2), which is followed by a large volumetric expansion, limiting its application in refractory castables. In order to develop solutions to minimize this effect, a better understanding of the main variables involved in this reaction is required. In this work, the influence of temperature, as well as the impact of the chemical equilibrium shifting (known as the common-ion effect), on MgO hydration was evaluated. Ionic conductivity measurements at different temperatures showed that the MgO hydration reaction is accelerated with increasing temperature. Additionally, different compounds were added to evaluate their influence on the reaction rate. Among them, CaCl(2) delayed the reaction, whereas KOH showed an opposite behavior. MgCl(2) and MgSO(4) presented similar results and two other distinct effects, reaction delay and acceleration, which depended on their concentration in the suspensions. The results were evaluated by considering the kinetics and the thermodynamics of the reaction, and the mechanical damages in the samples that was caused by the hydration reaction. (C) 2009 Elsevier Ltd and Techna Group S.r.l. All rights reserved.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

Spanning Tree Approach On The Snow Cleaning Problem

Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning purpose. In this thesis we generate a shortest road network of the city and put the depots in different place of the city for snow cleaning. We generate shortest road network using minimum spanning tree algorithm and find the depots position using greedy heuristic. When snow is falling, vehicles start work from the depots and clean the snow all the road network of the city. We generate two types of model. Models are economic model and efficient model. Economic model provide good economical solution of the problem and it use less number of vehicles. Efficient model generate good efficient solution and it take less amount of time to clean the entire road network.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

Essentialism i religionsundervisningen : Ett religionsdidaktiskt problem

Essentialist concepts of religion are common in the teaching of religion in schools and to a certain extent also in the academic discipline of religious studies. In this article, a number of problems with essentialist perceptions of religion are discussed. In the first part of the article a thesis is maintained, according to which essentialist conceptions of religion or specific religions are too limited to be of value in the teaching of religion. This is done through examples of essentialist expressions about religion. The examples are grouped according to a typology of different kinds of essentialism. Two main categories, each with two sub-categories are identified. Thus, the category of essentialism regarding the substance of religion is divided into transcendental or theological essentialism (which presupposes the existence of a sacred power of some kind, the experience of which is the basis for religion), and core essentialism (where it is presupposed that certain ideas or concepts constitute religion as a general category or specific religions). Likewise, the category of essentialism regarding the function of religion has two sub-categories: positive and negative essentialism. These kinds of essentialism presuppose that religion or specific religions are inherently good or harmful respectively to human beings. Examples from each of these categories are given and discussed. In the second part of the article, Benson Saler’s open concept of religion is presented as an alternative to essentialist or bounded perceptions. It is based on Ludwig Wittgenstein’s idea of family resemblances and on prototype theory. In connection with this, it is argued that a certain kind of conscious ethnocentrism is needed as a point of departure in the study and teaching of religion. The metaphor of education as a journey from the familiar out into the unfamiliar and back again is suggested as a possible pattern for such teaching. Finally,some examples of non-essentialist ways to introduce religions are offered.

Health care providers' perceptions of and attitudes towards induced abortions in sub-Saharan Africa and Southeast Asia : a systematic literature review of qualitative and quantitative data.

BACKGROUND: Unsafe abortions are a serious public health problem and a major human rights issue. In low-income countries, where restrictive abortion laws are common, safe abortion care is not always available to women in need. Health care providers have an important role in the provision of abortion services. However, the shortage of health care providers in low-income countries is critical and exacerbated by the unwillingness of some health care providers to provide abortion services. The aim of this study was to identify, summarise and synthesise available research addressing health care providers' perceptions of and attitudes towards induced abortions in sub-Saharan Africa and Southeast Asia. METHODS: A systematic literature search of three databases was conducted in November 2014, as well as a manual search of reference lists. The selection criteria included quantitative and qualitative research studies written in English, regardless of the year of publication, exploring health care providers' perceptions of and attitudes towards induced abortions in sub-Saharan Africa and Southeast Asia. The quality of all articles that met the inclusion criteria was assessed. The studies were critically appraised, and thematic analysis was used to synthesise the data. RESULTS: Thirty-six studies, published during 1977 and 2014, including data from 15 different countries, met the inclusion criteria. Nine key themes were identified as influencing the health care providers' attitudes towards induced abortions: 1) human rights, 2) gender, 3) religion, 4) access, 5) unpreparedness, 6) quality of life, 7) ambivalence 8) quality of care and 9) stigma and victimisation. CONCLUSIONS: Health care providers in sub-Saharan Africa and Southeast Asia have moral-, social- and gender-based reservations about induced abortion. These reservations influence attitudes towards induced abortions and subsequently affect the relationship between the health care provider and the pregnant woman who wishes to have an abortion. A values clarification exercise among abortion care providers is needed.

Generationsväxling i offentlig sektor : En kvalitativ studie om det kommunala arbetet medpensionsavgångar

Denna studie syftar till att undersöka hur en medelstor kommun kan arbeta strategiskt med problematiken gällande kompetensförlust samt att vara en attraktiv arbetsgivare inför kommande pensionsavgångar. Vidare syftar studien till att, utifrån resultatet, arbeta fram ett förslag till HR-strategi för den problematik de förestående pensionsavgångarna för med sig. För att få svar på våra undersökningsfrågor har vi utfört en fallstudie i Falu kommun och för denna använt oss av semistrukturerade intervjuer med fyra personer i chefsposition och en mångfaldskommunikatör, samt en fokusgrupp bestående av fyra medarbetare från HR-avdelningen. Detta gav oss flera perspektiv på problematiken, vilket vi anser stärker tillförlitligheten i resultatet. I efterhand kan vi dock se att ett större antal intervjupersoner hade varit att föredra, detta för att få fler medarbetares tankar och åsikter om ämnet. Emellertid var detta inte möjligt då chefer i kommunen var svåra att få kontakt med.Resultatet visar att uppfattningen om pensionsavgångar är varierande då en av respondenterna menar att det inte är något att oroa sig över, medan övriga respondenter anser att det är en stor utmaning kommunen har framför sig. Resultatet visar även att Falu kommun i dagsläget arbetar strategiskt med ett flertal olika åtgärder för att stärka sitt arbetsgivarmärke externt såsom exempelvis ambassadörskap och talent management, vilket tidigare forskning visar är en nödvändighet för en organisations konkurrenskraft och således attrahera samt behålla medarbetare. Gällande kompetensöverföring visar resultatet att det idag finns en medvetenhet om riskerna för kompetensförluster. Dock utförs ett begränsat arbete för att överföra viktiga kompetenser, åtminstone med syfte att hantera den risk för kompetensförlust som väntas i och med den förestående generationsväxlingen. Tidigare forskning inom området pensionsavgångar visar dock att förlusten av viktiga kompetenser är det största hotet.Vår slutsats av denna studie är att Falu kommun är på rätt väg att hantera den problematik som förväntas uppstå, dock behöver kommunen öka medvetenheten genom kommunikation och intern marknadsföring samt arbeta samman en gemensam syn på pensionsavgångarna i alla förvaltningar. Vi menar även att det är av stor vikt att se över kompetenserna i organisationen och börja agera för att inte mista viktiga kompetenser i och med de förestående pensionsavgångarna. Detta är områden som behandlas i det förslag till HR-strategi vi har arbetat fram.

Heuristic optimization of the p-median problem and population re-distribution

This thesis contributes to the heuristic optimization of the p-median problem and Swedish population redistribution.   The p-median model is the most representative model in the location analysis. When facilities are located to a population geographically distributed in Q demand points, the p-median model systematically considers all the demand points such that each demand point will have an effect on the decision of the location. However, a series of questions arise. How do we measure the distances? Does the number of facilities to be located have a strong impact on the result? What scale of the network is suitable? How good is our solution? We have scrutinized a lot of issues like those. The reason why we are interested in those questions is that there are a lot of uncertainties in the solutions. We cannot guarantee our solution is good enough for making decisions. The technique of heuristic optimization is formulated in the thesis.   Swedish population redistribution is examined by a spatio-temporal covariance model. A descriptive analysis is not always enough to describe the moving effects from the neighbouring population. A correlation or a covariance analysis is more explicit to show the tendencies. Similarly, the optimization technique of the parameter estimation is required and is executed in the frame of statistical modeling.