Directory of Open Access Journals (Sweden)
Татьяна Борисовна Шатовская
2015-03-01
Full Text Available In this work results of modified Chameleon algorithm are discussed. Hierarchical multilevel algorithms consist of several stages: building the graph, coarsening, partitioning, recovering. Exploring of clustering quality for different data sets with different combinations of algorithms on different stages of the algorithm is the main aim of the article. And also aim is improving the construction phase through the optimization algorithm of choice k in the building the graph k-nearest neighbors
Scalable web services for the PSIPRED Protein Analysis Workbench.
Buchan, Daniel W A; Minneci, Federico; Nugent, Tim C O; Bryson, Kevin; Jones, David T
2013-07-01
Here, we present the new UCL Bioinformatics Group's PSIPRED Protein Analysis Workbench. The Workbench unites all of our previously available analysis methods into a single web-based framework. The new web portal provides a greatly streamlined user interface with a number of new features to allow users to better explore their results. We offer a number of additional services to enable computationally scalable execution of our prediction methods; these include SOAP and XML-RPC web server access and new HADOOP packages. All software and services are available via the UCL Bioinformatics Group website at http://bioinf.cs.ucl.ac.uk/.
Chameleon sequences in neurodegenerative diseases.
Bahramali, Golnaz; Goliaei, Bahram; Minuchehr, Zarrin; Salari, Ali
2016-03-25
Chameleon sequences can adopt either alpha helix sheet or a coil conformation. Defining chameleon sequences in PDB (Protein Data Bank) may yield to an insight on defining peptides and proteins responsible in neurodegeneration. In this research, we benefitted from the large PDB and performed a sequence analysis on Chameleons, where we developed an algorithm to extract peptide segments with identical sequences, but different structures. In order to find new chameleon sequences, we extracted a set of 8315 non-redundant protein sequences from the PDB with an identity less than 25%. Our data was classified to "helix to strand (HE)", "helix to coil (HC)" and "strand to coil (CE)" alterations. We also analyzed the occurrence of singlet and doublet amino acids and the solvent accessibility in the chameleon sequences; we then sorted out the proteins with the most number of chameleon sequences and named them Chameleon Flexible Proteins (CFPs) in our dataset. Our data revealed that Gly, Val, Ile, Tyr and Phe, are the major amino acids in Chameleons. We also found that there are proteins such as Insulin Degrading Enzyme IDE and GTP-binding nuclear protein Ran (RAN) with the most number of chameleons (640 and 405 respectively). These proteins have known roles in neurodegenerative diseases. Therefore it can be inferred that other CFP's can serve as key proteins in neurodegeneration, and a study on them can shed light on curing and preventing neurodegenerative diseases. Copyright © 2016 Elsevier Inc. All rights reserved.
Chameleon sequences in neurodegenerative diseases
Energy Technology Data Exchange (ETDEWEB)
Bahramali, Golnaz [Institute of Biochemistry and Biophysics, University of Tehran, Tehran (Iran, Islamic Republic of); Goliaei, Bahram, E-mail: goliaei@ut.ac.ir [Institute of Biochemistry and Biophysics, University of Tehran, Tehran (Iran, Islamic Republic of); Minuchehr, Zarrin, E-mail: minuchehr@nigeb.ac.ir [Department of Systems Biotechnology, National Institute of Genetic Engineering and Biotechnology, (NIGEB), Tehran (Iran, Islamic Republic of); Salari, Ali [Department of Systems Biotechnology, National Institute of Genetic Engineering and Biotechnology, (NIGEB), Tehran (Iran, Islamic Republic of)
2016-03-25
Chameleon sequences can adopt either alpha helix sheet or a coil conformation. Defining chameleon sequences in PDB (Protein Data Bank) may yield to an insight on defining peptides and proteins responsible in neurodegeneration. In this research, we benefitted from the large PDB and performed a sequence analysis on Chameleons, where we developed an algorithm to extract peptide segments with identical sequences, but different structures. In order to find new chameleon sequences, we extracted a set of 8315 non-redundant protein sequences from the PDB with an identity less than 25%. Our data was classified to “helix to strand (HE)”, “helix to coil (HC)” and “strand to coil (CE)” alterations. We also analyzed the occurrence of singlet and doublet amino acids and the solvent accessibility in the chameleon sequences; we then sorted out the proteins with the most number of chameleon sequences and named them Chameleon Flexible Proteins (CFPs) in our dataset. Our data revealed that Gly, Val, Ile, Tyr and Phe, are the major amino acids in Chameleons. We also found that there are proteins such as Insulin Degrading Enzyme IDE and GTP-binding nuclear protein Ran (RAN) with the most number of chameleons (640 and 405 respectively). These proteins have known roles in neurodegenerative diseases. Therefore it can be inferred that other CFP's can serve as key proteins in neurodegeneration, and a study on them can shed light on curing and preventing neurodegenerative diseases.
Housewright, Mary Kay
1999-01-01
Discusses an art activity that has students create pictures in which they first trace a chameleon pattern and then add camouflage to conceal the chameleon. Explains that different materials and techniques are used for students in grades k-1 and 2-5. (CMK)
Chartrand, Gary; And Others
1983-01-01
Problems involving multicolored cubes are discussed with examples of Instant Insanity and Rubik's Cube cited. Sections cover defining chameleonic cubes, producing such a cube, and extending understanding to multidimensional cubes. One theorem proved is that for each positive integer, every cube of that size is chameleonic. (MP)
Energy Technology Data Exchange (ETDEWEB)
Noller, Johannes, E-mail: johannes.noller08@imperial.ac.uk [Theoretical Physics, Blackett Laboratory, Imperial College London, Prince Consort Road, London, SW7 2BZ (United Kingdom)
2012-07-01
We consider generalized chameleon models where the conformal coupling between matter and gravitational geometries is not only a function of the chameleon field φ, but also of its derivatives via higher order co-ordinate invariants (such as ∂{sub μ}φ∂{sup μ}φ,□φ,...). Specifically we consider the first such non-trivial conformal factor A(φ,∂{sub μ}φ∂{sup μ}φ). The associated phenomenology is investigated and we show that such theories have a new generic mass-altering mechanism, potentially assisting the generation of a sufficiently large chameleon mass in dense environments. The most general effective potential is derived for such derivative chameleon setups and explicit examples are given. Interestingly this points us to the existence of a purely derivative chameleon protected by a shift symmetry for φ → φ+c. We also discuss potential ghost-like instabilities associated with mass-lifting mechanisms and find another, mass-lowering and instability-free, branch of solutions. This suggests that, barring fine-tuning, stable derivative models are in fact typically anti-chameleons that suppress the field's mass in dense environments. Furthermore we investigate modifications to the thin-shell regime and prove a no-go theorem for chameleon effects in non-conformal geometries of the disformal type.
Energy Technology Data Exchange (ETDEWEB)
Brax, Philippe [Institut de Physique Théorique, CEA, IPhT, CNRS, URA 2306, F-91191Gif/Yvette Cedex (France); Upadhye, Amol, E-mail: philippe.brax@cea.fr, E-mail: aupadhye@anl.gov [Institute for the Early Universe, Ewha University, International Education, Building #601, 11-1, Daehyun-Dong Seodaemun-Gu, Seoul 120-750 (Korea, Republic of)
2014-02-01
A scalar field dark energy candidate could couple to ordinary matter and photons, enabling its detection in laboratory experiments. Here we study the quantum properties of the chameleon field, one such dark energy candidate, in an ''afterglow'' experiment designed to produce, trap, and detect chameleon particles. In particular, we investigate the possible fragmentation of a beam of chameleon particles into multiple particle states due to the highly non-linear interaction terms in the chameleon Lagrangian. Fragmentation could weaken the constraints of an afterglow experiment by reducing the energy of the regenerated photons, but this energy reduction also provides a unique signature which could be detected by a properly-designed experiment. We show that constraints from the CHASE experiment are essentially unaffected by fragmentation for φ{sup 4} and 1/φ potentials, but are weakened for steeper potentials, and we discuss possible future afterglow experiments.
Brax, Philippe
2010-01-01
We analyse the creation of chameleons deep inside the sun and their subsequent conversion to photons near the magnetised surface of the sun. We find that the spectrum of the regenerated photons lies in the soft X-ray region, hence addressing the solar corona problem. Moreover, these back-converted photons originating from chameleons have an intrinsic difference with regenerated photons from axions: their relative polarisations are mutually orthogonal before Compton interacting with the surrounding plasma. Depending on the photon-chameleon coupling and working in the strong coupling regime of the chameleons to matter, we find that the induced photon flux, when regenerated resonantly with the surrounding plasma, coincides with the solar flux within the soft X-ray energy range. Moreover, using the soft X-ray solar flux as a prior, we find that with a strong enough photon-chameleon coupling the chameleons emitted by the sun could lead to a regenerated photon flux in the CAST pipes, which could be within the reach...
Petersen, Hugh
2009-01-01
This article presents an art project inspired by a drawing of a chameleon the author saw in an art-supply catalog. Chameleons prove to be a good subject to highlight shape, color and texture with eigth-graders. In this project, middle- and high-school students draw a chameleon, learn how to use shapes to add to their chameleon drawing, learn how…
The Chameleon project in retrospective
Smit, Gerardus Johannes Maria; Heysters, P.M.; Molenkamp, Egbert
2004-01-01
In this paper we describe in retrospective the main results of a four year project, called Chameleon. As part of this project we developed a coarse-grained reconfigurable core for DSP algorithms in wireless devices denoted MONTIUM. After presenting the main achievements within this project we
Ellipticity Weakens Chameleon Screening
Burrage, Clare; Copeland, Edmund J.; Stevenson, James
2014-01-01
The chameleon mechanism enables a long range fifth force to be screened in dense environments when non-trivial self interactions of the field cause its mass to increase with the local density. To date, chameleon fifth forces have mainly been studied for spherically symmetric sources, however the non-linear self interactions mean that the chameleon responds to changes in the shape of the source differently to gravity. In this work we focus on ellipsoidal departures from spherical symmetry and ...
Chameleon Induced Atomic Afterglow
Brax, Philippe
2010-01-01
The chameleon is a scalar field whose mass depends on the density of its environment. Chameleons are necessarily coupled to matter particles and will excite transitions between atomic energy levels in an analogous manner to photons. When created inside an optical cavity by passing a laser beam through a constant magnetic field, chameleons are trapped between the cavity walls and form a standing wave. This effect will lead to an afterglow phenomenon even when the laser beam and the magnetic field have been turned off, and could be used to probe the interactions of the chameleon field with matter.
Chameleonic Theories: A Short Review
Directory of Open Access Journals (Sweden)
Andrea Zanzi
2015-12-01
Full Text Available In the chameleon mechanism, a field (typically scalar has a mass that depends on the matter density of the environment: the larger is the matter density, the larger is the mass of the chameleon. We briefly review some aspects of chameleonic theories. In particular, in a typical class of these theories, we discuss the lagrangian, the role of conformal transformations, the equation of motion and the thin-shell effect. We also discuss f ( R theories and chameleonic quantum gravity.
Dynamics of supersymmetric chameleons
Energy Technology Data Exchange (ETDEWEB)
Brax, Philippe [Institut de Physique Theorique, CEA, IPhT, CNRS, URA 2306, F-91191Gif/Yvette Cedex (France); Davis, Anne-Christine; Sakstein, Jeremy, E-mail: Philippe.Brax@cea.fr, E-mail: A.C.Davis@damtp.cam.ac.uk, E-mail: J.A.Sakstein@damtp.cam.ac.uk [DAMTP, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA (United Kingdom)
2013-10-01
We investigate the cosmological dynamics of a class of supersymmetric chameleon models coupled to cold dark matter fermions. The model includes a cosmological constant in the form of a Fayet-Illiopoulos term, which emerges at late times due to the coupling of the chameleon to two charged scalars. Supergravity corrections ensure that the supersymmetric chameleons are efficiently screened in all astrophysical objects of interest, however this does not preclude the enhancement of gravity on linear cosmological scales. We solve the modified equations for the growth of cold dark matter density perturbations in closed form in the matter era. Using this, we go on to derive the modified linear power spectrum which is characterised by two scales, the horizon size at matter-radiation equality and at the redshift when the chameleon reaches the minimum of its effective potential. We analyse the deviations from the ΛCDM predictions in the linear regime. We find that there is generically a region in the model's parameter space where the model's background cosmology coincides with that of the ΛCDM model. Furthermore, we find that characteristic deviations from ΛCDM are present on the matter power spectrum providing a clear signature of supersymmetric chameleons.
Directory of Open Access Journals (Sweden)
Tarald Taraldsen
2007-12-01
Full Text Available We show that under certain circumstances, the Czech locative prepositions (LOC show up as directional prepositions (DIR and vice versa, (under different circumstances the Czech DIR PPs show up as LOC. We argue that such a chameleon life of the PPs is structurally dependent.
Evolution of Karyotypes in Chameleons
Directory of Open Access Journals (Sweden)
Michail Rovatsos
2017-12-01
Full Text Available The reconstruction of the evolutionary dynamics of karyotypes and sex determining systems in squamate reptiles is precluded by the lack of data in many groups including most chameleons (Squamata: Acrodonta: Chamaeleonidae. We performed cytogenetic analysis in 16 species of chameleons from 8 genera covering the phylogenetic diversity of the family and also phylogenetic reconstruction of karyotype evolution in this group. In comparison to other squamates, chameleons demonstrate rather variable karyotypes, differing in chromosome number, morphology and presence of interstitial telomeric signal (ITS. On the other hand, the location of rDNA is quite conserved among chameleon species. Phylogenetic analysis combining our new results and previously published data tentatively suggests that the ancestral chromosome number for chameleons is 2n = 36, which is the same as assumed for other lineages of the clade Iguania, i.e., agamids and iguanas. In general, we observed a tendency for the reduction of chromosome number during the evolution of chameleons, however, in Rieppeleon brevicaudatus, we uncovered a chromosome number of 2n = 62, very unusual among squamates, originating from a number of chromosome splits. Despite the presence of the highly differentiated ZZ/ZW sex chromosomes in the genus Furcifer, we did not detect any unequivocal sexual differences in the karyotypes of any other studied species of chameleons tested using differential staining and comparative genomic hybridization, suggesting that sex chromosomes in most chameleons are only poorly differentiated.
A compendium of chameleon constraints
Burrage, Clare; Sakstein, Jeremy
2016-11-01
The chameleon model is a scalar field theory with a screening mechanism that explains how a cosmologically relevant light scalar can avoid the constraints of intra-solar-system searches for fifth-forces. The chameleon is a popular dark energy candidate and also arises in f(R) theories of gravity. Whilst the chameleon is designed to avoid historical searches for fifth-forces it is not unobservable and much effort has gone into identifying the best observables and experiments to detect it. These results are not always presented for the same models or in the same language, a particular problem when comparing astrophysical and laboratory searches making it difficult to understand what regions of parameter space remain. Here we present combined constraints on the chameleon model from astrophysical and laboratory searches for the first time and identify the remaining windows of parameter space. We discuss the implications for cosmological chameleon searches and future small-scale probes.
Neutron stars in screened modified gravity: Chameleon versus dilaton
Brax, Philippe; Davis, Anne-Christine; Jha, Rahul
2017-04-01
We consider the scalar field profile around relativistic compact objects such as neutron stars for a range of modified gravity models with screening mechanisms of the chameleon and Damour-Polyakov types. We focus primarily on inverse power law chameleons and the environmentally dependent dilaton as examples of both mechanisms. We discuss the modified Tolman-Oppenheimer-Volkoff equation and then implement a relaxation algorithm to solve for the scalar profiles numerically. We find that chameleons and dilatons behave in a similar manner and that there is a large degeneracy between the modified gravity parameters and the neutron star equation of state. This is exemplified by the modifications to the mass-radius relationship for a variety of model parameters.
Time-delayed chameleon: Analysis, synchronization and FPGA ...
Indian Academy of Sciences (India)
A novel adaptive modified functional projective lag synchronization algorithm is derived for synchronizing identical time-delayed chameleon systems with uncertain ... Centre for Nonlinear Dynamics, Department of Electrical and Communication Engineering, The PNG University of Technology, Lae, Papua New Guinea ...
Search for chameleons with CAST
DEFF Research Database (Denmark)
Anastassopoulos, V.; Arik, M.; Aune, S.
2015-01-01
In this work we present a search for (solar) chameleons with the CERN Axion Solar Telescope (CAST). This novel experimental technique, in the field of dark energy research, exploits both the chameleon coupling to matter (βm) and to photons (βΥ) via the Primako eect. By reducing the X-ray detection...... energy threshold used for axions from 1 keV to 400 eV CAST became sensitive to the converted solar chameleon spectrum which peaks around 600 eV. Even though we have not observed any excess above background, we can provide a 95% C.L. limit for the coupling strength of chameleons to photons of βΥ≤1011...
Spherical Collapse in Chameleon Models
Brax, Ph; Steer, D A
2010-01-01
We study the gravitational collapse of an overdensity of nonrelativistic matter under the action of gravity and a chameleon scalar field. We show that the spherical collapse model is modified by the presence of a chameleon field. In particular, we find that even though the chameleon effects can be potentially large at small scales, for a large enough initial size of the inhomogeneity the collapsing region possesses a thin shell that shields the modification of gravity induced by the chameleon field, recovering the standard gravity results. We analyse the behaviour of a collapsing shell in a cosmological setting in the presence of a thin shell and find that, in contrast to the usual case, the critical density for collapse depends on the initial comoving size of the inhomogeneity.
Search for chameleons with CAST
Anastassopoulos, V; Aune, S; Barth, K; Belov, A; Bräuninger, H; Cantatore, G; Carmona, J M; Cetin, S A; Christensen, F; Collar, J I; Dafni, T; Davenport, M; Desch, K; Dermenev, A; Eleftheriadis, C; Fanourakis, G; Ferrer-Ribas, E; Friedrich, P; Galán, J; García, J A; Gardikiotis, A; Garza, J G; Gazis, E N; Geralis, T; Giomataris, I; Hailey, C; Haug, F; Hasinoff, M D; Hofmann, D H H; Iguaz, F J; Irastorza, I G; Jacoby, J; Jakobsen, A; Jakovčić, K; Kaminski, J; Karuza, M; Kavuk, M; Krčmar, M; Krieger, C; Krüger, A; Lakić, B; Laurent, J M; Liolios, A; Ljubičić, A; Luzón, G; Neff, S; Ortega, I; Papaevangelou, T; Pivovarov, M J; Raffelt, G; Riege, H; Rosu, M; Ruz, J; Savvidis, I; Solanki, S K; Vafeiadis, T; Villar, J A; Vogel, J K; Yildiz, S C; Zioutas, K; Brax, P; Lavrentyev, I; Upadhye, A
2015-01-01
In this work we present a search for (solar) chameleons with the CERN Axion Solar Telescope (CAST). This novel experimental technique, in the field of dark energy research, exploits both the chameleon coupling to matter ($\\beta_{\\rm m}$) and to photons ($\\beta_{\\gamma}$) via the Primakoff effect. By reducing the X-ray detection energy threshold used for axions from 1$\\,$keV to 400$\\,$eV CAST became sensitive to the converted solar chameleon spectrum which peaks around 600$\\,$eV. Even though we have not observed any excess above background, we can provide a 95% C.L. limit for the coupling strength of chameleons to photons of $\\beta_{\\gamma}\\!\\lesssim\\!10^{11}$ for $1<\\beta_{\\rm m}<10^6$.
Search for chameleons with CAST
Directory of Open Access Journals (Sweden)
V. Anastassopoulos
2015-10-01
Full Text Available In this work we present a search for (solar chameleons with the CERN Axion Solar Telescope (CAST. This novel experimental technique, in the field of dark energy research, exploits both the chameleon coupling to matter (βm and to photons (βγ via the Primakoff effect. By reducing the X-ray detection energy threshold used for axions from 1 keV to 400 eV CAST became sensitive to the converted solar chameleon spectrum which peaks around 600 eV. Even though we have not observed any excess above background, we can provide a 95% C.L. limit for the coupling strength of chameleons to photons of βγ≲1011 for 1<βm<106.
Cosmological Dynamics of a Hybrid Chameleon Scenario
Nozari, Kourosh; Rashidi, Narges
2013-01-01
We consider a hybrid scalar field which is non-minimally coupled to the matter and models a chameleon cosmology. By introducing an effective potential, we study the dependence of the effective potential's minimum and hybrid chameleon field's masses to the local matter density. In a dynamical system technique, we analyze the phase space of this two-field chameleon model, find its fixed points and study their stability. We show that the hybrid chameleon domination solution is a stable attractor...
Chameleons with Field Dependent Couplings
Brax, Philippe; Mota, David F; Nunes, Nelson J; Winther, Hans A
2010-01-01
Certain scalar-tensor theories exhibit the so-called chameleon mechanism, whereby observational signatures of scalar fields are hidden by a combination of self-interactions and interactions with ambient matter. Not all scalar-tensor theories exhibit such a chameleon mechanism, which has been originally found in models with inverse power run-away potentials and field independent couplings to matter. In this paper we investigate field-theories with field-dependent couplings and a power-law potential for the scalar field. We show that the theory indeed is a chameleon field theory. We find the thin-shell solution for a spherical body and investigate the consequences for E\\"ot-Wash experiments, fifth-force searches and Casimir force experiments. Requiring that the scalar-field evades gravitational tests, we find that the coupling is sensitive to a mass-scale which is of order of the Hubble scale today.
Dynamical analysis of tachyonic chameleon
Banijamali, Ali; Solbi, Milad
2017-08-01
In the present paper we investigate tachyonic chameleon scalar field and present the phase space analysis for four different combinations of the tachyonic potential V(φ ) and the coupling function f(φ ) of the chameleon field with matter. We find some stable solution in which accelerated expansion of the universe is satisfied. In one case where both f(φ ) and V(φ ) are exponential a scaling attractor was found that can give rise to the late-time acceleration of the universe and alleviate the coincidence problem.
Time-delayed chameleon: Analysis, synchronization and FPGA implementation
Rajagopal, Karthikeyan; Jafari, Sajad; Laarem, Guessas
2017-12-01
In this paper we report a time-delayed chameleon-like chaotic system which can belong to different families of chaotic attractors depending on the choices of parameters. Such a characteristic of self-excited and hidden chaotic flows in a simple 3D system with time delay has not been reported earlier. Dynamic analysis of the proposed time-delayed systems are analysed in time-delay space and parameter space. A novel adaptive modified functional projective lag synchronization algorithm is derived for synchronizing identical time-delayed chameleon systems with uncertain parameters. The proposed time-delayed systems and the synchronization algorithm with controllers and parameter estimates are then implemented in FPGA using hardware-software co-simulation and the results are presented.
Detecting solar chameleons through radiation pressure
Baum, S.; Hoffmann, D.H.H.; Karuza, M.; Semertzidis, Y.K.; Upadhye, A.; Zioutas, K.
2014-10-24
Light scalar fields can drive the accelerated expansion of the universe. Hence, they are obvious dark energy candidates. To make such models compatible with tests of General Relativity in the solar system and "fifth force" searches on Earth, one needs to screen them. One possibility is the so-called "chameleon" mechanism, which renders an effective mass depending on the local matter density. If chameleon particles exist, they can be produced in the sun and detected on earth exploiting the equivalent of a radiation pressure. Since their effective mass scales with the local matter density, chameleons can be reflected by a dense medium if their effective mass becomes greater than their total energy. Thus, under appropriate conditions, a flux of solar chameleons may be sensed by detecting the total instantaneous momentum transferred to a suitable opto-mechanical force/pressure sensor. We calculate the solar chameleon spectrum and the reach in the chameleon parameter space of an experiment using the preliminary re...
Halo modelling in chameleon theories
Energy Technology Data Exchange (ETDEWEB)
Lombriser, Lucas; Koyama, Kazuya [Institute of Cosmology and Gravitation, University of Portsmouth, Dennis Sciama Building, Burnaby Road, Portsmouth, PO1 3FX (United Kingdom); Li, Baojiu, E-mail: lucas.lombriser@port.ac.uk, E-mail: kazuya.koyama@port.ac.uk, E-mail: baojiu.li@durham.ac.uk [Institute for Computational Cosmology, Ogden Centre for Fundamental Physics, Department of Physics, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE (United Kingdom)
2014-03-01
We analyse modelling techniques for the large-scale structure formed in scalar-tensor theories of constant Brans-Dicke parameter which match the concordance model background expansion history and produce a chameleon suppression of the gravitational modification in high-density regions. Thereby, we use a mass and environment dependent chameleon spherical collapse model, the Sheth-Tormen halo mass function and linear halo bias, the Navarro-Frenk-White halo density profile, and the halo model. Furthermore, using the spherical collapse model, we extrapolate a chameleon mass-concentration scaling relation from a ΛCDM prescription calibrated to N-body simulations. We also provide constraints on the model parameters to ensure viability on local scales. We test our description of the halo mass function and nonlinear matter power spectrum against the respective observables extracted from large-volume and high-resolution N-body simulations in the limiting case of f(R) gravity, corresponding to a vanishing Brans-Dicke parameter. We find good agreement between the two; the halo model provides a good qualitative description of the shape of the relative enhancement of the f(R) matter power spectrum with respect to ΛCDM caused by the extra attractive gravitational force but fails to recover the correct amplitude. Introducing an effective linear power spectrum in the computation of the two-halo term to account for an underestimation of the chameleon suppression at intermediate scales in our approach, we accurately reproduce the measurements from the N-body simulations.
Do dwarf chameleons ( Bradypodion ) show developmental plasticity?
African Journals Online (AJOL)
The phenomenon of phenotype–genotype uncoupling (plasticity) causes problems in species delineations, and has been suggested as a cause underlying a mismatch between morphology and genetics between the Natal Midlands dwarf chameleon (Bradypodion thamnobates) and the KwaZulu dwarf chameleon ...
Chameleon radiation by oceanic dispersal.
Raxworthy, C J; Forstner, M R J; Nussbaum, R A
2002-02-14
Historical biogeography is dominated by vicariance methods that search for a congruent pattern of fragmentation of ancestral distributions produced by shared Earth history. A focus of vicariant studies has been austral area relationships and the break-up of the supercontinent Gondwana. Chameleons are one of the few extant terrestrial vertebrates thought to have biogeographic patterns that are congruent with the Gondwanan break-up of Madagascar and Africa. Here we show, using molecular and morphological evidence for 52 chameleon taxa, support for a phylogeny and area cladogram that does not fit a simple vicariant history. Oceanic dispersal--not Gondwanan break-up--facilitated species radiation, and the most parsimonious biogeographic hypothesis supports a Madagascan origin for chameleons, with multiple 'out-of-Madagascar' dispersal events to Africa, the Seychelles, the Comoros archipelago, and possibly Reunion Island. Although dispersal is evident in other Indian Ocean terrestrial animal groups, our study finds substantial out-of-Madagascar species radiation, and further highlights the importance of oceanic dispersal as a potential precursor for speciation.
Chameleon Search in CAST Experiment at CERN
AUTHOR|(CDS)2200384; Cetin, Serkant
Chameleons are hypothetical particles that are proposed as a scalar field to account for the accelerated expansion of the universe, the so-called `dark energy problem'. They are proposed to be produced in the high magnetic field regions inside the Sun and they propagate through or reflect from a medium with the interaction strength depending on the ambient density. The models which characterize the interaction of the chameleons provide two interaction channels: direct coupling to matter dependent on the density and coupling to electromagnetic field by Primakoff effect. CAST Experiment probes the coupling of chameleons with matter with opto-mechanical KWISP detector which is based on Fabry-Perot and Michelson interferometers. In this thesis, starting with an overview of the experimental search efforts of the CAST experiment, theoretical background of the dark energy and the chameleon mechanism will be provided. Then, the detection mechanism based on KWISP detector will be discussed and the versions of the dete...
Detecting solar chameleons through radiation pressure
Baum, Sebastian
2014-01-01
Light scalar fields can drive accelerated expansion of the universe. Hence, scalars are obvious dark energy candidates. To make these models compatible with test of General Relativity in the solar system and fifth force searches on earth, one needs to screen them. One possibility is the chameleon mechanism, which renders an effective mass depending on the local energy density. If chameleons exist, they can be produced in the sun and detected on earth through their radiation pressure. We calculate the solar chameleon spectrum and the sensitivity of an experiment to be carried out at CAST, CERN, utilizing a radiation pressure sensor currently under development at INFN, Trieste. We show that such an experiment will be sensitive to a wide range of model parameters and signifies a pioneering effort searching for chameleons in unprobed paramterspace.
TBCS/Chameleon Utility Trial Report
National Research Council Canada - National Science Library
Matthews, Michael L; Brooks, Jeremy E; Angel, Harold A
2005-01-01
...)/Chameleon using participants representing command elements of a combat team. Seven participants role-played an advance to contact scenario developed by Joint Command Staff Training Centre (JCSTC) in 13 segments...
Lingual structural pattern of juvenile Chameleon, Chameleo chameleon
Directory of Open Access Journals (Sweden)
Ahmed A. El Mansi
2017-06-01
Full Text Available It is belong to the order Squamata, family, Chamaeleonidae. They have characteristic features of tongue protrusion during capturing prey attracts many research works and assay its velocity during protrusion. Yet little studies touched the anatomical and histological feature of the juvenile tongue and especially the middle tongue region involved in the tongue elongation, the present study aimed to focus on the histological structure of the mid-tongue and clarify its role in projection of the tongue as well as the glandular structure, keratinization of lingual epithelium and proliferation capacity of the fore-tongue region in relation with their feeding habits during the juvenile age. Juvenile Chameleo chameleon are collected from Abu Rawash, north of Giza Governorate, Egypt during summer 2015. Three juvenile developmental stages are used in the present study and categorized according to the gross morphological criteria of head, abdomen and limb lengths. The tongue and hyoid apparatus were removed and photographed. Histological, immunohistochemistry of cytokeratin and stem cell factor and scanning electronic microscopic investigations were carried out on the fore-tongue region, meanwhile only histological studies were done for the median tongue region. Morphometric assessments of number and length of lingual papillae and grades of cytokeratin and stem cell expression were done. Histologically, the dorsal lingual mucosa of the fore-tongue possessed different pattern of lingual papillae including finger-like, club, cubical, biforked and multi-branched papillae. The finger-like papillae are more abundant compared to the other types. The lamina propria of anterior median tongue pad are more glandular and exhibited abundant distribution of PAS-positive tubular glands and moderate alcian blue staining affinity of both alveolar and branched alveolar glands. There is no detected keratinization of the lingual epithelium. Stem cell factor appeared denser on
Hillenius, D.
1978-01-01
A new, fossil chameleon is described, † Chamaeleo intermedius, found on the surface at Fort Ternan, Kenya. Most probably it eroded from a layer of fossilized lahar, close to 14 million years old. † Chamaeleo intermedius possesses characters which still occur in recent chameleons, in fact it combines
Detecting solar chameleons through radiation pressure
Energy Technology Data Exchange (ETDEWEB)
Baum, S., E-mail: sebastian.baum@cern.ch [Uppsala Universitet, Box 516, SE 75120, Uppsala (Sweden); European Organization for Nuclear Research (CERN), Gèneve (Switzerland); Cantatore, G. [Università di Trieste, Via Valerio 2, 34127 Trieste (Italy); INFN Trieste, Padriciano 99, 34149 Trieste (Italy); Hoffmann, D.H.H. [Institut für Kernphysik, TU-Darmstadt, Schlossgartenstr. 9, D-64289 Darmstadt (Germany); Karuza, M. [INFN Trieste, Padriciano 99, 34149 Trieste (Italy); Phys. Dept. and CMNST, University of Rijeka, R. Matejcic 2, Rijeka (Croatia); Semertzidis, Y.K. [Center for Axion and Precision Physics Research (IBS), Daejeon 305-701 (Korea, Republic of); Department of Physics, KAIST, Daejeon 305-701 (Korea, Republic of); Upadhye, A. [Physics Department, University of Wisconsin–Madison, 1150 University Avenue, Madison, WI 53706 (United States); Zioutas, K., E-mail: konstantin.zioutas@cern.ch [European Organization for Nuclear Research (CERN), Gèneve (Switzerland); University of Patras, GR 26504 Patras (Greece)
2014-12-12
Light scalar fields can drive the accelerated expansion of the universe. Hence, they are obvious dark energy candidates. To make such models compatible with tests of General Relativity in the solar system and “fifth force” searches on Earth, one needs to screen them. One possibility is the so-called “chameleon” mechanism, which renders an effective mass depending on the local matter density. If chameleon particles exist, they can be produced in the sun and detected on Earth exploiting the equivalent of a radiation pressure. Since their effective mass scales with the local matter density, chameleons can be reflected by a dense medium if their effective mass becomes greater than their total energy. Thus, under appropriate conditions, a flux of solar chameleons may be sensed by detecting the total instantaneous momentum transferred to a suitable opto-mechanical force/pressure sensor. We calculate the solar chameleon spectrum and the reach in the chameleon parameter space of an experiment using the preliminary results from a force/pressure sensor, currently under development at INFN Trieste, to be mounted in the focal plane of one of the X-Ray telescopes of the CAST experiment at CERN. We show, that such an experiment signifies a pioneering effort probing uncharted chameleon parameter space.
Detecting solar chameleons through radiation pressure
Directory of Open Access Journals (Sweden)
S. Baum
2014-12-01
Full Text Available Light scalar fields can drive the accelerated expansion of the universe. Hence, they are obvious dark energy candidates. To make such models compatible with tests of General Relativity in the solar system and “fifth force” searches on Earth, one needs to screen them. One possibility is the so-called “chameleon” mechanism, which renders an effective mass depending on the local matter density. If chameleon particles exist, they can be produced in the sun and detected on Earth exploiting the equivalent of a radiation pressure. Since their effective mass scales with the local matter density, chameleons can be reflected by a dense medium if their effective mass becomes greater than their total energy. Thus, under appropriate conditions, a flux of solar chameleons may be sensed by detecting the total instantaneous momentum transferred to a suitable opto-mechanical force/pressure sensor. We calculate the solar chameleon spectrum and the reach in the chameleon parameter space of an experiment using the preliminary results from a force/pressure sensor, currently under development at INFN Trieste, to be mounted in the focal plane of one of the X-Ray telescopes of the CAST experiment at CERN. We show, that such an experiment signifies a pioneering effort probing uncharted chameleon parameter space.
Laboratory constraints on chameleon dark energy and power-law fields
Steffen, Jason H.; Upadhye, Amol; Baumbaugh, Al; Chou, Aaron S.; Mazur, Peter O.; Tomlin, Ray; Weltman, Amanda; Wester, William
2010-01-01
We report results from the GammeV Chameleon Afterglow Search---a search for chameleon particles created via photon/chameleon oscillations within a magnetic field. This experiment is sensitive to a wide class of chameleon power-law models and dark energy models not previously explored. These results exclude five orders of magnitude in the coupling of chameleons to photons covering a range of four orders of magnitude in chameleon effective mass and, for individual chameleon models, exclude betw...
Tuning the Mass of Chameleon Fields in Casimir Force Experiments
Brax, Ph; Davis, A C; Shaw, D J; Iannuzzi, D
2010-01-01
We have calculated the chameleon pressure between two parallel plates in the presence of an intervening medium that affects the mass of the chameleon field. As intuitively expected, the gas in the gap weakens the chameleon interaction mechanism with a screening effect that increases with the plate separation and with the density of the intervening medium. This phenomenon might open up new directions in the search of chameleon particles with future long range Casimir force experiments.
Foot placement cues used by chameleons while walking and climbing
African Journals Online (AJOL)
Old world chameleons spend much time on branches of trees and shrubs. We studied the cues used by chameleons in positioning their feet while walking and climbing. Chameleons moving on dowels of varying position and diameter were videotaped to determine the sequence and location of each footfall. Visual cliff ...
High Tech Art: Chameleon Glass
1993-01-01
Dichroic Glass is a technology wherein extremely thin films of metal are vacuum deposited on a glass surface. The coated glass shields spacecraft instruments from cosmic radiation and protects human vision from unfiltered sunlight in space. Because the coating process allows some wavelengths of light and color to reflect and others to pass through, a chameleon effect is produced. Murray Schwartz, a former aerospace engineer, has based his business KROMA on this NASA optical technology. He produces dichroic stained glass windows, mobiles and jewelry. The technique involves deposition of super thin layers of metal oxides applied one layer at a time in a specific order and thickness for the desired effect. His product line is unique and has been very successful.
The shape dependence of chameleon screening
Burrage, Clare; Copeland, Edmund J.; Moss, Adam; Stevenson, James A.
2018-01-01
Chameleon scalar fields can screen their associated fifth forces from detection by changing their mass with the local density. These models are an archetypal example of a screening mechanism, and have become an important target for both cosmological surveys and terrestrial experiments. In particular there has been much recent interest in searching for chameleon fifth forces in the laboratory. It is known that the chameleon force is less screened around non-spherical sources, but only the field profiles around a few simple shapes are known analytically. In this work we introduce a numerical code that solves for the chameleon field around arbitrary shapes with azimuthal symmetry placed in a spherical vacuum chamber. We find that deviations from spherical symmetry can increase the chameleon acceleration experienced by a test particle, and that the least screened objects are those which minimize some internal dimension. For the shapes considered in this work, keeping the mass, density and background environment fixed, the accelerations due to the source varied by a factor of ~ 3.
Neutron interferometry constrains dark energy chameleon fields
Lemmel, H.; Brax, Ph.; Ivanov, A. N.; Jenke, T.; Pignol, G.; Pitschmann, M.; Potocar, T.; Wellenzohn, M.; Zawisky, M.; Abele, H.
2015-04-01
We present phase shift measurements for neutron matter waves in vacuum and in low pressure Helium using a method originally developed for neutron scattering length measurements in neutron interferometry. We search for phase shifts associated with a coupling to scalar fields. We set stringent limits for a scalar chameleon field, a prominent quintessence dark energy candidate. We find that the coupling constant β is less than 1.9 ×107 for n = 1 at 95% confidence level, where n is an input parameter of the self-interaction of the chameleon field φ inversely proportional to φn.
A natural cosmological constant from chameleons
Energy Technology Data Exchange (ETDEWEB)
Nastase, Horatiu, E-mail: nastase@ift.unesp.br [Instituto de Física Teórica, UNESP-Universidade Estadual Paulista, R. Dr. Bento T. Ferraz 271, Bl. II, Sao Paulo 01140-070, SP (Brazil); Weltman, Amanda, E-mail: amanda.weltman@uct.ac.za [Astrophysics, Cosmology & Gravity Center, Department of Mathematics and Applied Mathematics, University of Cape Town, Private Bag, Rondebosch 7700 (South Africa)
2015-07-30
We present a simple model where the effective cosmological constant appears from chameleon scalar fields. For a Kachru–Kallosh–Linde–Trivedi (KKLT)-inspired form of the potential and a particular chameleon coupling to the local density, patches of approximately constant scalar field potential cluster around regions of matter with density above a certain value, generating the effect of a cosmological constant on large scales. This construction addresses both the cosmological constant problem (why Λ is so small, yet nonzero) and the coincidence problem (why Λ is comparable to the matter density now)
Neutron interferometry constrains dark energy chameleon fields
Directory of Open Access Journals (Sweden)
H. Lemmel
2015-04-01
Full Text Available We present phase shift measurements for neutron matter waves in vacuum and in low pressure Helium using a method originally developed for neutron scattering length measurements in neutron interferometry. We search for phase shifts associated with a coupling to scalar fields. We set stringent limits for a scalar chameleon field, a prominent quintessence dark energy candidate. We find that the coupling constant β is less than 1.9×107 for n=1 at 95% confidence level, where n is an input parameter of the self-interaction of the chameleon field φ inversely proportional to φn.
A natural cosmological constant from chameleons
Directory of Open Access Journals (Sweden)
Horatiu Nastase
2015-07-01
Full Text Available We present a simple model where the effective cosmological constant appears from chameleon scalar fields. For a Kachru–Kallosh–Linde–Trivedi (KKLT-inspired form of the potential and a particular chameleon coupling to the local density, patches of approximately constant scalar field potential cluster around regions of matter with density above a certain value, generating the effect of a cosmological constant on large scales. This construction addresses both the cosmological constant problem (why Λ is so small, yet nonzero and the coincidence problem (why Λ is comparable to the matter density now.
The human chameleon: Hybrid Jews in cinema
Vudka, A.
2016-01-01
This research explores the seditious potential of hybrid Jewish figures in cinema, based on certain thinkers of post WWII French philosophy, feminist and postcolonial theories, and traditional Jewish texts, which in different ways point to a reevaluation of the "chameleon Jew" in positive terms.
Speed, Acceleration, Chameleons and Cherry Pit Projectiles
Planinsic, Gorazd; Likar, Andrej
2012-01-01
The paper describes the mechanics of cherry pit projectiles and ends with showing the similarity between cherry pit launching and chameleon tongue projecting mechanisms. The whole story is written as an investigation, following steps that resemble those typically taken by scientists and can therefore serve as an illustration of scientific…
Odontogenesis in the Veiled Chameleon (Chamaeleo calyptratus).
Buchtová, Marcela; Zahradníček, Oldřich; Balková, Simona; Tucker, Abigail S
2013-02-01
Replacement teeth in reptiles and mammals develop from a successional dental lamina. In monophyodont (single generation) species such as the mouse, no successional lamina develops. We have selected a reptilian monophyodont species - the Veiled Chameleon (Chamaeleo calyptratus) - to investigate whether this is a common characteristic of species that do not have replacement teeth. Furthermore, we focus on the sequence of tooth initiation along the jaw, and tooth attachment to the bones. Embryos of the Veiled Chameleon were collected during the first 6 months of incubation (from the 5th to 24th week) at 7-day intervals. After five weeks of incubation, an epithelial thickening was present as a shallow protrusion into the mesenchyme. A week later, the epithelium elongated more deeply into the mesenchyme to form the dental lamina. The formation of all tooth germs along the jaw was initiated from the tip of the dental lamina. Development of a successional dental lamina was initiated during the pre-hatching period but this structure became markedly reduced during juvenile stages. MicroCT analysis showed the presence of a heterodont dentition in young chameleons with multicuspid teeth in the caudal jaw area and simpler monocuspid teeth rostrally. Unlike the pleurodont teeth of most reptilian species, chameleon teeth are acrodontly ankylosed to the bones of the jaw. Odontoblasts produced a layer of predentine that connected the dentine to the supporting bone, with both tooth and bone protruding out of the oral cavity and acting as a functional unit. Chameleons may provide new and useful information to study the molecular interaction at the tooth-bone interface in physiological as well as pathological conditions. Copyright © 2012 Elsevier Ltd. All rights reserved.
Testing chameleon gravity with the Coma cluster
Energy Technology Data Exchange (ETDEWEB)
Terukina, Ayumu; Yamamoto, Kazuhiro [Department of Physical Science, Hiroshima University, Higashi-Hiroshima, Kagamiyama 1-3-1, 739-8526 (Japan); Lombriser, Lucas; Bacon, David; Koyama, Kazuya; Nichol, Robert C., E-mail: telkina@theo.phys.sci.hiroshima-u.ac.jp, E-mail: lucas.lombriser@port.ac.uk, E-mail: kazuhiro@hiroshima-u.ac.jp, E-mail: david.bacon@port.ac.uk, E-mail: kazuya.koyama@port.ac.uk, E-mail: bob.nichol@port.ac.uk [Institute of Cosmology and Gravitation, University of Portsmouth, Dennis Sciama Building, Portsmouth, PO1 3FX (United Kingdom)
2014-04-01
We propose a novel method to test the gravitational interactions in the outskirts of galaxy clusters. When gravity is modified, this is typically accompanied by the introduction of an additional scalar degree of freedom, which mediates an attractive fifth force. The presence of an extra gravitational coupling, however, is tightly constrained by local measurements. In chameleon modifications of gravity, local tests can be evaded by employing a screening mechanism that suppresses the fifth force in dense environments. While the chameleon field may be screened in the interior of the cluster, its outer region can still be affected by the extra force, introducing a deviation between the hydrostatic and lensing mass of the cluster. Thus, the chameleon modification can be tested by combining the gas and lensing measurements of the cluster. We demonstrate the operability of our method with the Coma cluster, for which both a lensing measurement and gas observations from the X-ray surface brightness, the X-ray temperature, and the Sunyaev-Zel'dovich effect are available. Using the joint observational data set, we perform a Markov chain Monte Carlo analysis of the parameter space describing the different profiles in both the Newtonian and chameleon scenarios. We report competitive constraints on the chameleon field amplitude and its coupling strength to matter. In the case of f(R) gravity, corresponding to a specific choice of the coupling, we find an upper bound on the background field amplitude of |f{sub R0}| < 6 × 10{sup −5}, which is currently the tightest constraint on cosmological scales.
Propulsion Physics Using the Chameleon Density Model
Robertson, Glen A.
2011-01-01
To grow as a space faring race, future spaceflight systems will require a new theory of propulsion. Specifically one that does not require mass ejection without limiting the high thrust necessary to accelerate within or beyond our solar system and return within a normal work period or lifetime. The Chameleon Density Model (CDM) is one such model that could provide new paths in propulsion toward this end. The CDM is based on Chameleon Cosmology a dark matter theory; introduced by Khrouy and Weltman in 2004. Chameleon as it is hidden within known physics, where the Chameleon field represents a scalar field within and about an object; even in the vacuum. The CDM relates to density changes in the Chameleon field, where the density changes are related to matter accelerations within and about an object. These density changes in turn change how an object couples to its environment. Whereby, thrust is achieved by causing a differential in the environmental coupling about an object. As a demonstration to show that the CDM fits within known propulsion physics, this paper uses the model to estimate the thrust from a solid rocket motor. Under the CDM, a solid rocket constitutes a two body system, i.e., the changing density of the rocket and the changing density in the nozzle arising from the accelerated mass. Whereby, the interactions between these systems cause a differential coupling to the local gravity environment of the earth. It is shown that the resulting differential in coupling produces a calculated value for the thrust near equivalent to the conventional thrust model used in Sutton and Ross, Rocket Propulsion Elements. Even though imbedded in the equations are the Universe energy scale factor, the reduced Planck mass and the Planck length, which relates the large Universe scale to the subatomic scale.
Threat perception in the chameleon (Chamaeleo chameleon): evidence for lateralized eye use.
Lustig, Avichai; Keter-Katz, Hadas; Katzir, Gadi
2012-07-01
Chameleons are arboreal lizards with highly independent, large amplitude eye movements. In response to an approaching threat, a chameleon on a vertical pole moves so as to keep itself away from the threat. In so doing, it shifts between monocular and binocular scanning of the threat and of the environment. We analyzed eye movements in the Common chameleon, Chamaeleo chameleon, during avoidance response for lateralization, that is, asymmetry at the functional/behavioral levels. The chameleons were exposed to a threat, approaching horizontally from clockwise or anti-clockwise directions, and that could be viewed monocularly or binocularly. Our results show three broad patterns of eye use, as determined by durations spent viewing the threat and by frequency of eye shifts. Under binocular viewing, two of the patterns were found to be both side dependent, that is, lateralized and role dependent ("leading" or "following"). However, under monocular viewing, no such lateralization was detected. We discuss these findings in light of the situation not uncommon in vertebrates, of independent eye movements and a high degree of optic nerve decussation and that lateralization may well occur in organisms that are regularly exposed to critical stimuli from all spatial directions. We point to the need of further investigating lateralization at fine behavioral levels.
Stability analysis in tachyonic potential chameleon cosmology
Energy Technology Data Exchange (ETDEWEB)
Farajollahi, H.; Salehi, A.; Tayebi, F.; Ravanpak, A., E-mail: hosseinf@guilan.ac.ir, E-mail: a.salehi@guilan.ac.ir, E-mail: ftayebi@guilan.ac.ir, E-mail: aravanpak@guilan.ac.ir [Department of Physics, University of Guilan, Rasht (Iran, Islamic Republic of)
2011-05-01
We study general properties of attractors for tachyonic potential chameleon scalar-field model which possess cosmological scaling solutions. An analytic formulation is given to obtain fixed points with a discussion on their stability. The model predicts a dynamical equation of state parameter with phantom crossing behavior for an accelerating universe. We constrain the parameters of the model by best fitting with the recent data-sets from supernovae and simulated data points for redshift drift experiment generated by Monte Carlo simulations.
'Passionate, curiously-coloured things': Chameleon sexuality in Ek ...
African Journals Online (AJOL)
In the past Chameleon has proven to be an ambiguous persona in the realms of gender and sexuality, and I have therefore chosen to focus on these realms in terms of an investigation into Chameleon's transgenderist performance on the album. The article aims to illustrate that (a) it is the ability of this 'curiously coloured' ...
Chameleon field and the late time acceleration of the Universe
Indian Academy of Sciences (India)
Abstract. In the present work, it is shown that a chameleon scalar field having a non- minimal coupling with dark matter can give rise to a smooth transition from a decelerated to an accelerated phase of expansion for the Universe. It is surprising to note that the coupling with the chameleon scalar field hardly affects the ...
Systematic simulations of modified gravity: chameleon models
Energy Technology Data Exchange (ETDEWEB)
Brax, Philippe [Institut de Physique Theorique, CEA, IPhT, CNRS, URA 2306, F-91191Gif/Yvette Cedex (France); Davis, Anne-Christine [DAMTP, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA (United Kingdom); Li, Baojiu [Institute for Computational Cosmology, Department of Physics, Durham University, Durham DH1 3LE (United Kingdom); Winther, Hans A. [Institute of Theoretical Astrophysics, University of Oslo, 0315 Oslo (Norway); Zhao, Gong-Bo, E-mail: philippe.brax@cea.fr, E-mail: a.c.davis@damtp.cam.ac.uk, E-mail: baojiu.li@durham.ac.uk, E-mail: h.a.winther@astro.uio.no, E-mail: gong-bo.zhao@port.ac.uk [Institute of Cosmology and Gravitation, University of Portsmouth, Portsmouth PO1 3FX (United Kingdom)
2013-04-01
In this work we systematically study the linear and nonlinear structure formation in chameleon theories of modified gravity, using a generic parameterisation which describes a large class of models using only 4 parameters. For this we have modified the N-body simulation code ecosmog to perform a total of 65 simulations for different models and parameter values, including the default ΛCDM. These simulations enable us to explore a significant portion of the parameter space. We have studied the effects of modified gravity on the matter power spectrum and mass function, and found a rich and interesting phenomenology where the difference with the ΛCDM paradigm cannot be reproduced by a linear analysis even on scales as large as k ∼ 0.05 hMpc{sup −1}, since the latter incorrectly assumes that the modification of gravity depends only on the background matter density. Our results show that the chameleon screening mechanism is significantly more efficient than other mechanisms such as the dilaton and symmetron, especially in high-density regions and at early times, and can serve as a guidance to determine the parts of the chameleon parameter space which are cosmologically interesting and thus merit further studies in the future.
Lustig, Avichai; Ketter-Katz, Hadas; Katzir, Gadi
2012-01-01
The common chameleon, Chamaeleo chameleon, is an arboreal lizard with highly independent, large-amplitude eye movements. In response to a moving threat, a chameleon on a perch responds with distinct avoidance movements that are expressed in its continuous positioning on the side of the perch distal to the threat. We analyzed body-exposure patterns during threat avoidance for evidence of lateralization, that is, asymmetry at the functional/behavioral levels. Chameleons were exposed to a threat approaching horizontally from the left or right, as they held onto a vertical pole that was either wider or narrower than the width of their head, providing, respectively, monocular or binocular viewing of the threat. We found two equal-sized sub-groups, each displaying lateralization of motor responses to a given direction of stimulus approach. Such an anti-symmetrical distribution of lateralization in a population may be indicative of situations in which organisms are regularly exposed to crucial stimuli from all spatial directions. This is because a bimodal distribution of responses to threat in a natural population will reduce the spatial advantage of predators.
Directory of Open Access Journals (Sweden)
Avichai Lustig
Full Text Available The common chameleon, Chamaeleo chameleon, is an arboreal lizard with highly independent, large-amplitude eye movements. In response to a moving threat, a chameleon on a perch responds with distinct avoidance movements that are expressed in its continuous positioning on the side of the perch distal to the threat. We analyzed body-exposure patterns during threat avoidance for evidence of lateralization, that is, asymmetry at the functional/behavioral levels. Chameleons were exposed to a threat approaching horizontally from the left or right, as they held onto a vertical pole that was either wider or narrower than the width of their head, providing, respectively, monocular or binocular viewing of the threat. We found two equal-sized sub-groups, each displaying lateralization of motor responses to a given direction of stimulus approach. Such an anti-symmetrical distribution of lateralization in a population may be indicative of situations in which organisms are regularly exposed to crucial stimuli from all spatial directions. This is because a bimodal distribution of responses to threat in a natural population will reduce the spatial advantage of predators.
Longevity in Calumma parsonii, the World's largest chameleon.
Tessa, Giulia; Glaw, Frank; Andreone, Franco
2017-03-01
Large body size of ectothermic species can be correlated with high life expectancy. We assessed the longevity of the World's largest chameleon, the Parson's chameleon Calumma parsonii from Madagascar by using skeletochronology of phalanges taken from preserved specimens held in European natural history museums. Due to the high bone resorption we can provide only the minimum age of each specimen. The highest minimum age detected was nine years for a male and eight years for a female, confirming that this species is considerably long living among chameleons. Our data also show a strong correlation between snout-vent length and estimated age. Copyright © 2017 Elsevier Inc. All rights reserved.
How to avoid a swift kick in the chameleons
Energy Technology Data Exchange (ETDEWEB)
Padilla, Antonio; Stefanyszyn, David; Wilson, Toby [School of Physics and Astronomy, University of Nottingham, Nottingham NG7 2RD (United Kingdom); Platts, Emma; Walters, Anthony; Weltman, Amanda, E-mail: antonio.padilla@nottingham.ac.uk, E-mail: pltemm002@myuct.ac.za, E-mail: ppxds1@nottingham.ac.uk, E-mail: tony.walters@uct.ac.za, E-mail: amanda.weltman@uct.ac.za, E-mail: toby.wilson@nottingham.ac.uk [Astrophysics, Cosmology and Gravity Centre, Department of Mathematics and Applied Mathematics, University of Cape Town, Rondebosch 7701, Cape Town (South Africa)
2016-03-01
Recently, it was argued that the conformal coupling of the chameleon to matter fields created an issue for early universe cosmology. As standard model degrees of freedom become non-relativistic in the early universe, the chameleon is attracted towards a ''surfing'' solution, so that it arrives at the potential minimum with too large a velocity. This leads to rapid variations in the chameleon's mass and excitation of high energy modes, casting doubts on the classical treatment at Big Bang Nucleosynthesis. Here we present the DBI chameleon, a consistent high energy modification of the chameleon theory that dynamically renders it weakly coupled to matter during the early universe thereby eliminating the adverse effects of the 'kicks'. This is done without any fine tuning of the coupling between the chameleon and matter fields, and retains its screening ability in the solar system. We demonstrate this explicitly with a combination of analytic and numerical results.
Lustig, Avichai; Ketter-Katz, Hadas; Katzir, Gadi
2013-11-01
Chameleons (Chamaeleonidae, reptilia), in common with most ectotherms, show full optic nerve decussation and sparse inter-hemispheric commissures. Chameleons are unique in their capacity for highly independent, large-amplitude eye movements. We address the question: Do common chameleons, Chamaeleo chameleon, during detour, show patterns of lateralization of motion and of eye use that differ from those shown by other ectotherms? To reach a target (prey) in passing an obstacle in a Y-maze, chameleons were required to make a left or a right detour. We analyzed the direction of detours and eye use and found that: (i) individuals differed in their preferred detour direction, (ii) eye use was lateralized at the group level, with significantly longer durations of viewing the target with the right eye, compared with the left eye, (iii) during left side, but not during right side, detours the durations of viewing the target with the right eye were significantly longer than the durations with the left eye. Thus, despite the uniqueness of chameleons' visual system, they display patterns of lateralization of motion and of eye use, typical of other ectotherms. These findings are discussed in relation to hemispheric functions. Copyright © 2013 Elsevier B.V. All rights reserved.
Bahramali, Golnaz; Goliaei, Bahram; Minuchehr, Zarrin; Marashi, Sayed-Amir
2017-02-01
Chameleon proteins are proteins which include sequences that can adopt α-helix-β-strand (HE-chameleon) or α-helix-coil (HC-chameleon) or β-strand-coil (CE-chameleon) structures to operate their crucial biological functions. In this study, using a network-based approach, we examined the chameleon proteins to give a better knowledge on these proteins. We focused on proteins with identical chameleon sequences with more than or equal to seven residues long in different PDB entries, which adopt HE-chameleon, HC-chameleon, and CE-chameleon structures in the same protein. One hundred and ninety-one human chameleon proteins were identified via our in-house program. Then, protein-protein interaction (PPI) networks, Gene ontology (GO) enrichment, disease network, and pathway enrichment analyses were performed for our derived data set. We discovered that there are chameleon sequences which reside in protein-protein interaction regions between two proteins critical for their dual function. Analysis of the PPI networks for chameleon proteins introduced five hub proteins, namely TP53, EGFR, HSP90AA1, PPARA, and HIF1A, which were presented in four PPI clusters. The outcomes demonstrate that the chameleon regions are in critical domains of these proteins and are important in the development and treatment of human cancers. The present report is the first network-based functional study of chameleon proteins using computational approaches and might provide a new perspective for understanding the mechanisms of diseases helping us in developing new medical therapies along with discovering new proteins with chameleon properties which are highly important in cancer.
Quartic chameleons: Safely scale-free in the early Universe
Miller, Carisa; Erickcek, Adrienne L.
2016-11-01
In chameleon gravity, there exists a light scalar field that couples to the trace of the stress-energy tensor in such a way that its mass depends on the ambient matter density, and the field is screened in local, high-density environments. Recently it was shown that, for the runaway potentials commonly considered in chameleon theories, the field's coupling to matter and the hierarchy of scales between Standard Model particles and the energy scale of such potentials result in catastrophic effects in the early Universe when these particles become nonrelativistic. Perturbations with trans-Planckian energies are excited, and the theory suffers a breakdown in calculability at the relatively low temperatures of big bang nucleosynthesis. We consider a chameleon field in a quartic potential and show that the scale-free nature of this potential allows the chameleon to avoid many of the problems encountered by runaway potentials. Following inflation, the chameleon field oscillates around the minimum of its effective potential, and rapid changes in its effective mass excite perturbations via quantum particle production. The quartic model, however, only generates high-energy perturbations at comparably high temperatures and is able remain a well-behaved effective field theory at nucleosynthesis.
Cosmic web and environmental dependence of screening: Vainshtein vs. chameleon
Energy Technology Data Exchange (ETDEWEB)
Falck, Bridget; Koyama, Kazuya; Zhao, Gong-Bo, E-mail: bridget.falck@port.ac.uk, E-mail: kazuya.koyama@port.ac.uk, E-mail: gong-bo.zhao@port.ac.uk [Institute of Cosmology and Gravitation, University of Portsmouth, Burnaby Road, Portsmouth (United Kingdom)
2015-07-01
Theories which modify general relativity to explain the accelerated expansion of the Universe often use screening mechanisms to satisfy constraints on Solar System scales. We investigate the effects of the cosmic web and the local environmental density of dark matter halos on the screening properties of the Vainshtein and chameleon screening mechanisms. We compare the cosmic web morphology of dark matter particles, mass functions of dark matter halos, mass and radial dependence of screening, velocity dispersions and peculiar velocities, and environmental dependence of screening mechanisms in f(R) and nDGP models. Using the ORIGAMI cosmic web identification routine we find that the Vainshtein mechanism depends on the cosmic web morphology of dark matter particles, since these are defined according to the dimensionality of their collapse, while the chameleon mechanism shows no morphology dependence. The chameleon screening of halos and their velocity dispersions depend on halo mass, and small halos and subhalos can be environmentally screened in the chameleon mechanism. On the other hand, the screening of halos in the Vainshtein mechanism does not depend on mass nor environment, and their velocity dispersions are suppressed. The peculiar velocities of halos in the Vainshtein mechanism are enhanced because screened objects can still feel the fifth force generated by external fields, while peculiar velocities of chameleon halos are suppressed when the halo centers are screened.
Molecule of the Month Molecular–Chameleon: Solvatochromism at ...
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 5. Molecule of the Month Molecular–Chameleon: Solvatochromism at its Iridescent Best! Photon Rao. Feature Article Volume 2 Issue 5 May 1997 pp 69-72. Fulltext. Click here to view fulltext PDF. Permanent link:
Constraining chameleon field theories using the GammeV afterglow experiments
Energy Technology Data Exchange (ETDEWEB)
Upadhye, A.; /Chicago U., EFI /KICP, Chicago; Steffen, J.H.; /Fermilab; Weltman, A.; /Cambridge U., DAMTP /Cape Town U.
2009-11-01
The GammeV experiment has constrained the couplings of chameleon scalar fields to matter and photons. Here we present a detailed calculation of the chameleon afterglow rate underlying these constraints. The dependence of GammeV constraints on various assumptions in the calculation is studied. We discuss GammeV-CHASE, a second-generation GammeV experiment, which will improve upon GammeV in several major ways. Using our calculation of the chameleon afterglow rate, we forecast model-independent constraints achievable by GammeV-CHASE. We then apply these constraints to a variety of chameleon models, including quartic chameleons and chameleon dark energy models. The new experiment will be able to probe a large region of parameter space that is beyond the reach of current tests, such as fifth force searches, constraints on the dimming of distant astrophysical objects, and bounds on the variation of the fine structure constant.
Towards a UV completion of chameleons in string theory
Energy Technology Data Exchange (ETDEWEB)
Hinterbichler, Kurt; Khoury, Justin [University of Pennsylvania, PA (United States); Nastase, Horatiu [Instituto de Fisica Teorica (IFT/UNESP), SP (Brazil)
2011-07-01
Full text: Chameleons are scalar fields that couple directly to ordinary matter with gravitational strength, thus effectively modifying the gravitational interaction, but which nevertheless evade the stringent constraints on tests of gravity because of properties they acquire in the presence of high ambient matter density. In the original formulation, one could simply describe the modification as the scalar mass depending on the matter density, but in the general set-up one can have a more complicated description. In any case, chameleon theories were originally constructed in a bottom-up, phenomenological fashion, with potentials and matter couplings designed to hide the scalar from experiments. We now show that it is in general possible for chameleons to arise in string and supergravity theories, as the volume modulus (for extra dimensions). We consider as a general chameleon set-up a potential for the volume modulus with a minimum, i.e. stabilized, and an exponentially increasing form on the side of large volume. We show that in fact the scenario proposed within string theory by Kachru, Kallosh, Linde and Trivedi (KKLT) is of this type, provided we change the sign of the exponent a in the superpotential W = W{sub 0} + Ae{sup iap} (such a change has been considered before even within the KKLT scenario, and also in general compactifications). We show that these chameleon models satisfy Earth and astrophysical constraints, thus finding experimental constraints on the parameters of the potential, both for the general case, and for KKLT. For the KKLT potential, the constraints imply a KK scale (for the extra dimensions) of about 10{sup 11}GeV , and the constant term in the superpotential of about 10{sup -30}M{sub P}{sup 3}. (author)
Strongly coupled chameleon fields: Possible test with a neutron Lloyd's mirror interferometer
Energy Technology Data Exchange (ETDEWEB)
Pokotilovski, Yu.N., E-mail: pokot@nf.jinr.ru [Joint Institute for Nuclear Research, 141980 Dubna, Moscow Region (Russian Federation)
2013-02-26
The consideration of possible neutron Lloyd's mirror interferometer experiment to search for strongly coupled chameleon fields is presented. The chameleon scalar fields were proposed to explain the acceleration of expansion of the Universe. The presence of a chameleon field results in a change of a particle's potential energy in vicinity of a massive body. This interaction causes a phase shift of neutron waves in the interferometer. The sensitivity of the method is estimated.
Indian Academy of Sciences (India)
positive numbers. The word 'algorithm' was most often associated with this algorithm till 1950. It may however be pOinted out that several non-trivial algorithms such as synthetic (polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used.
Directory of Open Access Journals (Sweden)
Sebastian Gim
2012-11-01
Full Text Available Continued device scaling into the nanometer region and high frequencies of operation well into the multi-GHz region has given rise to new effects that previously had negligible impact but now present greater challenges and unprecedented complexity to designing successful mixed-signal silicon. The Chameleon-RF project was conceived to address these challenges. Creative use of domain decomposition, multi grid techniques or reduced order modeling techniques (ROM can be selectively applied at all levels of the process to efficiently prune down degrees of freedom (DoFs. However, the simulation of complex systems within a reasonable amount of time remains a computational challenge. This paper presents work done in the incorporation of GPGPU technology to accelerate Krylov based algorithms used for compact modeling of on-chip passive integrated structures within the workflow of the Chameleon-RF project. Based upon insight gained from work done above, a novel GPGPU accelerated algorithm was developed for the Krylov ROM (kROM methods and is described here for the benefit of the wider community.
Lustig, Avichai; Ketter-Katz, Hadas; Katzir, Gadi
2013-01-01
Lateralization is mostly analyzed for single traits, but seldom for two or more traits while performing a given task (e.g. object manipulation). We examined lateralization in eye use and in body motion that co-occur during avoidance behaviour of the common chameleon, Chamaeleo chameleon. A chameleon facing a moving threat smoothly repositions its body on the side of its perch distal to the threat, to minimize its visual exposure. We previously demonstrated that during the response (i) eye use and body motion were, each, lateralized at the tested group level (N = 26), (ii) in body motion, we observed two similar-sized sub-groups, one exhibiting a greater reduction in body exposure to threat approaching from the left and one--to threat approaching from the right (left- and right-biased subgroups), (iii) the left-biased sub-group exhibited weak lateralization of body exposure under binocular threat viewing and none under monocular viewing while the right-biased sub-group exhibited strong lateralization under both monocular and binocular threat viewing. In avoidance, how is eye use related to body motion at the entire group and at the sub-group levels? We demonstrate that (i) in the left-biased sub-group, eye use is not lateralized, (ii) in the right-biased sub-group, eye use is lateralized under binocular, but not monocular viewing of the threat, (iii) the dominance of the right-biased sub-group determines the lateralization of the entire group tested. We conclude that in chameleons, patterns of lateralization of visual function and body motion are inter-related at a subtle level. Presently, the patterns cannot be compared with humans' or related to the unique visual system of chameleons, with highly independent eye movements, complete optic nerve decussation and relatively few inter-hemispheric commissures. We present a model to explain the possible inter-hemispheric differences in dominance in chameleons' visual control of body motion during avoidance.
Directory of Open Access Journals (Sweden)
Avichai Lustig
Full Text Available Lateralization is mostly analyzed for single traits, but seldom for two or more traits while performing a given task (e.g. object manipulation. We examined lateralization in eye use and in body motion that co-occur during avoidance behaviour of the common chameleon, Chamaeleo chameleon. A chameleon facing a moving threat smoothly repositions its body on the side of its perch distal to the threat, to minimize its visual exposure. We previously demonstrated that during the response (i eye use and body motion were, each, lateralized at the tested group level (N = 26, (ii in body motion, we observed two similar-sized sub-groups, one exhibiting a greater reduction in body exposure to threat approaching from the left and one--to threat approaching from the right (left- and right-biased subgroups, (iii the left-biased sub-group exhibited weak lateralization of body exposure under binocular threat viewing and none under monocular viewing while the right-biased sub-group exhibited strong lateralization under both monocular and binocular threat viewing. In avoidance, how is eye use related to body motion at the entire group and at the sub-group levels? We demonstrate that (i in the left-biased sub-group, eye use is not lateralized, (ii in the right-biased sub-group, eye use is lateralized under binocular, but not monocular viewing of the threat, (iii the dominance of the right-biased sub-group determines the lateralization of the entire group tested. We conclude that in chameleons, patterns of lateralization of visual function and body motion are inter-related at a subtle level. Presently, the patterns cannot be compared with humans' or related to the unique visual system of chameleons, with highly independent eye movements, complete optic nerve decussation and relatively few inter-hemispheric commissures. We present a model to explain the possible inter-hemispheric differences in dominance in chameleons' visual control of body motion during avoidance.
Indian Academy of Sciences (India)
In the description of algorithms and programming languages, what is the role of control abstraction? • What are the inherent limitations of the algorithmic processes? In future articles in this series, we will show that these constructs are powerful and can be used to encode any algorithm. In the next article, we will discuss ...
Manipulators inspired by the tongue of the chameleon
Energy Technology Data Exchange (ETDEWEB)
Debray, Alexis, E-mail: debray.alexis@canon.co.jp [Canon Incorporation, 3-30-2, Shimomaruko, Ohta-ku, Tokyo 146-8501 (Japan)
2011-06-15
Chameleons have developed a specialized ballistic tongue which elongates more than six times its rest length at speeds higher than 3.5 m s{sup -1} and accelerations 350 m s{sup -2}, with a highly flexible mobile part, and which applies no continuous force during forward motion. These characteristics are possible because this tongue consists of two highly specialized systems, an ejection system for the forward motion and an accordion-like system for the retraction. Four manipulators inspired by the tongue of the chameleon and based on this design have been developed, resulting in three characteristics similar to the tongue of the chameleon: extensibility of the manipulator, flexibility of the mobile part, and absence of continuous force during the forward motion. The first manipulator mimics the basic mechanism of the tongue of the chameleon and reproduced its basic performances. A second manipulator performs a catching function at a speed of 3.5 m s{sup -1} with an acceleration of 573 m s{sup -2} while elongating seven times its rest length. The design of this manipulator is such that the dc motor used for retraction applies a torque 25 times its rated torque. Moreover, during the retraction, the mobile part of the manipulator moves due to its own inertia, allowing the dc motor to rotate at full velocity. In another manipulator, the addition of an elastomer in the mobile part allows for control of the retraction velocity. A model for these two manipulators compares well with the experimental data. Finally, the addition of wings on the mobile part allows us to take the advantage of aerodynamic effects, which is unusual for manipulators.
Manipulators inspired by the tongue of the chameleon.
Debray, Alexis
2011-06-01
Chameleons have developed a specialized ballistic tongue which elongates more than six times its rest length at speeds higher than 3.5 m s(-1) and accelerations 350 m s(-2), with a highly flexible mobile part, and which applies no continuous force during forward motion. These characteristics are possible because this tongue consists of two highly specialized systems, an ejection system for the forward motion and an accordion-like system for the retraction. Four manipulators inspired by the tongue of the chameleon and based on this design have been developed, resulting in three characteristics similar to the tongue of the chameleon: extensibility of the manipulator, flexibility of the mobile part, and absence of continuous force during the forward motion. The first manipulator mimics the basic mechanism of the tongue of the chameleon and reproduced its basic performances. A second manipulator performs a catching function at a speed of 3.5 m s(-1) with an acceleration of 573 m s(-2) while elongating seven times its rest length. The design of this manipulator is such that the dc motor used for retraction applies a torque 25 times its rated torque. Moreover, during the retraction, the mobile part of the manipulator moves due to its own inertia, allowing the dc motor to rotate at full velocity. In another manipulator, the addition of an elastomer in the mobile part allows for control of the retraction velocity. A model for these two manipulators compares well with the experimental data. Finally, the addition of wings on the mobile part allows us to take the advantage of aerodynamic effects, which is unusual for manipulators.
Indian Academy of Sciences (India)
, i is referred to as the loop-index, 'stat-body' is any sequence of ... while i ~ N do stat-body; i: = i+ 1; endwhile. The algorithm for sorting the numbers is described in Table 1 and the algorithmic steps on a list of 4 numbers shown in. Figure 1.
Effect of the chameleon scalar field on brane cosmological evolution
Directory of Open Access Journals (Sweden)
Y. Bisabr
2017-11-01
Full Text Available We have investigated a brane world model in which the gravitational field in the bulk is described both by a metric tensor and a minimally coupled scalar field. This scalar field is taken to be a chameleon with an appropriate potential function. The scalar field interacts with matter and there is an energy transfer between the two components. We find a late-time asymptotic solution which exhibits late-time accelerating expansion. We also show that the Universe recently crosses the phantom barrier without recourse to any exotic matter. We provide some thermodynamic arguments which constrain both the direction of energy transfer and dynamics of the extra dimension.
Effect of the chameleon scalar field on brane cosmological evolution
Bisabr, Y.; Ahmadi, F.
2017-11-01
We have investigated a brane world model in which the gravitational field in the bulk is described both by a metric tensor and a minimally coupled scalar field. This scalar field is taken to be a chameleon with an appropriate potential function. The scalar field interacts with matter and there is an energy transfer between the two components. We find a late-time asymptotic solution which exhibits late-time accelerating expansion. We also show that the Universe recently crosses the phantom barrier without recourse to any exotic matter. We provide some thermodynamic arguments which constrain both the direction of energy transfer and dynamics of the extra dimension.
On the anomalous afterglow seen in a chameleon afterglow search
Energy Technology Data Exchange (ETDEWEB)
Steffen, Jason H.; Baumbaugh, Alan; Chou, Aaron S.; Tomlin, Ray; /Fermilab; Upadhye, Amol; /Argonne, PHY
2012-05-01
We present data from our investigation of the anomalous orange-colored afterglow that was seen in the GammeV Chameleon Afterglow Search (CHASE). These data include information about the broadband color of the observed glow, the relationship between the glow and the temperature of the apparatus, and other data taken prior to, and during the science operations of CHASE. While differing in several details, the generic properties of the afterglow from CHASE are similar to luminescence seen in some vacuum compounds. Contamination from this, or similar, luminescent signatures will likely impact the design of implementation of future experiments involving single photon detectors and high intensity light sources in a cryogenic environment.
Indian Academy of Sciences (India)
Algorithms. 3. Procedures and Recursion. R K Shyamasundar. In this article we introduce procedural abstraction and illustrate its uses. Further, we illustrate the notion of recursion which is one of the most useful features of procedural abstraction. Procedures. Let us consider a variation of the pro blem of summing the first M.
Indian Academy of Sciences (India)
number of elements. We shall illustrate the widely used matrix multiplication algorithm using the two dimensional arrays in the following. Consider two matrices A and B of integer type with di- mensions m x nand n x p respectively. Then, multiplication of. A by B denoted, A x B , is defined by matrix C of dimension m xp where.
Chameleon gravity, electrostatics, and kinematics in the outer galaxy
Energy Technology Data Exchange (ETDEWEB)
Pourhasan, R.; Mann, R.B. [Department of Physics and Astronomy, University of Waterloo, Waterloo, Ontario N2L 3G1 (Canada); Afshordi, N. [Perimeter Institute for Theoretical Physics, 31 Caroline St. N., Waterloo, ON, N2L 2Y5 (Canada); Davis, A.C., E-mail: r2pourhasan@uwaterloo.ca, E-mail: nafshordi@perimeterinstitute.ca, E-mail: rbmann@sciborg.uwaterloo.ca, E-mail: A.C.Davis@damtp.cam.ac.uk [Department of Applied Mathematics and Theoretical Physics, Centre for Mathematical Sciences, Cambridge CB3 0WA (United Kingdom)
2011-12-01
Light scalar fields are expected to arise in theories of high energy physics (such as string theory), and find phenomenological motivations in dark energy, dark matter, or neutrino physics. However, the coupling of light scalar fields to ordinary (or dark) matter is strongly constrained from laboratory, solar system, and astrophysical tests of the fifth force. One way to evade these constraints in dense environments is through the chameleon mechanism, where the field's mass steeply increases with ambient density. Consequently, the chameleonic force is only sourced by a thin shell near the surface of dense objects, which significantly reduces its magnitude. In this paper, we argue that thin-shell conditions are equivalent to ''conducting'' boundary conditions in electrostatics. As an application, we use the analogue of the method of images to calculate the back-reaction (or self-force) of an object around a spherical gravitational source. Using this method, we can explicitly compute the violation of the equivalence principle in the outskirts of galactic haloes (assuming an NFW dark matter profile): Intermediate mass satellites can be slower than their larger/smaller counterparts by as much as 10% close to a thin shell.
Dynamic sex chromosomes in Old World chameleons (Squamata: Chamaeleonidae).
Nielsen, S V; Banks, J L; Diaz, R E; Trainor, P A; Gamble, T
2018-01-18
Much of our current state of knowledge concerning sex chromosome evolution is based on a handful of 'exceptional' taxa with heteromorphic sex chromosomes. However, classifying the sex chromosome systems of additional species lacking easily identifiable, heteromorphic sex chromosomes is indispensable if we wish to fully understand the genesis, degeneration and turnover of vertebrate sex chromosomes. Squamate reptiles (lizards and snakes) are a potential model clade for studying sex chromosome evolution as they exhibit a suite of sex-determining modes yet most species lack heteromorphic sex chromosomes. Only three (of 203) chameleon species have identified sex chromosome systems (all with female heterogamety, ZZ/ZW). This study uses a recently developed method to identify sex-specific genetic markers from restriction site-associated DNA sequence (RADseq) data, which enables the identification of sex chromosome systems in species lacking heteromorphic sex chromosomes. We used RADseq and subsequent PCR validation to identify an XX/XY sex chromosome system in the veiled chameleon (Chamaeleo calyptratus), revealing a novel transition in sex chromosome systems within the Chamaeleonidae. The sex-specific genetic markers identified here will be essential in research focused on sex-specific, comparative, functional and developmental evolutionary questions, further promoting C. calyptratus' utility as an emerging model organism. © 2018 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2018 European Society For Evolutionary Biology.
The Chameleon Syndrome: A Social Psychological Dimension of the Female Sex Role
Rosen, Bernard C.; Aneshensel, Carol S.
1976-01-01
This study assesses the incidence and social correlates of the female form of the Chameleon Syndrome--an accommodative response to an environment perceived as hostile to inappropriate sex role behavior--among a sample of 3200 American adolescents. (Author)
Directory of Open Access Journals (Sweden)
Marco Ceccarelli
2015-03-01
Full Text Available In this paper a conceptual kinematic design of a chameleon-like robot with proper mobility capacity is presented for service applications in space stations as result of design considerations with biomimetic inspiration by looking at chameleons. Requirements and characteristics are discussed with the aim to identify design problems and operation features. A study of feasibility is described through performance evaluation by using simulations for a basic operation characterization.
Standard Electroweak Interactions in Gravitational Theory with Chameleon Field and Torsion
Ivanov, A N
2015-01-01
We propose a version of a gravitational theory with the torsion field, induced by the chameleon field. Following Hojman et al. Phys. Rev. D17, 3141 (1976) the results, obtained in Phys. Rev. D90, 045040 (2014), are generalised by extending the Einstein gravity to the Einstein-Cartan gravity with the torsion field as a gradient of the chameleon field through a modification of local gauge invariance of minimal coupling in the Weinberg-Salam electroweak model. The contributions of the chameleon (torsion) field to the observables of electromagnetic and weak processes are calculated. Since in our approach the chameleon-photon coupling constant beta_(gamma) is equal to the chameleon-matter coupling constant beta, i.e. beta_(gamma) = beta, the experimental constraints on beta, obtained in terrestrial laboratories by T. Jenke et al. (Phys. Rev. Lett. 112, 115105 (2014)) and by H. Lemmel et al. (Phys. Lett. B743, 310 (2015)), can be used for the analysis of astrophysical sources of chameleons, proposed by C. Burrage e...
NetCSSP: web application for predicting chameleon sequences and amyloid fibril formation
Kim, Changsik; Choi, Jiwon; Lee, Seong Joon; Welsh, William J.; Yoon, Sukjoon
2009-01-01
The calculation of contact-dependent secondary structure propensity (CSSP) is a unique and sensitive method that detects non-native secondary structure propensities in protein sequences. This method has applications in predicting local conformational change, which typically is observed in core sequences of protein aggregation and amyloid fibril formation. NetCSSP implements the latest version of the CSSP algorithm and provides a Flash chart-based graphic interface that enables an interactive calculation of CSSP values for any user-selected regions in a given protein sequence. This feature also can quantitatively estimate the mutational effect on changes in native or non-native secondary structural propensities in local sequences. In addition, this web tool provides precalculated non-native secondary structure propensities for over 1 400 000 fragments that are seven-residues long, collected from PDB structures. They are searchable for chameleon subsequences that can serve as the core of amyloid fibril formation. The NetCSSP web tool is available at http://cssp2.sookmyung.ac.kr/. PMID:19468045
Sankhyan, Anek R.; Čerňanský, Andrej
2016-12-01
Miocene rare fossils from India, tentatively attributed to chameleons, are described for the first time. The material consists of a fragment of the left squamosal and an element interpreted as a posterodorsal process of the parietal. The specimens come from a late Miocene site of the Nagri Formation (Middle Siwaliks, 9 Mya) at Haritalyangar, North India. This material presents a possible evidence for a chameleon dispersal to Asia. Based on molecular data, the dispersion of an Asian chamaeleonid lineage from Africa to Arabia/Asia is dated at approximately 13 Mya and its diversification in situ at around 6-8 Mya. However, till now, no Miocene-age fossil record has been described to support crown chamaeleonid presence in this area. The material described herein is very fragmented. If correctly allocated, the Haritalyangar chameleons show the oldest known occurrence of this clade in India, at least approximately 9 Mya ago.
Chameleon's behavior of modulable nonlinear electrical transmission line
Togueu Motcheyo, A. B.; Tchinang Tchameu, J. D.; Fewo, S. I.; Tchawoua, C.; Kofane, T. C.
2017-12-01
We show that modulable discrete nonlinear transmission line can adopt Chameleon's behavior due to the fact that, without changing its appearance structure, it can become alternatively purely right or left handed line which is different to the composite one. Using a quasidiscrete approximation, we derive a nonlinear Schrödinger equation, that predicts accurately the carrier frequency threshold from the linear analysis. It appears that the increasing of the linear capacitor in parallel in the series branch induced the selectivity of the filter in the right-handed region while it increases band pass filter in the left-handed region. Numerical simulations of the nonlinear model confirm the forward wave in the right handed line and the backward wave in the left handed one.
Sexual Dimorphism in Bite Performance Drives Morphological Variation in Chameleons
da Silva, Jessica M.; Herrel, Anthony; Measey, G. John; Tolley, Krystal A.
2014-01-01
Phenotypic performance in different environments is central to understanding the evolutionary and ecological processes that drive adaptive divergence and, ultimately, speciation. Because habitat structure can affect an animal’s foraging behaviour, anti-predator defences, and communication behaviour, it can influence both natural and sexual selection pressures. These selective pressures, in turn, act upon morphological traits to maximize an animal’s performance. For performance traits involved in both social and ecological activities, such as bite force, natural and sexual selection often interact in complex ways, providing an opportunity to understand the adaptive significance of morphological variation with respect to habitat. Dwarf chameleons within the Bradypodion melanocephalum-Bradypodion thamnobates species complex have multiple phenotypic forms, each with a specific head morphology that could reflect its use of either open- or closed-canopy habitats. To determine whether these morphological differences represent adaptations to their habitats, we tested for differences in both absolute and relative bite performance. Only absolute differences were found between forms, with the closed-canopy forms biting harder than their open-canopy counterparts. In contrast, sexual dimorphism was found for both absolute and relative bite force, but the relative differences were limited to the closed-canopy forms. These results indicate that both natural and sexual selection are acting within both habitat types, but to varying degrees. Sexual selection seems to be the predominant force within the closed-canopy habitats, which are more protected from aerial predators, enabling chameleons to invest more in ornamentation for communication. In contrast, natural selection is likely to be the predominant force in the open-canopy habitats, inhibiting the development of conspicuous secondary sexual characteristics and, ultimately, enforcing their overall diminutive body size and
Molnar, Julia L; Diaz, Raul E; Skorka, Tautis; Dagliyan, Grant; Diogo, Rui
2017-09-01
Chameleon species have recently been adopted as models for evo-devo and macroevolutionary processes. However, most anatomical and developmental studies of chameleons focus on the skeleton, and information about their soft tissues is scarce. Here, we provide a detailed morphological description based on contrast enhanced micro-CT scans and dissections of the adult phenotype of all the forelimb and hindlimb muscles of the Veiled Chameleon (Chamaeleo calyptratus) and compare these muscles with those of other chameleons and lizards. We found the appendicular muscle anatomy of chameleons to be surprisingly conservative considering the remarkable structural and functional modifications of the limb skeleton, particularly the distal limb regions. For instance, the zygodactyl autopodia of chameleons are unique among tetrapods, and the carpals and tarsals are highly modified in shape and number. However, most of the muscles usually present in the manus and pes of other lizards are present in the same configuration in chameleons. The most obvious muscular features related to the peculiar opposable autopodia of chameleons are: (1) presence of broad, V-shaped plantar and palmar aponeuroses, and absence of intermetacarpales and intermetatarsales, between the digits separated by the cleft in each autopod; (2) oblique orientation of the superficial short flexors originating from these aponeuroses, which may allow these muscles to act as powerful adductors of the "super-digits"; and (3) well-developed abductor digiti minimi muscles and abductor pollicis/hallucis brevis muscles, which may act as powerful abductors of the "super-digits." © 2017 Wiley Periodicals, Inc.
Aggregation of Chameleon Peptides: Implications of α-Helicity in Fibril Formation.
Kim, Bongkeun; Do, Thanh D; Hayden, Eric Y; Teplow, David B; Bowers, Michael T; Shea, Joan-Emma
2016-07-07
We investigate the relationship between the inherent secondary structure and aggregation propensity of peptides containing chameleon sequences (i.e., sequences that can adopt either α or β structure depending on context) using a combination of replica exchange molecular dynamics simulations, ion-mobility mass spectrometry, circular dichroism, and transmission electron microscopy. We focus on an eight-residue long chameleon sequence that can adopt an α-helical structure in the context of the iron-binding protein from Bacillus anthracis (PDB id 1JIG ) and a β-strand in the context of the baculovirus P35 protein (PDB id 1P35 ). We show that the isolated chameleon sequence is intrinsically disordered, interconverting between α-helical and β-rich conformations. The inherent conformational plasticity of the sequence can be constrained by addition of flanking residues with a given secondary structure propensity. Intriguingly, we show that the chameleon sequence with helical flanking residues aggregates rapidly into fibrils, whereas the chameleon sequence with flanking residues that favor β-conformations has weak aggregation propensity. This work sheds new insights into the possible role of α-helical intermediates in fibril formation.
Rovatsos, Michail; Pokorná, Martina Johnson; Altmanová, Marie; Kratochvíl, Lukáš
2015-01-01
Amniotes possess variability in sex determining mechanisms, however, this diversity is still only partially known throughout the clade and sex determining systems still remain unknown even in such a popular and distinctive lineage as chameleons (Squamata: Acrodonta: Chamaeleonidae). Here, we present evidence for female heterogamety in this group. The Malagasy giant chameleon (Furcifer oustaleti) (chromosome number 2n = 22) possesses heteromorphic Z and W sex chromosomes with heterochromatic W. The panther chameleon (Furcifer pardalis) (2n = 22 in males, 21 in females), the second most popular chameleon species in the world pet trade, exhibits a rather rare Z1Z1Z2Z2/Z1Z2W system of multiple sex chromosomes, which most likely evolved from W-autosome fusion. Notably, its neo-W chromosome is partially heterochromatic and its female-specific genetic content has expanded into the previously autosomal region. Showing clear evidence for genotypic sex determination in the panther chameleon, we resolve the long-standing question of whether or not environmental sex determination exists in this species. Together with recent findings in other reptile lineages, our work demonstrates that female heterogamety is widespread among amniotes, adding another important piece to the mosaic of knowledge on sex determination in amniotes needed to understand the evolution of this important trait. PMID:26286647
Rovatsos, Michail; Johnson Pokorná, Martina; Altmanová, Marie; Kratochvíl, Lukáš
2015-08-19
Amniotes possess variability in sex determining mechanisms, however, this diversity is still only partially known throughout the clade and sex determining systems still remain unknown even in such a popular and distinctive lineage as chameleons (Squamata: Acrodonta: Chamaeleonidae). Here, we present evidence for female heterogamety in this group. The Malagasy giant chameleon (Furcifer oustaleti) (chromosome number 2n = 22) possesses heteromorphic Z and W sex chromosomes with heterochromatic W. The panther chameleon (Furcifer pardalis) (2n = 22 in males, 21 in females), the second most popular chameleon species in the world pet trade, exhibits a rather rare Z1Z1Z2Z2/Z1Z2W system of multiple sex chromosomes, which most likely evolved from W-autosome fusion. Notably, its neo-W chromosome is partially heterochromatic and its female-specific genetic content has expanded into the previously autosomal region. Showing clear evidence for genotypic sex determination in the panther chameleon, we resolve the long-standing question of whether or not environmental sex determination exists in this species. Together with recent findings in other reptile lineages, our work demonstrates that female heterogamety is widespread among amniotes, adding another important piece to the mosaic of knowledge on sex determination in amniotes needed to understand the evolution of this important trait.
Spinner, Marlene; Westhoff, Guido; Gorb, Stanislav N
2014-06-27
Hairy adhesive systems of microscopic setae with triangular flattened tips have evolved convergently in spiders, insects and arboreal lizards. The ventral sides of the feet and tails in chameleons are also covered with setae. However, chameleon setae feature strongly elongated narrow spatulae or fibrous tips. The friction enhancing function of these microstructures has so far only been demonstrated in contact with glass spheres. In the present study, the frictional properties of subdigital setae of Chamaeleo calyptratus were measured under normal forces in the physical range on plane substrates having different roughness. We showed that chameleon setae maximize friction on a wide range of substrate roughness. The highest friction was measured on asperities of 1 μm. However, our observations of the climbing ability of Ch. calyptratus on rods of different diameters revealed that also claws and grasping feet are additionally responsible for the force generation on various substrates during locomotion.
The scaling of tongue projection in the veiled chameleon, Chamaeleo calyptratus.
Herrel, Anthony; Redding, Chrystal L; Meyers, J Jay; Nishikawa, Kiisa C
2014-08-01
Within a year of hatching, chameleons can grow by up to two orders of magnitude in body mass. Rapid growth of the feeding mechanism means that bones, muscles, and movements change as chameleons grow while needing to maintain function. A previous morphological study showed that the musculoskeletal components of the feeding apparatus grow with negative allometry relative to snout-vent length (SVL) in chameleons. Here, we investigate the scaling of prey capture kinematics and muscle physiological cross-sectional area in the veiled chameleon, Chamaeleo calyptratus. The chameleons used in this study varied in size from approximately 3 to 18 cm SVL (1-200 g). Feeding sequences of 12 chameleons of different sizes were filmed and the timing of movements and the displacements and velocities of the jaws, tongue, and the hyolingual apparatus were quantified. Our results show that most muscle cross-sectional areas as well as tongue and hyoid mass scaled with isometry relative to mandible length, yet with negative allometry relative to SVL. Durations of movement also scaled with negative allometry relative to SVL and mandible length. Distances and angles generally scaled as predicted under geometric similarity (slopes of 1 and 0, respectively), while velocities generally scaled with slopes greater than 0 relative to SVL and mandible length. These data indicate that the velocity of jaw and tongue movements is generally greater in adults compared to juveniles. The discrepancy between the scaling of cross-sectional areas versus movements suggests changes in the energy storage and release mechanisms implicated in tongue projection. Copyright © 2014 Elsevier GmbH. All rights reserved.
The Santiago-Harvard-Edinburgh-Durham void comparison I: SHEDding light on chameleon gravity tests
Cautun, Marius; Paillas, Enrique; Cai, Yan-Chuan; Bose, Sownak; Armijo, Joaquin; Li, Baojiu; Padilla, Nelson
2018-02-01
We present a systematic comparison of several existing and new void finding algorithms, focusing on their potential power to test a particular class of modified gravity models - chameleon f(R) gravity. These models deviate from standard General Relativity (GR) more strongly in low-density regions and thus voids are a promising venue to test them. We use Halo Occupation Distribution (HOD) prescriptions to populate haloes with galaxies, and tune the HOD parameters such that the galaxy two-point correlation functions are the same in both f(R) and GR models. We identify both 3D voids as well as 2D underdensities in the plane-of-the-sky to find the same void abundance and void galaxy number density profiles across all models, which suggests that they do not contain much information beyond galaxy clustering. However, the underlying void dark matter density profiles are significantly different, with f(R) voids being more underdense than GR ones, which leads to f(R) voids having a larger tangential shear signal than their GR analogues. We investigate the potential of each void finder to test f(R) models with near-future lensing surveys such as EUCLID and LSST. The 2D voids have the largest power to probe f(R) gravity, with a LSST analysis of tunnel (which is a new type of 2D underdensity introduced here) lensing distinguishing at 80 and 11σ (statistical error) f(R) models with parameters, |fR0| = 10-5 and 10-6, from GR.
Dollion, Alexis Y; Cornette, Raphaël; Tolley, Krystal A; Boistel, Renaud; Euriat, Adelaïde; Boller, Elodie; Fernandez, Vincent; Stynder, Deano; Herrel, Anthony
2015-02-01
The evolutionary history of chameleons has been predominantly studied through phylogenetic approaches as the fossil register of chameleons is limited and fragmented. The poor state of preservation of these fossils has moreover led to the origin of numerous nomen dubia, and the identification of many chameleon fossils remains uncertain. We here examine chameleon fossil fragments from the Early Pliocene Varswater formation, exposed at the locality of Langebaanweg "E" Quarry along the southwestern coast of South Africa. Our aim was to explore whether these fossil fragments could be assigned to extant genera. To do so, we used geometric morphometric approaches based on microtomographic imaging of extant chameleons as well as the fossil fragments themselves. Our study suggests that the fossils from this deposit most likely represent at least two different forms that may belong to different genera. Most fragments are phenotypically dissimilar from the South African endemic genus Bradypodion and are more similar to other chameleon genera such as Trioceros or Kinyongia. However, close phenetic similarities between some of the fragments and the Seychelles endemic Archaius or the Madagascan genus Furcifer suggest that some of these fragments may not contain enough genus-specific information to allow correct identification. Other fragments such as the parietal fragments appear to contain more genus-specific information, however. Although our data suggest that the fossil diversity of chameleons in South Africa was potentially greater than it is today, this remains to be verified based on other and more complete fragments.
Haakensen, Erik Edward
1998-01-01
The desire for low-cost reliable computing is increasing. Most current fault tolerant computing solutions are not very flexible, i.e., they cannot adapt to reliability requirements of newly emerging applications in business, commerce, and manufacturing. It is important that users have a flexible, reliable platform to support both critical and noncritical applications. Chameleon, under development at the Center for Reliable and High-Performance Computing at the University of Illinois, is a software framework. for supporting cost-effective adaptable networked fault tolerant service. This thesis details a simulation of fault injection, detection, and recovery in Chameleon. The simulation was written in C++ using the DEPEND simulation library. The results obtained from the simulation included the amount of overhead incurred by the fault detection and recovery mechanisms supported by Chameleon. In addition, information about fault scenarios from which Chameleon cannot recover was gained. The results of the simulation showed that both critical and noncritical applications can be executed in the Chameleon environment with a fairly small amount of overhead. No single point of failure from which Chameleon could not recover was found. Chameleon was also found to be capable of recovering from several multiple failure scenarios.
Self-similar chameleon Jordan-Brans-Dicke cosmological models
Belinchón, J. A.
2013-12-01
In this paper we study the chameleon Jordan-Brans-Dicke (JBD) cosmological models under the hypothesis of self-similarity. Since there are several ways to define the matter Lagrangian for a perfect fluid: L m =- ρ and L m = γρ, we show that they bring us to obtain two completely different cosmological models. In the first approach, L m =- ρ, there is ordinary matter conservation, while in the second approach, L m = γρ, we get matter creation processes. We deduce for each approach the behaviour of each physical quantity, under the self-similar hypothesis, by employing the Lie group method. The results are quite general and valid for any homogeneous geometry (FRW, Bianchi types, etc.). As example, we calculate exact solutions for each approach by considering the case of a Bianchi II geometry. In this way we can determine the exact behaviour of each physical quantity and in particular of G eff and U (the potential that mimics the cosmological constant).We compare the solutions with the obtained ones in the framework of the usual JBD models.
Force sensor for chameleon and Casimir force experiments with parallel-plate configuration
Almasi, A.; Brax, P.; Iannuzzi, D.; Sedmik, R.
2015-01-01
The search for non-Newtonian forces has been pursued following many different paths. Recently it was suggested that hypothetical chameleon interactions, which might explain the mechanisms behind dark energy, could be detected in a high-precision force measurement. In such an experiment, interactions
Selection for Social Signalling Drives the Evolution of Chameleon Colour Change
Stuart-Fox, Devi; Moussalli, Adnan
2008-01-01
Rapid colour change is a remarkable natural phenomenon that has evolved in several vertebrate and invertebrate lineages. The two principal explanations for the evolution of this adaptive strategy are (1) natural selection for crypsis (camouflage) against a range of different backgrounds and (2) selection for conspicuous social signals that maximise detectability to conspecifics, yet minimise exposure to predators because they are only briefly displayed. Here we show that evolutionary shifts in capacity for colour change in southern African dwarf chameleons (Bradypodion spp.) are associated with increasingly conspicuous signals used in male contests and courtship. To the chameleon visual system, species showing the most dramatic colour change display social signals that contrast most against the environmental background and amongst adjacent body regions. We found no evidence for the crypsis hypothesis, a finding reinforced by visual models of how both chameleons and their avian predators perceive chameleon colour variation. Instead, our results suggest that selection for conspicuous social signals drives the evolution of colour change in this system, supporting the view that transitory display traits should be under strong selection for signal detectability. PMID:18232740
Lee, Michael J.
2006-01-01
This essay argues that a sustained form can be located in the complicated history of populist rhetoric. Despite its chameleonic qualities, the advancement of populism is constituted by alterations in the focus and content, not the structure, of populist activism. This structure, or what I term its argumentative frame, positions a virtuous people…
Selection for social signalling drives the evolution of chameleon colour change.
Directory of Open Access Journals (Sweden)
Devi Stuart-Fox
2008-01-01
Full Text Available Rapid colour change is a remarkable natural phenomenon that has evolved in several vertebrate and invertebrate lineages. The two principal explanations for the evolution of this adaptive strategy are (1 natural selection for crypsis (camouflage against a range of different backgrounds and (2 selection for conspicuous social signals that maximise detectability to conspecifics, yet minimise exposure to predators because they are only briefly displayed. Here we show that evolutionary shifts in capacity for colour change in southern African dwarf chameleons (Bradypodion spp. are associated with increasingly conspicuous signals used in male contests and courtship. To the chameleon visual system, species showing the most dramatic colour change display social signals that contrast most against the environmental background and amongst adjacent body regions. We found no evidence for the crypsis hypothesis, a finding reinforced by visual models of how both chameleons and their avian predators perceive chameleon colour variation. Instead, our results suggest that selection for conspicuous social signals drives the evolution of colour change in this system, supporting the view that transitory display traits should be under strong selection for signal detectability.
Adolescents as chameleons? : social-environmental factors involved in the development of smoking
Harakeh, Zeena
2006-01-01
Why do some adolescents initiate smoking and continue in young adulthood and others do not? Do young people react to their immediate environment and adjust their behavior to this environment, in other words, do young people behave as chameleons? The detrimental consequences of smoking in combination
A unique life history among tetrapods: an annual chameleon living mostly as an egg.
Karsten, Kristopher B; Andriamandimbiarisoa, Laza N; Fox, Stanley F; Raxworthy, Christopher J
2008-07-01
The approximately 28,300 species of tetrapods (four-limbed vertebrates) almost exclusively have perennial life spans. Here, we report the discovery of a remarkable annual tetrapod from the arid southwest of Madagascar: the chameleon Furcifer labordi, with a posthatching life span of just 4-5 months. At the start of the active season (November), an age cohort of hatchlings emerges; larger juveniles or adults are not present. These hatchlings grow rapidly, reach sexual maturity in less than 2 months, and reproduce in January-February. After reproduction, senescence appears, and the active season concludes with population-wide adult death. Consequently, during the dry season, the entire population is represented by developing eggs that incubate for 8-9 months before synchronously hatching at the onset of the following rainy season. Remarkably, this chameleon spends more of its short annual life cycle inside the egg than outside of it. Our review of tetrapod longevity (>1,700 species) finds no others with such a short life span. These findings suggest that the notorious rapid death of chameleons in captivity may, for some species, actually represent the natural adult life span. Consequently, a new appraisal may be warranted concerning the viability of chameleon breeding programs, which could have special significance for species of conservation concern. Additionally, because F. labordi is closely related to other perennial species, this chameleon group may prove also to be especially well suited for comparative studies that focus on life history evolution and the ecological, genetic, and/or hormonal determinants of aging, longevity, and senescence.
Katz, Hadas Ketter; Lustig, Avichai; Lev-Ari, Tidhar; Nov, Yuval; Rivlin, Ehud; Katzir, Gadi
2015-07-01
Chameleons perform large-amplitude eye movements that are frequently referred to as independent, or disconjugate. When prey (an insect) is detected, the chameleon's eyes converge to view it binocularly and 'lock' in their sockets so that subsequent visual tracking is by head movements. However, the extent of the eyes' independence is unclear. For example, can a chameleon visually track two small targets simultaneously and monocularly, i.e. one with each eye? This is of special interest because eye movements in ectotherms and birds are frequently independent, with optic nerves that are fully decussated and intertectal connections that are not as developed as in mammals. Here, we demonstrate that chameleons presented with two small targets moving in opposite directions can perform simultaneous, smooth, monocular, visual tracking. To our knowledge, this is the first demonstration of such a capacity. The fine patterns of the eye movements in monocular tracking were composed of alternating, longer, 'smooth' phases and abrupt 'step' events, similar to smooth pursuits and saccades. Monocular tracking differed significantly from binocular tracking with respect to both 'smooth' phases and 'step' events. We suggest that in chameleons, eye movements are not simply 'independent'. Rather, at the gross level, eye movements are (i) disconjugate during scanning, (ii) conjugate during binocular tracking and (iii) disconjugate, but coordinated, during monocular tracking. At the fine level, eye movements are disconjugate in all cases. These results support the view that in vertebrates, basic monocular control is under a higher level of regulation that dictates the eyes' level of coordination according to context. © 2015. Published by The Company of Biologists Ltd.
Constructing a graph of connections in clustering algorithm of complex objects
Directory of Open Access Journals (Sweden)
Татьяна Шатовская
2015-05-01
Full Text Available The article describes the results of modifying the algorithm Chameleon. Hierarchical multi-level algorithm consists of several phases: the construction of the count, coarsening, the separation and recovery. Each phase can be used various approaches and algorithms. The main aim of the work is to study the quality of the clustering of different sets of data using a set of algorithms combinations at different stages of the algorithm and improve the stage of construction by the optimization algorithm of k choice in the graph construction of k of nearest neighbors
Johnson, James G; Naples, Lisa M; Chu, Caroline; Kinsel, Michael J; Flower, Jennifer E; Van Bonn, William G
2016-09-01
A 3-yr-old male panther chameleon (Furcifer pardalis) presented with bilateral raised crusted skin lesions along the lateral body wall that were found to be carcinoma in situ and squamous cell carcinoma. Similar lesions later developed on the caudal body wall and tail. A subcutaneous implantable carboplatin bead was placed in the first squamous cell carcinoma lesion identified. Additional new lesions sampled were also found to be squamous cell carcinomas, and viral polymerase chain reaction was negative for papillomaviruses and herpesviruses. Significant skin loss would have resulted from excision of all the lesions, so treatment with only carboplatin beads was used. No adverse effects were observed. Lesions not excised that were treated with beads decreased in size. This is the first description of cutaneous squamous cell carcinoma and treatment with carboplatin implantable beads in a panther chameleon.
Magnin, Eloi; Thomas-Antérion, Catherine; Sylvestre, Geraldine; Haffen, Sophie; Magnin-Feysot, Virgile; Rumbach, Lucien
2014-01-01
The term "chameleon" was first used in the seventeenth century by Sydenham to describe a patient with a protean semiology. We report a single case of "chameleon" syndrome that challenges the current international criteria for somatoform disorders, dissociative amnesia, and Ganser syndrome. The florid symptoms were as follows: anterograde and retrograde amnesia (including semantic, episodic, and procedural deficits), loss of identity, atypical neuropsychological impairment (approximate answers), left sensitive and motor deficit, and left pseudochoreoathetosis movement disorders. Additional behavioral disorders included the following: anxiety, clouded consciousness, hallucinations, and "belle indifference". A single photon emission computed tomography examination showed bilateral temporal, frontal and a right caudate (in the head of the caudate nucleus) hypoperfusion concordant with a common mechanism of repression in these disorders.
Can the Chameleon mechanism explain cosmic acceleration while satisfying Solar System constraints ?
Hees, A
2013-01-01
The chameleon mechanism appearing in massive tensor-scalar theory of gravity can effectively reduce the nonminimal coupling between the scalar field and matter. This mechanism is invoked to reconcile cosmological data requiring introduction of Dark Energy with small-scale stringent constraints on General Relativity. In this communication, we present constraints on this mechanism obtained by a cosmological analysis (based on Supernovae Ia data) and by a Solar System analysis (based on PPN formalism).
Bar-Yaacov, Dan; Hadjivasiliou, Zena; Levin, Liron; Barshad, Gilad; Zarivach, Raz; Bouskila, Amos; Mishmar, Dan
2015-01-01
Compatibility between the nuclear (nDNA) and mitochondrial (mtDNA) genomes is important for organismal health. However, its significance for major evolutionary processes such as speciation is unclear, especially in vertebrates. We previously identified a sharp mtDNA-specific sequence divergence between morphologically indistinguishable chameleon populations (Chamaeleo chamaeleon recticrista) across an ancient Israeli marine barrier (Jezreel Valley). Because mtDNA introgression and gender-based dispersal were ruled out, we hypothesized that mtDNA spatial division was maintained by mito-nuclear functional compensation. Here, we studied RNA-seq generated from each of ten chameleons representing the north and south populations and identified candidate nonsynonymous substitutions (NSSs) matching the mtDNA spatial distribution. The most prominent NSS occurred in 14 nDNA-encoded mitochondrial proteins. Increased chameleon sample size (N = 70) confirmed the geographic differentiation in POLRMT, NDUFA5, ACO1, LYRM4, MARS2, and ACAD9. Structural and functionality evaluation of these NSSs revealed high functionality. Mathematical modeling suggested that this mito-nuclear spatial divergence is consistent with hybrid breakdown. We conclude that our presented evidence and mathematical model underline mito-nuclear interactions as a likely role player in incipient speciation in vertebrates. PMID:26590214
Mechanisms of spectral tuning in the RH2 pigments of Tokay gecko and American chameleon
Takenaka, Naomi; Yokoyama, Shozo
2009-01-01
At present, molecular bases of spectral tuning in rhodopsin-like (RH2) pigments are not well understood. Here, we have constructed the RH2 pigments of nocturnal Tokay gecko (Gekko gekko) and diurnal American chameleon (Anolis carolinensis) as well as chimeras between them. The RH2 pigments of the gecko and chameleon reconstituted with 11-cis-retinal had the wavelengths of maximal absorption (λmax’s) of 467 and 496 nm, respectively. Chimeric pigment analyses indicated that 76–86%, 14–24%, and 10% of the spectral difference between them could be explained by amino acid differences in transmembrane (TM) helices I~IV, V~VII, and amino acid interactions between the two segments, respectively. Evolutionary and mutagenesis analyses revealed that the λmax’s of the gecko and chameleon pigments diverged from each other not only by S49A (serine to alanine replacement at residue 49), S49F (serine to phenylalanine), L52M (leucine to methionine), D83N (aspartic acid to asparagine), M86T (methionine to thereonine), and T97A (threonine to alanine) but also by other amino acid replacements that cause minor λmax-shifts individually. PMID:17590287
Kraus, Fred; Medeiros, Arthur; Preston, David; Jarnevich, Catherine S.; Rodda, Gordon H.
2012-01-01
We summarize information on current distribution of the invasive lizard Chamaeleo jacksonii and predict its potential distribution in the Hawaiian Islands. Potential distribution maps are based on climate models developed from known localities in its native range and its Hawaiian range. We also present results of analysis of stomach contents of a sample of 34 chameleons collected from native, predominantly dryland, forest on Maui. These data are the first summarizing prey range of this non-native species in an invaded native-forest setting. Potential distribution models predict that the species can occur throughout most of Hawaii from sea level to >2,100 m elevation. Important features of this data set are that approximately one-third of the diet of these lizards is native insects, and the lizards are consuming large numbers of arthropods each day. Prey sizes span virtually the entire gamut of native Hawaiian arthropod diversity, thereby placing a large number of native species at risk of predation. Our dietary results contrast with expectations for most iguanian lizards and support suggestions that chameleons comprise a third distinct foraging-mode category among saurians. The combination of expanding distribution, large potential range size, broad diet, high predation rates, and high densities of these chameleons imply that they may well become a serious threat to some of the Hawaiian fauna.
PREPARING OF THE CHAMELEON COATING BY THE ION JET DEPOSITION METHOD
Directory of Open Access Journals (Sweden)
Jakub Skocdopole
2017-07-01
Full Text Available Preparation of chameleon coatings using an Ionized Jet Deposition (IJD technique is reported in the present paper. IJD is a new flexible method for thin film deposition developed by Noivion, Srl. The chameleon coatings are thin films characterised by a distinct change of their tribological properties according to the external conditions. The deposited films of SiC and TiN materials were examined by the Raman spectroscopy, SEM and XPS. The results of the Raman spectroscopy have proved an amorphous structure of SiC films. The data from XPS on TiN films have shown that the films are heavily oxidized, but also prove that the films are composed of TiN and pure Ti. The SEM provided information about the size of grains and particles constituting the deposited films, which is important for tribological properties of the films. Deposition of the chameleon coating is very complex problem and IJD could be ideal method for preparation of this coating.
Chameleon-Inspired Mechanochromic Photonic Films Composed of Non-Close-Packed Colloidal Arrays.
Lee, Gun Ho; Choi, Tae Min; Kim, Bomi; Han, Sang Hoon; Lee, Jung Min; Kim, Shin-Hyun
2017-11-28
Chameleons use a non-close-packed array of guanine nanocrystals in iridophores to develop and tune skin colors in the full visible range. Inspired by the biological process uncovered in panther chameleons, we designed photonic films containing a non-close-packed face-centered-cubic array of silica particles embedded in an elastomer. The non-close-packed array is formed by interparticle repulsion exerted by solvation layers on the particle surface, which is rapidly captured in the elastomer by photocuring of the dispersion medium. The artificial skin exhibits a structural color that shifts from red to blue under stretching or compression. The separation between inelastic particles enables tuning without experiencing significant rearrangement of particles, providing elastic deformation and reversible color change, as chameleons do. The simple fabrication procedure consists of film casting and UV irradiation, potentially enabling the continuous high-throughput production. The mechanochromic property of the photonic films enables the visualization of deformation or stress with colors, which is potentially beneficial for various applications, including mechanical sensors, sound-vision transformers, and color display.
Directory of Open Access Journals (Sweden)
Antonia M Florio
Full Text Available The Malagasy giant chameleons (Furcifer oustaleti and Furcifer verrucosus are sister species that are both broadly distributed in Madagascar, and also endemic to the island. These species are also morphologically similar and, because of this, have been frequently misidentified in the field. Previous studies have suggested that cryptic species are nested within this chameleon group, and two subspecies have been described in F. verrucosus. In this study, we utilized a phylogeographic approach to assess genetic diversification within these chameleons. This was accomplished by (1 identifying clades within each species supported by both mitochondrial and nuclear DNA, (2 assessing divergence times between clades, and (3 testing for niche divergence or conservatism. We found that both F. oustaleti and F. verrucosus could be readily identified based on genetic data, and within each species, there are two well-supported clades. However, divergence times are not contemporary and spatial patterns are not congruent. Diversification within F. verrucosus occurred during the Plio-Pleistocene, and there is evidence for niche divergence between a southwestern and southeastern clade, in a region of Madagascar that shows no obvious landscape barriers to dispersal. Diversification in F. oustaleti occurred earlier in the Pliocene or Miocene, and niche conservatism is supported with two genetically distinct clades separated at the Sofia River in northwestern Madagascar. Divergence within F. verrucosus is most consistent with patterns expected from ecologically mediated speciation, whereas divergence in F. oustaleti most strongly matches the patterns expected from the riverine barrier hypothesis.
Energy Technology Data Exchange (ETDEWEB)
Chattopadhyay, Surajit [Pailan College of Management and Technology, Kolkata (India); Pasqua, Antonio [University of Trieste, Department of Physics, Trieste (Italy); Khurshudyan, Martiros [Yerevan State University, Department of Theoretical Physics, Yerevan (Armenia); Potsdam-Golm Science Park, Max Planck Institute of Colloids and Interfaces, Potsdam (Germany)
2014-09-15
Motivated by the work of Yang et al. (Mod. Phys. Lett. A 26:191, 2011), we report on a study of the new holographic dark energy (NHDE) model with energy density given by ρ{sub D} = (3φ{sup 2})/(4ω)(μH{sup 2} + νH) in the framework of chameleon Brans-Dicke cosmology. We have studied the correspondence between the quintessence, the DBI-essence, and the tachyon scalar-field models with the NHDE model in the framework of chameleon Brans-Dicke cosmology. Deriving an expression of the Hubble parameter H and, accordingly, ρ{sub D} in the context of chameleon Brans-Dicke chameleon cosmology, we have reconstructed the potentials and dynamics for these scalar-field models. Furthermore, we have examined the stability for the obtained solutions of the crossing of the phantom divide under a quantum correction of massless conformally invariant fields, and we have seen that the quantum correction could be small when the phantom crossing occurs and the obtained solutions of the phantom crossing could be stable under the quantum correction. It has also been noted that the potential increases as the matter. chameleon coupling gets stronger with the evolution of the universe. (orig.)
DEFF Research Database (Denmark)
Sigler, Lynne; Gibas, Connie Fe C.; Kokotovic, Branko
2010-01-01
mm in diameter were grossly visible in the liver and other organs. Histopathology revealed fungal elements that were spherical to ovoid in shape, fragments of slender to irregularly swollen hyphae, and occasional conidia produced on phialides. Fungal isolates were initially suspected on the basis...... of morphology results to represent Paecilomyces viridis, a species known only from one outbreak of fatal mycosis in carpet chameleons (Furcifer lateralis). Data obtained from morphological studies and from phylogenetic analyses of nuclear ribosomal rRNA (rDNA) sequence data revealed the Danish chameleon...
How CMB and large-scale structure constrain chameleon interacting dark energy
Energy Technology Data Exchange (ETDEWEB)
Boriero, Daniel [Fakultät für Physik, Universität Bielefeld, Universitätstr. 25, Bielefeld (Germany); Das, Subinoy [Indian Institute of Astrophisics, Bangalore, 560034 (India); Wong, Yvonne Y.Y., E-mail: boriero@physik.uni-bielefeld.de, E-mail: subinoy@iiap.res.in, E-mail: yvonne.y.wong@unsw.edu.au [School of Physics, The University of New South Wales, Sydney NSW 2052 (Australia)
2015-07-01
We explore a chameleon type of interacting dark matter-dark energy scenario in which a scalar field adiabatically traces the minimum of an effective potential sourced by the dark matter density. We discuss extensively the effect of this coupling on cosmological observables, especially the parameter degeneracies expected to arise between the model parameters and other cosmological parameters, and then test the model against observations of the cosmic microwave background (CMB) anisotropies and other cosmological probes. We find that the chameleon parameters α and β, which determine respectively the slope of the scalar field potential and the dark matter-dark energy coupling strength, can be constrained to α < 0.17 and β < 0.19 using CMB data and measurements of baryon acoustic oscillations. The latter parameter in particular is constrained only by the late Integrated Sachs-Wolfe effect. Adding measurements of the local Hubble expansion rate H{sub 0} tightens the bound on α by a factor of two, although this apparent improvement is arguably an artefact of the tension between the local measurement and the H{sub 0} value inferred from Planck data in the minimal ΛCDM model. The same argument also precludes chameleon models from mimicking a dark radiation component, despite a passing similarity between the two scenarios in that they both delay the epoch of matter-radiation equality. Based on the derived parameter constraints, we discuss possible signatures of the model for ongoing and future large-scale structure surveys.
Expanding horizons with Chameleon: team Missouri's innovative home automation system
Energy Technology Data Exchange (ETDEWEB)
Glass, B. [Department of Computer Engineering, Missouri University of Science and Technology, 1401 Pine Street, Rolla, MO 65409 (United States); Brannon, B. [Department of Electrical Engineering, Missouri University of Science and Technology, 1401 Pine Street, Rolla, MO 65409 (United States); Grantham, K. [Department of Engineering Management, Missouri University of Science and Technology, 1401 Pine Street, Rolla, MO 65409 (United States); Baur, S. [Department of Civil, Architectural and Environmental Engineering, Missouri University of Science and Technology, 1401 Pine Street, Rolla, MO 65409 (United States)
2010-06-15
Team Missouri's 2009 Solar Decathlon entry featured a revolutionary home automation system, Chameleon, promoting both convenience and energy savings. This was accomplished using the typical controls of a convenience based automation system, while maintaining user set points, such as a home's ambient temperature, in the most energy efficient manner. Environmental features of the system include controls for space heating, ventilation and air conditioning, lighting, windows, shades, appliances, indoor air quality, as well as indoor and outdoor irrigation. Further analysis and refinement to the prototype system displayed at the competition is also presented in this paper. (authors)
Directory of Open Access Journals (Sweden)
Kate D. L. Umbers
2012-09-01
Full Text Available A set of polymorphic loci was characterised using an enrichment library for the Australian alpine specialist, the chameleon grasshopper (Kosciuscola tristis, an atypical grasshopper known for its remarkable temperature-controlled colour change. The number of alleles per locus ranged from three to 20 and observed heterozygosity from 0.16 to 0.76. These are the first microsatellite markers for a non-endangered Australian alpine animal and will inform questions of gene flow across the sky islands of this unique and threatened region.
Expanding Horizons with Chameleon: Team Missouri’s Innovative Home Automation System
Directory of Open Access Journals (Sweden)
Bryan Glass
2010-06-01
Full Text Available Team Missouri’s 2009 Solar Decathlon entry featured a revolutionary home automation system, Chameleon, promoting both convenience and energy savings. This was accomplished using the typical controls of a convenience based automation system, while maintaining user set points, such as a home’s ambient temperature, in the most energy efficient manner. Environmental features of the system include controls for home heating, ventilation and air conditioning, lighting, windows, shades, appliances, indoor air quality, as well as indoor and outdoor irrigation. Further analysis and refinement to the prototype system displayed at the competition is also presented in this paper.
Lev-Ari, Tidhar; Lustig, Avichai; Ketter-Katz, Hadas; Baydach, Yossi; Katzir, Gadi
2016-08-01
A chameleon (Chamaeleo chamaeleon) on a perch responds to a nearby threat by moving to the side of the perch opposite the threat, while bilaterally compressing its abdomen, thus minimizing its exposure to the threat. If the threat moves, the chameleon pivots around the perch to maintain its hidden position. How precise is the body rotation and what are the patterns of eye movement during avoidance? Just-hatched chameleons, placed on a vertical perch, on the side roughly opposite to a visual threat, adjusted their position to precisely opposite the threat. If the threat were moved on a horizontal arc at angular velocities of up to 85°/s, the chameleons co-rotated smoothly so that (1) the angle of the sagittal plane of the head relative to the threat and (2) the direction of monocular gaze, were positively and significantly correlated with threat angular position. Eye movements were role-dependent: the eye toward which the threat moved maintained a stable gaze on it, while the contralateral eye scanned the surroundings. This is the first description, to our knowledge, of such a response in a non-flying terrestrial vertebrate, and it is discussed in terms of possible underlying control systems.
Murakami-Ramalho, Elizabeth; Piert, Joyce; Militello, Matthew
2008-01-01
In this article, the authors use their personal narratives and collaborative portraits as methods to shed light on the complexities of developing a research identity while journeying through a doctoral program. Using the metaphors of a wanderer, a chameleon, and a warrior, their narratives represent portraits of experiences faced by doctoral…
Directory of Open Access Journals (Sweden)
Michael W Butler
Full Text Available Stressors frequently increase oxidative damage--unless organisms simultaneously mount effective antioxidant responses. One putative mitigative mechanism is the use of biliverdin, an antioxidant produced in the spleen during erythrocyte degradation. We hypothesized that both wild and captive-bred male veiled chameleons (Chamaeleo calyptratus, which are highly aggressive to conspecifics, would respond to agonistic displays with increased levels of oxidative damage, but that increased levels of biliverdin would limit this increase. We found that even just visual exposure to a potential combatant resulted in decreased body mass during the subsequent 48-hour period, but that hematocrit, biliverdin concentration in the bile, relative spleen size, and oxidative damage in plasma, liver, and spleen were unaffected. Contrary to our predictions, we found that individuals with smaller spleens exhibited greater decreases in hematocrit and higher bile biliverdin concentrations, suggesting a revision to the idea of spleen-dependent erythrocyte processing. Interestingly, individuals with larger spleens had reduced oxidative damage in both the liver and spleen, demonstrating the spleen's importance in modulating oxidative damage. We also uncovered differences in spleen size and oxidative damage between wild and captive-bred chameleons, highlighting environmentally dependent differences in oxidative physiology. Lastly, we found no relationship between oxidative damage and biliverdin concentration, calling into question biliverdin's antioxidant role in this species.
Butler, Michael W; Ligon, Russell A
2015-01-01
Stressors frequently increase oxidative damage--unless organisms simultaneously mount effective antioxidant responses. One putative mitigative mechanism is the use of biliverdin, an antioxidant produced in the spleen during erythrocyte degradation. We hypothesized that both wild and captive-bred male veiled chameleons (Chamaeleo calyptratus), which are highly aggressive to conspecifics, would respond to agonistic displays with increased levels of oxidative damage, but that increased levels of biliverdin would limit this increase. We found that even just visual exposure to a potential combatant resulted in decreased body mass during the subsequent 48-hour period, but that hematocrit, biliverdin concentration in the bile, relative spleen size, and oxidative damage in plasma, liver, and spleen were unaffected. Contrary to our predictions, we found that individuals with smaller spleens exhibited greater decreases in hematocrit and higher bile biliverdin concentrations, suggesting a revision to the idea of spleen-dependent erythrocyte processing. Interestingly, individuals with larger spleens had reduced oxidative damage in both the liver and spleen, demonstrating the spleen's importance in modulating oxidative damage. We also uncovered differences in spleen size and oxidative damage between wild and captive-bred chameleons, highlighting environmentally dependent differences in oxidative physiology. Lastly, we found no relationship between oxidative damage and biliverdin concentration, calling into question biliverdin's antioxidant role in this species.
Using an InGrid Detector to Search for Solar Chameleons with CAST
Desch, Klaus; Krieger, Christoph; Lupberger, Michael
2015-01-01
We report on the construction, operation experience, and preliminary background measurements of an InGrid detector, i.e. a MicroMegas detector with CMOS pixel readout. The detector was mounted in the focal plane of the Abrixas X-Ray telescope at the CAST experiment at CERN. The detector is sensitive to soft X-Rays in a broad energy range (0.3--10 keV) and thus enables the search for solar chameleons. Smooth detector operation during CAST data taking in autumn 2014 has been achieved. Preliminary analysis of background data indicates a background rate of $1-5\\times 10^{-5}\\,\\mathrm{keV}^{-1}\\mathrm{cm}^{-2}\\mathrm{s}^{-1}$ above 2 keV and $\\sim 3\\times 10^{-4}\\,\\mathrm{keV}^{-1}\\mathrm{cm}^{-2}\\mathrm{s}^{-1}$ around 1 keV. An expected limit of $\\beta_\\gamma \\lesssim 5\\times 10^{10}$ on the chameleon photon coupling is estimated in case of absence of an excess in solar tracking data. We also discuss the prospects for future operation of the detector.
Eastward from Africa: palaeocurrent-mediated chameleon dispersal to the Seychelles islands.
Townsend, Ted M; Tolley, Krystal A; Glaw, Frank; Böhme, Wolfgang; Vences, Miguel
2011-04-23
Madagascar and the Seychelles are Gondwanan remnants currently isolated in the Indian Ocean. In the Late Cretaceous, these islands were joined with India to form the Indigascar landmass, which itself then split into its three component parts around the start of the Tertiary. This history is reflected in the biota of the Seychelles, which appears to contain examples of both vicariance- and dispersal-mediated divergence from Malagasy or Indian sister taxa. One lineage for which this has been assumed but never thoroughly tested is the Seychellean tiger chameleon, a species assigned to the otherwise Madagascar-endemic genus Calumma. We present a multi-locus phylogenetic study of chameleons, and find that the Seychellean species is actually the sister taxon of a southern African clade and requires accomodation in its own genus as Archaius tigris. Divergence dating and biogeographic analyses indicate an origin by transoceanic dispersal from Africa to the Seychelles in the Eocene-Oligocene, providing, to our knowledge, the first such well-documented example and supporting novel palaeocurrent reconstructions.
Ligon, Russell A; McGraw, Kevin J
2013-01-01
Many animals display static coloration (e.g. of feathers or fur) that can serve as a reliable sexual or social signal, but the communication function of rapidly changing colours (as in chameleons and cephalopods) is poorly understood. We used recently developed photographic and mathematical modelling tools to examine how rapid colour changes of veiled chameleons Chamaeleo calyptratus predict aggressive behaviour during male-male competitions. Males that achieved brighter stripe coloration were more likely to approach their opponent, and those that attained brighter head coloration were more likely to win fights; speed of head colour change was also an important predictor of contest outcome. This correlative study represents the first quantification of rapid colour change using organism-specific visual models and provides evidence that the rate of colour change, in addition to maximum display coloration, can be an important component of communication. Interestingly, the body and head locations of the relevant colour signals map onto the behavioural displays given during specific contest stages, with lateral displays from a distance followed by directed, head-on approaches prior to combat, suggesting that different colour change signals may evolve to communicate different information (motivation and fighting ability, respectively).
Age-related changes in the tooth-bone interface area of acrodont dentition in the chameleon.
Dosedělová, Hana; Štěpánková, Kateřina; Zikmund, Tomáš; Lesot, Herve; Kaiser, Jozef; Novotný, Karel; Štembírek, Jan; Knotek, Zdeněk; Zahradníček, Oldřich; Buchtová, Marcela
2016-09-01
Chameleon teeth develop as individual structures at a distance from the developing jaw bone during the pre-hatching period and also partially during the post-hatching period. However, in the adult, all teeth are fused together and tightly attached to the jaw bone by mineralized attachment tissue to form one functional unit. Tooth to bone as well as tooth to tooth attachments are so firm that if injury to the oral cavity occurs, several neighbouring teeth and pieces of jaw can be broken off. We analysed age-related changes in chameleon acrodont dentition, where ankylosis represents a physiological condition, whereas in mammals, ankylosis only occurs in a pathological context. The changes in hard-tissue morphology and mineral composition leading to this fusion were analysed. For this purpose, the lower jaws of chameleons were investigated using X-ray micro-computed tomography, laser-induced breakdown spectroscopy and microprobe analysis. For a long time, the dental pulp cavity remained connected with neighbouring teeth and also to the underlying bone marrow cavity. Then, a progressive filling of the dental pulp cavity by a mineralized matrix occurred, and a complex network of non-mineralized channels remained. The size of these unmineralized channels progressively decreased until they completely disappeared, and the dental pulp cavity was filled by a mineralized matrix over time. Moreover, the distribution of calcium, phosphorus and magnesium showed distinct patterns in the different regions of the tooth-bone interface, with a significant progression of mineralization in dentin as well as in the supporting bone. In conclusion, tooth-bone fusion in chameleons results from an enhanced production of mineralized tissue during post-hatching development. Uncovering the developmental processes underlying these outcomes and performing comparative studies is necessary to better understand physiological ankylosis; for that purpose, the chameleon can serve as a useful model
Skin pattern structure and function of juvenile ages of Chameleo chameleon
Directory of Open Access Journals (Sweden)
Yosra A. Fouda
2017-03-01
Full Text Available Little is known about the skin structure of juvenile chameleon especially its sensory function of their integumentary structure. Fifteen juvenile Chameleo chameleon are collected from Abu Rawash, Northern area of Giza, Egypt during Summer of 2015. It is belong to the order Squamata, family, Chamaeleonidae. Three ages are used in the present study and categorized according to the morphological criteria of head, abdomen and limb lengths. Dorsal abdominal surfaces are covered with abdominal scales of varying sizes either conical or elliptical-structures, regularly arranged in rows and imbricated with each other. Each scale possessed one cylindrical lenticular epidermal sense organ containing heavy sensillia. Histologically, the scales are characterized by wider conical surfaces and intermingled with another one by hinge region. The epidermal layer of outer scale surface is composed of five-layered stratified squamous epithelium including the stratum germinativum, intermediate zone of stratum spinosum and granulosum, α-keratin layer, β-keratin layer and outer superficial Oberhaütchen. Melanosomes are abundant in the intermediate zone as well as in the peripheral dermal layer underneath stratum germinativum layer. The melanosomes possessed long cellular processes with their content of melanin granules underneath the epidermis. The dermis is composed of upper collagenous and inner compact layer. Semithin sections revealed the presence of fibroblast cells, collagenous fibrils, nerve axons, melanosomes and mast cells in the connective tissue core. Increased immunoreaction of cytokeratin is observed in the epidermal layers of G3; meanwhile, an increased proliferation of epidermal and dermal cells was detected in G1. Transmission electron microscopy exhibited striking formation of dermal sense organs containing neuronal cells of both oligodendrocytes and Schwann cells with myelinated and unmyelinated nerve axons ensheathed externally by thin
Khannoon, Eraqi R.; Endlein, Thomas; Russell, Anthony P.; Autumn, Kellar
2014-01-01
The striking morphological convergence of hair-like integumentary derivatives of lizards and arthropods (spiders and insects) demonstrates the importance of such features for enhancing purchase on the locomotor substrate. These pilose structures are responsible for the unique tractive abilities of these groups of animals, enabling them to move with seeming ease on overhanging and inverted surfaces, and to traverse inclined smooth substrates. Three groups of lizards are well known for bearing adhesion-promoting setae on their digits: geckos, anoles and skinks. Similar features are also found on the ventral subdigital and distal caudal skin of chameleons. These have only recently been described in any detail, and structurally and functionally are much less well understood than are the setae of geckos and anoles. The seta-like structures of chameleons are not branched (a characteristic of many geckos), nor do they terminate in spatulate tips (which is characteristic of geckos, anoles and skinks). They are densely packed and have attenuated blunt, globose tips or broad, blade-like shafts that are flattened for much of their length. Using a force transducer, we tested the hypothesis that these structures enhance friction and demonstrate that the pilose skin has a greater frictional coefficient than does the smooth skin of these animals. Our results are consistent with friction being generated as a result of side contact of the integumentary filaments. We discuss the evolutionary and functional implications of these seta-like structures in comparison with those typical of other lizard groups and with the properties of seta-mimicking synthetic structures. PMID:24285195
Directory of Open Access Journals (Sweden)
G John Measey
Full Text Available BACKGROUND: The Eastern Arc Mountains (EAM is an example of naturally fragmented tropical forests, which contain one of the highest known concentrations of endemic plants and vertebrates. Numerous paleo-climatic studies have not provided direct evidence for ancient presence of Pleistocene forests, particularly in the regions in which savannah presently occurs. Knowledge of the last period when forests connected EAM would provide a sound basis for hypothesis testing of vicariance and dispersal models of speciation. Dated phylogenies have revealed complex patterns throughout EAM, so we investigated divergence times of forest fauna on four montane isolates in close proximity to determine whether forest break-up was most likely to have been simultaneous or sequential, using population genetics of a forest restricted arboreal chameleon, Kinyongia boehmei. METHODOLOGY/PRINCIPAL FINDINGS: We used mitochondrial and nuclear genetic sequence data and mutation rates from a fossil-calibrated phylogeny to estimate divergence times between montane isolates using a coalescent approach. We found that chameleons on all mountains are most likely to have diverged sequentially within the Pleistocene from 0.93-0.59 Ma (95% HPD 0.22-1.84 Ma. In addition, post-hoc tests on chameleons on the largest montane isolate suggest a population expansion ∼182 Ka. CONCLUSIONS/SIGNIFICANCE: Sequential divergence is most likely to have occurred after the last of three wet periods within the arid Plio-Pleistocene era, but was not correlated with inter-montane distance. We speculate that forest connection persisted due to riparian corridors regardless of proximity, highlighting their importance in the region's historic dispersal events. The population expansion coincides with nearby volcanic activity, which may also explain the relative paucity of the Taita's endemic fauna. Our study shows that forest chameleons are an apposite group to track forest fragmentation, with the
Directory of Open Access Journals (Sweden)
Zdeněk Knotek
2011-01-01
Full Text Available A two-year old male warty chameleon (Furcifer verrucosus weighing 160 g was presented for veterinary examination following 4 weeks of decreased ability to catch insects with the tongue and difficulty in swallowing the prey. Non-invasive endoscopy did not reveal any macroscopic changes of the oral cavity mucosa or the cranial part of the esophagus. Dorsoventral and laterolateral plain and contrast radiographs revealed enlargement of the medial part of the liver without any visible abnormalities in the regions of the esophagus, stomach or small intestine. Abnormalities in the plasma chemistry profile included transient hyperglycaemia (52.68–57.18 mmol/l and hyperuricaemia (452.70–622.20 μmol/l. The chameleon was examined at 7, 20 and 22 weeks after initial examination. Its body weight decreased to 120 g. A blood profile revealed normoglycaemia (16.37–10.22 mmol/l and hyperphosphataemia (2.92–3.06 mmol/l at the last three examinations. The chameleon died suddenly 33 days after the final examination. Necropsy revealed the presence of a large liver cyst, filled with fluid. The liver had lost all of its normal structure. The kidneys showed a large area with fibrosis and multiple uric acid tophi. The post mortem findings were defined as liver with fatty degeneration and moderate fibrotic changes with large cyst, subchronic nephritis with uric acid tophi, and mineralization in the myocardium. This paper describes the first documented case of transient hyperglycaemia in a warty chameleon (Furcifer verrucosus associated with chronic liver disease and subchronic nephritis.
Algorithms and Algorithmic Languages.
Veselov, V. M.; Koprov, V. M.
This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…
Search for chameleons with an InGrid based X-ray detector at the CAST experiment
Energy Technology Data Exchange (ETDEWEB)
Desch, Klaus; Kaminski, Jochen; Krieger, Christoph; Schmidt, Sebastian [Physikalisches Institut, Universitaet Bonn, Nussallee 12, 53115 Bonn (Germany)
2016-07-01
The CERN Axion Solar Telescope (CAST) searches for axions and also other exotic particles emerging from the Sun. Chameleons, for example, are part of Dark Energy theories. Like Axions they can be converted into soft X-ray photons in a high magnetic field and should result in an X-ray spectrum peaking below 1 keV. Because of their low energy and weak coupling, detectors with low energy threshold and low background rates are mandatory. Both requirements are met by an X-ray detector based on the combination of a Micromegas gas amplification stage with a highly integrated pixel chip which allows to make full use of the Micromegas structure's granularity. It has been demonstrated that these devices can detect even single electrons. Thus, allowing for a topological background suppression as well as for detection of low energy X-ray photons creating only very few primary electrons. After the detection threshold had been evaluated to be low enough to allow for the detection of the carbon K{sub α} line at 277 eV, the detector was mounted at one of CAST's X-ray telescopes and installed along with its infrastructure in 2014. During data taking until end of 2015 background rates of less than 10{sup -4} keV/(cm{sup 2}.s) have been achieved below 2 keV. First preliminary results of the ongoing chameleon analysis and possibly an improved limit for solar chameleons are presented.
Bar-Yaacov, Dan; Bouskila, Amos; Mishmar, Dan
2013-01-01
Recently, we found dramatic mitochondrial DNA divergence of Israeli Chamaeleo chamaeleon populations into two geographically distinct groups. We aimed to examine whether the same pattern of divergence could be found in nuclear genes. However, no genomic resource is available for any chameleon species. Here we present the first chameleon transcriptome, obtained using deep sequencing (SOLiD). Our analysis identified 164,000 sequence contigs of which 19,000 yielded unique BlastX hits. To test the efficacy of our sequencing effort, we examined whether the chameleon and other available reptilian transcriptomes harbored complete sets of genes comprising known biochemical pathways, focusing on the nDNA-encoded oxidative phosphorylation (OXPHOS) genes as a model. As a reference for the screen, we used the human 86 (including isoforms) known structural nDNA-encoded OXPHOS subunits. Analysis of 34 publicly available vertebrate transcriptomes revealed orthologs for most human OXPHOS genes. However, OXPHOS subunit COX8 (Cytochrome C oxidase subunit 8), including all its known isoforms, was consistently absent in transcriptomes of iguanian lizards, implying loss of this subunit during the radiation of this suborder. The lack of COX8 in the suborder Iguania is intriguing, since it is important for cellular respiration and ATP production. Our sequencing effort added a new resource for comparative genomic studies, and shed new light on the evolutionary dynamics of the OXPHOS system.
Kanda, Naoki; Asano, Takayuki; Itoh, Toshiyuki; Onoda, Makoto
1995-12-01
Anthocyanins are found in the flowers and fruits of natural plants. Since their color depends on pH, they are sometines used as a pH indicator. Since these sequences are reversible, they are also useful in demonstrating chemical equilibrium in the repetitive color changes of anthocyanins from flowers by controlling pH conditions. We prepared the polysaccharide beads conatining water extracts of red cabbage as calcium alginate. The beads showed a clear red color under acidic conditions, turned blue at neutral pH of 7, and orange-yellow at pH of 13. This color change could be demonstrated over and over. Because the color changes of these polysaccharide beads depended darmatically on pH, junior high students in science classes called them "chameleon balls" when we demonstrated this reaction for them. In this paper we describe how polysaccharide beads, which are made from calcium alginate with natural pigments, served as a teaching tool for the chemical equilibrium of anthocyanins under different pH conditions. Preparation of the chameleon ball is very easy. The most important thing is that making the chameleon ball is great fun. The ball should therefore be viewed not only as a handmade pH indicator but also an interesting teaching tool of the chemical equilibrium reaction.
[Allergic contact urticaria caused by a chameleon. Expression of sensitization to Ficus benjamina].
Sesztak-Greinecker, G; Hemmer, W; Götz, M; Jarisch, R
2005-12-01
A 31-year-old man presented with a long history of rhinoconjunctivitis and sneezing that lasted from March to May. The man kept a chameleon (Chamaeleo calyptratus) as a pet and reported about recurrent urticarial lesions, erythema, and itch after skin contact with the animal. The reactions started within a few minutes and were restricted specifically to the contact sites with the animal's claws. No comparable reactions occurred in other subjects. Allergy testing confirmed allergy to hazel, alder, birch, and ash pollen, and additionally revealed sensitization to house dust mite, cat, and Ficus benjamina. Apparently the contact dermatitis originated from passive transfer of Ficus benjamina allergens to the patient's skin by the reptile which habitually climbed on a big Ficus benjamina tree in the patient's home, thereby contaminating its claws with the plant's allergenic milky sap. Careful examination revealed strong perforation of many leaves by the pointed claws. The patient denied respiratory symptoms from Ficus benjamina and intolerance of Ficus-associated fruits.
McAllister, Chris T
2012-02-01
One of three (33%) captive specimens of Oustalet's chameleon, Furcifer oustaleti (Mocquard) originally from Madagascar and housed at the Oklahoma City Zoological Park Herpetarium, Oklahoma County, Oklahoma, USA, was found to be passing an undescribed species of Choleoeimeria in its faeces. Oocysts of Choleoeimeria fischeri sp. n. were cylindroidal, 30.3 x 16.8 (28-34 x 15-18) microm, with a smooth, bilayered wall and a length/width ratio (L/W) of 1.8. A micropyle and oocyst residuum was absent but a fragmented polar granule was often present. Sporocysts were ovoidal, 9.6 x 8.0 (9-10 x 7-9) jm, with an L/W of 1.2. Stieda, sub-Stieda, and para-Stieda bodies were absent. The sporocyst residuum consists of large globules dispersed between sporozoites. Sporozoites were elongate, 8.6 x 2.9 (8-10 x 2-3) microm, with an elongate posterior refractile body. The new species represents the second coccidian described from this lizard.
Andrews, Robin M
2008-10-01
I evaluated the effect of incubation temperature on phenotypes of the veiled chameleon, Chamaeleo calyptratus. I chose this species for study because its large clutch size (30-40 eggs or more) allows replication within clutches both within and among experimental treatments. The major research objectives were (1) to assess the effect of constant low, moderate, and high temperatures on embryonic development, (2) to determine whether the best incubation temperature for embryonic development also produced the "best" hatchlings, and (3) to determine how a change in incubation temperature during mid-development would affect phenotype. To meet these objectives, I established five experimental temperature regimes and determined egg survival and incubation length and measured body size and shape, selected body temperatures, and locomotory performance of lizards at regular intervals from hatching to 90 d, or just before sexual maturity. Incubation temperature affected the length of incubation, egg survival, and body mass, but did not affect sprint speed or selected body temperature although selected body temperature affected growth in mass independently of treatment and clutch. Incubation at moderate temperatures provided the best conditions for both embryonic and post-hatching development. The highest incubation temperatures were disruptive to development; eggs had high mortality, developmental rate was low, and hatchlings grew slowly. Changes in temperature during incubation increased the among-clutch variance in incubation length relative to that of constant temperature treatments. Copyright 2008 Wiley-Liss, Inc.
McAllister, Chris T
2012-10-01
A captive specimen of Meller's chameleon, Trioceros melleri (Gray), originally from Tanzania and housed at the Oklahoma City Zoological Park Herpetarium, Oklahoma County, Oklahoma, was found to be passing an undescribed species of Choleoeimeria in its feces. Oocysts of Choleoeimeria steveuptoni n. sp. were cylindroidal, 38.5 × 17.8 (36-42 × 17-19) µm with a bilayered wall and a shape index (length/width) of 2.2. A micropyle and oocyst residuum were absent, but a fragmented polar granule was often present. Ovoidal sporocysts were composed of 2 valves joined by a suture and measured 11.3 × 9.1 (11-12 × 9-10) µm; shape index of 1.3. Stieda, sub-Stieda, and para-Stieda bodies were absent. The sporocyst residuum consists of multiple globules dispersed along the perimeter of the sporocyst and between sporozoites. Sporozoites were elongate, 13.1 × 2.9 (12-15 × 2.6-3.2) µm with an elongate posterior refractile body. The new species represents the second coccidian documented from this lizard.
Cluster abundance in chameleon f(R) gravity I: toward an accurate halo mass function prediction
Cataneo, Matteo; Rapetti, David; Lombriser, Lucas; Li, Baojiu
2016-12-01
We refine the mass and environment dependent spherical collapse model of chameleon f(R) gravity by calibrating a phenomenological correction inspired by the parameterized post-Friedmann framework against high-resolution N-body simulations. We employ our method to predict the corresponding modified halo mass function, and provide fitting formulas to calculate the enhancement of the f(R) halo abundance with respect to that of General Relativity (GR) within a precision of lesssim 5% from the results obtained in the simulations. Similar accuracy can be achieved for the full f(R) mass function on the condition that the modeling of the reference GR abundance of halos is accurate at the percent level. We use our fits to forecast constraints on the additional scalar degree of freedom of the theory, finding that upper bounds competitive with current Solar System tests are within reach of cluster number count analyses from ongoing and upcoming surveys at much larger scales. Importantly, the flexibility of our method allows also for this to be applied to other scalar-tensor theories characterized by a mass and environment dependent spherical collapse.
Stroke Chameleons Manifesting as Distinct Radial Neuropathies: Expertise Can Hasten the Diagnosis
Directory of Open Access Journals (Sweden)
Fabrício Diniz de Lima
2017-12-01
Full Text Available Objective: Stroke chameleons encompass an atypical group of syndromes that do not initially appear to be cerebrovascular accidents. The objective of this study was to report patients with different lesions of central origin clinically presenting as wrist drop and with a semiology similar to that produced by peripheral lesions of the radial nerve at different topographical levels. Methods: This is a case series study of patients presenting with wrist drop during the acute phase of stroke who were assessed by clinical examination and CT and MRI brain scans. Results: Three cases presenting as monoparesis were evaluated. In all patients, the MRI revealed restricted diffusion in the pre- and post-central gyrus. Electromyography showed that the functionality of the radial, median, and ulnar nerves were intact in all three cases. The monoparesis resolved completely within 1 month of rehabilitation therapy, and no evidence of recurrent or new events was reported during the 6-month follow-up after stenting. Conclusion: The central message of this study is that when acute onset symptoms are present in a relatively old patient with vascular risk factors, stroke should be considered as the possible aetiology until proven otherwise, and the appropriate steps should be taken to avoid a delay in the treatment and to improve outcomes.
An Access Control Protocol for Wireless Sensor Network Using Double Trapdoor Chameleon Hash Function
Directory of Open Access Journals (Sweden)
Tejeshwari Thakur
2016-01-01
Full Text Available Wireless sensor network (WSN, a type of communication system, is normally deployed into the unattended environment where the intended user can get access to the network. The sensor nodes collect data from this environment. If the data are valuable and confidential, then security measures are needed to protect them from the unauthorized access. This situation requires an access control protocol (ACP in the design of sensor network because of sensor nodes which are vulnerable to various malicious attacks during the authentication and key establishment and the new node addition phase. In this paper, we propose a secured ACP for such WSN. This protocol is based on Elliptic Curve Discrete Log Problem (ECDLP and double trapdoor chameleon hash function which secures the WSN from malicious attacks such as node masquerading attack, replay attack, man-in-the-middle attack, and forgery attacks. Proposed ACP has a special feature known as session key security. Also, the proposed ACP is more efficient as it requires only one modular multiplication during the initialization phase.
Is viscous adhesion strong enough to allow prey capture by chameleons?
Brau, Fabian; Zghikh, Leïla-Nastasia; Bels, Vincent; Damman, Pascal
2014-01-01
Predators can be sorted in two main categories: ambush and active foragers. Most iguanian lizards are ambush predators. They remain motionless waiting for active preys to come within the reach of a strike or approach them very slowly. Among them, chameleons have developed the ultimate specialized feeding systems based on the ballistic projection of the tongue combined with a very efficient adhesion able to sustain the large accelerations involved. The projection mechanisms was intensively studied but the mechanism responsible for the strong adhesion between the prey and the tongue remains controversial. Three different mechanisms are proposed in the literature: i) wet or Stefan adhesion where the adhesion strength relies on viscous flow in the thin film of fluid between the tongue and the prey surface; ii) interlocking where the roughness of both prey and tongue surfaces self-adjust to make physical crosslinks as in the hook-and-loop design of Velcro; iii) suction mechanism similar to the one at play in rubbe...
Ivanov, A. N.; Cronenberg, G.; Höllwieser, R.; Jenke, T.; Pitschmann, M.; Wellenzohn, M.; Abele, H.
2016-10-01
We calculate the chameleon field profile, confined between two parallel plates, filled with air at pressure P =10-4 mbar and room temperature and separated by the distance L , in the chameleon field theory with Ratra-Peebles self-interaction potential with index n =1 . We give the exact analytical solution in terms of Jacobian elliptic functions, depending on the mass density of the ambient matter. The obtained analytical solution can be used in qBounce experiments, measuring transition frequencies between quantum gravitational states of ultracold neutrons and also for the calculation of the chameleon field induced Casimir force for the CANNEX experiment. We show that the chameleon-matter interactions with coupling constants β ≤1 04 can be probed by qBounce experiments with sensitivities Δ E ≤10-18 eV . At L =30.1 μ m we reproduce the result β <5.8 ×1 08 , obtained by Jenke et al. [Phys. Rev. Lett. 112, 151105 (2014)] at sensitivity Δ E ˜10-14 eV . In the vicinity of one of the plates our solution coincides with the solution, obtained by Brax and Pignol [Phys. Rev. Lett. 107, 111301 (2011)] [see also Ivanov et al. Phys. Rev. D 87, 105013 (2013)] above a plate at zero density of the ambient matter.
Directory of Open Access Journals (Sweden)
Lhermitte-Vallarino N.
2008-12-01
Full Text Available The lung nematodes of the genus Rhabdias parasitic in chameleons were previously only known from east Africa and Madagascar. Two new species are described from Cameroon: i Rhabdias okuensis n. sp., type-host Chamaeleo (Trioceros quadricornis gracilior, from Mont Oku, is frequent; it resembles R. jarki from Burundi, with a short buccal capsule and a long, thin oesophagus, and is distinguished by its large cervical vesicle and cephalic characters (mouth aperture, papillae. The female parasites are hermaphroditic (spermatozoa identified and they pierce the lung wall and induce lesions, as R. jarki. In the same locality, another chameleon, C. (T. w. wiedersheimi also harbours R. okuensis, as demonstrated with the 12S rDNA and coxI gene sequences. ii R. cristati n. sp., type-host C. (T. cristatus, from Mount Cameroon, is described from one heavily infected specimen; it resembles R. chamaeleonis from East Africa, and is distinguished by the large buccal capsule and the thick apex of the intestine. The free-living phase, studied in R. okuensis, presents characters of other Rhabdias from chameleons: heterogony, development of larvae through matricidal endotoky, infective larval stages with a thick, rounded caudal extremity, exuvium transformed into a thick cuticular sheeth. Each free-living female produces one larva, as in other African Rhabdias, whereas the female of R. gemellipara, a parasite of a Malagasy chameleon, produces two larvae.
DEFF Research Database (Denmark)
Mahnke, Martina; Uprichard, Emma
2014-01-01
changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...... would like to emphasize another side to the algorithmic everyday life. We argue that algorithms can instigate and facilitate imagination, creativity, and frivolity, while saying something that is simultaneously old and new, always almost repeating what was before but never quite returning. We show...... this by threading together stimulating quotes and screenshots from Google’s autocomplete algorithms. In doing so, we invite the reader to re-explore Google’s autocomplete algorithms in a creative, playful, and reflexive way, thereby rendering more visible some of the excitement and frivolity that comes from being...
Kirova, T.; Cinins, A.; Efimov, D. K.; Bruvelis, M.; Miculis, K.; Bezuglov, N. N.; Auzinsh, M.; Ryabtsev, I. I.; Ekers, A.
2017-10-01
This paper is devoted to clarifying the implications of hyperfine (HF) interaction in the formation of adiabatic (i.e., "laser-dressed") states and their expression in the Autler-Townes (AT) spectra. We first use the Morris-Shore model [J. R. Morris and B. W. Shore, Phys. Rev. A 27, 906 (1983), 10.1103/PhysRevA.27.906] to illustrate how bright and dark states are formed in a simple reference system where closely spaced energy levels are coupled to a single state with a strong laser field with the respective Rabi frequency ΩS. We then expand the simulations to realistic hyperfine level systems in Na atoms for a more general case when non-negligible HF interaction can be treated as a perturbation in the total system Hamiltonian. A numerical analysis of the adiabatic states that are formed by coupling of the 3 p3 /2 and 4 d5 /2 states by the strong laser field and probed by a weak laser field on the 3 s1 /2-3 p3 /2 transition yielded two important conclusions. Firstly, the perturbation introduced by the HF interaction leads to the observation of what we term "chameleon" states—states that change their appearance in the AT spectrum, behaving as bright states at small to moderate ΩS, and fading from the spectrum similarly to dark states when ΩS is much larger than the HF splitting of the 3 p3 /2 state. Secondly, excitation by the probe field from two different HF levels of the ground state allows one to address orthogonal sets of adiabatic states; this enables, with appropriate choice of ΩS and the involved quantum states, a selective excitation of otherwise unresolved hyperfine levels in excited electronic states.
Florio, A M; Ingram, C M; Rakotondravony, H A; Louis, E E; Raxworthy, C J
2012-07-01
Species delimitation within recently evolved groups can be challenging because species may be difficult to distinguish morphologically. Following the General Lineage Concept, we apply a multiple evidence approach to assess species limits within the carpet chameleon Furcifer lateralis, which is endemic to Madagascar and exported in large numbers for the pet trade. Cryptic speciation within F. lateralis was considered likely because this species (1) has a vast distribution, (2) occupies exceptionally diverse habitats and (3) exhibits subtle regional differences in morphology. Phylogenetic trees reconstructed using nuclear and mitochondrial genes recovered three well-supported clades corresponding with geography. Morphological results based on canonical variates analysis show that these clades exhibit subtle differences in head casque morphology. Ecological niche modelling results found that these phylogenetic groups also occupy unique environmental space and exhibit patterns of regional endemism typical of other endemic reptiles. Combined, our findings provide diverse yet consistent evidence for the existence of three species. Consequently, we elevate the subspecies F. lateralis major to species rank and name a new species distributed in northern and western Madagascar. Initial ecological divergence, associated with speciation of F. lateralis in humid eastern habitat, fits the Ecographic Constraint model for species diversification in Madagascar. By contrast, the second speciation event provides some support for the Riverine Barrier model, with the Mangoky River possibly causing initial isolation between species. These findings thus support two contrasting models of speciation within closely related species and demonstrate the utility of applying a combined-evidence approach for detecting cryptic speciation. © 2012 The Authors. Journal of Evolutionary Biology © 2012 European Society For Evolutionary Biology.
Static structure of chameleon dark matter as an explanation of dwarf spheroidal galaxy cores
Chanda, Prolay Krishna; Das, Subinoy
2017-04-01
We propose a novel mechanism that explains the cored dark matter density profile in recently observed dark matter rich dwarf spheroidal galaxies. In our scenario, dark matter particle mass decreases gradually as a function of distance towards the center of a dwarf galaxy due to its interaction with a chameleon scalar. At closer distance towards the Galactic center the strength of attractive scalar fifth force becomes much stronger than gravity and is balanced by the Fermi pressure of the dark matter cloud; thus, an equilibrium static configuration of the dark matter halo is obtained. Like the case of soliton star or fermion Q-star, the stability of the dark matter halo is obtained as the scalar achieves a static profile and reaches an asymptotic value away from the Galactic center. For simple scalar-dark matter interaction and quadratic scalar self-interaction potential, we show that dark matter behaves exactly like cold dark matter (CDM) beyond a few kpc away from the Galactic center but at closer distance it becomes lighter and Fermi pressure cannot be ignored anymore. Using Thomas-Fermi approximation, we numerically solve the radial static profile of the scalar field, fermion mass and dark matter energy density as a function of distance. We find that for fifth force mediated by an ultralight scalar, it is possible to obtain a flattened dark matter density profile towards the Galactic center. In our scenario, the fifth force can be neglected at distance r ≥1 kpc from the Galactic center and dark matter can be simply treated as heavy nonrelativistic particles beyond this distance, thus reproducing the success of CDM at large scales.
Segall, Marion; Tolley, Krystal A; Vanhooydonck, Bieke; Measey, G John; Herrel, Anthony
2013-10-15
Temperature is an extrinsic factor that influences reptile behavior because of its impact on reptile physiology. Understanding the impact of temperature on performance traits is important as it may affect the ecology and fitness of ectothermic animals such as reptiles. Here, we examined the temperature dependence of performance in two species of South African dwarf chameleon (Bradypodion): one adapted to a semi-arid environment and one to a mesic environment. Ecologically relevant performance traits were tested at different temperatures to evaluate their thermal dependence, and temperature-performance breadths for 80% and 90% of each performance trait were calculated. Our results show distinct differences in the thermal dependence of speed- versus force-related performance traits. Moreover, our results show that the semi-arid species is better adapted to higher temperatures and as such has a better chance of coping with the predicted increases in environmental temperature. The mesic area-adapted species seems to be more sensitive to an increase in temperature and could therefore potentially be threatened by the predicted future climate change. However, further studies investigating the potential for acclimation in chameleons are needed to better understand how animals may respond to future climate change.
Algorithms Introduction to Algorithms
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 1. Algorithms Introduction to Algorithms. R K Shyamasundar. Series Article Volume 1 Issue 1 January 1996 pp 20-27. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/001/01/0020-0027 ...
Mahler, D Luke; Lambert, Shea M; Geneva, Anthony J; Ng, Julienne; Hedges, S Blair; Losos, Jonathan B; Glor, Richard E
2016-09-01
We report a new chameleon-like Anolis species from Hispaniola that is ecomorphologically similar to congeners found only on Cuba. Lizards from both clades possess short limbs and a short tail and utilize relatively narrow perches, leading us to recognize a novel example of ecomorphological matching among islands in the well-known Greater Antillean anole radiation. This discovery supports the hypothesis that the assembly of island faunas can be substantially deterministic and highlights the continued potential for basic discovery to reveal new insights in well-studied groups. Restricted to a threatened band of midelevation transitional forest near the border of the Dominican Republic and Haiti, this new species appears to be highly endangered.
Directory of Open Access Journals (Sweden)
Dan Bar Yaacov
Full Text Available The Levant is an important migration bridge, harboring border-zones between Afrotropical and palearctic species. Accordingly, Chameleo chameleon, a common species throughout the Mediterranean basin, is morphologically divided in the southern Levant (Israel into two subspecies, Chamaeleo chamaeleon recticrista (CCR and C. c. musae (CCM. CCR mostly inhabits the Mediterranean climate (northern Israel, while CCM inhabits the sands of the north-western Negev Desert (southern Israel. AFLP analysis of 94 geographically well dispersed specimens indicated moderate genetic differentiation (PhiPT = 0.097, consistent with the classical division into the two subspecies, CCR and CCM. In contrast, sequence analysis of a 637 bp coding mitochondrial DNA (mtDNA fragment revealed two distinct phylogenetic clusters which were not consistent with the morphological division: one mtDNA cluster consisted of CCR specimens collected in regions northern of the Jezreel Valley and another mtDNA cluster harboring specimens pertaining to both the CCR and CCM subspecies but collected southern of the Jezreel Valley. AMOVA indicated clear mtDNA differentiation between specimens collected northern and southern to the Jezreel Valley (PhiPT = 0.79, which was further supported by a very low coalescent-based estimate of effective migration rates. Whole chameleon mtDNA sequencing (∼17,400 bp generated from 11 well dispersed geographic locations revealed 325 mutations sharply differentiating the two mtDNA clusters, suggesting a long allopatric history further supported by BEAST. This separation correlated temporally with the existence of an at least 1 million year old marine barrier at the Jezreel Valley exactly where the mtDNA clusters meet. We discuss possible involvement of gender-dependent life history differences in maintaining such mtDNA genetic differentiation and suggest that it reflects (ancient local adaptation to mitochondrial-related traits.
Glaw, Frank; Köhler, Jörn; Townsend, Ted M.; Vences, Miguel
2012-01-01
Background One clade of Malagasy leaf chameleons, the Brookesia minima group, is known to contain species that rank among the smallest amniotes in the world. We report on a previously unrecognized radiation of these miniaturized lizards comprising four new species described herein. Methodology/Principal Findings The newly discovered species appear to be restricted to single, mostly karstic, localities in extreme northern Madagascar: Brookesia confidens sp. n. from Ankarana, B. desperata sp. n. from Forêt d'Ambre, B. micra sp. n. from the islet Nosy Hara, and B. tristis sp. n. from Montagne des Français. Molecular phylogenetic analyses based on one mitochondrial and two nuclear genes of all nominal species in the B. minima group congruently support that the four new species, together with B. tuberculata from Montagne d'Ambre in northern Madagascar, form a strongly supported clade. This suggests that these species have diversified in geographical proximity in this small area. All species of the B. minima group, including the four newly described ones, are characterized by very deep genetic divergences of 18–32% in the ND2 gene and >6% in the 16S rRNA gene. Despite superficial similarities among all species of this group, their status as separate evolutionary lineages is also supported by moderate to strong differences in external morphology, and by clear differences in hemipenis structure. Conclusion/Significance The newly discovered dwarf chameleon species represent striking cases of miniaturization and microendemism and suggest the possibility of a range size-body size relationship in Malagasy reptiles. The newly described Brookesia micra reaches a maximum snout-vent length in males of 16 mm, and its total length in both sexes is less than 30 mm, ranking it among the smallest amniote vertebrates in the world. With a distribution limited to a very small islet, this species may represent an extreme case of island dwarfism. PMID:22348069
Directory of Open Access Journals (Sweden)
Frank Glaw
Full Text Available BACKGROUND: One clade of Malagasy leaf chameleons, the Brookesia minima group, is known to contain species that rank among the smallest amniotes in the world. We report on a previously unrecognized radiation of these miniaturized lizards comprising four new species described herein. METHODOLOGY/PRINCIPAL FINDINGS: The newly discovered species appear to be restricted to single, mostly karstic, localities in extreme northern Madagascar: Brookesia confidens sp. n. from Ankarana, B. desperata sp. n. from Forêt d'Ambre, B. micra sp. n. from the islet Nosy Hara, and B. tristis sp. n. from Montagne des Français. Molecular phylogenetic analyses based on one mitochondrial and two nuclear genes of all nominal species in the B. minima group congruently support that the four new species, together with B. tuberculata from Montagne d'Ambre in northern Madagascar, form a strongly supported clade. This suggests that these species have diversified in geographical proximity in this small area. All species of the B. minima group, including the four newly described ones, are characterized by very deep genetic divergences of 18-32% in the ND2 gene and >6% in the 16S rRNA gene. Despite superficial similarities among all species of this group, their status as separate evolutionary lineages is also supported by moderate to strong differences in external morphology, and by clear differences in hemipenis structure. CONCLUSION/SIGNIFICANCE: The newly discovered dwarf chameleon species represent striking cases of miniaturization and microendemism and suggest the possibility of a range size-body size relationship in Malagasy reptiles. The newly described Brookesia micra reaches a maximum snout-vent length in males of 16 mm, and its total length in both sexes is less than 30 mm, ranking it among the smallest amniote vertebrates in the world. With a distribution limited to a very small islet, this species may represent an extreme case of island dwarfism.
Kleinberg, Jon
2006-01-01
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
Wang, Lui; Bayer, Steven E.
1991-01-01
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.
Joux, Antoine
2009-01-01
Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic
Hougardy, Stefan
2016-01-01
Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.
Tel, G.
We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of
NetCSSP: web application for predicting chameleon sequences and amyloid fibril formation
Kim, Changsik; Choi, Jiwon; Lee, Seong Joon; Welsh, William J.; YOON, SUKJOON
2009-01-01
The calculation of contact-dependent secondary structure propensity (CSSP) is a unique and sensitive method that detects non-native secondary structure propensities in protein sequences. This method has applications in predicting local conformational change, which typically is observed in core sequences of protein aggregation and amyloid fibril formation. NetCSSP implements the latest version of the CSSP algorithm and provides a Flash chart-based graphic interface that enables an interactive ...
Directory of Open Access Journals (Sweden)
Tammy Keren-Rotem
Full Text Available Alternative mating tactics in males of various taxa are associated with body color, body size, and social status. Chameleons are known for their ability to change body color following immediate environmental or social stimuli. In this study, we examined whether the differential appearance of male common chameleon during the breeding season is indeed an expression of alternative mating tactics. We documented body color of males and used computer vision techniques to classify images of individuals into discrete color patterns associated with seasons, individual characteristics, and social contexts. Our findings revealed no differences in body color and color patterns among males during the non-breeding season. However, during the breeding season males appeared in several color displays, which reflected body size, social status, and behavioral patterns. Furthermore, smaller and younger males resembled the appearance of small females. Consequently, we suggest that long-term color change in males during the breeding season reflects male alternative mating tactics. Upon encounter with a receptive female, males rapidly alter their appearance to that of a specific brief courtship display, which reflects their social status. The females, however, copulated indiscriminately in respect to male color patterns. Thus, we suggest that the differential color patterns displayed by males during the breeding season are largely aimed at inter-male signaling.
Diaz, Raul E; Anderson, Christopher V; Baumann, Diana P; Kupronis, Richard; Jewell, David; Piraquive, Christina; Kupronis, Jill; Winter, Kristy; Bertocchini, Federica; Trainor, Paul A
2015-08-26
Vertebrate model organisms have facilitated the discovery and exploration of morphogenetic events and developmental pathways that underpin normal and pathological embryological events. In contrast to amniotes such as Mus musculus (Mammalia) and Gallus gallus (Aves), our understanding of early patterning and developmental events in reptiles (particularly nonavians) remains weak. Squamate reptiles (lizards, snakes, and amphisbaenians) comprise approximately one-third of all living amniotes. But studies of early squamate development have been limited because, in most members of this lineage, embryo development at the time of oviposition is very advanced (limb bud stages and older). In many cases, squamates give birth to fully developed offspring. However, in the veiled chameleon (Chamaeleo calyptratus), embryos have progressed only to a primitive pregastrula stage at the time of oviposition. Furthermore, the body plan of the veiled chameleon is highly specialized for climbing in an arboreal environment. It possesses an entire suite of skeletal and soft anatomical modifications, including cranioskeletal ornamentation, lingual anatomy and biomechanics for projection, autopodial clefting for grasping, adaptations for rapid integumental color changes, a prehensile tail with a lack of caudal autotomy, the loss of the tympanum in the middle ear, and the acquisition of turreted eyes. Thus, C. calyptratus is an important model organism for studying the role of ecological niche specialization, as well as genetic and morphological evolution within an adaptive framework. More importantly, this species is easily bred in captivity, with only a small colony (<10 individuals) needed to obtain hundreds of embryos every year. © 2015 Cold Spring Harbor Laboratory Press.
Speeding up N-body simulations of modified gravity: chameleon screening models
Bose, Sownak; Li, Baojiu; Barreira, Alexandre; He, Jian-hua; Hellwing, Wojciech A.; Koyama, Kazuya; Llinares, Claudio; Zhao, Gong-Bo
2017-02-01
We describe and demonstrate the potential of a new and very efficient method for simulating certain classes of modified gravity theories, such as the widely studied f(R) gravity models. High resolution simulations for such models are currently very slow due to the highly nonlinear partial differential equation that needs to be solved exactly to predict the modified gravitational force. This nonlinearity is partly inherent, but is also exacerbated by the specific numerical algorithm used, which employs a variable redefinition to prevent numerical instabilities. The standard Newton-Gauss-Seidel iterative method used to tackle this problem has a poor convergence rate. Our new method not only avoids this, but also allows the discretised equation to be written in a form that is analytically solvable. We show that this new method greatly improves the performance and efficiency of f(R) simulations. For example, a test simulation with 5123 particles in a box of size 512 Mpc/h is now 5 times faster than before, while a Millennium-resolution simulation for f(R) gravity is estimated to be more than 20 times faster than with the old method. Our new implementation will be particularly useful for running very high resolution, large-sized simulations which, to date, are only possible for the standard model, and also makes it feasible to run large numbers of lower resolution simulations for covariance analyses. We hope that the method will bring us to a new era for precision cosmological tests of gravity.
Directory of Open Access Journals (Sweden)
Mark Exworthy
2014-06-01
Full Text Available Health policy has been termed a ‘chameleon concept’, referring to its ability to take on different forms of disciplinarity as well as different roles and functions. This paper extends Paton’s analysis by exploring the paradox of health policy as a field of academic inquiry—sitting across many of the boundaries of social science but also marginalised by them. It situates contemporary approaches within disciplinary traditions, explaining its inter- and multi-disciplinary character. It also presents a ‘way of seeing’ health policy in terms of three axes: central/local, profession/management, and health/healthcare. The paper concludes with a call for a new research agenda which recognises health policy’s pedigree but also one which carves a distinctive future of relevance and rigour.
Hu, T C
2002-01-01
Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9
Directory of Open Access Journals (Sweden)
Anna Bourmistrova
2011-02-01
Full Text Available The autodriver algorithm is an intelligent method to eliminate the need of steering by a driver on a well-defined road. The proposed method performs best on a four-wheel steering (4WS vehicle, though it is also applicable to two-wheel-steering (TWS vehicles. The algorithm is based on coinciding the actual vehicle center of rotation and road center of curvature, by adjusting the kinematic center of rotation. The road center of curvature is assumed prior information for a given road, while the dynamic center of rotation is the output of dynamic equations of motion of the vehicle using steering angle and velocity measurements as inputs. We use kinematic condition of steering to set the steering angles in such a way that the kinematic center of rotation of the vehicle sits at a desired point. At low speeds the ideal and actual paths of the vehicle are very close. With increase of forward speed the road and tire characteristics, along with the motion dynamics of the vehicle cause the vehicle to turn about time-varying points. By adjusting the steering angles, our algorithm controls the dynamic turning center of the vehicle so that it coincides with the road curvature center, hence keeping the vehicle on a given road autonomously. The position and orientation errors are used as feedback signals in a closed loop control to adjust the steering angles. The application of the presented autodriver algorithm demonstrates reliable performance under different driving conditions.
DEFF Research Database (Denmark)
Gustavson, Fred G.; Reid, John K.; Wasniewski, Jerzy
2007-01-01
variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n2 variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel...
Tilbury, Colin R; Tolley, Krystal A
2015-01-13
Two new species of chameleons from the genera Rhampholeon and Kinyongia are described from an isolated montane forest remnant situated toward the southern end of the Albertine Rift bordering Lake Tanganyika. The closest known localities of species from these genera are 200km and 400km to the north respectively, separated by large intervening tracts of lowland savannah and Brachystegia (Miombo) woodland - habitats not normally inhabited by species of these genera. Rhampholeon hattinghi sp. nov. and Kinyongia mulyai sp. nov. bear superficial resemblances to previously described species (Rh. boulengeri Steindachner and K. adolfifriderici (Sternfeld)). Rhampholeon hattinghi sp. nov. has a relatively smooth supra-orbital ridge, deep axillary but absent inguinal mite pockets, prominent white spots on the base of the tail and a uniquely derived hemipenal morphology with billowing parasulcal evaginations. Like K. adolfifriderici, Kinyongia mulyai sp. nov. is devoid of a rostral appendage but differs in having a longer and narrower head, a higher upper labial scale count and by the absence of a dorsal crest in the male. To place these new chameleons within the context of their respective genera, Bayesian and maximum likelihood phylogenetic analyses were carried out utilising two mitochondrial (ND2 and 16S) and one nuclear marker (RAG1). Both chameleons were found to have morphological features that distinguish them from other congeners. Based on phylogenetic analysis they are clearly separate evolutionary lineages and are described as new species.
Haker, H; Misslisch, H; Ott, M; Frens, M A; Henn, V; Hess, K; Sándor, P S
2003-07-01
We investigated gaze-stabilizing reflexes in the chameleon using the three-dimensional search-coil technique. Animals were rotated sinusoidally around an earth-vertical axis under head-fixed and head-free conditions, in the dark and in the light. Gain, phase and the influence of eye position on vestibulo-ocular reflex rotation axes were studied. During head-restrained stimulation in the dark, vestibulo-ocular reflex gaze gains were low (0.1-0.3) and phase lead decreased with increasing frequencies (from 100 degrees at 0.04 Hz to < 30 degrees at 1 Hz). Gaze gains were larger during stimulation in the light (0.1-0.8) with a smaller phase lead (< 30 degrees) and were close to unity during the head-free conditions (around 0.6 in the dark, around 0.8 in the light) with small phase leads. These results confirm earlier findings that chameleons have a low vestibulo-ocular reflex gain during head-fixed conditions and stimulation in the dark and higher gains during head-free stimulation in the light. Vestibulo-ocular reflex eye rotation axes were roughly aligned with the head's rotation axis and did not systematically tilt when the animals were looking eccentrically, up- or downward (as predicted by Listing's Law). Therefore, vestibulo-ocular reflex responses in the chameleon follow a strategy, which optimally stabilizes the entire retinal images, a result previously found in non-human primates.
DEFF Research Database (Denmark)
Markham, Annette
layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also......This paper takes an actor network theory approach to explore some of the ways that algorithms co-construct identity and relational meaning in contemporary use of social media. Based on intensive interviews with participants as well as activity logging and data tracking, the author presents a richly...... contributes an innovative method for blending actor network theory with symbolic interaction to grapple with the complexity of everyday sensemaking practices within networked global information flows....
Casanova, Henri; Robert, Yves
2008-01-01
""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi
Tarone, Elaine
1979-01-01
Explores the validity of Labov's (1969) "Observer Paradox," and the five axioms describing the problems involved in linguistic research, for interlanguage research. Methodological remedies are suggested. (AM)
Haydon, Caroline
1978-01-01
Home visiting is clearly here to stay. More and more authorities are trying it out as a way of bringing home and school closer together. Yet it's an idea that embraces a wide variety of approaches, styles and attitudes. Reports on three of the early pioneering projects in Birmingham, Liverpool and Leicester. (Editor)
DEFF Research Database (Denmark)
Marfelt, Mikkel Mouritz
Due to advancements in technology and the expansion of companies onto a global level, organizations have become increasingly aware of the need to understand and manage diverse workforces; that is, the need to understand and manage differences among employees across borders (such as geographical, ...
DEFF Research Database (Denmark)
Gundersen, Eline Busck
2011-01-01
Response-dependence theses are usually formulated in terms of a priori true biconditionals of roughly the form ‘something, x, falls under the concept ‘F’ « x would elicit response R from subjects S under conditions C’. Such formulations are vulnerable to conditional fallacy problems; counterexamp...
HYBRIDIZATION AND CHAMELEONIC JOURNALISM
Directory of Open Access Journals (Sweden)
Adriana Schryver Kurtz
2016-12-01
Full Text Available O texto aborda a crescente hibridização entre o Jornalismo e demais formatos midiáticos como resultado natural de um processo que já está na própria raiz da comunicação enquanto atividade histórica. A lógica interna e as potencialidades estéticas e discursivas do fenômeno são analisadas a partir das convergências entre jornalismo e cinema. Para tanto, utiliza o falso documentário Zelig (1983, texto fílmico de Woody Allen, híbrido por natureza, postulado como um microcosmo rico em pistas e sugestões para refletir sobre a fusão entre conteúdos informativos e não informativos. PALAVRAS-CHAVE: Hibridização; Jornalismo; Cinema; Zelig. ABSTRACT The text discusses the growing hybridization between journalism and other media formats as a natural result of a process that is already in the very root of communication while historical activity. The internal logic and the aesthetic and discursive potential of the phenomenon are analyzed through the convergences between journalism and cinema. Therefore, uses the mockumentary Zelig (1983, filmic text of Woody Allen, hybrid by nature, postulated as a microcosm rich in clues and suggestions to reflect about the merger between informative and uninformative content. KEYWORDS: Hybridization; Journalism; Cinema; Zelig. RESUMEN El texto aborda la creciente hibridación entre el periodismo y otros formatos de medios como um resultado natural de un proceso que ya está en la raíz misma de la comunicación mientras actividad histórica. Se analizan la lógica interna y el potencial estético y discursivo del fenómeno a través de las convergencias entre el periodismo y el cine. Para ello, utiliza el falso documental Zelig (1983, texto fílmico de Woody Allen, híbrido en su naturaleza, postulado como un microcosmos rico en pistas y sugerencias para reflexionar sobre la fusión entre contenidos informativos y no informativos. PALABRAS CLAVE: Hibridación; Periodismo; Cine; Zelig. Arquivamento e preservação de longo prazo do arquivo em: OpenDepot / Edina (The University of Edinburgh: em processo de inclusão/indexação SSOAR-GESIS – Leibniz-Institut (Alemanha: HAL (França: em processo de inclusão/indexação
Directory of Open Access Journals (Sweden)
Michele Menegon
2015-12-01
Full Text Available A new species of chameleon is described from the Livingstone and Udzungwa Mountains of Tanzania. The new species is morphologically most similar to Kinyongia vanheygeni. Furthermore, a single, short rostral appendage shows the species similarity to other Eastern Arc endemic Kinyongia species (e.g. K. uthmoelleri, K. oxyrhina, K. magomberae and K. tenuis. Females of all these species lack any rostral ornamentation and are all very similar morphologically. Males of the new species, on which the morphological diagnosis is based, can be distinguished from other Kinyongia by a shorter rostral appendage that bifurcates at the tip. They are easily distinguished from K. vanheygeni, otherwise the most similar species, by differences in head scalation and the length and shape of the rostral appendage. The new species is associated with montane rainforest and is known from only four forest fragments of which two are in the Udzungwa and two in the Livingstone Mountains. Phylogenetically, the new species is sister to K. tenuis and K. magomberae, which together, form a clade that also contains K. oxyrhina. The disjunct distribution of the new species, in the Livingstone and Udzungwa mountains, stretches across the ‘Makambako Gap’ which is a putative biogeographical barrier separating the distinct faunas of the Southern highlands and Eastern Arc Mountains. Evidence from this species however, points to potentially closer biological affinities between the Livingstone and Udzungwa mountains.
Energy Technology Data Exchange (ETDEWEB)
Fontana, W.
1990-12-13
In this paper complex adaptive systems are defined by a self- referential loop in which objects encode functions that act back on these objects. A model for this loop is presented. It uses a simple recursive formal language, derived from the lambda-calculus, to provide a semantics that maps character strings into functions that manipulate symbols on strings. The interaction between two functions, or algorithms, is defined naturally within the language through function composition, and results in the production of a new function. An iterated map acting on sets of functions and a corresponding graph representation are defined. Their properties are useful to discuss the behavior of a fixed size ensemble of randomly interacting functions. This function gas'', or Turning gas'', is studied under various conditions, and evolves cooperative interaction patterns of considerable intricacy. These patterns adapt under the influence of perturbations consisting in the addition of new random functions to the system. Different organizations emerge depending on the availability of self-replicators.
Analysis and Implementation of Graph Clustering for Digital News Using Star Clustering Algorithm
Ahdi, A. B.; SW, K. R.; Herdiani, A.
2017-01-01
Since Web 2.0 notion emerged and is used extensively by many services in the Internet, we see an unprecedented proliferation of digital news. Those digital news is very rich in term of content and link to other news/sources but lack of category information. This make the user could not easily identify or grouping all the news that they read into set of groups. Naturally, digital news are linked data because every digital new has relation/connection with other digital news/resources. The most appropriate model for linked data is graph model. Graph model is suitable for this purpose due its flexibility in describing relation and its easy-to-understand visualization. To handle the grouping issue, we use graph clustering approach. There are many graph clustering algorithm available, such as MST Clustering, Chameleon, Makarov Clustering and Star Clustering. From all of these options, we choose Star Clustering because this algorithm is more easy-to-understand, more accurate, efficient and guarantee the quality of clusters results. In this research, we investigate the accuracy of the cluster results by comparing it with expert judgement. We got quite high accuracy level, which is 80.98% and for the cluster quality, we got promising result which is 62.87%.
DEFF Research Database (Denmark)
issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, etc.......This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The 36 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 154 submissions. The papers address all...
McAllister, Chris T
2012-09-01
Two new species of Isospora Schneider, 1881 from flap-necked chameleons Chamaeleo dilepis Leach are described from the faeces of specimens collected in the Republic of Namibia. Oöcysts of Isospora freedi n. sp. from one of four (25%) C. dilepis collected in the East Caprivi District are spherical to subspherical, with a smooth, colourless, bilayered wall, measure 23.7 × 21.2 μm and have a length/width (L/W) ratio of 1.1. The micropyle and the oöcyst residuum are absent but a polar granule is sometimes present. Sporocysts are ovoidal to ellipsoidal and 13.9 × 10.3 μm in size with prominent Stieda and sub-Stieda bodies; and the sporocyst residuum is composed of a compact mass of large globules. The sporozoites contain anterior and posterior refractile bodies with a nucleus between them. Oöcysts of Isopora mandelai n. sp. from three of seven (43%) C. dilepis collected in the Outjo District are ellipsoidal to cylindroidal, with a smooth, colourless, bilayered wall, measure 36.9 × 31.0 μm and have an L/W ratio of 1.2. The micropyle, oöcyst residuum and polar granule are absent. Sporocysts are ovoidal to ellipsoidal, 15.3 × 11.1 μm in size and contain Stieda and sub-Stieda bodies; and the non-membranous sporocyst residuum is composed of granules of various sizes. The sporozoites contain anterior and posterior refractile bodies with a nucleus between them. These two new taxa represent the third and fourth coccidian species reported from C. dilepis.
Skiena, Steven S
2008-01-01
Explaining designing algorithms, and analyzing their efficacy and efficiency, this book covers combinatorial algorithms technology, stressing design over analysis. It presents instruction on methods for designing and analyzing computer algorithms. It contains the catalog of algorithmic resources, implementations and a bibliography
Stationary algorithmic probability
National Research Council Canada - National Science Library
Müller, Markus
2010-01-01
...,sincetheiractualvaluesdependonthechoiceoftheuniversal referencecomputer.Inthispaper,weanalyzeanaturalapproachtoeliminatethismachine- dependence. Our method is to assign algorithmic probabilities to the different...
DEFF Research Database (Denmark)
Bucher, Taina
2017-01-01
This article reflects the kinds of situations and spaces where people and algorithms meet. In what situations do people become aware of algorithms? How do they experience and make sense of these algorithms, given their often hidden and invisible nature? To what extent does an awareness....... Examining how algorithms make people feel, then, seems crucial if we want to understand their social power....
Hamiltonian Algorithm Sound Synthesis
大矢, 健一
2013-01-01
Hamiltonian Algorithm (HA) is an algorithm for searching solutions is optimization problems. This paper introduces a sound synthesis technique using Hamiltonian Algorithm and shows a simple example. "Hamiltonian Algorithm Sound Synthesis" uses phase transition effect in HA. Because of this transition effect, totally new waveforms are produced.
Energy Technology Data Exchange (ETDEWEB)
Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics
1997-11-01
The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.
Algorithmically specialized parallel computers
Snyder, Lawrence; Gannon, Dennis B
1985-01-01
Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster
Adaptive cockroach swarm algorithm
Obagbuwa, Ibidun C.; Abidoye, Ademola P.
2017-07-01
An adaptive cockroach swarm optimization (ACSO) algorithm is proposed in this paper to strengthen the existing cockroach swarm optimization (CSO) algorithm. The ruthless component of CSO algorithm is modified by the employment of blend crossover predator-prey evolution method which helps algorithm prevent any possible population collapse, maintain population diversity and create adaptive search in each iteration. The performance of the proposed algorithm on 16 global optimization benchmark function problems was evaluated and compared with the existing CSO, cuckoo search, differential evolution, particle swarm optimization and artificial bee colony algorithms.
Software For Genetic Algorithms
Wang, Lui; Bayer, Steve E.
1992-01-01
SPLICER computer program is genetic-algorithm software tool used to solve search and optimization problems. Provides underlying framework and structure for building genetic-algorithm application program. Written in Think C.
Modified Clipped LMS Algorithm
National Research Council Canada - National Science Library
Lotfizad, Mojtaba; Yazdi, Hadi Sadoghi
2005-01-01
A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization...
Autonomous Star Tracker Algorithms
DEFF Research Database (Denmark)
Betto, Maurizio; Jørgensen, John Leif; Kilsgaard, Søren
1998-01-01
Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances.......Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances....
DEFF Research Database (Denmark)
Husfeldt, Thore
2015-01-01
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...... techniques and is organized by algorithmic paradigm....
Optimal Mixing Evolutionary Algorithms
D. Thierens (Dirk); P.A.N. Bosman (Peter); N. Krasnogor
2011-01-01
htmlabstractA key search mechanism in Evolutionary Algorithms is the mixing or juxtaposing of partial solutions present in the parent solutions. In this paper we look at the efficiency of mixing in genetic algorithms (GAs) and estimation-of-distribution algorithms (EDAs). We compute the mixing
Energy Technology Data Exchange (ETDEWEB)
Coskun, E. [Northern Illinois Univ., DeKalb, IL (United States). Dept. of Mathematical Sciences; Kwong, M.K. [Argonne National Lab., IL (United States)
1995-09-01
Time-dependent Ginzburg-Landau (TDGL) equations are considered for modeling a thin-film finite size superconductor placed under magnetic field. The problem then leads to the use of so-called natural boundary conditions. Computational domain is partitioned into subdomains and bond variables are used in obtaining the corresponding discrete system of equations. An efficient time-differencing method based on the Forward Euler method is developed. Finally, a variable strength magnetic field resulting in a vortex motion in Type II High {Tc} superconducting films is introduced. The authors tackled the problem using two different state-of-the-art parallel computing tools: BlockComm/Chameleon and PCN. They had access to two high-performance distributed memory supercomputers: the Intel iPSC/860 and IBM SP1. They also tested the codes using, as a parallel computing environment, a cluster of Sun Sparc workstations.
Nature-inspired optimization algorithms
Yang, Xin-She
2014-01-01
Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning
Akl, Selim G
1985-01-01
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the
Digital Arithmetic: Division Algorithms
DEFF Research Database (Denmark)
Montuschi, Paolo; Nannarelli, Alberto
2017-01-01
.g., Newton–Raphson) algorithms. The first class of algorithms, the digit-recurrence type, is particularly suitable for hardware implementation as it requires modest resources and provides good performance on contemporary technology. The second class of algorithms, the multiplicative type, requires...... implement it in hardware to not compromise the overall computation performances. This entry explains the basic algorithms, suitable for hardware and software, to implement division in computer systems. Two classes of algorithms implement division or square root: digit-recurrence and multiplicative (e...
Mohri, Mehryar
Weighted automata and transducers are widely used in modern applications in bioinformatics and text, speech, and image processing. This chapter describes several fundamental weighted automata and shortest-distance algorithms including composition, determinization, minimization, and synchronization, as well as single-source and all-pairs shortest distance algorithms over general semirings. It presents the pseudocode of these algorithms, gives an analysis of their running time complexity, and illustrates their use in some simple cases. Many other complex weighted automata and transducer algorithms used in practice can be obtained by combining these core algorithms.
Modified Clipped LMS Algorithm
Directory of Open Access Journals (Sweden)
Lotfizad Mojtaba
2005-01-01
Full Text Available Abstract A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization ( scheme that involves the threshold clipping of the input signals in the filter weight update formula. Mathematical analysis shows the convergence of the filter weights to the optimum Wiener filter weights. Also, it can be proved that the proposed modified clipped LMS (MCLMS algorithm has better tracking than the LMS algorithm. In addition, this algorithm has reduced computational complexity relative to the unmodified one. By using a suitable threshold, it is possible to increase the tracking capability of the MCLMS algorithm compared to the LMS algorithm, but this causes slower convergence. Computer simulations confirm the mathematical analysis presented.
Cloud Particles Evolution Algorithm
Directory of Open Access Journals (Sweden)
Wei Li
2015-01-01
Full Text Available Many evolutionary algorithms have been paid attention to by the researchers and have been applied to solve optimization problems. This paper presents a new optimization method called cloud particles evolution algorithm (CPEA to solve optimization problems based on cloud formation process and phase transformation of natural substance. The cloud is assumed to have three states in the proposed algorithm. Gaseous state represents the global exploration. Liquid state represents the intermediate process from the global exploration to the local exploitation. Solid state represents the local exploitation. The cloud is composed of descript and independent particles in this algorithm. The cloud particles use phase transformation of three states to realize the global exploration and the local exploitation in the optimization process. Moreover, the cloud particles not only realize the survival of the fittest through competition mechanism but also ensure the diversity of the cloud particles by reciprocity mechanism. The effectiveness of the algorithm is validated upon different benchmark problems. The proposed algorithm is compared with a number of other well-known optimization algorithms, and the experimental results show that cloud particles evolution algorithm has a higher efficiency than some other algorithms.
Explaining algorithms using metaphors
Forišek, Michal
2013-01-01
There is a significant difference between designing a new algorithm, proving its correctness, and teaching it to an audience. When teaching algorithms, the teacher's main goal should be to convey the underlying ideas and to help the students form correct mental models related to the algorithm. This process can often be facilitated by using suitable metaphors. This work provides a set of novel metaphors identified and developed as suitable tools for teaching many of the 'classic textbook' algorithms taught in undergraduate courses worldwide. Each chapter provides exercises and didactic notes fo
Spectral Decomposition Algorithm (SDA)
National Aeronautics and Space Administration — Spectral Decomposition Algorithm (SDA) is an unsupervised feature extraction technique similar to PCA that was developed to better distinguish spectral features in...
Woo, Andrew
2012-01-01
Digital shadow generation continues to be an important aspect of visualization and visual effects in film, games, simulations, and scientific applications. This resource offers a thorough picture of the motivations, complexities, and categorized algorithms available to generate digital shadows. From general fundamentals to specific applications, it addresses shadow algorithms and how to manage huge data sets from a shadow perspective. The book also examines the use of shadow algorithms in industrial applications, in terms of what algorithms are used and what software is applicable.
Ciocanea Teodorescu I.,
2016-01-01
In this thesis we are interested in describing algorithms that answer questions arising in ring and module theory. Our focus is on deterministic polynomial-time algorithms and rings and modules that are finite. The first main result of this thesis is a solution to the module isomorphism problem in
8. Algorithm Design Techniques
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 8. Algorithms - Algorithm Design Techniques. R K Shyamasundar. Series Article Volume 2 Issue 8 August 1997 pp 6-17. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/002/08/0006-0017 ...
Genetic Algorithm Parameter Analysis
Ernesto, BELMONT-MORENO; Instituto de Fisica, UNAM
2000-01-01
The energy minimizing problem of atomic cluster configuration and the 2D spin glass problem are used for testing our genetic algorithm. It is shown to be crucial to adjust the degree of mutation and the population size for the efficiency of the algorithm.
Directory of Open Access Journals (Sweden)
Francesca Musiani
2013-08-01
Full Text Available Algorithms are increasingly often cited as one of the fundamental shaping devices of our daily, immersed-in-information existence. Their importance is acknowledged, their performance scrutinised in numerous contexts. Yet, a lot of what constitutes 'algorithms' beyond their broad definition as “encoded procedures for transforming input data into a desired output, based on specified calculations” (Gillespie, 2013 is often taken for granted. This article seeks to contribute to the discussion about 'what algorithms do' and in which ways they are artefacts of governance, providing two examples drawing from the internet and ICT realm: search engine queries and e-commerce websites’ recommendations to customers. The question of the relationship between algorithms and rules is likely to occupy an increasingly central role in the study and the practice of internet governance, in terms of both institutions’ regulation of algorithms, and algorithms’ regulation of our society.
Algorithms for protein design.
Gainza, Pablo; Nisonoff, Hunter M; Donald, Bruce R
2016-08-01
Computational structure-based protein design programs are becoming an increasingly important tool in molecular biology. These programs compute protein sequences that are predicted to fold to a target structure and perform a desired function. The success of a program's predictions largely relies on two components: first, the input biophysical model, and second, the algorithm that computes the best sequence(s) and structure(s) according to the biophysical model. Improving both the model and the algorithm in tandem is essential to improving the success rate of current programs, and here we review recent developments in algorithms for protein design, emphasizing how novel algorithms enable the use of more accurate biophysical models. We conclude with a list of algorithmic challenges in computational protein design that we believe will be especially important for the design of therapeutic proteins and protein assemblies. Copyright © 2016 Elsevier Ltd. All rights reserved.
Chameleon Chasing II: A Replication.
Newsom, Doug A.; And Others
1993-01-01
Replicates a 1972 survey of students, educators, and Public Relations Society of America members regarding who the public relations counselor really serves. Finds that, in 1992, most respondents thought primary responsibility was to the client, then to the client's relevant publics, then to self, then to society, and finally to media. Compares…
The Action Researcher as Chameleon.
Hadfield, Mark; Bennett, Steve
1995-01-01
Describes a project that trained institutional policymakers in action research regarding problems in developing training policies about young people's needs, examining attempts to collaborate and dialog with stakeholders and discussing how project members became enmeshed in complex sets of relationships calling for construction of dialog in…
Directory of Open Access Journals (Sweden)
Hans Schonemann
1996-12-01
Full Text Available Some algorithms for singularity theory and algebraic geometry The use of Grobner basis computations for treating systems of polynomial equations has become an important tool in many areas. This paper introduces of the concept of standard bases (a generalization of Grobner bases and the application to some problems from algebraic geometry. The examples are presented as SINGULAR commands. A general introduction to Grobner bases can be found in the textbook [CLO], an introduction to syzygies in [E] and [St1]. SINGULAR is a computer algebra system for computing information about singularities, for use in algebraic geometry. The basic algorithms in SINGULAR are several variants of a general standard basis algorithm for general monomial orderings (see [GG]. This includes wellorderings (Buchberger algorithm ([B1], [B2] and tangent cone orderings (Mora algorithm ([M1], [MPT] as special cases: It is able to work with non-homogeneous and homogeneous input and also to compute in the localization of the polynomial ring in 0. Recent versions include algorithms to factorize polynomials and a factorizing Grobner basis algorithm. For a complete description of SINGULAR see [Si].
A New Modified Firefly Algorithm
Directory of Open Access Journals (Sweden)
Medha Gupta
2016-07-01
Full Text Available Nature inspired meta-heuristic algorithms studies the emergent collective intelligence of groups of simple agents. Firefly Algorithm is one of the new such swarm-based metaheuristic algorithm inspired by the flashing behavior of fireflies. The algorithm was first proposed in 2008 and since then has been successfully used for solving various optimization problems. In this work, we intend to propose a new modified version of Firefly algorithm (MoFA and later its performance is compared with the standard firefly algorithm along with various other meta-heuristic algorithms. Numerical studies and results demonstrate that the proposed algorithm is superior to existing algorithms.
Recursive forgetting algorithms
DEFF Research Database (Denmark)
Parkum, Jens; Poulsen, Niels Kjølstad; Holst, Jan
1992-01-01
In the first part of the paper, a general forgetting algorithm is formulated and analysed. It contains most existing forgetting schemes as special cases. Conditions are given ensuring that the basic convergence properties will hold. In the second part of the paper, the results are applied to a sp...... to a specific algorithm with selective forgetting. Here, the forgetting is non-uniform in time and space. The theoretical analysis is supported by a simulation example demonstrating the practical performance of this algorithm......In the first part of the paper, a general forgetting algorithm is formulated and analysed. It contains most existing forgetting schemes as special cases. Conditions are given ensuring that the basic convergence properties will hold. In the second part of the paper, the results are applied...
Unsupervised learning algorithms
Aydin, Kemal
2016-01-01
This book summarizes the state-of-the-art in unsupervised learning. The contributors discuss how with the proliferation of massive amounts of unlabeled data, unsupervised learning algorithms, which can automatically discover interesting and useful patterns in such data, have gained popularity among researchers and practitioners. The authors outline how these algorithms have found numerous applications including pattern recognition, market basket analysis, web mining, social network analysis, information retrieval, recommender systems, market research, intrusion detection, and fraud detection. They present how the difficulty of developing theoretically sound approaches that are amenable to objective evaluation have resulted in the proposal of numerous unsupervised learning algorithms over the past half-century. The intended audience includes researchers and practitioners who are increasingly using unsupervised learning algorithms to analyze their data. Topics of interest include anomaly detection, clustering,...
Diagnostic Algorithm Benchmarking
Poll, Scott
2011-01-01
A poster for the NASA Aviation Safety Program Annual Technical Meeting. It describes empirical benchmarking on diagnostic algorithms using data from the ADAPT Electrical Power System testbed and a diagnostic software framework.
Quantum algorithmic information theory
Svozil, Karl
1995-01-01
The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental atoms processed by quantum computation are the quantum bits which are dealt with in quantum information theory. The theory of quantum computation will be based upon a model of universal quantum computer whose elementary unit is a two-port interferometer capa...
Optimization algorithms and applications
Arora, Rajesh Kumar
2015-01-01
Choose the Correct Solution Method for Your Optimization ProblemOptimization: Algorithms and Applications presents a variety of solution techniques for optimization problems, emphasizing concepts rather than rigorous mathematical details and proofs. The book covers both gradient and stochastic methods as solution techniques for unconstrained and constrained optimization problems. It discusses the conjugate gradient method, Broyden-Fletcher-Goldfarb-Shanno algorithm, Powell method, penalty function, augmented Lagrange multiplier method, sequential quadratic programming, method of feasible direc
Image Segmentation Algorithms Overview
Yuheng, Song; Hao, Yan
2017-01-01
The technology of image segmentation is widely used in medical image processing, face recognition pedestrian detection, etc. The current image segmentation techniques include region-based segmentation, edge detection segmentation, segmentation based on clustering, segmentation based on weakly-supervised learning in CNN, etc. This paper analyzes and summarizes these algorithms of image segmentation, and compares the advantages and disadvantages of different algorithms. Finally, we make a predi...
Genetic algorithm in chemistry.
da Costa, PA; Poppi, RJ
1999-01-01
Genetic algorithm is an optimization technique based on Darwin evolution theory. In last years its application in chemistry is increasing significantly due the special characteristics for optimization of complex systems. The basic principles and some further modifications implemented to improve its performance are presented, as well as a historical development. A numerical example of a function optimization is also shown to demonstrate how the algorithm works in an optimization process. Final...
Jakobović, Domagoj; Golub, Marin
1999-01-01
In this paper we introduce an adaptive, 'self-contained' genetic algorithm (GA) with steady-state selection. This variant of GA utilizes empirically based methods for calculating its control parameters. The adaptive algorithm estimates the percentage of the population to be replaced with new individuals (generation gap). It chooses the solutions for crossover and varies the number of mutations, ail regarding the current population state. The state of the population is evaluated by observing s...
Jafari-Marandi, Ruholla; Smith, Brian K.
2017-01-01
Genetic Algorithm (GA) has been one of the most popular methods for many challenging optimization problems when exact approaches are too computationally expensive. A review of the literature shows extensive research attempting to adapt and develop the standard GA. Nevertheless, the essence of GA which consists of concepts such as chromosomes, individuals, crossover, mutation, and others rarely has been the focus of recent researchers. In this paper method, Fluid Genetic Algorithm (FGA), some ...
Algorithmic Relative Complexity
Daniele Cerra; Mihai Datcu
2011-01-01
Information content and compression are tightly related concepts that can be addressed through both classical and algorithmic information theories, on the basis of Shannon entropy and Kolmogorov complexity, respectively. The definition of several entities in Kolmogorov’s framework relies upon ideas from classical information theory, and these two approaches share many common traits. In this work, we expand the relations between these two frameworks by introducing algorithmic cross-complexity ...
Directory of Open Access Journals (Sweden)
Wang Zi Min
2016-01-01
Full Text Available With the development of social services, people’s living standards improve further requirements, there is an urgent need for a way to adapt to the complex situation of the new positioning technology. In recent years, RFID technology have a wide range of applications in all aspects of life and production, such as logistics tracking, car alarm, security and other items. The use of RFID technology to locate, it is a new direction in the eyes of the various research institutions and scholars. RFID positioning technology system stability, the error is small and low-cost advantages of its location algorithm is the focus of this study.This article analyzes the layers of RFID technology targeting methods and algorithms. First, RFID common several basic methods are introduced; Secondly, higher accuracy to political network location method; Finally, LANDMARC algorithm will be described. Through this it can be seen that advanced and efficient algorithms play an important role in increasing RFID positioning accuracy aspects.Finally, the algorithm of RFID location technology are summarized, pointing out the deficiencies in the algorithm, and put forward a follow-up study of the requirements, the vision of a better future RFID positioning technology.
Directory of Open Access Journals (Sweden)
Hanns Holger Rutz
2016-11-01
Full Text Available Although the concept of algorithms has been established a long time ago, their current topicality indicates a shift in the discourse. Classical definitions based on logic seem to be inadequate to describe their aesthetic capabilities. New approaches stress their involvement in material practices as well as their incompleteness. Algorithmic aesthetics can no longer be tied to the static analysis of programs, but must take into account the dynamic and experimental nature of coding practices. It is suggested that the aesthetic objects thus produced articulate something that could be called algorithmicity or the space of algorithmic agency. This is the space or the medium – following Luhmann’s form/medium distinction – where human and machine undergo mutual incursions. In the resulting coupled “extimate” writing process, human initiative and algorithmic speculation cannot be clearly divided out any longer. An observation is attempted of defining aspects of such a medium by drawing a trajectory across a number of sound pieces. The operation of exchange between form and medium I call reconfiguration and it is indicated by this trajectory.
Evolutionary pattern search algorithms
Energy Technology Data Exchange (ETDEWEB)
Hart, W.E.
1995-09-19
This paper defines a class of evolutionary algorithms called evolutionary pattern search algorithms (EPSAs) and analyzes their convergence properties. This class of algorithms is closely related to evolutionary programming, evolutionary strategie and real-coded genetic algorithms. EPSAs are self-adapting systems that modify the step size of the mutation operator in response to the success of previous optimization steps. The rule used to adapt the step size can be used to provide a stationary point convergence theory for EPSAs on any continuous function. This convergence theory is based on an extension of the convergence theory for generalized pattern search methods. An experimental analysis of the performance of EPSAs demonstrates that these algorithms can perform a level of global search that is comparable to that of canonical EAs. We also describe a stopping rule for EPSAs, which reliably terminated near stationary points in our experiments. This is the first stopping rule for any class of EAs that can terminate at a given distance from stationary points.
A Parallel Butterfly Algorithm
Poulson, Jack
2014-02-04
The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.
Korepin, Vladimir E.; Xu, Ying
This article reviews recent progress in quantum database search algorithms. The subject is presented in a self-contained and pedagogical way. The problem of searching a large database (a Hilbert space) for a target item is performed by the famous Grover algorithm which locates the target item with high probability and a quadratic speed-up compared with the corresponding classical algorithm. If the database is partitioned into blocks and one is searching for the block containing the target item instead of the target item itself, then the problem is referred to as partial search. Partial search trades accuracy for speed and the most efficient version is the Grover-Radhakrishnan-Korepin (GRK) algorithm. The target block can be further partitioned into sub-blocks so that GRK's can be performed in a sequence called a hierarchy. We study the Grover search and GRK partial search in detail and prove that a GRK hierarchy is less efficient than a direct GRK partial search. Both the Grover search and the GRK partial search can be generalized to the case with several target items (or target blocks for a GRK). The GRK partial search algorithm can also be represented in terms of group theory.
Detection of algorithmic trading
Bogoev, Dimitar; Karam, Arzé
2017-10-01
We develop a new approach to reflect the behavior of algorithmic traders. Specifically, we provide an analytical and tractable way to infer patterns of quote volatility and price momentum consistent with different types of strategies employed by algorithmic traders, and we propose two ratios to quantify these patterns. Quote volatility ratio is based on the rate of oscillation of the best ask and best bid quotes over an extremely short period of time; whereas price momentum ratio is based on identifying patterns of rapid upward or downward movement in prices. The two ratios are evaluated across several asset classes. We further run a two-stage Artificial Neural Network experiment on the quote volatility ratio; the first stage is used to detect the quote volatility patterns resulting from algorithmic activity, while the second is used to validate the quality of signal detection provided by our measure.
CERN. Geneva; PUNZI, Giovanni
2015-01-01
Charge particle reconstruction is one of the most demanding computational tasks found in HEP, and it becomes increasingly important to perform it in real time. We envision that HEP would greatly benefit from achieving a long-term goal of making track reconstruction happen transparently as part of the detector readout ("detector-embedded tracking"). We describe here a track-reconstruction approach based on a massively parallel pattern-recognition algorithm, inspired by studies of the processing of visual images by the brain as it happens in nature ('RETINA algorithm'). It turns out that high-quality tracking in large HEP detectors is possible with very small latencies, when this algorithm is implemented in specialized processors, based on current state-of-the-art, high-speed/high-bandwidth digital devices.
Algorithms in invariant theory
Sturmfels, Bernd
2008-01-01
J. Kung and G.-C. Rota, in their 1984 paper, write: "Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics". The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to a wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.
Handbook of Memetic Algorithms
Cotta, Carlos; Moscato, Pablo
2012-01-01
Memetic Algorithms (MAs) are computational intelligence structures combining multiple and various operators in order to address optimization problems. The combination and interaction amongst operators evolves and promotes the diffusion of the most successful units and generates an algorithmic behavior which can handle complex objective functions and hard fitness landscapes. “Handbook of Memetic Algorithms” organizes, in a structured way, all the the most important results in the field of MAs since their earliest definition until now. A broad review including various algorithmic solutions as well as successful applications is included in this book. Each class of optimization problems, such as constrained optimization, multi-objective optimization, continuous vs combinatorial problems, uncertainties, are analysed separately and, for each problem, memetic recipes for tackling the difficulties are given with some successful examples. Although this book contains chapters written by multiple authors, ...
DEFF Research Database (Denmark)
Vissing, S.; Hededal, O.
An algorithm is presented for computing the m smallest eigenvalues and corresponding eigenvectors of the generalized eigenvalue problem (A - λB)Φ = 0 where A and B are real n x n symmetric matrices. In an iteration scheme the matrices A and B are projected simultaneously onto an m-dimensional sub......An algorithm is presented for computing the m smallest eigenvalues and corresponding eigenvectors of the generalized eigenvalue problem (A - λB)Φ = 0 where A and B are real n x n symmetric matrices. In an iteration scheme the matrices A and B are projected simultaneously onto an m......-dimensional subspace in order to establish and solve a symmetric generalized eigenvalue problem in the subspace. The algorithm is described in pseudo code and implemented in the C programming language for lower triangular matrices A and B. The implementation includes procedures for selecting initial iteration vectors...
Named Entity Linking Algorithm
Directory of Open Access Journals (Sweden)
M. F. Panteleev
2017-01-01
Full Text Available In the tasks of processing text in natural language, Named Entity Linking (NEL represents the task to define and link some entity, which is found in the text, with some entity in the knowledge base (for example, Dbpedia. Currently, there is a diversity of approaches to solve this problem, but two main classes can be identified: graph-based approaches and machine learning-based ones. Graph and Machine Learning approaches-based algorithm is proposed accordingly to the stated assumptions about the interrelations of named entities in a sentence and in general.In the case of graph-based approaches, it is necessary to solve the problem of identifying an optimal set of the related entities according to some metric that characterizes the distance between these entities in a graph built on some knowledge base. Due to limitations in processing power, to solve this task directly is impossible. Therefore, its modification is proposed. Based on the algorithms of machine learning, an independent solution cannot be built due to small volumes of training datasets relevant to NEL task. However, their use can contribute to improving the quality of the algorithm. The adaptation of the Latent Dirichlet Allocation model is proposed in order to obtain a measure of the compatibility of attributes of various entities encountered in one context.The efficiency of the proposed algorithm was experimentally tested. A test dataset was independently generated. On its basis the performance of the model was compared using the proposed algorithm with the open source product DBpedia Spotlight, which solves the NEL problem.The mockup, based on the proposed algorithm, showed a low speed as compared to DBpedia Spotlight. However, the fact that it has shown higher accuracy, stipulates the prospects for work in this direction.The main directions of development were proposed in order to increase the accuracy of the system and its productivity.
Algorithmization in Learning and Instruction.
Landa, L. N.
An introduction to the theory of algorithms reviews the theoretical issues of teaching algorithms, the logical and psychological problems of devising algorithms of identification, and the selection of efficient algorithms; and then relates all of these to the classroom teaching process. It also descirbes some major research on the effectiveness of…
Algorithms for Reinforcement Learning
Szepesvari, Csaba
2010-01-01
Reinforcement learning is a learning paradigm concerned with learning to control a system so as to maximize a numerical performance measure that expresses a long-term objective. What distinguishes reinforcement learning from supervised learning is that only partial feedback is given to the learner about the learner's predictions. Further, the predictions may have long term effects through influencing the future state of the controlled system. Thus, time plays a special role. The goal in reinforcement learning is to develop efficient learning algorithms, as well as to understand the algorithms'
Wireless communications algorithmic techniques
Vitetta, Giorgio; Colavolpe, Giulio; Pancaldi, Fabrizio; Martin, Philippa A
2013-01-01
This book introduces the theoretical elements at the basis of various classes of algorithms commonly employed in the physical layer (and, in part, in MAC layer) of wireless communications systems. It focuses on single user systems, so ignoring multiple access techniques. Moreover, emphasis is put on single-input single-output (SISO) systems, although some relevant topics about multiple-input multiple-output (MIMO) systems are also illustrated.Comprehensive wireless specific guide to algorithmic techniquesProvides a detailed analysis of channel equalization and channel coding for wi
Algorithm for structure constants
Paiva, F M
2011-01-01
In a $n$-dimensional Lie algebra, random numerical values are assigned by computer to $n(n-1)$ especially selected structure constants. An algorithm is then created, which calculates without ambiguity the remaining constants, obeying the Jacobi conditions. Differently from others, this algorithm is suitable even for poor personal computer. ------------- En $n$-dimensia algebro de Lie, hazardaj numeraj valoroj estas asignitaj per komputilo al $n(n-1)$ speciale elektitaj konstantoj de strukturo. Tiam algoritmo estas kreita, kalkulante senambigue la ceterajn konstantojn, obeante kondicxojn de Jacobi. Malsimile al aliaj algoritmoj, tiu cxi tauxgas ecx por malpotenca komputilo.
Secondary Vertex Finder Algorithm
Heer, Sebastian; The ATLAS collaboration
2017-01-01
If a jet originates from a b-quark, a b-hadron is formed during the fragmentation process. In its dominant decay modes, the b-hadron decays into a c-hadron via the electroweak interaction. Both b- and c-hadrons have lifetimes long enough, to travel a few millimetres before decaying. Thus displaced vertices from b- and subsequent c-hadron decays provide a strong signature for a b-jet. Reconstructing these secondary vertices (SV) and their properties is the aim of this algorithm. The performance of this algorithm is studied with tt̄ events, requiring at least one lepton, simulated at 13 TeV.
Parallel Algorithms and Patterns
Energy Technology Data Exchange (ETDEWEB)
Robey, Robert W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-06-16
This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.
DEFF Research Database (Denmark)
Bilardi, Gianfranco; Pietracaprina, Andrea; Pucci, Geppino
2016-01-01
A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network...... in the latter model implies optimality in the decomposable bulk synchronous parallel model, which is known to effectively describe a wide and significant class of parallel platforms. The proposed framework can be regarded as an attempt to port the notion of obliviousness, well established in the context...
A Generalized Jacobi Algorithm
DEFF Research Database (Denmark)
Vissing, S.; Krenk, S.
An algorithm is developed for the generalized eigenvalue problem (A - λB)φ = O where A and B are real symmetric matrices. The matrices A and B are diagonalized simultaneously by a series of generalized Jacobi transformations and all eigenvalues and eigenvectors are obtained. A criterion expressed...... in terms of the transformation parameters is used to omit transformations leading to very small changes. The algorithm is described in pseudo code for lower triangular matrices A and B and implemented in the programming Language C....
New Optimization Algorithms in Physics
Hartmann, Alexander K
2004-01-01
Many physicists are not aware of the fact that they can solve their problems by applying optimization algorithms. Since the number of such algorithms is steadily increasing, many new algorithms have not been presented comprehensively until now. This presentation of recently developed algorithms applied in physics, including demonstrations of how they work and related results, aims to encourage their application, and as such the algorithms selected cover concepts and methods from statistical physics to optimization problems emerging in theoretical computer science.
Automatic design of decision-tree algorithms with evolutionary algorithms.
Barros, Rodrigo C; Basgalupp, Márcio P; de Carvalho, André C P L F; Freitas, Alex A
2013-01-01
This study reports the empirical analysis of a hyper-heuristic evolutionary algorithm that is capable of automatically designing top-down decision-tree induction algorithms. Top-down decision-tree algorithms are of great importance, considering their ability to provide an intuitive and accurate knowledge representation for classification problems. The automatic design of these algorithms seems timely, given the large literature accumulated over more than 40 years of research in the manual design of decision-tree induction algorithms. The proposed hyper-heuristic evolutionary algorithm, HEAD-DT, is extensively tested using 20 public UCI datasets and 10 microarray gene expression datasets. The algorithms automatically designed by HEAD-DT are compared with traditional decision-tree induction algorithms, such as C4.5 and CART. Experimental results show that HEAD-DT is capable of generating algorithms which are significantly more accurate than C4.5 and CART.
Randomized Filtering Algorithms
DEFF Research Database (Denmark)
Katriel, Irit; Van Hentenryck, Pascal
2008-01-01
of AllDifferent and is generalization, the Global Cardinality Constraint. The first delayed filtering scheme is a Monte Carlo algorithm: its running time is superior, in the worst case, to that of enforcing are consistency after every domain event, while its filtering effectiveness is analyzed...
Ball, Stanley
1986-01-01
Presents a developmental taxonomy which promotes sequencing activities to enhance the potential of matching these activities with learner needs and readiness, suggesting that the order commonly found in the classroom needs to be inverted. The proposed taxonomy (story, skill, and algorithm) involves problem-solving emphasis in the classroom. (JN)
1982-05-01
recurrence as g, =gn- + g,,-, for n > 2, g,=1, go=0. For this recurrence, we know the solution (see 1.4.2.; g, is the n-th Fibonacci number F,) and...blocks which overlap with a new path. The algorithm is now straightforward. Whenever find-path outputs the first path P of a new bridg c we determine in
Hurlbert, Anya C.; Poggio, Tomaso A.
1989-03-01
Lightness algorithms, which recover surface reflectance from the image irradiance signal in individual color channels, provide one solution to the computational problem of color constancy. We compare three methods for constructing (or "learning") lightness algorithms from examples in a Mondrian world: optimal linear estimation, backpropagation (BP) on a two-layer network, and optimal polynomial estimation. In each example, the input data (image irradiance) is paired with the desired output (surface reflectance). Optimal linear estimation produces a lightness operator that is approximately equivalent to a center-surround, or bandpass, filter and which resembles a new lightness algorithm recently proposed by Land. This technique is based on the assumption that the operator that transforms input into output is linear, which is true for a certain class of early vision algorithms that may therefore be synthesized in a similar way from examples. Although the backpropagation net performs slightly better on new input data than the estimated linear operator, the optimal polynomial operator of order two performs marginally better than both.
Optimal Quadratic Programming Algorithms
Dostal, Zdenek
2009-01-01
Quadratic programming (QP) is one technique that allows for the optimization of a quadratic function in several variables in the presence of linear constraints. This title presents various algorithms for solving large QP problems. It is suitable as an introductory text on quadratic programming for graduate students and researchers
Indian Academy of Sciences (India)
Outline of the talk. Introduction. Computing connectivities between all pairs of vertices. All pairs shortest paths/distances. Optimal bipartite matching . – p.2/30 .... Efficient Algorithm. The time taken for this computation on any input should be bounded by a small polynomial in the input size. . – p.6/30 ...
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 9. Introduction to Algorithms Turtle Graphics. R K Shyamasundar. Series Article Volume 1 Issue 9 September 1996 pp 14-24. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/001/09/0014-0024 ...
Theije, P.A.M. de
2002-01-01
A new adaptive method is presented to display large amounts of data on, for example, a computer screen. The algorithm reduces a set of N samples to a single value, using the statistics of the background and cormparing the true peak value in the set of N samples to the expected peak value of this
Comprehensive eye evaluation algorithm
Agurto, C.; Nemeth, S.; Zamora, G.; Vahtel, M.; Soliz, P.; Barriga, S.
2016-03-01
In recent years, several research groups have developed automatic algorithms to detect diabetic retinopathy (DR) in individuals with diabetes (DM), using digital retinal images. Studies have indicated that diabetics have 1.5 times the annual risk of developing primary open angle glaucoma (POAG) as do people without DM. Moreover, DM patients have 1.8 times the risk for age-related macular degeneration (AMD). Although numerous investigators are developing automatic DR detection algorithms, there have been few successful efforts to create an automatic algorithm that can detect other ocular diseases, such as POAG and AMD. Consequently, our aim in the current study was to develop a comprehensive eye evaluation algorithm that not only detects DR in retinal images, but also automatically identifies glaucoma suspects and AMD by integrating other personal medical information with the retinal features. The proposed system is fully automatic and provides the likelihood of each of the three eye disease. The system was evaluated in two datasets of 104 and 88 diabetic cases. For each eye, we used two non-mydriatic digital color fundus photographs (macula and optic disc centered) and, when available, information about age, duration of diabetes, cataracts, hypertension, gender, and laboratory data. Our results show that the combination of multimodal features can increase the AUC by up to 5%, 7%, and 8% in the detection of AMD, DR, and glaucoma respectively. Marked improvement was achieved when laboratory results were combined with retinal image features.
Diagnostic Algorithm for Encephalitis
Directory of Open Access Journals (Sweden)
J Gordon Millichap
2013-12-01
Full Text Available Diagnostic algorithm for initial evaluation of encephalitis in children is proposed with a consensus statement from the International Encephalitis Consortium, a committee begun in 2010 to serve as a practical aid to clinicians evaluating patients with suspected encephalitis.
Algorithmic information theory
Grünwald, P.D.; Vitányi, P.M.B.; Adriaans, P.; van Benthem, J.
2008-01-01
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining 'information'. We discuss the extent to which Kolmogorov's and Shannon's information theory have a common purpose, and where they are
Algorithmic information theory
Grünwald, P.D.; Vitányi, P.M.B.
2008-01-01
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'. We discuss the extent to which Kolmogorov's and Shannon's information theory have a common purpose, and where they are
Genetic algorithm eclipse mapping
Halevin, A. V.
2008-01-01
In this paper we analyse capabilities of eclipse mapping technique, based on genetic algorithm optimization. To model of accretion disk we used the "fire-flies" conception. This model allows us to reconstruct the distribution of radiating medium in the disk using less number of free parameters than in other methods. Test models show that we can achieve good approximation without optimizing techniques.
de Casteljau's Algorithm Revisited
DEFF Research Database (Denmark)
Gravesen, Jens
1998-01-01
It is demonstrated how all the basic properties of Bezier curves can be derived swiftly and efficiently without any reference to the Bernstein polynomials and essentially with only geometric arguments. This is achieved by viewing one step in de Casteljau's algorithm as an operator (the de Casteljau...
Python algorithms mastering basic algorithms in the Python language
Hetland, Magnus Lie
2014-01-01
Python Algorithms, Second Edition explains the Python approach to algorithm analysis and design. Written by Magnus Lie Hetland, author of Beginning Python, this book is sharply focused on classical algorithms, but it also gives a solid understanding of fundamental algorithmic problem-solving techniques. The book deals with some of the most important and challenging areas of programming and computer science in a highly readable manner. It covers both algorithmic theory and programming practice, demonstrating how theory is reflected in real Python programs. Well-known algorithms and data struc
A MEDLINE categorization algorithm
Darmoni, Stefan J; Névéol, Aurelie; Renard, Jean-Marie; Gehanno, Jean-Francois; Soualmia, Lina F; Dahamna, Badisse; Thirion, Benoit
2006-01-01
Background Categorization is designed to enhance resource description by organizing content description so as to enable the reader to grasp quickly and easily what are the main topics discussed in it. The objective of this work is to propose a categorization algorithm to classify a set of scientific articles indexed with the MeSH thesaurus, and in particular those of the MEDLINE bibliographic database. In a large bibliographic database such as MEDLINE, finding materials of particular interest to a specialty group, or relevant to a particular audience, can be difficult. The categorization refines the retrieval of indexed material. In the CISMeF terminology, metaterms can be considered as super-concepts. They were primarily conceived to improve recall in the CISMeF quality-controlled health gateway. Methods The MEDLINE categorization algorithm (MCA) is based on semantic links existing between MeSH terms and metaterms on the one hand and between MeSH subheadings and metaterms on the other hand. These links are used to automatically infer a list of metaterms from any MeSH term/subheading indexing. Medical librarians manually select the semantic links. Results The MEDLINE categorization algorithm lists the medical specialties relevant to a MEDLINE file by decreasing order of their importance. The MEDLINE categorization algorithm is available on a Web site. It can run on any MEDLINE file in a batch mode. As an example, the top 3 medical specialties for the set of 60 articles published in BioMed Central Medical Informatics & Decision Making, which are currently indexed in MEDLINE are: information science, organization and administration and medical informatics. Conclusion We have presented a MEDLINE categorization algorithm in order to classify the medical specialties addressed in any MEDLINE file in the form of a ranked list of relevant specialties. The categorization method introduced in this paper is based on the manual indexing of resources with MeSH (terms
THE APPROACHING TRAIN DETECTION ALGORITHM
Directory of Open Access Journals (Sweden)
S. V. Bibikov
2015-09-01
Full Text Available The paper deals with detection algorithm for rail vibroacoustic waves caused by approaching train on the background of increased noise. The urgency of algorithm development for train detection in view of increased rail noise, when railway lines are close to roads or road intersections is justified. The algorithm is based on the method of weak signals detection in a noisy environment. The information statistics ultimate expression is adjusted. We present the results of algorithm research and testing of the train approach alarm device that implements the proposed algorithm. The algorithm is prepared for upgrading the train approach alarm device “Signalizator-P".
Genetic Algorithm for Optimization: Preprocessor and Algorithm
Sen, S. K.; Shaykhian, Gholam A.
2006-01-01
Genetic algorithm (GA) inspired by Darwin's theory of evolution and employed to solve optimization problems - unconstrained or constrained - uses an evolutionary process. A GA has several parameters such the population size, search space, crossover and mutation probabilities, and fitness criterion. These parameters are not universally known/determined a priori for all problems. Depending on the problem at hand, these parameters need to be decided such that the resulting GA performs the best. We present here a preprocessor that achieves just that, i.e., it determines, for a specified problem, the foregoing parameters so that the consequent GA is a best for the problem. We stress also the need for such a preprocessor both for quality (error) and for cost (complexity) to produce the solution. The preprocessor includes, as its first step, making use of all the information such as that of nature/character of the function/system, search space, physical/laboratory experimentation (if already done/available), and the physical environment. It also includes the information that can be generated through any means - deterministic/nondeterministic/graphics. Instead of attempting a solution of the problem straightway through a GA without having/using the information/knowledge of the character of the system, we would do consciously a much better job of producing a solution by using the information generated/created in the very first step of the preprocessor. We, therefore, unstintingly advocate the use of a preprocessor to solve a real-world optimization problem including NP-complete ones before using the statistically most appropriate GA. We also include such a GA for unconstrained function optimization problems.
Kramer, Oliver
2017-01-01
This book introduces readers to genetic algorithms (GAs) with an emphasis on making the concepts, algorithms, and applications discussed as easy to understand as possible. Further, it avoids a great deal of formalisms and thus opens the subject to a broader audience in comparison to manuscripts overloaded by notations and equations. The book is divided into three parts, the first of which provides an introduction to GAs, starting with basic concepts like evolutionary operators and continuing with an overview of strategies for tuning and controlling parameters. In turn, the second part focuses on solution space variants like multimodal, constrained, and multi-objective solution spaces. Lastly, the third part briefly introduces theoretical tools for GAs, the intersections and hybridizations with machine learning, and highlights selected promising applications.
Directory of Open Access Journals (Sweden)
Ruholla Jafari-Marandi
2017-04-01
Full Text Available Genetic Algorithm (GA has been one of the most popular methods for many challenging optimization problems when exact approaches are too computationally expensive. A review of the literature shows extensive research attempting to adapt and develop the standard GA. Nevertheless, the essence of GA which consists of concepts such as chromosomes, individuals, crossover, mutation, and others rarely has been the focus of recent researchers. In this paper method, Fluid Genetic Algorithm (FGA, some of these concepts are changed, removed, and furthermore, new concepts are introduced. The performance of GA and FGA are compared through seven benchmark functions. FGA not only shows a better success rate and better convergence control, but it can be applied to a wider range of problems including multi-objective and multi-level problems. Also, the application of FGA for a real engineering problem, Quadric Assignment Problem (AQP, is shown and experienced.
Partitional clustering algorithms
2015-01-01
This book summarizes the state-of-the-art in partitional clustering. Clustering, the unsupervised classification of patterns into groups, is one of the most important tasks in exploratory data analysis. Primary goals of clustering include gaining insight into, classifying, and compressing data. Clustering has a long and rich history that spans a variety of scientific disciplines including anthropology, biology, medicine, psychology, statistics, mathematics, engineering, and computer science. As a result, numerous clustering algorithms have been proposed since the early 1950s. Among these algorithms, partitional (nonhierarchical) ones have found many applications, especially in engineering and computer science. This book provides coverage of consensus clustering, constrained clustering, large scale and/or high dimensional clustering, cluster validity, cluster visualization, and applications of clustering. Examines clustering as it applies to large and/or high-dimensional data sets commonly encountered in reali...
Aydemir, Bahar
2017-01-01
The Trigger and Data Acquisition (TDAQ) system of the ATLAS detector at the Large Hadron Collider (LHC) at CERN is composed of a large number of distributed hardware and software components. TDAQ system consists of about 3000 computers and more than 25000 applications which, in a coordinated manner, provide the data-taking functionality of the overall system. There is a number of online services required to configure, monitor and control the ATLAS data taking. In particular, the configuration service is used to provide configuration of above components. The configuration of the ATLAS data acquisition system is stored in XML-based object database named OKS. DAL (Data Access Library) allowing to access it's information by C++, Java and Python clients in a distributed environment. Some information has quite complicated structure, so it's extraction requires writing special algorithms. Algorithms available on C++ programming language and partially reimplemented on Java programming language. The goal of the projec...
Boosting foundations and algorithms
Schapire, Robert E
2012-01-01
Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate "rules of thumb." A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry. Boosting algorithms have also enjoyed practical success in such fields as biology, vision, and speech processing. At various times in its history, boosting has been perceived as mysterious, controversial, even paradoxical.
Combinatory CPU Scheduling Algorithm
Saeeda Bibi; Farooque Azam; Yasir Chaudhry
2010-01-01
Central Processing Unit (CPU) plays a significant role in computer system by transferring its control among different processes. As CPU is a central component, hence it must be used efficiently. Operating system performs an essential task that is known as CPU scheduling for efficient utilization of CPU. CPU scheduling has strong effect on resource utilization as well as overall performance of the system. In this paper, a new CPU scheduling algorithm called Combinatory is proposed that combine...
KAM Tori Construction Algorithms
Wiesel, W.
In this paper we evaluate and compare two algorithms for the calculation of KAM tori in Hamiltonian systems. The direct fitting of a torus Fourier series to a numerically integrated trajectory is the first method, while an accelerated finite Fourier transform is the second method. The finite Fourier transform, with Hanning window functions, is by far superior in both computational loading and numerical accuracy. Some thoughts on applications of KAM tori are offered.
Cerf, Raphaël
1996-01-01
Here is a new genetic algorithm. It is built by randomly perturbing a two operator crossover-selection scheme. Three conditions of biological relevance are imposed on the crossover. A new selection mechanism is used, which has the decisive advantage of preserving the diversity of the individuals in the population. The attractors of the unperturbed process are particular equifitness subsets of populations endowed with a rich structure. The random vanishing perturbations are t...
Parallel Genetic Algorithm System
Nagaraju Sangepu; Vikram, K.
2010-01-01
Genetic Algorithm (GA) is a popular technique to find the optimum of transformation, because of its simple implementation procedure. In image processing GAs are used as a parameter-search-for procedure, this processing requires very high performance of the computer. Recently, parallel processing used to reduce the time by distributing the appropriate amount of work to each computer in the clustering system. The processing time reduces with the number of dedicated computers. Parallel implement...
An efficient algorithm for function optimization: modified stem cells algorithm
Taherdangkoo, Mohammad; Paziresh, Mahsa; Yazdi, Mehran; Bagheri, Mohammad
2013-03-01
In this paper, we propose an optimization algorithm based on the intelligent behavior of stem cell swarms in reproduction and self-organization. Optimization algorithms, such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm, Ant Colony Optimization (ACO) algorithm and Artificial Bee Colony (ABC) algorithm, can give solutions to linear and non-linear problems near to the optimum for many applications; however, in some case, they can suffer from becoming trapped in local optima. The Stem Cells Algorithm (SCA) is an optimization algorithm inspired by the natural behavior of stem cells in evolving themselves into new and improved cells. The SCA avoids the local optima problem successfully. In this paper, we have made small changes in the implementation of this algorithm to obtain improved performance over previous versions. Using a series of benchmark functions, we assess the performance of the proposed algorithm and compare it with that of the other aforementioned optimization algorithms. The obtained results prove the superiority of the Modified Stem Cells Algorithm (MSCA).
An Algorithmic Diversity Diet?
DEFF Research Database (Denmark)
Sørensen, Jannick Kirk; Schmidt, Jan-Hinrik
2016-01-01
With the growing influence of personalized algorithmic recommender systems on the exposure of media content to users, the relevance of discussing the diversity of recommendations increases, particularly as far as public service media (PSM) is concerned. An imagined implementation of a diversity d...... of a diversity diet system generates questions not just about editorial power, personal freedom and techno-paternalism, but also about the embedded politics of recommender systems as well as the human skills affiliated with PSM editorial work and the nature of PSM content.......With the growing influence of personalized algorithmic recommender systems on the exposure of media content to users, the relevance of discussing the diversity of recommendations increases, particularly as far as public service media (PSM) is concerned. An imagined implementation of a diversity...... diet system however triggers not only the classic discussion of the reach – distinctiveness balance for PSM, but also shows that ‘diversity’ is understood very differently in algorithmic recommender system communities than it is editorially and politically in the context of PSM. The design...
NEUTRON ALGORITHM VERIFICATION TESTING
Energy Technology Data Exchange (ETDEWEB)
COWGILL,M.; MOSBY,W.; ARGONNE NATIONAL LABORATORY-WEST
2000-07-19
Active well coincidence counter assays have been performed on uranium metal highly enriched in {sup 235}U. The data obtained in the present program, together with highly enriched uranium (HEU) metal data obtained in other programs, have been analyzed using two approaches, the standard approach and an alternative approach developed at BNL. Analysis of the data with the standard approach revealed that the form of the relationship between the measured reals and the {sup 235}U mass varied, being sometimes linear and sometimes a second-order polynomial. In contrast, application of the BNL algorithm, which takes into consideration the totals, consistently yielded linear relationships between the totals-corrected reals and the {sup 235}U mass. The constants in these linear relationships varied with geometric configuration and level of enrichment. This indicates that, when the BNL algorithm is used, calibration curves can be established with fewer data points and with more certainty than if a standard algorithm is used. However, this potential advantage has only been established for assays of HEU metal. In addition, the method is sensitive to the stability of natural background in the measurement facility.
Large scale tracking algorithms
Energy Technology Data Exchange (ETDEWEB)
Hansen, Ross L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Love, Joshua Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Melgaard, David Kennett [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Karelitz, David B. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Pitts, Todd Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Zollweg, Joshua David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Anderson, Dylan Z. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Nandy, Prabal [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Whitlow, Gary L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Bender, Daniel A. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Byrne, Raymond Harry [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2015-01-01
Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.
Foundations of genetic algorithms 1991
1991-01-01
Foundations of Genetic Algorithms 1991 (FOGA 1) discusses the theoretical foundations of genetic algorithms (GA) and classifier systems.This book compiles research papers on selection and convergence, coding and representation, problem hardness, deception, classifier system design, variation and recombination, parallelization, and population divergence. Other topics include the non-uniform Walsh-schema transform; spurious correlations and premature convergence in genetic algorithms; and variable default hierarchy separation in a classifier system. The grammar-based genetic algorithm; condition
Parallel Architectures and Bioinspired Algorithms
Pérez, José; Lanchares, Juan
2012-01-01
This monograph presents examples of best practices when combining bioinspired algorithms with parallel architectures. The book includes recent work by leading researchers in the field and offers a map with the main paths already explored and new ways towards the future. Parallel Architectures and Bioinspired Algorithms will be of value to both specialists in Bioinspired Algorithms, Parallel and Distributed Computing, as well as computer science students trying to understand the present and the future of Parallel Architectures and Bioinspired Algorithms.
Essential algorithms a practical approach to computer algorithms
Stephens, Rod
2013-01-01
A friendly and accessible introduction to the most useful algorithms Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview. Reveals methods for manipulating common data structures s
Multisensor estimation: New distributed algorithms
Directory of Open Access Journals (Sweden)
Plataniotis K. N.
1997-01-01
Full Text Available The multisensor estimation problem is considered in this paper. New distributed algorithms, which are able to locally process the information and which deliver identical results to those generated by their centralized counterparts are presented. The algorithms can be used to provide robust and computationally efficient solutions to the multisensor estimation problem. The proposed distributed algorithms are theoretically interesting and computationally attractive.
A Novel Adaptive Algorithm Addresses Potential Problems of Blind Algorithm
Directory of Open Access Journals (Sweden)
Muhammad Yasin
2016-01-01
Full Text Available A hybrid algorithm called constant modulus least mean square (CMLMS algorithm is proposed in order to address the potential problems existing with constant modulus algorithm (CMA about its convergence. It is a two-stage adaptive filtering algorithm and based on least mean square (LMS algorithm followed by CMA. A hybrid algorithm is theoretically developed and the same is verified through MatLab Software. Theoretical model is verified through simulation and its performance is evaluated in smart antenna in presence of a cochannel interfering signal and additive white Gaussian noise (AWGN of zero mean. This is also tested in Rayleigh fading channel using digital modulation technique for Bit Error Rate (BER. Finally, a few computer simulations are presented in order to substantiate the theoretical findings with respect to proposed model. Corresponding results obtained with the use of only CMA and LMS algorithms are also presented for further comparison.
Opposite Degree Algorithm and Its Applications
Directory of Open Access Journals (Sweden)
Xiao-Guang Yue
2015-12-01
Full Text Available The opposite (Opposite Degree, referred to as OD algorithm is an intelligent algorithm proposed by Yue Xiaoguang et al. Opposite degree algorithm is mainly based on the concept of opposite degree, combined with the idea of design of neural network and genetic algorithm and clustering analysis algorithm. The OD algorithm is divided into two sub algorithms, namely: opposite degree - numerical computation (OD-NC algorithm and opposite degree - Classification computation (OD-CC algorithm.
Algorithms for Global Positioning
DEFF Research Database (Denmark)
Borre, Kai; Strang, Gilbert
and replaces the authors' previous work, Linear Algebra, Geodesy, and GPS (1997). An initial discussion of the basic concepts, characteristics and technical aspects of different satellite systems is followed by the necessary mathematical content which is presented in a detailed and self-contained fashion....... At the heart of the matter are the positioning algorithms on which GPS technology relies, the discussion of which will affirm the mathematical contents of the previous chapters. Numerous ready-to-use MATLAB codes are included for the reader. This comprehensive guide will be invaluable for engineers...... and academic researchers who wish to master the theory and practical application of GPS technology....
Experimental Analysis of Algorithms.
1987-12-01
0.82. 0.82, and 0.8 for n a 32000, -V --V ° 31 a b 0 140 I I- - - .7 .6 1 .9 15. a xii 2-:EpySaebo ayn 640, n 180. hseetiae d otispr onienebeas000men d...the algorithm implemented as a C macro. The 55.e!ement array Rand was initialized by 55 calls to the BSD Unix 4 1 system random number generator, a...linear congruential generator producing integers in the range (0 2’:- 1]. #define Maxrand (1 << 30) int Rand [55]; int KJ; #define RAND (X) X Rand [K
Modular Regularization Algorithms
DEFF Research Database (Denmark)
Jacobsen, Michael
2004-01-01
an iterative method. The parameter choice method is also used to demonstrate the implementation of the standard-form transformation. We have implemented a simple preconditioner aimed at the preconditioning of the general-form Tikhonov problem and demonstrate its simplicity and effciency. The steps taken...... and used to set up the illposed problems in the toolbox. Hereby, we are able to write regularization algorithms that automatically exploit structure in the ill-posed problem without being rewritten explicitly. We explain how to implement a stopping criteria for a parameter choice method based upon...
Battin, R. H.; Vaughan, R. M.
1983-10-01
A fundamental problem in astrodynamics is concerned with the determination of an orbit, having a specified flight time and connecting two position vectors. The present investigation is concerned with a new method for solving this problem, which is frequently referred to as Lambert's problem. This method parallels closely Gauss' classical method but is superior to it. The new algorithm converges rapidly for any given geometry and time of flight. Since there is no need to be concerned with specific starting values for different input parameters, this method appears to be a very attractive alternative to Newton-Raphson schemes for most space guidance applications.
Merceret, Francis; Lane, John; Immer, Christopher; Case, Jonathan; Manobianco, John
2005-01-01
The contour error map (CEM) algorithm and the software that implements the algorithm are means of quantifying correlations between sets of time-varying data that are binarized and registered on spatial grids. The present version of the software is intended for use in evaluating numerical weather forecasts against observational sea-breeze data. In cases in which observational data come from off-grid stations, it is necessary to preprocess the observational data to transform them into gridded data. First, the wind direction is gridded and binarized so that D(i,j;n) is the input to CEM based on forecast data and d(i,j;n) is the input to CEM based on gridded observational data. Here, i and j are spatial indices representing 1.25-km intervals along the west-to-east and south-to-north directions, respectively; and n is a time index representing 5-minute intervals. A binary value of D or d = 0 corresponds to an offshore wind, whereas a value of D or d = 1 corresponds to an onshore wind. CEM includes two notable subalgorithms: One identifies and verifies sea-breeze boundaries; the other, which can be invoked optionally, performs an image-erosion function for the purpose of attempting to eliminate river-breeze contributions in the wind fields.
Rabideau, Gregg R.; Chien, Steve A.
2010-01-01
AVA v2 software selects goals for execution from a set of goals that oversubscribe shared resources. The term goal refers to a science or engineering request to execute a possibly complex command sequence, such as image targets or ground-station downlinks. Developed as an extension to the Virtual Machine Language (VML) execution system, the software enables onboard and remote goal triggering through the use of an embedded, dynamic goal set that can oversubscribe resources. From the set of conflicting goals, a subset must be chosen that maximizes a given quality metric, which in this case is strict priority selection. A goal can never be pre-empted by a lower priority goal, and high-level goals can be added, removed, or updated at any time, and the "best" goals will be selected for execution. The software addresses the issue of re-planning that must be performed in a short time frame by the embedded system where computational resources are constrained. In particular, the algorithm addresses problems with well-defined goal requests without temporal flexibility that oversubscribes available resources. By using a fast, incremental algorithm, goal selection can be postponed in a "just-in-time" fashion allowing requests to be changed or added at the last minute. Thereby enabling shorter response times and greater autonomy for the system under control.
Fatigue evaluation algorithms: Review
Energy Technology Data Exchange (ETDEWEB)
Passipoularidis, V.A.; Broendsted, P.
2009-11-15
A progressive damage fatigue simulator for variable amplitude loads named FADAS is discussed in this work. FADAS (Fatigue Damage Simulator) performs ply by ply stress analysis using classical lamination theory and implements adequate stiffness discount tactics based on the failure criterion of Puck, to model the degradation caused by failure events in ply level. Residual strength is incorporated as fatigue damage accumulation metric. Once the typical fatigue and static properties of the constitutive ply are determined,the performance of an arbitrary lay-up under uniaxial and/or multiaxial load time series can be simulated. The predictions are validated against fatigue life data both from repeated block tests at a single stress ratio as well as against spectral fatigue using the WISPER, WISPERX and NEW WISPER load sequences on a Glass/Epoxy multidirectional laminate typical of a wind turbine rotor blade construction. Two versions of the algorithm, the one using single-step and the other using incremental application of each load cycle (in case of ply failure) are implemented and compared. Simulation results confirm the ability of the algorithm to take into account load sequence effects. In general, FADAS performs well in predicting life under both spectral and block loading fatigue. (author)
Algorithmic Relative Complexity
Directory of Open Access Journals (Sweden)
Daniele Cerra
2011-04-01
Full Text Available Information content and compression are tightly related concepts that can be addressed through both classical and algorithmic information theories, on the basis of Shannon entropy and Kolmogorov complexity, respectively. The definition of several entities in Kolmogorov’s framework relies upon ideas from classical information theory, and these two approaches share many common traits. In this work, we expand the relations between these two frameworks by introducing algorithmic cross-complexity and relative complexity, counterparts of the cross-entropy and relative entropy (or Kullback-Leibler divergence found in Shannon’s framework. We define the cross-complexity of an object x with respect to another object y as the amount of computational resources needed to specify x in terms of y, and the complexity of x related to y as the compression power which is lost when adopting such a description for x, compared to the shortest representation of x. Properties of analogous quantities in classical information theory hold for these new concepts. As these notions are incomputable, a suitable approximation based upon data compression is derived to enable the application to real data, yielding a divergence measure applicable to any pair of strings. Example applications are outlined, involving authorship attribution and satellite image classification, as well as a comparison to similar established techniques.
Applications of algorithmic differentiation to phase retrieval algorithms.
Jurling, Alden S; Fienup, James R
2014-07-01
In this paper, we generalize the techniques of reverse-mode algorithmic differentiation to include elementary operations on multidimensional arrays of complex numbers. We explore the application of the algorithmic differentiation to phase retrieval error metrics and show that reverse-mode algorithmic differentiation provides a framework for straightforward calculation of gradients of complicated error metrics without resorting to finite differences or laborious symbolic differentiation.
Algorithm aversion: people erroneously avoid algorithms after seeing them err.
Dietvorst, Berkeley J; Simmons, Joseph P; Massey, Cade
2015-02-01
Research shows that evidence-based algorithms more accurately predict the future than do human forecasters. Yet when forecasters are deciding whether to use a human forecaster or a statistical algorithm, they often choose the human forecaster. This phenomenon, which we call algorithm aversion, is costly, and it is important to understand its causes. We show that people are especially averse to algorithmic forecasters after seeing them perform, even when they see them outperform a human forecaster. This is because people more quickly lose confidence in algorithmic than human forecasters after seeing them make the same mistake. In 5 studies, participants either saw an algorithm make forecasts, a human make forecasts, both, or neither. They then decided whether to tie their incentives to the future predictions of the algorithm or the human. Participants who saw the algorithm perform were less confident in it, and less likely to choose it over an inferior human forecaster. This was true even among those who saw the algorithm outperform the human.
Quicksort algorithm again revisited
Directory of Open Access Journals (Sweden)
Charles Knessl
1999-12-01
Full Text Available We consider the standard Quicksort algorithm that sorts n distinct keys with all possible n! orderings of keys being equally likely. Equivalently, we analyze the total path length L(n in a randomly built binary search tree. Obtaining the limiting distribution of L(n is still an outstanding open problem. In this paper, we establish an integral equation for the probability density of the number of comparisons L(n. Then, we investigate the large deviations of L(n. We shall show that the left tail of the limiting distribution is much ``thinner'' (i.e., double exponential than the right tail (which is only exponential. Our results contain some constants that must be determined numerically. We use formal asymptotic methods of applied mathematics such as the WKB method and matched asymptotics.
Fighting Censorship with Algorithms
Mahdian, Mohammad
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this approach is that once the address of a proxy or an anonymizer is announced for use to the public, the authorities can easily filter all traffic to that address. This poses a challenge as to how proxy addresses can be announced to users without leaking too much information to the censorship authorities. In this paper, we formulate this question as an interesting algorithmic problem. We study this problem in a static and a dynamic model, and give almost tight bounds on the number of proxy servers required to give access to n people k of whom are adversaries. We will also discuss how trust networks can be used in this context.
Algorithmic Reflections on Choreography
Directory of Open Access Journals (Sweden)
Pablo Ventura
2016-11-01
Full Text Available In 1996, Pablo Ventura turned his attention to the choreography software Life Forms to find out whether the then-revolutionary new tool could lead to new possibilities of expression in contemporary dance. During the next 2 decades, he devised choreographic techniques and custom software to create dance works that highlight the operational logic of computers, accompanied by computer-generated dance and media elements. This article provides a firsthand account of how Ventura’s engagement with algorithmic concepts guided and transformed his choreographic practice. The text describes the methods that were developed to create computer-aided dance choreographies. Furthermore, the text illustrates how choreography techniques can be applied to correlate formal and aesthetic aspects of movement, music, and video. Finally, the text emphasizes how Ventura’s interest in the wider conceptual context has led him to explore with choreographic means fundamental issues concerning the characteristics of humans and machines and their increasingly profound interdependencies.
Multisensor data fusion algorithm development
Energy Technology Data Exchange (ETDEWEB)
Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.
1995-12-01
This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.
An overview of smart grid routing algorithms
Wang, Junsheng; OU, Qinghai; Shen, Haijuan
2017-08-01
This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.
Algebraic Approach to Algorithmic Logic
Bancerek Grzegorz
2014-01-01
We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra st...
Krishna, K; Murty, Narasimha M
1999-01-01
In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optimal partition of a given data into a specified number of clusters. GAs used earlier in clustering employ either an expensive crossover operator to generate valid child chromosomes from parent chromosomes or a costly fitness function or both. To circumvent these expensive operations, we hybridize GA with a classical gradient descent algorithm used in clustering viz., K-means algorithm. Hence, the name gen...
Diversity-Guided Evolutionary Algorithms
DEFF Research Database (Denmark)
Ursem, Rasmus Kjær
2002-01-01
Population diversity is undoubtably a key issue in the performance of evolutionary algorithms. A common hypothesis is that high diversity is important to avoid premature convergence and to escape local optima. Various diversity measures have been used to analyze algorithms, but so far few...... algorithms have used a measure to guide the search. The diversity-guided evolutionary algorithm (DGEA) uses the wellknown distance-to-average-point measure to alternate between phases of exploration (mutation) and phases of exploitation (recombination and selection). The DGEA showed remarkable results...
Machine Learning an algorithmic perspective
Marsland, Stephen
2009-01-01
Traditional books on machine learning can be divided into two groups - those aimed at advanced undergraduates or early postgraduates with reasonable mathematical knowledge and those that are primers on how to code algorithms. The field is ready for a text that not only demonstrates how to use the algorithms that make up machine learning methods, but also provides the background needed to understand how and why these algorithms work. Machine Learning: An Algorithmic Perspective is that text.Theory Backed up by Practical ExamplesThe book covers neural networks, graphical models, reinforcement le
FRAMEWORK FOR COMPARING SEGMENTATION ALGORITHMS
Directory of Open Access Journals (Sweden)
G. Sithole
2015-05-01
Full Text Available The notion of a ‘Best’ segmentation does not exist. A segmentation algorithm is chosen based on the features it yields, the properties of the segments (point sets it generates, and the complexity of its algorithm. The segmentation is then assessed based on a variety of metrics such as homogeneity, heterogeneity, fragmentation, etc. Even after an algorithm is chosen its performance is still uncertain because the landscape/scenarios represented in a point cloud have a strong influence on the eventual segmentation. Thus selecting an appropriate segmentation algorithm is a process of trial and error. Automating the selection of segmentation algorithms and their parameters first requires methods to evaluate segmentations. Three common approaches for evaluating segmentation algorithms are ‘goodness methods’, ‘discrepancy methods’ and ‘benchmarks’. Benchmarks are considered the most comprehensive method of evaluation. This paper shortcomings in current benchmark methods are identified and a framework is proposed that permits both a visual and numerical evaluation of segmentations for different algorithms, algorithm parameters and evaluation metrics. The concept of the framework is demonstrated on a real point cloud. Current results are promising and suggest that it can be used to predict the performance of segmentation algorithms.
Recent results on howard's algorithm
DEFF Research Database (Denmark)
Miltersen, P.B.
2012-01-01
Howard’s algorithm is a fifty-year old generally applicable algorithm for sequential decision making in face of uncertainty. It is routinely used in practice in numerous application areas that are so important that they usually go by their acronyms, e.g., OR, AI, and CAV. While Howard’s algorithm...... is generally recognized as fast in practice, until recently, its worst case time complexity was poorly understood. However, a surge of results since 2009 has led us to a much more satisfactory understanding of the worst case time complexity of the algorithm in the various settings in which it applies...
Pandora Particle Flow Algorithm
Marshall, J S
2013-01-01
A high-energy e+e collider, such as the ILC or CLIC, is arguably the best option to complement and extend the LHC physics programme. A lepton collider will allow for exploration of Standard Model Physics, such as precise measurements of the Higgs, top and gauge sectors, in addition to enabling a multitude of New Physics searches. However, physics analyses at such a collider will place unprecedented demands on calorimetry, with a required jet energy resolution of sE=E . 3:5%. To meet these requirements will need a new approach to calorimetry. The particle flow approach to calorimetry requires both fine granularity detectors and sophisticated software algorithms. It promises to deliver unparalleled jet energy resolution by fully reconstructing the paths of individual particles through the detector. The energies of charged particles can then be extracted from precise inner detector tracker measurements, whilst photon energies will be measured in the ECAL, and only neutral hadron energies (10% of jet energies...
Algorithm for Autonomous Landing
Kuwata, Yoshiaki
2011-01-01
Because of their small size, high maneuverability, and easy deployment, micro aerial vehicles (MAVs) are used for a wide variety of both civilian and military missions. One of their current drawbacks is the vast array of sensors (such as GPS, altimeter, radar, and the like) required to make a landing. Due to the MAV s small payload size, this is a major concern. Replacing the imaging sensors with a single monocular camera is sufficient to land a MAV. By applying optical flow algorithms to images obtained from the camera, time-to-collision can be measured. This is a measurement of position and velocity (but not of absolute distance), and can avoid obstacles as well as facilitate a landing on a flat surface given a set of initial conditions. The key to this approach is to calculate time-to-collision based on some image on the ground. By holding the angular velocity constant, horizontal speed decreases linearly with the height, resulting in a smooth landing. Mathematical proofs show that even with actuator saturation or modeling/ measurement uncertainties, MAVs can land safely. Landings of this nature may have a higher velocity than is desirable, but this can be compensated for by a cushioning or dampening system, or by using a system of legs to grab onto a surface. Such a monocular camera system can increase vehicle payload size (or correspondingly reduce vehicle size), increase speed of descent, and guarantee a safe landing by directly correlating speed to height from the ground.
Pulmonary thromboembolism diagnosis algorithms
Energy Technology Data Exchange (ETDEWEB)
Kasai, Takeshi; Eto, Jun; Hayano, Daisuke; Ohashi, Masaki; Yoneda, Takahiro; Oyama, Hisaya; Inaba, Akira [Kameda General Hospital, Kamogawa, Chiba (Japan). Trauma and Emergency Care Center
2002-01-01
Our algorithm for diagnosing pulmonary thromboembolism combines ventilation/perfusion scanning with clinical criteria. Our perfusion scanning criterion states that high probability defines 2 segmental perfusion defects without corresponding radiographic abnormality and indeterminate probability defines less than 2 segmental perfusion defects (low probability: less than one segmental perfusion defect; intermediate: perfusion defects between high and low probability). The clinical criterion is divided into 7 items related to symptoms and signs suggestive of pulmonary thromboembolism. More than 4 items are defined as a highly suspicious clinical manifestation (HSCM), and less than 4 are considered a low suspicious clinical manifestation (LSCM). In 31 cases of high probability, 18 of HSCM did not include pulmonary angiograhy (PAG), and 13 of LSCM included PAG (positive: 11; negative: 2). In 12 cases of indeterminate probability, 7 of LSCM were observed without PAG and 5 of HSCM with PAG (positive: 4; negative: 1). PAG performance thus decreased to 41.9%. The positive prediction of high probability is 93.5%, which is very high, compared to indeterminate probability at 33.3%. (author)
Global alignment algorithms implementations | Fatumo ...
African Journals Online (AJOL)
In this paper, we implemented the two routes for sequence comparison, that is; the dotplot and Needleman-wunsch algorithm for global sequence alignment. Our algorithms were implemented in python programming language and were tested on Linux platform 1.60GHz, 512 MB of RAM SUSE 9.2 and 10.1 versions.
GPU-Accelerated Apriori Algorithm
Directory of Open Access Journals (Sweden)
Jiang Hao
2017-01-01
Full Text Available This paper propose a parallel Apriori algorithm based on GPU (GPUApriori for frequent itemsets mining, and designs a storage structure using bit table (BIT matrix to replace the traditional storage mode. In addition, parallel computing scheme on GPU is discussed. The experimental results show that GPUApriori algorithm can effectively improve the efficiency of frequent itemsets mining.
Algorithms in combinatorial design theory
Colbourn, CJ
1985-01-01
The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.
Recovery Rate of Clustering Algorithms
Li, Fajie; Klette, Reinhard; Wada, T; Huang, F; Lin, S
2009-01-01
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the algorithm when calculating a family of new clusters. Under the assumption of dealing with simulated data (i.e., known old
Five Performability Algorithms. A Comparison
Cloth, L.; Haverkort, Boudewijn R.H.M.
Since the introduction by John F. Meyer in 1980, various algorithms have been proposed to evaluate the performability distribution. In this paper we describe and compare five algorithms that have been proposed recently to evaluate this distribution: Picard's method, a uniformisation-based method, a
Algorithms on ensemble quantum computers.
Boykin, P Oscar; Mor, Tal; Roychowdhury, Vwani; Vatan, Farrokh
2010-06-01
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual computer cannot be performed; instead, only expectation values (over the complete ensemble of computers) can be measured. As a result of this limitation on the model of computation, many algorithms cannot be processed directly on such computers, and must be modified, as the common strategy of delaying the measurements usually does not resolve this ensemble-measurement problem. Here we present several new strategies for resolving this problem. Based on these strategies we provide new versions of some of the most important quantum algorithms, versions that are suitable for implementing on ensemble quantum computers, e.g., on liquid NMR quantum computers. These algorithms are Shor's factorization algorithm, Grover's search algorithm (with several marked items), and an algorithm for quantum fault-tolerant computation. The first two algorithms are simply modified using a randomizing and a sorting strategies. For the last algorithm, we develop a classical-quantum hybrid strategy for removing measurements. We use it to present a novel quantum fault-tolerant scheme. More explicitly, we present schemes for fault-tolerant measurement-free implementation of Toffoli and σ(z)(¼) as these operations cannot be implemented "bitwise", and their standard fault-tolerant implementations require measurement.
Online co-regularized algorithms
Ruijter, T. de; Tsivtsivadze, E.; Heskes, T.
2012-01-01
We propose an online co-regularized learning algorithm for classification and regression tasks. We demonstrate that by sequentially co-regularizing prediction functions on unlabeled data points, our algorithm provides improved performance in comparison to supervised methods on several UCI benchmarks
Ensemble algorithms in reinforcement learning
Wiering, Marco A; van Hasselt, Hado
This paper describes several ensemble methods that combine multiple different reinforcement learning (RL) algorithms in a single agent. The aim is to enhance learning speed and final performance by combining the chosen actions or action probabilities of different RL algorithms. We designed and
Algorithm Calculates Cumulative Poisson Distribution
Bowerman, Paul N.; Nolty, Robert C.; Scheuer, Ernest M.
1992-01-01
Algorithm calculates accurate values of cumulative Poisson distribution under conditions where other algorithms fail because numbers are so small (underflow) or so large (overflow) that computer cannot process them. Factors inserted temporarily to prevent underflow and overflow. Implemented in CUMPOIS computer program described in "Cumulative Poisson Distribution Program" (NPO-17714).
Salvy, Bruno
1993-01-01
These seminar notes represent the proceedings (some in French) of a seminar devoted to the analysis of algorithms and related topics. The subjects covered include combinatorial models and random generation, symbolic computation, asymptotic analysis, average-case analysis of algorithms and data structures and some computational number theory.
The asymptotic probabilistic genetic algorithm
Galushin, P.; Semenkin, E.
2009-01-01
This paper proposes the modification of probabilistic genetic algorithm, which uses genetic operators, not affecting the particular solutions, but the probabilities distribution of solution vector's components. This paper also compares the reliability and efficiency of the base algorithm and proposed modification using the set of test optimization problems and bank loan portfolio problem.
A distributed spanning tree algorithm
DEFF Research Database (Denmark)
Johansen, Karl Erik; Jørgensen, Ulla Lundin; Nielsen, Svend Hauge
1988-01-01
We present a distributed algorithm for constructing a spanning tree for connected undirected graphs. Nodes correspond to processors and edges correspond to two way channels. Each processor has initially a distinct identity and all processors perform the same algorithm. Computation as well...
A fast fractional difference algorithm
DEFF Research Database (Denmark)
Jensen, Andreas Noack; Nielsen, Morten Ørregaard
2014-01-01
We provide a fast algorithm for calculating the fractional difference of a time series. In standard implementations, the calculation speed (number of arithmetic operations) is of order T 2, where T is the length of the time series. Our algorithm allows calculation speed of order T log...
A Fast Fractional Difference Algorithm
DEFF Research Database (Denmark)
Jensen, Andreas Noack; Nielsen, Morten Ørregaard
We provide a fast algorithm for calculating the fractional difference of a time series. In standard implementations, the calculation speed (number of arithmetic operations) is of order T 2, where T is the length of the time series. Our algorithm allows calculation speed of order T log...
A Distributed Spanning Tree Algorithm
DEFF Research Database (Denmark)
Johansen, Karl Erik; Jørgensen, Ulla Lundin; Nielsen, Sven Hauge
We present a distributed algorithm for constructing a spanning tree for connected undirected graphs. Nodes correspond to processors and edges correspond to two-way channels. Each processor has initially a distinct identity and all processors perform the same algorithm. Computation as well...
Adaptive Beamforming Using Genetic Algorithms
Directory of Open Access Journals (Sweden)
Z. Raida
1998-09-01
Full Text Available The presented submission describes how genetic algorithms can be applied to the control of adaptive antennas. The proposed optimization method is easily implementable on one hand, but relatively slowly converging and depending on the parameters of the genetic algorithms on the other hand. The disadvantages as well as some possible improvements are discussed in this paper.
Elementary functions algorithms and implementation
Muller, Jean-Michel
2016-01-01
This textbook presents the concepts and tools necessary to understand, build, and implement algorithms for computing elementary functions (e.g., logarithms, exponentials, and the trigonometric functions). Both hardware- and software-oriented algorithms are included, along with issues related to accurate floating-point implementation. This third edition has been updated and expanded to incorporate the most recent advances in the field, new elementary function algorithms, and function software. After a preliminary chapter that briefly introduces some fundamental concepts of computer arithmetic, such as floating-point arithmetic and redundant number systems, the text is divided into three main parts. Part I considers the computation of elementary functions using algorithms based on polynomial or rational approximations and using table-based methods; the final chapter in this section deals with basic principles of multiple-precision arithmetic. Part II is devoted to a presentation of “shift-and-add” algorithm...
Linear feature detection algorithm for astronomical surveys - I. Algorithm description
Bektešević, Dino; Vinković, Dejan
2017-11-01
Computer vision algorithms are powerful tools in astronomical image analyses, especially when automation of object detection and extraction is required. Modern object detection algorithms in astronomy are oriented towards detection of stars and galaxies, ignoring completely the detection of existing linear features. With the emergence of wide-field sky surveys, linear features attract scientific interest as possible trails of fast flybys of near-Earth asteroids and meteors. In this work, we describe a new linear feature detection algorithm designed specifically for implementation in big data astronomy. The algorithm combines a series of algorithmic steps that first remove other objects (stars and galaxies) from the image and then enhance the line to enable more efficient line detection with the Hough algorithm. The rate of false positives is greatly reduced thanks to a step that replaces possible line segments with rectangles and then compares lines fitted to the rectangles with the lines obtained directly from the image. The speed of the algorithm and its applicability in astronomical surveys are also discussed.
Algorithmic advances in stochastic programming
Energy Technology Data Exchange (ETDEWEB)
Morton, D.P.
1993-07-01
Practical planning problems with deterministic forecasts of inherently uncertain parameters often yield unsatisfactory solutions. Stochastic programming formulations allow uncertain parameters to be modeled as random variables with known distributions, but the size of the resulting mathematical programs can be formidable. Decomposition-based algorithms take advantage of special structure and provide an attractive approach to such problems. We consider two classes of decomposition-based stochastic programming algorithms. The first type of algorithm addresses problems with a ``manageable`` number of scenarios. The second class incorporates Monte Carlo sampling within a decomposition algorithm. We develop and empirically study an enhanced Benders decomposition algorithm for solving multistage stochastic linear programs within a prespecified tolerance. The enhancements include warm start basis selection, preliminary cut generation, the multicut procedure, and decision tree traversing strategies. Computational results are presented for a collection of ``real-world`` multistage stochastic hydroelectric scheduling problems. Recently, there has been an increased focus on decomposition-based algorithms that use sampling within the optimization framework. These approaches hold much promise for solving stochastic programs with many scenarios. A critical component of such algorithms is a stopping criterion to ensure the quality of the solution. With this as motivation, we develop a stopping rule theory for algorithms in which bounds on the optimal objective function value are estimated by sampling. Rules are provided for selecting sample sizes and terminating the algorithm under which asymptotic validity of confidence interval statements for the quality of the proposed solution can be verified. Issues associated with the application of this theory to two sampling-based algorithms are considered, and preliminary empirical coverage results are presented.
2011-03-01
WE RECOMMEND Requiem for a Species This book delivers a sober message about climate change Laser Sound System Sound kit is useful for laser demonstrations EasySense VISION Data Harvest produces another easy-to-use data logger UV Flash Kit Useful equipment captures shadows on film The Demon-Haunted World World-famous astronomer attacks pseudoscience in this book Nonsense on Stilts A thought-provoking analysis of hard and soft sciences How to Think about Weird Things This book explores the credibility of astrologers and their ilk WORTH A LOOK Chameleon Nano Flakes Product lacks good instructions and guidelines WEB WATCH Amateur scientists help out researchers with a variety of online projects
Subaperture stitching algorithms: A comparison
Chen, Shanyong; Xue, Shuai; Wang, Guilin; Tian, Ye
2017-05-01
With the research focus of subaperture stitching interferometry shifting from flat wavefronts to aspheric ones, a variety of algorithms for stitching optimization have been proposed. We try to category and compare the algorithms in this paper by their modeling of misalignment-induced subaperture aberrations which are of low orders. A simple way is to relate the aberrations to misalignment by linear approximation with small angle assumption. But it can not exactly model the induced aberrations of aspheres. In general, the induced aberrations can be fitted to free polynomials and then removed from subaperture measurements. However, it is at the risk of mixing up the surface error and the induced aberrations. The misalignment actually introduces different terms of aberrations with certain proportions. The interrelation is then determined through analytical modeling or ray tracing. The analytical model-based algorithm and the ray tracing-based algorithm both are tedious, aperture shape-related and surface type-specific. While the configuration space-based algorithm we proposed numerically calculates the surface height change under rigid body transformation, it is generally applicable to various surface types and different aperture shapes. Simulations and experiments are presented to compare the stitching results when different algorithms are applied to null cylindrical subapertures measured with a computer generated hologram. The configuration space-based algorithm shows superior flexibility and accuracy.
A general framework for shortest path algorithms
W.H.L.M. Pijls (Wim); A.W.J. Kolen
1992-01-01
textabstractIn this paper we present a general framework for shortest path algorithms, including amongst others Dijkstra's algorithm and the A* algorithm. By showing that all algorithms are special cases of one algorithm in which some of the nondeterministic choices are made deterministic,
Algorithms Design Techniques and Analysis
Alsuwaiyel, M H
1999-01-01
Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) solution of the formulated problem. One can solve a problem on its own using ad hoc techniques or follow those techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions and the context appropriate for each of them. This book advocates the study of algorithm design techniques by presenting most of the useful algorithm desi
On the Simplex Algorithm Initializing
Directory of Open Access Journals (Sweden)
Nebojša V. Stojković
2012-01-01
Full Text Available This paper discusses the importance of starting point in the simplex algorithm. Three different methods for finding a basic feasible solution are compared throughout performed numerical test examples. We show that our two methods on the Netlib test problems have better performances than the classical algorithm for finding initial solution. The comparison of the introduced optimization softwares is based on the number of iterative steps and on the required CPU time. It is pointed out that on average it takes more iterations to determine the starting point than the number of iterations required by the simplex algorithm to find the optimal solution.
Instance-specific algorithm configuration
Malitsky, Yuri
2014-01-01
This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents the basic model behind ISAC and then details a number of modifications and practical applications. In particular, he addresses automated feature generation, offline algorithm configuration for portfolio generation, algorithm selection, adaptive solvers, online tuning, and parallelization. The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014,
Subcubic Control Flow Analysis Algorithms
DEFF Research Database (Denmark)
Midtgaard, Jan; Van Horn, David
We give the first direct subcubic algorithm for performing control flow analysis of higher-order functional programs. Despite the long held belief that inclusion-based flow analysis could not surpass the ``cubic bottleneck, '' we apply known set compression techniques to obtain an algorithm...... that runs in time O(n^3/log n) on a unit cost random-access memory model machine. Moreover, we refine the initial flow analysis into two more precise analyses incorporating notions of reachability. We give subcubic algorithms for these more precise analyses and relate them to an existing analysis from...
Cluster algorithms and computational complexity
Li, Xuenan
Cluster algorithms for the 2D Ising model with a staggered field have been studied and a new cluster algorithm for path sampling has been worked out. The complexity properties of Bak-Seppen model and the Growing network model have been studied by using the Computational Complexity Theory. The dynamic critical behavior of the two-replica cluster algorithm is studied. Several versions of the algorithm are applied to the two-dimensional, square lattice Ising model with a staggered field. The dynamic exponent for the full algorithm is found to be less than 0.5. It is found that odd translations of one replica with respect to the other together with global flips are essential for obtaining a small value of the dynamic exponent. The path sampling problem for the 1D Ising model is studied using both a local algorithm and a novel cluster algorithm. The local algorithm is extremely inefficient at low temperature, where the integrated autocorrelation time is found to be proportional to the fourth power of correlation length. The dynamic exponent of the cluster algorithm is found to be zero and therefore proved to be much more efficient than the local algorithm. The parallel computational complexity of the Bak-Sneppen evolution model is studied. It is shown that Bak-Sneppen histories can be generated by a massively parallel computer in a time that is polylog in the length of the history, which means that the logical depth of producing a Bak-Sneppen history is exponentially less than the length of the history. The parallel dynamics for generating Bak-Sneppen histories is contrasted to standard Bak-Sneppen dynamics. The parallel computational complexity of the Growing Network model is studied. The growth of the network with linear kernels is shown to be not complex and an algorithm with polylog parallel running time is found. The growth of the network with gamma ≥ 2 super-linear kernels can be realized by a randomized parallel algorithm with polylog expected running time.
Algebraic Approach to Algorithmic Logic
Directory of Open Access Journals (Sweden)
Bancerek Grzegorz
2014-09-01
Full Text Available We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra structure which is an extension of language signature and program algebra. While-if algebra of generator set and algebraic signature is bialgebra with appropriate properties and is used as basic type of algebraic logic.
Complex networks an algorithmic perspective
Erciyes, Kayhan
2014-01-01
Network science is a rapidly emerging field of study that encompasses mathematics, computer science, physics, and engineering. A key issue in the study of complex networks is to understand the collective behavior of the various elements of these networks.Although the results from graph theory have proven to be powerful in investigating the structures of complex networks, few books focus on the algorithmic aspects of complex network analysis. Filling this need, Complex Networks: An Algorithmic Perspective supplies the basic theoretical algorithmic and graph theoretic knowledge needed by every r
A filtered backprojection algorithm with characteristics of the iterative landweber algorithm
L. Zeng, Gengsheng
2012-01-01
Purpose: In order to eventually develop an analytical algorithm with noise characteristics of an iterative algorithm, this technical note develops a window function for the filtered backprojection (FBP) algorithm in tomography that behaves as an iterative Landweber algorithm.
Designing algorithms using CAD technologies
Directory of Open Access Journals (Sweden)
Alin IORDACHE
2008-01-01
Full Text Available A representative example of eLearning-platform modular application, Ã¢Â€Â˜Logical diagramsÃ¢Â€Â™, is intended to be a useful learning and testing tool for the beginner programmer, but also for the more experienced one. The problem this application is trying to solve concerns young programmers who forget about the fundamentals of this domain, algorithmic. Logical diagrams are a graphic representation of an algorithm, which uses different geometrical figures (parallelograms, rectangles, rhombuses, circles with particular meaning that are called blocks and connected between them to reveal the flow of the algorithm. The role of this application is to help the user build the diagram for the algorithm and then automatically generate the C code and test it.
Planar graphs theory and algorithms
Nishizeki, T
1988-01-01
Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.
Multiagent scheduling models and algorithms
Agnetis, Alessandro; Gawiejnowicz, Stanisław; Pacciarelli, Dario; Soukhal, Ameur
2014-01-01
This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses complexity results, approximation schemes, heuristics and exact algorithms.
Quantum algorithms for number fields
Energy Technology Data Exchange (ETDEWEB)
Haase, D.; Maier, H. [Universitaet Ulm, Fakultaet fuer Mathematik und Wirtschaftswissenschaften, Helmholtzstrasse 18, 89069 Ulm (Germany)
2006-08-23
This is a survey of recent results on quantum algorithms for the computation of invariants of number fields, namely the class number and the regulator. Most known classical algorithms for the computation of these values are of subexponential complexity and depend on the truth of a still unproven hypothesis of analytic number theory. We use an important number theoretic concept, Minkowski's Geometry of Numbers, to visualize these invariants, and describe the quantum algorithms developed by Hallgren, Schmidt and Vollmer which compute these invariants using a polynomial number of steps. Computational techniques in number fields, which are necessary to justify the classical part of these quantum algorithms, are the focus of the research of our project group, and are explained in detail. (Abstract Copyright [2006], Wiley Periodicals, Inc.)
Communication Complexity (for Algorithm Designers)
Roughgarden, Tim
2015-01-01
This document collects the lecture notes from my course "Communication Complexity (for Algorithm Designers),'' taught at Stanford in the winter quarter of 2015. The two primary goals of the course are: 1. Learn several canonical problems that have proved the most useful for proving lower bounds (Disjointness, Index, Gap-Hamming, etc.). 2. Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds. Along the way, we'll also: 3. Get exposure t...
A Process Algebra Genetic Algorithm
Karaman, Sertac; Shima, Tal; Frazzoli, Emilio
2011-01-01
A genetic algorithm that utilizes process algebra for coding of solution chromosomes and for defining evolutionary based operators is presented. The algorithm is applicable to mission planning and optimization problems. As an example the high level mission planning for a cooperative group of uninhabited aerial vehicles is investigated. The mission planning problem is cast as an assignment problem, and solutions to the assignment problem are given in the form of chromosomes that are manipulate...
The Distributed Genetic Algorithm Revisited
Belding, Theodore C.
1995-01-01
This paper extends previous work done by Tanese on the distributed genetic algorithm (DGA). Tanese found that the DGA outperformed the canonical serial genetic algorithm (CGA) on a class of difficult, randomly-generated Walsh polynomials. This left open the question of whether the DGA would have similar success on functions that were more amenable to optimization by the CGA. In this work, experiments were done to compare the DGA's performance on the Royal Road class of fitness functions to th...
Optimization of LMS Algorithm for System Identification
SAURABH R. PRASAD; Godbole, Bhalchandra B.
2017-01-01
An adaptive filter is defined as a digital filter that has the capability of self adjusting its transfer function under the control of some optimizing algorithms. Most common optimizing algorithms are Least Mean Square (LMS) and Recursive Least Square (RLS). Although RLS algorithm perform superior to LMS algorithm, it has very high computational complexity so not useful in most of the practical scenario. So most feasible choice of the adaptive filtering algorithm is the LMS algorithm includin...
PARALLEL ALGORITHM FOR BAYESIAN NETWORK STRUCTURE LEARNING
Directory of Open Access Journals (Sweden)
S. A. Arustamov
2013-03-01
Full Text Available The article deals with implementation of a scalable parallel algorithm for structure learning of Bayesian network. Comparative analysis of sequential and parallel algorithms is done.
Algorithms as fetish: Faith and possibility in algorithmic work
Directory of Open Access Journals (Sweden)
Suzanne L Thomas
2018-01-01
Full Text Available Algorithms are powerful because we invest in them the power to do things. With such promise, they can transform the ordinary, say snapshots along a robotic vacuum cleaner’s route, into something much more, such as a clean home. Echoing David Graeber’s revision of fetishism, we argue that this easy slip from technical capabilities to broader claims betrays not the “magic” of algorithms but rather the dynamics of their exchange. Fetishes are not indicators of false thinking, but social contracts in material form. They mediate emerging distributions of power often too nascent, too slippery or too disconcerting to directly acknowledge. Drawing primarily on 2016 ethnographic research with computer vision professionals, we show how faith in what algorithms can do shapes the social encounters and exchanges of their production. By analyzing algorithms through the lens of fetishism, we can see the social and economic investment in some people’s labor over others. We also see everyday opportunities for social creativity and change. We conclude that what is problematic about algorithms is not their fetishization but instead their stabilization into full-fledged gods and demons – the more deserving objects of critique.
Golden Sine Algorithm: A Novel Math-Inspired Algorithm
Directory of Open Access Journals (Sweden)
TANYILDIZI, E.
2017-05-01
Full Text Available In this study, Golden Sine Algorithm (Gold-SA is presented as a new metaheuristic method for solving optimization problems. Gold-SA has been developed as a new search algorithm based on population. This math-based algorithm is inspired by sine that is a trigonometric function. In the algorithm, random individuals are created as many as the number of search agents with uniform distribution for each dimension. The Gold-SA operator searches to achieve a better solution in each iteration by trying to bring the current situation closer to the target value. The solution space is narrowed by the golden section so that the areas that are supposed to give only good results are scanned instead of the whole solution space scan. In the tests performed, it is seen that Gold-SA has better results than other population based methods. In addition, Gold-SA has fewer algorithm-dependent parameters and operators than other metaheuristic methods, increasing the importance of this method by providing faster convergence of this new method.
Energy Technology Data Exchange (ETDEWEB)
Chang, C.Y.
1986-01-01
New results on efficient forms of decoding convolutional codes based on Viterbi and stack algorithms using systolic array architecture are presented. Some theoretical aspects of systolic arrays are also investigated. First, systolic array implementation of Viterbi algorithm is considered, and various properties of convolutional codes are derived. A technique called strongly connected trellis decoding is introduced to increase the efficient utilization of all the systolic array processors. The issues dealing with the composite branch metric generation, survivor updating, overall system architecture, throughput rate, and computations overhead ratio are also investigated. Second, the existing stack algorithm is modified and restated in a more concise version so that it can be efficiently implemented by a special type of systolic array called systolic priority queue. Three general schemes of systolic priority queue based on random access memory, shift register, and ripple register are proposed. Finally, a systematic approach is presented to design systolic arrays for certain general classes of recursively formulated algorithms.
A review on quantum search algorithms
Giri, Pulak Ranjan; Korepin, Vladimir E.
2017-12-01
The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover's quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.
Computational geometry algorithms and applications
de Berg, Mark; Overmars, Mark; Schwarzkopf, Otfried
1997-01-01
Computational geometry emerged from the field of algorithms design and anal ysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The suc cess of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains--computer graphics, geographic in formation systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can ...
Multipath Binomial Congestion Control Algorithms
Le, Tuan Anh; Hong, Choong Seon; Lee, Sungwon
Nowadays portable devices with multiple wireless interfaces and using multimedia services are becoming more popular on the Internet. This paper describes a family of multipath binomial congestion control algorithms for audio/video streaming, where a low variant of transmission rate is important. We extend the fluid model of binomial algorithms for single-path transmission to support the concurrent transmission of packets across multiple paths. We focus on the extension of two particular algorithms, SQRT and IIAD, for multiple paths, called MPSQRT and MPIIAD, respectively. Additionally, we apply the design technique (using the multipath fluid model) for multipath TCP (MPTCP) into the extension of SQRT and IIAD, called fbMPSQRT and fbMPIIAD, respectively. Both two approaches ensure that multipath binomial congestion control algorithms achieve load-balancing, throughput improvement, and fairness to single-path binomial algorithms at shared bottlenecks. Through the simulations and comparison with the uncoordinated protocols MPSQRT/MPIIAD, fbMPSQRT/fbMPIIAD and MPTCP, we find that our extended multipath transport protocols can preserve lower latency and transmission rate variance than MPTCP, fairly share with single-path SQRT/IIAD, MPTCP and TCP, and also can achieve throughput improvements and load-balancing equivalent to those of MPTCP under various scenarios and network conditions.
SDR Input Power Estimation Algorithms
Nappier, Jennifer M.; Briones, Janette C.
2013-01-01
The General Dynamics (GD) S-Band software defined radio (SDR) in the Space Communications and Navigation (SCAN) Testbed on the International Space Station (ISS) provides experimenters an opportunity to develop and demonstrate experimental waveforms in space. The SDR has an analog and a digital automatic gain control (AGC) and the response of the AGCs to changes in SDR input power and temperature was characterized prior to the launch and installation of the SCAN Testbed on the ISS. The AGCs were used to estimate the SDR input power and SNR of the received signal and the characterization results showed a nonlinear response to SDR input power and temperature. In order to estimate the SDR input from the AGCs, three algorithms were developed and implemented on the ground software of the SCAN Testbed. The algorithms include a linear straight line estimator, which used the digital AGC and the temperature to estimate the SDR input power over a narrower section of the SDR input power range. There is a linear adaptive filter algorithm that uses both AGCs and the temperature to estimate the SDR input power over a wide input power range. Finally, an algorithm that uses neural networks was designed to estimate the input power over a wide range. This paper describes the algorithms in detail and their associated performance in estimating the SDR input power.
Ensemble algorithms in reinforcement learning.
Wiering, Marco A; van Hasselt, Hado
2008-08-01
This paper describes several ensemble methods that combine multiple different reinforcement learning (RL) algorithms in a single agent. The aim is to enhance learning speed and final performance by combining the chosen actions or action probabilities of different RL algorithms. We designed and implemented four different ensemble methods combining the following five different RL algorithms: Q-learning, Sarsa, actor-critic (AC), QV-learning, and AC learning automaton. The intuitively designed ensemble methods, namely, majority voting (MV), rank voting, Boltzmann multiplication (BM), and Boltzmann addition, combine the policies derived from the value functions of the different RL algorithms, in contrast to previous work where ensemble methods have been used in RL for representing and learning a single value function. We show experiments on five maze problems of varying complexity; the first problem is simple, but the other four maze tasks are of a dynamic or partially observable nature. The results indicate that the BM and MV ensembles significantly outperform the single RL algorithms.
SDR input power estimation algorithms
Briones, J. C.; Nappier, J. M.
The General Dynamics (GD) S-Band software defined radio (SDR) in the Space Communications and Navigation (SCAN) Testbed on the International Space Station (ISS) provides experimenters an opportunity to develop and demonstrate experimental waveforms in space. The SDR has an analog and a digital automatic gain control (AGC) and the response of the AGCs to changes in SDR input power and temperature was characterized prior to the launch and installation of the SCAN Testbed on the ISS. The AGCs were used to estimate the SDR input power and SNR of the received signal and the characterization results showed a nonlinear response to SDR input power and temperature. In order to estimate the SDR input from the AGCs, three algorithms were developed and implemented on the ground software of the SCAN Testbed. The algorithms include a linear straight line estimator, which used the digital AGC and the temperature to estimate the SDR input power over a narrower section of the SDR input power range. There is a linear adaptive filter algorithm that uses both AGCs and the temperature to estimate the SDR input power over a wide input power range. Finally, an algorithm that uses neural networks was designed to estimate the input power over a wide range. This paper describes the algorithms in detail and their associated performance in estimating the SDR input power.
Algorithms, complexity, and the sciences.
Papadimitriou, Christos
2014-11-11
Algorithms, perhaps together with Moore's law, compose the engine of the information technology revolution, whereas complexity--the antithesis of algorithms--is one of the deepest realms of mathematical investigation. After introducing the basic concepts of algorithms and complexity, and the fundamental complexity classes P (polynomial time) and NP (nondeterministic polynomial time, or search problems), we discuss briefly the P vs. NP problem. We then focus on certain classes between P and NP which capture important phenomena in the social and life sciences, namely the Nash equlibrium and other equilibria in economics and game theory, and certain processes in population genetics and evolution. Finally, an algorithm known as multiplicative weights update (MWU) provides an algorithmic interpretation of the evolution of allele frequencies in a population under sex and weak selection. All three of these equivalences are rife with domain-specific implications: The concept of Nash equilibrium may be less universal--and therefore less compelling--than has been presumed; selection on gene interactions may entail the maintenance of genetic variation for longer periods than selection on single alleles predicts; whereas MWU can be shown to maximize, for each gene, a convex combination of the gene's cumulative fitness in the population and the entropy of the allele distribution, an insight that may be pertinent to the maintenance of variation in evolution.
Gossip algorithms in quantum networks
Energy Technology Data Exchange (ETDEWEB)
Siomau, Michael, E-mail: siomau@nld.ds.mpg.de [Physics Department, Jazan University, P.O. Box 114, 45142 Jazan (Saudi Arabia); Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany)
2017-01-23
Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up – in the best case exponentially – the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication. - Highlights: • We analyze the performance of gossip algorithms in quantum networks. • Local operations and classical communication (LOCC) can speed the performance up. • The speed-up is exponential in the best case; the number of LOCC is polynomial.
Optimizing connected component labeling algorithms
Energy Technology Data Exchange (ETDEWEB)
Wu, Kesheng; Otoo, Ekow; Shoshani, Arie
2005-01-16
This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most connected component labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among them to reduce the number of neighbors examined. When considering 8-connected components in a 2D image, this can reduce the number of neighbors examined from four to one in many cases. The second strategy uses an array to store the equivalence information among the labels. This replaces the pointer based rooted trees used to store the same equivalence information. It reduces the memory required and also produces consecutive final labels. Using an array instead of the pointer based rooted trees speeds up the connected component labeling algorithms by a factor of 5 {approx} 100 in our tests on random binary images.
Next Generation Suspension Dynamics Algorithms
Energy Technology Data Exchange (ETDEWEB)
Schunk, Peter Randall [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Higdon, Jonathon [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Chen, Steven [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2014-12-01
This research project has the objective to extend the range of application, improve the efficiency and conduct simulations with the Fast Lubrication Dynamics (FLD) algorithm for concentrated particle suspensions in a Newtonian fluid solvent. The research involves a combination of mathematical development, new computational algorithms, and application to processing flows of relevance in materials processing. The mathematical developments clarify the underlying theory, facilitate verification against classic monographs in the field and provide the framework for a novel parallel implementation optimized for an OpenMP shared memory environment. The project considered application to consolidation flows of major interest in high throughput materials processing and identified hitherto unforeseen challenges in the use of FLD in these applications. Extensions to the algorithm have been developed to improve its accuracy in these applications.
Fault Tolerant External Memory Algorithms
DEFF Research Database (Denmark)
Jørgensen, Allan Grønlund; Brodal, Gerth Stølting; Mølhave, Thomas
2009-01-01
bound on the number of I/Os required for any deterministic dictionary that is resilient to memory faults. We design a static and a dynamic deterministic dictionary with optimal query performance as well as an optimal sorting algorithm and an optimal priority queue. Finally, we consider scenarios where......Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with massive data is how to deal with memory faults, e.g. captured by the adversary based faulty memory RAM by Finocchi and Italiano....... However, current fault tolerant algorithms do not scale beyond the internal memory. In this paper we investigate for the first time the connection between I/O-efficiency in the I/O model and fault tolerance in the faulty memory RAM, and we assume that both memory and disk are unreliable. We show a lower...
Some nonlinear space decomposition algorithms
Energy Technology Data Exchange (ETDEWEB)
Tai, Xue-Cheng; Espedal, M. [Univ. of Bergen (Norway)
1996-12-31
Convergence of a space decomposition method is proved for a general convex programming problem. The space decomposition refers to methods that decompose a space into sums of subspaces, which could be a domain decomposition or a multigrid method for partial differential equations. Two algorithms are proposed. Both can be used for linear as well as nonlinear elliptic problems and they reduce to the standard additive and multiplicative Schwarz methods for linear elliptic problems. Two {open_quotes}hybrid{close_quotes} algorithms are also presented. They converge faster than the additive one and have better parallelism than the multiplicative method. Numerical tests with a two level domain decomposition for linear, nonlinear and interface elliptic problems are presented for the proposed algorithms.
Quantum walks and search algorithms
Portugal, Renato
2013-01-01
This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next. This book is self-contained with main topics that include: Grover's algorithm, describing its geometrical interpretation and evolution by means of the spectral decomposition of the evolution operater Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes using Fourier transforms Quantum walks on generic graphs, describing methods to calculate the limiting d...
A Spectral Canonical Electrostatic Algorithm
Webb, Stephen D
2015-01-01
Studying single-particle dynamics over many periods of oscillations is a well-understood problem solved using symplectic integration. Such integration schemes derive their update sequence from an approximate Hamiltonian, guaranteeing that the geometric structure of the underlying problem is preserved. Simulating a self-consistent system over many oscillations can introduce numerical artifacts such as grid heating. This unphysical heating stems from using non-symplectic methods on Hamiltonian systems. With this guidance, we derive an electrostatic algorithm using a discrete form of Hamilton's Principle. The resulting algorithm, a gridless spectral electrostatic macroparticle model, does not exhibit the unphysical heating typical of most particle-in-cell methods. We present results of this using a two-body problem as an example of the algorithm's energy- and momentum-conserving properties.
Scalable algorithms for contact problems
Dostál, Zdeněk; Sadowská, Marie; Vondrák, Vít
2016-01-01
This book presents a comprehensive and self-contained treatment of the authors’ newly developed scalable algorithms for the solutions of multibody contact problems of linear elasticity. The brand new feature of these algorithms is theoretically supported numerical scalability and parallel scalability demonstrated on problems discretized by billions of degrees of freedom. The theory supports solving multibody frictionless contact problems, contact problems with possibly orthotropic Tresca’s friction, and transient contact problems. It covers BEM discretization, jumping coefficients, floating bodies, mortar non-penetration conditions, etc. The exposition is divided into four parts, the first of which reviews appropriate facets of linear algebra, optimization, and analysis. The most important algorithms and optimality results are presented in the third part of the volume. The presentation is complete, including continuous formulation, discretization, decomposition, optimality results, and numerical experimen...
Algorithms for Decision Tree Construction
Chikalov, Igor
2011-01-01
The study of algorithms for decision tree construction was initiated in 1960s. The first algorithms are based on the separation heuristic [13, 31] that at each step tries dividing the set of objects as evenly as possible. Later Garey and Graham [28] showed that such algorithm may construct decision trees whose average depth is arbitrarily far from the minimum. Hyafil and Rivest in [35] proved NP-hardness of DT problem that is constructing a tree with the minimum average depth for a diagnostic problem over 2-valued information system and uniform probability distribution. Cox et al. in [22] showed that for a two-class problem over information system, even finding the root node attribute for an optimal tree is an NP-hard problem. © Springer-Verlag Berlin Heidelberg 2011.
Empirical tests of the Gradual Learning Algorithm
Boersma, P.; Hayes, B.
1999-01-01
The Gradual Learning Algorithm (Boersma 1997) is a constraint ranking algorithm for learning Optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and
Empirical tests of the Gradual Learning Algorithm
Boersma, P.; Hayes, B.
2001-01-01
The Gradual Learning Algorithm (Boersma 1997) is a constraint-ranking algorithm for learning optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and
Using Alternative Multiplication Algorithms to "Offload" Cognition
Jazby, Dan; Pearn, Cath
2015-01-01
When viewed through a lens of embedded cognition, algorithms may enable aspects of the cognitive work of multi-digit multiplication to be "offloaded" to the environmental structure created by an algorithm. This study analyses four multiplication algorithms by viewing different algorithms as enabling cognitive work to be distributed…
Deterministic algorithms for multi-criteria TSP
Manthey, Bodo; Ogihara, Mitsunori; Tarui, Jun
2011-01-01
We present deterministic approximation algorithms for the multi-criteria traveling salesman problem (TSP). Our algorithms are faster and simpler than the existing randomized algorithms. First, we devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of
Seamless Merging of Hypertext and Algorithm Animation
Karavirta, Ville
2009-01-01
Online learning material that students use by themselves is one of the typical usages of algorithm animation (AA). Thus, the integration of algorithm animations into hypertext is seen as an important topic today to promote the usage of algorithm animation in teaching. This article presents an algorithm animation viewer implemented purely using…
Numerical Algorithms for Parallel Computers
1989-08-31
NUMERICAL ALGORITHMS FOR PARALLEL COMPUTERS 12. PERSONAL AUTHOR(S) Loce M. Adams 13a. TYPE OF REPORT 13b. TIME COVERED 14. DATE OF REPORT (Yea, Month. Day...editions are obsolete. SEC n&"S2IVAQelftS PAGE 90 01 11 131 . . AP06w.TR. 8 9 -l1N5 Numerical Algorithms for Parallel Computers Loyce M. Adams Department of...Conference on Applied Linear Algebra, Loyce Adams presented minisym- posium talk Preconditioners on Parallel Computers , Madison, WI., May 1988. Third
Gossip algorithms in quantum networks
Siomau, Michael
2017-01-01
Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up - in the best case exponentially - the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication.
An Efficient Reachability Analysis Algorithm
Vatan, Farrokh; Fijany, Amir
2008-01-01
A document discusses a new algorithm for generating higher-order dependencies for diagnostic and sensor placement analysis when a system is described with a causal modeling framework. This innovation will be used in diagnostic and sensor optimization and analysis tools. Fault detection, diagnosis, and prognosis are essential tasks in the operation of autonomous spacecraft, instruments, and in-situ platforms. This algorithm will serve as a power tool for technologies that satisfy a key requirement of autonomous spacecraft, including science instruments and in-situ missions.
Squint mode SAR processing algorithms
Chang, C. Y.; Jin, M.; Curlander, J. C.
1989-01-01
The unique characteristics of a spaceborne SAR (synthetic aperture radar) operating in a squint mode include large range walk and large variation in the Doppler centroid as a function of range. A pointing control technique to reduce the Doppler drift and a new processing algorithm to accommodate large range walk are presented. Simulations of the new algorithm for squint angles up to 20 deg and look angles up to 44 deg for the Earth Observing System (Eos) L-band SAR configuration demonstrate that it is capable of maintaining the resolution broadening within 20 percent and the ISLR within a fraction of a decibel of the theoretical value.
Hill climbing algorithms and trivium
DEFF Research Database (Denmark)
Borghoff, Julia; Knudsen, Lars Ramkilde; Matusiewicz, Krystian
2011-01-01
This paper proposes a new method to solve certain classes of systems of multivariate equations over the binary field and its cryptanalytical applications. We show how heuristic optimization methods such as hill climbing algorithms can be relevant to solving systems of multivariate equations....... A characteristic of equation systems that may be efficiently solvable by the means of such algorithms is provided. As an example, we investigate equation systems induced by the problem of recovering the internal state of the stream cipher Trivium. We propose an improved variant of the simulated annealing method...... that seems to be well-suited for this type of system and provide some experimental results....
Combinatorial optimization theory and algorithms
Korte, Bernhard
2002-01-01
Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. This book describes the most important ideas, theoretical results, and algorithms of this field. It is conceived as an advanced graduate text, and it can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Some applications and heuristics are mentioned, too.
CATEGORIES OF COMPUTER SYSTEMS ALGORITHMS
Directory of Open Access Journals (Sweden)
A. V. Poltavskiy
2015-01-01
Full Text Available Philosophy as a frame of reference on world around and as the first science is a fundamental basis, "roots" (R. Descartes for all branches of the scientific knowledge accumulated and applied in all fields of activity of a human being person. The theory of algorithms as one of the fundamental sections of mathematics, is also based on researches of the gnoseology conducting cognition of a true picture of the world of the buman being. From gnoseology and ontology positions as fundamental sections of philosophy modern innovative projects are inconceivable without development of programs,and algorithms.
A generalized memory test algorithm
Milner, E. J.
1982-01-01
A general algorithm for testing digital computer memory is presented. The test checks that (1) every bit can be cleared and set in each memory work, and (2) bits are not erroneously cleared and/or set elsewhere in memory at the same time. The algorithm can be applied to any size memory block and any size memory word. It is concise and efficient, requiring the very few cycles through memory. For example, a test of 16-bit-word-size memory requries only 384 cycles through memory. Approximately 15 seconds were required to test a 32K block of such memory, using a microcomputer having a cycle time of 133 nanoseconds.
Deceptiveness and genetic algorithm dynamics
Energy Technology Data Exchange (ETDEWEB)
Liepins, G.E. (Oak Ridge National Lab., TN (USA)); Vose, M.D. (Tennessee Univ., Knoxville, TN (USA))
1990-01-01
We address deceptiveness, one of at least four reasons genetic algorithms can fail to converge to function optima. We construct fully deceptive functions and other functions of intermediate deceptiveness. For the fully deceptive functions of our construction, we generate linear transformations that induce changes of representation to render the functions fully easy. We further model genetic algorithm selection recombination as the interleaving of linear and quadratic operators. Spectral analysis of the underlying matrices allows us to draw preliminary conclusions about fixed points and their stability. We also obtain an explicit formula relating the nonuniform Walsh transform to the dynamics of genetic search. 21 refs.
Parallel algorithms and cluster computing
Hoffmann, Karl Heinz
2007-01-01
This book presents major advances in high performance computing as well as major advances due to high performance computing. It contains a collection of papers in which results achieved in the collaboration of scientists from computer science, mathematics, physics, and mechanical engineering are presented. From the science problems to the mathematical algorithms and on to the effective implementation of these algorithms on massively parallel and cluster computers we present state-of-the-art methods and technology as well as exemplary results in these fields. This book shows that problems which seem superficially distinct become intimately connected on a computational level.
Big Data Mining: Tools & Algorithms
Directory of Open Access Journals (Sweden)
Adeel Shiraz Hashmi
2016-03-01
Full Text Available We are now in Big Data era, and there is a growing demand for tools which can process and analyze it. Big data analytics deals with extracting valuable information from that complex data which can’t be handled by traditional data mining tools. This paper surveys the available tools which can handle large volumes of data as well as evolving data streams. The data mining tools and algorithms which can handle big data have also been summarized, and one of the tools has been used for mining of large datasets using distributed algorithms.
Genetic Algorithm based Gait Recognition
R.Ashok Kumar Reddy; G. Venkata Narasimhulu; Dr. S. A. K. Jilani; Dr D.Seshappa
2013-01-01
In this paper, a face/gait recognition system for personal identification and verification using genetic algorithm. This face/gait Recognition System (FRS/GRS) is also being trained for gender identification. The Face/Gait recognition system consists of three steps. At the very outset some pre-processing are applied on the input image. Secondly face/gait features are extracted, which will be taken as the input of the BPNN and genetic algorithm (GA) in the third step and classification is carr...
Optimisation combinatoire Theorie et algorithmes
Korte, Bernhard; Fonlupt, Jean
2010-01-01
Ce livre est la traduction fran aise de la quatri me et derni re dition de Combinatorial Optimization: Theory and Algorithms crit par deux minents sp cialistes du domaine: Bernhard Korte et Jens Vygen de l'universit de Bonn en Allemagne. Il met l accent sur les aspects th oriques de l'optimisation combinatoire ainsi que sur les algorithmes efficaces et exacts de r solution de probl mes. Il se distingue en cela des approches heuristiques plus simples et souvent d crites par ailleurs. L ouvrage contient de nombreuses d monstrations, concises et l gantes, de r sultats difficiles. Destin aux tudia
Industrial Applications of Evolutionary Algorithms
Sanchez, Ernesto; Tonda, Alberto
2012-01-01
This book is intended as a reference both for experienced users of evolutionary algorithms and for researchers that are beginning to approach these fascinating optimization techniques. Experienced users will find interesting details of real-world problems, and advice on solving issues related to fitness computation, modeling and setting appropriate parameters to reach optimal solutions. Beginners will find a thorough introduction to evolutionary computation, and a complete presentation of all evolutionary algorithms exploited to solve different problems. The book could fill the gap between the
Wavelets theory, algorithms, and applications
Montefusco, Laura
2014-01-01
Wavelets: Theory, Algorithms, and Applications is the fifth volume in the highly respected series, WAVELET ANALYSIS AND ITS APPLICATIONS. This volume shows why wavelet analysis has become a tool of choice infields ranging from image compression, to signal detection and analysis in electrical engineering and geophysics, to analysis of turbulent or intermittent processes. The 28 papers comprising this volume are organized into seven subject areas: multiresolution analysis, wavelet transforms, tools for time-frequency analysis, wavelets and fractals, numerical methods and algorithms, and applicat
Decryption of pure-position permutation algorithms.
Zhao, Xiao-Yu; Chen, Gang; Zhang, Dan; Wang, Xiao-Hong; Dong, Guang-Chang
2004-07-01
Pure position permutation image encryption algorithms, commonly used as image encryption investigated in this work are unfortunately frail under known-text attack. In view of the weakness of pure position permutation algorithm, we put forward an effective decryption algorithm for all pure-position permutation algorithms. First, a summary of the pure position permutation image encryption algorithms is given by introducing the concept of ergodic matrices. Then, by using probability theory and algebraic principles, the decryption probability of pure-position permutation algorithms is verified theoretically; and then, by defining the operation system of fuzzy ergodic matrices, we improve a specific decryption algorithm. Finally, some simulation results are shown.
Parallel algorithms for unconstrained optimizations by multisplitting
Energy Technology Data Exchange (ETDEWEB)
He, Qing [Arizona State Univ., Tempe, AZ (United States)
1994-12-31
In this paper a new parallel iterative algorithm for unconstrained optimization using the idea of multisplitting is proposed. This algorithm uses the existing sequential algorithms without any parallelization. Some convergence and numerical results for this algorithm are presented. The experiments are performed on an Intel iPSC/860 Hyper Cube with 64 nodes. It is interesting that the sequential implementation on one node shows that if the problem is split properly, the algorithm converges much faster than one without splitting.
Educational Technologists, Chameleons, and Systemic Thinking.
Reigeluth, Charles M.; Avers, Dale
1997-01-01
Discusses systemic thinking and how it can help educational technologists better cope with change. Highlights include major societal paradigm shifts, differences between the industrial age and the information age that affect education, features of an information-age educational system, and changing uses of media and technology. (LRW)
If Only Cultural Chameleons Could Fly Too
DEFF Research Database (Denmark)
Blasco, Maribel; Feldt, Liv Egholm; Jakobsen, Michael
2012-01-01
. The analysis focuses in particular on the dimension of cultural metacognition which has recently been claimed to be the CQ concept’s main contribution compared to earlier concepts such as cross-cultural or intercultural competence, a claim which is found to be overstated. The article uses the example of CQ...
The Chameleon Architecture for Streaming DSP Applications
Directory of Open Access Journals (Sweden)
André B. J. Kokkeler
2007-02-01
Full Text Available We focus on architectures for streaming DSP applications such as wireless baseband processing and image processing. We aim at a single generic architecture that is capable of dealing with different DSP applications. This architecture has to be energy efficient and fault tolerant. We introduce a heterogeneous tiled architecture and present the details of a domain-specific reconfigurable tile processor called Montium. This reconfigurable processor has a small footprint (1.8 mm2 in a 130 nm process, is power efficient and exploits the locality of reference principle. Reconfiguring the device is very fast, for example, loading the coefficients for a 200 tap FIR filter is done within 80 clock cycles. The tiles on the tiled architecture are connected to a Network-on-Chip (NoC via a network interface (NI. Two NoCs have been developed: a packet-switched and a circuit-switched version. Both provide two types of services: guaranteed throughput (GT and best effort (BE. For both NoCs estimates of power consumption are presented. The NI synchronizes data transfers, configures and starts/stops the tile processor. For dynamically mapping applications onto the tiled architecture, we introduce a run-time mapping tool.
The Chameleon Architecture for Streaming DSP Applications
Directory of Open Access Journals (Sweden)
Heysters PaulM
2007-01-01
Full Text Available We focus on architectures for streaming DSP applications such as wireless baseband processing and image processing. We aim at a single generic architecture that is capable of dealing with different DSP applications. This architecture has to be energy efficient and fault tolerant. We introduce a heterogeneous tiled architecture and present the details of a domain-specific reconfigurable tile processor called Montium. This reconfigurable processor has a small footprint (1.8 mm2 in a 130 nm process, is power efficient and exploits the locality of reference principle. Reconfiguring the device is very fast, for example, loading the coefficients for a 200 tap FIR filter is done within 80 clock cycles. The tiles on the tiled architecture are connected to a Network-on-Chip (NoC via a network interface (NI. Two NoCs have been developed: a packet-switched and a circuit-switched version. Both provide two types of services: guaranteed throughput (GT and best effort (BE. For both NoCs estimates of power consumption are presented. The NI synchronizes data transfers, configures and starts/stops the tile processor. For dynamically mapping applications onto the tiled architecture, we introduce a run-time mapping tool.
Chameleon or Phoenix: The Metamorphosis of TAFE.
Anderson, Damon
1998-01-01
Examines aspects of the history of technical and vocational education (TAFE) in Australia: technical education system in Victoria; dissolution of the binary system in higher education; and new instructional discourses and practices shaping TAFE. Speculates on the potential reemergence of the binary system and future prospects for TAFE. (SK)
Inflammatory carcinoma of breast: The chameleon
Directory of Open Access Journals (Sweden)
Indranil Chakrabarti
2017-01-01
Full Text Available Inflammatory breast carcinoma is an extremely rare, rapidly progressive breast carcinoma which is a great masquerader and often is mistaken as an inflammatory lesion. This leads to the delay in diagnosis. Here, we report such a case where the mistaken clinical diagnosis led to it being treated with antibiotics. However, fine-needle aspiration cytology of the case saved the day. Histopathological confirmation followed by multimodal therapy was rendered, and the patient responded well to the treatment. Thus, awareness and recognition of this rare entity, which mimics various inflammatory and nonmalignant causes, is of paramount importance for the doctors and patients alike.
The School Psychologist as a Chameleon
Weininger, Otto
1971-01-01
This paper reviews very briefly some of the comprehensive views of the functions of the school psychologists, presents some suggestions which have been made in recent years for the training of school psychological personnel, and discusses the complex interrelationships between the psychologist and all those people and variables which make up his…
Hyperchaotic Chameleon: Fractional Order FPGA Implementation
Directory of Open Access Journals (Sweden)
Karthikeyan Rajagopal
2017-01-01
Full Text Available There are many recent investigations on chaotic hidden attractors although hyperchaotic hidden attractor systems and their relationships have been less investigated. In this paper, we introduce a hyperchaotic system which can change between hidden attractor and self-excited attractor depending on the values of parameters. Dynamic properties of these systems are investigated. Fractional order models of these systems are derived and their bifurcation with fractional orders is discussed. Field programmable gate array (FPGA implementations of the systems with their power and resource utilization are presented.
Extending applicability of bimetric theory: chameleon bigravity
De Felice, Antonio; Mukohyama, Shinji; Uzan, Jean-Philippe
2018-02-01
This article extends bimetric formulations of massive gravity to make the mass of the graviton to depend on its environment. This minimal extension offers a novel way to reconcile massive gravity with local tests of general relativity without invoking the Vainshtein mechanism. On cosmological scales, it is argued that the model is stable and that it circumvents the Higuchi bound, hence relaxing the constraints on the parameter space. Moreover, with this extension the strong coupling scale is also environmentally dependent in such a way that it is kept sufficiently higher than the expansion rate all the way up to the very early universe, while the present graviton mass is low enough to be phenomenologically interesting. In this sense the extended bigravity theory serves as a partial UV completion of the standard bigravity theory. This extension is very generic and robust and a simple specific example is described.
The Chameleon Architecture for Streaming DSP Applications
Bergmann, N.; Smit, Gerardus Johannes Maria; Kokkeler, Andre B.J.; Platzner, M.; Wolkotte, P.T.; Teich, J.; Holzenspies, P.K.F.; van de Burgwal, M.D.; Heysters, P.M.
2007-01-01
We focus on architectures for streaming DSP applications such as wireless baseband processing and image processing. We aim at a single generic architecture that is capable of dealing with different DSP applications. This architecture has to be energy efficient and fault tolerant. We introduce a
Classification algorithms using adaptive partitioning
Binev, Peter
2014-12-01
© 2014 Institute of Mathematical Statistics. Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set approximation to the Bayes set and thus fall into the general category of set estimators. In contrast with the most studied tree-based algorithms, which utilize piecewise constant approximation on the generated partition [IEEE Trans. Inform. Theory 52 (2006) 1335.1353; Mach. Learn. 66 (2007) 209.242], we consider decorated trees, which allow us to derive higher order methods. Convergence rates for these methods are derived in terms the parameter - of margin conditions and a rate s of best approximation of the Bayes set by decorated adaptive partitions. They can also be expressed in terms of the Besov smoothness β of the regression function that governs its approximability by piecewise polynomials on adaptive partition. The execution of the algorithms does not require knowledge of the smoothness or margin conditions. Besov smoothness conditions are weaker than the commonly used Holder conditions, which govern approximation by nonadaptive partitions, and therefore for a given regression function can result in a higher rate of convergence. This in turn mitigates the compatibility conflict between smoothness and margin parameters.
Algorithms and Public Service Media
DEFF Research Database (Denmark)
Sørensen, Jannick Kirk; Hutchinson, Jonathon
2018-01-01
When Public Service Media (PSM) organisations introduce algorithmic recommender systems to suggest media content to users, fundamental values of PSM are challenged. Beyond being confronted with ubiquitous computer ethics problems of causality and transparency, also the identity of PSM as curator...
Privacy preserving randomized gossip algorithms
Hanzely, Filip
2017-06-23
In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for all methods, and perform extensive numerical experiments.
Algorithmic Issues in Modeling Motion
DEFF Research Database (Denmark)
Agarwal, P. K; Guibas, L. J; Edelsbrunner, H.
2003-01-01
This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory...
Key Concepts in Informatics: Algorithm
Szlávi, Péter; Zsakó, László
2014-01-01
"The system of key concepts contains the most important key concepts related to the development tasks of knowledge areas and their vertical hierarchy as well as the links of basic key concepts of different knowledge areas." (Vass 2011) One of the most important of these concepts is the algorithm. In everyday life, when learning or…
Understanding Algorithms in Different Presentations
Csernoch, Mária; Biró, Piroska; Abari, Kálmán; Máth, János
2015-01-01
Within the framework of the Testing Algorithmic and Application Skills project we tested first year students of Informatics at the beginning of their tertiary education. We were focusing on the students' level of understanding in different programming environments. In the present paper we provide the results from the University of Debrecen, the…
Threshold extended ID3 algorithm
Kumar, A. B. Rajesh; Ramesh, C. Phani; Madhusudhan, E.; Padmavathamma, M.
2012-04-01
Information exchange over insecure networks needs to provide authentication and confidentiality to the database in significant problem in datamining. In this paper we propose a novel authenticated multiparty ID3 Algorithm used to construct multiparty secret sharing decision tree for implementation in medical transactions.
ALGORITHM OF OUTSOURCING RELATIONS MANAGEMENT
Arthur Kurbanov
2012-01-01
In recent years, domestic and foreign outsourcing practice was widespread. In the transition to outsourcing there are difficulties associated with the practical organization of the interaction between the customer and the performer. An algorithm of management of the relationship with the performer (outsourcer). Particular attention is given to the criteria for evaluation of potential contractors.
SMAP's Radar OBP Algorithm Development
Le, Charles; Spencer, Michael W.; Veilleux, Louise; Chan, Samuel; He, Yutao; Zheng, Jason; Nguyen, Kayla
2009-01-01
An approach for algorithm specifications and development is described for SMAP's radar onboard processor with multi-stage demodulation and decimation bandpass digital filter. Point target simulation is used to verify and validate the filter design with the usual radar performance parameters. Preliminary FPGA implementation is also discussed.
Global alignment algorithms implementations | Fatumo ...
African Journals Online (AJOL)
It is the first and most important step of homology modeling, which is based on structural similarity. However, structural similarity of ... Our algorithms were implemented in python programming language and were tested on Linux platform 1.60GHz, 512 MB of RAM SUSE 9.2 and 10.1 versions. International Journal of Natural ...
IMPROVEMENTS TO THE BACKPROPAGATION ALGORITHM
Directory of Open Access Journals (Sweden)
MIRCEA PETRINI
2012-12-01
Full Text Available This paper presents some simple techniques to improve the backpropagation algorithm. Since learning in neural networks is an NP-complete problem and since traditional gradient descent methods are rather slow, many alternatives have been tried in order to accelerate convergence. Some of the proposed methods are mutually compatible and a combination of them normally works better than each method alone.
Algorithm Visualization in Teaching Practice
Törley, Gábor
2014-01-01
This paper presents the history of algorithm visualization (AV), highlighting teaching-methodology aspects. A combined, two-group pedagogical experiment will be presented as well, which measured the efficiency and the impact on the abstract thinking of AV. According to the results, students, who learned with AV, performed better in the experiment.
Multilevel algorithms for nonlinear optimization
Alexandrov, Natalia; Dennis, J. E., Jr.
1994-01-01
Multidisciplinary design optimization (MDO) gives rise to nonlinear optimization problems characterized by a large number of constraints that naturally occur in blocks. We propose a class of multilevel optimization methods motivated by the structure and number of constraints and by the expense of the derivative computations for MDO. The algorithms are an extension to the nonlinear programming problem of the successful class of local Brown-Brent algorithms for nonlinear equations. Our extensions allow the user to partition constraints into arbitrary blocks to fit the application, and they separately process each block and the objective function, restricted to certain subspaces. The methods use trust regions as a globalization strategy, and they have been shown to be globally convergent under reasonable assumptions. The multilevel algorithms can be applied to all classes of MDO formulations. Multilevel algorithms for solving nonlinear systems of equations are a special case of the multilevel optimization methods. In this case, they can be viewed as a trust-region globalization of the Brown-Brent class.
Associative Algorithms for Computational Creativity
Varshney, Lav R.; Wang, Jun; Varshney, Kush R.
2016-01-01
Computational creativity, the generation of new, unimagined ideas or artifacts by a machine that are deemed creative by people, can be applied in the culinary domain to create novel and flavorful dishes. In fact, we have done so successfully using a combinatorial algorithm for recipe generation combined with statistical models for recipe ranking…
Distribution Bottlenecks in Classification Algorithms
Zwartjes, G.J.; Havinga, Paul J.M.; Smit, Gerardus Johannes Maria; Hurink, Johann L.
2012-01-01
The abundance of data available on Wireless Sensor Networks makes online processing necessary. In industrial applications for example, the correct operation of equipment can be the point of interest while raw sampled data is of minor importance. Classication algorithms can be used to make state
Genetic algorithm optimization of entanglement
Navarro-Munoz, Jorge C.; Rosu, H. C.; Lopez-Sandoval, R.
2006-01-01
We present an application of a genetic algorithmic computational method to the optimization of the concurrence measure of entanglement for the cases of one dimensional chains, as well as square and triangular lattices in a simple tight-binding approach in which the hopping of electrons is much stronger than the phonon dissipation
Simultaneous stabilization using genetic algorithms
Energy Technology Data Exchange (ETDEWEB)
Benson, R.W.; Schmitendorf, W.E. (California Univ., Irvine, CA (USA). Dept. of Mechanical Engineering)
1991-01-01
This paper considers the problem of simultaneously stabilizing a set of plants using full state feedback. The problem is converted to a simple optimization problem which is solved by a genetic algorithm. Several examples demonstrate the utility of this method. 14 refs., 8 figs.
Adaptive protection algorithm and system
Hedrick, Paul [Pittsburgh, PA; Toms, Helen L [Irwin, PA; Miller, Roger M [Mars, PA
2009-04-28
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
The TROPOMI surface UV algorithm
Directory of Open Access Journals (Sweden)
A. V. Lindfors
2018-02-01
Full Text Available The TROPOspheric Monitoring Instrument (TROPOMI is the only payload of the Sentinel-5 Precursor (S5P, which is a polar-orbiting satellite mission of the European Space Agency (ESA. TROPOMI is a nadir-viewing spectrometer measuring in the ultraviolet, visible, near-infrared, and the shortwave infrared that provides near-global daily coverage. Among other things, TROPOMI measurements will be used for calculating the UV radiation reaching the Earth's surface. Thus, the TROPOMI surface UV product will contribute to the monitoring of UV radiation by providing daily information on the prevailing UV conditions over the globe. The TROPOMI UV algorithm builds on the heritage of the Ozone Monitoring Instrument (OMI and the Satellite Application Facility for Atmospheric Composition and UV Radiation (AC SAF algorithms. This paper provides a description of the algorithm that will be used for estimating surface UV radiation from TROPOMI observations. The TROPOMI surface UV product includes the following UV quantities: the UV irradiance at 305, 310, 324, and 380 nm; the erythemally weighted UV; and the vitamin-D weighted UV. Each of these are available as (i daily dose or daily accumulated irradiance, (ii overpass dose rate or irradiance, and (iii local noon dose rate or irradiance. In addition, all quantities are available corresponding to actual cloud conditions and as clear-sky values, which otherwise correspond to the same conditions but assume a cloud-free atmosphere. This yields 36 UV parameters altogether. The TROPOMI UV algorithm has been tested using input based on OMI and the Global Ozone Monitoring Experiment-2 (GOME-2 satellite measurements. These preliminary results indicate that the algorithm is functioning according to expectations.
Opposition-Based Adaptive Fireworks Algorithm
Directory of Open Access Journals (Sweden)
Chibing Gong
2016-07-01
Full Text Available A fireworks algorithm (FWA is a recent swarm intelligence algorithm that is inspired by observing fireworks explosions. An adaptive fireworks algorithm (AFWA proposes additional adaptive amplitudes to improve the performance of the enhanced fireworks algorithm (EFWA. The purpose of this paper is to add opposition-based learning (OBL to AFWA with the goal of further boosting performance and achieving global optimization. Twelve benchmark functions are tested in use of an opposition-based adaptive fireworks algorithm (OAFWA. The final results conclude that OAFWA significantly outperformed EFWA and AFWA in terms of solution accuracy. Additionally, OAFWA was compared with a bat algorithm (BA, differential evolution (DE, self-adapting control parameters in differential evolution (jDE, a firefly algorithm (FA, and a standard particle swarm optimization 2011 (SPSO2011 algorithm. The research results indicate that OAFWA ranks the highest of the six algorithms for both solution accuracy and runtime cost.
A Hybrid Chaotic Quantum Evolutionary Algorithm
DEFF Research Database (Denmark)
Cai, Y.; Zhang, M.; Cai, H.
2010-01-01
A hybrid chaotic quantum evolutionary algorithm is proposed to reduce amount of computation, speed up convergence and restrain premature phenomena of quantum evolutionary algorithm. The proposed algorithm adopts the chaotic initialization method to generate initial population which will form...... and enhance the global search ability. A large number of tests show that the proposed algorithm has higher convergence speed and better optimizing ability than quantum evolutionary algorithm, real-coded quantum evolutionary algorithm and hybrid quantum genetic algorithm. Tests also show that when chaos...... is introduced to quantum evolutionary algorithm, the hybrid chaotic search strategy is superior to the carrier chaotic strategy, and has better comprehensive performance than the chaotic mutation strategy in most of cases. Especially, the proposed algorithm is the only one that has 100% convergence rate in all...
A Cavity QED Implementation of Deutsch-Jozsa Algorithm
Guerra, E. S.
2004-01-01
The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.
Indian Academy of Sciences (India)
The general basis of the universality of computers lies in the notion of Universal Turing Machines proposed by A M. Turing and will be discussed in forthcoming articles. In general, a program is composed of objects familiar and convenient to the user. This process enables the design and construction of complex programs.
Indian Academy of Sciences (India)
concepts. SERIES I ARTICLE specifications (intentions). In the sequel, we shall illustrate in an informal way the above process. Our aim is to present the concepts assuming just the basic knowledge of the execution of a program and basic mathematical concepts. For understanding the basis of the method, let us take a look ...
Indian Academy of Sciences (India)
exhausted. If one of the arrays gets exhausted before the other, then the merging essentially corresponds to extending the merged array with the elements of the array that is not yet exhausted. The program for merging two arrays is shown in Table 2 . For the sake of clarity, the actual program code shown is simplified.
Hybrid employment recommendation algorithm based on Spark
Li, Zuoquan; Lin, Yubei; Zhang, Xingming
2017-08-01
Aiming at the real-time application of collaborative filtering employment recommendation algorithm (CF), a clustering collaborative filtering recommendation algorithm (CCF) is developed, which applies hierarchical clustering to CF and narrows the query range of neighbour items. In addition, to solve the cold-start problem of content-based recommendation algorithm (CB), a content-based algorithm with users’ information (CBUI) is introduced for job recommendation. Furthermore, a hybrid recommendation algorithm (HRA) which combines CCF and CBUI algorithms is proposed, and implemented on Spark platform. The experimental results show that HRA can overcome the problems of cold start and data sparsity, and achieve good recommendation accuracy and scalability for employment recommendation.
Affine Projection Algorithm Using Regressive Estimated Error
Zhang, Shu; Zhi, Yongfeng
2011-01-01
An affine projection algorithm using regressive estimated error (APA-REE) is presented in this paper. By redefining the iterated error of the affine projection algorithm (APA), a new algorithm is obtained, and it improves the adaptive filtering convergence rate. We analyze the iterated error signal and the stability for the APA-REE algorithm. The steady-state weights of the APA-REE algorithm are proved to be unbiased and consist. The simulation results show that the proposed algorithm has a f...
Interactive video algorithms and technologies
Hammoud, Riad
2006-01-01
This book covers both algorithms and technologies of interactive videos, so that businesses in IT and data managements, scientists and software engineers in video processing and computer vision, coaches and instructors that use video technology in teaching, and finally end-users will greatly benefit from it. This book contains excellent scientific contributions made by a number of pioneering scientists and experts from around the globe. It consists of five parts. The first part introduces the reader to interactive video and video summarization and presents effective methodologies for automatic abstraction of a single video sequence, a set of video sequences, and a combined audio-video sequence. In the second part, a list of advanced algorithms and methodologies for automatic and semi-automatic analysis and editing of audio-video documents are presented. The third part tackles a more challenging level of automatic video re-structuring, filtering of video stream by extracting of highlights, events, and meaningf...
Algorithms for Lightweight Key Exchange.
Alvarez, Rafael; Caballero-Gil, Cándido; Santonja, Juan; Zamora, Antonio
2017-06-27
Public-key cryptography is too slow for general purpose encryption, with most applications limiting its use as much as possible. Some secure protocols, especially those that enable forward secrecy, make a much heavier use of public-key cryptography, increasing the demand for lightweight cryptosystems that can be implemented in low powered or mobile devices. This performance requirements are even more significant in critical infrastructure and emergency scenarios where peer-to-peer networks are deployed for increased availability and resiliency. We benchmark several public-key key-exchange algorithms, determining those that are better for the requirements of critical infrastructure and emergency applications and propose a security framework based on these algorithms and study its application to decentralized node or sensor networks.
Molecular beacon sequence design algorithm.
Monroe, W Todd; Haselton, Frederick R
2003-01-01
A method based on Web-based tools is presented to design optimally functioning molecular beacons. Molecular beacons, fluorogenic hybridization probes, are a powerful tool for the rapid and specific detection of a particular nucleic acid sequence. However, their synthesis costs can be considerable. Since molecular beacon performance is based on its sequence, it is imperative to rationally design an optimal sequence before synthesis. The algorithm presented here uses simple Microsoft Excel formulas and macros to rank candidate sequences. This analysis is carried out using mfold structural predictions along with other free Web-based tools. For smaller laboratories where molecular beacons are not the focus of research, the public domain algorithm described here may be usefully employed to aid in molecular beacon design.
MUSIC algorithms for rebar detection
Solimene, Raffaele; Leone, Giovanni; Dell'Aversano, Angela
2013-12-01
The MUSIC (MUltiple SIgnal Classification) algorithm is employed to detect and localize an unknown number of scattering objects which are small in size as compared to the wavelength. The ensemble of objects to be detected consists of both strong and weak scatterers. This represents a scattering environment challenging for detection purposes as strong scatterers tend to mask the weak ones. Consequently, the detection of more weakly scattering objects is not always guaranteed and can be completely impaired when the noise corrupting data is of a relatively high level. To overcome this drawback, here a new technique is proposed, starting from the idea of applying a two-stage MUSIC algorithm. In the first stage strong scatterers are detected. Then, information concerning their number and location is employed in the second stage focusing only on the weak scatterers. The role of an adequate scattering model is emphasized to improve drastically detection performance in realistic scenarios.
Algorithms for Drug Sensitivity Prediction
Directory of Open Access Journals (Sweden)
Carlos De Niz
2016-11-01
Full Text Available Precision medicine entails the design of therapies that are matched for each individual patient. Thus, predictive modeling of drug responses for specific patients constitutes a significant challenge for personalized therapy. In this article, we consider a review of approaches that have been proposed to tackle the drug sensitivity prediction problem especially with respect to personalized cancer therapy. We first discuss modeling approaches that are based on genomic characterizations alone and further the discussion by including modeling techniques that integrate both genomic and functional information. A comparative analysis of the prediction performance of four representative algorithms, elastic net, random forest, kernelized Bayesian multi-task learning and deep learning, reflecting the broad classes of regularized linear, ensemble, kernelized and neural network-based models, respectively, has been included in the paper. The review also considers the challenges that need to be addressed for successful implementation of the algorithms in clinical practice.
A fast meteor detection algorithm
Gural, P.
2016-01-01
A low latency meteor detection algorithm for use with fast steering mirrors had been previously developed to track and telescopically follow meteors in real-time (Gural, 2007). It has been rewritten as a generic clustering and tracking software module for meteor detection that meets both the demanding throughput requirements of a Raspberry Pi while also maintaining a high probability of detection. The software interface is generalized to work with various forms of front-end video pre-processing approaches and provides a rich product set of parameterized line detection metrics. Discussion will include the Maximum Temporal Pixel (MTP) compression technique as a fast thresholding option for feeding the detection module, the detection algorithm trade for maximum processing throughput, details on the clustering and tracking methodology, processing products, performance metrics, and a general interface description.
Algorithm in the Multisignal Method
Fukuda, Hiroshi; Negishi, Teruo
This paper deals with an algorithm in a multisignal method instead of the binary notation system that has been used in the computer information processing. The remarkable feature in this method is to be able to express a plural meaning or different meanings in just one bit. A bit in the proposed method can serve as, so to speak, an extended bit by itself. So hereafter we call it a “mut, ” a newly coined word for a multiple digit. With a mut, a multisignal is produced, which belongs to one of the following three systems of the multisignal method: the fixed multi-notation system, the selective multi-notation system, and the general multisignal system. Consequently, this algorithm may be applied to many aspects of the multimedia. Moreover, using this system, a large quantity of expressions can be made with high speed, and the programming can be done easily.
Constrained Multiobjective Biogeography Optimization Algorithm
Directory of Open Access Journals (Sweden)
Hongwei Mo
2014-01-01
Full Text Available Multiobjective optimization involves minimizing or maximizing multiple objective functions subject to a set of constraints. In this study, a novel constrained multiobjective biogeography optimization algorithm (CMBOA is proposed. It is the first biogeography optimization algorithm for constrained multiobjective optimization. In CMBOA, a disturbance migration operator is designed to generate diverse feasible individuals in order to promote the diversity of individuals on Pareto front. Infeasible individuals nearby feasible region are evolved to feasibility by recombining with their nearest nondominated feasible individuals. The convergence of CMBOA is proved by using probability theory. The performance of CMBOA is evaluated on a set of 6 benchmark problems and experimental results show that the CMBOA performs better than or similar to the classical NSGA-II and IS-MOEA.
Statistical mechanics algorithms and computations
Krauth, Werner
2006-01-01
This book discusses the computational approach in modern statistical physics in a clear and accessible way and demonstrates its close relation to other approaches in theoretical physics. Individual chapters focus on subjects as diverse as the hard sphere liquid, classical spin models, single quantum particles and Bose-Einstein condensation. Contained within the chapters are in-depth discussions of algorithms, ranging from basic enumeration methods to modern Monte Carlo techniques. The emphasis is on orientation, with discussion of implementation details kept to a minimum. Illustrations, tables and concise printed algorithms convey key information, making the material very accessible. The book is completely self-contained and graphs and tables can readily be reproduced, requiring minimal computer code. Most sections begin at an elementary level and lead on to the rich and difficult problems of contemporary computational and statistical physics. The book will be of interest to a wide range of students, teachers...
Innovations in Lattice QCD Algorithms
Energy Technology Data Exchange (ETDEWEB)
Konstantinos Orginos
2006-06-25
Lattice QCD calculations demand a substantial amount of computing power in order to achieve the high precision results needed to better understand the nature of strong interactions, assist experiment to discover new physics, and predict the behavior of a diverse set of physical systems ranging from the proton itself to astrophysical objects such as neutron stars. However, computer power alone is clearly not enough to tackle the calculations we need to be doing today. A steady stream of recent algorithmic developments has made an important impact on the kinds of calculations we can currently perform. In this talk I am reviewing these algorithms and their impact on the nature of lattice QCD calculations performed today.
Graphics and visualization principles & algorithms
Theoharis, T; Platis, Nikolaos; Patrikalakis, Nicholas M
2008-01-01
Computer and engineering collections strong in applied graphics and analysis of visual data via computer will find Graphics & Visualization: Principles and Algorithms makes an excellent classroom text as well as supplemental reading. It integrates coverage of computer graphics and other visualization topics, from shadow geneeration and particle tracing to spatial subdivision and vector data visualization, and it provides a thorough review of literature from multiple experts, making for a comprehensive review essential to any advanced computer study.-California Bookw
Machine vision theory, algorithms, practicalities
Davies, E R
2005-01-01
In the last 40 years, machine vision has evolved into a mature field embracing a wide range of applications including surveillance, automated inspection, robot assembly, vehicle guidance, traffic monitoring and control, signature verification, biometric measurement, and analysis of remotely sensed images. While researchers and industry specialists continue to document their work in this area, it has become increasingly difficult for professionals and graduate students to understand the essential theory and practicalities well enough to design their own algorithms and systems. This book directl
Tau reconstruction and identification algorithm
Indian Academy of Sciences (India)
2012-11-15
Nov 15, 2012 ... 13.35.Dx. 1. Introduction. Tau is the heaviest known lepton (Mτ = 1.78 GeV) which decays into lighter leptons. (BR ∼ 35%) or hadrons τh (BR ∼ 65%) in the presence of up to two neutrinos. The τ reconstruction algorithms are using decay mode identification techniques which allow one to reconstruct τh with ...
Linear programming algorithms and applications
Vajda, S
1981-01-01
This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of manage ment, administration, transportation and a number of other uses which are mentioned in their context. The emphasis is on numerical algorithms, which are illustrated by examples of such modest size that the solutions can be obtained using pen and paper. It is clear that these methods, if applied to larger problems, can also be carried out on automatic (electronic) computers. Commercially available computer packages are, in fact, mainly based on algorithms explained in this book. The author is convinced that the user of these algorithms ought to be knowledgeable about the underlying theory. Therefore this volume is not merely addressed to the practitioner, but also to the mathematician who is interested in relatively new developments in algebraic theory and in...
Comparison of turbulence mitigation algorithms
Kozacik, Stephen T.; Paolini, Aaron; Sherman, Ariel; Bonnett, James; Kelmelis, Eric
2017-07-01
When capturing imagery over long distances, atmospheric turbulence often degrades the data, especially when observation paths are close to the ground or in hot environments. These issues manifest as time-varying scintillation and warping effects that decrease the effective resolution of the sensor and reduce actionable intelligence. In recent years, several image processing approaches to turbulence mitigation have shown promise. Each of these algorithms has different computational requirements, usability demands, and degrees of independence from camera sensors. They also produce different degrees of enhancement when applied to turbulent imagery. Additionally, some of these algorithms are applicable to real-time operational scenarios while others may only be suitable for postprocessing workflows. EM Photonics has been developing image-processing-based turbulence mitigation technology since 2005. We will compare techniques from the literature with our commercially available, real-time, GPU-accelerated turbulence mitigation software. These comparisons will be made using real (not synthetic), experimentally obtained data for a variety of conditions, including varying optical hardware, imaging range, subjects, and turbulence conditions. Comparison metrics will include image quality, video latency, computational complexity, and potential for real-time operation. Additionally, we will present a technique for quantitatively comparing turbulence mitigation algorithms using real images of radial resolution targets.
Spaceborne SAR Imaging Algorithm for Coherence Optimized.
Directory of Open Access Journals (Sweden)
Zhiwei Qiu
Full Text Available This paper proposes SAR imaging algorithm with largest coherence based on the existing SAR imaging algorithm. The basic idea of SAR imaging algorithm in imaging processing is that output signal can have maximum signal-to-noise ratio (SNR by using the optimal imaging parameters. Traditional imaging algorithm can acquire the best focusing effect, but would bring the decoherence phenomenon in subsequent interference process. Algorithm proposed in this paper is that SAR echo adopts consistent imaging parameters in focusing processing. Although the SNR of the output signal is reduced slightly, their coherence is ensured greatly, and finally the interferogram with high quality is obtained. In this paper, two scenes of Envisat ASAR data in Zhangbei are employed to conduct experiment for this algorithm. Compared with the interferogram from the traditional algorithm, the results show that this algorithm is more suitable for SAR interferometry (InSAR research and application.
Chinese handwriting recognition an algorithmic perspective
Su, Tonghua
2013-01-01
This book provides an algorithmic perspective on the recent development of Chinese handwriting recognition. Two technically sound strategies, the segmentation-free and integrated segmentation-recognition strategy, are investigated and algorithms that have worked well in practice are primarily focused on. Baseline systems are initially presented for these strategies and are subsequently expanded on and incrementally improved. The sophisticated algorithms covered include: 1) string sample expansion algorithms which synthesize string samples from isolated characters or distort realistic string samples; 2) enhanced feature representation algorithms, e.g. enhanced four-plane features and Delta features; 3) novel learning algorithms, such as Perceptron learning with dynamic margin, MPE training and distributed training; and lastly 4) ensemble algorithms, that is, combining the two strategies using both parallel structure and serial structure. All the while, the book moves from basic to advanced algorithms, helping ...
Hybridizing Evolutionary Algorithms with Opportunistic Local Search
DEFF Research Database (Denmark)
Gießen, Christian
2013-01-01
There is empirical evidence that memetic algorithms (MAs) can outperform plain evolutionary algorithms (EAs). Recently the first runtime analyses have been presented proving the aforementioned conjecture rigorously by investigating Variable-Depth Search, VDS for short (Sudholt, 2008). Sudholt...
Performance Analysis of Cone Detection Algorithms
Mariotti, Letizia
2015-01-01
Many algorithms have been proposed to help clinicians evaluate cone density and spacing, as these may be related to the onset of retinal diseases. However, there has been no rigorous comparison of the performance of these algorithms. In addition, the performance of such algorithms is typically determined by comparison with human observers. Here we propose a technique to simulate realistic images of the cone mosaic. We use the simulated images to test the performance of two popular cone detection algorithms and we introduce an algorithm which is used by astronomers to detect stars in astronomical images. We use Free Response Operating Characteristic (FROC) curves to evaluate and compare the performance of the three algorithms. This allows us to optimize the performance of each algorithm. We observe that performance is significantly enhanced by up-sampling the images. We investigate the effect of noise and image quality on cone mosaic parameters estimated using the different algorithms, finding that the estimat...
A new specular reflection optimization algorithm
National Research Council Canada - National Science Library
Qi, Qisong; Xu, Gening; Fan, Xiaoning; Wang, Jun
2015-01-01
...; then the algorithm is used to solve discrete engineering optimization problems and the results indicate that the Specular Reflection Algorithm has higher computation efficiency and extensive prospect for engineering application.
Automatic differentiation algorithms in model analysis
Huiskes, M.J.
2002-01-01
Title: Automatic differentiation algorithms in model analysis
Author: M.J. Huiskes
Date: 19 March, 2002
In this thesis automatic differentiation algorithms and derivative-based methods
Teaching Multiplication Algorithms from Other Cultures
Lin, Cheng-Yao
2007-01-01
This article describes a number of multiplication algorithms from different cultures around the world: Hindu, Egyptian, Russian, Japanese, and Chinese. Students can learn these algorithms and better understand the operation and properties of multiplication.
Optimisation of nonlinear motion cueing algorithm based on genetic algorithm
Asadi, Houshyar; Mohamed, Shady; Rahim Zadeh, Delpak; Nahavandi, Saeid
2015-04-01
Motion cueing algorithms (MCAs) are playing a significant role in driving simulators, aiming to deliver the most accurate human sensation to the simulator drivers compared with a real vehicle driver, without exceeding the physical limitations of the simulator. This paper provides the optimisation design of an MCA for a vehicle simulator, in order to find the most suitable washout algorithm parameters, while respecting all motion platform physical limitations, and minimising human perception error between real and simulator driver. One of the main limitations of the classical washout filters is that it is attuned by the worst-case scenario tuning method. This is based on trial and error, and is effected by driving and programmers experience, making this the most significant obstacle to full motion platform utilisation. This leads to inflexibility of the structure, production of false cues and makes the resulting simulator fail to suit all circumstances. In addition, the classical method does not take minimisation of human perception error and physical constraints into account. Production of motion cues and the impact of different parameters of classical washout filters on motion cues remain inaccessible for designers for this reason. The aim of this paper is to provide an optimisation method for tuning the MCA parameters, based on nonlinear filtering and genetic algorithms. This is done by taking vestibular sensation error into account between real and simulated cases, as well as main dynamic limitations, tilt coordination and correlation coefficient. Three additional compensatory linear blocks are integrated into the MCA, to be tuned in order to modify the performance of the filters successfully. The proposed optimised MCA is implemented in MATLAB/Simulink software packages. The results generated using the proposed method show increased performance in terms of human sensation, reference shape tracking and exploiting the platform more efficiently without reaching
Automatic Algorithm Selection for Complex Simulation Problems
Ewald, Roland
2012-01-01
To select the most suitable simulation algorithm for a given task is often difficult. This is due to intricate interactions between model features, implementation details, and runtime environment, which may strongly affect the overall performance. An automated selection of simulation algorithms supports users in setting up simulation experiments without demanding expert knowledge on simulation. Roland Ewald analyzes and discusses existing approaches to solve the algorithm selection problem in the context of simulation. He introduces a framework for automatic simulation algorithm selection and
A Euclidean algorithm for integer matrices
DEFF Research Database (Denmark)
Lauritzen, Niels; Thomsen, Jesper Funch
2015-01-01
We present a Euclidean algorithm for computing a greatest common right divisor of two integer matrices. The algorithm is derived from elementary properties of finitely generated modules over the ring of integers.......We present a Euclidean algorithm for computing a greatest common right divisor of two integer matrices. The algorithm is derived from elementary properties of finitely generated modules over the ring of integers....
An algorithm for segmenting range imagery
Energy Technology Data Exchange (ETDEWEB)
Roberts, R.S.
1997-03-01
This report describes the technical accomplishments of the FY96 Cross Cutting and Advanced Technology (CC&AT) project at Los Alamos National Laboratory. The project focused on developing algorithms for segmenting range images. The image segmentation algorithm developed during the project is described here. In addition to segmenting range images, the algorithm can fuse multiple range images thereby providing true 3D scene models. The algorithm has been incorporated into the Rapid World Modelling System at Sandia National Laboratory.
Cache-Oblivious Algorithms and Data Structures
DEFF Research Database (Denmark)
Brodal, Gerth Stølting
2004-01-01
Frigo, Leiserson, Prokop and Ramachandran in 1999 introduced the ideal-cache model as a formal model of computation for developing algorithms in environments with multiple levels of caching, and coined the terminology of cache-oblivious algorithms. Cache-oblivious algorithms are described as stan...... apply to multi-level memory hierarchies. This paper gives an overview of the results achieved on cache-oblivious algorithms and data structures since the seminal paper by Frigo et al....
A Deterministic and Polynomial Modified Perceptron Algorithm
Directory of Open Access Journals (Sweden)
Olof Barr
2006-01-01
Full Text Available We construct a modified perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn3lognlog(1/ρ, where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct a non-deterministic modified perceptron algorithm running in timeO(mn2lognlog(1/ρ.
Improved fast fractional-Fourier-transform algorithm.
Yang, Xingpeng; Tan, Qiaofeng; Wei, Xiaofeng; Xiang, Yong; Yan, Yingbai; Jin, Guofan
2004-09-01
Through the optimization of the main interval of the fractional order, an improved fast algorithm for numerical calculation of the fractional Fourier transforms is proposed. With this improved algorithm, the fractional Fourier transforms of a rectangular function and a Gaussian function are calculated. Its calculation errors are compared with those calculated with the previously published algorithm, and the results show that the calculation accuracy of the improved algorithm is much higher.
An algorithm for minimization of quantum cost
Banerjee, Anindita; Pathak, Anirban
2009-01-01
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.
Improved LMS algorithm for adaptive beamforming
Godara, Lal C.
1990-01-01
Two adaptive algorithms which make use of all the available samples to estimate the required gradient are proposed and studied. The first algorithm is referred to as the recursive LMS (least mean squares) and is applicable to a general array. The second algorithm is referred to as the improved LMS algorithm and exploits the Toeplitz structure of the ACM (array correlation matrix); it can be used only for an equispaced linear array.
A New Perspective on Randomized Gossip Algorithms
Loizou, Nicolas; Richtárik, Peter
2016-01-01
In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how that Randomized Block Kaczmarz (RBK) method - a method for solving linear systems - works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case. Subsequently, we reveal a hidden duality of randomized gossip algorithms, with the ...
Algorithm 896: LSA: Algorithms for Large-Scale Optimization
Czech Academy of Sciences Publication Activity Database
Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan
2009-01-01
Roč. 36, č. 3 (2009), 16-1-16-29 ISSN 0098-3500 R&D Projects: GA AV ČR IAA1030405; GA ČR GP201/06/P397 Institutional research plan: CEZ:AV0Z10300504 Keywords : algorithms * design * large-scale optimization * large-scale nonsmooth optimization * large-scale nonlinear least squares * large-scale nonlinear minimax * large-scale systems of nonlinear equations * sparse problems * partially separable problems * limited-memory methods * discrete Newton methods * quasi-Newton methods * primal interior-point methods Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 1.904, year: 2009
On König's root finding algorithms
DEFF Research Database (Denmark)
Buff, Xavier; Henriksen, Christian
2003-01-01
In this paper, we first recall the definition of a family of root-finding algorithms known as König's algorithms. We establish some local and some global properties of those algorithms. We give a characterization of rational maps which arise as König's methods of polynomials with simple roots. We...
Algebraic verification of a distributed summation algorithm
Groote, Jan Friso; Springintveld, J.G.
1996-01-01
textabstractIn this note we present an algebraic verification of Segall's Propagation of Information with Feedback (PIF) algorithm. This algorithm serves as a nice benchmark for verification exercises (see [2, 13, 8]). The verification is based on the methodology presented in [7] and demonstrates its applicability to distributed algorithms.
An algorithm to implement DBA of GPON
Zhang, Minglun; Zhang, Li; Lei, Lei; Li, Ling
2005-02-01
An algorithm is presented in this paper to implement Dynamic Bandwidth Allocation of Gigabit-capable Passive Optical Network(GPON) which is one of the key technologies in GPON, and simulation result is shown to demonstrate the algorithm"s performance.
Successive combination jet algorithm for hadron collisions
Ellis, S D; Ellis, Stephen D.; Soper, Davision E.
1993-01-01
Jet finding algorithms, as they are used in $e^+ e^-$ and hadron collisions, are reviewed and compared. It is suggested that a successive combination style algorithm, similar to that used in $e^+ e^-$ physics, might be useful also in hadron collisions, where cone style algorithms have been used previously.
An algorithm for reduct cardinality minimization
AbouEisha, Hassan M.
2013-12-01
This is devoted to the consideration of a new algorithm for reduct cardinality minimization. This algorithm transforms the initial table to a decision table of a special kind, simplify this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. Results of computer experiments with decision tables from UCI ML Repository are discussed. © 2013 IEEE.
Voronoi Particle Merging Algorithm for PIC Codes
Luu, Phuc T
2016-01-01
We present a new particle-merging algorithm for the particle-in-cell method. Based on the concept of the Voronoi diagram, the algorithm partitions the phase space into smaller subsets, which consist of only particles that are in close proximity in the phase space to each other. We show the performance of our algorithm in the case of magnetic shower.
Learning Intelligent Genetic Algorithms Using Japanese Nonograms
Tsai, Jinn-Tsong; Chou, Ping-Yi; Fang, Jia-Cen
2012-01-01
An intelligent genetic algorithm (IGA) is proposed to solve Japanese nonograms and is used as a method in a university course to learn evolutionary algorithms. The IGA combines the global exploration capabilities of a canonical genetic algorithm (CGA) with effective condensed encoding, improved fitness function, and modified crossover and…
Analysis of algorithms beyond the worst case
Balcan, Maria-Florina; Manthey, Bodo; Röglin, Heiko; Roughgarden, Tim
2015-01-01
This report documents the program and the outcomes of Dagstuhl Seminar 14372 "Analysis of Algorithms Beyond the Worst Case". The theory of algorithms has traditionally focused on worst-case analysis. This focus has led to both a deep theory and many beautiful and useful algorithms. However, there
Comparing Online Algorithms for Bin Packing Problems
DEFF Research Database (Denmark)
Epstein, Leah; Favrholdt, Lene Monrad; Kohrt, Jens Svalgaard
2012-01-01
The relative worst-order ratio is a measure of the quality of online algorithms. In contrast to the competitive ratio, this measure compares two online algorithms directly instead of using an intermediate comparison with an optimal offline algorithm. In this paper, we apply the relative worst-ord...
In-Trail Procedure (ITP) Algorithm Design
Munoz, Cesar A.; Siminiceanu, Radu I.
2007-01-01
The primary objective of this document is to provide a detailed description of the In-Trail Procedure (ITP) algorithm, which is part of the Airborne Traffic Situational Awareness In-Trail Procedure (ATSA-ITP) application. To this end, the document presents a high level description of the ITP Algorithm and a prototype implementation of this algorithm in the programming language C.
New Results in Astrodynamics Using Genetic Algorithms
Coverstone-Carroll, V.; Hartmann, J. W.; Williams, S. N.; Mason, W. J.
1998-01-01
Generic algorithms have gained popularity as an effective procedure for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a brief survey of the use of genetic algorithms to solve astrodynamics problems is presented and is followed by new results obtained from applying a Pareto genetic algorithm to the optimization of low-thrust interplanetary spacecraft missions.
Research on AHP decision algorithms based on BP algorithm
Ma, Ning; Guan, Jianhe
2017-10-01
Decision making is the thinking activity that people choose or judge, and scientific decision-making has always been a hot issue in the field of research. Analytic Hierarchy Process (AHP) is a simple and practical multi-criteria and multi-objective decision-making method that combines quantitative and qualitative and can show and calculate the subjective judgment in digital form. In the process of decision analysis using AHP method, the rationality of the two-dimensional judgment matrix has a great influence on the decision result. However, in dealing with the real problem, the judgment matrix produced by the two-dimensional comparison is often inconsistent, that is, it does not meet the consistency requirements. BP neural network algorithm is an adaptive nonlinear dynamic system. It has powerful collective computing ability and learning ability. It can perfect the data by constantly modifying the weights and thresholds of the network to achieve the goal of minimizing the mean square error. In this paper, the BP algorithm is used to deal with the consistency of the two-dimensional judgment matrix of the AHP.
Filtering algorithm for dotted interferences
Energy Technology Data Exchange (ETDEWEB)
Osterloh, K., E-mail: kurt.osterloh@bam.de [Federal Institute for Materials Research and Testing (BAM), Division VIII.3, Radiological Methods, Unter den Eichen 87, 12205 Berlin (Germany); Buecherl, T.; Lierse von Gostomski, Ch. [Technische Universitaet Muenchen, Lehrstuhl fuer Radiochemie, Walther-Meissner-Str. 3, 85748 Garching (Germany); Zscherpel, U.; Ewert, U. [Federal Institute for Materials Research and Testing (BAM), Division VIII.3, Radiological Methods, Unter den Eichen 87, 12205 Berlin (Germany); Bock, S. [Technische Universitaet Muenchen, Lehrstuhl fuer Radiochemie, Walther-Meissner-Str. 3, 85748 Garching (Germany)
2011-09-21
An algorithm has been developed to remove reliably dotted interferences impairing the perceptibility of objects within a radiographic image. This particularly is a major challenge encountered with neutron radiographs collected at the NECTAR facility, Forschungs-Neutronenquelle Heinz Maier-Leibnitz (FRM II): the resulting images are dominated by features resembling a snow flurry. These artefacts are caused by scattered neutrons, gamma radiation, cosmic radiation, etc. all hitting the detector CCD directly in spite of a sophisticated shielding. This makes such images rather useless for further direct evaluations. One approach to resolve this problem of these random effects would be to collect a vast number of single images, to combine them appropriately and to process them with common image filtering procedures. However, it has been shown that, e.g. median filtering, depending on the kernel size in the plane and/or the number of single shots to be combined, is either insufficient or tends to blur sharp lined structures. This inevitably makes a visually controlled processing image by image unavoidable. Particularly in tomographic studies, it would be by far too tedious to treat each single projection by this way. Alternatively, it would be not only more comfortable but also in many cases the only reasonable approach to filter a stack of images in a batch procedure to get rid of the disturbing interferences. The algorithm presented here meets all these requirements. It reliably frees the images from the snowy pattern described above without the loss of fine structures and without a general blurring of the image. It consists of an iterative, within a batch procedure parameter free filtering algorithm aiming to eliminate the often complex interfering artefacts while leaving the original information untouched as far as possible.
Public traffic transfer algorithm design
Yin, Kui-Ying; Jin, Lin; Qian, Bo; Fang, Kai
The route relationship matrix M is employed in this paper to indicate relationship between routes. The travel solutions for bus stations are obtained by matrix operation. Through the data mining to the history record of transportation information, the road transportation status at specific time interval can be predicted. Based on the predication, the best travel solutions can be found. The algorithm fully uses history transportation information, optimizes the travel solutions according to the time consumed. It can satisfy the time requirement of traveler and is very useful.
Efficient GPS Position Determination Algorithms
2007-06-01
Algorithm Let the reference receiver, m, have a known position represented as (xm, ym, zm) and the reported ith satellite position (via ephemeris data) be...vr is given as the velocity difference uvv &−=r (1-22) where v is the (known) velocity of the satellite and u& is the velocity of the user to be...this research and in our previous work reported in [15] and [16], an over-determined system is treated, making use of all-in-view (n ≥ 5) satellites as
Data streams algorithms and applications
Muthukrishnan, S
2014-01-01
Data stream algorithms as an active research agenda emerged only over the past few years, even though the concept of making few passes over the data for performing computations has been around since the early days of Automata Theory. The data stream agenda now pervades many branches of Computer Science including databases, networking, knowledge discovery and data mining, and hardware systems. Industry is in synch too, with Data Stream Management Systems (DSMSs) and special hardware to deal with data speeds. Even beyond Computer Science, data stream concerns are emerging in physics, atmospheric
Parallel External Memory Graph Algorithms
DEFF Research Database (Denmark)
Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari
2010-01-01
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... common ancestors, tree contraction and expression tree evaluation. We also study the problems of computing the connected and biconnected components of a graph, minimum spanning tree of a connected graph and ear decomposition of a biconnected graph. All our solutions on a P-processor PEM model provide...
Distributed Optimization Algorithms with Communications,
1983-11-01
use out-dated values of x to update his own decisions. makers may be viewed as a distributed algorithm. For However, updates based on out-dated...charge of the i-th cow- rucia.1 uetion w ars au t -dateeci l q esti ons hicrh xi * are: Raw much out - datod ponent xi of x, which be updates according to...interpretations. 1 es The conceptual motivation behind cr approach is tar (Xi In).. ., I (n)) i h his estas of based on the following statement: 331 if a opti
Algorithms for skiascopy measurement automatization
Fomins, Sergejs; Trukša, Renārs; KrūmiĆa, Gunta
2014-10-01
Automatic dynamic infrared retinoscope was developed, which allows to run procedure at a much higher rate. Our system uses a USB image sensor with up to 180 Hz refresh rate equipped with a long focus objective and 850 nm infrared light emitting diode as light source. Two servo motors driven by microprocessor control the rotation of semitransparent mirror and motion of retinoscope chassis. Image of eye pupil reflex is captured via software and analyzed along the horizontal plane. Algorithm for automatic accommodative state analysis is developed based on the intensity changes of the fundus reflex.
Statistical Mechanics Algorithms and Computations
Krauth, Werner
2006-01-01
This book discusses the computational approach in modern statistical physics, adopting simple language and an attractive format of many illustrations, tables and printed algorithms. The discussion of key subjects in classical and quantum statistical physics will appeal to students, teachers and researchers in physics and related sciences. The focus is on orientation with implementation details kept to a minimum. - ;This book discusses the computational approach in modern statistical physics in a clear and accessible way and demonstrates its close relation to other approaches in theoretical phy
Complex fluids modeling and algorithms
Saramito, Pierre
2016-01-01
This book presents a comprehensive overview of the modeling of complex fluids, including many common substances, such as toothpaste, hair gel, mayonnaise, liquid foam, cement and blood, which cannot be described by Navier-Stokes equations. It also offers an up-to-date mathematical and numerical analysis of the corresponding equations, as well as several practical numerical algorithms and software solutions for the approximation of the solutions. It discusses industrial (molten plastics, forming process), geophysical (mud flows, volcanic lava, glaciers and snow avalanches), and biological (blood flows, tissues) modeling applications. This book is a valuable resource for undergraduate students and researchers in applied mathematics, mechanical engineering and physics.
Algorithms for optimizing drug therapy
Directory of Open Access Journals (Sweden)
Martin Lene
2004-07-01
Full Text Available Abstract Background Drug therapy has become increasingly efficient, with more drugs available for treatment of an ever-growing number of conditions. Yet, drug use is reported to be sub optimal in several aspects, such as dosage, patient's adherence and outcome of therapy. The aim of the current study was to investigate the possibility to optimize drug therapy using computer programs, available on the Internet. Methods One hundred and ten officially endorsed text documents, published between 1996 and 2004, containing guidelines for drug therapy in 246 disorders, were analyzed with regard to information about patient-, disease- and drug-related factors and relationships between these factors. This information was used to construct algorithms for identifying optimum treatment in each of the studied disorders. These algorithms were categorized in order to define as few models as possible that still could accommodate the identified factors and the relationships between them. The resulting program prototypes were implemented in HTML (user interface and JavaScript (program logic. Results Three types of algorithms were sufficient for the intended purpose. The simplest type is a list of factors, each of which implies that the particular patient should or should not receive treatment. This is adequate in situations where only one treatment exists. The second type, a more elaborate model, is required when treatment can by provided using drugs from different pharmacological classes and the selection of drug class is dependent on patient characteristics. An easily implemented set of if-then statements was able to manage the identified information in such instances. The third type was needed in the few situations where the selection and dosage of drugs were depending on the degree to which one or more patient-specific factors were present. In these cases the implementation of an established decision model based on fuzzy sets was required. Computer programs
Data clustering algorithms and applications
Aggarwal, Charu C
2013-01-01
Research on the problem of clustering tends to be fragmented across the pattern recognition, database, data mining, and machine learning communities. Addressing this problem in a unified way, Data Clustering: Algorithms and Applications provides complete coverage of the entire area of clustering, from basic methods to more refined and complex data clustering approaches. It pays special attention to recent issues in graphs, social networks, and other domains.The book focuses on three primary aspects of data clustering: Methods, describing key techniques commonly used for clustering, such as fea
Algorithmes Efficaces en Calcul Formel
Bostan, Alin; Chyzak, Frédéric; Giusti, Marc; Lebreton, Romain; Lecerf, Grégoire; Salvy, Bruno; Schost, Eric
2017-01-01
Voir la page du livre à l’adresse \\url{https://hal.archives-ouvertes.fr/AECF/}; International audience; Le calcul formel traite des objets mathématiques exacts d’un point de vue informatique. Cet ouvrage « Algorithmes efficaces en calcul formel » explore deux directions : la calculabilité et la complexité. La calculabilité étudie les classes d’objets mathématiques sur lesquelles des réponses peuvent être obtenues algorithmiquement. La complexité donne ensuite des outils pour comparer des algo...
Algorithms for solving rubik's cubes
Demaine, Erik D.; Demaine, Martin L.; Eisenstat, Sarah; Lubiw, Anna; Winslow, Andrew
2011-01-01
The Rubik’s Cube is perhaps the world’s most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik’s Cube also has a rich underlying algorithmic structure. Specifically, we show that the n ×n ×n Rubik’s Cube, as well as the n ×n ×1 variant, has a “God’s Number” (diameter of the configuration space) of Θ(n [superscript 2]/logn). The upper bound comes from effectively parallelizing standard Θ(n [superscript 2]...
Parameter Selection in Genetic Algorithms
Directory of Open Access Journals (Sweden)
Onur BOYABATLI
2004-08-01
Full Text Available In this study, we provide a new taxonomy of parameters of genetic algorithms (GA, structural and numerical parameters, and analyze the effect of numerical parameters on the performance of GA based simulation optimization applications with experimental design techniques. Appropriate levels of each parameter are proposed for a particular problem domain. Controversial to existing literature on GA, our computational results reveal that in the case of a dominant set of decision variable the crossover operator does not have a significant impact on the performance measures, whereas high mutation rates are more suitable for GA applications.
New Algorithm For Calculating Wavelet Transforms
Directory of Open Access Journals (Sweden)
Piotr Lipinski
2009-04-01
Full Text Available In this article we introduce a new algorithm for computing Discrete Wavelet Transforms (DWT. The algorithm aims at reducing the number of multiplications, required to compute a DWT. The algorithm is general and can be used to compute a variety of wavelet transform (Daubechies and CDF. Here we focus on CDF 9/7 filters, which are used in JPEG2000 compression standard. We show that the algorithm outperforms convolution-based and lifting-based algorithms in terms of number of multiplications.
A generalization of the normalized LMS algorithm
Nitzberg, Ramon
1987-07-01
It has been shown that the normalized least mean square (NLMS) algorithm has convergence properties that are superior to those of the least mean square (LMS) algorithm. However, the weight noise effect of the NLMS algorithm is large; hence, the steady state residue power is larger than that for the LMS algorithm. In the present paper, a generalized NLMS algorithm is developed based on the pseudoinverse of an estimated covariance matrix. Results indicate that improved performance can be attained but the implementation complexity might be high. The results are of interest in connection with the use of adaptive signal processing to cancel interference (e.g., in radar applications).
Integrated Association Rules Complete Hiding Algorithms
Directory of Open Access Journals (Sweden)
Mohamed Refaat Abdellah
2017-01-01
Full Text Available This paper presents database security approach for complete hiding of sensitive association rules by using six novel algorithms. These algorithms utilize three new weights to reduce the needed database modifications and support complete hiding, as well as they reduce the knowledge distortion and the data distortions. Complete weighted hiding algorithms enhance the hiding failure by 100%; these algorithms have the advantage of performing only a single scan for the database to gather the required information to form the hiding process. These proposed algorithms are built within the database structure which enables the sanitized database to be generated on run time as needed.
Transient noise suppression algorithm in speech system
Cao, Keyu; Wang, Mingjiang
2017-08-01
In this paper, I mainly introduce the algorithm of transient noise suppression in speech system. Firstly, it divides into impulsive noise and other types of transient noise according to the characteristics of transient noise. In the impulse noise suppression algorithm, I mainly use the averaging energy threshold method to detect the impulse noise, and then I use the amplitude threshold method to reduce the impulse noise which was detected. In the other types of transient noise suppression algorithm, I mainly use the Optimally Modified-Log Spectral Amplitude estimation (OM-LSA) algorithm and the Minimum Control Recursive Average (MCRA) algorithm to suppress the transient noise.
Smell Detection Agent Based Optimization Algorithm
Vinod Chandra, S. S.
2016-09-01
In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems.
Optimal Multistage Algorithm for Adjoint Computation
Energy Technology Data Exchange (ETDEWEB)
Aupy, Guillaume; Herrmann, Julien; Hovland, Paul; Robert, Yves
2016-01-01
We reexamine the work of Stumm and Walther on multistage algorithms for adjoint computation. We provide an optimal algorithm for this problem when there are two levels of checkpoints, in memory and on disk. Previously, optimal algorithms for adjoint computations were known only for a single level of checkpoints with no writing and reading costs; a well-known example is the binomial checkpointing algorithm of Griewank and Walther. Stumm and Walther extended that binomial checkpointing algorithm to the case of two levels of checkpoints, but they did not provide any optimality results. We bridge the gap by designing the first optimal algorithm in this context. We experimentally compare our optimal algorithm with that of Stumm and Walther to assess the difference in performance.
Wolf Pack Algorithm for Unconstrained Global Optimization
Directory of Open Access Journals (Sweden)
Hu-Sheng Wu
2014-01-01
Full Text Available The wolf pack unites and cooperates closely to hunt for the prey in the Tibetan Plateau, which shows wonderful skills and amazing strategies. Inspired by their prey hunting behaviors and distribution mode, we abstracted three intelligent behaviors, scouting, calling, and besieging, and two intelligent rules, winner-take-all generation rule of lead wolf and stronger-survive renewing rule of wolf pack. Then we proposed a new heuristic swarm intelligent method, named wolf pack algorithm (WPA. Experiments are conducted on a suit of benchmark functions with different characteristics, unimodal/multimodal, separable/nonseparable, and the impact of several distance measurements and parameters on WPA is discussed. What is more, the compared simulation experiments with other five typical intelligent algorithms, genetic algorithm, particle swarm optimization algorithm, artificial fish swarm algorithm, artificial bee colony algorithm, and firefly algorithm, show that WPA has better convergence and robustness, especially for high-dimensional functions.
Hardware Acceleration of Adaptive Neural Algorithms.
Energy Technology Data Exchange (ETDEWEB)
James, Conrad D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2017-11-01
As tradit ional numerical computing has faced challenges, researchers have turned towards alternative computing approaches to reduce power - per - computation metrics and improve algorithm performance. Here, we describe an approach towards non - conventional computing that strengthens the connection between machine learning and neuroscience concepts. The Hardware Acceleration of Adaptive Neural Algorithms (HAANA) project ha s develop ed neural machine learning algorithms and hardware for applications in image processing and cybersecurity. While machine learning methods are effective at extracting relevant features from many types of data, the effectiveness of these algorithms degrades when subjected to real - world conditions. Our team has generated novel neural - inspired approa ches to improve the resiliency and adaptability of machine learning algorithms. In addition, we have also designed and fabricated hardware architectures and microelectronic devices specifically tuned towards the training and inference operations of neural - inspired algorithms. Finally, our multi - scale simulation framework allows us to assess the impact of microelectronic device properties on algorithm performance.
Quantum algorithm for support matrix machines
Duan, Bojia; Yuan, Jiabin; Liu, Ying; Li, Dan
2017-09-01
We propose a quantum algorithm for support matrix machines (SMMs) that efficiently addresses an image classification problem by introducing a least-squares reformulation. This algorithm consists of two core subroutines: a quantum matrix inversion (Harrow-Hassidim-Lloyd, HHL) algorithm and a quantum singular value thresholding (QSVT) algorithm. The two algorithms can be implemented on a universal quantum computer with complexity O[log(npq) ] and O[log(pq)], respectively, where n is the number of the training data and p q is the size of the feature space. By iterating the algorithms, we can find the parameters for the SMM classfication model. Our analysis shows that both HHL and QSVT algorithms achieve an exponential increase of speed over their classical counterparts.
Privacy Preservation in Distributed Subgradient Optimization Algorithms.
Lou, Youcheng; Yu, Lean; Wang, Shouyang; Yi, Peng
2017-07-31
In this paper, some privacy-preserving features for distributed subgradient optimization algorithms are considered. Most of the existing distributed algorithms focus mainly on the algorithm design and convergence analysis, but not the protection of agents' privacy. Privacy is becoming an increasingly important issue in applications involving sensitive information. In this paper, we first show that the distributed subgradient synchronous homogeneous-stepsize algorithm is not privacy preserving in the sense that the malicious agent can asymptotically discover other agents' subgradients by transmitting untrue estimates to its neighbors. Then a distributed subgradient asynchronous heterogeneous-stepsize projection algorithm is proposed and accordingly its convergence and optimality is established. In contrast to the synchronous homogeneous-stepsize algorithm, in the new algorithm agents make their optimization updates asynchronously with heterogeneous stepsizes. The introduced two mechanisms of projection operation and asynchronous heterogeneous-stepsize optimization can guarantee that agents' privacy can be effectively protected.
Formal verification of a deadlock detection algorithm
Directory of Open Access Journals (Sweden)
Freek Verbeek
2011-10-01
Full Text Available Deadlock detection is a challenging issue in the analysis and design of on-chip networks. We have designed an algorithm to detect deadlocks automatically in on-chip networks with wormhole switching. The algorithm has been specified and proven correct in ACL2. To enable a top-down proof methodology, some parts of the algorithm have been left unimplemented. For these parts, the ACL2 specification contains constrained functions introduced with defun-sk. We used single-threaded objects to represent the data structures used by the algorithm. In this paper, we present details on the proof of correctness of the algorithm. The process of formal verification was crucial to get the algorithm flawless. Our ultimate objective is to have an efficient executable, and formally proven correct implementation of the algorithm running in ACL2.
FIREWORKS ALGORITHM FOR UNCONSTRAINED FUNCTION OPTIMIZATION PROBLEMS
Directory of Open Access Journals (Sweden)
Evans BAIDOO
2017-03-01
Full Text Available Modern real world science and engineering problems can be classified as multi-objective optimisation problems which demand for expedient and efficient stochastic algorithms to respond to the optimization needs. This paper presents an object-oriented software application that implements a firework optimization algorithm for function optimization problems. The algorithm, a kind of parallel diffuse optimization algorithm is based on the explosive phenomenon of fireworks. The algorithm presented promising results when compared to other population or iterative based meta-heuristic algorithm after it was experimented on five standard benchmark problems. The software application was implemented in Java with interactive interface which allow for easy modification and extended experimentation. Additionally, this paper validates the effect of runtime on the algorithm performance.
Economic Dispatch Using Modified Bat Algorithm
Directory of Open Access Journals (Sweden)
Aadil Latif
2014-07-01
Full Text Available Economic dispatch is an important non-linear optimization task in power systems. In this process, the total power demand is distributed amongst the generating units such that each unit satisfies its generation limit constraints and the cost of power production is minimized. This paper presents an over view of three optimization algorithms namely real coded genetic algorithm, particle swarm optimization and a relatively new optimization technique called bat algorithm. This study will further propose modifications to the original bat. Simulations are carried out for two test cases. First is a six-generator power system with a simplified convex objective function. The second test case is a five-generator system with a non-convex objective function. Finally the results of the modified algorithm are compared with the results of genetic algorithm, particle swarm and the original bat algorithm. The results demonstrate the improvement in the Bat Algorithm.