Search

The training phase of the Continuous Space Language Model (CSLM) was implemented in the NVIDIA hardware/software architecture Compute Unified Device Architecture (CUDA). A detailed explanation of the CSLM algorithm is provided. Implementation was accomplished using a combination of CUBLAS library routines, NVIDIA NPP functions, and CUDA kernel calls on three different CUDA enabled devices of varying compute capability and a time savings over the traditional CPU approach demonstrated. The efficiency of the CUDA version of the open source implementation is analyzed and compared to that using the Intel Math Kernel Libraries (MKL) on a variety of CUDA enabled and multi-core CPU platforms. It is demonstrated that substantial performance benefit can be obtained using CUDA, even with nonoptimal code. Techniques for optimizing performance are then provided. Furthermore, an analysis is performed to determine the conditions in which the performance of CUDA exceeds that of the multi-core MKL realization. [ABSTRACT FROM AUTHOR]

Abstract: Complex learning scenarios are represented using Educational Modeling Languages (EMLs). Different people with specific skills usually design these scenarios. The IMS LD is a commonly used EML for which some visual editors are being created in order to assist the authoring process. However, these editors have a limited level of expressiveness and do not provide the facilities for designers to collaborate in the design process. The LPCEL Editor provides a broad level of expressiveness and facilitates the authoring process with an editor that includes: (1) Visual Elements, (2) Intermediate Representation, (3) Learning Patterns, (4) Collaboration tools and (5) Web Services. In order to verify that the components are sufficient, we conducted a user evaluation to analyze their perspective regarding the level of functionality of the tools. [Copyright &y& Elsevier]

Motivation: Only models that are accessible to researchers can be reused. As computational models evolve over time, a number of different but related versions of a model exist. Consequently, tools are required to manage not only well-curated models but also their associated versions.Results: In this work, we discuss conceptual requirements for model version control. Focusing on XML formats such as Systems Biology Markup Language and CellML, we present methods for the identification and explanation of differences and for the justification of changes between model versions. In consequence, researchers can reflect on these changes, which in turn have considerable value for the development of new models. The implementation of model version control will therefore foster the exploration of published models and increase their reusability.Availability: We have implemented the proposed methods in a software library called Biochemical Model Version Control System. It is freely available at http://sems.uni-rostock.de/bives/. Biochemical Model Version Control System is also integrated in the online application BudHat, which is available for testing at http://sems.uni-rostock.de/budhat/ (The version described in this publication is available from http://budhat-demo.sems.uni-rostock.de/).Contact: dagmar.waltemath@uni-rostock.de [ABSTRACT FROM AUTHOR]

In this paper we present a summary of our work which has led to the conception of a new model for the fast construction of proximity graphs. We present the state of the art in graph self-assembly, and then we detail the self-assembly behavior observed in real ants from which our model is derived. We describe our main algorithm, called AntGraph, where each ant represents one datum and where the proximity graph is built in an incremental way. Ants perform two steps: following the path of maximum local similarity, and then connecting to other ants. We present a hierarchical extension, called H-AntGraph, which can build large graphs (with up to 1 million data items). We study the properties of the constructed graphs, and compare our results with those obtained by other methods. We use force-directed graph layout algorithms to display the graphs and to allow the domain expert to perform an interactive clustering task. We validate this approach with a comparative user-study. [ABSTRACT FROM PUBLISHER]

Unreliable component security hinders the development of component technology. Component security testing is rarely researched with comprehensive focus; several approaches or technologies for detecting vulnerabilities in component security have been proposed, but most are infeasible. A testing approach for component security, which is based on the chemical abstract machine, is proposed for detecting explicit and implicit component security vulnerabilities. We develop an extended chemical abstract machine model, called eCHAM, and generate a state transfer tree and testing sequence for components based on the proposed model. The model can help test the explicit security exceptions of components according to the testing approach of interface fault injection. Condition and state mutation algorithms for identifying implicit security exceptions are also proposed. Vulnerability testing reports are obtained according to the test results. Experiments were conducted in an integration testing platform to verify the applicability of the proposed approach. Results show that the approach is effective and practicable. The proposed approach can detect explicit and implicit security exceptions of components. [ABSTRACT FROM AUTHOR]

Abstract: The ability to infer the characteristics of offenders from their criminal behaviour (‘offender profiling’) has only been partially successful since it has relied on subjective judgments based on limited data. Words and structured data used in crime descriptions recorded by the police relate to behavioural features. Thus Language Modelling was applied to an existing police archive to link behavioural features with significant characteristics of offenders. Both multinomial and multiple Bernoulli models were used. Although categories selected are gender, age group, ethnic appearance and broad occupation (employed or not), in principle this can be applied to any characteristic recorded. Results indicate that statistically significant relationships exist between all characteristics for many types of crime. Bernoulli models tend to perform better than multinomial ones. It is also possible to identify automatically specific terms which when taken together give insight into the style of offending related to a particular group. [Copyright &y& Elsevier]

The article offers informational background on Scala, a programming language, and Lift, a development framework for the Web. It discusses the nature, message-passing concurrency model, and features of Scala. It notes that Scala is developed by Martin Odersky, one of the authors of the Java program, and has a lightweight, expressive, and concise syntax. Features of the Scala program includes extensibility, statically checked duck typing via structural typing, and higher-order functions among others. Discussions on the Web framework Lift and the way its uses actors as architectural units are also featured.

State-space-partitioning-based approaches have been proposed in the literature to address the state-explosion problem in model checking. These approaches, whether sequential or distributed, perform a large amount of work in the form of interpartition (crossover) image computations, which can be ex- pensive. A model-checking algorithm that aggregates these expensive crossover images by localizing computation to individual partitions is presented. It reduces the number of crossover images and drastically outperforms extant approaches in terms of crossover image computation cost as well as total model-checking time, often by two orders of magnitude. [ABSTRACT FROM AUTHOR]

Presents a social representation framework for an organizational process redesign which integrates the process redesign and information system literature. Models used for process redesign; Criteria for process model representations; Discussion on the social context model for process representation and redesign.

The process of finding the best fitting model can often be very time consuming and tedious. Most computer programs are very specialized, and many require initial parameter estimates to fit a particular curve. Those that are most useful are ones that are versatile in applications, and ones that allow inputs of "rough" parameter estimates for finding the optimal ones. This paper focuses on current approaches for fitting observed age-specific demographic data with the multiexponential model schedule and uses two curve-fitting computer programs: MODEL and TableCurve2D. These two programs are assessed according to how well, and how simply, they can be used to fit age-specific fertility, mortality, and migration rates. [ABSTRACT FROM AUTHOR]

This is the second of two articles on the principal features of SML, a language for expressing structured models. The prior article covered levels 1 and 2. The present article covers the remaining levels, with special attention to the characteristics of SML that, collectively, make it unique. The intended audience includes evaluators of other modeling languages, designers of modeling languages and systems,, and those following the development of structured modeling. [ABSTRACT FROM AUTHOR]

This is the first of two articles on the principal features of SML, a language for expressing structured models. SML is presented in terms of four "levels" of increasing expressive power; this article covers the first two levels, while the sequel covers levels 3 and 4. The lower levels, at least, are easy to learn. Both articles rely entirely on examples and give special attention to the characteristics of SML that, collectively, make it unique. The intended audience includes evaluators of other modeling languages, designers of modeling languages and systems, and those who follow the development of structured modeling. This is the first of two articles on the principal features of SML, a language for expressing structured models. SML is presented in terms of four "levels" of increasing expressive power; this article covers the first two levels, while the sequel covers levels 3 and 4. The lower levels, at least, are easy to learn. Both articles rely entirely on examples and give special attention to the characteristics of SML that, collectively, make it unique. The intended audience includes evaluators of other modeling languages, designers of modeling languages and systems, and those who follow the development of structured modeling. [ABSTRACT FROM AUTHOR]