2001
Authors
Martins, A; Pinto Ferreira, JJP; Mendonca, JM;
Publication
E-BUSINESS AND VIRTUAL ENTERPRISES: MANAGING BUSINESS-TO-BUSINESS COOPERATION
Abstract
In the scope of virtual and networked enterprises, we propose a way to integrate quality management into enterprise modeling and allow for quality certification of the whole enterprise. ISO 9001:2000 is presented as a suitable standard for these enterprises quality management systems implementation. On the other hand, quality management system certification in the scope of ISO 10011 is quite difficult, being presented some alternative scenarios for certification.
2000
Authors
de Sousa, AA; Torres, JC;
Publication
Eurographics (Short Presentations)
Abstract
2000
Authors
Leitao, JM; Sousa, AA; Ferreira, FN;
Publication
2000 IEEE 51ST VEHICULAR TECHNOLOGY CONFERENCE, PROCEEDINGS, VOLS 1-3
Abstract
This paper presents some of the developments we made with the goal of allowing a friendly control and simulation of a large number of autonomous agents based in behavior in interactive real-time systems. Our work has been specially oriented to the simulation and control of autonomous vehicles and pedestrians in the preparation of scenarios to driving simulation experiments in the DriS simulator. Because every element is intrinsically autonomous, only a few of them are usually addressed to implement the desired study event. Also, because our model is autonomous and controllable, we can use the same model in the implementation of both environment traffic and controlled vehicles. Our scripting language is based in Grafcet, a well known graphical language used in the specification and programming of industrial controllers. Our technique allows the imposition of both short time orders and long time goals to each autonomous element. Orders can be triggered reactively using sensors that monitor the state of virtual traffic and configurable timers that generate all the necessary Fixed and variable time events.
2000
Authors
Moreira, J; Ribeiro, C; Abdessalem, T;
Publication
Proceedings of the ACM Workshop on Advances in Geographic Information Systems
Abstract
Geographical Information Systems were originally intended to deal with snapshots representing a single state of some reality but there are more and more applications requiring the representation and querying of time-varying information. This work addresses the representation of moving objects on GIS. The continuous nature of movement raises problems for representation in information systems due to the limited capacity of storage systems and the inherently discrete nature of measurement instruments. The stored information has therefore to be partial and does not allow an exact inference of the real-world object's behavior. To cope with this, query operations must take uncertainty into consideration in their semantics in order to give accurate answers to the users. The paper proposes a set of operations to be included in a GIS or a spatial database to make it able to answer queries on the spatio-temporal behavior of moving objects. The operations have been selected according to the requirements of real applications and their semantics with respect to uncertainty is specified. A collection of examples from a case study is included to illustrate the expressiveness of the proposed operations.
2000
Authors
Aguiar, A;
Publication
Object Oriented Programming Systems Languages and Applications Conference, OOPSLA 2000, Minneapolis, MN, USA, October 15-19, 2000, Addendum to the proceedings
Abstract
Good documentation is crucial for the success of frameworks. In this research, a new documenting approach is proposed combining existing document styles in a kind of "minimalist" framework manual with a special emphasis on framework understandability and usability, rather than on describing framework design. Benefits and drawbacks are evaluated from frameworks of different domains and complexity. © 2000 ACM.
2000
Authors
Cardoso, JMP; Neto, HC;
Publication
VLSI: SYSTEMS ON A CHIP
Abstract
This paper presents a novel algorithm for temporal partitioning of graphs representing a behavioral description. The algorithm is based on an extension of the traditional static-list scheduling that tailors it to resolve both scheduling and temporal partitioning. The nodes to be mapped into a partition are selected based on a statically computed cost model. The cost for each node integrates communication effects, the critical path length, and the possibility of the critical path to hide the delay of parallel nodes. In order to alleviate the runtime there is no dynamic update of the costs. A comparison of the algorithm to other schedulers and with close-to-optimum results obtained with a simulated annealing approach is shown. The presented algorithm has been implemented and the results show that it is robust, effective, and efficient, and when compared to other methods finds very good results in small amounts of CPU time.
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.