Готові списки джерел за темами / Lucid (Computer program language)

Добірка наукової літератури з теми "Lucid (Computer program language)"

Автор: Grafiati
Опубліковано: 4 червня 2021
Оновлено: 31 січня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Lucid (Computer program language)".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Lucid (Computer program language)"

1

Loehr, Devon, and David Walker. "Safe, modular packet pipeline programming." Proceedings of the ACM on Programming Languages 6, POPL (January 16, 2022): 1–28. http://dx.doi.org/10.1145/3498699.

Повний текст джерела
Анотація:
The P4 language and programmable switch hardware, like the Intel Tofino, have made it possible for network engineers to write new programs that customize operation of computer networks, thereby improving performance, fault-tolerance, energy use, and security. Unfortunately, possible does not mean easy —there are many implicit constraints that programmers must obey if they wish their programs to compile to specialized networking hardware. In particular, all computations on the same switch must access data structures in a consistent order, or it will not be possible to lay that data out along the switch’s packet-processing pipeline. In this paper, we define Lucid 2.0, a new language and type system that guarantees programs access data in a consistent order and hence are pipeline-safe . Lucid 2.0 builds on top of the original Lucid language, which is also pipeline-safe, but lacks the features needed for modular construction of data structure libraries. Hence, Lucid 2.0 adds (1) polymorphism and ordering constraints for code reuse; (2) abstract, hierarchical pipeline locations and data types to support information hiding; (3) compile-time constructors, vectors and loops to allow for construction of flexible data structures; and (4) type inference to lessen the burden of program annotations. We develop the meta-theory of Lucid 2.0, prove soundness, and show how to encode constraint checking as an SMT problem. We demonstrate the utility of Lucid 2.0 by developing a suite of useful networking libraries and applications that exploit our new language features, including Bloom filters, sketches, cuckoo hash tables, distributed firewalls, DNS reflection defenses, network address translators (NATs) and a probabilistic traffic monitoring service.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

BECK, JARRYD P., JOHN PLAICE, and WILLIAM W. WADGE. "Multidimensional infinite data in the language Lucid." Mathematical Structures in Computer Science 25, no. 7 (November 10, 2014): 1546–68. http://dx.doi.org/10.1017/s0960129513000388.

Повний текст джерела
Анотація:
Although the language Lucid was not originally intended to support computing with infinite data structures, the notion of (infinite) sequence quickly came to the fore, together with a demand-driven computation model in which demands are propagated for the values of particular values at particular index points. This naturally generalized to sequences of multiple dimensions so that a programmer could, for example, write a program that could be understood as a (nonterminating) loop in which one of the loop variables is an infinite vector.Programmers inevitably found use for more and more dimensions, which led to a problem which is fully solved for the first time in this paper. The problem is that the implementation's cache requires some estimate of the dimensions actually used to compute a value being fetched. This estimate can be difficult or (if dimensions are passed as parameters) impossible to obtain, and the demand-driven evaluation model for Lucid breaks down.We outline the evolution of Lucid which gave rise to this problem, and outline the solution, as used for the implementation of TransLucid, the latest descendant of Lucid.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Faustini, A. A., and W. W. Wadge. "An eductive interpreter for the language Lucid." ACM SIGPLAN Notices 22, no. 7 (July 1987): 86–91. http://dx.doi.org/10.1145/960114.29659.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Kirschenbaum, Matthew. "Lucid Mapping: Information Landscaping and Three-Dimensional Writing Spaces." Leonardo 32, no. 4 (August 1999): 261–68. http://dx.doi.org/10.1162/002409499553406.

Повний текст джерела
Анотація:
This paper documents an interactive graphics installation entitled Lucid Mapping and Codex Transformissions in the Z-Buffer. Lucid Mapping uses the Virtual Reality Modeling Language to explore textual and narrative possibilities within three-dimensional (3D) electronic environments. The author describes the creative rationale and technical design of the work and places it within the context of other applications of 3D text and typography in the digital arts and the scientific visualization communities. The author also considers the implications of 3D textual environments on visual language and communication, and discriminates among a range of different visual/ rhetorical strategies that such environments can sustain.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Karn, Helen E., and MacEnglish. "Pronunciation Plus (Computer Program)." TESOL Quarterly 30, no. 1 (1996): 176. http://dx.doi.org/10.2307/3587618.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Solomon, Gabriela R., and Ford Language Institute. "The American Accent Program (Computer Program, Version 4.0)." TESOL Quarterly 27, no. 4 (1993): 774. http://dx.doi.org/10.2307/3587425.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

McMinn, Mark R., and James D. Foster. "A Computer Program to Teach Nonsexist Language." Teaching of Psychology 18, no. 2 (April 1991): 115–17. http://dx.doi.org/10.1207/s15328023top1802_16.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Reps and Teitelbaum. "Language Processing in Program Editors." Computer 20, no. 11 (November 1987): 29–40. http://dx.doi.org/10.1109/mc.1987.1663414.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Yalcin, Hatice, and Murat Demirekin. "Training Program Supporting Language Acquisition." International Journal of Modern Education and Computer Science 13, no. 3 (June 8, 2021): 1–12. http://dx.doi.org/10.5815/ijmecs.2021.03.01.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Baniassad, Elisa, and Clayton Myers. "An exploration of program as language." ACM SIGPLAN Notices 44, no. 10 (October 25, 2009): 547–56. http://dx.doi.org/10.1145/1639949.1640132.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Lucid (Computer program language)"

1

Wendelborn, Andrew Lawrence. "Data flow implementations of a lucid-like programming language." Title page, contents and summary only, 1985. http://web4.library.adelaide.edu.au/theses/09PH/09phw471.pdf.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Shepherd, David. "Natural language program analysis combining natural language processing with program analysis to improve software maintenance tools /." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 176 p, 2007. http://proquest.umi.com/pqdweb?did=1397920371&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Chou, Robert Shih-pei. "A program design language for COBOL." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/13200.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Richardson, Joel E. "E a persistent systems implementation language /." Madison, Wis. : University of Wisconsin-Madison, Computer Sciences Dept, 1989. http://catalog.hathitrust.org/api/volumes/oclc/20839601.html.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Gordon, Christopher Todd. "A visual language for ADA program unit specifications." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06232009-063007/.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Martin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Yessenov, Kuat T. "A lightweight specification language for bounded program verification." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53184.

Повний текст джерела
Анотація:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63-64).
This thesis presents a new light-weight specification language called JForge Specification Language (JFSL) for object-oriented languages such as Java. The language is amenable to bounded verification analysis by a tool called JForge that interprets JFSL specifications, fully integrates with a mainstream development environment, and assists programmers in examining counter example traces and debugging specifications. JFSL attempts to address challenges of specification languages such as inheritance, frame conditions, dynamic dispatch, and method calls inside specifications in the context of bounded verification. A collection of verification tasks illustrates the expressiveness and conciseness of JForge specifications and demonstrates effectiveness of the bounded verification technique.
by Kuat T. Yessenov.
M.Eng.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Leoutsarakos, Nikolaos. "A context sensitive command language /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63274.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Gibson, Barbara Brunner. "Ada as a design specification language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10215.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Ouren, Leslie Serine. "Integrating computer software within the Houghton Mifflin Language Arts program." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2918.

Повний текст джерела
Анотація:
This project was created for third grade teachers who use the Houghton Mifflin Language Arts series and want to integrate computer software into their writing curriculum. The website created includes all the writing assignments that the students are to complete and the required software used to complete the assignment.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Lucid (Computer program language)"

1

A, Ashcroft Edward, ed. Lucid, the dataflow programming language. London: Academic Press, 1985.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Olga, Pekelny, ed. Computer language C. San Diego: Harcourt Brace Jovanovich, 1989.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Reid, Glenn C. PostScript language program design. Reading, Mass: Addison-Wesley, 1988.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Systems, Adobe, ed. PostScript language reference. 3rd ed. Reading, Mass: Addison-Wesley, 1999.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Inc, Apple Computer, ed. HyperCard script language guide: The HyperTalk language. Reading, Mass: Addison-Wesley, 1988.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Deitel, Harvey M. C: How to program. 6th ed. Upper Saddle River, N.J: Pearson Prentice Hall, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

1945-, Deitel Harvey M., and Deitel Abbey, eds. C: How to program. Upper Saddle River: Pearson, 2012.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

C: How to program. 6th ed. Upper Saddle River, N.J: Pearson Prentice Hall, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Johnston, Howard. Learning to program. Englewood Cliffs, NJ: Prentice/Hall International, 1985.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

1945-, Deitel Harvey M., and Deitel Harvey M. 1945-, eds. C++: How to program. 7th ed. Upper Saddle River, NJ: Pearson Prentice Hall, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Lucid (Computer program language)"

1

Weik, Martin H. "language program." In Computer Science and Communications Dictionary, 871. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_9931.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Weik, Martin H. "program design language." In Computer Science and Communications Dictionary, 1347. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_14835.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Craven, Paul Vincent. "What Is a Computer Language?" In Program Arcade Games, 33–40. Berkeley, CA: Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-1790-0_3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Volpano, Dennis, and Geoffrey Smith. "Language Issues in Mobile Program Security." In Lecture Notes in Computer Science, 25–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-68671-1_3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Harf, Mait, Kristiina Kindel, Vahur Kotkas, Peep Küngas, and Enn Tyugu. "Automated Program Synthesis for Java Programming Language." In Lecture Notes in Computer Science, 157–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45575-2_17.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Roșu, Grigore. "From Rewriting Logic, to Programming Language Semantics, to Program Verification." In Lecture Notes in Computer Science, 598–616. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23165-5_28.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Kobayashi, Naoki. "Higher-Order Program Verification and Language-Based Security." In Advances in Computer Science - ASIAN 2009. Information Security and Privacy, 17–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10622-4_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Dimock, Allyn, Ian Westmacott, Robert Muller, Franklyn Turbak, J. B. Wells, and Jeffrey Considine. "Program Representation Size in an Intermediate Language with Intersection and Union Types." In Lecture Notes in Computer Science, 27–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45332-6_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Sridhar, S. "An implementation of OBJ2: An object-oriented language for abstract program specification." In Lecture Notes in Computer Science, 81–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-17179-7_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Doveri, Kyveli, Pierre Ganty, and Nicolas Mazzocchi. "FORQ-Based Language Inclusion Formal Testing." In Computer Aided Verification, 109–29. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13188-2_6.

Повний текст джерела
Анотація:
Abstract We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSpace-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discarding candidates which are subsumed by others for the quasiorder. Discarded candidates are guaranteed to not compromise the completeness of the algorithm. The novelty of our work lies in the quasiorder used to discard candidates. We introduce FORQs (family of right quasiorders) that we obtain by adapting the notion of family of right congruences put forward by Maler and Staiger in 1993. We define a FORQ-based inclusion algorithm which we prove correct and instantiate it for a specific FORQ, called the structural FORQ, induced by the Büchi automaton to the right of the inclusion sign. The resulting implementation, called Forklift, scales up better than the state-of-the-art on a variety of benchmarks including benchmarks from program verification and theorem proving for word combinatorics. Artifact:https://doi.org/10.5281/zenodo.6552870
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Lucid (Computer program language)"

1

Yang, Xiaoli, Rong Ge, and Charles Tseng. "Visualizing genetic recombination with interactive computer program." In 2010 International Conference on Audio, Language and Image Processing (ICALIP). IEEE, 2010. http://dx.doi.org/10.1109/icalip.2010.5685128.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Kim, Sung-Hun, Jin-Tak Choi, and Kil-Hong Joo. "Development of Cyber Sign Language Interpreting App Program for Deaf." In Next Generation Computer and Information Technology 2017. Science & Engineering Research Support soCiety, 2017. http://dx.doi.org/10.14257/astl.2017.145.03.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Ling, Xiang, Guoqing Wu, and Bo Huang. "Comparing program to requirement and design using language acceptance." In 2012 2nd International Conference on Computer Science and Network Technology (ICCSNT). IEEE, 2012. http://dx.doi.org/10.1109/iccsnt.2012.6525961.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Qin, Yi, and Guonian Wang. "A computer-aided Chinese pronunciation training program for English-speaking learners." In 2014 International Conference on Asian Language Processing (IALP). IEEE, 2014. http://dx.doi.org/10.1109/ialp.2014.6973499.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Menotti, Ricardo, Joao M. P. Cardoso, Marcio M. Fernandes, and Eduardo Marques. "LALP: A Novel Language to Program Custom FPGA-Based Architectures." In 2009 21st International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). IEEE, 2009. http://dx.doi.org/10.1109/sbac-pad.2009.23.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Qin, Weida, Yinhu Wei, and Ricai Luo. "Program Design and Implementation of Y Class Matrix Eigenvalue Based on Python Language." In 2022 Asia-Pacific Computer Technologies Conference (APCT). IEEE, 2022. http://dx.doi.org/10.1109/apct55107.2022.00022.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Dovhopolova, Hanna. "COMPUTER PROGRAM AS A METHOD OF DEVELOPING STUDENTS’ FOREIGN LANGUAGE COMMUNICATION SKILLS." In THEORETICAL AND EMPIRICAL SCIENTIFIC RESEARCH: CONCEPT AND TRENDS. European Scientific Platform, 2020. http://dx.doi.org/10.36074/24.07.2020.v3.02.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Jin, Yuqiang, Yuliang Chen, Zijian Lin, and Junwei Lei. "Research on PID control and Simulation with M Language of Matlab Program." In 2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 2016). Paris, France: Atlantis Press, 2016. http://dx.doi.org/10.2991/icence-16.2016.98.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Yu-ping Yang, Li-yan Zhang, Chun-ying Wu, and Lie Cao. "Teaching method and practice about the course of program language design in college." In 2010 2nd International Conference on Education Technology and Computer (ICETC). IEEE, 2010. http://dx.doi.org/10.1109/icetc.2010.5529385.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Jiang, Yinjian, and Jianhua Zhao. "Designing a Team Teaching Program for Language Teaching and Learning: A Case Study." In 2009 First International Workshop on Education Technology and Computer Science. IEEE, 2009. http://dx.doi.org/10.1109/etcs.2009.446.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Lucid (Computer program language)"

1

Makhachashvili, Rusudan K., Svetlana I. Kovpik, Anna O. Bakhtina, and Ekaterina O. Shmeltser. Technology of presentation of literature on the Emoji Maker platform: pedagogical function of graphic mimesis. [б. в.], July 2020. http://dx.doi.org/10.31812/123456789/3864.

Повний текст джерела
Анотація:
The article deals with the technology of visualizing fictional text (poetry) with the help of emoji symbols in the Emoji Maker platform that not only activates students’ thinking, but also develops creative attention, makes it possible to reproduce the meaning of poetry in a succinct way. The application of this technology has yielded the significance of introducing a computer being emoji in the study and mastering of literature is absolutely logical: an emoji, phenomenologically, logically and eidologically installed in the digital continuum, is separated from the natural language provided by (ethno)logy, and is implicitly embedded into (cosmo)logy. The technology application object is the text of the twentieth century Cuban poet José Ángel Buesa. The choice of poetry was dictated by the appeal to the most important function of emoji – the expression of feelings, emotions, and mood. It has been discovered that sensuality can reconstructed with the help of this type of meta-linguistic digital continuum. It is noted that during the emoji design in the Emoji Maker program, due to the technical limitations of the platform, it is possible to phenomenologize one’s own essential-empirical reconstruction of the lyrical image. Creating the image of the lyrical protagonist sign, it was sensible to apply knowledge in linguistics, philosophy of language, psychology, psycholinguistics, literary criticism. By constructing the sign, a special emphasis was placed on the facial emogram, which also plays an essential role in the transmission of a wide range of emotions, moods, feelings of the lyrical protagonist. Consequently, the Emoji Maker digital platform allowed to create a new model of digital presentation of fiction, especially considering the psychophysiological characteristics of the lyrical protagonist. Thus, the interpreting reader, using a specific digital toolkit – a visual iconic sign (smile) – reproduces the polylaterial metalinguistic multimodality of the sign meaning in fiction. The effectiveness of this approach is verified by the poly-functional emoji ousia, tested on texts of fiction.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Striuk, Andrii M., and Serhiy O. Semerikov. The Dawn of Software Engineering Education. [б. в.], February 2020. http://dx.doi.org/10.31812/123456789/3671.

Повний текст джерела
Анотація:
Designing a mobile-oriented environment for professional and practical training requires determining the stable (fundamental) and mobile (technological) components of its content and determining the appropriate model for specialist training. In order to determine the ratio of fundamental and technological in the content of software engineers’ training, a retrospective analysis of the first model of training software engineers developed in the early 1970s was carried out and its compliance with the current state of software engineering development as a field of knowledge and a new the standard of higher education in Ukraine, specialty 121 “Software Engineering”. It is determined that the consistency and scalability inherent in the historically first training program are largely consistent with the ideas of evolutionary software design. An analysis of its content also provided an opportunity to identify the links between the training for software engineers and training for computer science, computer engineering, cybersecurity, information systems and technologies. It has been established that the fundamental core of software engineers’ training should ensure that students achieve such leading learning outcomes: to know and put into practice the fundamental concepts, paradigms and basic principles of the functioning of language, instrumental and computational tools for software engineering; know and apply the appropriate mathematical concepts, domain methods, system and object-oriented analysis and mathematical modeling for software development; put into practice the software tools for domain analysis, design, testing, visualization, measurement and documentation of software. It is shown that the formation of the relevant competencies of future software engineers must be carried out in the training of all disciplines of professional and practical training.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Markova, Oksana, Serhiy Semerikov та Maiia Popel. СoCalc as a Learning Tool for Neural Network Simulation in the Special Course “Foundations of Mathematic Informatics”. Sun SITE Central Europe, травень 2018. http://dx.doi.org/10.31812/0564/2250.

Повний текст джерела
Анотація:
The role of neural network modeling in the learning сontent of special course “Foundations of Mathematic Informatics” was discussed. The course was developed for the students of technical universities – future IT-specialists and directed to breaking the gap between theoretic computer science and it’s applied applications: software, system and computing engineering. CoCalc was justified as a learning tool of mathematical informatics in general and neural network modeling in particular. The elements of technique of using CoCalc at studying topic “Neural network and pattern recognition” of the special course “Foundations of Mathematic Informatics” are shown. The program code was presented in a CofeeScript language, which implements the basic components of artificial neural network: neurons, synaptic connections, functions of activations (tangential, sigmoid, stepped) and their derivatives, methods of calculating the network`s weights, etc. The features of the Kolmogorov–Arnold representation theorem application were discussed for determination the architecture of multilayer neural networks. The implementation of the disjunctive logical element and approximation of an arbitrary function using a three-layer neural network were given as an examples. According to the simulation results, a conclusion was made as for the limits of the use of constructed networks, in which they retain their adequacy. The framework topics of individual research of the artificial neural networks is proposed.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Lucid (Computer program language)" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії