An iterative contractive framework for probe methods: LASSO

We present a new iterative approach called Line Adaptation for the Singular Sources Objective (LASSO) to object or shape reconstruction based on the singular sources method (or probe method) for the reconstruction of scatterers from the far-field pattern of scattered acoustic or electromagnetic waves. The scheme is based on the construction of an indicator function given by the scattered field for incident point sources in its source point from the given far-field patterns for plane waves. The indicator function is then used to drive the contraction of a surface which surrounds the unknown scatterers. A stopping criterion for those parts of the surfaces that touch the unknown scatterers is formulated. A splitting approach for the contracting surfaces is formulated, such that scatterers consisting of several separate components can be reconstructed. Convergence of the scheme is shown, and its feasibility is demonstrated using a numerical study with several examples.

MICPA: a client-assisted channel assignment scheme for throughput enhancement in WLANs

The emergence of high-density wireless local area network (WLAN) deployments in recent years is a testament to the insatiable demands for wireless broadband services. The increased density of WLAN deployments brings with it the potential of increased capacity, extended coverage, and exciting new applications. However, the corresponding increase in contention and interference can significantly degrade throughputs, unless new challenges in channel assignment are effectively addressed. In this paper, a client-assisted channel assignment scheme that can provide enhanced throughput is proposed. A study on the impact of interference on throughput with multiple access points (APs)is first undertaken using a novel approach that determines the possibility of parallel transmissions. A metric with a good correlation to the throughput, i.e., the number of conflict pairs, is used in the client-assisted minimum conflict pairs (MICPA) scheme. In this scheme, measurements from clients are used to assist the AP in determining the channel with the minimum number of conflict pairs to maximize its expected throughput. Simulation results show that the client-assisted MICPA scheme can provide meaningful throughput improvements over other schemes that only utilize the AP’s measurements.

The institutional antecedents of the assignment of HRM responsibilities to line managers

This article uses large-scale international data to examine how much autonomy organizations have to assign human resource management responsibilities to line managers, as indicated in the prescriptions of the literature. We use data from 11 countries to explore the impact of a variety of internal characteristics of organizations and the kind of economy in which they operate. We find that around half of the organizations assign HRM responsibilities to the line and that organizations appear to have considerable latitude in making choices in this area. Organizations in the Nordic economies are most likely to assign responsibilities for HRM to the line and those in the liberal market economies are the least likely to do so. In any economy, larger organizations, unionized organizations, and those with strategically positioned HRM departments are the least likely to allocate responsibilities for HRM to the line. We discuss the implications of our findings for future research and for practice.

A PCR-RFLP assay for gender assignment in the three-toed sloths (Bradypus, Pilosa, Bradypodidae)

The three-toed sloths (Bradypus) are slow-moving arboreal neotropical mammals. Understanding demographic variables (such as sex ratio) of populations is a key for conservation purposes. Nevertheless, gender assignment of Bradypus is particularly challenging because of the lack of sexual dimorphism in infants and in adults, particularly B. torquatus, the most endangered of the three-toed sloths, in which sex is attributed by visual observation of the reproductively active males. Here, we standardized a method for sexing Bradypus individuals using PCR-RFLP of sex-linked genes ZFX/ZFY. This assay was validated with known-gender animals and proved accurate to assign gender on three Bradypus species.

Contributions to the taxonomy of the Normanellidae (Copepoda, Harpacticoida): description of a new genus from the Brazilian continental shelf and re-assignment of Pseudocletodes vararensis Scott & Scott, 1893 (ex Nannopodidae)

A new genus and species of Normanellidae (Copepoda, Harpacticoida), Paranaiara inajae gen. et sp. nov., is described from the continental shelf off the northern coast of Sao Paulo State, Brazil. The new genus differs from the type genus Normanella Brady, 1880 and Sagamiella Lee & Huys, 1999 in its presence of lamelliform caudal rami, a maxillulary endopod represented by 2 setae, an unarmed maxillipedal syncoxa, and reduced setation on P2 enp-2 (without outer spine) and P3 enp-2 (with only 2 inner setae). All these apomorphic character states are shared with the genus Pseudocletodes Scott & Scott, 1893, formerly placed in the family Nannopodidae (ex Huntemanniidae) and here assigned to the Normanellidae. Pseudocletodes can be differentiated from Paranaiara by the loss of the P1 endopod and of the inner seta on P2-P4 enp-1, the presence of only 2 inner setae on P2 enp-2 (instead of 3) and only 1 inner seta on P4 exp-3 (instead of 2), the presence of a second inner seta on P4 enp-2 (instead of 1), the morphology of the fifth pair of legs which are not medially fused and have only 3 endopodal elements (instead of 4) in the male, and the well developed caudal ramus seta V (instead of rudimentary). It is postulated that prehensility of the P1 endopod was secondarily lost in the common ancestor of Paranaiara and Pseudocletodes. An updated family diagnosis of the Normanellidae and a dichotomous identification key to the 22 currently valid species are presented.

Iterative strong coupling of dimensionally heterogeneous models

In this article we address decomposition strategies especially tailored to perform strong coupling of dimensionally heterogeneous models, under the hypothesis that one wants to solve each submodel separately and implement the interaction between subdomains by boundary conditions alone. The novel methodology takes full advantage of the small number of interface unknowns in this kind of problems. Existing algorithms can be viewed as variants of the `natural` staggered algorithm in which each domain transfers function values to the other, and receives fluxes (or forces), and vice versa. This natural algorithm is known as Dirichlet-to-Neumann in the Domain Decomposition literature. Essentially, we propose a framework in which this algorithm is equivalent to applying Gauss-Seidel iterations to a suitably defined (linear or nonlinear) system of equations. It is then immediate to switch to other iterative solvers such as GMRES or other Krylov-based method. which we assess through numerical experiments showing the significant gain that can be achieved. indeed. the benefit is that an extremely flexible, automatic coupling strategy can be developed, which in addition leads to iterative procedures that are parameter-free and rapidly converging. Further, in linear problems they have the finite termination property. Copyright (C) 2009 John Wiley & Sons, Ltd.

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

ON AMINO ACID AND CODON ASSIGNMENT IN ALGEBRAIC MODELS FOR THE GENETIC CODE

We give a list of all possible schemes for performing amino acid and codon assignments in algebraic models for the genetic code, which are consistent with a few simple symmetry principles, in accordance with the spirit of the algebraic approach to the evolution of the genetic code proposed by Hornos and Hornos. Our results are complete in the sense of covering all the algebraic models that arise within this approach, whether based on Lie groups/Lie algebras, on Lie superalgebras or on finite groups.

Resolution and Absolute Configuration Assignment of a Natural Racemic Chromane from Peperomia obtusifolia (Piperaceae)

The resolution of the natural racemic chromane 3,4-dihydro-5-hydroxy-2,7-dimethyl-8-(3 ``-methyl-2 ``-butenyl)-2-(4`-methyl-1`,3`-pentadienyl)-2H-1-benzopyran-6-carboxylic acid (1) isolated from the leaves of Peperomia obtusifolia has been accomplished using stereoselective HPLC. The absolute coil figuration of the resolved enantiomers was determined by the analysis of optical rotations and CD spectra. The finding of a racemic mixture instead of an enantiomerically pure metabolite raises questions about the final steps in the biosynthesis of this class of natural products, suggesting that the intramolecular chromane ring formation step may not be enzymatically controlled at all in P. obtusifolia. Chirality 21:799-801, 2009. (C) 2008 Wiley-Liss, Inc.

Complete assignment of (1)H and (13)C NMR spectra of alpha-phenylsulfinyl-N-methoxy-N-methylpropionamide and some p-substituted derivatives

The complete assignment of the (1)H and (13)C NMR spectra of the diastereomeric pairs of some alpha-arylsulfinyl-substituted N-methoxy-N-methylpropionamides with the substituents methoxy, methyl, chloro, nitro is reported. Copyright (C) 2008 John Wiley & Sons, Ltd.

Task assignment optimization in SAP Extended WarehouseManagement

Nowadays in the world of mass consumption there is big demand for distributioncenters of bigger size. Managing such a center is a very complex and difficult taskregarding to the different processes and factors in a usual warehouse when we want tominimize the labor costs. Most of the workers’ working time is spent with travelingbetween source and destination points which cause deadheading. Even if a worker knowsthe structure of a warehouse well and because of that he or she can find the shortest pathbetween two points, it is still not guaranteed that there won’t be long traveling timebetween the locations of two consecutive tasks. We need optimal assignments betweentasks and workers.In the scientific literature Generalized Assignment Problem (GAP) is a wellknownproblem which deals with the assignment of m workers to n tasks consideringseveral constraints. The primary purpose of my thesis project was to choose a heuristics(genetic algorithm, tabu search or ant colony optimization) to be implemented into SAPExtended Warehouse Management (SAP EWM) by with task assignment will be moreeffective between tasks and resources.After system analysis I had to realize that due different constraints and businessdemands only 1:1 assingments are allowed in SAP EWM. Because of that I had to use adifferent and simpler approach – instead of the introduced heuristics – which could gainbetter assignments during the test phase in several cases. In the thesis I described indetails what ware the most important questions and problems which emerged during theplanning of my optimized assignment method.