Добірка наукової літератури з теми "Computer science. Systems software. Programming languages (Electronic computers)"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Computer science. Systems software. Programming languages (Electronic computers)".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Computer science. Systems software. Programming languages (Electronic computers)"
1
Mauw, S., and G. J. Veltink. "A Process Specification Formalism1." Fundamenta Informaticae 13, no. 2 (April 1, 1990): 85–139. http://dx.doi.org/10.3233/fi-1990-13202.
Повний текст джерелаАнотація:
Traditional methods for programming sequential machines are inadequate for specifying parallel systems. Because debugging of parallel programs is hard, due to e.g. non-deterministic execution, verification of program correctness becomes an even more important issue. The Algebra of Communicating Processes (ACP) is a formal theory which emphasizes verification and can be applied to a large domain of problems ranging from electronic circuits to CAM architectures. The manual verification of specifications of small size has already been achieved, but this cannot easily be extended to the verification of larger industrially relevant systems. To deal with this problem we need computer tools to help with the specification, simulation, verification and implementation. The first requirement for building such a set of tools is a specification language. In this paper we introduce PSFd (Process Specification Formalism – draft) which can be used to formally express processes in ACP. In order to meet the modern requirements of software engineering, like reusability of software, PSFd supports the modular construction of specifications and parameterization of modules. To be able to deal with the notion of data, ASF (Algebraic Specification Formalism) is embedded in our formalism. As semantics for PSFd a combination of initial algebra semantics and operational semantics for concurrent processes is used. A comparison with programming languages and other formal description techniques for the specification of concurrent systems is included.
2
INCLEZAN, DANIELA, and MICHAEL GELFOND. "Modular action language." Theory and Practice of Logic Programming 16, no. 2 (July 6, 2015): 189–235. http://dx.doi.org/10.1017/s1471068415000095.
Повний текст джерелаАнотація:
AbstractThe paper introduces a new modular action language,${\mathcal ALM}$, and illustrates the methodology of its use. It is based on the approach of Gelfond and Lifschitz (1993,Journal of Logic Programming 17, 2–4, 301–321; 1998,Electronic Transactions on AI 3, 16, 193–210) in which a high-level action language is used as a front end for a logic programming system description. The resulting logic programming representation is used to perform various computational tasks. The methodology based on existing action languages works well for small and even medium size systems, but is not meant to deal with larger systems that requirestructuring of knowledge.$\mathcal{ALM}$is meant to remedy this problem. Structuring of knowledge in${\mathcal ALM}$is supported by the concepts ofmodule(a formal description of a specific piece of knowledge packaged as a unit),module hierarchy, andlibrary, and by the division of a system description of${\mathcal ALM}$into two parts:theoryandstructure. Atheoryconsists of one or more modules with a common theme, possibly organized into a module hierarchy based on adependency relation. It contains declarations of sorts, attributes, and properties of the domain together with axioms describing them.Structuresare used to describe the domain's objects. These features, together with the means for defining classes of a domain as special cases of previously defined ones, facilitate the stepwise development, testing, and readability of a knowledge base, as well as the creation of knowledge representation libraries.
3
Kargar, Masoud, Ayaz Isazadeh, and Habib Izadkhah. "Multi-programming language software systems modularization." Computers & Electrical Engineering 80 (December 2019): 106500. http://dx.doi.org/10.1016/j.compeleceng.2019.106500.
Повний текст джерела
4
MORIARTY, K. J. M., and T. TRAPPENBERG. "PROGRAMMING TOOLS FOR PARALLEL COMPUTERS." International Journal of Modern Physics C 04, no. 06 (December 1993): 1285–94. http://dx.doi.org/10.1142/s0129183193001002.
Повний текст джерелаАнотація:
Although software tools already have a place on serial and vector computers they are becoming increasingly important for parallel computing. Message passing libraries, parallel operating systems and high level parallel languages are the basic software tools necessary to implement a parallel processing program. These tools up to now have been specific to each parallel computer system and a short survey will be given. The aim of another class of software tools for parallel computers is to help in writing or rewriting application programs. Because automatic parallelization tools are not very successful, an interactive component has to be incorporated. We will concentrate here on the discussion of SPEFY, a parallel program development facility.
5
Shiau, Liejune. "Exploring Quasi-Concurrency in Introductory Computer Science." Journal of Educational Computing Research 15, no. 1 (July 1996): 53–66. http://dx.doi.org/10.2190/7ldf-va2r-vk66-qq8d.
Повний текст джерелаАнотація:
Most programming courses taught today are focused on managing batch-oriented problems. It is primarily because parallel computers are not commonly available, therefore problems with concurrent nature could not be explored. This consequence, at the same time, causes student's under preparation to meet the challenge of modern multi-process computation technologies. This article demonstrates an easy solution for implementing concurrent programming projects in computer labs. This solution does not require special hardware support or special programming languages. The goal is to facilitate a means to deal with the concept and usefulness of multi-process software systems in the early stage of computer science curriculum. We also include detailed descriptions on a few creative and interesting concurrent examples to illustrate this idea.
6
Mlakić, Dragan, Hamid Baghaee, Srete Nikolovski, Marko Vukobratović, and Zoran Balkić. "Conceptual Design of IoT-Based AMR Systems Based on IEC 61850 Microgrid Communication Configuration Using Open-Source Hardware/Software IED." Energies 12, no. 22 (November 10, 2019): 4281. http://dx.doi.org/10.3390/en12224281.
Повний текст джерелаАнотація:
This paper presents an intelligent electronic device (IED) utilized for automatic meter readings (AMR) scheme using “Open-Source” software. This IED is utilized to measure a low-voltage intelligent electronic device) system with a boundless number of sensors, and it is accessible on the Internet of Things (IoT). The utilized equipment for this task is Arduino UNO R3 motherboard and fringe sensors, which are used for measurement of the referenced information. The Arduino motherboard is used not only for sole tranquility of equipment but also for serving as wireless fidelity (Wi-Fi) switch for the sensors. The personal computer is utilized to gather information and perform client-side calculations. The server works based on an open-source program written in Java programming language. The underlying objective of the proposed scheme is to make the meter based on the “Do It Yourself” methodology which requires considerably fewer funds. Also, it is conceivable by keeping easy to understand interface, information legitimacy, precision of measured information and convenience for the conclusive client. The information is measured in just about 1 ms which is superb for custom-designed IED. Furthermore, the measured qualities are calculated based on their RMS values to be used for analyzing and further presentation of data.
7
Базурін, Віталій Миколайович. "Середовища програмування як засіб навчання учнів основ програмування". Інформаційні технології і засоби навчання 59, № 3 (30 червня 2017): 13–27. http://dx.doi.org/10.33407/itlt.v59i3.1601.
Повний текст джерелаАнотація:
The article reveals the conditions for choosing the programming environment as a means of teaching students of the general education school to programming in modern languages. The main conditions that influence the choice of the programming environment are determined: technical characteristics of computers and system requirements of the programming environment; availability of operating systems and additional software required for the functioning of the programming environment; functional of the programming environment; the interface of the programming environment; availability of documentation for the software environment; availability of educational and methodological support; level of competence of the teacher of computer science. The characteristics of the most common programming environments in C / C ++, C #, Java are analyzed. The selection of the programming environment for studying each of the specified programming languages is substantiated for the training of beginning programmers and students who have programming skills.
8
Zhang, Weini. "Research on Recognition Method of Basketball Goals Based on Image Analysis of Computer Vision." Journal of Sensors 2021 (September 20, 2021): 1–11. http://dx.doi.org/10.1155/2021/5269431.
Повний текст джерелаАнотація:
Moving target detection is involved in many engineering applications, but basketball has some difficulties because of the time-varying speed and uncertain path. The purpose of this paper is to use computer vision image analysis to identify the path and speed of a basketball goal, so as to meet the needs of recognition and achieve trajectory prediction. This research mainly discusses the basketball goal recognition method based on computer vision. In the research process, Kalman filter is used to improve the KCF tracking algorithm to track the basketball path. The algorithm of this research is based on MATLAB, so it can avoid the mixed programming of MATLAB and other languages and reduce the difficulty of interface design software. In the aspect of data acquisition, the extended EPROM is used to store user programs, and parallel interface chips (such as 8255A) can be configured in the system to output switch control signals and display and print operations. The automatic basketball bowling counter based on 8031 microprocessor is used as the host computer. After the level conversion by MAX232, it is connected with the RS232C serial port of PC, and the collected data is sent to the workstation recording the results. In order to consider the convenience of user operation, the GUI design of MATLAB is used to facilitate the exchange of information between users and computers so that users can see the competition results intuitively. The processing frame rate of the tested video image can reach 60 frames/second, more than 25 frames/second, which meet the real-time requirements of the system. The results show that the basketball goal recognition method used in this study has strong anti-interference ability and stable performance.
9
A.N., Khimich, Chistyakova T.V., Sydoruk V.A., and Yershov P.S. "Intellectual computer mathematics system inparsolver." Artificial Intelligence 25, no. 4 (December 25, 2020): 60–71. http://dx.doi.org/10.15407/jai2020.04.060.
Повний текст джерелаАнотація:
The paper considers the intellectual computer mathematics system InparSolver, which is designed to automatically explore and solve basic classes of computational mathematics problems on multi-core computers with graphics accelerators. The problems of results reliability of solving problems with approximate input data are outlined. The features of the use of existing computer mathematics systems are analyzed, their weaknesses are found. The functionality of InparSolver, some innovative approaches to the implementation of effective solutions to problems in a hybrid architecture are described. Examples of applied usage of InparSolver for processes mathematical modeling in various subject areas are given. Nowadays, new more complex objects and phenomena in many subject areas (nuclear energy, mechanics, chemistry, molecular biology, medicine, etc.) are constantly emerging, which are subject to mathematical research on a computer. This encourages the development of new numerical methods and technologies of mathematical modeling, as well as the creation of more powerful computers for their implementation. With the advent and constant development of supercomputers of various architectures, the problems of their effective use, expansion of tasks range should be solved, ensuring the reliability of computer results and increasing the level of intellectual information support for users ‒ specialists in various fields. Today, the issues of solving these problems are given special attention by many specialists in the fields of information technology and parallel programming. The world's leadingscientists in the field of computer technology see the solution to the problems of efficient usage of modern supercomputers in algorithmic software creation that easily adapts to different computer architectures with different types of memory and coprocessors, supports efficient parallelism on millions of cores etc. In addition, improving the efficiency of high-performance computing on modern supercomputers is provided by their intellectualization, transferring to the computer to perform a significant part of the functions (symbolic languages for computer problem statement, research of mathematical models properties, visualization and analysis of tasks results, etc.). The industry of development and usage of intelligent computer technologies is one of the main directions of science and technology development in modern society
10
Ulker, Birol, and Bülent Sezen. "A fuzzy based self-check capable computerized MCDM aid tool." Kybernetes 43, no. 5 (April 29, 2014): 797–816. http://dx.doi.org/10.1108/k-03-2013-0046.
Повний текст джерелаАнотація:
Purpose – The purpose of this paper is to determine as to develop a fuzzy multi-criteria decision-making (MCDM) algorithm with self-check capability that can solve any manufacturing company's printed circuit boards (PCB) design computer aided design (CAD) tool selection problem and to implement it. Design/methodology/approach – An algorithm that consists of two sub-algorithms that use same inputs and alternative pool is developed, thus self-check capability is introduced. The first sub-algorithm designed as an integration of fuzzy AHP and TOPSIS, where the second sub-algorithm composes of fuzzy analytic network process and TOPSIS. Fuzzy set theory and linguistic variables were utilized to handle uncertainty and usage of verbal expressions, respectively. MATLAB programming language was used for the implementation. The used MCDM methods’ and fuzzy set theory's explanations are given along with the literature review prior to real life application of the developed algorithm. Findings – A MCDM algorithm with self-check capability is introduced. Moreover, a practical decision aid tool is generated for the usage of the manufacturing companies that are related with PCB design. Practical implications – A practical computerized MCDM aid tool is generated. Using the tool let the manufacturers, i.e. high-tech device manufacturers, evaluate available PCB CAD design tools with respect to tangible and intangible criteria, and obtain a reliable result. Originality/value – Self-check capability is incorporated into the decision process. Along with this capability, although the decision-making process takes place in a fuzzy environment, result of the algorithm becomes more reliable than the ones deprived of this characteristic. Furthermore, a practical computerized MCDM aid tool is generated.
Дисертації з теми "Computer science. Systems software. Programming languages (Electronic computers)"
1
Salah, Maher M. Mancoridis Spiros. "An environment for comprehending the behavior of software systems /." Philadelphia, Pa. : Drexel University, 2005. http://dspace.library.drexel.edu/handle/1860/516.
Повний текст джерела
2
Swart, Riaan. "A language to support verification of embedded software." Thesis, Stellenbosch : Stellenbosch University, 2004. http://hdl.handle.net/10019.1/49823.
Повний текст джерелаАнотація:
Thesis (MSc)--University of Stellenbosch, 2004.ENGLISH ABSTRACT: Embedded computer systems form part of larger systems such as aircraft or chemical processing facilities. Although testing and debugging of such systems are difficult, reliability is often essential. Development of embedded software can be simplified by an environment that limits opportunities for making errors and provides facilities for detection of errors. We implemented a language and compiler that can serve as basis for such an experimental environment. Both are designed to make verification of implementations feasible. Correctness and safety were given highest priority, but without sacrificing efficiency wherever possible. The language is concurrent and includes measures for protecting the address spaces of concurrently running processes. This eliminates the need for expensive run-time memory protection and will benefit resource-strapped embedded systems. The target hardware is assumed to provide no special support for concurrency. The language is designed to be small, simple and intuitive, and to promote compile-time detection of errors. Facilities for abstraction, such as modules and abstract data types support implementation and testing of bigger systems. We have opted for model checking as verification technique, so our implementation language is similar in design to a modelling language for a widely used model checker. Because of this, the implementation code can be used as input for a model checker. However, since the compiler can still contain errors, there might be discrepancies between the implementation code written in our language and the executable code produced by the compiler. Therefore we are attempting to make verification of executable code feasible. To achieve this, our compiler generates code in a special format, comprising a transition system of uninterruptible actions. The actions limit the scheduling points present in processes and reduce the different interleavings of process code possible in a concurrent system. Requirements that conventional hardware places on this form of code are discussed, as well as how the format influences efficiency and responsiveness.
AFRIKAANSE OPSOMMING: Ingebedde rekenaarstelsels maak deel uit van groter stelsels soos vliegtuie of chemiese prosesseerfasiliteite. Hoewel toetsing en ontfouting van sulke stelsels moeilik is, is betroubaarheid dikwels onontbeerlik. Ontwikkeling van ingebedde sagteware kan makliker gemaak word met 'n ontwikkelingsomgewing wat geleenthede vir foutmaak beperk en fasiliteite vir foutbespeuring verskaf. Ons het 'n programmeertaal en vertaler geïmplementeer wat as basis kan dien vir so 'n eksperimentele omgewing. Beide is ontwerp om verifikasie van implementasies haalbaar te maak. Korrektheid en veiligheid het die hoogste prioriteit geniet, maar sonder om effektiwiteit prys te gee, waar moontlik. Die taal is gelyklopend en bevat maatreëls om die adresruimtes van gelyklopende prosesse te beskerm. Dit maak duur looptyd-geheuebeskerming onnodig, tot voordeel van ingebedde stelsels met 'n tekort aan hulpbronne. Daar word aangeneem dat die teikenhardeware geen spesiale ondersteuning vir gelyklopendheid bevat nie. Die programmeertaal is ontwerp om klein, eenvoudig en intuïtief te wees, en om vertaaltyd-opsporing van foute te bevorder. Fasiliteite vir abstraksie, byvoorbeeld modules en abstrakte datatipes, ondersteun implementering en toetsing van groter stelsels. Ons het modeltoetsing as verifikasietegniek gekies, dus is die ontwerp van ons programmeertaal soortgelyk aan dié van 'n modelleertaal vir 'n modeltoetser wat algemeen gebruik word. As gevolg hiervan kan die implementasiekode as toevoer vir 'n modeltoetser gebruik word. Omdat die vertaler egter steeds foute kan bevat, mag daar teenstrydighede bestaan tussen die implementasie geskryf in ons implementasietaal, en die uitvoerbare masjienkode wat deur die vertaler gelewer word. Daarom poog ons om verifikasie van die uitvoerbare masjienkode haalbaar te maak. Om hierdie doelwit te bereik, is ons vertaler ontwerp om 'n spesiale formaat masjienkode te genereer bestaande uit 'n oorgangstelsel wat ononderbreekbare (atomiese) aksies bevat. Die aksies beperk die skeduleerpunte in prosesse en verminder sodoende die aantal interpaginasies van proseskode wat moontlik is in 'n gelyklopende stelsel. Die vereistes wat konvensionele hardeware aan dié spesifieke formaat kode stel, word bespreek, asook hoe die formaat effektiwiteit en reageerbaarheid van die stelsel beïnvloed.
3
Gerber, Erick D. B. "A model checker for the LF system." Thesis, Stellenbosch : Stellenbosch University, 2007. http://hdl.handle.net/10019.1/19597.
Повний текст джерелаАнотація:
Thesis (MSc)--University of Stellenbosch, 2007.ENGLISH ABSTRACT: Computer aided veri cation techniques, such as model checking, can be used to improve the reliability of software. Model checking is an algorithmic approach to illustrate the correctness of temporal logic speci cations in the formal description of hardware and software systems. In contrast to traditional testing tools, model checking relies on an exhaustive search of all the possible con gurations that these systems may exhibit. Traditionally model checking is applied to abstract or high level designs of software. However, often interpreting or translating these abstract designs to implementations introduce subtle errors. In recent years one trend in model checking has been to apply the model checking algorithm directly to the implementations instead. This thesis is concerned with building an e cient model checker for a small concurrent langauge developed at the University of Stellenbosch. This special purpose langauge, LF, is aimed at developement of small embedded systems. The design of the language was carefully considered to promote safe programming practices. Furthermore, the language and its runtime support system was designed to allow directly model checking LF programs. To achieve this, the model checker extends the existing runtime support infrastructure to generate the state space of an executing LF program.
AFRIKAANSE OPSOMMING: Rekenaar gebaseerde program toetsing, soos modeltoetsing, kan gebruik word om die betroubaarheid van sagteware te verbeter. Model toetsing is 'n algoritmiese benadering om die korrektheid van temporale logika spesi kasies in die beskrywing van harde- of sagteware te bewys. Anders as met tradisionlee program toetsing, benodig modeltoetsing 'n volledige ondersoek van al die moontlike toestande waarin so 'n beskrywing homself kan bevind. Model toetsing word meestal op abstrakte modelle van sagteware of die ontwerp toegepas. Indien die ontwerp of model aan al die spesi kasies voldoen word die abstrakte model gewoontlik vertaal na 'n implementasie. Die vertalings proses word gewoontlik met die hand gedoen en laat ruimte om nuwe foute, en selfs foute wat uitgeskakel in die model of ontwerp is te veroorsaak. Deesdae, is 'n gewilde benadering tot modeltoetsing om di e tegnieke direk op die implementasie toe te pas, en sodoende die ekstra moeite van model konstruksie en vertaling uit te skakel. Hierdie tesis handel oor die ontwerp, implementasie en toetsing van 'n e ektiewe modeltoetser vir 'n klein gelyklopende taal, LF, wat by die Universiteit van Stellenbosch ontwikkel is. Die enkeldoelige taal, LF, is gemik op die veilige ontwikkeling van ingebedde sagteware. Die taal is ontwerp om veilige programmerings praktyke aan te moedig. Verder is die taal en die onderliggende bedryfstelsel so ontwerp om 'n model toetser te akkomodeer. Om die LF programme direk te kan toets, is die model toetser 'n integrale deel van die bedryfstelsel sodat dit die program kan aandryf om alle moontlike toestande te besoek.
4
Kirby, Graham N. C. "Reflection and hyper-programming in persistent programming systems." Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/1673.
Повний текст джерелаАнотація:
In an orthogonally persistent programming system, data is treated in a manner independent of its persistence. This gives simpler semantics, allows the programmer to ignore details of long-term data storage and enables type checking protection mechanisms to operate over the entire lifetime of the data. The ultimate goal of persistent programming language research is to reduce the costs of producing software. The work presented in this thesis seeks to improve programmer productivity in the following ways: • by reducing the amount of code that has to be written to construct an application; • by increasing the reliability of the code written; and • by improving the programmer’s understanding of the persistent environment in which applications are constructed. Two programming techniques that may be used to pursue these goals in a persistent environment are type-safe linguistic reflection and hyper-programming. The first provides a mechanism by which the programmer can write generators that, when executed, produce new program representations. This allows the specification of programs that are highly generic yet depend in non-trivial ways on the types of the data on which they operate. Genericity promotes software reuse which in turn reduces the amount of new code that has to be written. Hyper-programming allows a source program to contain links to data items in the persistent store. This improves program reliability by allowing certain program checking to be performed earlier than is otherwise possible. It also reduces the amount of code written by permitting direct links to data in the place of textual descriptions. Both techniques contribute to the understanding of the persistent environment through supporting the implementation of store browsing tools and allowing source representations to be associated with all executable programs in the persistent store. This thesis describes in detail the structure of type-safe linguistic reflection and hyper-programming, their benefits in the persistent context, and a suite of programming tools that support reflective programming and hyper-programming. These tools may be used in conjunction to allow reflection over hyper-program representations. The implementation of the tools is described.
5
Roe, Paul. "Parallel programming using functional languages." Thesis, Connect to e-thesis, 1991. http://theses.gla.ac.uk/1052.
Повний текст джерела
6
Davidson, Joseph Ray. "An information theoretic approach to the expressiveness of programming languages." Thesis, University of Glasgow, 2016. http://theses.gla.ac.uk/7200/.
Повний текст джерелаАнотація:
The conciseness conjecture is a longstanding notion in computer science that programming languages with more built-in operators, that is more expressive languages with larger semantics, produce smaller programs on average. Chaitin defines the related concept of an elegant program such that there is no smaller program in some language which, when run, produces the same output. This thesis investigates the conciseness conjecture in an empirical manner. Influenced by the concept of elegant programs, we investigate several models of computation, and implement a set of functions in each programming model. The programming models are Turing Machines, λ-Calculus, SKI, RASP, RASP2, and RASP3. The information content of the programs and models are measured as characters. They are compared to investigate hypotheses relating to how the mean program size changes as the size of the semantics change, and how the relationship of mean program sizes between two models compares to that between the sizes of their semantics. We show that the amount of information present in models of the same paradigm, or model family, is a good indication of relative expressivity and average program size. Models that contain more information in their semantics have smaller average programs for the set of tested functions. In contrast, the relative expressiveness of models from differing paradigms, is not indicated by their relative information contents. RASP and Turing Machines have been implemented as Field Programmable Gate Array (FPGA) circuits to investigate hardware analogues of the hypotheses above. Namely that the amount of information in the semantics for a model directly influences the size of the corresponding circuit, and that the relationship of mean circuit sizes between models is comparable to the relationship of mean program sizes. We show that the number of components in the circuits that realise the semantics and programs of the models correlates with the information required to implement the semantics and program of a model. However, the number of components to implement a program in a circuit for one model does not relate to the number of components implementing the same program in another model. This is in contrast to the more abstract implementations of the programs. Information is a computational resource and therefore follows the rules of Blum’s axioms. These axioms and the speedup theorem are used to obtain an alternate proof of the undecidability of elegance. This work is a step towards unifying the formal notion of expressiveness with the notion of algorithmic information theory and exposes a number of interesting research directions. A start has been made on integrating the results of the thesis with the formal framework for the expressiveness of programming languages.
7
Diatchki, Iavor Sotirov. "High-level abstractions for low-level programming /." Full text open access at:, 2007. http://content.ohsu.edu/u?/etd,227.
Повний текст джерела
8
Lamb, David John. "Developing a global observer programming model for large-scale networks of autonomic systems." Thesis, Liverpool John Moores University, 2009. http://researchonline.ljmu.ac.uk/5921/.
Повний текст джерелаАнотація:
Computing and software intensive systems are now an inextricable part of modern work, life and entertainment fabric. This consequently has increased our reliance on their dependable operation. While much is known regarding software engineering practices of dependable software systems; the extreme scale, complexity and dynamics of modern software has pushed conventional software engineering tools and techniques to their acceptable limits. Consequently, over the last decade, this has accelerated research into non-conventional methods, many of which are inspired by social and/or biological systems model. Exemplar of which are the DARPA-funded Se1f-Regenerative-Systems (SRS) programme, and Autonomic Computing, where a closed-loop feedback control model is essential to delivering the advocated cognitive immunity and self-management capabilities. While much research work has been conducted on vanous aspects of SRS and autonomy, they are typically based on the assumptions that the structural model (organisation) of managed elements is static and exhaustive monitoring and feedback is computationally scalable. In addition, existing federated approaches to distributed computation and control, such as Multi-Agent-Systems fail to satisfactorily address how global control may be enacted upon the whole system and how an individual component may take on specified monitoring duties - although methods of interaction between federated individuals is well understood. Equally, organic-inspired computing looks to deal with event scale and complexity largely from a mining perspective, with observation concerns deferred to a suitably selective abstraction known as the "observation model". However, computing and mathematical science research, along with other fields has developed problem-specific approaches to help manage complexity; abstraction-based approaches can simplify structural organisation allowing the underlying meaning to be better understood. Statistical and graph-based approaches can both provide identifying features along with selectively reducing the size of a modelled structure by selecting specific areas that conform to certain topological criteria. This research studies the engineering concerns relating to observation of large-scale networks of autonomic systems. It examines methods that can be used to manage scale and generalises and formalises them within a software engineering approach; guiding the development of an automated adaptive observation subsystem - the Global Observer Model. This approach uses a model-based representation of the observed system, represented by appropriately attached modelled elements; adapters between the underlying system and the observation subsystem. The concepts of Signature and Technique definitions describe large-scale or complex system characteristics and target selection techniques respectively. Collections of these objects are then utilised throughout the framework along with decision and deployment logic (collectively referred to as the Observer Behaviour Definition - an ECA-like observational control) to provide a runtime-adaptable observation overlay. The evaluation of this research is provided by demonstrations of the observation framework; firstly in experimental form for assessment of the Signature and Technique approach, and then by application to the Email Exploration Tool (EET), a forensic investigation utility.
9
Huang, Shan Shan. "Structural abstraction." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29632.
Повний текст джерелаАнотація:
Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010.Committee Chair: Yannis Smaragdakis; Committee Member: Oege de Moor; Committee Member: Richard LeBlanc; Committee Member: Santosh Pande; Committee Member: Spencer Rugaber. Part of the SMARTech Electronic Thesis and Dissertation Collection.
10
Van, Riet F. A. "LF : a language for reliable embedded systems." Thesis, Stellenbosch : Stellenbosch University, 2001. http://hdl.handle.net/10019.1/52322.
Повний текст джерелаАнотація:
Thesis (MSc)--University of Stellenbosch, 2001.ENGLISH ABSTRACT: Computer-aided verification techniques, such as model checking, are often considered essential to produce highly reliable software systems. Modern model checkers generally require models to be written in eSP-like notations. Unfortunately, such systems are usually implemented using conventional imperative programming languages. Translating the one paradigm into the other is a difficult and error prone process. If one were to program in a process-oriented language from the outset, the chasm between implementation and model could be bridged more readily. This would lead to more accurate models and ultimately more reliable software. This thesis covers the definition of a process-oriented language targeted specifically towards embedded systems and the implementation of a suitable compiler and run-time system. The language, LF, is for the most part an extension of the language Joyce, which was defined by Brinch Hansen. Both LF and Joyce have features which I believe make them easier to use than other esp based languages such as occam. An example of this is a selective communication primitive which allows for both input and output guards which is not supported in occam. The efficiency of the implementation is important. The language was therefore designed to be expressive, but constructs which are expensive to implement were avoided. Security, however, was the overriding consideration in the design of the language and runtime system. The compiler produces native code. Most other esp derived languages are either interpreted or execute as tasks on host operating systems. Arguably this is because most implementations of esp and derivations thereof are for academic purposes only. LF is intended to be an implementation language. The performance of the implementation is evaluated in terms of practical metries such as the time needed to complete communication operations and the average time needed to service an interrupt.
AFRIKAANSE OPSOMMING: Rekenaar ondersteunde verifikasietegnieke soos programmodellering, is onontbeerlik in die ontwikkeling van hoogs betroubare programmatuur. In die algemeen, aanvaar programme wat modelle toets eSP-agtige notasie as toevoer. Die meeste programme word egter in meer konvensionele imperatiewe programmeertale ontwikkel. Die vertaling vanuit die een paradigma na die ander is 'n moelike proses, wat baie ruimte laat vir foute. Indien daar uit die staanspoor in 'n proses gebaseerde taal geprogrammeer word, sou die verwydering tussen model en program makliker oorbrug kon word. Dit lei tot akkurater modelle en uiteindelik tot betroubaarder programmatuur. Die tesis ondersoek die definisie van 'n proses gebaseerde taal, wat gemik is op ingebedde programmatuur. Verder word die implementasie van 'n toepaslike vertaler en looptyd omgewing ook bespreek. Die taal, LF, is grotendeels gebaseer op Joyce, wat deur Brinch Hansen ontwikkel is. Joyce en op sy beurt LF, is verbeterings op ander esp verwante tale soos occam. 'n Voorbeeld hiervan is 'n selektiewe kommunikasieprimitief wat die gebruik van beide toevoer- en afvoerwagte ondersteun. Omdat 'n effektiewe implementasie nagestreef word, is die taalontwerp om so nadruklik moontlik te wees, sonder om strukture in te sluit wat oneffektief is om te implementeer. Sekuriteit was egter die oorheersende oorweging in die ontwerp van die taal en looptyd omgewing. Die vertaler lewer masjienkode, terwyl die meeste ander implementasies van eSP-agtige tale geinterpreteer word of ondersteun word as prosesse op 'n geskikte bedryfstelsel- die meeste eSP-agtige tale word slegs vir akademiese doeleindes aangewend. LF is by uitstek ontwerp as implementasie taal. Die evaluasie van die stelsel se werkverrigting is gedoen aan die hand van praktiese maatstawwe soos die tyd wat benodig word vir kommunikasie, sowel as die gemiddelde tyd benodig vir die hantering van onderbrekings.
Книги з теми "Computer science. Systems software. Programming languages (Electronic computers)"
1
Noble, James, and Johnson Ralph E. Transactions on pattern languages of Programming I. Berlin: Springer, 2009.
Знайти повний текст джерела
2
Ahmed, Amal. Programming Languages and Systems: 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings. Cham: Springer Nature, 2018.
Знайти повний текст джерела
3
1968-, Shao Zhong, ed. Programming languages and systems: 5th Asian symposium, APLAS 2007, Singapore, November 29-December 1, 2007 : proceedings. Berlin: Springer, 2007.
Знайти повний текст джерела
4
Symposium on Empirical Foundations of Information and Software Science (4th 1986 Atlanta, Ga.). Empirical foundations of information and software science IV: Empirical methods of evaluation of man-machine interfaces. New York: Plenum Press, 1987.
Знайти повний текст джерела
5
Noble, James. Transactions on Pattern Languages of Programming III. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Знайти повний текст джерела
6
Ueda, Kazunori. Programming Languages and Systems: 8th Asian Symposium, APLAS 2010, Shanghai, China, November 28 - December 1, 2010. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.
Знайти повний текст джерела
7
Steve, Parker. Shell scripting: Expert recipes for Linux, Bash, and more. Indianapolis, Indiana: John Wiley & Sons, 2011.
Знайти повний текст джерела
8
Yuan-Shum, Dai, and Poh Kim-Leng, eds. Computing systems reliability: Models and analysis. New York: Kluwer Academic/Plenum Publishers, 2004.
Знайти повний текст джерела
9
Veríssimo, Paulo. Distributed systems for system architects. Boston: Kluwer Academic, 2001.
Знайти повний текст джерела
10
1963-, Rodrigues Luís, ed. Distributed systems for system architects. Boston: Kluwer Academic, 2001.
Знайти повний текст джерелаЧастини книг з теми "Computer science. Systems software. Programming languages (Electronic computers)"
1
Basurto-Pensado, Miguel, Carlos Alberto Ochoa Ortiz Zezzatti, Rosenberg Romero, Jesús Escobedo-Alatorre, Jessica Morales-Valladares, Arturo García-Arias, and Margarita Tecpoyotl Torres. "Optical Application improved with Logistics of Artificial Intelligent and Electronic Systems." In Logistics Management and Optimization through Hybrid Artificial Intelligence Systems, 439–55. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0297-7.ch017.
Повний текст джерелаАнотація:
Computer science and electronics have a very big incidence in several research areas; optics and photonics are not the exception. The utilization of computers, electronic systems, and devices has allowed the authors to develop several projects to control processes. A description of the computer tool called Laser Micro-Lithography (LML) to characterize materials is realized. The Reasoning Based on Cases (RBC) and its implementation in the software using Java are presented. In order to guarantee the lithography precision, a control system based on a microcontroller was developed and coupled to the mechanical system. An alternative of LML, considering the use of a Personal Digital Assistant (PDA), instead of a Personal Computer (PC) is described. In this case, C language is used for programming. RBC optimizes the materials characterization, recovering information of materials previously characterized. The communication between the PDA and the displacement table is achieved by means of a system based on a micro-controller DSPIC. The developed computers tool permits obtaining lithography with channels narrower than an optical fiber with minimum equipment. The development of irradiance meters based on electronic automation is shown; this section includes the basic theoretical concepts, the experimental device design and the experimental results. Future research trends are presented, and as a consequence of the developed work, perspectives of micro drilling and cutting are also analyzed.
2
Karoui, Kamel. "Mobile Agents." In Mobile Computing, 296–304. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-054-7.ch027.
Повний текст джерелаАнотація:
The concept of mobile agent is not new; it comes from the idea of OS process migration firstly presented by Xerox in the 1980’s. The term mobile agent was introduced by White & Miller (1994), which supported the mobility as a new feature in their programming language called Telescript. This new research topic has emerged from a successful meeting of several sub-sciences: computer networks, software engineering, object- oriented programming, artificial intelligence, human-computer interaction, distributed and concurrent systems, mobile systems, telematics, computer-supported cooperative work, control systems, mining, decision support, information retrieval and management, and electronic commerce. It is also the fruit of exceptional advances in distributed systems field (Hirano 1997; Holder, Ben-Shaul, & Gazit 1999; Lange et al., 1999). The main idea of the mobile agent technology is to replace the old approach of the client-server Remote Procedure Call (RPC) paradigm, by a new one consisting of transporting and executing programs around a network. The results of the programs execution are then returned back to the sending entity. Figure 1 illustrates this new approach. Mobile agents are dynamic, non-deterministic, unpredictable, proactive, and autonomous entities. They can decide to exercise some degree of activities without being invoked by external entities. They can watch out for their own set of internal responsibilities. Agents can interact with their environment and other entities. They can support method invocation as well as more complex degree of interaction as for example the observable events reaction within their environment. They can decide to move from one server to another in order to accomplish the system global behavior.
3
Dasgupta, Subrata. "Very Formal Affairs." In The Second Age of Computer Science. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190843861.003.0009.
Повний текст джерелаАнотація:
If social and behavioral scientists have harbored “physics envy” as some have wryly claimed—envy of its explanatory and predictive success— then computer scientists may be said to have suffered from “mathematics envy.” Interestingly, this envy was less a characteristic of the pioneers of digital computing of the 1940s and 1950s, the people who shed first light on the design of digital electronic computers, the first programming languages, the first operating systems, the first language translators, and so on—though most of them were trained as mathematicians. They were too busy learning the heuristic principles of computational artifacts. Rather, it was in the 1960s when we first find signs of a kind of mathematics envy, at least in some segments of the embryonic computer science community. It was as if, having discovered (or invented) the heuristic principles of practical computational artifacts, some felt the need to understand the underlying “science” of these artifacts—by which they meant its underlying mathematics and logic. Mathematics envy could be assuaged only by thinking mathematically about computational artifacts. Computer science would then be raised to the intellectual stature of, say, physics or indeed of mathematics itself if computer scientists could transform their discipline into a mathematical science. One cannot blame computer scientists who thought this way. The fact is, there is something about mathematics that situates it in a world of its own. “Mathematics is a unique aspect of human thought,” wrote hyperprolific science (fact and fiction) writer Isaac Asimov. And Asimov was by no means the first or only person to think so. But wherein lies the uniqueness of mathematical thinking? Perhaps the answer is that for many people, mathematics offers the following promises:The unearthliness of mathematical objects. The perfectness and exactness of mathematical concepts. An inexorable rigor of mathematical reasoning. The certainty of mathematical knowledge. The self-sufficiency of the mathematical universe. These promises are clearly enviable if they can be kept; usually, they are kept.
4
Dasgupta, Subrata. "Glimpses of a Scientific Style." In It Began with Babbage. Oxford University Press, 2014. http://dx.doi.org/10.1093/oso/9780199309412.003.0014.
Повний текст джерелаАнотація:
In august 1951, David Wheeler submitted a PhD dissertation titled Automatic Computing with the EDSAC to the faculty of mathematics (D. F. Hartley, personal communication, September 7, 2011) at the University of Cambridge. The year after, in November 1952, another of Maurice Wilkes’s students, Stanley Gill, submitted a thesis titled The Application of an Electronic Digital Computer to Problems in Mathematics and Physics. Wheeler’s was not the first doctoral degree awarded on the subject of computing. That honor must surely go to Herman Hollerith for his thesis submitted to Columbia University in 1890 on his invention of an electrical tabulating system (see Chapter 3, Section IV). Nor was Wheeler’s the first doctoral degree on a subject devoted to electronic computing. In December 1947, Tom Kilburn (codesigner with Frederic C. Williams of the Manchester Mark I [see Chapter 8, Section XIII]) had written a report on the CRT-based memory system he and Williams had developed (but called the Williams tube). This report was widely distributed in both Britain and the United States (and even found its way to Russia), and it became the basis for Kilburn’s PhD dissertation awarded in 1948 by the University of Manchester (S. H. Lavington, personal communication, August 31, 2011). Wheeler’s doctoral dissertation, however, was almost certainly the first on the subject of programming. And one might say that the award of these first doctoral degrees in the realm of computer “hardware” (in Kilburn’s case) and computer “software” (in Wheeler’s case) made the invention and design of computers and computing systems an academically respectable university discipline. As we have witnessed before in this story, establishing priority in the realm of computing is a murky business, especially at the birth of this new discipline. Thus, if by “computer science” we mean the study of computers and the phenomena surrounding computers (as three eminent computer scientists Allan Newell, Alan Perlis (1922–1990), and Herbert Simon suggested in 1967), then—assuming we agree on what “computers” are—the boundary between hardware and soft ware, between the physical computer and the activity of computing, dissolves.
Тези доповідей конференцій з теми "Computer science. Systems software. Programming languages (Electronic computers)"
1
Jafar Naqvi, Syed. "An Overview: Approaches for the Development of Basic IT Skills." In InSITE 2005: Informing Science + IT Education Conference. Informing Science Institute, 2005. http://dx.doi.org/10.28945/2884.
Повний текст джерелаАнотація:
There is a growing importance of computerization, information flow and the tremendous use of Information Technology (IT) in all the fields including business, education, government and medicine. The significant improvements in IT continue to occur at an ever-increasing pace. The speed, size, cost, and capabilities associated with computers and telecommunications provide a wealth of highly attractive opportunities for using this technology to help solve business problems or enhance current ways of doing business. There is a general recognition that students in secondary, further and higher education need to acquire IT skills that match the IT needs of the contemporary businesses. The major focus of this investigation concerns the development of IT skills among new entrants to the institute of higher learning to meet the changing needs of IT, especially in the businesses environment. Traditionally, the introductions to IT courses offered in the past were through the programming languages. There seems to be a trend to acquire IT skills moving away from programming and getting skills through off-the- shelf software packages. There are many reasons for this, including the availability of powerful and user-friendly software, such as word processing, databases and spreadsheets, which have raised the level of expectations in the use of IT for business and removed the need to learn to write computer programs in a traditional block structure language. If the software packages are considered, then the obvious question, “What should be the order of their presentation in a basic IT course?” emerges. The popularity of the Internet and its use in the business environment has made it necessary be included in the introduction to computers course. This paper explores several possible approaches for the acquisition of basic IT skills among new IT enthusiasts and proposes an Information Systems Approach for the acquisition of basic IT skills used in business.