Relevant bibliographies by topics / Map functions

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Map functions'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Map functions.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Map functions"

1

Kbanakubo, Tositomo. "Map Functions / ULRICH FREITAG." Cartographica: The International Journal for Geographic Information and Geovisualization 30, no. 4 (October 1993): 1–20. http://dx.doi.org/10.3138/dq3r-34t9-7227-51tx.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhao, Hongyu, and Terence P. Speed. "On Genetic Map Functions." Genetics 142, no. 4 (April 1, 1996): 1369–77. http://dx.doi.org/10.1093/genetics/142.4.1369.

Full text
Abstract:
Abstract Various genetic map functions have been proposed to infer the unobservable genetic distance between two loci from the observable recombination fraction between them. Some map functions were found to fit data better than others. When there are more than three markers, multilocus recombination probabilities cannot be uniquely determined by the defining property of map functions, and different methods have been proposed to permit the use of map functions to analyze multilocus data. If for a given map function, there is a probability model for recombination that can give rise to it, then joint recombination probabilities can be deduced from this model. This provides another way to use map functions in multilocus analysis. In this paper we show that stationary renewal processes give rise to most of the map functions in the literature. Furthermore, we show that the interevent distributions of these renewal processes can all be approximated quite well by gamma distributions.
APA, Harvard, Vancouver, ISO, and other styles
3

Rushdi, Ali M. "Map differentiation of switching functions." Microelectronics Reliability 26, no. 5 (January 1986): 891–907. http://dx.doi.org/10.1016/0026-2714(86)90233-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cowan, Nicolas B., and Eric Agol. "Inverting Phase Functions to Map Exoplanets." Astrophysical Journal 678, no. 2 (April 15, 2008): L129—L132. http://dx.doi.org/10.1086/588553.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lusztig, G. "On induction of class functions." Representation Theory of the American Mathematical Society 25, no. 13 (May 7, 2021): 412–21. http://dx.doi.org/10.1090/ert/561.

Full text
Abstract:
Let G G be a connected reductive group defined over a finite field F q \mathbf {F}_q and let L L be a Levi subgroup (defined over F q \mathbf {F}_q ) of a parabolic subgroup P P of G G . We define a linear map from class functions on L ( F q ) L(\mathbf {F}_q) to class functions on G ( F q ) G(\mathbf {F}_q) . This map is independent of the choice of P P . We show that for large q q this map coincides with the known cohomological induction (whose definition involves a choice of P P ).
APA, Harvard, Vancouver, ISO, and other styles
6

Bartels, Sebastian, Marina A. González Besteiro, Daniel Lang, and Roman Ulm. "Emerging functions for plant MAP kinase phosphatases." Trends in Plant Science 15, no. 6 (June 2010): 322–29. http://dx.doi.org/10.1016/j.tplants.2010.04.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yankelevich, Svetlana S. "MAP FUNCTIONS IN THE POST-INDUSTRIAL ERA." Vestnik SSUGT (Siberian State University of Geosystems and Technologies) 25, no. 2 (2020): 160–68. http://dx.doi.org/10.33764/2411-1759-2020-25-2-160-168.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mateljevic, Miodrag, and Miloljub Albijanic. "Lagrange’s theorem, convex functions and Gauss map." Filomat 31, no. 2 (2017): 321–34. http://dx.doi.org/10.2298/fil1702321m.

Full text
Abstract:
As one of the main results we prove that if f has Lagrange unique property then f is strictly convex or concave (we do not assume continuity of the derivative), Theorem 2.1. We give two different proofs of Theorem 2.1 (one mainly using Lagrange theorem and the other using Darboux theorem). In addition, we give a few characterizations of strictly convex curves, in Theorem 3.5. As an application of it, we give characterization of strictly convex planar curves, which have only tangents at every point, by injective of the Gauss map. Also without the differentiability hypothesis we get the characterization of strictly convex or concave functions by two points property, Theorem 4.2.
APA, Harvard, Vancouver, ISO, and other styles
9

Shamoyan, Romi. "On some problems connected with diagonal map in some spaces of analytic functions." Mathematica Bohemica 133, no. 4 (2008): 351–66. http://dx.doi.org/10.21136/mb.2008.140625.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mosig, J. R. "Static green's functions with conformal mapping and matlas." IEEE Antennas and Propagation Magazine 45, no. 5 (October 2003): 123–35. http://dx.doi.org/10.1109/map.2003.1252820.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Map functions"

1

Akkoyun, Emrah. "Parallelization Of Functional Flow To Predict Protein Functions." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12612932/index.pdf.

Full text
Abstract:
Protein-protein interaction networks provide important information about what the biological function of proteins whose roles are unknown might be in a cell. These interaction networks were analyzed by a variety of approaches by running them on a single computer and the roles of the proteins identified were used to predict the function of the proteins unidentified. The functional flow is an approach that takes the network connectivity, distance effect, topology of the network with local and global views into account. With these advantages, that the functional flow produces more accurate results on the prediction of protein functions was presented by the previos conducted researches. However, the application implemented for this approach could not be practically applied on the large and complex network produced for the complex species because of memory limitation. The purpose of this thesis is to provide a new application be implemented on the high computing performance where the application can be scaled on the large data sets. Therefore, Hadoop, one of the open source map/reduce environments, was installed on 18 hosts each of which has eight cores. Method
the first map/reduce job distributes the protein interaction network as a format which allows parallel distributed computing to all the worker nodes, the other map/reduce job generates flows for each known protein function and the role of the proteins unidentified are predicted by accumulating all of these generated flows. It has been observed in the experiments we performed that the application requiring high performance computing can be decomposed into worker nodes efficiently and the application can provide better performance as the resources increase.
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Jungkwan. "Alignment between genetic and physical map, and pheromone functions in Gibberella zeae." Diss., Manhattan, Kan. : Kansas State University, 2007. http://hdl.handle.net/2097/562.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rizzardo, Caitlan A. "Multipurpose Map Designs for GPS Surface-Vehicle Navigation: Spatial Knowledge and Advisory Functions." Wright State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=wright1316635259.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Muir, Autumn M. "The Psalter Mappaemundi: Medieval Maps Enabling Ascension of the Soul within Christian Devotional Practices." Bowling Green State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1300733958.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Meneghini, Marc D. "A MAP kinase-related pathway functions with the Wnt pathway to regulate anterior-posterior polarity in C. elegans /." view abstract or download file of text, 2000. http://wwwlib.umi.com/cr/uoregon/fullcit?p9977911.

Full text
Abstract:
Thesis (Ph. D.)--University of Oregon, 2000.
Typescript. Includes vita and abstract. Includes bibliographical references (leaves 76-79). Also available for download via the World Wide Web; free to University of Oregon users.
APA, Harvard, Vancouver, ISO, and other styles
6

Labrande, Hugo. "Explicit computation of the Abel-Jacobi map and its inverse." Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0142/document.

Full text
Abstract:
L'application d'Abel-Jacobi fait le lien entre la forme de Weierstrass d'une courbe elliptique définie sur C et le tore complexe qui lui est associé. Il est possible de la calculer en un nombre d'opérations quasi-linéaire en la précision voulue, c'est à dire en temps O(M(P) log P). Son inverse est donné par la fonction p de Weierstrass, qui s'exprime en fonction de thêta, une fonction importante en théorie des nombres. L'algorithme naturel d'évaluation de thêta nécessite O(M(P) sqrt(P)) opérations, mais certaines valeurs (les thêta-constantes) peuvent être calculées en O(M(P) log P) opérations en exploitant les liens avec la moyenne arithmético-géométrique (AGM). Dans ce manuscrit, nous généralisons cet algorithme afin de calculer thêta en O(M(P) log P). Nous exhibons une fonction F qui a des propriétés similaires à l'AGM. D'une façon similaire à l'algorithme pour les thêta-constantes, nous pouvons alors utiliser la méthode de Newton pour calculer la valeur de thêta. Nous avons implanté cet algorithme, qui est plus rapide que la méthode naïve pour des précisions supérieures à 300 000 chiffres décimaux. Nous montrons comment généraliser cet algorithme en genre supérieur, et en particulier comment généraliser la fonction F. En genre 2, nous sommes parvenus à prouver que la même méthode mène à un algorithme qui évalue thêta en O(M(P) log P) opérations ; la même complexité s'applique aussi à l'application d'Abel-Jacobi. Cet algorithme est plus rapide que la méthode naïve pour des précisions plus faibles qu'en genre 1, de l'ordre de 3 000 chiffres décimaux. Nous esquissons également des pistes pour obtenir la même complexité en genre quelconque. Enfin, nous exhibons un nouvel algorithme permettant de calculer une isogénie de courbes elliptiques de noyau donné. Cet algorithme utilise l'application d'Abel-Jacobi, car il est facile d'évaluer l'isogénie sur le tore ; il est sans doute possible de le généraliser au genre supérieur
The Abel-Jacobi map links the short Weierstrass form of a complex elliptic curve to the complex torus associated to it. One can compute it with a number of operations which is quasi-linear in the target precision, i.e. in time O(M(P) log P). Its inverse is given by Weierstrass's p-function, which can be written as a function of theta, an important function in number theory. The natural algorithm for evaluating theta requires O(M(P) sqrt(P)) operations, but some values (the theta-constants) can be computed in O(M(P) log P) operations by exploiting the links with the arithmetico-geometric mean (AGM). In this manuscript, we generalize this algorithm in order to compute theta in O(M(P) log P). We give a function F which has similar properties to the AGM. As with the algorithm for theta-constants, we can then use Newton's method to compute the value of theta. We implemented this algorithm, which is faster than the naive method for precisions larger than 300,000 decimal digits. We then study the generalization of this algorithm in higher genus, and in particular how to generalize the F function. In genus 2, we managed to prove that the same method leads to a O(M(P) log P) algorithm for theta; the same complexity applies to the Abel-Jacobi map. This algorithm is faster than the naive method for precisions smaller than in genus 1, of about 3,000 decimal digits. We also outline a way one could reach the same complexity in any genus. Finally, we study a new algorithm which computes an isogeny of elliptic curves with given kernel. This algorithm uses the Abel-Jacobi map because it is easy to evaluate the isogeny on the complex torus; this algorithm may be generalizable to higher genera
APA, Harvard, Vancouver, ISO, and other styles
7

Kulkarni, Praveen P. "Functional MRI Data Analysis Techniques and Strategies to Map the Olfactory System of a Rat Brain." Digital WPI, 2006. https://digitalcommons.wpi.edu/etd-dissertations/37.

Full text
Abstract:
Understanding mysteries of a brain represents one of the great challenges for modern science. Functional magnetic resonance imaging (fMRI) has two features that make it unique amongst other imaging modalities used in behavioral neuroscience. First, it can be entirely non-invasive and second, fMRI has the spatial and temporal resolution to resolve patterns of neuronal activity across the entire brain in less than a minute. fMRI indirectly detects neural activity in different parts of the brain by comparing contrast in MR signal intensity prior to and following stimulation. Areas of the brain with increased synaptic and neuronal activity require increased levels of oxygen to sustain this activity. Enhanced brain activity is accompanied by an increase in metabolism followed by increases in blood flow and blood volume. The enhanced blood flow usually exceeds the metabolic demand exposing the active brain area to high level of oxygenated hemoglobin. Oxygenated hemoglobin increases the MR signal intensity that can be detected in MR scanner. This relatively straight forward scenario is, unfortunately, oversimplified. The fMRI signal change to noise ratio is extremely small. In this work a quantitative analysis strategy to analyze fMRI data was successfully developed, implemented and optimized for the rat brain. Therein, each subject is registered or aligned to a complete volume-segmented rat atlas. The matrices that transformed the subject's anatomy to the atlas space are used to embed each slice within the atlas. All transformed pixel locations of the anatomy images are tagged with the segmented atlas major and minor regions creating a fully segmented representation of each subject. This task required the development of a full 3D surface atlas based upon 2D non-uniformly spaced 2D slices from an existing atlas. A multiple materials marching cube (M3C) algorithm was used to generate these 1277 subvolumes. After this process, they were coalesced into a dozen major zones of the brain (amygdaloid complex, cerebrum, cerebellum, hypothalamus, etc.). Each major brain category was subdivided into approximately 10 sub-major zones. Many scientists are interested in behavior and reactions to pain, pleasure, smell, for example. Consequently, the 3D volume atlas was segmented into functional zones as well as the anatomical regions. A utility (program) called Tree Browser was developed to interactively display and choose different anatomical and/or functional areas. Statistical t-tests are performed to determine activation on each subject within their original coordinate system. Due to the multiple t-test analyses performed, a false-positive detection controlling mechanism was introduced. A statistical composite of five components was created for each group. The individual analyses were summed within groups. The strategy developed in this work is unique as it registers segments and analyzes multiple subjects and presents a composite response of the whole group. This strategy is robust, incredibly fast and statistically powerful. The power of this system was demonstrated by mapping the olfactory system of a rat brain. Synchronized changes in neuronal activity across multiple subjects and brain areas can be viewed as functional neuro-anatomical circuits coordinating the thoughts, memories and emotions for particular behaviors using this fMRI module.
APA, Harvard, Vancouver, ISO, and other styles
8

Lkhamsuren, Altangerel. "A duality approach to gap functions for variational inequalities and equilibrium problems." Doctoral thesis, Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601214.

Full text
Abstract:
This work aims to investigate some applications of the conjugate duality for scalar and vector optimization problems to the construction of gap functions for variational inequalities and equilibrium problems. The basic idea of the approach is to reformulate variational inequalities and equilibrium problems into optimization problems depending on a fixed variable, which allows us to apply duality results from optimization problems. Based on some perturbations, first we consider the conjugate duality for scalar optimization. As applications, duality investigations for the convex partially separable optimization problem are discussed. Afterwards, we concentrate our attention on some applications of conjugate duality for convex optimization problems in finite and infinite-dimensional spaces to the construction of a gap function for variational inequalities and equilibrium problems. To verify the properties in the definition of a gap function weak and strong duality are used. The remainder of this thesis deals with the extension of this approach to vector variational inequalities and vector equilibrium problems. By using the perturbation functions in analogy to the scalar case, different dual problems for vector optimization and duality assertions for these problems are derived. This study allows us to propose some set-valued gap functions for the vector variational inequality. Finally, by applying the Fenchel duality on the basis of weak orderings, some variational principles for vector equilibrium problems are investigated.
APA, Harvard, Vancouver, ISO, and other styles
9

Kurdej, Marek. "Exploitation of map data for the perception of intelligent vehicles." Thesis, Compiègne, 2015. http://www.theses.fr/2015COMP2174/document.

Full text
Abstract:
La plupart des logiciels contrôlant les véhicules intelligents traite de la compréhension de la scène. De nombreuses méthodes existent actuellement pour percevoir les obstacles de façon automatique. La majorité d’entre elles emploie ainsi les capteurs extéroceptifs comme des caméras ou des lidars. Cette thèse porte sur les domaines de la robotique et de la fusion d’information et s’intéresse aux systèmes d’information géographique. Nous étudions ainsi l’utilité d’ajouter des cartes numériques, qui cartographient le milieu urbain dans lequel évolue le véhicule, en tant que capteur virtuel améliorant les résultats de perception. Les cartes contiennent en effet une quantité phénoménale d’information sur l’environnement : sa géométrie, sa topologie ainsi que d’autres informations contextuelles. Dans nos travaux, nous avons extrait la géométrie des routes et des modèles de bâtiments afin de déduire le contexte et les caractéristiques de chaque objet détecté. Notre méthode se base sur une extension de grilles d’occupations : les grilles de perception crédibilistes. Elle permet de modéliser explicitement les incertitudes liées aux données de cartes et de capteurs. Elle présente également l’avantage de représenter de façon uniforme les données provenant de différentes sources : lidar, caméra ou cartes. Les cartes sont traitées de la même façon que les capteurs physiques. Cette démarche permet d’ajouter les informations géographiques sans pour autant leur donner trop d’importance, ce qui est essentiel en présence d’erreurs. Dans notre approche, le résultat de la fusion d’information contenu dans une grille de perception est utilisé pour prédire l’état de l’environnement à l’instant suivant. Le fait d’estimer les caractéristiques des éléments dynamiques ne satisfait donc plus l’hypothèse du monde statique. Par conséquent, il est nécessaire d’ajuster le niveau de certitude attribué à ces informations. Nous y parvenons en appliquant l’affaiblissement temporel. Étant donné que les méthodes existantes n’étaient pas adaptées à cette application, nous proposons une famille d’opérateurs d’affaiblissement prenant en compte le type d’information traitée. Les algorithmes étudiés ont été validés par des tests sur des données réelles. Nous avons donc développé des prototypes en Matlab et des logiciels en C++ basés sur la plate-forme Pacpus. Grâce à eux nous présentons les résultats des expériences effectués en conditions réelles
This thesis is situated in the domains of robotics and data fusion, and concerns geographic information systems. We study the utility of adding digital maps, which model the urban environment in which the vehicle evolves, as a virtual sensor improving the perception results. Indeed, the maps contain a phenomenal quantity of information about the environment : its geometry, topology and additional contextual information. In this work, we extract road surface geometry and building models in order to deduce the context and the characteristics of each detected object. Our method is based on an extension of occupancy grids : the evidential perception grids. It permits to model explicitly the uncertainty related to the map and sensor data. By this means, the approach presents also the advantage of representing homogeneously the data originating from various sources : lidar, camera or maps. The maps are handled on equal terms with the physical sensors. This approach allows us to add geographic information without imputing unduly importance to it, which is essential in presence of errors. In our approach, the information fusion result, stored in a perception grid, is used to predict the stateof environment on the next instant. The fact of estimating the characteristics of dynamic elements does not satisfy the hypothesis of static world. Therefore, it is necessary to adjust the level of certainty attributed to these pieces of information. We do so by applying the temporal discounting. Due to the fact that existing methods are not well suited for this application, we propose a family of discoun toperators that take into account the type of handled information. The studied algorithms have been validated through tests on real data. We have thus developed the prototypes in Matlab and the C++ software based on Pacpus framework. Thanks to them, we present the results of experiments performed in real conditions
APA, Harvard, Vancouver, ISO, and other styles
10

Голованова, В. С., and V. S. Golovanova. "Проект электронной литературной карты : магистерская диссертация." Master's thesis, б. и, 2020. http://hdl.handle.net/10995/94028.

Full text
Abstract:
Диссертационная работа посвящена исследованию феномена литературных карт с точки зрения литературоведческого и издательского аспекта. Исследование имеет практический характер: теоретическое освоение материала, посвященного литературным картам, позволило достичь цель исследования ‒ реализовать проект «Электронная интерактивная литературная карта по роману Е. Сосновского “Апокриф Аглаи”».
The thesis is devoted to the study of the phenomenon of literary maps from the point of view of literary and publishing aspects. The research is of a practical nature: the theoretical development of the material devoted to literary maps allowed us to achieve the goal of the research ‒ to implement the project "Electronic interactive literary map based on the novel by E. Sosnovsky "Apocryph of Aglaia"".
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Map functions"

1

Krzywicka-Blum, Ewa. Map Functions. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-47358-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Blankenbeckler, Paul N. New skills training plan for map functions and passage of lines on a soldier system. Arlington, Va: U.S. Army Research Institute for the Behavioral and Social Sciences, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mullane, John. Random Finite Sets for Robot Mapping and SLAM: New Concepts in Autonomous Robotic Map Representations. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Makarov, Boris M., and Anatolii N. Podkorytov. Smooth Functions and Maps. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79438-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Luria, Aleksandr Romanovich. Higher Cortical Functions in Man. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4684-7741-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

1983-, Spadaro Emanuele Nunzio, ed. Q-valued functions revisited. Providence, R.I: American Mathematical Society, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Board, Construction Industry Training. Functional map for construction occupations: (craft & operative). King's Lynn: Construction Industry Training Board, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lowen-Colebunders, Eva. Function classes of Cauchy continuous maps. New York: M. Dekker, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

O'Keefe, Stephen J. D. Nutrition and intestinal function in man. Cape Town: University of Cape Town, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ashline, George Lawrence. The defect relation of meromorphic maps on parabolic manifolds. Providence, R.I: American Mathematical Society, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Map functions"

1

Xu, Shizhong. "Map Functions." In Principles of Statistical Genomics, 3–10. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-0-387-70807-2_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wiskott, Laurenz, and Terrence Sejnowski. "Objective functions for neural map formation." In Lecture Notes in Computer Science, 243–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0020163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lawton, Wayne. "A Fast Algorithm to Map Functions Forward." In Multidimensional Filter Banks and Wavelets, 219–27. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4757-5922-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rao, Basuthkar J. "Genome Regulation Is All Non-local: Maps and Functions." In The Map and the Territory, 489–511. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72478-2_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Keshet, Yonat, and Rony Seger. "The MAP Kinase Signaling Cascades: A System of Hundreds of Components Regulates a Diverse Array of Physiological Functions." In MAP Kinase Signaling Protocols, 3–38. Totowa, NJ: Humana Press, 2010. http://dx.doi.org/10.1007/978-1-60761-795-2_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Geisser, Thomas. "The cyclotomic trace map and values of zeta functions." In Algebra and Number Theory, 211–25. Gurgaon: Hindustan Book Agency, 2005. http://dx.doi.org/10.1007/978-93-86279-23-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Knecht, Alexander, and Jon Vanderwerff. "Legendre Functions Whose Gradients Map Convex Sets to Convex Sets." In Computational and Analytical Mathematics, 455–62. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-7621-4_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kapral, Raymond, Merk-Na Chee, Stuart G. Whittington, and Gian-Luca Oppo. "Phase Dynamics, Phase Resetting, Correlation Functions and Coupled Map Lattices." In NATO ASI Series, 381–94. Boston, MA: Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4757-0623-9_54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

de Araujo, Allan David Garcia, Adriao Duarte Doria Neto, and Allan de Medeiros Martins. "Stereo Map Surface Calculus Optimization Using Radial Basis Functions Neural Network Interpolation." In Neural Information Processing, 229–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10677-4_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

O'Keefe, John, and A. H. Black. "Single Unit and Lesion Experiments on the Sensory Inputs to the Hippocampal Cognitive Map." In Ciba Foundation Symposium 58 - Functions of the Septo-Hippocampal System, 179–98. Chichester, UK: John Wiley & Sons, Ltd., 2008. http://dx.doi.org/10.1002/9780470720394.ch9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Map functions"

1

Leordeanu, Marius, and Martial Hebert. "Efficient MAP approximation for dense energy functions." In the 23rd international conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1143844.1143913.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shufeng Han and Qin Zhang. "Map-Based Control Functions for Autonomous Tractors." In 2001 Sacramento, CA July 29-August 1,2001. St. Joseph, MI: American Society of Agricultural and Biological Engineers, 2001. http://dx.doi.org/10.13031/2013.4122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Moreno, F., F. Arango, and R. Fileto. "Extending the map cube operator with multiple spatial aggregate functions and map overlay." In 2009 17th International Conference on Geoinformatics. IEEE, 2009. http://dx.doi.org/10.1109/geoinformatics.2009.5293401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Arif, Omar, and Patricio Antonio Vela. "Kernel map compression using generalized radial basis functions." In 2009 IEEE 12th International Conference on Computer Vision (ICCV). IEEE, 2009. http://dx.doi.org/10.1109/iccv.2009.5459351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wei, Hong, Yin Wang, George Forman, Yanmin Zhu, and Haibing Guan. "Fast Viterbi map matching with tunable weight functions." In the 20th International Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2424321.2424430.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pierzchala, Marian, and Benedykt Rodanski. "Road map representation of s-expanded symbolic network functions." In 2007 European Conference on Circuit Theory and Design (ECCTD 2007). IEEE, 2007. http://dx.doi.org/10.1109/ecctd.2007.4529732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Krishna, Prathi Raghava, Ch V. M. Surya Teja, Renuga Devi S., and Thanikaiselvan V. "A Chaos Based Image Encryption Using Tinkerbell Map Functions." In 2018 Second International Conference on Electronics, Communication and Aerospace Technology (ICECA). IEEE, 2018. http://dx.doi.org/10.1109/iceca.2018.8474891.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Zuozhi, and Santiago Ontanon. "Learning Map-Independent Evaluation Functions for Real-Time Strategy Games." In 2018 IEEE Conference on Computational Intelligence and Games (CIG). IEEE, 2018. http://dx.doi.org/10.1109/cig.2018.8490369.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

HONKANEN, Heli. "New approach to the parton distribution functions: self-organizing map." In LIGHT CONE 2008 Relativistic Nuclear and Particle Physics. Trieste, Italy: Sissa Medialab, 2009. http://dx.doi.org/10.22323/1.061.0022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lu, Bing-Xian, and Kuo-Shih Tseng. "3D Map Exploration via Learning Submodular Functions in the Fourier Domain." In 2020 International Conference on Unmanned Aircraft Systems (ICUAS). IEEE, 2020. http://dx.doi.org/10.1109/icuas48674.2020.9213891.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Map functions"

1

Blankenbeckler, Paul N., Stephen C. Livingston, Michael D. Dlubac, Nancy C. Riffe-Seckinger, Diadra N. Swinson, and Jean L. Dyer. New Skills Training Plan for Map Functions and Passage of Lines on a Soldier System. Fort Belvoir, VA: Defense Technical Information Center, July 2006. http://dx.doi.org/10.21236/ada452855.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zimmerman, Donald, Peter Raymond, and Jeffery Bennett. Should the Department of Defense Transfer the Defense Logistics Agency's Map Functions to the Defense Working Capital Fund. Fort Belvoir, VA: Defense Technical Information Center, March 2000. http://dx.doi.org/10.21236/ada377119.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lo, Gane Samb. How to use the functional empirical process for deriving asymptotic laws for functions of the sample. Arxiv, July 2016. http://dx.doi.org/10.16929/hs/imhotep.2016.x.001.

Full text
Abstract:
The functional empirical process is a very powerful tool for deriving asymptotic laws for almost any kind of statistics whenever we know how to express them into functions of the sample. Since this method seems to be applied more and more in the very recent future, this paper is intended to provide a complete but short description and justification of the method and to illustrate it with a non-trivial example using bivariate data. It may also serve for citation without repeating the arguments
APA, Harvard, Vancouver, ISO, and other styles
4

Cabral, B. K. Bidirectional Reflection Distribution Functions from surface bump maps. Office of Scientific and Technical Information (OSTI), June 1988. http://dx.doi.org/10.2172/6090983.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Marshak, Ronni. Map Ideal Customer Experiences with Cross-Functional Teams. Boston, MA: Patricia Seybold Group, April 2010. http://dx.doi.org/10.1571/me04-22-10cc.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Auerbach, E., and J. Kats. FORTRAN Code Additions for Inclusion of Special Functions in MAD. Office of Scientific and Technical Information (OSTI), April 1986. http://dx.doi.org/10.2172/1151160.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lancaster, Jack L. Brain-Map: A Database of Functional Neuroanatomy Derived from Human Brain Images. Fort Belvoir, VA: Defense Technical Information Center, February 1992. http://dx.doi.org/10.21236/ada245864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

White, Howard, Timothy Lubanga, Francis Rathinam, Roland Taremwa, Benjamin Kachero, Caroline Otike, Robert Apunyo, et al. Development evaluations in Uganda 2000–2018: A Country Evaluation Map. Centre of Excellence for Development Impact and Learning (CEDIL), June 2021. http://dx.doi.org/10.51744/cswp1.

Full text
Abstract:
'Development evaluations in Uganda 2000–2018: A Country Evaluation Map' is a CEDIL Synthesis Working Paper. It is a report on the first of its kind country evaluation map for a single country. The map identifies 617 evaluations in multiple sectors. Nearly 60 per cent of the studies contain process evaluation evidence and over 40 per cent are impact evaluations. The map helps make visible recent development evaluations from the country, identifies potential gaps in knowledge and opportunities for evidence synthesis. Users can submit studies for inclusion in the map, thus giving the map a repository function.
APA, Harvard, Vancouver, ISO, and other styles
9

Wadman, Heidi, and Jesse McNinch. Spatial distribution and thickness of fine-grained sediment along the United States portion of the upper Niagara River, New York. Engineer Research and Development Center (U.S.), August 2021. http://dx.doi.org/10.21079/11681/41666.

Full text
Abstract:
Over 220 linear miles of geophysical data, including sidescan sonar and chirp sub-bottom profiles, were collected in 2016 and 2017 by the US Army Corps of Engineers and the US Fish and Wildlife Service in the upper Niagara River. In addition, 36 sediment grab samples were collected to groundtruth the geophysical data. These data were used to map the spatial distribution of fine-grained sediment, including volume data in certain locations, along the shallow shorelines of the upper Niagara River. Overall, the most extensive deposits were spatially associated with either small tributaries or with man-made structures that modified the natural flow of the system. Extensive beds of submerged aquatic vegetation (SAV) were also mapped. Although always associated with a fine-grained matrix, the SAV beds were patchy in distribution, which might reflect subtle differences in the grain size of the sediment matrix or could simply be a function of variations in species or growth. The maps generated from this effort can be used to guide sampling plans for future studies of contamination in fine-grained sediment regions.
APA, Harvard, Vancouver, ISO, and other styles
10

Lineweaver, Charles Howe. Correlation function analysis of the COBE differential microwave radiometer sky maps. Office of Scientific and Technical Information (OSTI), August 1994. http://dx.doi.org/10.2172/10186401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Map functions' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography