A distributed algorithm for hexagonal topology formation in wireless sensor networks

Hexagonal wireless sensor network refers to a network topology where a subset of nodes have six peer neighbors. These nodes form a backbone for multi-hop communications. In a previous work, we proposed the use of hexagonal topology in wireless sensor networks and discussed its properties in relation to real-time (bounded latency) multi-hop communications in large-scale deployments. In that work, we did not consider the problem of hexagonal topology formation in practice - which is the subject of this research. In this paper, we present a decentralized algorithm that forms the hexagonal topology backbone in an arbitrary but sufficiently dense network deployment. We implemented a prototype of our algorithm in NesC for TinyOS based platforms. We present data from field tests of our implementation, collected using a deployment of fifty wireless sensor nodes.

Coding mode decision algorithm for binary descriptor coding

In visual sensor networks, local feature descriptors can be computed at the sensing nodes, which work collaboratively on the data obtained to make an efficient visual analysis. In fact, with a minimal amount of computational effort, the detection and extraction of local features, such as binary descriptors, can provide a reliable and compact image representation. In this paper, it is proposed to extract and code binary descriptors to meet the energy and bandwidth constraints at each sensing node. The major contribution is a binary descriptor coding technique that exploits the correlation using two different coding modes: Intra, which exploits the correlation between the elements that compose a descriptor; and Inter, which exploits the correlation between descriptors of the same image. The experimental results show bitrate savings up to 35% without any impact in the performance efficiency of the image retrieval task. © 2014 EURASIP.

Biological drugs for the treatment of psoriasis in a public health system

OBJECTIVE To analyze the access and utilization profile of biological medications for psoriasis provided by the judicial system in Brazil.METHODSThis is a cross-sectional study. We interviewed a total of 203 patients with psoriasis who were on biological medications obtained by the judicial system of the State of Sao Paulo, from 2004 to 2010. Sociodemographics, medical, and political-administrative characteristics were complemented with data obtained from dispensation orders that included biological medications to treat psoriasis and the legal actions involved. The data was analyzed using an electronic data base and shown as simple variable frequencies. The prescriptions contained in the lawsuits were analyzed according to legal provisions.RESULTS A total of 190 lawsuits requesting several biological drugs (adalimumab, efalizumab, etanercept, and infliximab) were analyzed. Patients obtained these medications as a result of injunctions (59.5%) or without having ever demanded biological medication from any health institution (86.2%), i.e., public or private health services. They used the prerogative of free legal aid (72.6%), even though they were represented by private lawyers (91.1%) and treated in private facilities (69.5%). Most of the patients used a biological medication for more than 13 months (66.0%), and some patients were undergoing treatment with this medication when interviewed (44.9%). Approximately one third of the patients discontinued treatment due to worsening of their illness (26.6%), adverse drug reactions (20.5%), lack of efficacy, or because the doctor discontinued this medication (13.8%). None of the analyzed medical prescriptions matched the legal prescribing requirements. Clinical monitoring results showed that 70.3% of the patients had not undergone laboratory examinations (blood work, liver and kidney function tests) for treatment control purposes.CONCLUSIONS The plaintiffs resorted to legal action to get access to biological medications because they were either unaware or had difficulty in accessing them through institutional public health system procedures. Access by means of legal action facilitated long-term use of this type of medication through irregular prescriptions and led to a high rate of adverse drug reactions as well as inappropriate clinical monitoring.

Economic analysis of surgical treatment of hip fracture in older adults

OBJECTIVE To analyze the incremental cost-utility ratio for the surgical treatment of hip fracture in older patients.METHODS This was a retrospective cohort study of a systematic sample of patients who underwent surgery for hip fracture at a central hospital of a macro-region in the state of Minas Gerais, Southeastern Brazil between January 1, 2009 and December 31, 2011. A decision tree creation was analyzed considering the direct medical costs. The study followed the healthcare provider’s perspective and had a one-year time horizon. Effectiveness was measured by the time elapsed between trauma and surgery after dividing the patients into early and late surgery groups. The utility was obtained in a cross-sectional and indirect manner using the EuroQOL 5 Dimensions generic questionnaire transformed into cardinal numbers using the national regulations established by the Center for the Development and Regional Planning of the State of Minas Gerais. The sample included 110 patients, 27 of whom were allocated in the early surgery group and 83 in the late surgery group. The groups were stratified by age, gender, type of fracture, type of surgery, and anesthetic risk.RESULTS The direct medical cost presented a statistically significant increase among patients in the late surgery group (p < 0.005), mainly because of ward costs (p < 0.001). In-hospital mortality was higher in the late surgery group (7.4% versus 16.9%). The decision tree demonstrated the dominance of the early surgery strategy over the late surgery strategy: R$9,854.34 (USD4,387.17) versus R$26,754.56 (USD11,911.03) per quality-adjusted life year. The sensitivity test with extreme values proved the robustness of the results.CONCLUSIONS After controlling for confounding variables, the strategy of early surgery for hip fracture in the older adults was proven to be dominant, because it presented a lower cost and better results than late surgery.

A hybrid genetic algorithm for the multi-mode resource-constrained project scheduling

A construction project is a group of discernible tasks or activities that are conduct-ed in a coordinated effort to accomplish one or more objectives. Construction projects re-quire varying levels of cost, time and other resources. To plan and schedule a construction project, activities must be defined sufficiently. The level of detail determines the number of activities contained within the project plan and schedule. So, finding feasible schedules which efficiently use scarce resources is a challenging task within project management. In this context, the well-known Resource Constrained Project Scheduling Problem (RCPSP) has been studied during the last decades. In the RCPSP the activities of a project have to be scheduled such that the makespan of the project is minimized. So, the technological precedence constraints have to be observed as well as limitations of the renewable resources required to accomplish the activities. Once started, an activity may not be interrupted. This problem has been extended to a more realistic model, the multi-mode resource con-strained project scheduling problem (MRCPSP), where each activity can be performed in one out of several modes. Each mode of an activity represents an alternative way of combining different levels of resource requirements with a related duration. Each renewable resource has a limited availability for the entire project such as manpower and machines. This paper presents a hybrid genetic algorithm for the multi-mode resource-constrained pro-ject scheduling problem, in which multiple execution modes are available for each of the ac-tivities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme. It is evaluated the quality of the schedules and presents detailed comparative computational re-sults for the MRCPSP, which reveal that this approach is a competitive algorithm.

A genetic algorithm for the resource constrained multi-project scheduling problem

This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

Scheduling a cutting and treatment stainless steel sheet line with self-management capabilities

With advancement in computer science and information technology, computing systems are becoming increasingly more complex with an increasing number of heterogeneous components. They are thus becoming more difficult to monitor, manage, and maintain. This process has been well known as labor intensive and error prone. In addition, traditional approaches for system management are difficult to keep up with the rapidly changing environments. There is a need for automatic and efficient approaches to monitor and manage complex computing systems. In this paper, we propose an innovative framework for scheduling system management by combining Autonomic Computing (AC) paradigm, Multi-Agent Systems (MAS) and Nature Inspired Optimization Techniques (NIT). Additionally, we consider the resolution of realistic problems. The scheduling of a Cutting and Treatment Stainless Steel Sheet Line will be evaluated. Results show that proposed approach has advantages when compared with other scheduling systems

Single-objective spreading algorithm

This paper addresses the problem of finding several different solutions with the same optimum performance in single objective real-world engineering problems. In this paper a parallel robot design is proposed. Thereby, this paper presents a genetic algorithm to optimize uni-objective problems with an infinite number of optimal solutions. The algorithm uses the maximin concept and ε-dominance to promote diversity over the admissible space. The performance of the proposed algorithm is analyzed with three well-known test functions and a function obtained from practical real-world engineering optimization problems. A spreading analysis is performed showing that the solutions drawn by the algorithm are well dispersed.

Spatial analysis of the tuberculosis treatment dropout, Buenos Aires, Argentina

OBJECTIVE Identify spatial distribution patterns of the proportion of nonadherence to tuberculosis treatment and its associated factors.METHODS We conducted an ecological study based on secondary and primary data from municipalities of the metropolitan area of Buenos Aires, Argentina. An exploratory analysis of the characteristics of the area and the distributions of the cases included in the sample (proportion of nonadherence) was also carried out along with a multifactor analysis by linear regression. The variables related to the characteristics of the population, residences and families were analyzed.RESULTS Areas with higher proportion of the population without social security benefits (p = 0.007) and of households with unsatisfied basic needs had a higher risk of nonadherence (p = 0.032). In addition, the proportion of nonadherence was higher in areas with the highest proportion of households with no public transportation within 300 meters (p = 0.070).CONCLUSIONS We found a risk area for the nonadherence to treatment characterized by a population living in poverty, with precarious jobs and difficult access to public transportation.

A genetic algorithm for project scheduling with multi-modes and renewable resources

This paper presents a genetic algorithm-based approach for project scheduling with multi-modes and renewable resources. In this problem activities of the project may be executed in more than one operating mode and renewable resource constraints are imposed. The objective function is the minimization of the project completion time. The idea of this approach is integrating a genetic algorithm with a schedule generation scheme. This study also proposes applying a local search procedure trying to yield a better solution when the genetic algorithm and the schedule generation scheme obtain a solution. The experimental results show that this algorithm is an effective method for solving this problem.

Project scheduling under multiple resources constraints using a genetic algorithm

The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

Project scheduling using a competitive genetic algorithm

- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm

A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

This paper presents a biased random-key genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are defined by the genetic algorithm. A forward-backward improvement procedure is applied to all solutions. The chromosomes supplied by the genetic algorithm are adjusted to reflect the solutions obtained by the improvement procedure. The heuristic is tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

This paper presents a methodology for applying scheduling algorithms using Monte Carlo simulation. The methodology is based on a decision support system (DSS). The proposed methodology combines a genetic algorithm with a new local search using Monte Carlo Method. The methodology is applied to the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The methodology is tested on a set of standard instances taken from the literature and compared with others. The computation results validate the effectiveness of the proposed methodology. The DSS developed can be utilized in a common industrial or construction environment.