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.

Temporal evolution and spatial distribution of maternal death

OBJECTIVE To analyze the temporal evolution of maternal mortality and its spatial distribution.METHODS Ecological study with a sample made up of 845 maternal deaths in women between 10 and 49 years, registered from 1999 to 2008 in the state of Rio Grande do Sul, Southern Brazil. Data were obtained from Information System on Mortality of Ministry of Health. The maternal mortality ratio and the specific maternal mortality ratio were calculated from records, and analyzed by the Poisson regression model. In the spatial distribution, three maps of the state were built with the rates in the geographical macro-regions, in 1999, 2003, and 2008.RESULTS There was an increase of 2.0% in the period of ten years (95%CI 1.00;1.04; p = 0.01), with no significant change in the magnitude of the maternal mortality ratio. The Serra macro-region presented the highest maternal mortality ratio (1.15, 95%CI 1.08;1.21; p < 0.001). Most deaths in Rio Grande do Sul were of white women over 40 years, with a lower level of education. The time of delivery/abortion and postpartum are times of increased maternal risk, with a greater negative impact of direct causes such as hypertension and bleeding.CONCLUSIONS The lack of improvement in maternal mortality ratio indicates that public policies had no impact on women’s reproductive and maternal health. It is needed to qualify the attention to women’s health, especially in the prenatal period, seeking to identify and prevent risk factors, as a strategy of reducing maternal death.

Critical reappraisal of Late Mesozoic-Cenozoic Central and North Atlantic, Caribbean and Mediterranean evolution

(l) The Pacific basin (Pacific area) may be regarded as moving eastwards like a double zip fastener relative to the continents and their respective plates (Pangaea area): opening in the East and closing in the West. This movement is tracked by a continuous mountain belt, the collision ages of which increase westwards. (2) The relative movements between the Pacific area and the Pangaea area in the W-EfE-W direction are generated by tidal forces (principle of hypocycloid gearing), whereby the lower mantle and the Pacific basin or area (Pacific crust = roof of the lower mantle?) rotate somewhat faster eastwards around the Earth's spin axis relative to the upper mantle/crust system with the continents and their respective plates (Pangaea area) (differential rotation). (3) These relative West to East/East to West displacements produce a perpetually existing sequence of distinct styles of opening and closing oeean basins, exemplified by the present East to West arrangement of ocean basins around the globe (Oceanic or Wilson Cycle: Rift/Red Sea style; Atlantic style; Mediterranean/Caribbean style as eastwards propagating tongue of the Pacific basin; Pacific style; Collision/Himalayas style). This sequence of ocean styles, of which the Pacific ocean is a part, moves eastwards with the lower mantle relative to the continents and the upper-mantle/crust of the Pangaea area. (4) Similarly, the collisional mountain belt extending westwards from the equator to the West of the Pacific and representing a chronological sequence of collision zones (sequential collisions) in the wake of the passing of the Pacific basin double zip fastener, may also be described as recording the history of oceans and their continental margins in the form of successive Wilson Cycles. (5) Every 200 to 250 m.y. the Pacific basin double zip fastener, the sequence of ocean styles of the Wilson Cycle and the eastwards growing collisional mountain belt in their wake complete one lap around the Earth. Two East drift lappings of 400 to 500 m.y. produce a two-lap collisional mountain belt spiral around a supercontinent in one hemisphere (North or South Pangaea). The Earth's history is subdivided into alternating North Pangaea growth/South Pangaea breakup eras and South Pangaea growth/North Pangaea breakup eras. Older North and South Pangaeas and their collisional mountain belt spirals may be reconstructed by rotating back the continents and orogenic fragments of a broken spiral (e.g. South Pangaea, Gondwana) to their previous Pangaea growth era orientations. In the resulting collisional mountain belt spiral, pieced together from orogenic segments and fragments, the collision ages have to increase successively towards the West. (6) With its current western margin orientated in a West-East direction North America must have collided during the Late Cretaceous Laramide orogeny with the northern margin of South America (Caribbean Andes) at the equator to the West of the Late Mesozoic Pacific. During post-Laramide times it must have rotated clockwise into its present orientation. The eastern margin of North America has never been attached to the western margin of North Africa but only to the western margin of Europe. (7) Due to migration eastwards of the sequence of ocean styles of the Wilson Cycle, relative to a distinct plate tectonic setting of an ocean, a continent or continental margin, a future or later evolutionary style at the Earth's surface is always depicted in a setting simultaneously developed further to the West and a past or earlier style in a setting simultaneously occurring further to the East. In consequence, ahigh probability exists that up to the Early Tertiary, Greenland (the ArabiaofSouth America?) occupied a plate tectonic setting which is comparable to the current setting of Arabia (the Greenland of Africa?). The Late Cretaceous/Early Tertiary Eureka collision zone (Eureka orogeny) at the northern margin of the Greenland Plate and on some of the Canadian Arctic Islands is comparable with the Middle to Late Tertiary Taurus-Bitlis-Zagros collision zone at the northern margin of the Arabian Plate.

Neighbour list optimization for real LTE radio network

With the increasing complexity of current networks, it became evident the need for Self-Organizing Networks (SON), which aims to automate most of the associated radio planning and optimization tasks. Within SON, this paper aims to optimize the Neighbour Cell List (NCL) for Long Term Evolution (LTE) evolved NodeBs (eNBs). An algorithm composed by three decisions were were developed: distance-based, Radio Frequency (RF) measurement-based and Handover (HO) stats-based. The distance-based decision, proposes a new NCL taking account the eNB location and interference tiers, based in the quadrants method. The last two algorithms consider signal strength measurements and HO statistics, respectively; they also define a ranking to each eNB and neighbour relation addition/removal based on user defined constraints. The algorithms were developed and implemented over an already existent radio network optimization professional tool. Several case studies were produced using real data from a Portuguese LTE mobile operator. © 2014 IEEE.

The evolution of user mobility on the Eduroam network

The emergence of smartphones with Wireless LAN (WiFi) network interfaces brought new challenges to application developers. The expected increase of users connectivity will impact their expectations for example on the performance of background applications. Unfortunately, the number and breadth of the studies on the new patterns of user mobility and connectivity that result from the emergence of smartphones is still insufficient to support this claim. This paper contributes with preliminary results on a large scale study of the usage pattern of about 49000 devices and 31000 users who accessed at least one access point of the eduroam WiFi network on the campuses of the Lisbon Polytechnic Institute. Results confirm that the increasing number of smartphones resulted in significant changes to the pattern of use, with impact on the amount of traffic and users connection time.

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.

Particle swarm optimization: dynamical analysis through fractional calculus

This chapter considers the particle swarm optimization algorithm as a system, whose dynamics is studied from the point of view of fractional calculus. In this study some initial swarm particles are randomly changed, for the system stimulation, and its response is compared with a non-perturbed reference response. The perturbation effect in the PSO evolution is observed in the perspective of the fitness time behaviour of the best particle. The dynamics is represented through the median of a sample of experiments, while adopting the Fourier analysis for describing the phenomena. The influence upon the global dynamics is also analyzed. Two main issues are reported: the PSO dynamics when the system is subjected to random perturbations, and its modelling with fractional order transfer functions.

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.

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.

Optimization of magneto-electro-elastic composite structures using differential evolution

Magneto-electro-elastic structures are built from materials that provide them the ability to convert in an interchangeable way, magnetic, electric and mechanical forms of energy. This characteristic can therefore provide an adaptive behaviour to a general configuration elastic structure, being commonly used in association with any type of composite material in an embedded or surface mounted mode, or by considering the usage of multiphase materials that enable achieving different magneto-electro-elastic properties. In a first stage of this work, a few cases studies will be considered to enable the validation of the model considered and the influence of the coupling characteristics of this type of adaptive structures. After that we consider the application of a recent computational intelligence technique, the differential evolution, in a deflection profile minimization problem. Studies on the influence of optimization parameters associated to the problem considered will be performed as well as the adoption of an adaptive scheme for the perturbation factor. Results are also compared with those obtained using an enhanced particle swarm optimization technique. (C) 2013 Elsevier Ltd. All rights reserved.

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.