Search

A día de hoy la simulación se ha convertido en una poderosa herramienta que permite crear entornos controlados en los que probar distintas hipótesis y desarrollar modelos que imiten situaciones reales con gran precisión. En la década de 1950, John von Neumann desarrolló la teoría de los autómatas celulares, con la cual se pueden simular sistemas complejos, descomponiéndolos en pequeños componentes que interactúan entre sí en base a un conjunto de reglas sencillas. El objetivo de este proyecto es crear un simulador genérico que facilite la creación de modelos de autómata celular a los estudiantes y científicos menos hábiles con la programación. Dándoles una herramienta interactiva e intuitiva con la que trabajar cómodamente. Para facilitar el desarrollo de autómatas celulares se ha creado un autómata celular genérico, mediante el lenguaje de programación Python, que permite implementar diferentes modelos de autómata celular, definir métodos estadísticos para analizar sus resultados, además de proporcionar una interfaz para visualizar los resultados cómodamente. Tras completar el trabajo, se concluye que la herramienta creada facilita el diseño de modelos de simulación, así como el análisis y la recogida de los datos y resultados obtenidos, tal y como demuestran varios juegos de prueba diseñados como ejemplo. Today, simulation has become a powerful tool that allows the creation of controlled environments in which to test different hypotheses and develop models that imitate real situations with great precision. In the 1950s, John von Neumann developed the theory of cellular automata, with which complex systems can be simulated by breaking them down into small components that interact with each other based on a set of simple rules. The goal of this project is to create a generic simulator that makes it easier for students and scientists less skilled with programming to create cellular automaton models. Giving them an interactive and intuitive tool with which to work comfortably. To facilitate the development of cellular automata, a generic cellular automaton has been created, using the Python programming language, which allows the implementation of different cellular automaton models, defining statistical methods to analyze their results, as well as providing an interface to comfortably view the results. After completing the work, it is concluded that the created tool facilitates the design of simulation models, as well as the analysis and collection of the data and results obtained, as demonstrated by various tests sets designed as examples.

Die Masterarbeit beleuchtet die Themen der Regionalität von Produkten, der Umwelt und den allgemeinen Bedürfnissen verschiedener sozialen Gruppen, in Hinblick auf die Ernährung. Der Fokus, der Arbeit, liegt auf der Konzeptentwicklung. Um regionale Produkte, dem Verbraucher näherzubringen und ein Bewusstsein für Regionalität und Saisonalität zu schaffen, wird ein autonomer Automat gestaltet, für eine neue Form der Direktvermarktung. Der autonome Automat hält sich dabei an öffentlichen Plätzen auf, um eine breite Verkaufsfläche anzubieten und somit eine Zugänglichkeit für alle Verbraucher zu ermöglichen. Durch das Boxenkonzept mit inhaltlichen Thematiken, erhalten die Verbraucher eine Vorstellung für die Saisonalität der einzelnen Obst- und Gemüsesorten. Die Boxen beinhalten ausschließlich Produkte von regionalen Erzeugern, die durch die Kilometerentfernung ausgelotet wird. The master thesis focuses on the topic of regional products, the environment and the general needs of society, in terms of nutrition. The focus of the thesis is on the concept development.In order to bring regional products closer to the consumer and to create awareness for regionality and seasonality, an autonomous vending machine is designed for a new form of direct marketing. The autonomous vending machine is located in public places to offer a wide sales area and thus provide accessibility for all consumers. Through the box concept with content themes, consumers get an idea for the seasonality of the individual fruits and vegetables. The boxes contain exclusively products from regional producers, which is explored by the kilometer distance. Minh Nguyet Nguyen Abweichender Titel laut Übersetzung der Verfasserin/des Verfassers Masterarbeit FH JOANNEUM 2023

In diesem Artikel wird zunächst exemplarisch aufgezeigt, welche differenzierten Möglichkeiten und Zugänge bestehen, einen Seifenblasenautomaten im Unterricht zu fertigen. Im Anschluss daran wird mittels einer detaillierten Schritt-für-Schritt-Anleitung die Fertigung einer Seifenblasenautomaten- Variante vorgestellt, die unterschiedliche Fertigungsverfahren und Planungsmittel bei der Umsetzung aufgreift. (DIPF/Orig.)

An important question in computer science is to ask, whether a given system conforms to a specification. Often this question is equivalent to ask whether a finite automaton with certain memory like a stack or queue can reach some given state. In this thesis we focus this reachability problem of automata having one or more lossy or reliable stacks or queues as their memory. Unfortunately, the reachability problem is undecidable or of high complexity in most of these cases. We circumvent this by several approximation methods. So we extend the exploration algorithm by Boigelot and Godefroid under-approximating the reachability problem of queue automata. We also study some automata having multiple stacks with a restricted behavior. These “asynchronous pushdown systems” have an efficiently decidable reachability problem. To show our results we first have to gain knowledge of several algebraic properties of the so-called transformation monoid of the studied storage mechanisms., An important research topic in computer science is the verification, i.e., the analysis of systems towards their correctness. This analysis consists of two parts: first we have to formalize the system and the desired properties. Afterwards we have to find algorithms to check whether the properties hold in the system. In many cases we can model the system as a finite automaton with a suitable storage mechanism, e.g., functional programs with recursive calls can be modeled as automata with a stack (or pushdown). Here, we consider automata with two variations of stacks and queues: 1. Partially lossy queues and stacks, which are allowed to forget some specified parts of their contents at any time. We are able to model unreliable systems with such memories. 2. Distributed queues and stacks, i.e., multiple such memories with a special synchronization in between. Often we can check the properties of our models by solving the reachability and recurrent reachability problems in our automata models. It is well-known that the decidability of these problems highly depends on the concrete data type of our automata’s memory. Both problems can be solved in polynomial time for automata with one stack. In contrast, these problems are undecidable if we attach a queue or at least two stacks to our automata. In some special cases we are still able to verify such systems. So, we will consider only special automata with multiple stacks - so-called asynchronous pushdown automata. These are multiple (local) automata each having one stack. Whenever these automata try to write something into at least one stack, we require a read action on these stacks right before these actions. We will see that the (recurrent) reachability problem is decidable for such asynchronous pushdown automata in polynomial time. We can also semi-decide the reachability problem of our queue automata by exploration of the configration space. To this end, we can join multiple consecutive transitions to so-called meta-transformations and simulate them at once. Here, we study meta-transformations alternating between writing words from a given regular language into the queues and reading words from another regular language from the queues. We will see that such metatransformations can be applied in polynomial time. To show this result we first study some algebraic properties of our stacks and queues., Ein wichtiges Forschungsthema in der Informatik ist die Verifikation, d.h., die Analyse von Systemen bezüglich ihrer Korrektheit. Diese Analyse erfolgt in zwei Schritten: Zuerst müssen wir das System und die gewünschten Eigenschaften formalisieren. Anschließend benötigen wir Algorithmen zum Testen, ob das System die Eigenschaften erfüllt. Oftmals können wir das Systemals endlichen Automaten mit geeignetem Speichermechanismus modellieren, z.B. rekursive Programme sind im Wesentlichen Automaten mit einem Stack. Hier betrachten wir Automaten mit zwei Varianten von Stacks und Queues: 1. Partiell vergessliche Stacks und Queues, welche bestimmte Teile ihrer Inhalte jederzeit vergessen können. Diese können für unzuverlässige Systeme verwendet werden. 2. Verteilte Stacks und Queues, d.h., mehrere Stacks und Queues mit vordefinierter Synchronisierung. Häufig lassen sich die Eigenschaften unserer Modelle mithilfe des (wiederholten) Erreichbarkeitsproblems in unseren Automaten lösen. Dabei ist bekannt, dass die Entscheidbarkeit dieser Probleme oftmals stark vom konkreten Datentyp des Speichers abhängt. Beide Probleme können für Automaten mit einem Stack in Polynomialzeit gelöst werden. Sie sind jedoch unentscheidbar, wenn wir Automaten mit einer Queue oder zwei Stacks betrachten. In bestimmten Spezialfällen sind aber dennoch in der Lage diese Systeme zu verifizieren. So können wir beispielsweise bestimmte Automaten mit mehreren Stacks betrachten - so genannte Asynchrone Kellerautomaten. Diese bestehen aus mehreren (lokalen) Automaten mit jeweils einem Stack. Wann immer diese Automaten etwas in mind. einen Stack schreiben, müssen sie unmittelbar zuvor von diesen Stacks etwas lesen. Das (wiederholte) Erreichbarkeitsproblem ist in asynchronen Kellerautomaten in Polynomialzeit entscheidbar. Wir können zudem das Erreichbarkeitsproblem von Queueautomaten durch Exploration des Konfigurationsraums semi-entscheiden. Hierzu können wir mehrere aufeinanderfolgende Transitionen zu so genannten Meta-Transformationen zusammenfassen und diese in einem Schritt simulieren. Hier betrachten wir Meta-Transformationen, die zwischen dem Lesen und Schreiben von Wörtern aus zwei gegebenen regulären Sprachen alternieren. Diese Meta-Transformationen können in Polynomialzeit ausgeführt werden. Für dieses Ergebnis müssen wir jedoch zunächst verschiedene algebraische Eigenschaften der Queues betrachten.

This article introduces the special section #Intelligence, which includes seven essays addressing the impact of artificial intelligence on cinema and media from a cultural perspective. More particularly, three levels of pertinence are focused on. For the first level, selected papers analyse several representations of non-human intelligence confronted with human intelligence, as provided by film, television series, and video games. On the second level, a set of mutual functioning dynamics between AI and the media are identified and scrutinised. On the third level, the contributing authors consider how AI algorithms lead cinema and media theory to deeply rethink its assumptions about creating and viewing moving images.

[ES] En el presente trabajo se expone la metodología seguida para integrar un autómata Modicon M241 de la marca Schneider, en sustitución a un MDUINO basado en Arduino. El "Programmable Logic Controller" o PLC se ha integrado dentro de un prototipo de sistema de inspección industrial en 3D que recibe el nombre de Zero Gravity 3D. La finalidad de este cambio ha sido la de dotar al equipo de una mayor robustez al incorporar un PLC de gama industrial, facilitando también su integración en línea de producción al estar equipado con protocolos de comunicación industrial. El proyecto abarca desde un estudio previo del funcionamiento con el MDUINO hasta la puesta en marcha y validación del funcionamiento con el nuevo autómata. Esto incluye: - Análisis para seleccionar el mejor autómata y software de programación. - La programación del autómata con el software SoMachine utilizando los lenguajes de programación recogidos en la norma IEC 61131-3: SFC, diagrama de contactos y texto estructurado. - La selección e implementación del protocolo de comunicación entre el PLC y el software de control de calidad. En este caso ha sido del tipo cliente-servidor mediante OPC UA. - La comunicación con el variador que controla una cinta mediante comunicaciones Modbus RTU. - El conexionado en el cuadro eléctrico., [CAT] En el següent treball s’exposa la metodología seguida per a integrar un autòmat Modicon M241 de la marca Schneider en substitució a un MDUINO basat en Arduino. El “Programmable Logic Controller” o PLC s’hha integrat dins d’un prototip de sistema d’inspecció industrial en 3D que rep el nom de Zero Gravity 3D. La finalitat d’aquest canvi ha sigut a de dotar a l’equip d’una major robusteza l’incorporar un PLC de tipus industrial, facilitant també l’integració en línia de producció al estar equipat amb protocols de comunicación industrial. L’abast del projecte es des d’un estudi previ del funcionament amb el MDUINO fins la posada en marzxa i validació amb el nou automat. Açò inclou: • Anàlisi per a seleccionar el millor autòmat i software de programació. • La programación de l’autòmat amb el software SoMachine utilitzant llenguatges de programación recollits en la norma IEC 31131-3: SFC, diagrama de contactes i text estructurat. • La selecció i implementación del protocol de comunicación entre el PLC i el software de control de qualitat. En este cas ha sigut del tipus client-servidor mitjançant OPC UA. • La comunicación amb el variador que controla una cinta mitjançant comunicacions Modbus RTU. • El conexionat al quadre elèctric., [EN] The aim of this work is to explain the methodology followed to integrate a Schneider Modicon M241 PLC, replacing an Arduino-based MDUINO. The "Programmable Logic Controller" or PLC has been integrated into a prototype 3D industrial inspection system called Zero Gravity 3D. The purpose of this change has been to provide the equipment with greater robustness by incorporating an industrial-range PLC, also facilitating its integration into the production line as it is equipped with industrial communication protocols. The project covers from a previous study of the operation with the MDUINO to the commissioning and validation of the operation with the new automaton. This includes: - Analysis to select the best automaton and programming software. - The programming of the automaton with the SoMachine software using the programming languages included in the IEC 61131-3 standard: SFC, contact diagram and structured text. - The selection and implementation of the communication protocol between the PLC and the quality control software. In this case it has been of the client-server type using OPC UA. - Communication with variable-frecuency drive that controls a belt through Modbus RTU communications. - The wiring in the electrical panel.

Andreas Stöcklinger Zusammenfassung in deutscher Sprache Universität Salzburg, Masterarbeit, [2020] (VLID)6439739

Konfeksiyon sektöründe giderek hacmini arttıran denim konfeksiyonda; Türkiye, dünyada üçüncü, Avrupa'da ise lider üretici konumundadır. Ülkemizde hazır giyim ihracatı çok büyük bir öneme sahiptir. Konfeksiyon ihracatımızın daha üst seviyelere çekilebilmesi; bu sektörde daha kaliteli ürün üretilebilmesi, işçilik maliyetlerinin aşağıya çekilmesi ve ürünlerin daha kısa sürede teslim edilmesi ile mümkündür. Bir konfeksiyon ürününü çok kısa sürede dikebilmek için tek tek dikiş makinaları kullanımının yerine, son yıllarda kullanımı oldukça artan herhangi bir dikim işlemini (kemer takma, etiket dikme, fleto cep takma, cep kapağı dikme, sürfile dikiş yapma vb) kendi başına yapan sistem grubu olan “dikiş otomatları” önem kazanmıştır. Ülkemizde konfeksiyon sanayiinin bu kadar gelişmiş olmasına rağmen ne yazık ki yerli dikiş makinası üretilmemesi önemli bir eksikliktir. Bunun yanında, “dikiş otomatları” üreten çok az sayıda firma bulunmaktadır. Bu çalışma ile hazır giyimde “dikiş otomatı” olarak, kot pantolon parçalarının kenarlarına sürfile dikişi yapmak için “Prototip Karşılıklı Çift Kafalı Sürfile Otomatı”nın tasarımı, imalatı, üretim parametrelerinin optimizasyonu yapılarak üretilmiş yeni geliştirilen bu sürfile dikiş otomatının dikiş performansı ve verimliliğe etkisinin incelenmesi amaçlanmaktadır. Bu çalışma; Tübitak 1505 Üniversite Sanayii Destek Programı kapsamında “Prototip Karşılıklı Çift Kafalı Sürfile Otomatı Tasarımı ve İmalatı” projesi (Proje No: 5170082) ile desteklenmiş ve ASİL Grup Makine Sanayi ve Dış Ticaret Ltd. Şti. firması ortaklı olarak yürütülmüştür. Increasing its volume in the apparel industry, denim apparel; Turkey, third in the world, is a leader manufacturer in Europe. Ready-to-wear exports are of great importance in our country. To increase our export of apparel to higher levels; it is possible to produce higher quality products in this sector, by reducing the labor costs and delivering the products in a shorter time. In order to sew a garment product in a very short time, instead of using individual sewing machines, it is the system group that performs any sewing process (belt wearing, label sewing, fleet pocketing, pocket cover sewing, overcasting, etc.) by itself, which has increased in recent years. “Sewing automats” have gained importance. Although the apparel industry is so developed in our country, unfortunately it is an important deficiency that domestic sewing machines are not produced. In addition, there are very few companies producing “sewing automat”. With this study, it is aimed to examine the effect of this newly developed serging automat for denim trousers, which is produced by optimizing the production parameters, by designing, manufacturing, optimizing the production parameters of the "Prototype Mutual Double Headed Serging Automat" to make overcasting the edges of jeans as a "sewing automat" in ready-to-wear. This work; within the scope of Tübitak 1505 University industry Support Program, it was supported with the project of " Desing and Production of Prototype Mutual Double Headed Serging Automat " (Project number: 5170082) and ASİL Grup Makine Sanayi ve Dış Ticaret Ltd. Şti. company was conducted in partnership. ASİL Grup Makine Sanayi ve Dış Ticaret Ltd. Şti.

De différentes manières, Pierre et Paul sont présentés dans le Nouveau Testament comme des « apôtres enchaînés ». Ce qui est sûr, c’est que, même si bien des détails nous échappent, tous deux ont été finalement mis en prison puis exécutés à Rome vers la fin du règne de Néron. Leur image comme prisonniers s’est formée progressivement et respectivement à partir des années 30, pour se fixer dans les Actes des Apôtres, vers 80. Pendant ces 50 ans, leur expérience de cette situation et la représentation qu’ils s’en sont fait ont été transmises aux disciples, soit par eux-mêmes (Paul), soit grâce aux auteurs du Nouveau Testament. Le cas de Pierre, si l’on suit la version qu’en donne Luc dans son évangile et dans les Actes, est assez simple, au moins en apparence. Jésus lui ayant donné le « pouvoir des clefs » et celui de pêcher des hommes dans ses filets, Pierre promit également de le suivre jusqu’à la prison et à la mort – vaine promesse, comme allait le prouver son reniement. Dans les Actes, il est emprisonné à trois reprises, la dernière par le roi Hérode Agrippa, et libéré par une intervention divine, ses chaînes tombant d’elles-mêmes de ses mains (automat-), un peu à la manière dionysiaque. En ce qui concerne Paul, depuis le billet à Philémon jusqu’à la seconde épître à Timothée, en passant par Philippiens et sans doute par Colossiens, il a expérimenté et développé une conception radicalement nouvelle et paradoxale des chaînes comme permettant une relation étroite avec Jésus-Christ, libérant une forte capacité de parrhèsia (liberté d’annoncer la « Bonne Nouvelle », quels que soient les conditions et les risques) et faisant naître l’unité dans les communautés chrétiennes dont il avait la charge. Exaltées par Paul dans ses lettres aussi bien que dans l’épître aux Hébreux et dans la lettre aux Ephésiens, pseudépigraphe mais d’esprit paulinien, et même dans certains passages des Actes, ces chaînes, comme celles de Pierre, allaient devenir, dans les siècles suivants, un symbole sacré tout à la fois de l’humilité et du pouvoir des deux grands apôtres. Ce réseau complexe de réalités et de symboles organisé autour d’une notion vaste et flexible de l’attache, de la fixation, du lien, doit se comprendre sur un arrière-plan antique très riche et très général, qui va d’Ulysse à Platon, à Dionysos et à l’idée romaine de religio. In different manners, Peter and Paul are presented in the New Testament as “chained apostles”. Even if many details are missing, both of them were for sure prisoners in Rome, then executed at the end of Nero’s reign. Their images as prisoners were respectively and progressively being formed from the thirties, to be fixed up in the Book of Acts, around 80. During those 50 years, their experience of that situation and their representation of it were transmitted to the disciples, either by themselves (Paul) or by the authors of the New Testament (Peter). The case of Peter, following the Lucanian version (Lc-Ac), is rather simple, at least apparently. Jesus having given him the “power of the keys” and that of fishing men in his fillets, Peter also promised he would follow him up to prison and death – in vain, as was proved by his denial. In Acts, he comes to be imprisoned three times, the last one by king Herod Agrippa, and freed by a divine intervention, his chains falling from his hands by themselves (automat-), in a somewhat Dionysiac way. As for Paul, from the short letter to Philemon to the second Epistle to Timothy, through Philippians and probably Colossians, he experimented and developed a radically new and paradoxical conception of chains as allowing a straight relationship with Jesus Christ, releasing a capacity for parrhesia (freedom to announce the “Good News”, whatever the conditions and risks), and providing unity inside the first Christian communities he had in charge. Exalted by Paul in his letters as well as in Hebrews and in the pseudepigraphical but “Paulinian” Letter to the Ephesians, and even in some passages of Acts, those chains, as Peter’s ones, were to become, during the following centuries, a sacred symbol, at once, of the humility and power of the two main apostles. This complex net of realities and symbols organized around a large and flexible notion of binding, fastening, linking… is to be understood on a rich and general ancient background, running from Ulysses to Plato, to Dionysos and to the Roman concept of religio.

Videoigre so ambivalenten medijski pojav. Od možnosti računalniške obdelave podatkov dalje lahko v njih simuliramo najrazličnejše vrste drugih medijskih form. Ob tem pa imajo videoigre tudi svojo zgodovino razvoja, ki se za ta specifičen medij začne znotraj vojaško-industrijskega kompleksa hladne vojne. Vendar so že pred njimi, v času industrijske revolucije, v množično družbeno uporabo prišli nekoliko drugačni stroji. Od industrijske revolucije dalje so se ob boku industrijskim in pisarniškim tehnologijam začeli zunaj tovarn in pisarn pojavljati stroji, namenjeni tako igranju kot storitvenemu delu. Od avtomatov za distribucijo poštnih kartic, žvečilk, cigar in ostalih produktov pa vse tja do igralnih arkadnih avtomatov (biljard, ročni nogomet, fliper, mutoskop itd.). Ti so bili kasneje večinoma postavljeni v igralne parke, hkrati pa se njihov proizvodni proces podredi imperativu konkurence, torej imperativu kapitala. To prinese tudi različne učinke na realno subsumpcijo tehnokulture, ki vse do danes dobiva različne pojavne oblike. Video games are an ambivalent media phenomenon. From the possibilities of computer data processing on, we can simulate various types of other media forms in them. In addition, video games have their own history of development, which for this specific medium begins within the military-industrial complex and Cold War. However, already before them, during the industrial revolution, slightly different machines came into mass social use. Since the Industrial Revolution, machines for both gaming and service work have emerged alongside industrial and office technologies, but they were put mostly outside of factories and offices. From vending machinces for the distribution of postcards, chews, cigars and other products all the way to gaming arcade machines (billiards, handball, pinball, mutoscope, etc.). These were later mostly placed in closed private amusement parks, while at the same time their production process was subject to the imperative of competition, that is, the imperative of capital. This also brings different effects on the real subsumption of technoculture, which to this day takes on various phenomena.

Kako bi uspjeli iz velike količine podataka stvoriti modele koji predstavljaju poslovne procese, potrebno je primijeniti skup tehnika za dubinsku analizu procesa(eng. process mining). Dobiveni model se zatim uspoređuje sa zapisnikom događaja, gdje se primjenom raznih alata za provjeru sukladnosti utvrđuje da li su model i zapisnik sukladni. Neki od alata i tehnika su spomenuti u radu, gdje je predstavljeno i studentsko rješenje za ovaj problem. In order to succeed in generating large amounts of data that will represent business processes, a batch technique for deep process analysis needs to be applied. The model obtained is then compared with the event log, where the examples of various conformity checking tools determine whether the model and log is consistent. Some of the tools and techniques are mentioned in the paper, where a student solution for this problem is presented.

Este texto es una compilación del trabajo de escritura realizado durante los cuatrosemestresde maestría. Las ideas aquí incluidas aparecieron gracias a algunos ejercicios de clase, y a conversaciones con Erika Montoya sobre asuntos significativos para la investigación: el primate, el androide, el humano, la astronáutica, etc.También aparecen consideraciones propias sobre el uso de los materiales y las formas, los referentes de imagen y texto, conceptos y decisiones que enmarcaron el trabajo plástico. Más que una justificación del trabajo de grado, se trata de una reflexión sobre la producción misma y su significado. Ubica la instalación como un accidente premeditado en un espacio-tiempo contemporáneo que también va al pasado y al futuro y a pesar de ser una ficción, el texto y la pieza se desbordan y tocan la realidad, afirmándo la como pertinente dentro del ámbito artístico. Abstract: This text is a compilation of writings made during four semesters of magister.The included ideas appeared thanks to some class exercises and talks with Erika Montoya about significant matters for the research: primates, androids, humans, astronautics, etc. Also appeared own considerations about materials and forms, image and text referents, concepts and decisions made that did framethe plastic work. More than justify the gradework, this text is a reflection about production itself, and the meaning of it. It place the installation as an premeditated accident, in a contemporary space-time that also goes to the past and into the future, and in spite of being a fiction, the text and the work of art overflows and touch reality, affirming it as pertinent in the artistic ambit. Maestría

Este texto es una compilación del trabajo de escritura realizado durante los cuatro semestres de maestría. Las ideas aquí incluidas aparecieron gracias a algunos ejercicios de clase, y a conversaciones con Erika Montoya sobre asuntos significativos para la investigación: el primate, el androide, el humano, la astronáutica, etc. También aparecen consideraciones propias sobre el uso de los materiales y las formas, los referentes de imagen y texto, conceptos y decisiones que enmarcaron el trabajo plástico. Más que una justificación del trabajo de grado, se trata de una reflexión sobre la producción misma y su significado. Ubica la instalación como un accidente premeditado en un espacio-tiempo contemporáneo que también va al pasado y al futuro, y a pesar de ser una ficción, el texto y la pieza se desbordan y tocan la realidad, afirmándola como pertinente dentro del ámbito artístico. Abstract: This text is a compilation of writings made during four semesters of magister. The included ideas appeared thanks to some class exercises and talks with Erika Montoya about significant matters for the research: primates, androids, humans, astronautics, etc. Also appeared own considerations about materials and forms, image and text referents, concepts and decisions made that did frame the plastic work. More than justify the grade work, this text is a reflection about production itself, and the meaning of it. It place the installation as an premeditated accident, in a contemporary space-time that also goes to the past and into the future, and in spite of being a fiction, the text and the work of art overflows and touch reality, affirming it as pertinent in the artistic ambit. Maestría

Eski zamanlarda daha az rastlanılan ve ceza hukuku tarafından yaptırım altına alınmayan karşılıksız yararlanma fiilleri toplum yaşantısı ve teknolojinin gelişmesiyle birlikte tarihsel gelişim süreci içerisinde modern ceza kanunlarında 19. yüzyılın başlarından itibaren önce klasik suç tipleri çerçevesinde cezalandırılmaya başlanmış, ancak bu suç tiplerinin kapsamına sokulmasının zorluğu ve ihtiyacı karşılamaması nedeniyle 20. yüzyılın başlarından itibaren ise ayrı bir suç tipi olarak ceza kanunlarında düzenlenmiştir. Türk ceza hukukunda ise karşılıksız yararlanma fiillerinin artarak toplumda huzursuzluğa neden olması ve uygulamada bu fiillerin kanunilik ilkesine aykırı olarak hırsızlık ve dolandırıcılık suçu kapsamına sokulması nedeniyle ilk olarak 1991 yılında ayrı bir suç olarak Türk Ceza Kanununda düzenlenmiştir. Bu değişiklikle 765 sayılı Türk Ceza Kanunun 521a maddesinde yeme, içme, konaklama ve ulaşım hizmetlerinden karşılıksız yararlanma fiilleri, 521b maddesinde ise otomatların sunduğu hizmetten karşılıksız yararlanma fiili cezalandırılmıştır. 5237 sayılı Türk Ceza Kanununda da karşılıksız yararlanma suç olarak düzenlenmiş ancak bu suçu oluşturan fiiller büyük oranda değişikliğe uğramıştır. Bu kanunun 163. maddesinin birinci fıkrasında otomatların sunduğu hizmetlerden karşılıksız yararlanma, ikinci fıkrasında telefon hatları ile frekanslarından ve elektromanyetik dalgalarla yapılan yayınlardan karşılıksız yararlanma, üçüncü fıkrasında elektrik enerjisi, su ve doğalgazdan karşılıksız yararlanma fiilleri suç olarak düzenlenmiştir. Karşılıksız yararlanma suçunu oluşturan fiillerin çeşitlilik göstermesi ve ne ölçüde ve hangi kıstaslarla ceza hukuku tarafından yaptırım altına alınması sorun teşkil ettiğinden çalışmamızda, karşılıksız yararlanma suçunun bugüne kadar geçirdiği süreç ve mevcut düzenlemesi irdelenmiş, öğreti ve uygulamadaki tartışmalı konulara değinilmiş ve bu konular hakkında farklı görüşlerden ve uygulamadaki kararlardan yararlanılarak karşılıksız yararlanma suçu görüşlerimizle beraber ayrıntılarıyla incelenmiştir., In the historical development process, in the course of historical development, the modern criminal laws began to be punished within the framework of classical crime types from the beginning of the 19th century with the development of social life and technology, which are less common in old times and not sanctioned by criminal law.However, because of the difficulty in covering the types of these crimes and their inability to meet the requirements, it has been regulated by criminal laws as a separate type of crime since the beginning of the 20th century. In the Turkish criminal law, the Turkish Penal Code was first established in 1991 as a separate crime due to the fact that the acts of unrequited use have caused increasing unrest in the society and in practice it has been put under the scope of theft and fraud.This amendment to the Turkish Penal Law No. 765 of the 521 substances eating, drinking, gratuitous acts to benefit from accommodation and transport services, and in Article 521B gratuitous benefit from the services offered by the vending machine was actually punished. In the Turkish Penal Code numbered 5237, unrequited exploitation is regulated as a crime, but the acts that have committed this crime have been greatly changed.In the first paragraph of Article 163 of this law, the unlawful use of the services provided by the vending machines, the second paragraph of the telephone lines and frequencies and electromagnetic waves, the use of unrequited, the third paragraph of the electric energy, water and natural gas from the unrequited acts of crime is organized. Because of the diversity of the acts that constitute the crime of unreasonable exploitation and the extent to which and by which criteria and the sanctions imposed by the criminal law poses a problem, in our study, the process and current regulation of the unrequited exploitation crime to date and the controversial issues in teaching and practice are examined and the views of these issues are examined in detail with our opinions about the unrequited use of crime.

The picture of the Alexandria’s lighthouse equiped with four tritons at the corners of its first floor is quite characteristic of the representations figured from the Ist century p. C. These tritons accompanied by their conch are an Alexandrian specificity, since they are not found on any other lighthouse of the Antiquity. This work brings together a rich textual, iconographic and conchyliological documentation of the Triton(s). The conch, a marine sonorous instrument, becomes the main attribute of this divinity in connection with navigation. It’s in a prolific context that the Alexandrian engineers choose to automate these divinities benefactors of the maritime world to create a real harbour signal., L’image du phare d’Alexandrie pourvu de quatre tritons aux angles de son premier étage est tout à fait caractéristique des représentations figurées à partir du Ier s. ap. J.-C. Ces tritons accompagnés de leur conque sont une spécificité alexandrine, puisqu’on ne les retrouve sur aucun autre phare du monde antique. Ce travail réunit une riche documentation textuelle, iconographique et conchyliologique de(s) Triton(s). La conque, instrument sonore marin, devient l’attribut principal de cette divinité en lien avec la navigation. C’est dans un contexte prolifique que les ingénieurs alexandrins choisissent d’automatiser ces divinités bienfaitrices du monde maritime, afin de créer une véritable signalétique portuaire.

U ovom radu izrađena je ideja i potrebni alati za izradu automata za šah. U radu su detaljno opisani tehnologije i alati koji su potrebni za izradu samog projekta. Nakon toga detaljno je opisano na koji način bi trebao automat za šah raditi. Od pomičnog sustava, pa sve do koja vrsta figura je najbolja za sam projekt. Zbog nedostatka potrebnih alata i vremena sama realizacija makete i projekta u stvarnosti nažalost nije uspjela. Sam projekt uvelike pomaže pri budućim izračunima i realizaciji cijelog sustava kao maketi uz mogućnost dorade po želji. In this paper, the idea and the necessary tools for making chess machines have been developed. The paper describes the technologies and tools needed to create the project itself. Subsequently, it is described in detail how the chess machine should work. From the moving system, to what kind of figure is best for the project itself. Due to the lack of necessary tools and time, the realization of the model and the project in reality, unfortunately, did not succeed. The project itself greatly helps with future calculations and realization of the whole system as a model with the possibility of finishing as desired.

Rad predstavlja pokušaj izrade prihvatljivog modela automatizirane energetske mreže kao spleta mreža s mogućnošću procjenjivanja događanja pri pojavi bilo kojeg obilježja te energetske mreže. U tu su svrhu primijenjeni zakoni za modeliranje mreže kako bi se postigla odgovarajuća struktura za model, korištena je teorija automata za objašnjenje rada predloženog modela, a za definiranje odgovarajućeg matematičkog opisa upotrebljena je teorija hibridne funkcije. Evaluiranjem kooperativnih procesa energetske mreže i određivanjem uloge specijalnih karakteristika mreže u tim procesima, izabrana je hijerarskijska struktura od šest slojeva. Svaki se sloj te strukture promatra kao automat i njegova se autonomna performansa opisuje hibridnom funkcijom, matematički. Sastav tih šest hibridnih funkcija uvodi u završnu formulaciju modela. Za provjeru prikladnosti predloženog modela primijenjen je mehanizam inteligentne strategije upravljanja opterećenjem., This paper is an effort towards constructing a comprehensive model for the smart grid as a network of networks with the ability of evaluating events in presence of every smart grid feature. To this end, the network modelling laws are employed to attain a proper structure for the model, the automata theory is used to explain the performance of the proposed model, and the hybrid function theory is utilized to define an appropriate mathematical description for it. By evaluating the smart grid cooperative processes, and determining the role of special smart grid features in these processes, a six-layered hierarchical structure is chosen. Each layer of this structure is considered as an automaton and its autonomous performance is described by a hybrid function, mathematically. The composition of these six hybrid functions introduces the final formulation of the model. To verify the suitability of the proposed model the mechanism of the smart load management strategy is captured.

Si l’on tente de saisir la spécificité de la langue française, il peut être utile d’écarter un instant les nombres et les espaces qui déterminent sa dimension quantitative pour se concentrer sur le Sujet parlant. Dans une comparaison avec le portugais, nous décrivons ici ce que signifie 1. penser en parlant, 2. penser en lisant, 3. penser en écrivant. Trying to grasp the specificity of the French language, it may be useful to forget for a moment the numbers and spaces which determine its quantitative dimension and to concentrate on the speaking Subject. In a comparison with the Portuguese, we describe here what it means 1. to think while speaking, 2. to think while reading, 3. to think while writing… in French.

Internet of Things(IoT) has in recent years become a topic of broad and current interest. The purpose of this thesis is to anticipate weather conditions by constructing a system for collecting information about atmospheric pressure. The development of the system will solve the following problem: it should be possible to implement a system that allows for the collection of information from sensors through a mobile phone. The problem was solved through an iOS application together with a Micro Controller Unit (MCU) and a sensor. To collect weather data, the BME280, with its atmospheric pressure, temperature and humidity sensor, was used. Bluetooth was chosen for the interaction between the Automat and the iOS application. This proved to be a possible solution to a problem in a growing area of application. An advantage to this hardware solution is the mobility and flexibility of the Automat, making it ideal for mobile IoT solutions. Arduino is, however, the better choice for developers, as it has a larger community and clear documentation. Internet of Things (IoT) har på senare år blivit ett alltmer omtalat område. Syftet med tesen är att förutspå väderförhållanden genom att konstruera ett IoT system som samlar in information om lufttryck, detta för att besvara frågeställningen: Det bör gå att samla in sensordata med hjälp av mobiltelefon. För att besvara detta följdes Ekholms modell för teknisk forskning och arbetsmetoden Scrum. Frågestallningen löstes genom en iOS applikation med tillhörande Microcontroller Unit(MCU) och sensor. För att samla in väderdata användes sensorn BME280, som har lufttrycks-, temperaturoch luftfuktighetssensorer, tillsammans med MCU:n Automat. För interaktionen mellan Automat och iOS applikationen tillämpades bluetooth-kommunikation. Detta var en möjlig lösning på ett problem i ett växande tillämpningsområde. Fördelar med denna lösning av hårdvara är att den är välanpassad till mobila IoT lösningar tack vare Automats minimala storlek i förhållande till funktionalitet. I många fall är däremot Arduino ett bättre val för utvecklaren, då den har större samfund och tydligare dokumentation.

Kontextfreie Spiele sind ein formales Modell, welches in seiner einfachsten Form den Ableitungsmechanismus kontextfreier Grammatiken zu einem Spiel für zwei Spieler (genannt Juliet und Romeo) verallgemeinert; dabei wählt in einer gegebenen Satzform (d.h. einer Zeichenkette aus Terminal- und Nichtterminalsymbolen) jeweils Juliet ein zu ersetzendes Nichtterminalsymbol aus, worauf Romeo jeweils entsprechend den Ableitungsregeln entscheidet, wodurch dieses Nichtterminalsymbol ersetzt werden soll. Die Gewinnbedingung für Juliet in einem solchen Spiel ist das Erreichen einer Satzform aus einer gegebenen Zielsprache, wohingegen Romeo die Aufgabe hat, dies zu verhindern. Das zentrale algorithmische Problem in kontextfreien Spielen stellt die Frage, gegeben ein Spiel und eine initiale Satzform, ob Juliet in dem gegebenen Spiel auf der Satzform eine Gewinnstrategie hat. Die zentrale praktische Anwendung kontextfreier Spiele liegt in der Modellierung von Active XML-Dokumenten, d.h. XML-Dokumenten, die Referenzen auf externe Quellen enthalten, welche zur Laufzeit aufgerufen werden können um aktuelle Daten in das Dokument einzufügen. Vor diesem Hintergrund ist es sinnvoll, Erweiterungen der oben genannten kontextfreien Spiele auf verschachtelte Wörter zu betrachten, also auf XML-artige Linearisierungen von Bäumen in Zeichenketten. Weitere praktisch motivierte Verallgemeinerungen beinhalten unter anderem die Modellierung von syntaktischer oder semantischer Behandlung von Aufrufparametern beim Aufruf externer Referenzen. Ziel dieser Dissertation ist, einen weitgehend vollständigen Überblick über den aktuellen Stand der Forschung zu kontextfreien Spielen auf Zeichenketten und verschachtelten Wörtern zu liefern. Dazu liefert sie jeweils komplexitätstheoretische Klassifizierungen des Gewinnproblems (und verwandter Probleme) für diverse Varianten kontextfreie Spiele auf Zeichenketten und verschachtelten Wörtern und gibt einen Überblick über Beweismethoden und algorithmische Techniken zur Behandlung dieses Gewinnproblems. Als Teil dieser Betrachtung stellt sie darüber hinaus grundlegende Ergebnisse zu relevanten Automatenmodellen auf verschachtelten Wörtern dar, darunter Varianten von alternierenden Automaten und Transducern.

Das Spiel erscheint bei Wiemer als jenes Element in der Geschichte des Wissens, das die Birfurkation des Wissens in Kulturwissenschaften auf der einen und Naturwissenschaften auf der anderen Seite unablässig befragt. Der beste Beweis dafür ist die Irritation und Faszination, welche spielende Maschinen, wie etwa im Fall des Computerschachs oder lebendige Automaten wie das Computerspiel "Game of Life", in beiden Wissenskulturen auslösen. Zugleich jedoch weist Wiemer auch darauf hin, dass der Begriff des Spiels mit der Spaltung des Wissens in Kultur- und Naturwissenschaften selbst eine Spaltung erfuhr, ja, dass er, wie er am Beispiel der Spieletheorie von Johan Huizinga verdeutlicht, selbst zur Begründung des Begriffs der Kultur herangezogen wurde, wodurch das "kulturalistische Spielverständnis" doppelt untermauert wurde. In einem Durchgang durch die Philosophiegeschichte des Spiels stellt Wiemer dar, dass im 20. Jahrhundert eine Traditionslinie wiederauflebte, die dem kulturalistischen, auf das Bewusstsein und den Menschen bezogenen Spielverständnis unter Bezugnahme auf Heraklit und vermittelt über Heidegger einen kosmologischen Begriff des Spiels gegenüberstellte. So sieht Eugen Fink das Spiel als kosmisches Gleichnis, wenn es ohne Spieler gedacht wird. Diesen kosmologischen Spielbegriff sucht Wiemer in der Folge für die mögliche Beantwortung der Frage nach der Schwierigkeit fruchtbar zu machen, spielende Maschinen zu denken.

Koristeći markere Optitrack sustava, robot Baxter locira položaj mehaničkog ključa i ventila koji se nalaze na ploči ispred njega. Da bi Baxter znao gdje su markeri u njegovom koordinatnom sustavu, bilo ih je potrebno transformirati. Nadalje, zadatak je realiziran kroz automat s konačnim brojem stanja, gdje stanja automata predstavljaju klijente, a ROS čvorovi, koji izvršavaju trajektorije, su serveri. Za planiranje trajektorija korišten je ROS-ov alat MoveIt, realiziran preko čvorova u C++ programskom jeziku. Trajektorije koje su isplanirane uključuju uzimanje ključa, dodavanje ključa iz jedne ruke u drugu, zavrtanje ventila u jednom, pa u drugom smjeru za 360, te u konačnici vraćanje ključa na njegovo izvorno mjesto. Locate the wrench and the valve using markers and Optitrack system. Plan the trajectory of robot arms so that robot can grasp the wrench from the bord where it is hanging, put the wrench on the valve and turn it for 360 degrees. Than return the wrench to its original position. In the next step repeat the assign, but turn the valve in another direction.

Projektirano je i izvedeno sučelje procesora FRISC prema vanjskoj dinamičkoj DDR3 memoriji na Xilinx programabilnom sklopovlju, odnosno pločici ZedBoard. Samo povezivanje sa Zynq Processing Systemom koji upravlja dinamičkom memorijom izvedeno je uporabom AXI sabirnice. Izvedena je i emulacija GPS sustava uporabom Conexant TU30-D140 GPS prijamnika. Podaci dobiveni sa prijamnika pohranjuju se i nude se za dohvat preko izvedenog sučelja. Podatke je, primjerice, moguće prikazati preko VGA priključka na ekran upravljačke ploče automobila. Interface of processor FRISC to external dynamic DD3 memory is designed and realized on Xilinx programmable hardware using ZedBoard printed board. Zynq Processing System, which controls dynamic memory is connected to the system through AXI bus. Also, the emulation of GPS system is realized using the Conexant TU30-D140 GPS receiver. Data collected from receiver is stored and is readable from given interface. The data can be, for example, visualized through VGA connector on screen of the cars control panel.

Analitzem i proposem diverses versions millorades d’algorismes existents d'aprenentatge d’autòmats finits deterministes. Les nostres millores pertanyen a la categoria d'aprenentatge amb ajuda, amb l'objectiu d'accelerar o influir en la qualitat del procés d'aprenentatge. Una part considerable del nostre treball es basa en un enfocament pràctic; per a cada algorisme que tractem, hi ha resultats comparatius obtinguts després de la implementació i posada a prova dels processos d'aprenentatge en conjunts d'autòmats generats aleatòriament. Després de fer un gran nombre d’experiments, presentem gràfics i dades numèriques amb els resultats comparats que hem obtingut. Estudiem algorismes pertanyents a dos models diferents d'aprenentatge: actiu i passiu. Un augment del nombre de símbols de sortida permet un nombre reduït de preguntes; una orientació al llarg del procés d'aprenentatge dóna una única resposta per a diverses preguntes; la millora de l'estructura d'aprenentatge permet una millor exploració de l'entorn d'aprenentatge. En el marc de l'aprenentatge actiu, un algorisme d'aprenentatge amb preguntes modificades i amb un etiquetatge útil no trivial és capaç d'aprendre autòmats sense contraexemples. Es revisen les preguntes de correcció definint-les com un tipus particular d'etiquetatge. Introduïm correccions minimals, maximals i a l'atzar. Un algorisme clàssic aprèn autòmats típics amb recorreguts aleatòries dins del marc d'aprenentatge passiu en línia. Per l'algorisme original, no podem estimar el nombre d'assaigs necessaris per aprendre completament un autòmat per alguns casos. Afegint transicions inverses al graf subjacent de l'autòmat, el recorregut aleatori actúa com un recorregut aleatori en un graf no dirigit. L'avantatge és que, per a aquests grafs, hi ha un límit superior polinòmic per al temps de cobertura. El nou algorisme és encara un algorisme eficient amb un límit superior polinòmic pel nombre d'errors per defecte i el nombre d'assaigs., Analizamos y proponemos varias versiones mejoradas de los algoritmos de aprendizaje existentes para autómatas finitos deterministas. Nuestras mejoras pertenecen a la categoría de aprendizaje com ayuda, con el objetivo de acelerar, o influir sobre la calidad del proceso de aprendizaje. Una parte considerable de nuestro trabajo se basa en un enfoque práctico; para cada algoritmo que se presenta, existen resultados comparativos obtenidos después de la implementación y puesta a prueba de los procesos de aprendizaje en conjuntos de autómatas generados aleatoriamente. Después de muchos experimentos, presentamos gráficos y datos numéricos con los resultados comparados que hemos obtenido . Estudiamos algoritmos pertenecientes a dos modelos diferentes de aprendizaje: activo y pasivo. Un aumento del número de símbolos de salida permite un número reducido de consultas; una orientación parcial a lo largo del camino de aprendizaje da los resultados de varias consultas como uno solo; la mejora de la estructura de aprendizaje permite una mejor exploración del entorno de aprendizaje. En el marco del aprendizaje activo, un algoritmo de aprendizaje com consulta modificada y dotado de un etiquetado de ayuda no trivial es capaz de aprender autómatas sin contraejemplos. Se revisan las consultas de corrección definiéndolas como tipos particulares de etiquetado. Introducimos correcciones minimales, maximales y al azar. Un algoritmo clásico aprende autómatas típicos de recorridos aleatorios en el marco del aprendizaje pasivo en línea. Para el algoritmo original, no podemos estimar el número de intentos necesarios para aprender completamente el autómata para algunos casos. Añadiendo transiciones inversas al grafo subyacente del autómata, el recorrido aleatorio actúa como un recorrido aleatorio en un grafo no dirigido. La ventaja es que, para estos grafos, existe un límite superior polinómico para el tiempo de cobertura. El nuevo algoritmo es todavía un algoritmo eficiente con límites superiores polinómicos para el número de errores por defecto y el número de intentos., We analyze and propose several enhanced versions of existing learning algorithms for deterministic finite automata. Our improvements belong to the category of helpful learning, aiming to speed up, or to influence the quality of the learning process. A considerable part of our work is based on a practical approach; for each algorithm we discuss, there are comparative results, obtained after the implementation and testing of the learning processes on sets of randomly generated automata. After extended experiments, we present graphs and numerical data with the comparative results that we obtained. We study algorithms belonging to two different learning models: active and passive. An increased number of output symbols allows a reduced number of queries; some partial guidance along the learning path gives the results of several queries as a single one; enhancing the learning structure permits a better exploration of the learning environment. In the active learning framework, a modified query learning algorithm benefiting by a nontrivial helpful labeling is able to learn automata without counterexamples. We review the correction queries defining them as particular types of labeling. We introduce minimal corrections, maximal corrections, and random corrections. A classic algorithm learns typical automata from random walks in the online passive learning framework. For the original algorithm, we cannot estimate the number of trials needed to learn completely a target automaton for some cases. Adding inverse transitions to the underlying graph of the target automaton, the random walk acts as a random walk on an undirected graph. The advantage is, that for such graphs, there exists a polynomial upper bound for the cover time. The new algorithm is still an efficient algorithm with a polynomial upper bound for the number of default mistakes and the number of trials.

Aus dem Inhalt: Diana Daniel / Marius Hug: Mobilitätsgewinn durch Freiheitsentzug? Eine Kulturgeschichte des ‚Gängelwagens‘ von 1500-2000; Frederik Herman / Karin Priem / Geert Thyssen: Körper_Maschinen? Die Verschmelzung von Mensch und Technik in Pädagogik, Industrie und Wissenschaft; Sebastian Döring / Jason Papadimas: Am Grund der Dinge. Bau- und Konstruktionskästen als technische Bildungsmedien; Martin Karcher: SchülerIn als Trivialmaschine; Nicole Zabel: Die Lehrmaschine und der Programmierte Unterricht – Chancen und Grenzen im Bildungswesen der DDR in den 1960er und 1970er Jahren; Andreas Hoffmann-Ocon / Rebekka Horlacher: Technologie als Bedrohung oder Gewinn? Das Beispiel des programmierten Unterrichts; Bernard Dionysius Geoghegan: Visionäre Informatik: Notizen über die Vorführung von Automaten und Computern (1769-1962); Reinhild Kreis: Mechanisierung als pädagogisches Argument. Schule, Arbeit und Konsum um 1900; Julia Kurig: Die Technik als Herausforderung der Pädagogik in den 1950er Jahren: Theodor Litts Bildungs- und Subjekttheorie für die Industriegesellschaft; Abhandlungen: Daniel Eißner: Pietistische Hauslehrer; Ewald Terhart: Drifting Didactics. US-amerikanische Einflüsse auf die deutschsprachige Didaktik 1945-1975 (DIPF/Orig.)

Aus dem Inhalt: Diana Daniel / Marius Hug: Mobilitätsgewinn durch Freiheitsentzug? Eine Kulturgeschichte des ‚Gängelwagens‘ von 1500-2000; Frederik Herman / Karin Priem / Geert Thyssen: Körper_Maschinen? Die Verschmelzung von Mensch und Technik in Pädagogik, Industrie und Wissenschaft; Sebastian Döring / Jason Papadimas: Am Grund der Dinge. Bau- und Konstruktionskästen als technische Bildungsmedien; Martin Karcher: SchülerIn als Trivialmaschine; Nicole Zabel: Die Lehrmaschine und der Programmierte Unterricht – Chancen und Grenzen im Bildungswesen der DDR in den 1960er und 1970er Jahren; Andreas Hoffmann-Ocon / Rebekka Horlacher: Technologie als Bedrohung oder Gewinn? Das Beispiel des programmierten Unterrichts; Bernard Dionysius Geoghegan: Visionäre Informatik: Notizen über die Vorführung von Automaten und Computern (1769-1962); Reinhild Kreis: Mechanisierung als pädagogisches Argument. Schule, Arbeit und Konsum um 1900; Julia Kurig: Die Technik als Herausforderung der Pädagogik in den 1950er Jahren: Theodor Litts Bildungs- und Subjekttheorie für die Industriegesellschaft; Abhandlungen: Daniel Eißner: Pietistische Hauslehrer; Ewald Terhart: Drifting Didactics. US-amerikanische Einflüsse auf die deutschsprachige Didaktik 1945-1975 (DIPF/Orig.)

In this article, general information related to efficiency, assembly lineS and simulation are primarily reviewed. previous studies on assembly line balancing are theoretically analysed. Thereafter two different assembly lines are designed to produce jean trousers. In one assembly line - manual machines and in another automats are used for seven selected operations. These assembly lines are modelled by the Promodel Simulation Program and the assembly line balancing problem is applied. The aim of the study is to establish which assembly lines have the highest line performance and to research the effects of using automat in assembly lines on production volume and efficiency. The simulation method formerly informs investors about the consequences of their investment in the decision making process for technology investments. The study concludes that automat usage on an assembly line increases the production volume and affects the efficiency of assembly line positively.

Seit einigen Jahren wird an einer neuen Spielverordnung für die Unterhaltungsautomatenwirtschaft gearbeitet. Der politische Willensbildungsprozess zog sich bis Ende 2005 hin. Letzte Änderungen wurden Mitte Oktober verfügt. Besonders problematisch stellt sich für die Branche das unmittelbare Verbot von Fun-Games dar, da es ohne eine Übergangsregelung in Kraft tritt. Der notwendige Kapazitätsabbau bei Fun-Games kann, da gegenwärtig noch keine auf der neuen Spielverordnung basierende Geldgewinnspielgeräte angeboten werden können, durch den Einsatz von Geräten der neuen Generation auch nicht teilweise kompensiert werden. Mit einer Modellrechnung wird gezeigt, dass Unternehmen der Branche in die Verlustzone geraten und Arbeitskräfte entlassen müssen.