2007
Autores
Marques, CG; Da Silva, VG; Campos, R;
Publicação
Euro American Conference on Telematics and Information Systems - Proceedings of the 2007 Euro American Conference on Telematics and Information Systems, EATIS 2007
Abstract
In Portugal, e-Gov is considered to be a key feature in the process of continuously developing an Information Society becoming itself a vital process in the context of modernizing public administration. Its higher priority it's to improve the quality of public services through the use of ICT (Information and Communications Technology). Although some great examples, Portugal still presents some low values in the main measures of ICT, when compared to the majority of European countries, The low investment, a almost inexistence in ICT qualification and the reduced knowledge that enterprises and citizens have about e-Gov potentiality's, are some of the obstacles to a higher success of e-Gov. In this context, we consider important to verify, as they are going to be the futures employees of public administration, the knowledge of public administration high students have about e-Gov, what it's the importance they gave to it, what services they now, use and propose.
2007
Autores
Sousa, B; Oliveira B, B; de Almeida, MDV;
Publicação
ANNALS OF NUTRITION AND METABOLISM
Abstract
2007
Autores
Fernandez, M; Mackie, I; Pinto, JS;
Publicação
Electronic Notes in Theoretical Computer Science
Abstract
This paper presents a formalism for defining higher-order systems based on the notion of graph transformation (by rewriting or interaction). The syntax is inspired by the Combinatory Reduction Systems of Klop. The rewrite rules can be used to define first-order systems, such as graph or term-graph rewriting systems, Lafont's interaction nets, the interaction systems of Asperti and Laneve, the non-deterministic nets of Alexiev, or a process calculus. They can also be used to specify higher-order systems such as hierarchical graphs and proof nets of Linear Logic, or to specify the operational semantics of graph-based languages.
2007
Autores
Caetano, M; Manzolli, J; Von Zuben, F;
Publicação
Applications of Evolutionary Computing, Proceedings
Abstract
We present a time domain approach to explore a sound transformation paradigm for musical performance. Given a set of sounds containing a priori desired qualities and a population of agents interacting locally, the method generates both musical form and matter resulting from sonic trajectories. This proposal involves the use of bio-inspired algorithms, which possess intrinsic features of adaptive, self-organizing systems, as definers of generating and structuring processes of sound elements. Self-organization makes viable the temporal emergence of stable structures without an external organizing element. Regarding musical performance. as a creative process that can be described using trajectories through the compositional space, and having the simultaneous emergence of musical matter and form resulting from the process itself as the final objective, the conception of a generative paradigm in computer music that does not contemplate a priori external organizing elements is the main focus of this proposal.
2007
Autores
Barbosa, L; Cunha, J; Visser, J;
Publicação
SYANCO'07: International Workshop on Synthesis and Analysis of Component Connectors - In conjunction with the 6th ESEC/FSE Joint Meeting
Abstract
Algebraic theories for modeling components and their interactions offer abstraction over the specifics of component states and interfaces. For example, such theories deal with forms of sequential composition of two components in a manner independent of the type of data stored in the states of the components, and independent of the number and types of methods offered by the interfaces of the combinators. General purpose programming languages do not offer this level of abstraction, which implies that a gap must be bridged when turning component models into implementations. In this paper, we present an approach to prototyping of component-based systems that employs so-called type-level programming (or compile-time computation) to bridge the gap between abstract component models and their type-safe implementation in a functional programming language. We demonstrate our approach using Barbosa's model of components as generalized Mealy machines. For this model, we develop a combinator library in Haskell, which uses type-level programming with two effects. Firstly, wiring between components is computed during compilation. Secondly, the well-formedness of the component compositions is guarded by Haskell's strong type system. Copyright 2007 ACM.
2007
Autores
Leal, JP; Domingues, MA;
Publicação
SOFSEM 2007: Theory and Practice of Computer Science, Proceedings
Abstract
The general problem addressed in this paper is the rapid development of web interfaces to software systems using only their command line interface. This kind of system is frequently developed in environments that greatly differ from those where web interface will be implemented. In this setting it is also important to maintain a loose coupling between the web interface and the system it controls since the latter must be able to continue its normal development independently of the former. We propose a framework to develop web interfaces targeted to these systems whose main feature is the fact that it can be extended without requiring code programming. The hot spots of our framework are XML configuration files to define the interface data, how this data is mapped into the system's commands, and how commands output and the interaction state is mapped into web formatting languages. With this approach the web interface is kept separated from the system it controls, it is easy to define and modify, and is able to capture enough domain knowledge to be a real advantage for the novice or sporadic user. In this paper we present the proposed framework architecture, loosely inspired in the MVC pattern, its implementation on Java servlet containers, and its application to the AGILMAT system, a high-school mathematical problem generator developed using constrained grammars.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.