The moving targets algorithm for difficult temporal credit assignment problems

The 'moving targets' algorithm for training recurrent networks is reviewed and applied to a task which demonstrates the ability of this algorithm to use distant contextual information. Some practical difficulties are discussed, especially with regard to the minimization process. Results on performance and computational requirements of several different 2nd-order minimization algorithms are presented for moving target problems.

Nickel(II) complexes of whole set of the simple ethylenediaminetetracarboxylate ligands:DFT study of complexes invoking molecular orbital and configurational analysis

The whole set of the nickel(II) complexes with no derivatized edta-type hexadentate ligands has been investigated from their structural and electronic properties. Two more complexes have been prepared in order to complete the whole set: trans(O5)-[Ni(ED3AP)]2- and trans(O5O6)-[Ni(EDA3P)]2- complexes. trans(O5) geometry has been verified crystallographically and trans(O5O6) geometry of the second complex has been predicted by the DFT theory and spectral analysis. Mutual dependance has been established between: the number of the five-membered carboxylate rings, octahedral/tetrahedral deviation of metal-ligand/nitrogen-neighbour-atom angles and charge-transfer energies (CTE) calculated by the Morokuma’s energetic decomposition analysis; energy of the absorption bands and HOMO–LUMO gap.

PCB assembly line assignment:a genetic algorithm approach

Purpose – This paper sets out to study a production-planning problem for printed circuit board (PCB) assembly. A PCB assembly company may have a number of assembly lines for production of several product types in large volume. Design/methodology/approach – Pure integer linear programming models are formulated for assigning the product types to assembly lines, which is the line assignment problem, with the objective of minimizing the total production cost. In this approach, unrealistic assignment, which was suffered by previous researchers, is avoided by incorporating several constraints into the model. In this paper, a genetic algorithm is developed to solve the line assignment problem. Findings – The procedure of the genetic algorithm to the problem and a numerical example for illustrating the models are provided. It is also proved that the algorithm is effective and efficient in dealing with the problem. Originality/value – This paper studies the line assignment problem arising in a PCB manufacturing company in which the production volume is high.

The influence of memory in a threshold model for distributed task assignment

A nature inspired decentralised multi-agent algorithm is proposed to solve a problem of distributed task selection in which cities produce and store batches of different mail types. Agents must collect and process the mail batches, without a priori knowledge of the available mail at the cities or inter-agent communication. In order to process a different mail type than the previous one, agents must undergo a change-over during which it remains inactive. We propose a threshold based algorithm in order to maximise the overall efficiency (the average amount of mail collected). We show that memory, i.e. the possibility for agents to develop preferences for certain cities, not only leads to emergent cooperation between agents, but also to a significant increase in efficiency (above the theoretical upper limit for any memoryless algorithm), and we systematically investigate the influence of the various model parameters. Finally, we demonstrate the flexibility of the algorithm to changes in circumstances, and its excellent scalability.

An alternative formulation for the fuzzy assignment problem

The existing assignment problems for assigning n jobs to n individuals are limited to the considerations of cost or profit measured as crisp. However, in many real applications, costs are not deterministic numbers. This paper develops a procedure based on Data Envelopment Analysis method to solve the assignment problems with fuzzy costs or fuzzy profits for each possible assignment. It aims to obtain the points with maximum membership values for the fuzzy parameters while maximizing the profit or minimizing the assignment cost. In this method, a discrete approach is presented to rank the fuzzy numbers first. Then, corresponding to each fuzzy number, we introduce a crisp number using the efficiency concept. A numerical example is used to illustrate the usefulness of this new method. © 2012 Operational Research Society Ltd. All rights reserved.

Copper(II) complexes with unsymmetrical pentadentate ed3a-type diamino-tricarboxylate ligands. Crystal structures, configurational analysis and DFT study of complexes

The O–O–N–N–O-type pentadentate ligands H3ed3a, H3pd3a and H3pd3p (H3ed3a stands ethylenediamine-N,N,N′-triacetic acid; H3pd3a stands 1,3-propanediamine-N,N,N′-triacetic acid and H3pd3p stands 1,3-propanediamine-N,N,N′-tri-3-propionic acid) and the corresponding novel octahedral or square-planar/trigonal-bipyramidal copper(II) complexes have been prepared and characterized. H3ed3a, H3pd3a and H3pd3p ligands coordinate to copper(II) ion via five donor atoms (three deprotonated carboxylate atoms and two amine nitrogens) affording octahedral in case of ed3a3− and intermediate square-pyramidal/trigonal-bipyramidal structure in case of pd3a3− and pd3p3−. A six coordinate, octahedral geometry has been established crystallographically for the [Mg(H2O)6][Cu(ed3a)(H2O)]2 · 2H2O complex and five coordinate square-pyramidal for the [Mg(H2O)5Cu(pd3a)][Cu(pd3a)] · 2H2O. Structural data correlating similar chelate Cu(II) complexes have been used for the better understanding the pathway: octahedral → square-pyramidal ↔ trigonal- bipyramid geometry. An extensive configuration analysis is discussed in relation to information obtained for similar complexes. The infra-red and electronic absorption spectra of the complexes are discussed in comparison with related complexes of known geometries. Molecular mechanics and density functional theory (DFT) programs have been used to model the most stable geometric isomer yielding, at the same time, significant structural data. The results from density functional studies have been compared with X-ray data.

Molecular identification of 26 syntaxin genes and their assignment to the different trafficking pathways in Paramecium

SNARE proteins have been classified as vesicular (v)- and target (t)-SNAREs and play a central role in the various membrane interactions in eukaryotic cells. Based on the Paramecium genome project, we have identified a multigene family of at least 26 members encoding the t-SNARE syntaxin (PtSyx) that can be grouped into 15 subfamilies. Paramecium syntaxins match the classical build-up of syntaxins, being 'tail-anchored' membrane proteins with an N-terminal cytoplasmic domain and a membrane-bound single C-terminal hydrophobic domain. The membrane anchor is preceded by a conserved SNARE domain of approximately 60 amino acids that is supposed to participate in SNARE complex assembly. In a phylogenetic analysis, most of the Paramecium syntaxin genes were found to cluster in groups together with those from other organisms in a pathway-specific manner, allowing an assignment to different compartments in a homology-dependent way. However, some of them seem to have no counterparts in metazoans. In another approach, we fused one representative member of each of the syntaxin isoforms to green fluorescent protein and assessed the in vivo localization, which was further supported by immunolocalization of some syntaxins. This allowed us to assign syntaxins to all important trafficking pathways in Paramecium.

Identifying the configurational paths to innovation in SMEs:a fuzzy-set qualitative comparative analysis

Using fuzzy-set qualitative comparative analysis (fsQCA), this study investigates the conditions leading to a higher level of innovation. More specifically, the study explores the impact of inter-organisational knowledge transfer networks and organisations' internal capabilities on different types of innovation in Small to Medium size Enterprises (SMEs) in the high-tech sector. A survey instrument was used to collect data from a sample of UK SMEs. The findings show that although individual factors are important, there is no need for a company to perform well in all the areas. The fsQCA, which enables the examination of the impacts of different combinations of factors, reveals that there are a number of paths to achieve better incremental and radical innovation performance. Companies need to choose the one that is closest to their abilities and fits best with their resources.