982 resultados para Inside-Outside Algorithm
Resumo:
Descriptors based on Molecular Interaction Fields (MIF) are highly suitable for drug discovery, but their size (thousands of variables) often limits their application in practice. Here we describe a simple and fast computational method that extracts from a MIF a handful of highly informative points (hot spots) which summarize the most relevant information. The method was specifically developed for drug discovery, is fast, and does not require human supervision, being suitable for its application on very large series of compounds. The quality of the results has been tested by running the method on the ligand structure of a large number of ligand-receptor complexes and then comparing the position of the selected hot spots with actual atoms of the receptor. As an additional test, the hot spots obtained with the novel method were used to obtain GRIND-like molecular descriptors which were compared with the original GRIND. In both cases the results show that the novel method is highly suitable for describing ligand-receptor interactions and compares favorably with other state-of-the-art methods.
Resumo:
A traditional photonic-force microscope (PFM) results in huge sets of data, which requires tedious numerical analysis. In this paper, we propose instead an analog signal processor to attain real-time capabilities while retaining the richness of the traditional PFM data. Our system is devoted to intracellular measurements and is fully interactive through the use of a haptic joystick. Using our specialized analog hardware along with a dedicated algorithm, we can extract the full 3D stiffness matrix of the optical trap in real time, including the off-diagonal cross-terms. Our system is also capable of simultaneously recording data for subsequent offline analysis. This allows us to check that a good correlation exists between the classical analysis of stiffness and our real-time measurements. We monitor the PFM beads using an optical microscope. The force-feedback mechanism of the haptic joystick helps us in interactively guiding the bead inside living cells and collecting information from its (possibly anisotropic) environment. The instantaneous stiffness measurements are also displayed in real time on a graphical user interface. The whole system has been built and is operational; here we present early results that confirm the consistency of the real-time measurements with offline computations.
Resumo:
A systolic array to implement lattice-reduction-aided lineardetection is proposed for a MIMO receiver. The lattice reductionalgorithm and the ensuing linear detections are operated in the same array, which can be hardware-efficient. All-swap lattice reduction algorithm (ASLR) is considered for the systolic design.ASLR is a variant of the LLL algorithm, which processes all lattice basis vectors within one iteration. Lattice-reduction-aided linear detection based on ASLR and LLL algorithms have very similarbit-error-rate performance, while ASLR is more time efficient inthe systolic array, especially for systems with a large number ofantennas.
Resumo:
Newsletter from the Department of Corrections
Resumo:
Newsletter from the Department of Corrections
Resumo:
Newsletter from the Department of Corrections
Resumo:
Newsletter from the Department of Corrections
Resumo:
Tässä insinöörityössä selvitetään ABB Oy System AC -liiketoimintayksikön pakkaamon ulkoistamiseen liittyviä ongelmia sekä mahdollisia ratkaisuja näihin ongelmiin. Koko ongelman käsittely on liian laaja projektin yhdelle insinöörityölle. Tässä työssä keskitytään ratkaisemaan ko. ulkoistamiseen liittyvät keskeisimmät ACS800-kaappimoduulien kuljetuslogistiset ongelmat. Näitä ongelmia ovat kaappimoduulien kiinnitystarve kuljetusalustaansa sekä kuljetuspaketoinnin puuttuessa kaappimoduulien suojaaminen maantiekuljetuksen ajaksi. Työssä on otettu huomioon viranomaisten maantiekuljetuksia koskevat vaatimukset. Työssä on suunniteltu uusia kiinnitysvälineitä sekä muutoksia olemassa oleviin kuljetusalustoihin, joita käytetään tehtaan sisäisissä kaappimoduulien siirroissa. Kiinnitysvälineistä on tehty lujuuslaskelmia ja määritelty kiristysmomentteja. Tuotettavuuden ja kustannustehokkuuden kannalta on selvitetty kiinnitysvälineisiin soveltuvia materiaalivaihtoehtoja. Kuljetusalustojen muutoksista on myös tehty ohjeistusta. Tämän työn tulos on uusien kiinnitysvälineiden ja kuljetusalustojen mekaanisten muutosten suunnittelu. Samalla on todistettu, että kaappimoduulien siirto tehtaan ulkopuoliseen pakkaamoon ilman kuljetuspaketointia on teoriassa mahdollista.
Resumo:
From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.
Resumo:
How do organizations cope with extreme uncertainty? The existing literature is divided on this issue: some argue that organizations deal best with uncertainty in the environment by reproducing it in the organization, whereas others contend that the orga nization should be protected from the environment. In this paper we study the case of a Wall Street investment bank that lost its entire office and trading technology in the terrorist attack of September 11 th. The traders survived, but were forced to relocate to a makeshift trading room in New Jersey. During the six months the traders spent outside New York City, they had to deal with fears and insecurities inside the company as well as outside it: anxiety about additional attacks, questions of professional identity, doubts about the future of the firm, and ambiguities about the future re-location of the trading room. The firm overcame these uncertainties by protecting the traders' identities and their ability to engage in sensemaking. The organization held together through a leadership style that managed ambiguities and created the conditions for new solutions to emerge.
Resumo:
Since ethical concerns are calling for more attention within Operational Research, we present three approaches to combine Operational Research models with ethics. Our intention is to clarify the trade-offs faced by the OR community, in particular the tension between the scientific legitimacy of OR models (ethics outside OR models) and the integration of ethics within models (ethics within OR models). Presenting and discussing an approach that combines OR models with the process of OR (ethics beyond OR models), we suggest rigorous ways to express the relation between ethics and OR models. As our work is exploratory, we are trying to avoid a dogmatic attitude and call for further research. We argue that there are interesting avenues for research at the theoretical, methodological and applied levels and that the OR community can contribute to an innovative, constructive and responsible social dialogue about its ethics.
Resumo:
This dissertation concerns two types of wh-constructions – interrogative and relative clauses – of Cape Verdean Creole (CVC), a Portuguese-based Creole language spoken on the archipelago of Cape Verde, specifically the variety spoken on Santiago Island, in the coast of West Africa. Chapter 2 focus on some aspects of the syntax of CVC, claiming that the possibilities of S-V inversion are very limited and that verbs stay in Vº, except for the Present tense form of the copula verb e ‘to be’, which is the spell out of the formal feature [Present] of T. It is proposed that CVC exhibits a clause functional structure that is similar to English: [CP [TP [NegP [AspP [VP … ]]]]]. In this chapter, it is also suggested that a non Split-CP, based on the formal features [±D, ±V, ±Q, ±Wh, ±T], correctly accounts for the distribution of the complementizers in CVC. Chapter 3 presents the wh-question formation strategies exhibited by CVC, showing that some of them involve Move, while others do not. Considering CVC data, it is said that the language has two clausal typing processes: an ambiguous complementizer ki ([±Q, ±Wh]), whose checking domain is strictly local; and an unambiguous complementizer Ø ([+Q, +Wh]), whose checking domain is not strictly local. The first one derives fronted wh-questions and the second one accounts for wh-in- -situ. Chapter 4 describes the relativization strategies displayed by CVC, focusing on the fact that PP pied-piping is ruled out and that resumption is possible both inside and outside syntactic islands. It is suggested a revision of Bianchi’s (2002a) head raising analysis for the structure of relative clauses. Chapter 5 discusses the properties of the defective copy strategy ([wh[+PL] … el]) and presents evidence in favor of a distinction between this type of wh-strategy and resumption ([wh[+PL] … es]). It is argued that the language requires an overt pronominal form (3SG) to occur in the complement position of the preposition because CVC types the clause with a complementizer ki [uCat +D] and does not allow for preposition incorporation. The set of formal features of the lower copy is ‘shrinked’, i.e. the features are deleted but not erased, being accessible to PF. This analysis of the defective copy xiv strategy predicts that it only applies to PPs and that it is an autonomous process involving wh-movement, which is distinct from resumption.
Resumo:
Secretory IgA (SIgA) plays an important role in the protection and homeostatic regulation of intestinal, respiratory, and urogenital mucosal epithelia separating the outside environment from the inside of the body. This primary function of SIgA is referred to as immune exclusion, a process that limits the access of numerous microorganisms and mucosal antigens to these thin and vulnerable mucosal barriers. SIgA has been shown to be involved in avoiding opportunistic pathogens to enter and disseminate in the systemic compartment, as well as tightly controlling the necessary symbiotic relationship existing between commensals and the host. Clearance by peristalsis appears thus as one of the numerous mechanisms whereby SIgA fulfills its function at mucosal surfaces. Sampling of antigen-SIgA complexes by microfold (M) cells, intimate contact occurring with Peyer's patch dendritic cells (DC), down-regulation of inflammatory processes, modulation of epithelial, and DC responsiveness are some of the recently identified processes to which the contribution of SIgA has been underscored. This review aims at presenting, with emphasis at the biochemical level, how the molecular complexity of SIgA can serve these multiple and non-redundant modes of action.
Resumo:
The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.
Resumo:
We test whether outside experts have information not available to insiders by usingthe voting record of the Bank of England's Monetary Policy Committee. Memberswith more private information should vote more often against conventional wisdom,which we measure as the average belief of market economists about future interest rates. We find evidence that external members indeed have information notavailable to internals, but also use a quasi-natural experiment to show they mayexaggerate their expertise to obtain reappointment. This implies that an optimalcommittee, even outside monetary policy, should potentially include outsiders, butneeds to manage career concerns.