815 resultados para Reversible Computing
Resumo:
This paper proposes an evolutionary computing strategy to solve the problem of fault indicator (FI) placement in primary distribution feeders. More specifically, a genetic algorithm (GA) is employed to search for an efficient configuration of FIs, located at the best positions on the main feeder of a real-life distribution system. Thus, the problem is modeled as one of optimization, aimed at improving the distribution reliability indices, while, at the same time, finding the least expensive solution. Based on actual data, the results confirm the efficiency of the GA approach to the FI placement problem.
Resumo:
This work is concerned with dynamical systems in presence of symmetries and reversing symmetries. We describe a construction process of subspaces that are invariant by linear Gamma-reversible-equivariant mappings, where Gamma is the compact Lie group of all the symmetries and reversing symmetries of such systems. These subspaces are the sigma-isotypic components, first introduced by Lamb and Roberts in (1999) [10] and that correspond to the isotypic components for purely equivariant systems. In addition, by representation theory methods derived from the topological structure of the group Gamma, two algebraic formulae are established for the computation of the sigma-index of a closed subgroup of Gamma. The results obtained here are to be applied to general reversible-equivariant systems, but are of particular interest for the more subtle of the two possible cases, namely the non-self-dual case. Some examples are presented. (C) 2011 Elsevier BM. All rights reserved.
Resumo:
A gene encoding a-L-arabinofuranosidase (abfA) from Aspergillus niveus was identified, cloned, and successfully expressed in Aspergillus nidulans. Based on amino acid sequence comparison, the 88.6 kDa enzyme could be assigned to the GH family 51. The characterization of the purified recombinant AbfA revealed that the enzyme was active at a limited pH range (pH 4.0-5.0) and an optimum temperature of 70 degrees C. The AbfA was able to hydrolyze arabinoxylan, xylan from birchwood, debranched arabinan, and 4-nitrophenyl arabinofuranoside. Synergistic reactions using both AbfA and endoxylanase were also assessed. The highest degree of synergy was obtained after the sequential treatment of the substrate with endoxylanase, followed by AbfA, which was observed to release noticeably more reducing sugars than that of either enzyme acting individually. The immobilization of AbfA was performed via ionic adsorption onto various supports: agarose activated by polyethyleneimine polymers, cyanogen bromide activated Sepharose, DEAE-Sepharose, and Sepharose-Q The Sepharose-Q derivative remained fully active at pH 5 after 360 min at 60 degrees C, whereas the free AbfA was inactivated after 60 min. A synergistic effect of arabinoxylan hydrolysis by AbfA immobilized in Sepharose-Q and endoxylanase immobilized in glyoxyl agarose was also observed. The stabilization of arabinofuranosidases using immobilization tools is a novel and interesting topic. (C) 2012 Elsevier Ltd. All rights reserved.
Resumo:
Monomers based on plant oil derivatives bearing furan heterocycles appended through thiol-ene click chemistry were prepared and, subsequently, polymerized via a second type of click reaction, i. e. the Diels-Alder (DA) polycondensation between furan and maleimide complementary moieties. Two basic approaches were considered for these DA polymerizations, namely (i) the use of monomers with two terminal furan rings in conjunction with bismaleimides (AA + BB systems) and (ii) the use of a protected AB monomer incorporating both furan and maleimide end groups. This study clearly showed that both strategies were successful, albeit with different outcomes, in terms of the nature of the ensuing products. The application of the retro-DA reaction to these polymers confirmed their thermoreversible character, i. e. the clean-cut return to their respective starting monomers, opening the way to original macromolecular materials with interesting applications, like mendability and recyclability.
Resumo:
Air conditioning and lighting costs can be reduced substantially by changing the optical properties of "intelligent windows." The electrochromic devices studied to date have used copper as an additive. Copper, used here as an electrochromic material, was dissolved in an aqueous animal protein-derived gel electrolyte. This combination constitutes the electrochromic system for reversible electrodeposition. Cyclic voltammetry, chronoamperometric and chromogenic analyses indicated that were obtained good conditions of transparency (initial transmittance of 70%), optical reversibility, small potential window (2.1 V), variation of transmittance in visible light (63.6%) and near infrared (20%) spectral regions. Permanence in the darkened state was achieved by maintaining a lower pulse potential (-0.16 V) than the deposition potential (-1.0 V). Increasing the number of deposition and dissolution cycles favored the transmittance and photoelectrochemical reversibility of the device. The conductivity of the electrolyte (10(-3) S/cm) at several concentrations of CuCl2 was determined by electrochemical impedance spectroscopy. A thermogravimetric analysis confirmed the good thermal stability of the electrolyte, since the mass loss detected up to 100 degrees C corresponded to water evaporation and decomposition of the gel started only at 200 degrees C. Micrographic and small angle X-ray scattering analyses indicated the formation of a persistent deposit of copper particles on the ITO. (C) 2012 Elsevier B.V. All rights reserved.
Resumo:
We study a probabilistic model of interacting spins indexed by elements of a finite subset of the d-dimensional integer lattice, da parts per thousand yen1. Conditions of time reversibility are examined. It is shown that the model equilibrium distribution converges to a limit distribution as the indexing set expands to the whole lattice. The occupied site percolation problem is solved for the limit distribution. Two models with similar dynamics are also discussed.
Resumo:
The development of cloud computing services is speeding up the rate in which the organizations outsource their computational services or sell their idle computational resources. Even though migrating to the cloud remains a tempting trend from a financial perspective, there are several other aspects that must be taken into account by companies before they decide to do so. One of the most important aspect refers to security: while some cloud computing security issues are inherited from the solutions adopted to create such services, many new security questions that are particular to these solutions also arise, including those related to how the services are organized and which kind of service/data can be placed in the cloud. Aiming to give a better understanding of this complex scenario, in this article we identify and classify the main security concerns and solutions in cloud computing, and propose a taxonomy of security in cloud computing, giving an overview of the current status of security in this emerging technology.
Resumo:
[EN] We propose four algorithms for computing the inverse optical flow between two images. We assume that the forward optical flow has already been obtained and we need to estimate the flow in the backward direction. The forward and backward flows can be related through a warping formula, which allows us to propose very efficient algorithms. These are presented in increasing order of complexity. The proposed methods provide high accuracy with low memory requirements and low running times.In general, the processing reduces to one or two image passes. Typically, when objects move in a sequence, some regions may appear or disappear. Finding the inverse flows in these situations is difficult and, in some cases, it is not possible to obtain a correct solution. Our algorithms deal with occlusions very easy and reliably. On the other hand, disocclusions have to be overcome as a post-processing step. We propose three approaches for filling disocclusions. In the experimental results, we use standard synthetic sequences to study the performance of the proposed methods, and show that they yield very accurate solutions. We also analyze the performance of the filling strategies.
Resumo:
[EN] In this paper we present a new model for optical flow calculation using a variational formulation which preserves discontinuities of the flow much better than classical methods. We study the Euler-Lagrange equations asociated to the variational problem. In the case of quadratic energy, we show the existence and uniqueness of the corresponding evolution problem. Since our method avoid linearization in the optical flow constraint, it can recover large displacement in the scene. We avoid convergence to irrelevant local minima by embedding our method into a linear scale-space framework and using a focusing strategy from coarse to fine scales.
Resumo:
Service Oriented Computing is a new programming paradigm for addressing distributed system design issues. Services are autonomous computational entities which can be dynamically discovered and composed in order to form more complex systems able to achieve different kinds of task. E-government, e-business and e-science are some examples of the IT areas where Service Oriented Computing will be exploited in the next years. At present, the most credited Service Oriented Computing technology is that of Web Services, whose specifications are enriched day by day by industrial consortia without following a precise and rigorous approach. This PhD thesis aims, on the one hand, at modelling Service Oriented Computing in a formal way in order to precisely define the main concepts it is based upon and, on the other hand, at defining a new approach, called bipolar approach, for addressing system design issues by synergically exploiting choreography and orchestration languages related by means of a mathematical relation called conformance. Choreography allows us to describe systems of services from a global view point whereas orchestration supplies a means for addressing such an issue from a local perspective. In this work we present SOCK, a process algebra based language inspired by the Web Service orchestration language WS-BPEL which catches the essentials of Service Oriented Computing. From the definition of SOCK we will able to define a general model for dealing with Service Oriented Computing where services and systems of services are related to the design of finite state automata and process algebra concurrent systems, respectively. Furthermore, we introduce a formal language for dealing with choreography. Such a language is equipped with a formal semantics and it forms, together with a subset of the SOCK calculus, the bipolar framework. Finally, we present JOLIE which is a Java implentation of a subset of the SOCK calculus and it is part of the bipolar framework we intend to promote.
Resumo:
[EN]The use of large corpora in the study of languages is a well established tradition. In the same vein, scholarship is also well represented in the case of the study of corpora for making grammars of languages. This is the case of the COBUILD grammar and dictionary and the case of the Longman Grammar of Spoken and Written English. This means that corpora have been analyzed in order to identify patterns in languages that can be later practised by learners following those patterns described and exemplified with real instances.