The purpose of this article is to serve as a light-weight introduction into the mysteries of analog and hybrid computing models from a dynamical systems and programming languages perspective. Hybrid systems are the dynamical systems that combine both models of computation, i.e., have interacting discrete and continuous dynamics. They have found widespread application as models for embedded comp...

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

Teaching programming in an efficient and effective method has been the most difficult subject world of computing for last couple decades. Aside from a lack laboratory equipment, prevalent issues are lengthy time it takes to understand problem, devising algorithms, writing coding, syntax, semantic complexity language. Because wide range students' backgrounds, misconceptions about course, traditi...

General framework for hybrid model based identification and optimization of biochemical processes is elaborated. An enhanced hybrid model of the fed-batch biosurfactant production process is presented. The evolutionary programming techniques are applied for the hybrid model identification and optimization of the process. High performance of the applied optimization techniques is reported. The p...

A microcomputer-based simulator for digital control systems is proposed. The proposed simulator is a hybrid system in which the plant is simulated by conventional method of analog computers and other parts of the system including generation of input signal is performed digitally, using a Z-80 based microcomputer. To overcome the difficulty of programming in assembly language, and at the same ti...

The existing techniques for reachability analysis of linear hybrid automata do not scale well to problem sizes of practical interest. Instead of developing a tool to perform reachability check on all the paths of a linear hybrid automaton, a complementary approach is to develop an efficient path-oriented tool to check one path at a time where the length of the path being checked can be made ver...

Classical computing has well-established formalisms forspecifying, refining, composing, proving, and otherwise reasoningabout computations. These formalisms have matured over the past70 years or so.Unconventional Computing includes the use novel kinds of sub-strates – from black holes and quantum effects, through to chem-icals, biomolecules, even slime moulds – to perfor...

Cryptographic protocols are used in distributed systems to identify users and authenticate transactions. They may involve the exchange of about 2–5 messages, and one might think that a program of this size would be fairly easy to get right. However, this is absolutely not the case: bugs are routinely found in well known protocols, and years after they were first published. The problem is the pr...

Analogies, examples, narratives, case studies and stories are common tools used in teaching. When teaching computer programming, the value of using these tools is amplified due to the abstract nature of the discipline. Analogies such as eating Smarties out of a packet can be used to illustrate the concept of loops, and the example of transferring water from one glass to another glass already f...