1,265 research outputs found

    Air recovery assessment on high-pressure pneumatic systems

    Get PDF
    A computational simulation and experimental work of the fluid flow through the pneumatic circuit used in a stretch blow moulding machine is presented in this paper. The computer code is built around a zero-dimensional thermodynamic model for the air blowing and recycling containers together with a non-linear time-variant deterministic model for the pneumatic three stations single acting valve manifold, which, in turn, is linked to a quasi-one-dimensional unsteady flow model for the interconnecting pipes. The flow through the pipes accounts for viscous friction, heat transfer, cross-sectional area variation, and entropy variation. Two different solving methods are applied: the method of characteristics and the Harten-Lax-Van Leer (HLL) Riemann first-order scheme. The numerical model allows prediction of the air blowing process and, more significantly, permits determination of the recycling rate at each operating cycle. A simplified experimental set-up of the industrial process was designed, and the pressure and temperature were adequately monitored. Predictions of the blowing process for various configurations proved to be in good agreement with the measured results. In addition, a novel design of a valve manifold intended for the polyethylene terephthalate (PET) plastic bottle manufacturing industry is also presented.Peer ReviewedPostprint (author's final draft

    Bounded and unbounded polynomials and multilinear forms: Characterizing continuity

    Get PDF
    In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the question as to whether a polynomial is continuous if and only if it transforms connected sets into connected sets. These results motivate the natural question as to how many non-continuous polynomials there are on an infinite dimensional normed space. A problem on the \emph{lineability} of the sets of non-continuous polynomials and multilinear mappings on infinite dimensional normed spaces is answered.Comment: 8 page

    Stress analysis of finite anisotropic plates with cutouts under displacement boundary conditions

    Get PDF
    XI CONGRESO NACIONAL DE MATERIALES COMPUESTOS. Celebrado en Móstoles los días 6, 7 y 8 de julio de 2015The aim of this article is to provide an analytical tool to estímate the stress concentration in anisotropic plates weakened by a circular or elliptical hole; it is achieved by developing Lekhnitskii formalism in order to allow fínite boundary effects to be added (original formulation considers infinite plates). Only membrane problem is herein considered, particularly when prescribed displacements are applied at externa! boundaries, which could simulate boundary conditions of a manhole structure between wing spars. A boundary collocation method in conjunction with a least squares approach is used to solve the problem.Ministerio de Economía y Competitividad de España DPT2012-3718

    MiniAnDE: a reduced AnDE ensemble to deal with microarray data

    Full text link
    This article focuses on the supervised classification of datasets with a large number of variables and a small number of instances. This is the case, for example, for microarray data sets commonly used in bioinformatics. Complex classifiers that require estimating statistics over many variables are not suitable for this type of data. Probabilistic classifiers with low-order probability tables, e.g. NB and AODE, are good alternatives for dealing with this type of data. AODE usually improves NB in accuracy, but suffers from high spatial complexity since kk models, each with n+1n+1 variables, are included in the AODE ensemble. In this paper, we propose MiniAnDE, an algorithm that includes only a small number of heterogeneous base classifiers in the ensemble, i.e., each model only includes a different subset of the kk predictive variables. Experimental evaluation shows that using MiniAnDE classifiers on microarray data is feasible and outperforms NB and other ensembles such as bagging and random forest

    Plain cigarette packs do not exert Pavlovian to instrumental transfer of control over tobacco-seeking

    Get PDF
    Journal ArticleResearch Support, Non-U.S. Gov'tCopyright © 2014 The Authors. Addiction published by John Wiley & Sons Ltd on behalf of Society for the Study of AddictionAIMS: To gain insight into the potential impact of plain tobacco packaging policy, two experiments were undertaken to test whether 'prototype' plain compared with branded UK cigarette pack stimuli would differentially elicit instrumental tobacco-seeking in a nominal Pavlovian to instrumental transfer (PIT) procedure. DESIGN, SETTING AND PARTICIPANTS: Two experiments were undertaken at the University of Bristol UK, with a convenience sample of adult smokers (experiment 1, n = 23, experiment 2, n = 121). MEASUREMENT: In both experiments, smokers were trained on a concurrent choice procedure in which two responses earned points for cigarettes and chocolate, respectively, before images of branded and plain packs were tested for capacity to elicit the tobacco-seeking response in extinction. The primary outcome was percentage choice of the tobacco- over the chocolate-seeking response in plain pack, branded pack and no-stimulus conditions. FINDINGS: Both experiments found that branded packs primed a greater percentage of tobacco-seeking (overall mean = 62%) than plain packs (overall mean = 53%) and the no-stimulus condition (overall mean = 52%; Ps ≤ 0.01, ŋp (2) s ≥ 0.16), and that there was no difference in percentage tobacco-seeking between plain packs and the no-stimulus condition (Ps ≥ 0.17, ŋp (2) s ≤ 0.04). Plain tobacco packs showed an overall 9% reduction in the priming of a tobacco choice response compared to branded tobacco packs. CONCLUSIONS: Plain packaging may reduce smoking in current smokers by degrading cue-elicited tobacco-seeking.British Heart FoundationCancer Research UKNIHRMRCESR

    OPEN- AND CLOSED-LOOP EQUILIBRIUM CONTROL OF TROPHIC CHAINS

    Get PDF
    If a nearly natural population system is deviated from its equilibrium, an important task of conservation ecology may be to control it back into equilibrium. In the paper a trophic chain is considered, and control systems are obtained by changing certain model parameters into control variables. For the equilibrium control two approaches are proposed. First, for a fixed time interval, local controllability into equilibrium is proved, and applying tools of optimal control, it is also shown how an appropriate open-loop control can be determined that actually controls the system into the equilibrium in given time. Another considered problem is to control the system to a new desired equilibrium. The problem is solved by the construction of a closed-loop control which asymptotically steers the trophic chain into this new equilibrium. In this way, actually, a controlled regime shift is realized

    Incremental Compilation of Bayesian Networks Based on Maximal Prime Subgraphs

    Get PDF
    When a Bayesian network (BN) is modified, for example adding or deleting a node, or changing the probability distributions, we usually will need a total recompilation of the model, despite feeling that a partial (re)compilation could have been enough. Especially when considering dynamic models, in which variables are added and removed very frequently, these recompilations are quite resource consuming. But even further, for the task of building a model, which is in many occasions an iterative process, there is a clear lack of flexibility. When we use the term Incremental Compilation or IC we refer to the possibility of modifying a network and avoiding a complete recompilation to obtain the new (and different) join tree (JT). The main point we intend to study in this work is JT-based inference in Bayesian networks. Apart from undertaking the triangulation problem itself, we have achieved a great improvement for the compilation in BNs. We do not develop a new architecture for BNs inference, but taking some already existing framework JT-based for probability propagation such as Hugin or Shenoy and Shafer, we have designed a method that can be successfully applied to get better performance, as the experimental evaluation will show. </jats:p
    • …
    corecore