Pasquale del Pezzo, Duke of Caianello, Neapolitan mathematician

This article is dedicated to a reconstruction of some events and achievements, both personal and scientific, in the life of the Neapolitan mathematician Pasquale del Pezzo, Duke of Caianello.

JPEG standard uniform quantization error modeling with applications to sequential and progressive operation modes

In this paper we propose a method for computing JPEG quantization matrices for a given mean square error or PSNR. Then, we employ our method to compute JPEG standard progressive operation mode definition scripts using a quantization approach. Therefore, it is no longer necessary to use a trial and error procedure to obtain a desired PSNR and/or definition script, reducing cost. Firstly, we establish a relationship between a Laplacian source and its uniform quantization error. We apply this model to the coefficients obtained in the discrete cosine transform stage of the JPEG standard. Then, an image may be compressed using the JPEG standard under a global MSE (or PSNR) constraint and a set of local constraints determined by the JPEG standard and visual criteria. Secondly, we study the JPEG standard progressive operation mode from a quantization based approach. A relationship between the measured image quality at a given stage of the coding process and a quantization matrix is found. Thus, the definition script construction problem can be reduced to a quantization problem. Simulations show that our method generates better quantization matrices than the classical method based on scaling the JPEG default quantization matrix. The estimation of PSNR has usually an error smaller than 1 dB. This figure decreases for high PSNR values. Definition scripts may be generated avoiding an excessive number of stages and removing small stages that do not contribute during the decoding process with a noticeable image quality improvement.

A Petri Nets-based Scheduling Methodology forMultipurpose Batch Plants.

This article presents an optimization methodology of batch production processes assembled by shared resources which rely on a mapping of state-events into time-events allowing in this way the straightforward use of a well consolidated scheduling policies developed for manufacturing systems. A technique to generate the timed Petri net representation from a continuous dynamic representation (Differential-Algebraic Equations systems (DAEs)) of the production system is presented together with the main characteristics of a Petri nets-based tool implemented for optimization purposes. This paper describes also how the implemented tool generates the coverability tree and how it can be pruned by a general purpose heuristic. An example of a distillation process with two shared batch resources is used to illustrate the optimization methodology proposed.

Robustness of Drosophila early embryo and wing imaginal disc development

Within a developing organism, cells require information on where they are in order to differentiate into the correct cell-type. Pattern formation is the process by which cells acquire and process positional cues and thus determine their fate. This can be achieved by the production and release of a diffusible signaling molecule, called a morphogen, which forms a concentration gradient: exposure to different morphogen levels leads to the activation of specific signaling pathways. Thus, in response to the morphogen gradient, cells start to express different sets of genes, forming domains characterized by a unique combination of differentially expressed genes. As a result, a pattern of cell fates and specification emerges.Though morphogens have been known for decades, it is not yet clear how these gradients form and are interpreted in order to yield highly robust patterns of gene expression. During my PhD thesis, I investigated the properties of Bicoid (Bcd) and Decapentaplegic (Dpp), two morphogens involved in the patterning of the anterior-posterior axis of Drosophila embryo and wing primordium, respectively. In particular, I have been interested in understanding how the pattern proportions are maintained across embryos of different sizes or within a growing tissue. This property is commonly referred to as scaling and is essential for yielding functional organs or organisms. In order to tackle these questions, I analysed fluorescence images showing the pattern of gene expression domains in the early embryo and wing imaginal disc. After characterizing the extent of these domains in a quantitative and systematic manner, I introduced and applied a new scaling measure in order to assess how well proportions are maintained. I found that scaling emerged as a universal property both in early embryos (at least far away from the Bcd source) and in wing imaginal discs (across different developmental stages). Since we were also interested in understanding the mechanisms underlying scaling and how it is transmitted from the morphogen to the target genes down in the signaling cascade, I also quantified scaling in mutant flies where this property could be disrupted. While scaling is largely conserved in embryos with altered bcd dosage, my modeling suggests that Bcd trapping by the nuclei as well as pre-steady state decoding of the morphogen gradient are essential to ensure precise and scaled patterning of the Bcd signaling cascade. In the wing imaginal disc, it appears that as the disc grows, the Dpp response expands and scales with the tissue size. Interestingly, scaling is not perfect at all positions in the field. The scaling of the target gene domains is best where they have a function; Spalt, for example, scales best at the position in the anterior compartment where it helps to form one of the anterior veins of the wing. Analysis of mutants for pentagone, a transcriptional target of Dpp that encodes a secreted feedback regulator of the pathway, indicates that Pentagone plays a key role in scaling the Dpp gradient activity.

Mekanismien dynamiikan simuloinnissa sovellettavia numeerisia- ja mallinnusmenetelmiä

Koneet voidaan usein jakaa osajärjestelmiin, joita ovat ohjaus- ja säätöjärjestelmät, voimaa tuottavat toimilaitteet ja voiman välittävät mekanismit. Eri osajärjestelmiä on simuloitu tietokoneavusteisesti jo usean vuosikymmenen ajan. Osajärjestelmien yhdistäminen on kuitenkin uudempi ilmiö. Usein esimerkiksi mekanismien mallinnuksessa toimilaitteen tuottama voimaon kuvattu vakiona, tai ajan funktiona muuttuvana voimana. Vastaavasti toimilaitteiden analysoinnissa mekanismin toimilaitteeseen välittämä kuormitus on kuvattu vakiovoimana, tai ajan funktiona työkiertoa kuvaavana kuormituksena. Kun osajärjestelmät on erotettu toisistaan, on niiden välistenvuorovaikutuksien tarkastelu erittäin epätarkkaa. Samoin osajärjestelmän vaikutuksen huomioiminen koko järjestelmän käyttäytymissä on hankalaa. Mekanismien dynamiikan mallinnukseen on kehitetty erityisesti tietokoneille soveltuvia numeerisia mallinnusmenetelmiä. Useimmat menetelmistä perustuvat Lagrangen menetelmään, joka mahdollistaa vapaasti valittaviin koordinaattimuuttujiin perustuvan mallinnuksen. Numeerista ratkaisun mahdollistamiseksi menetelmän avulla muodostettua differentiaali-algebraaliyhtälöryhmää joudutaan muokkaamaan esim. derivoimalla rajoiteyhtälöitä kahteen kertaan. Menetelmän alkuperäisessä numeerisissa ratkaisuissa kaikki mekanismia kuvaavat yleistetyt koordinaatit integroidaan jokaisella aika-askeleella. Tästä perusmenetelmästä johdetuissa menetelmissä riippumattomat yleistetyt koordinaatit joko integroidaan ja riippuvat koordinaatit ratkaistaan rajoiteyhtälöiden perusteella tai yhtälöryhmän kokoa pienennetään esim. käyttämällä nopeus- ja kiihtyvyysanalyyseissä eri kiertymäkoordinaatteja kuin asema-analyysissä. Useimmat integrointimenetelmät on alun perin tarkoitettu differentiaaliyhtälöiden (ODE) ratkaisuunjolloin yhtälöryhmään liitetyt niveliä kuvaavat algebraaliset rajoiteyhtälöt saattavat aiheuttaa ongelmia. Nivelrajoitteiden virheiden korjaus, stabilointi, on erittäin tärkeää mekanismien dynamiikan simuloinnin onnistumisen ja tulosten oikeellisuuden kannalta. Mallinnusmenetelmien johtamisessa käytetyn virtuaalisen työn periaatteen oletuksena nimittäin on, etteivät rajoitevoimat tee työtä, eli rajoitteiden vastaista siirtymää ei tapahdu. Varsinkaan monimutkaisten järjestelmien pidemmissä analyyseissä nivelrajoitteet eivät toteudu tarkasti. Tällöin järjestelmän energiatasapainoei toteudu ja järjestelmään muodostuu virtuaalista energiaa, joka rikkoo virtuaalisen työn periaatetta, Tästä syystä tulokset eivät enää pidäpaikkaansa. Tässä raportissa tarkastellaan erityyppisiä mallinnus- ja ratkaisumenetelmiä, ja vertaillaan niiden toimivuutta yksinkertaisten mekanismien numeerisessa ratkaisussa. Menetelmien toimivuutta tarkastellaan ratkaisun tehokkuuden, nivelrajoitteiden toteutumisen ja energiatasapainon säilymisen kannalta.

Studies on integrating kinematic design method with mechanical systems simulation techniques

Theultimate goal of any research in the mechanism/kinematic/design area may be called predictive design, ie the optimisation of mechanism proportions in the design stage without requiring extensive life and wear testing. This is an ambitious goal and can be realised through development and refinement of numerical (computational) technology in order to facilitate the design analysis and optimisation of complex mechanisms, mechanical components and systems. As a part of the systematic design methodology this thesis concentrates on kinematic synthesis (kinematic design and analysis) methods in the mechanism synthesis process. The main task of kinematic design is to find all possible solutions in the form of structural parameters to accomplish the desired requirements of motion. Main formulations of kinematic design can be broadly divided to exact synthesis and approximate synthesis formulations. The exact synthesis formulation is based in solving n linear or nonlinear equations in n variables and the solutions for the problem areget by adopting closed form classical or modern algebraic solution methods or using numerical solution methods based on the polynomial continuation or homotopy. The approximate synthesis formulations is based on minimising the approximation error by direct optimisation The main drawbacks of exact synthesis formulationare: (ia) limitations of number of design specifications and (iia) failure in handling design constraints- especially inequality constraints. The main drawbacks of approximate synthesis formulations are: (ib) it is difficult to choose a proper initial linkage and (iib) it is hard to find more than one solution. Recentformulations in solving the approximate synthesis problem adopts polynomial continuation providing several solutions, but it can not handle inequality const-raints. Based on the practical design needs the mixed exact-approximate position synthesis with two exact and an unlimited number of approximate positions has also been developed. The solutions space is presented as a ground pivot map but thepole between the exact positions cannot be selected as a ground pivot. In this thesis the exact synthesis problem of planar mechanism is solved by generating all possible solutions for the optimisation process ¿ including solutions in positive dimensional solution sets - within inequality constraints of structural parameters. Through the literature research it is first shown that the algebraic and numerical solution methods ¿ used in the research area of computational kinematics ¿ are capable of solving non-parametric algebraic systems of n equations inn variables and cannot handle the singularities associated with positive-dimensional solution sets. In this thesis the problem of positive-dimensional solutionsets is solved adopting the main principles from mathematical research area of algebraic geometry in solving parametric ( in the mathematical sense that all parameter values are considered ¿ including the degenerate cases ¿ for which the system is solvable ) algebraic systems of n equations and at least n+1 variables.Adopting the developed solution method in solving the dyadic equations in direct polynomial form in two- to three-precision-points it has been algebraically proved and numerically demonstrated that the map of the ground pivots is ambiguousand that the singularities associated with positive-dimensional solution sets can be solved. The positive-dimensional solution sets associated with the poles might contain physically meaningful solutions in the form of optimal defectfree mechanisms. Traditionally the mechanism optimisation of hydraulically driven boommechanisms is done at early state of the design process. This will result in optimal component design rather than optimal system level design. Modern mechanismoptimisation at system level demands integration of kinematic design methods with mechanical system simulation techniques. In this thesis a new kinematic design method for hydraulically driven boom mechanism is developed and integrated in mechanical system simulation techniques. The developed kinematic design method is based on the combinations of two-precision-point formulation and on optimisation ( with mathematical programming techniques or adopting optimisation methods based on probability and statistics ) of substructures using calculated criteria from the system level response of multidegree-of-freedom mechanisms. Eg. by adopting the mixed exact-approximate position synthesis in direct optimisation (using mathematical programming techniques) with two exact positions and an unlimitednumber of approximate positions the drawbacks of (ia)-(iib) has been cancelled.The design principles of the developed method are based on the design-tree -approach of the mechanical systems and the design method ¿ in principle ¿ is capable of capturing the interrelationship between kinematic and dynamic synthesis simultaneously when the developed kinematic design method is integrated with the mechanical system simulation techniques.

Identifying quantitative operation principles in metabolic pathways: a systematic method for searching feasible enzyme activity patterns leading to cellular adaptive responses

Background: Optimization methods allow designing changes in a system so that specific goals are attained. These techniques are fundamental for metabolic engineering. However, they are not directly applicable for investigating the evolution of metabolic adaptation to environmental changes. Although biological systems have evolved by natural selection and result in well-adapted systems, we can hardly expect that actual metabolic processes are at the theoretical optimum that could result from an optimization analysis. More likely, natural systems are to be found in a feasible region compatible with global physiological requirements. Results: We first present a new method for globally optimizing nonlinear models of metabolic pathways that are based on the Generalized Mass Action (GMA) representation. The optimization task is posed as a nonconvex nonlinear programming (NLP) problem that is solved by an outer- approximation algorithm. This method relies on solving iteratively reduced NLP slave subproblems and mixed-integer linear programming (MILP) master problems that provide valid upper and lower bounds, respectively, on the global solution to the original NLP. The capabilities of this method are illustrated through its application to the anaerobic fermentation pathway in Saccharomyces cerevisiae. We next introduce a method to identify the feasibility parametric regions that allow a system to meet a set of physiological constraints that can be represented in mathematical terms through algebraic equations. This technique is based on applying the outer-approximation based algorithm iteratively over a reduced search space in order to identify regions that contain feasible solutions to the problem and discard others in which no feasible solution exists. As an example, we characterize the feasible enzyme activity changes that are compatible with an appropriate adaptive response of yeast Saccharomyces cerevisiae to heat shock Conclusion: Our results show the utility of the suggested approach for investigating the evolution of adaptive responses to environmental changes. The proposed method can be used in other important applications such as the evaluation of parameter changes that are compatible with health and disease states.

Human gustation: when the brain has taste.

What we put into our mouths can nourish or kill us. A new study uses state-of-the-art electroencephalogram decoding to detail how we and our brains know what we taste.

Neural detection of complex sound sequences in the absence of consciousness.

The neural response to a violation of sequences of identical sounds is a typical example of the brain's sensitivity to auditory regularities. Previous literature interprets this effect as a pre-attentive and unconscious processing of sensory stimuli. By contrast, a violation to auditory global regularities, i.e. based on repeating groups of sounds, is typically detectable when subjects can consciously perceive them. Here, we challenge the notion that global detection implies consciousness by testing the neural response to global violations in a group of 24 patients with post-anoxic coma (three females, age range 45-87 years), treated with mild therapeutic hypothermia and sedation. By applying a decoding analysis to electroencephalographic responses to standard versus deviant sound sequences, we found above-chance decoding performance in 10 of 24 patients (Wilcoxon signed-rank test, P < 0.001), despite five of them being mildly hypothermic, sedated and unarousable. Furthermore, consistently with previous findings based on the mismatch negativity the progression of this decoding performance was informative of patients' chances of awakening (78% predictive of awakening). Our results show for the first time that detection of global regularities at neural level exists despite a deeply unconscious state.

Theta-duality on Prym varieties and a Torelli Theorem

Let $\pi : \widetilde C \to C$ be an unramified double covering of irreducible smooth curves and let $P$ be the attached Prym variety. We prove the scheme-theoretic theta-dual equalities in the Prym variety $T(\widetilde C)=V^2$ and $T(V^2)=\widetilde C$, where $V^2$ is the Brill-Noether locus of $P$ associated to $\pi$ considered by Welters. As an application we prove a Torelli theorem analogous to the fact that the symmetric product $D^{(g)}$ of a curve $D$ of genus $g$ determines the curve.

Wavelet Filter Parameterization for Compression of Spectral Images

Vaatimus kuvatiedon tiivistämisestä on tullut entistä ilmeisemmäksi viimeisen kymmenen vuoden aikana kuvatietoon perustuvien sovellutusten myötä. Nykyisin kiinnitetään erityistä huomiota spektrikuviin, joiden tallettaminen ja siirto vaativat runsaasti levytilaa ja kaistaa. Aallokemuunnos on osoittautunut hyväksi ratkaisuksi häviöllisessä tiedontiivistämisessä. Sen toteutus alikaistakoodauksessa perustuu aallokesuodattimiin ja ongelmana on sopivan aallokesuodattimen valinta erilaisille tiivistettäville kuville. Tässä työssä esitetään katsaus tiivistysmenetelmiin, jotka perustuvat aallokemuunnokseen. Ortogonaalisten suodattimien määritys parametrisoimalla on työn painopisteenä. Työssä todetaan myös kahden erilaisen lähestymistavan samanlaisuus algebrallisten yhtälöiden avulla. Kokeellinen osa sisältää joukon testejä, joilla perustellaan parametrisoinnin tarvetta. Erilaisille kuville tarvitaan erilaisia suodattimia sekä erilaiset tiivistyskertoimet saavutetaan eri suodattimilla. Lopuksi toteutetaan spektrikuvien tiivistys aallokemuunnoksen avulla.

A geometric chracterization of the nucleolus of the assignment game

Maschler et al. (1979) caracteritzen geomètricament la intersecció del kernel i del core en els jocs cooperatius, demostrant que les distribucions que pertanyen a ambdós conjunts es troben en el punt mig d’un cert rang de negociació entre parelles de jugadors. En el cas dels jocs d’assignació, aquesta caracterització vol dir que el kernel només conté aquells elements del core on el màxim que un jugador pot transferir a una parella òptima és igual al màxim que aquesta parella li pot transferir, sense sortir-se’n del core. En aquest treball demostrem que el nucleolus d’un joc d’assignació queda caracteritzat si requerim que aquesta propietat de bisecció es compleixi no només per parelles, sinó també per coalicions entre sectors aparellades òptimament.

A geometric chracterization of the nucleolus of the assignment game

Maschler et al. (1979) caracteritzen geomètricament la intersecció del kernel i del core en els jocs cooperatius, demostrant que les distribucions que pertanyen a ambdós conjunts es troben en el punt mig d’un cert rang de negociació entre parelles de jugadors. En el cas dels jocs d’assignació, aquesta caracterització vol dir que el kernel només conté aquells elements del core on el màxim que un jugador pot transferir a una parella òptima és igual al màxim que aquesta parella li pot transferir, sense sortir-se’n del core. En aquest treball demostrem que el nucleolus d’un joc d’assignació queda caracteritzat si requerim que aquesta propietat de bisecció es compleixi no només per parelles, sinó també per coalicions entre sectors aparellades òptimament.

The differentiable chain functor is not homotopy equivalent to the continuous chain functor

Let $S_*$ and $S_*^\{infty}$ be the functors of continuous and differentiable singular chains on the category of differentiable manifolds. We prove that the natural transformation $i: S_*^\infty \rightarrow S_*$, which induces homology equivalences over each manifold, is not a natural homotopy equivalence.

Radiaalikompressorin spiraalivirtauksen numeerinen mallinnus

Diplomityössä mallinnetaan numeerisesti radiaalikompressorin spiraalin virtaus. Spiraalin tarkoituksena radiaalikompressorissa on kerätä tasaisesti virtaus diffuusorin kehältä. Spiraaliin on viime aikoina kiinnitetty enemmän huomiota, koska on havaittu, että kompressorin hyötysuhdetta voidaan parantaa spiraalia optimoimalla. Spiraalin toimintaa tarkastellaan kolmella eri massavirralla. Työn alussa käsitellään spiraalin toimintaperiaatteita. Numeerisena ratkaisijana käytetään Teknillisessä korkeakoulussa kehitettyä FIN-FLO -koodia. FINFLO -laskentaohjelmassa ratkaistaan Navier-Stokes yhtälöt kolmeulotteiselle laskenta-alueelle. Diskretointi perustuu kontrollitilavuus menetelmään. Työssä käsitellään laskentakoodin toimintaperiaatteitta. Turbulenssia mallinnetaan algebrallisella Baldwin-Lomaxin ja kahden yhtälön Chienin k-e turbulenssimalleilla. Laskentatuloksia verrataan Lappeenrannan teknillisessä korkeakoulussa tehtyihin mittauksiin kyseessä olevasta kompressorin spiraalista. Myös eri turbulenssimalleilla ja hilatasoilla saatuja tuloksia verrataan keskenään. Laskentatuloksien jälkikäsittelyä varten ohjelmoitiin neljä eri tietokoneohjelmaa. Laskennalla pyritään saamaan lisäselvyyttä virtauksen käyttäytymiseen spiraalissa ja erityisesti ns. kielen alueella. Myös kahden eri turbulenssimallin toimivuutta kompressorin numeerisessa mallinnuksessa tutkitaan.