Critical behavior of the aqueous electrolytic system 3-methylpyridine+D2O+NaBr

The system 3-methylpyridine(3MP)+water(H2O)+NaBr has been the subject of an intense scientific debate since the work of Jacob [Phys. Rev. E. 58, 2188 (1988)] and Anisimov [Phys. Rev. Lett. 85, 2336 (2000)]. The crossover critical behavior of this system seemed to show remarkable sensitivity to the weight fraction (X) of the ionic impurity NaBr. In the range X <= 0.10 the system displayed Ising behavior and a pronounced crossover to mean-field behavior in the range 0.10 <= X <= 0.16. A complete mean-field behavior was observed at X=0.17, a result that was later attributed to the existence of long-living nonequilibrium states in this system [Kostko , Phys. Rev. E. 70, 026118 (2004)]. In this paper, we report the near-critical behavior of osmotic susceptibility in the isotopically related ternary system, 3MP+heavy water(D2O)+NaBr. Detailed light-scattering experiments performed at exactly the same NaBr concentrations as investigated by Jacob reveal that the system 3MP+D2O+NaBr shows a simple Ising-type critical behavior with gamma similar or equal to 1.24 and nu similar or equal to 0.63 over the entire NaBr concentration range 0 <= X <= 0.1900. The crossover behavior is predominantly nonmonotonic and is completed well outside the critical domain. An analysis in terms of the effective susceptibility exponent (gamma(eff)) reveals that the crossover behavior is nonmonotonic for 0 <= X <= 0.1793 and tends to become monotonic for X > 0.1793. The correlation length amplitude xi(o), has a value of similar or equal to 2 A for 0.0250 <= X <= 0.1900, whereas for X=0, xi(o)similar or equal to 3.179 A. Since isotopic H -> D substitution is not expected to change the critical behavior of the system, our results support the recent results obtained by Kostko [Phys. Rev. E. 70, 026118 (2004)] that 3MP+H2O+NaBr exhibits universal Ising-type critical behavior typical for other aqueous solutions.

Desorptio/fotoionisaatio ilmanpaineessa takavarikoitujen huumausaineiden, steroidien ja räjähdysaineiden tutkimuksessa

Tutkimuksen tarkoituksena oli selvittää desorptio/fotoionisaatio ilmanpaineessa tekniikan (engl. desorption atmospheric pressure photoionization, DAPPI) soveltuvuutta rikosteknisen laboratorion näytteiden analysointiin. DAPPI on nopea massaspektrometrinen ionisaatiotekniikka, jolla voidaan tutkia yhdisteitä suoraan erilaisilta pinnoilta. DAPPI:ssa käytetään lämmitettyä mikrosirua, joka suihkuttaa höyrystynyttä liuotin- ja kaasuvirtausta kohti näytettä. Näytteen pinnan komponentit desorboituvat lämmön vaikutuksesta, jonka jälkeen ionisoituminen tapahtuu VUV-lampun emittoimien fotonien avulla.DAPPI:lla tutkittiin takavarikoituja huumausaineita, anabolisia steroideja ja räjähdysaineita sekä niiden jäämiä erilaisilta pinnoilta. Lisäksi kartoitettiin DAPPI:n mahdollisuuksia ja rajoituksia erilaisille näytematriiseille ilman näytteiden esikäsittelyä. Takavarikoitujen huumausaineiden tutkimuksessa analysoitiin erilaisia tabletteja, jauheita, kasvirouheita, huumekasveja (khat, oopium, kannabis) ja sieniä. Anabolisia steroideja tunnistettiin tableteista sekä ampulleista, jotka sisälsivät öljymäistä nestettä. Jauheet ripoteltiin kaksipuoliselle teipille ja analysoitiin siltä. Muut näytteet analysoitiin sellaisenaan ilman minkäänlaista esikäsittelyä, paitsi nestemäisten näytteiden kohdalla näyte pipetoitiin talouspaperille, joka analysoitiin DAPPI:lla. DAPPI osoittautui nopeaksi ja yksinkertaiseksi menetelmäksi takavarikoitujen huumausaineiden ja steroidien analysoimisessa. Se soveltui hyvin rikoslaboratorion erityyppisten näytteiden rutiiniseulontaan ja helpotti erityisesti huumekasvien ja öljymäisten steroidiliuosten tutkimusta. Massaspektrometrin likaantuminen pystyttiin ehkäisemään säätämällä näytteen etäisyyttä sen suuaukosta. Likaantumista ei havaittu huolimatta näytteiden korkeista konsentraatioista ja useita kuukausia jatkuneista mittauksista. Räjähdysaineiden tutkimuksessa keskityttiin seitsemän eri räjähdysaineen DAPPI-MS-menetelmän kehitykseen; trinitrotolueeni (TNT), nitroglykoli (NK), nitroglyseriini (NG), pentriitti (PETN), heksogeeni (RDX), oktogeeni (HMX) ja pikriinihappoä Nämä orgaaniset räjähteet ovat nitraattiyhdisteitä, jotka voidaan jakaa rakenteen puolesta nitroamiineihin (RDX ja HMX), nitroaromaatteihin (TNT ja pikriinihappo) sekä nitraattiestereihin (PETN, NG ja NK). Menetelmäkehityksessä räjähdysainelaimennokset pipetoitiin polymetyylimetakrylaatin (PMMA) päälle ja analysoitiin siitä. DAPPI:lla tutkittiin myäs autenttisia räjähdysainejäämiä erilaisista matriiseista. DAPPI:lla optimoitiin jokaiselle räjähdysaineelle sopiva menetelmä ja yhdisteet saatiin näkymään puhdasaineina. Räjähdysainejäämien analysoiminen erilaisista rikospaikkamateriaaleista osoittautui haastavammaksi tehtäväksi, koska matriisit aiheuttivat itsessään korkean taustan spektriin, josta räjähdysaineiden piikit eivät useimmiten erottuneet tarpeeksi. Muut desorptioionisaatiotekniikat saattavat soveltua paremmin haastavien räjähdysainejäämien havaitsemiseksi.

Falcon: A Graph Manipulation Language for Heterogeneous Systems

Graph algorithms have been shown to possess enough parallelism to keep several computing resources busy-even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error prone. To address these issues, we propose a domain-specific language (DSL), Falcon, for implementing graph algorithms that (i) abstracts the hardware, (ii) provides constructs to write explicitly parallel programs at a higher level, and (iii) can work with general algorithms that may change the graph structure (morph algorithms). We illustrate the usage of our DSL to implement local computation algorithms (that do not change the graph structure) and morph algorithms such as Delaunay mesh refinement, survey propagation, and dynamic SSSP on GPU and multicore CPUs. Using a set of benchmark graphs, we illustrate that the generated code performs close to the state-of-the-art hand-tuned implementations.

PolyMage: Automatic Optimization for Image Processing Pipelines

This paper presents the design and implementation of PolyMage, a domain-specific language and compiler for image processing pipelines. An image processing pipeline can be viewed as a graph of interconnected stages which process images successively. Each stage typically performs one of point-wise, stencil, reduction or data-dependent operations on image pixels. Individual stages in a pipeline typically exhibit abundant data parallelism that can be exploited with relative ease. However, the stages also require high memory bandwidth preventing effective utilization of parallelism available on modern architectures. For applications that demand high performance, the traditional options are to use optimized libraries like OpenCV or to optimize manually. While using libraries precludes optimization across library routines, manual optimization accounting for both parallelism and locality is very tedious. The focus of our system, PolyMage, is on automatically generating high-performance implementations of image processing pipelines expressed in a high-level declarative language. Our optimization approach primarily relies on the transformation and code generation capabilities of the polyhedral compiler framework. To the best of our knowledge, this is the first model-driven compiler for image processing pipelines that performs complex fusion, tiling, and storage optimization automatically. Experimental results on a modern multicore system show that the performance achieved by our automatic approach is up to 1.81x better than that achieved through manual tuning in Halide, a state-of-the-art language and compiler for image processing pipelines. For a camera raw image processing pipeline, our performance is comparable to that of a hand-tuned implementation.

Probabilistic graphical models for semi-supervised traffic classification

Traffic classification using machine learning continues to be an active research area. The majority of work in this area uses off-the-shelf machine learning tools and treats them as black-box classifiers. This approach turns all the modelling complexity into a feature selection problem. In this paper, we build a problem-specific solution to the traffic classification problem by designing a custom probabilistic graphical model. Graphical models are a modular framework to design classifiers which incorporate domain-specific knowledge. More specifically, our solution introduces semi-supervised learning which means we learn from both labelled and unlabelled traffic flows. We show that our solution performs competitively compared to previous approaches while using less data and simpler features. Copyright © 2010 ACM.

O conceito de realeza de Temístio e Amiano Marcelino : o caso do imperador Valentiniano I

Abstract: In the context of Late Antiquity, we observe the ideals of Royalty of two authors who shared the political events between the governments of Constantius II to Theodosius (337-395 AD), namely: the philosopher Themistius (317-388 AD) with his political speeches; and the military Ammianus Marcellinus (325 / 330-395 AD) with his work Res Gestae. During our study, we will seek to observe the characteristics of each author, and converge their life experiences to meet the convergent and divergent points of its concepts around the Imperial responsibilities. In the meantime, we emphasize the interactions between Romans and barbarians, very noticeable at that time; and how this process of interaction of cultures has influenced the thinking of the late-ancient writers studied here. Observing how a philosopher and a military developed such ideals in relation to the ruler: Valentinian I (364-375 AD), for that we made a more specific analysis of VI Speech of Themistius - the Brotherly Love or About humanity - and the XVI - XXX Books of Ammianus Marcellinus. Thus, in a time of great cultural socio-political effervescence, two non-Christian writers have written their work, in order to re-member your audience the importance of the virtues and both based on examples from the classical tradition.

Design, specification, and synthesis of aircraft electric power systems control logic

Cyber-physical systems integrate computation, networking, and physical processes. Substantial research challenges exist in the design and verification of such large-scale, distributed sensing, ac- tuation, and control systems. Rapidly improving technology and recent advances in control theory, networked systems, and computer science give us the opportunity to drastically improve our approach to integrated flow of information and cooperative behavior. Current systems rely on text-based spec- ifications and manual design. Using new technology advances, we can create easier, more efficient, and cheaper ways of developing these control systems. This thesis will focus on design considera- tions for system topologies, ways to formally and automatically specify requirements, and methods to synthesize reactive control protocols, all within the context of an aircraft electric power system as a representative application area.

This thesis consists of three complementary parts: synthesis, specification, and design. The first section focuses on the synthesis of central and distributed reactive controllers for an aircraft elec- tric power system. This approach incorporates methodologies from computer science and control. The resulting controllers are correct by construction with respect to system requirements, which are formulated using the specification language of linear temporal logic (LTL). The second section addresses how to formally specify requirements and introduces a domain-specific language for electric power systems. A software tool automatically converts high-level requirements into LTL and synthesizes a controller.

The final sections focus on design space exploration. A design methodology is proposed that uses mixed-integer linear programming to obtain candidate topologies, which are then used to synthesize controllers. The discrete-time control logic is then verified in real-time by two methods: hardware and simulation. Finally, the problem of partial observability and dynamic state estimation is ex- plored. Given a set placement of sensors on an electric power system, measurements from these sensors can be used in conjunction with control logic to infer the state of the system.

Self-reported sitting time and physical activity: interactive associations with mental well-being and productivity in office employees

Background: Little is known about how sitting time, alone or in combination with markers of physical activity (PA), influences mental well-being and work productivity. Given the need to develop workplace PA interventions that target employees' health related efficiency outcomes; this study examined the associations between self-reported sitting time, PA, mental well-being and work productivity in office employees. Methods: Descriptive cross-sectional study. Spanish university office employees (n = 557) completed a survey measuring socio-demographics, total and domain specific (work and travel) self-reported sitting time, PA (International Physical Activity Questionnaire short version), mental well-being (Warwick-Edinburg Mental Well-Being Scale) and work productivity (Work Limitations Questionnaire). Multivariate linear regression analyses determined associations between the main variables adjusted for gender, age, body mass index and occupation. PA levels (low, moderate and high) were introduced into the model to examine interactive associations. Results: Higher volumes of PA were related to higher mental well-being, work productivity and spending less time sitting at work, throughout the working day and travelling during the week, including the weekends (p < 0.05). Greater levels of sitting during weekends was associated with lower mental well-being (p < 0.05). Similarly, more sitting while travelling at weekends was linked to lower work productivity (p < 0.05). In highly active employees, higher sitting times on work days and occupational sitting were associated with decreased mental well-being (p < 0.05). Higher sitting times while travelling on weekend days was also linked to lower work productivity in the highly active (p < 0.05). No significant associations were observed in low active employees. Conclusions: Employees' PA levels exerts different influences on the associations between sitting time, mental well-being and work productivity. The specific associations and the broad sweep of evidence in the current study suggest that workplace PA strategies to improve the mental well-being and productivity of all employees should focus on reducing sitting time alongside efforts to increase PA.

Prediction of tread block forces for a free-rolling tyre in contact with a rough road

This paper describes a new approach to model the forces on a tread block for a free-rolling tyre in contact with a rough road. A theoretical analysis based on realistic tread mechanical properties and road roughness is presented, indicating partial contact between a tread block and a rough road. Hence an asperity-scale indentation model is developed using a semi-empirical formulation, taking into account both the rubber viscoelasticity and the tread block geometry. The model aims to capture the essential details of the contact at the simplest level, to make it suitable as part of a time-domain dynamic analysis of the coupled tyre-road system. The indentation model is found to have a good correlation with the finite element (FE) predictions and is validated against experimental results using a rolling contact rig. When coupled to a deformed tyre belt profile, the indentation model predicts normal and tangential force histories inside the tyre contact patch that show good agreement with FE predictions. © 2012 Elsevier B.V..

Multilinear function factorisation for time series feature extraction

This work applies a variety of multilinear function factorisation techniques to extract appropriate features or attributes from high dimensional multivariate time series for classification. Recently, a great deal of work has centred around designing time series classifiers using more and more complex feature extraction and machine learning schemes. This paper argues that complex learners and domain specific feature extraction schemes of this type are not necessarily needed for time series classification, as excellent classification results can be obtained by simply applying a number of existing matrix factorisation or linear projection techniques, which are simple and computationally inexpensive. We highlight this using a geometric separability measure and classification accuracies obtained though experiments on four different high dimensional multivariate time series datasets. © 2013 IEEE.

Molecular cloning and characterization of common carp (Cyprinus carpio L.) TCR gamma and CD3 gamma/delta chains

Partial cDNA sequences of TCR gamma and CD3 gamma/delta were isolated from the thymus of common carp (Cyprinus carpio L.) by the method of suppression subtractive hybridization (SSH). Subsequently the full length cDNAs of carp TCR gamma and CD3 gamma/delta were obtained by means of 3' RACE and 5' RACE, respectively. The full length of carp TCR gamma chain is 1368 bp and encodes 326 amino acids including a signal peptide region of 19 amino acids and a transmembrane region of 23 amino acids at the C-terminal region from aa 291 to 313. The V region of carp TCR gamma contains 109 amino acids, the core motif FGXG in J segment was also found in carp TCR gamma. The C region of carp TCR gamma contains the characteristic CX6PX6WX45C motif. The CP region of carp TCR C gamma contains 37 amino acids. The full length of carp CD3 gamma/delta is 790 bp and encodes 175 amino acids including a signal peptide region of 17 amino acids and a transmembrane region of 23 amino acids from aa 93 to 115. Similar to other known CD3 gamma/delta s, four cysteine residues in the extracellular domain and an immunoreceptor tyrosine-based activation motif ITAM (YxxL/Ix6-8YxxL/I) in the intracellular domain are also included in carp CD3 gamma/delta. Differing from other known CD3 gamma/delta s, carp CD3 gamma/delta tacks the CXXCXE motif in the extracellular domain. RTPCR analysis demonstrated that the expression of TCR gamma gene was mainly in the thymus and gill of 6-month carp, but in 18-month carp, TCR gamma gene was detected in all the examined tissues. The expression of CD3 gamma/delta gene was detected in all examined tissues of 6 and 18-month carp; among them, the highest expression level was in the thymus of 6-month carp. In situ hybridization showed that CD3 gamma/delta-expressing cells were widely distributed in the head kidney, spleen and kidney of carp, whereas in the thymus, they were densely distributed in the lymphoid outer zone and scattered in the epithelioid inner zone. (c) 2007 Published by Etsevier Ltd.

A differential recursive scheme for suppression of Peak to average power ratio for OFDM

A differential recursive scheme for suppression of Peak to average power ratio (PAPR) for Orthogonal frequency division multiplexing (OFDM) signal is proposed in this thesis. The pseudo-randomized modulating vector for the subcarrier series is differentially phase-encoded between successive components in frequency domain first, and recursion manipulates several samples of Inverse fast Fourier transformation (IFFT) output in time domain. Theoretical analysis and experimental result exhibit advantage of differential recursive scheme over direct output scheme in PAPR suppression. And the overall block diagram of the scheme is also given.

Formal specification and refinement of a safe train control function

Motivated by the design and development challenges of the BART case study, an approach for developing and analyzing a formal model for reactive systems is presented. The approach makes use of a domain specific language for specifying control algorithms able to satisfy competing properties such as safety and optimality. The domain language, called SPC, offers several key abstractions such as the state, the profile, and the constraint to facilitate problem specification. Using a high-level program transformation system such as HATS being developed at the University of Nebraska at Omaha, specifications in this modelling language can be transformed to ML code. The resulting executable specification can be further refined by applying generic transformations to the abstractions provided by the domain language. Problem dependent transformations utilizing the domain specific knowledge and properties may also be applied. The result is a significantly more efficient implementation which can be used for simulation and gaining deeper insight into design decisions and various control policies. The correctness of transformations can be established using a rewrite-rule based induction theorem prover Rewrite Rule Laboratory developed at the University of New Mexico.

一种用户主导的面向领域应用软件开发新方法

提出一种应用软件开发的新方法 ,称为“用户工程”.这是一种基于构件化软件系统结构的用户主导的面向领域的应用软件开发方法 ,强调用户在应用软件开发中的主导作用 ,试图将应用软件的开发过程变成用户详细定义过程 ,而不仅仅是传统的编程过程 .它为越来越多的应用软件开发需求提供了可能有效的一个途径

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).