909 resultados para CONNECTIVITY OPERATORS
Resumo:
The activity of Control Center operators is important to guarantee the effective performance of Power Systems. Operators’ actions are crucial to deal with incidents, especially severe faults, like blackouts. In this paper we present an Intelligent Tutoring approach for training Portuguese Control Centre operators in tasks like incident analysis and diagnosis, and service restoration of Power Systems. Intelligent Tutoring System (ITS) approach is used in the training of the operators, taking into account context awareness and the unobtrusive integration in the working environment.
Resumo:
Control Centre operators are essential to assure a good performance of Power Systems. Operators’ actions are critical in dealing with incidents, especially severe faults, like blackouts. In this paper we present an Intelligent Tutoring approach for training Portuguese Control Centre operators in incident analysis and diagnosis, and service restoration of Power Systems, offering context awareness and an easy integration in the working environment.
Resumo:
Ocean Science Meeting. Hawaii Convention Center, Honolulu, Hawaii, USA, 23-28 de Fevereiro.
Resumo:
We perform a comparison between the fractional iteration and decomposition methods applied to the wave equation on Cantor set. The operators are taken in the local sense. The results illustrate the significant features of the two methods which are both very effective and straightforward for solving the differential equations with local fractional derivative.
Resumo:
The definition and programming of distributed applications has become a major research issue due to the increasing availability of (large scale) distributed platforms and the requirements posed by the economical globalization. However, such a task requires a huge effort due to the complexity of the distributed environments: large amount of users may communicate and share information across different authority domains; moreover, the “execution environment” or “computations” are dynamic since the number of users and the computational infrastructure change in time. Grid environments, in particular, promise to be an answer to deal with such complexity, by providing high performance execution support to large amount of users, and resource sharing across different organizations. Nevertheless, programming in Grid environments is still a difficult task. There is a lack of high level programming paradigms and support tools that may guide the application developer and allow reusability of state-of-the-art solutions. Specifically, the main goal of the work presented in this thesis is to contribute to the simplification of the development cycle of applications for Grid environments by bringing structure and flexibility to three stages of that cycle through a commonmodel. The stages are: the design phase, the execution phase, and the reconfiguration phase. The common model is based on the manipulation of patterns through pattern operators, and the division of both patterns and operators into two categories, namely structural and behavioural. Moreover, both structural and behavioural patterns are first class entities at each of the aforesaid stages. At the design phase, patterns can be manipulated like other first class entities such as components. This allows a more structured way to build applications by reusing and composing state-of-the-art patterns. At the execution phase, patterns are units of execution control: it is possible, for example, to start or stop and to resume the execution of a pattern as a single entity. At the reconfiguration phase, patterns can also be manipulated as single entities with the additional advantage that it is possible to perform a structural reconfiguration while keeping some of the behavioural constraints, and vice-versa. For example, it is possible to replace a behavioural pattern, which was applied to some structural pattern, with another behavioural pattern. In this thesis, besides the proposal of the methodology for distributed application development, as sketched above, a definition of a relevant set of pattern operators was made. The methodology and the expressivity of the pattern operators were assessed through the development of several representative distributed applications. To support this validation, a prototype was designed and implemented, encompassing some relevant patterns and a significant part of the patterns operators defined. This prototype was based in the Triana environment; Triana supports the development and deployment of distributed applications in the Grid through a dataflow-based programming model. Additionally, this thesis also presents the analysis of a mapping of some operators for execution control onto the Distributed Resource Management Application API (DRMAA). This assessment confirmed the suitability of the proposed model, as well as the generality and flexibility of the defined pattern operators
Resumo:
MSC Dissertation in Computer Engineering
Resumo:
International Journal of Mathematics and Mathematical Sciences, Vol.2006
Resumo:
Dissertation submitted in partial fulfilment of the requirements for the Degree of Master of Science in Geospatial Technologies
Resumo:
This master’s thesis addresses the maintenance of pre-computed structures, which store a frequent or expensive query, for the nested bag data type in the high level work-flow language Pig Latin. This thesis defines a model suitable to accommodate incremental expressions over nested bags on Pig Latin. Afterwards, the partitioned normal form for sets is extended with further restrictions, in order to accommodate the nested bag model, allow the Pig Latin nest and unnest operators revert each other, and create a suitable environment to the incremental computations. Subsequently, the extended operators – extended union and extended difference – are defined for the nested bag data model with the partitioned normal form for bags (PNF Bag) restriction, and semantics for the extended operators are given. Finally, incremental data propagation expressions are proposed for the nest and unnest operators on the data model proposed with the PNF Bag restriction, and the proof of correctness is given.
Resumo:
We show that the prediction of strategic connectivity breakdowns under a receiving-party-pays system and discrimination between on and off-net prices does not hold up once more than two mobile networks are considered. Indeed, if there are at least three competing networks and enough utility is obtained from receiving calls, only equilibria with finite call prices and receiving prices exist. Private negotiations over access charges then achieve the efficient outcome. Bill & keep (zero access charges) and free outgoing and incoming calls are efficient if and only marginal costs of calls are zero.
Resumo:
Structural connectivity models based on Diffusion Tensor Imaging (DTI) are strongly affected by the technique’s inability to resolve crossing fibres, either intra- or inter-hemispherical connections. Several models have been proposed to address this issue, including an algorithm aiming to resolve crossing fibres which is based on Diffusion Kurtosis Imaging (DKI). This technique is clinically feasible, even when multi-band acquisitions are not available, and compatible with multi-shell acquisition schemes. DKI is an extension of DTI enabling the estimation of diffusion tensor and diffusion kurtosis metrics. In this study we compare the performance of DKI and DTI in performing structural brain connectivity. Six healthy subjects were recruited, aged between 25 and 35 (three females). The MRI experiments were performed using a 3T Siemens Trio with a 32-channel head coil. The scans included a T1-weighted sequence (1mm3), and a DWI with b-values 0, 1000 and 2000 s:mm
Resumo:
Dissertação de mestrado em Matemática
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2011