Academic literature on the topic 'Action algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Action algorithms.'
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 "Action algorithms"
Fathi, Yahya, and Craig Tovey. "Affirmative action algorithms." Mathematical Programming 34, no. 3 (April 1986): 292–301. http://dx.doi.org/10.1007/bf01582232.
Full textGite, Shilpa, and Himanshu Agrawal. "Early Prediction of Driver's Action Using Deep Neural Networks." International Journal of Information Retrieval Research 9, no. 2 (April 2019): 11–27. http://dx.doi.org/10.4018/ijirr.2019040102.
Full textWu, Songjiao. "Image Recognition of Standard Actions in Sports Videos Based on Feature Fusion." Traitement du Signal 38, no. 6 (December 31, 2021): 1801–7. http://dx.doi.org/10.18280/ts.380624.
Full textMudge, Michael E., and J. P. Killingbeck. "Microcomputer Algorithms: Action for Algebra." Mathematical Gazette 76, no. 476 (July 1992): 305. http://dx.doi.org/10.2307/3619164.
Full textAbdallah, S., and V. Lesser. "A Multiagent Reinforcement Learning Algorithm with Non-linear Dynamics." Journal of Artificial Intelligence Research 33 (December 17, 2008): 521–49. http://dx.doi.org/10.1613/jair.2628.
Full textYang, Jianhua. "A Deep Learning and Clustering Extraction Mechanism for Recognizing the Actions of Athletes in Sports." Computational Intelligence and Neuroscience 2022 (March 24, 2022): 1–9. http://dx.doi.org/10.1155/2022/2663834.
Full textAbduljabbar Ali, Mohammed, Abir Jaafar Hussain, and Ahmed T. Sadiq. "Deep Learning Algorithms for Human Fighting Action Recognition." International Journal of Online and Biomedical Engineering (iJOE) 18, no. 02 (February 16, 2022): 71–87. http://dx.doi.org/10.3991/ijoe.v18i02.28019.
Full textAmir, E., and A. Chang. "Learning Partially Observable Deterministic Action Models." Journal of Artificial Intelligence Research 33 (November 20, 2008): 349–402. http://dx.doi.org/10.1613/jair.2575.
Full textChristiansen, Alan D., and Kenneth Y. Goldberg. "Comparing two algorithms for automatic planning by robots in stochastic environments." Robotica 13, no. 6 (November 1995): 565–73. http://dx.doi.org/10.1017/s0263574700018646.
Full textWu, Yuchuan, Shengfeng Qi, Feng Hu, Shuangbao Ma, Wen Mao, and Wei Li. "Recognizing activities of the elderly using wearable sensors: a comparison of ensemble algorithms based on boosting." Sensor Review 39, no. 6 (November 18, 2019): 743–51. http://dx.doi.org/10.1108/sr-11-2018-0309.
Full textDissertations / Theses on the topic "Action algorithms"
Cox, Jürgen 1970. "Solution of sign and complex action problems with cluster algorithms." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8646.
Full textIncludes bibliographical references (p. [105]-109) and index.
Two kinds of models are considered which have a Boltzmann weight which is either not real or real but not positive and so standard Monte Carlo methods are not applicable. These sign or complex action problems are solved with the help of cluster algorithms. In each case improved estimators for the Boltzmann weight are constructed which are real and positive. The models considered belong to two classes: fermionic and non-fermionic models. An example for a non-fermionic model is the Potts model approximation to QCD at non-zero baryon density. The three-dimensional three-state Potts model captures the qualitative features of this theory. It has a complex action and so the Boltzmann weight cannot be interpreted as a probability. The complex action problem is solved by using a cluster algorithm. The improved estimator for the complex phase of the Boltzmann factor is real and positive and is used for importance sampling. The first order deconfinement transition line is investigated and the universal behavior at its critical endpoint is studied.
(cont.) An example for a fermionic model with a sign problem are staggered fermions with 2 flavors in 3+1 dimensions. Here the sign is connected to the permutation sign of fermion world lines and is of nonlocal nature. Cluster flips change the topology of the fermion world lines and they have a well defined effect on the permutation sign independent of the other clusters. The sign problem is solved by suppressing those clusters whose contribution to the partition function and observables of interest would be zero. We confirm that the universal critical behavior of the finite temperature chiral phase transition is the one of the three dimensional Ising model. We also study staggered fermions with one flavor in 2+1 dimensions and confirm that the chiral phase transition then belongs to the universality class of the two dimensional Ising model.
by Jürgen Cox.
Ph.D.
Oppon, Ekow CruickShank. "Synergistic use of promoter prediction algorithms: a choice of small training dataset?" Thesis, University of the Western Cape, 2000. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_8222_1185436339.
Full textPromoter detection, especially in prokaryotes, has always been an uphill task and may remain so, because of the many varieties of sigma factors employed by various organisms in transcription. The situation is made more complex by the fact, that any seemingly unimportant sequence segment may be turned into a promoter sequence by an activator or repressor (if the actual promoter sequence is made unavailable). Nevertheless, a computational approach to promoter detection has to be performed due to number of reasons. The obvious that comes to mind is the long and tedious process involved in elucidating promoters in the &lsquo
wet&rsquo
laboratories not to mention the financial aspect of such endeavors. Promoter detection/prediction of an organism with few characterized promoters (M.tuberculosis) as envisaged at the beginning of this work was never going to be easy. Even for the few known Mycobacterial promoters, most of the respective sigma factors associated with their transcription were not known. If the information (promoter-sigma) were available, the research would have been focused on categorizing the promoters according to sigma factors and training the methods on the respective categories. That is assuming that, there would be enough training data for the respective categories. Most promoter detection/prediction studies have been carried out on E.coli because of the availability of a number of experimentally characterized promoters (+- 310). Even then, no researcher to date has extended the research to the entire E.coli genome.
Wanek, J. F. "Direct action of radiation on mummified cells : modelling of computed tomography by Monte Carlo algorithms." Thesis, University College London (University of London), 2014. http://discovery.ucl.ac.uk/1432807/.
Full textUmuhoza, Denise. "Metric of trust for mobile ad hoc networks using source routing algorithms." Thesis, University of the Western Cape, 2006. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_8946_1183465240.
Full textThis thesis proposed and presented technical details of new probabilistic metrics of trust in the links wireless ad hoc networks for unobservable communications. In covert communication networks, only the end nodes are aware of the communication characteristics of the overall path. The most widely used protocols of ad hoc networks was overviewed. The routing protocols of ad hoc networks with trust considerations and select Destination Sequence Routing, a protocol that can be used in distributed ad hoc network settings for path discovery, was also reviewed. It establishes a path through which all packets sent by a source must pass to the destination. The end nodes are responsible for examining the statistics of the received packets and deriving inferences on path feature variations which are used for computing new trust metrics. When a path is judged not trustworthy based on the metrics, the Destination Sequence Routing is informed to undertake a new trusted path discovery between the end points. The thesis added a new feature based on the quality of service parameters of the path to create trust in the links in recognition of attacks.
Brualla, Barberà Llorenç. "Path integral Monte Carlo. Algorithms and applications to quantum fluids." Doctoral thesis, Universitat Politècnica de Catalunya, 2002. http://hdl.handle.net/10803/6577.
Full textThe first part encompasses a study of the different ingredients of a PIMC code: action, sampling and physical property estimators. Particular attention has been paid to Li-Broughton's higher order approximation to the action. Regarding sampling, several collective movement methods have been derived, including the bisection algorithm, that has been thoroughly tested. We also include a study of estimators for different physical properties, such as, the energy (through the thermodynamic and virial estimators), the pair distribution function, the structure factor, and the momentum distribution.
In relation to the momentum distribution, we have developed a novel algorithm for its estimation, the trail method. It surmounts some of the problems exposed by previous approaches, such as the open chain method or McMillan's algorithm.
The Richardson extrapolation used within PIMC simulations, is another contribution of this thesis. Up until now, this extrapolation has not been used in this context. We present studies of the energy dependence on the number of "beads", along with the betterment provide by the Richardson extrapolation.
Inasmuch as our goal is to perform research of quantum liquids at finite temperature, we have produced a library of codes, written from scratch, that implement most of the features theoretically developed. The most elaborated parts of these codes are included in some of the appendixes.
The second part shows two different applications of the algorithms coded. We present results of a PIMC calculation of the momentum distribution of Ne and normal 4He at low temperatures. In the range of temperatures analysed, exchanges can be disregarded and both systems are considered Boltzmann quantum liquids. Their quantum character is well reflected in their momentum distributions witch show clear departures from the classical limit. The PIMC momentum distributions which show clear departures from the classical limit. The PIMC momentum distributions are sampled using the trail method. Kinetic energies of both systems, as a function of temperature and at a fixed density, are also reported.
Finally, the solid-liquid neon phase transition along the 35 K isotherm has been characterized.While thermodynamic properties of the solid phase are well known the behaviour of some properties, such as the energy or the dessity, during the trasition presen6 some uncertainties For example, experimental data for the place diagram, which determines solid and liquid boundaries, present sizeable differences. The temperature chosen is high enough so that Bose or Fermi statistics corrections are small, although the system is strongly quantum mechanical. The results obtained show a discontinuity in the kinetic energy during the transition.
Празднікова, Маргарита Олександрівна. "Додаток на базі Android «Кіногід» для керування контентом." Bachelor's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/34968.
Full textStructure and scope of work. The explanatory note of the diploma project consists of six sections, contains 8 figures, 5 tables, 5 appendices, 45 sources. Thesis project is dedicated to the development of an application based on Android "Kinogid". In the section analysis of existing solutions for systematization of information about film screenings will consider the existing services, their functions and shortcomings that need to be improved. The section analysis of programming languages and technologies of Android application development considers theoretical aspects of execution methods causing all possible complications and shortcomings of different systems in Android application development. Theoretical information on the topic of the diploma. The methods of application development, algorithms of actions at the set task, and also the decision of a problem which could arise are shown. The section features of the implementation of the software application for the mobile platform shows theoretical information about the algorithms that were used. In the section analysis of the application the methods of testing the application, analysis of further improvement are explained.
Stephanos, Dembe. "Machine Learning Approaches to Dribble Hand-off Action Classification with SportVU NBA Player Coordinate Data." Digital Commons @ East Tennessee State University, 2021. https://dc.etsu.edu/etd/3908.
Full textGill, Harnavpreet Singh. "Computationally Robust Algorithms for Hypoid Gear Cutting and Contact Line Determination using Ease-Off Methodology." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1587499768039312.
Full textChaaraoui, Alexandros Andre. "Vision-based Recognition of Human Behaviour for Intelligent Environments." Doctoral thesis, Universidad de Alicante, 2014. http://hdl.handle.net/10045/36395.
Full textSeita, Marcelo Ruiz. "Simulação multi agente em mercados financeiros artificiais utilizando algoritmos genéticos." reponame:Repositório Institucional do FGV, 2014. http://hdl.handle.net/10438/11936.
Full textApproved for entry into archive by JOANA MARTORINI (joana.martorini@fgv.br) on 2014-08-20T16:29:41Z (GMT) No. of bitstreams: 1 Versão_4.3.pdf: 1745536 bytes, checksum: ae0ce9636f907bd1139ff730270fa1ce (MD5)
Made available in DSpace on 2014-08-20T19:02:48Z (GMT). No. of bitstreams: 1 Versão_4.3.pdf: 1745536 bytes, checksum: ae0ce9636f907bd1139ff730270fa1ce (MD5) Previous issue date: 2014-07-29
Aiming to establish a methodology capable of segregate market’s moments and identifying investors's characteristics acting on a given financial market, this study employs simulations created by an Agent-based Artificial Financial Market, using a Genetic Algorithm to adjust such simulations to the real observed historic data. For this purpose, a Bovespa's index future contracts application was developed. This methodology could easily be extended to other financial markets by simply changing the model's parameters. Over the foundations established by Toriumi et al. (2011), significant contributions were achieved, promoting knowledge enhancements on the chosen target market, as well as on Artificial Financial Market modelling techniques, and also on the application of Genetic Algorithm into financial markets, resulting on experiments and analysis that suggest the efficacy of the methodology herein proposed.
Com o objetivo de estabelecer uma metodologia capaz segregar momentos de mercado e de identificar as características predominantes dos investidores atuantes em um determinado mercado financeiro, este trabalho emprega simulações geradas em um Mercado Financeiro Artificial baseado em agentes, utilizando um Algoritmo Genético para ajustar tais simulações ao histórico real observado. Para tanto, uma aplicação foi desenvolvida utilizando-se o mercado de contratos futuros de índice Bovespa. Esta metodologia poderia facilmente ser estendida a outros mercados financeiros através da simples parametrização do modelo. Sobre as bases estabelecidas por Toriumi et al. (2011), contribuições significativas foram atingidas, promovendo acréscimo de conhecimento acerca tanto do mercado alvo escolhido, como das técnicas de modelagem em Mercados Financeiros Artificiais e também da aplicação de Algoritmos Genéticos a mercados financeiros, resultando em experimentos e análises que sugerem a eficácia do método ora proposto.
Books on the topic "Action algorithms"
Killingbeck, J. P. Microcomputer algorithms: Action from algebra. Bristol, England: Adam Hilger, 1991.
Find full textPintér, J. Global optimization in action: Continuous and Lipschitz optimization--algorithms, implementations, and applications. Dordrecht: Kluwer Academic Publishers, 1996.
Find full textQuadflieg, Sven, Klaus Neuburg, and Simon Nestler, eds. (Dis)Obedience in Digital Societies. Bielefeld, Germany: transcript Verlag, 2022. http://dx.doi.org/10.14361/9783839457634.
Full textBiryulin, Vladimir, Aleksey None, Dar'ya Kudelina, Oleg Larin, and Anton Tancyura. Relay protection and automation systems elektroenergeticheskim. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1058880.
Full textKuo, Sen M. Active noise control systems: Algorithms and DSP implementations. New York: Wiley, 1996.
Find full textAlgoritmy preobrazhenii︠a︡: Psikhologii︠a︡ vokalʹno-st︠s︡enicheskogo perevoploshchenii︠a︡. Moskva: Kirillit︠s︡a, 2005.
Find full textJuang, Jer-Nan. Deadbeat predictive controllers. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1997.
Find full textJuang, Jer-Nan. Recursive deadbeat controller design. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1997.
Find full textMeyer, George. Dynamic forms. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1997.
Find full textMeyer, George. Dynamic forms. Moffett Field, Calif: NASA National Aeronautics and Space Administration, Ames Research Center, 1993.
Find full textBook chapters on the topic "Action algorithms"
Bergel, Alexandre. "Genetic Algorithms in Action." In Agile Artificial Intelligence in Pharo, 195–208. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5384-7_9.
Full textGochet, Paul, Pascal Gribomont, and Didier Rossetto. "Algorithms for Relevant Logic." In Logic, Thought and Action, 479–96. Dordrecht: Springer Netherlands, 2005. http://dx.doi.org/10.1007/1-4020-3167-x_21.
Full textFraczak, Wojciech. "Multi-action process algebra." In Algorithms, Concurrency and Knowledge, 126–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60688-2_40.
Full textGarcez, Artur S. d’Avila, and Luis C. Lamb. "Cognitive Algorithms and Systems: Reasoning and Knowledge Representation." In Perception-Action Cycle, 573–600. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-1452-1_18.
Full textMirjalili, Seyedali, and Andrew Lewis. "Benchmark Function Generators for Single-Objective Robust Optimisation Algorithms." In Decision Science in Action, 13–29. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0860-4_2.
Full textHaque, Shazia, Lars Kulik, and Alexander Klippel. "Algorithms for Reliable Navigation and Wayfinding." In Spatial Cognition V Reasoning, Action, Interaction, 308–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-75666-8_18.
Full textZhang, Qi. "Cognitive Algorithms and Systems of Episodic Memory, Semantic Memory, and Their Learnings." In Perception-Action Cycle, 417–48. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-1452-1_13.
Full textLima, Pedro U. "Cognitive Algorithms and Systems of Error Monitoring, Conflict Resolution and Decision Making." In Perception-Action Cycle, 473–96. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-1452-1_15.
Full textAhuactzin, Juan Manuel, El-Ghazali Talbi, Pierre Bessière, and Emmanuel Mazer. "Using genetic algorithms for robot motion planning." In Geometric Reasoning for Perception and Action, 84–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57132-9_6.
Full textFaundez-Zanuy, Marcos, Unto Laine, Gernot Kubin, Stephen McLaughlin, Bastiaan Kleijn, Gerard Chollet, Bojan Petek, and Amir Hussain. "The COST-277 European Action: An Overview." In Nonlinear Analyses and Algorithms for Speech Processing, 1–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11613107_1.
Full textConference papers on the topic "Action algorithms"
Wang, Hanmo, Xiaojun Chang, Lei Shi, Yi Yang, and Yi-Dong Shen. "Uncertainty Sampling for Action Recognition via Maximizing Expected Average Precision." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/134.
Full textPatel, Apoorva D. "Wave Algorithms: Optimal Database Search and Catalysis." In QUANTUM COMPUTING: Back Action 2006. AIP, 2006. http://dx.doi.org/10.1063/1.2400898.
Full textThomas, Oliver, Miri Zilka, Adrian Weller, and Novi Quadrianto. "An Algorithmic Framework for Positive Action." In EAAMO '21: Equity and Access in Algorithms, Mechanisms, and Optimization. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3465416.3483303.
Full textLelis, Levi H. S. "Planning Algorithms for Zero-Sum Games with Exponential Action Spaces: A Unifying Perspective." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/681.
Full textTavares, Anderson Rocha, Sivasubramanian Anbalagan, Leandro Soriano Marcolino, and Luiz Chaimowicz. "Algorithms or Actions? A Study in Large-Scale Reinforcement Learning." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/377.
Full textCOULBOIS, THIERRY. "PARTIAL ACTION OF GROUPS ON RELATIONAL STRUCTURES: A CONNECTION BETWEEN MODEL THEORY AND PROFINITE TOPOLOGY." In Semigroups, Algorithms, Automata and Languages. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812776884_0014.
Full textLiu, Fang, Feifei Qi, Xiaofen Xing, and Kailing Guo. "Simple to complex dictionary learning for action recognition." In ACAI'21: 2021 4th International Conference on Algorithms, Computing and Artificial Intelligence. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3508546.3508630.
Full textLi, Shuxin, Youzhi Zhang, Xinrun Wang, Wanqi Xue, and Bo An. "CFR-MIX: Solving Imperfect Information Extensive-Form Games with Combinatorial Action Space." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/504.
Full textLee, Greg, and Vadim Bulitko. "Genetic algorithms for action set selection across domains." In the 8th annual conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1143997.1144275.
Full textHe, Chun-Lin, and Wei Pan. "Study on human Action Recognition Algorithms in videos." In 2015 International Symposium on Computers and Informatics. Paris, France: Atlantis Press, 2015. http://dx.doi.org/10.2991/isci-15.2015.94.
Full textReports on the topic "Action algorithms"
Ozkaya, Yusuf, Erdem Sariyuce, Umit Catalyurek, and Ali Pinar. Active Betweenness Cardinality: Algorithms and Applications. Office of Scientific and Technical Information (OSTI), November 2017. http://dx.doi.org/10.2172/1733256.
Full textBodson, Marc. Adaptive Algorithms for Active Noise and Vibration Control. Fort Belvoir, VA: Defense Technical Information Center, July 2000. http://dx.doi.org/10.21236/ada390623.
Full textSadek, Fahim, and Bijan Mohraz. Semi-active control algorithms for structures with variable dampers. Gaithersburg, MD: National Institute of Standards and Technology, 1997. http://dx.doi.org/10.6028/nist.ir.6052.
Full textMintii, Iryna S., Svitlana V. Shokaliuk, Tetiana A. Vakaliuk, Mykhailo M. Mintii, and Vladimir N. Soloviev. Import test questions into Moodle LMS. [б. в.], September 2019. http://dx.doi.org/10.31812/123456789/3271.
Full textLi, Lingxi, Yaobin Chen, Renren Tian, Feng Li, Howell Li, and James R. Sturdevant. An Integrated Critical Information Delivery Platform for Smart Segment Dissemination to Road Users. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317440.
Full textSadek, Fahim, and Bijan Mohraz. A modified optimal algorithm for active structural control. Gaithersburg, MD: National Institute of Standards and Technology, 1996. http://dx.doi.org/10.6028/nist.ir.5782.
Full textPerdigão, Rui A. P. Information physics and quantum space technologies for natural hazard sensing, modelling and prediction. Meteoceanics, September 2021. http://dx.doi.org/10.46337/210930.
Full textJiang, Ruoyi, Brian Quanz, Hongliang Fei, and Jun Huan. Rail Sensor Testbed Program: Active Agents in Containers for Transport Chain Security: Algorithms. Fort Belvoir, VA: Defense Technical Information Center, March 2011. http://dx.doi.org/10.21236/ada539045.
Full textHoeiland-Joergensen, T., P. McKenney, D. Taht, J. Gettys, and E. Dumazet. The Flow Queue CoDel Packet Scheduler and Active Queue Management Algorithm. RFC Editor, January 2018. http://dx.doi.org/10.17487/rfc8290.
Full textHodgdon, Taylor, Anthony Fuentes, Jason Olivier, Brian Quinn, and Sally Shoop. Automated terrain classification for vehicle mobility in off-road conditions. Engineer Research and Development Center (U.S.), April 2021. http://dx.doi.org/10.21079/11681/40219.
Full text