Discrete multicomponent model for biodiesel spray combustion simulation

An important first step in spray combustion simulation is an accurate determination of the fuel properties which affects the modelling of spray formation and reaction. In a practical combustion simulation, the implementation of a multicomponent model is important in capturing the relative volatility of different fuel components. A Discrete Multicomponent (DM) model is deemed to be an appropriate candidate to model a composite fuel like biodiesel which consists of four components of fatty acid methyl esters (FAME). In this paper, the DM model is compared with the traditional Continuous Thermodynamics (CTM) model for both diesel and biodiesel. The CTM model is formulated based on mixing rules that incorporate the physical and thermophysical properties of pure components into a single continuous surrogate for the composite fuel. The models are implemented within the open-source CFD code OpenFOAM, and a semi-quantitative comparison is made between the predicted spray-combustion characteristics and optical measurements of a swirl-stabilised flame of diesel and biodiesel. The DM model performs better than the CTM model in predicting a higher magnitude of heat release rate in the top flame brush region of the biodiesel flame compared to that of the diesel flame. Using both the DM and CTM models, the simulation successfully reproduces the droplet size, volume flux, and droplet density profiles of diesel and biodiesel. The DM model predicts a longer spray penetration length for biodiesel compared to that of diesel, as seen in the experimental data. Also, the DM model reproduces a segregated biodiesel fuel vapour field and spray in which the most abundant FAME component has the longest vapour penetration. In the biodiesel flame, the relative abundance of each fuel component is found to dominate over the relative volatility in terms of the vapour species distribution and vice versa in the liquid species distribution. © 2014 Elsevier Ltd. All rights reserved.

Unified form language: A domain-specific language for weak formulations of partial differential equations

We present the Unified Form Language (UFL), which is a domain-specific language for representing weak formulations of partial differential equations with a view to numerical approximation. Features of UFL include support for variational forms and functionals, automatic differentiation of forms and expressions, arbitrary function space hierarchies formultifield problems, general differential operators and flexible tensor algebra. With these features, UFL has been used to effortlessly express finite element methods for complex systems of partial differential equations in near-mathematical notation, resulting in compact, intuitive and readable programs. We present in this work the language and its construction. An implementation of UFL is freely available as an open-source software library. The library generates abstract syntax tree representations of variational problems, which are used by other software libraries to generate concrete low-level implementations. Some application examples are presented and libraries that support UFL are highlighted. © 2014 ACM.

QtUCP-A program for determining unit-cell parameters in electron diffraction experiments using double-tilt and rotation-tilt holders

A computer program, QtUCP, has been developed based on several well-established algorithms using GCC 4.0 and Qt (R) 4.0 (Open Source Edition) under Debian GNU/Linux 4.0r0. it can determine the unit-cell parameters from an electron diffraction tilt series obtained from both double-tilt and rotation-tilt holders. In this approach, two or more primitive cells of the reciprocal lattice are determined from experimental data, in the meantime, the measurement errors of the tilt angles are checked and minimized. Subsequently, the derived primitive cells are converted into the reduced form and then transformed into the reduced direct primitive cell. Finally all the patterns are indexed and the least-squares refinement is employed to obtain the optimized results of the lattice parameters. Finally, two examples are given to show the application of the program, one is based on the experiment, the other is from the simulation. (C) 2008 Elsevier B.V. All rights reserved.

VCSTalk:基于DEA的开源软件开发人员效率评价工具

介绍了VCSTalk的具体设计和实现架构,并展示了它用于评价若干开源软件项目中的开发人员效率的一个具体实例.

一种开放源代码的网络仿真器的原理与实现

随着互联网的飞速发展,网络拥塞已经成为一个十分重要的问题,网络仿真是一种检测拥塞控制算法有效性的常用方法.该文给出了一种开放源代码的网络仿真器NS2(Network Simulator V2)的原理与实现.首先比较了四种不同仿真器的优缺点,然后详细描述了NS2的模块组成、工作环境、主代码结构以及扩展方法等,最后用RED(Random EarlyDetection)队列调度和移动IP数据传输两个典型实例说明了NS2的应用价值.

The Application of Toolkit of Optimization in Designs of Accelerator Magnets

The traditional design of accelerator magnet usually involves many time consuming iterations of the manual analysis process. A software platform to do these iterations automatically is proposed in this paper. In this platform, we use DAKOTA (a open source software developed by Sandia National Laboratories) as the optimizing routine, which provides a variety of optimization methods and algorithms, and OPERA (software from Vector Fields) is selected as the electromagnetic simulating routine. In this paper, two examples of designs of accelerator magnets are used to illustrate how an optimization algorithm is chosen and the platform works.

data transformation and attribute subset selection: do they help make differences in software failure prediction?

IEEE, IEEE Comp Soc, Tech Council Software Engn

an empirical study on bug assignment automation using chinese bug data

Univ SE Calif, Ctr Syst & Software Engn, ABB, Microsoft Res, IEEE, ACMSIGSOFT, N Carolina State Univ Comp Sci

DSpace Manual: Software version 1.5

DSpace is an open source software platform that enables organizations to: - Capture and describe digital material using a submission workflow module, or a variety of programmatic ingest options - Distribute an organization's digital assets over the web through a search and retrieval system - Preserve digital assets over the long term This system documentation includes a functional overview of the system, which is a good introduction to the capabilities of the system, and should be readable by nontechnical personnel. Everyone should read this section first because it introduces some terminology used throughout the rest of the documentation. For people actually running a DSpace service, there is an installation guide, and sections on configuration and the directory structure. Note that as of DSpace 1.2, the administration user interface guide is now on-line help available from within the DSpace system. Finally, for those interested in the details of how DSpace works, and those potentially interested in modifying the code for their own purposes, there is a detailed architecture and design section.

KInNeSS: A Modular Framework for Computational Neuroscience

Making use of very detailed neurophysiological, anatomical, and behavioral data to build biological-realistic computational models of animal behavior is often a difficult task. Until recently, many software packages have tried to resolve this mismatched granularity with different approaches. This paper presents KInNeSS, the KDE Integrated NeuroSimulation Software environment, as an alternative solution to bridge the gap between data and model behavior. This open source neural simulation software package provides an expandable framework incorporating features such as ease of use, scalabiltiy, an XML based schema, and multiple levels of granularity within a modern object oriented programming design. KInNeSS is best suited to simulate networks of hundreds to thousands of branched multu-compartmental neurons with biophysical properties such as membrane potential, voltage-gated and ligand-gated channels, the presence of gap junctions of ionic diffusion, neuromodulation channel gating, the mechanism for habituative or depressive synapses, axonal delays, and synaptic plasticity. KInNeSS outputs include compartment membrane voltage, spikes, local-field potentials, and current source densities, as well as visualization of the behavior of a simulated agent. An explanation of the modeling philosophy and plug-in development is also presented. Further developement of KInNeSS is ongoing with the ultimate goal of creating a modular framework that will help researchers across different disciplines to effecitively collaborate using a modern neural simulation platform.

CONFIGR: A Vision-Based Model for Long-Range Figure Completion

CONFIGR (CONtour FIgure GRound) is a computational model based on principles of biological vision that completes sparse and noisy image figures. Within an integrated vision/recognition system, CONFIGR posits an initial recognition stage which identifies figure pixels from spatially local input information. The resulting, and typically incomplete, figure is fed back to the “early vision” stage for long-range completion via filling-in. The reconstructed image is then re-presented to the recognition system for global functions such as object recognition. In the CONFIGR algorithm, the smallest independent image unit is the visible pixel, whose size defines a computational spatial scale. Once pixel size is fixed, the entire algorithm is fully determined, with no additional parameter choices. Multi-scale simulations illustrate the vision/recognition system. Open-source CONFIGR code is available online, but all examples can be derived analytically, and the design principles applied at each step are transparent. The model balances filling-in as figure against complementary filling-in as ground, which blocks spurious figure completions. Lobe computations occur on a subpixel spatial scale. Originally designed to fill-in missing contours in an incomplete image such as a dashed line, the same CONFIGR system connects and segments sparse dots, and unifies occluded objects from pieces locally identified as figure in the initial recognition stage. The model self-scales its completion distances, filling-in across gaps of any length, where unimpeded, while limiting connections among dense image-figure pixel groups that already have intrinsic form. Long-range image completion promises to play an important role in adaptive processors that reconstruct images from highly compressed video and still camera images.

KInNeSS: A Modular Framework for Computational Neuroscience

Making use of very detailed neurophysiological, anatomical, and behavioral data to build biologically-realistic computational models of animal behavior is often a difficult task. Until recently, many software packages have tried to resolve this mismatched granularity with different approaches. This paper presents KInNeSS, the KDE Integrated NeuroSimulation Software environment, as an alternative solution to bridge the gap between data and model behavior. This open source neural simulation software package provides an expandable framework incorporating features such as ease of use, scalability, an XML based schema, and multiple levels of granularity within a modern object oriented programming design. KInNeSS is best suited to simulate networks of hundreds to thousands of branched multi-compartmental neurons with biophysical properties such as membrane potential, voltage-gated and ligand-gated channels, the presence of gap junctions or ionic diffusion, neuromodulation channel gating, the mechanism for habituative or depressive synapses, axonal delays, and synaptic plasticity. KInNeSS outputs include compartment membrane voltage, spikes, local-field potentials, and current source densities, as well as visualization of the behavior of a simulated agent. An explanation of the modeling philosophy and plug-in development is also presented. Further development of KInNeSS is ongoing with the ultimate goal of creating a modular framework that will help researchers across different disciplines to effectively collaborate using a modern neural simulation platform.

Searching the Sky with CONFIGR-STARS

SyNAPSE program of the Defense Advanced Projects Research Agency (HRL Laboratories LLC, subcontract #801881-BS under DARPA prime contract HR0011-09-C-0001); CELEST, a National Science Foundation Science of Learning Center (SBE-0354378)

Design history: exploring corporate communities

A design history is a narrative involving a multitude of social groups, interpretive flexibility, and eventual stabilization of shared understanding. Design history surfaces the practices that help shape and define engagements and can increase not only our theoretical understanding of what design is, but also our capacity to realize this understanding in practice. We use a design history perspective to examine how corporate technology initiatives establish and support open source communities and the crafting of relevant design practices that enable their advancement. We foster an evolving expression of design research that treats artifacts not as stable objects to be singularly evaluated, but as evolving systems contingent on historical trajectories.

permGPU: Using graphics processing units in RNA microarray association studies.

BACKGROUND: Many analyses of microarray association studies involve permutation, bootstrap resampling and cross-validation, that are ideally formulated as embarrassingly parallel computing problems. Given that these analyses are computationally intensive, scalable approaches that can take advantage of multi-core processor systems need to be developed. RESULTS: We have developed a CUDA based implementation, permGPU, that employs graphics processing units in microarray association studies. We illustrate the performance and applicability of permGPU within the context of permutation resampling for a number of test statistics. An extensive simulation study demonstrates a dramatic increase in performance when using permGPU on an NVIDIA GTX 280 card compared to an optimized C/C++ solution running on a conventional Linux server. CONCLUSIONS: permGPU is available as an open-source stand-alone application and as an extension package for the R statistical environment. It provides a dramatic increase in performance for permutation resampling analysis in the context of microarray association studies. The current version offers six test statistics for carrying out permutation resampling analyses for binary, quantitative and censored time-to-event traits.