Log in

Relevant bibliographies by topics / Automaton group

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Automaton group'

Author: Grafiati

Published: 4 June 2021

Last updated: 18 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 'Automaton group.'

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 "Automaton group"

1

Bocian, Stanisław. "Complexity of the characteristic semi-groups the direct products of „AG“ asynchronous automata of the strongly connected determined analogs the extensions associated with DFASC2 isomorfisms." AUTOBUSY – Technika, Eksploatacja, Systemy Transportowe 19, no. 6 (2018): 1007–11. http://dx.doi.org/10.24136/atest.2018.218.

Full text

Abstract:

The paper presents the assumption and the evidence is carried out of the direct product complexity of character-istic semi-groups of any number (“ ”) of deterministic, finite, asynchronous, highly consistent DFASC2. automata. The characteristic semi-group of the automaton interferes in the computational algorithm of the generalized homoeo-morphism of the automatons. Then determination the com-plexity of the characteristic semi-group enables to estimate the complexity of the computational generalized homoeo-morphism for the other classes of automatons. In the range of the mathematical model the

APA, Harvard, Vancouver, ISO, and other styles

2

Fedorova, M. "Faithful group actions and Schreier graphs." Carpathian Mathematical Publications 9, no. 2 (2018): 202–7. http://dx.doi.org/10.15330/cmp.9.2.202-207.

Full text

Abstract:

Each action of a finitely generated group on a set uniquely defines a labelled directed graph called the Schreier graph of the action. Schreier graphs are used mainly as a tool to establish geometrical and dynamical properties of corresponding group actions. In particilar, they are widely used in order to check amenability of different classed of groups. In the present paper Schreier graphs are utilized to construct new examples of faithful actions of free products of groups. Using Schreier graphs of group actions a sufficient condition for a group action to be faithful is presented. This resu

APA, Harvard, Vancouver, ISO, and other styles

3

Brieussel, Jérémie. "An automata group of intermediate growth and exponential activity." Journal of Group Theory 21, no. 4 (2018): 573–78. http://dx.doi.org/10.1515/jgth-2017-0046.

Full text

Abstract:

AbstractWe give a new example of an automata group of intermediate growth. It is generated by an automaton with four states on an alphabet with eight letters. This automata group has exponential activity and its limit space is not simply connected.

APA, Harvard, Vancouver, ISO, and other styles

4

TORBEY, SAMI. "TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA." Parallel Processing Letters 19, no. 01 (2009): 73–83. http://dx.doi.org/10.1142/s0129626409000079.

Full text

Abstract:

The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely difficult, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this paper, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the s

APA, Harvard, Vancouver, ISO, and other styles

5

ELDER, MURRAY, MARK KAMBITES, and GRETCHEN OSTHEIMER. "ON GROUPS AND COUNTER AUTOMATA." International Journal of Algebra and Computation 18, no. 08 (2008): 1345–64. http://dx.doi.org/10.1142/s0218196708004901.

Full text

Abstract:

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of rank n; this result, which answers a question of Gilman, is in a very precise sense an abelian analogue of the Muller–Schupp theorem. More generally, if G is a virtually abelian group then every group with word problem recognized by a G-automaton is virtually abelian with growth class bounded above by the growth class of G. We consider also other types of cou

APA, Harvard, Vancouver, ISO, and other styles

6

SILVA, P. V., and B. STEINBERG. "ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS." International Journal of Algebra and Computation 15, no. 05n06 (2005): 1213–34. http://dx.doi.org/10.1142/s0218196705002761.

Full text

Abstract:

We study automata groups generated by reset automata. Every lamplighter group ℤ/nℤ wr ℤ can be generated by such an automaton, and in general these automata groups are similar in nature to lamplighters: they are amenable locally-finite-by-cyclic groups; under mild decidable conditions, the semigroups generated by such automata are free. Parabolic subgroups and fractal properties are considered.

APA, Harvard, Vancouver, ISO, and other styles

7

D’Angeli, Daniele, Thibault Godin, Ines Klimann, Matthieu Picantin, and Emanuele Rodaro. "Boundary dynamics for bireversible and for contracting automaton groups." International Journal of Algebra and Computation 30, no. 02 (2019): 431–49. http://dx.doi.org/10.1142/s021819672050006x.

Full text

Abstract:

We study the dynamics of the action of an automaton group on the set of infinite words, and more precisely the discontinuous points of the map which associates to a point its set of stabilizers — the singular points. We show that, for any Mealy automaton, the set of singular points has measure zero. Then we focus our attention on several classes of automata. We characterize those contracting automata generating groups without singular points, and apply this characterization to the Basilica group. We prove that potential examples of reversible automata generating infinite groups without singula

APA, Harvard, Vancouver, ISO, and other styles

8

JÜRGENSEN, HELMUT, and PAULINE KRAAK. "SOLITON AUTOMATA BASED ON TREES." International Journal of Foundations of Computer Science 18, no. 06 (2007): 1257–70. http://dx.doi.org/10.1142/s0129054107005303.

Full text

Abstract:

Soliton automata are a mathematical model for molecular switching devices. For even the simple case of soliton automata based on trees the behaviour is not known. For example, only two examples of such soliton automata were known the transition monoid of which is not the symmetric group on the set of states; and in these cases the transition monoid is the corresponding alternating group. We establish new bounds on the number of states of a tree-based soliton automaton and a sufficient condition for when the transition monoid of such a soliton automaton consists only of even permutations of the

APA, Harvard, Vancouver, ISO, and other styles

9

Klimann, Ines, Matthieu Picantin, and Dmytro Savchuk. "A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group." International Journal of Foundations of Computer Science 29, no. 02 (2018): 297–314. http://dx.doi.org/10.1142/s0129054118400087.

Full text

Abstract:

The class of automaton groups is a rich source of the simplest examples of infinite Burnside groups. However, all such examples have been constructed as groups generated by non-reversible automata. Moreover, it was recently shown that 2-state reversible Mealy automata cannot generate infinite Burnside groups. Here we extend this result to connected 3-state reversible Mealy automata, using new original techniques. The results rely on a fine analysis of associated orbit trees and a new characterization of the existence of elements of infinite order.

APA, Harvard, Vancouver, ISO, and other styles

10

ÉSIK, ZOLTÁN. "Equational axioms associated with finite automata for fixed point operations in cartesian categories." Mathematical Structures in Computer Science 27, no. 1 (2015): 54–69. http://dx.doi.org/10.1017/s0960129515000031.

Full text

Abstract:

The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and identities associated with finite automata. We show that the Conway identities and the identities associated with the members of a subclass $\mathcal{Q}$ of finite automata is complete for iteration categories iff for every finite simple group G there is an automaton Q ∈ $\mathcal{Q}$ such that G is a quotient of a group in the monoid M(Q) of the automaton Q.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Automaton group"

1

Wellen, George Arthur. "Branch groups and automata." Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:b0be5468-cce9-421b-85be-c386d7c3808a.

Full text

Abstract:

The focus of this thesis is finitely generated subgroups of the automorphism group of an infinite spherically homogeneous rooted tree (regular or irregular). The first chapter introduces the topic and outlines the main results. The second chapter provides definitions of the terminology used, and also some preliminary results. The third chapter introduces a group that appears to be a promising candidate for a finitely generated group of infinite upper rank with finite upper $p$-rank for all primes $p$. It goes on to demonstrate that in fact this group has infinite upper $p$-rank for all primes

APA, Harvard, Vancouver, ISO, and other styles

2

Muntyan, Yevgen. "Automata groups." [College Station, Tex. : Texas A&M University, 2009. http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-751.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hoffmann, Michael. "Automatic semigroups." Thesis, University of Leicester, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366330.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wakefield, Paul. "Procedures for automatic groups." Thesis, University of Newcastle Upon Tyne, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388650.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hillier, Jonathan George. "Generalisations of automatic groups." Thesis, University of York, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gill, David Michael. "Automatic theorem proving programs and group presentations." Thesis, University of St Andrews, 1995. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jones, Simon. "Automating group-based privacy control in social networks." Thesis, University of Bath, 2012. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.629649.

Full text

Abstract:

Users of social networking services such as Facebook often want to manage the sharing of information and content with diﬀerent groups of people based on their diﬀering relationships. The growing popularity of such services has meant that users are increasingly faced with the copresence of diﬀerent groups associated with diﬀerent aspects of their lives, within their network of contacts. However, few users are utilising the group-based privacy controls provided to them by the SNS provider. In this thesis we examine the reasons behind the lack of use of group-based privacy controls, ﬁnding that i

APA, Harvard, Vancouver, ISO, and other styles

8

Love, Kerry Routenberg 1977. "Automated synthesis of the Lewis blood group oligosaccharides." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17827.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Chemistry, 2004.<br>Vita.<br>Includes bibliographical references.<br>Cell-surface carbohydrates are markers of specific cell types. These oligosaccharides are involved in recognition, adhesion, and signal transduction events. Advances in molecular glycobiology rely heavily on straightforward access to structurally defined oligosaccharides, but traditional syntheses of complex carbohydrates have been very laborious. Development of a novel linker and monitoring of each glycosylation reaction during automated solid-phase oligosaccha

APA, Harvard, Vancouver, ISO, and other styles

9

Oliver, Graham. "Automatic presentations of groups and semigroups." Thesis, University of Leicester, 2006. http://hdl.handle.net/2381/30105.

Full text

Abstract:

Effectively deciding the satisfiability of logical sentences over structures is an area well-studied in the case of finite structures. There has been growing work towards considering this question for infinite structures. In particular the theory of automatic structures, considered here, investigates structures representable by finite automata. The closure properties of finite automata lead naturally to algorithms for deciding satisfiability for some logics. The use of finite automata to investigate infinite structures has been inspired by the interplay between the theory of finite automata an

APA, Harvard, Vancouver, ISO, and other styles

10

Yuan, Ming. "An Automatic Classifcation Approach to Idea Organization in Group Support Systems." Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/195266.

Full text

Abstract:

With the rapid advance of information technologies, human beings increasingly rely on computers to accumulate, process, and make use of data. Knowledge discovery techniques have been proposed to automatically search large volumes of data for patterns.Group Support Systems (GSS) play an important role in streamlining group activities and improving group outcomes. Various attempts have been made to help automate several tasks in group activities under GSS environment. One of the approaches is to apply automatic approach to idea organization task in GSS.This research designed and tested an SVD-en

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Automaton group"

1

Hofer, Gerhard. Near-rings and group-automata. VWGÖ, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

(Michel), Coornaert M., ed. Cellular automata and groups. Springer, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ceccherini-Silberstein, Tullio, and Michel Coornaert. Cellular Automata and Groups. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14034-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

1949-, Gunnarsson Evy, ed. Group organised work in the automated office. Gower, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Institute, Textile. Automation: Promise and practice : Textile Institute Yarn Group Conference. Textile Institute, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Schreiber, Robert. Automatic blocking of nested loops. Research Institute for Advanced Computer Science, NASA Ames Research Center, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Great Britain. Working Group on Automated Vote Counting. Report of the Working Group on Automated Vote Counting. Home Office, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

European Group of University Teachers for Industrial Management Meeting. Design of organisational structures, work systems and man-machine-interaction: Proceedings of the 20th Meeting of the EHTB-Group, Karlsruhe, May 14-17, 1998. Shaker, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

A course in formal languages, automata and groups. Springer, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Cadieux, Jean. Implementation of office automation in a target group: Summary of research report. Canadian Workplace Automation Research Centre, Organizational Research Directorate, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Automaton group"

1

Seitz, Michael, Gerta Köster, and Alexander Pfaffinger. "Pedestrian Group Behavior in a Cellular Automaton." In Pedestrian and Evacuation Dynamics 2012. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-02447-9_67.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Klimann, Ines, Matthieu Picantin, and Dmytro Savchuk. "A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group." In Developments in Language Theory. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21500-6_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Zifeng, Li Ruan, Limin Xiao, Yao Zheng, and Yunfan Dong. "Distributed Train-Group Modeling and Simulation Based on Cellular Automaton and Multi-agent." In Artificial Intelligence and Computational Intelligence. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23881-9_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bartholdi, Laurent, and Pedro Silva. "Groups defined by automata." In Handbook of Automata Theory. European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bartholdi, Laurent, and Pedro Silva. "Rational subsets of groups." In Handbook of Automata Theory. European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Vakharia, Asoo J., and Hassan M. Selim. "Group Technology." In Handbook of Design, Manufacturing and Automation. John Wiley & Sons, Inc., 2007. http://dx.doi.org/10.1002/9780470172452.ch22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Salo, Ville, and Ilkka Törmä. "Group-Walking Automata." In Cellular Automata and Discrete Complex Systems. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47221-7_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Trolin, Mårten, and Douglas Wikström. "Hierarchical Group Signatures." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11523468_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kremer, Steve, Antoine Mercier, and Ralf Treinen. "Proving Group Protocols Secure Against Eavesdroppers." In Automated Reasoning. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-71070-7_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Delaune, Stéphanie, Steve Kremer, and Daniel Pasaila. "Security Protocols, Constraint Systems, and Group Theories." In Automated Reasoning. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31365-3_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Automaton group"

1

Rost, Krzysztof. "Automaton." In SIGGRAPH '20: Special Interest Group on Computer Graphics and Interactive Techniques Conference. ACM, 2020. http://dx.doi.org/10.1145/3368827.3385852.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bharathi, S. Jeya, and A. Jeyanthi. "Commutative Finite State Automaton Group (FSAG) Having Cycles over the Binary Alphabet." In 2014 International Conference on Soft Computing & Machine Intelligence (ISCMI). IEEE, 2014. http://dx.doi.org/10.1109/iscmi.2014.35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Uskenbayeva, R. K., A. A. Kuandykov, Young Im Cho, D. K. Kozhamzharova, and Zh B. Kalpeyeva. "Models and methods of joint work management of group of unmanned vehicles." In 2013 13th International Conference on Control, Automaton and Systems (ICCAS 2013). IEEE, 2013. http://dx.doi.org/10.1109/iccas.2013.6704000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Yifan, Masaki Nakamura, and Kazutoshi Sakakibara. "Modeling an Autonomous Vehicle Group Control System as a Hybrid Automaton and its Specification and Verification in Rewriting Logic." In 2021 36th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC). IEEE, 2021. http://dx.doi.org/10.1109/itc-cscc52171.2021.9501418.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tan, Taide, and Zhao Liu. "Stochastic Modeling on the Emotional Contagion." In ASME 2014 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/imece2014-36135.

Full text

Abstract:

The effects of emotional contagion between leader and followers have been proven of great importance, especially on the outcomes and the working efficiency. The mechanisms of the multi level emotional infections have been analyzed. The stochastic modeling methods on emotional contagion have been reviewed. The advantages and disadvantages have been compared between these methods. A novel stochastic model based on cellular automaton (CA) has been presented. The initial results have been shown and the simulation demonstrated the CA model is one of the ideal tools for the estimation of emotional c

APA, Harvard, Vancouver, ISO, and other styles

6

"Automation - Working Group." In IEEE-IAS/PCA 2004 Cement Industry Technical Conference. IEEE, 2004. http://dx.doi.org/10.1109/citcon.2004.1309866.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wentzky, Chase, and Joshua D. Summers. "Individual Differences in Describing Levels of Automation." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22102.

Full text

Abstract:

Abstract Level of automation (LoA) is increasingly recognized as an important principle in improving manufacturing strategies. However, many automation decisions are made without formally assessing LoA and can be made based on a host of organizational factors, like varied mental models used by managers in decision-making. In this study, respondents (N = 186) were asked to watch five different assembly tasks being completed in an automotive manufacturing environment, and then identify “how automated” or “how manual” they perceived the task to be. Responses were given using a visual analogue sca

APA, Harvard, Vancouver, ISO, and other styles

8

Srikantappa, A. B., and R. H. Crawford. "Intermediate Geometric and Interfeature Relationships for Automatic Group Technology Part Coding." In ASME 1992 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/cie1992-0030.

Full text

Abstract:

Abstract Group Technology (GT) is a manufacturing philosophy in which similar parts are grouped together to take advantage of their similarities. GT is implemented with a representation that summarizes the important design and manufacturing features of a part in terms of an alphanumeric code. Automated GT coding relies on a complete geometric description of the part, along with a description of the high level manufacturing features such as slots, holes and pockets, and the spatial relationships between these features. A strategy for the representation and manipulation of interacting and interf

APA, Harvard, Vancouver, ISO, and other styles

9

Hua, Z., and J. K. Hai. "A Note on the Normalizer Property for Integral Group Rings of Finite Groups." In 2015 International Conference on Electrical, Automation and Mechanical Engineering. Atlantis Press, 2015. http://dx.doi.org/10.2991/eame-15.2015.167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bojanczyk, Mikolaj, Bartek Klin, and Slawomir Lasota. "Automata with Group Actions." In 2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011). IEEE, 2011. http://dx.doi.org/10.1109/lics.2011.48.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Automaton group"

1

Boardman, Beth, Scott Semanision, and Dustin Bittner. Overview of the Process Automation and Control Group (E-3). Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1813834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wendelberger, James G. Automated Image Analysis Corrosion Working Group Update: February 1, 2018. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1419731.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

van den Pol-van Dasselaar, A., A. de Vlieger, D. Hennesy, J. Isselstein, and J. L. Peyraud. Grazing and automation : proceedings 4th Meeting EGF Working Group "Grazing" in Wageningen. Wageningen Livestock Research, 2016. http://dx.doi.org/10.18174/402122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cook, Stephen, and Loyd Hook. Developmental Pillars of Increased Autonomy for Aircraft Systems. ASTM International, 2020. http://dx.doi.org/10.1520/tr2-eb.

Full text

Abstract:

Increased automation for aircraft systems holds the promise to increase safety, precision, and availability for manned and unmanned aircraft. Specifically, established aviation segments, such as general aviation and light sport, could utilize increased automation to make significant progress towards solving safety and piloting difficulties that have plagued them for some time. Further, many emerging market segments, such as urban air mobility and small unmanned (e.g., small parcel delivery with drones) have a strong financial incentive to develop increased automation to relieve the pilot workl

APA, Harvard, Vancouver, ISO, and other styles

5

Gaponenko, Artiom, and Andrey Golovin. Electronic magazine with rating system of an estimation of individual and collective work of students. Science and Innovation Center Publishing House, 2017. http://dx.doi.org/10.12731/er0043.06102017.

Full text

Abstract:

«The electronic magazine with rating system of an estimation of individual and collective work of students» (EM) is developed in document Microsoft Excel with use of macros. EM allows to automate all the calculated operations connected with estimation of amount scored by students in each form of the current control. EM provides automatic calculation of rating of the student with reflection of a maximum quantity of the points received in given educational group. The rating equal to “1” is assigned to the student who has got a maximum quantity of points for the certain date. For the other studen

APA, Harvard, Vancouver, ISO, and other styles

6

Kolodzy, P. J., and J. E. Baum. Logical Implementation of the Automatic Target Recognition Working Group (ATRWG) 9-Track Tape Format Image Storage Format. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada236627.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ramesh, K. S. CRADA with the Belhaven group and Pacific Northwest National Laboratory (PNL-081): Automated soil moisture measuring systems. Final project report. Office of Scientific and Technical Information (OSTI), 1996. http://dx.doi.org/10.2172/385385.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Edwards, Darrin C., Charles E. Metz, and Maryellen L. Giger. Investigation of Three-Group Classifiers to Fully Automate Detection and Classification of Breast Lesions in an Intelligent CAD Mammography Workstation. Defense Technical Information Center, 2007. http://dx.doi.org/10.21236/ada472082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chung, Juwon, Jooyeon Lee, Jinhee Park, and Yunja Nam. An Analysis of the Difference between Direct and Automated Anthropometric Measurement Using a 3-D Tool for the Age Group of 70-85 Elderly. Iowa State University, Digital Repository, 2016. http://dx.doi.org/10.31274/itaa_proceedings-180814-1712.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ghanipoor Machiani, Sahar, Aryan Sohrabi, and Arash Jahangiri. Impact of Regular and Narrow AV-Exclusive Lanes on Manual Driver Behavior. Mineta Transportation Institute, 2020. http://dx.doi.org/10.31979/mti.2020.1922.

Full text

Abstract:

This study attempts to answer the question of how a narrow (9-ft) lane dedicated to Automated Vehicles (AVs) would affect the behavior of drivers in the adjacent lane to the right. To this end, a custom driving simulator environment was designed mimicking the Interstate 15 smart corridor in San Diego. A group of participants was assigned to drive next to the simulated 9-ft narrow lane while a control group was assigned to drive next to a regular 12-ft AV lane. Driver behavior was analyzed by measuring the mean lane position, mean speed, and mental effort (self-reported/subjective measure). In

APA, Harvard, Vancouver, ISO, and other styles

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!