Abstract
In the current marketplace, enterprises face enormous competitive pressures. Global competition for customers that demand customized products with shorter due dates and the advancement in information technologies, marked the introduction of the Extended Enterprise. In these EMEs (Extended Manufacturing Environments), lean, virtual, networked and distributed enterprises, form MO (Meta-Organizations), which collaborate to respond to the dynamic marketplace. MO members share resources, customers and information. In this paper we present a hybrid framework based on a DKBS (Distributed Knowledge Base System), which includes information about scheduling methods for collaborative enterprises sharing their problems. A core component of this system includes an inference engine as well as two indexes, to help in the classification of the usefulness of the information about the problems and solving methods. A more structured approach for expanding the MO concept is presented, with the HO (Hyper-Organization). The manner in which MO-DSS can communicate, cooperate and share information, in the context of the HO is also detailed. © 2014 IEEE.

Abstract
The so-called "phase delay tracking" attempts to estimate the effects of the turbulence on the phase of the interferograms in order to numerically cophase the measured complex visibilities and to coherently integrate them. This is implemented by the "coherent fringe analysis" of MIDI instrument1 but has only been used for high SNR data. In this paper, we investigate whether the sensitivity of this technique can be pushed to its theoretical limits and thus applied to fainter sources. In the general framework of the maximum likelihood and exploiting the chromatic behavior of the turbulence effects, we propose a global optimization strategy to compute various estimators of the differential pistons between two data frames. The most efficient estimators appear to be the ones based on the phasors, even though they do not yet reach the theoretical limits.

Abstract
Due to the large amount of pages in Websites it is important to collect knowledge about users' previous visits in order to provide patterns that allow the customization of the Website. In previous work we proposed a multi-agent approach using agents with two different algorithms (associative rules and collaborative filtering) and showed the results of the offline tests. Both algorithms are incremental and work with binary data. In this paper we present the results of experiments held online. Results show that this multi-agent approach combining different algorithms is capable of improving user's satisfaction.

Abstract
The combination of the potentialities of the interactive technologies, like exergames and the emerging motion capture devices with the ability of 3D virtual worlds for socialisation and context, can produce a platform to promote the physical activity of its users, which leverages its potential. The OnlineGym is an exploratory project based on an online 3D virtual worlds platform that allows users to interact with the system through the use of a motion capture device. This paper discusses the chosen technological approaches and the preliminary results of the experiments performed with users.

Abstract
Serious games combine a ludic component with instructive and formative goals. They aim to educate and train through play. This paper explores the use of a development framework for dynamic virtual environments to develop serious games. The framework (APEX) was originally developed to prototype ubiquitous computing environments. Here it is used to develop a first person serious game: the Asthma Game. This game aims to teach children with asthma how to act to prevent attacks by drawing attention to asthma triggers in the home, and by providing information about how to avoid them. Besides the description of the game, results about the viability and utility of the approach are also discussed.

Abstract
Scheduling problems in parallel machines have been deeply studied and many are too complex to be solved by exact methods. The unrelated parallel machines makespan minimization problem (Rm||Cmax) is known to be NP-hard and is usually solved using heuristics. Considering heuristics used in these problems, it is possible to identify two different approaches, those that use the execution time to allocate tasks and those that use the completion time. This paper proposes a new heuristic, OMCT (Ordered Minimum Completion Time), based on the performance limitation of the MCT (Minimum Completion Time). The computational study results demonstrate the effectiveness of the proposed heuristic. © 2014 AISTI.