999 resultados para Scenario Programming, Markup Languages, 3D Virtualworlds
Resumo:
Thesis (M. S.)--University of Illinois at Urbana-Champaign.
Resumo:
"UILU-ENG 77 1708."
Resumo:
"Supported in part by the National Science Foundation under Grant no. GP-4636."
Resumo:
"UILU-ENG 77 1766."
Resumo:
Bibliography: p. [77]-78.
Resumo:
Item 247.
Resumo:
"Issued August 1980."
Resumo:
The real-time refinement calculus is an extension of the standard refinement calculus in which programs are developed from a precondition plus post-condition style of specification. In addition to adapting standard refinement rules to be valid in the real-time context, specific rules are required for the timing constructs such as delays and deadlines. Because many real-time programs may be nonterminating, a further extension is to allow nonterminating repetitions. A real-time specification constrains not only what values should be output, but when they should be output. Hence for a program to implement such a specification, it must guarantee to output values by the specified times. With standard programming languages such guarantees cannot be made without taking into account the timing characteristics of the implementation of the program on a particular machine. To avoid having to consider such details during the refinement process, we have extended our real-time programming language with a deadline command. The deadline command takes no time to execute and always guarantees to meet the specified time; if the deadline has already passed the deadline command is infeasible (miraculous in Dijkstra's terminology). When such a realtime program is compiled for a particular machine, one needs to ensure that all execution paths leading to a deadline are guaranteed to reach it by the specified time. We consider this checking as part of an extended compilation phase. The addition of the deadline command restores for the real-time language the advantage of machine independence enjoyed by non-real-time programming languages.
Resumo:
Software development methodologies are becoming increasingly abstract, progressing from low level assembly and implementation languages such as C and Ada, to component based approaches that can be used to assemble applications using technologies such as JavaBeans and the .NET framework. Meanwhile, model driven approaches emphasise the role of higher level models and notations, and embody a process of automatically deriving lower level representations and concrete software implementations. The relationship between data and software is also evolving. Modern data formats are becoming increasingly standardised, open and empowered in order to support a growing need to share data in both academia and industry. Many contemporary data formats, most notably those based on XML, are self-describing, able to specify valid data structure and content, and can also describe data manipulations and transformations. Furthermore, while applications of the past have made extensive use of data, the runtime behaviour of future applications may be driven by data, as demonstrated by the field of dynamic data driven application systems. The combination of empowered data formats and high level software development methodologies forms the basis of modern game development technologies, which drive software capabilities and runtime behaviour using empowered data formats describing game content. While low level libraries provide optimised runtime execution, content data is used to drive a wide variety of interactive and immersive experiences. This thesis describes the Fluid project, which combines component based software development and game development technologies in order to define novel component technologies for the description of data driven component based applications. The thesis makes explicit contributions to the fields of component based software development and visualisation of spatiotemporal scenes, and also describes potential implications for game development technologies. The thesis also proposes a number of developments in dynamic data driven application systems in order to further empower the role of data in this field.
Resumo:
Main styles, or paradigms of programming – imperative, functional, logic, and object-oriented – are shortly described and compared, and corresponding programming techniques are outlined. Programming languages are classified in accordance with the main style and techniques supported. It is argued that profound education in computer science should include learning base programming techniques of all main programming paradigms.
Resumo:
Бойко Бл. Банчев - Представена е обосновка и описание на език за програмиране в композиционен стил за опитни и учебни цели. Под “композиционен” имаме предвид функционален стил на програмиране, при който пресмятането е йерархия от композиции и прилагания на функции. Един от данновите типове на езика е този на геометричните фигури, които могат да бъдат получавани чрез прости правила за съотнасяне и така също образуват йерархични композиции. Езикът е силно повлиян от GeomLab, но по редица свойства се различава от него значително. Статията разглежда основните черти на езика; подробното му описание и фигурноконструктивните му възможности ще бъдат представени в съпътстваща публикация.
Resumo:
The report presents the film 10th century. The South of the Royal Palace in Great Preslav. It consists of two parts – 10th century. The Royal Palace in Great Prelsav. The Square with the Pinnacle and The Ruler’s Lodgings. 3D and virtual reconstructions of an architectural ensemble – part of the Preslav Royal Court unearthed during archaeological researches are used in the film. 3D documentaries have already gained popularity around the world and are well received by both scholars and the public at large. One of the distinguished tourist destinations in Bulgaria is Great Preslav – capital of the mediaeval Bulgarian state and a significant cultural center of the European Southeast in 9th–10th centuries, too. The first part of the film is created with the financial support of America for Bulgaria Foundation and the second – with the funding of Bulgarian National Science Fund at the Ministry of Education, Youth and Science. A team of almost 20 members worked on the film, including computer specialists, professional actors, and translators in the four main European languages – English, German, French and Russian, Trima Sound Recording Studio. In the first part of the 3D film are shown a segment of the Royal Palace, the square with the water pinnacle and the adjacent buildings – an important structural element of the town-planning of the Preslav Court center in the 10th century. In the second part the accent is the southern part of the Royal Palace in Great Preslav, where the personal residence of the Preslav ruler’s dynasty is situated. The work on the virtual reconstruction was done by Virtual Archaeology club at the Mathematical School, Shumen. Due to the efforts of its members it is now clear how the square in front of the southern gate looked like.
Resumo:
Graph Reduction Machines, are a traditional technique for implementing functional programming languages. They allow to run programs by transforming graphs by the successive application of reduction rules. Web service composition enables the creation of new web services from existing ones. BPEL is a workflow-based language for creating web service compositions. It is also the industrial and academic standard for this kind of languages. As it is designed to compose web services, the use of BPEL in a scenario where multiple technologies need to be used is problematic: when operations other than web services need to be performed to implement the business logic of a company, part of the work is done on an ad hoc basis. To allow heterogeneous operations to be part of the same workflow, may help to improve the implementation of business processes in a principled way. This work uses a simple variation of the BPEL language for creating compositions containing not only web service operations but also big data tasks or user-defined operations. We define an extensible graph reduction machine that allows the evaluation of BPEL programs and implement this machine as proof of concept. We present some experimental results.