Frisch scheme identification for dynamic diagonal bilinear models

The article addresses the problem of dynamic system identification in the errors-in-variables framework for a class of discrete-time time-invariant input–output bilinear models when subjected to a white input signal. The proposed algorithm is based on an extension of the bias-compensated least squares method and utilises the Frisch scheme equations to determine the parameter vector together with the variances of the input and output noise sequences. The appropriateness of the approach is analysed and its performance evaluated when compared to other errors-in-variables identification techniques by means of a Monte Carlo simulation. The results obtained demonstrate the accuracy of the proposed method and the performance in terms of noise robustness is also observed.     

Power and welfare in bargaining for coalition structure formation

We investigate a noncooperative bargaining game for partitioning n agents into non-overlapping coalitions. The game has n time periods during which the players are called according to an exogenous agenda to propose offers. With probability \(\delta \), the game ends during any time period \(t<n\). If it does, the first t players on the agenda get a chance to propose but the others do not. Thus, \(\delta \) is a measure of the degree of democracy within the game (ranging from democracy for \(\delta =0\), through increasing levels of authoritarianism as \(\delta \) approaches 1, to dictatorship for \(\delta =1\)). We determine the subgame perfect equilibrium (SPE) and study how a player’s position on the agenda affects his bargaining power. We analyze the relation between the distribution of power of individual players, the level of democracy, and the welfare efficiency of the game. We find that purely democratic games are welfare inefficient and that introducing a degree of authoritarianism into the game makes the distribution of power more equitable and also maximizes welfare. These results remain invariant under two types of player preferences: one where each player’s preference is a total order on the space of possible coalition structures and the other where each player either likes or dislikes a coalition structure. Finally, we show that the SPE partition may or may not be core stable.     

An object-oriented implementation of a solver of the time-dependent Schrödinger equation using the CUDA technology

We present a set of C++ classes which allow one to use the graphics card processor?s cores for quantum ab initio simulations, i.e. a direct solving of the time-dependent Schrödinger equation, gaining the benefits from the parallel architecture of the graphical processor units. We use the Chebyshev polynomial and FFT algorithm. The solution is based on NVIDIA CUDA technology. The speed-up factor in the test runs of our classes performed using the graphics card processor can even be of order of 300 in comparison with the test runs using only the single core of CPU. Not only the Schrödinger equation can be integrated using the presented solver. With only small changes it can be used for solving the nonlinear Gross–Pitaevskii equation of BEC?s dynamics, the heat equation, the diffusion equation or other parabolic partial differential equations of second order.¹Program summaryProgram title: QnDynCUDACatalogue identifier: AELE_v1_0Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AELE_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 101 359No. of bytes in distributed program, including test data, etc.: 3 165 228Distribution format: tar.gzProgramming language: C++, C for CUDAComputer: Graphics card with CUDA technology recommendedOperating system: No limits (tested on 32-bit and 64-bit Windows and 64-bit Linux)Has the code been vectorized or parallelized?: Yes, number of processors used – one CPU core and all CUDA cores of the selected processor of graphics cardRAM: Dependent on user?s parameters, typically between several tens of megabytes and several gigabytes (this concerns also the graphics card?s memory)Supplementary material: Test input and output files (approx. 3.4 Gigabytes) are availableClassification: 2.7, 6.5Nature of problem: Solving the time-dependent Schrödinger equation.Solution method: FFT and Chebyshev polynomial algorithm, CUDA technology.Running time: Every test example included in the distribution package takes approximately an hour or so if the GPU is engaged and a day or so if only CPU is used.     

Easy Development and Integration of Science Gateways with Vine Toolkit

Science Gateways are web portal environments targeted for a given community and dedicated to specific scientific needs. Scientists require a different set of tools, applications, visualizations, data integration patterns, to be able to satisfy unique requirements of different research domains. To enable users to benefit from remote computational and storage resources, a web portal framework should support an easy integration and access to the e-Infrastructure. In this paper we present results of our research and development activities leading to the release of the Vine Toolkit framework integrated with Adobe Flex/BlazeDs technologies. It offers a set of unified and abstract APIs for different Grid middleware and a rich graphic presentation layer. Additionally, it automates the integration process with portal frameworks, such as Liferay or GridSphere. Vine Toolkit introduces a concept of subprojects which extend core APIs or define new low level components and web applications. This way, a Science Gateway prototyping process is definitely shortened. Consequently, it allows programmers to build software components that can be reused in a simple manner for different Science Gateways.     

On calibration of orthotropic elastic-plastic constitutive models for paper foils by biaxial tests and inverse analyses

In this paper two procedures are developed for the identification of the parameters contained in an orthotropic elastic-plastic-hardening model for free standing foils, particularly of paper and paperboard. The experimental data considered are provided by cruciform tests and digital image correlation. A simplified version of the constitutive model proposed by Xia et al. (Int J Solids Struct 39:4053?C4071, 2002) is adopted. The inverse analysis is comparatively performed by the following alternative computational methodologies: (a)?mathematical programming by a trust-region algorithm; (b)?proper orthogonal decomposition and artificial neural network. The second procedure rests on preparatory once-for-all computations and turns out to be applicable economically and routinely in industrial environments.     

New analytical benchmarks for topology optimization and their implications. Part I: bi-symmetric trusses with two point loads between supports

Extending some results by Sokó? and Lewiński (Struct Multidisc Optim 42:835–853, 2010), the optimal topology of bi-symmetric trusses with two symmetrically placed pointloads is determined analytically, and verified by highly accurate numerical calculations. It is rather remarkable that Michell’s best-known classical solution had to wait over hundred years for its generalization from one to two point loads. Some implications of these solutions, including properties of so-called O-regions, are also discussed.     

Real-time hardware–software embedded vision system for ITS smart camera implemented in Zynq SoC

The article demonstrates the usefulness of heterogeneous System on Chip (SoC) devices in smart cameras used in intelligent transportation systems (ITS). In a compact, energy efficient system the following exemplary algorithms were implemented: vehicle queue length estimation, vehicle detection, vehicle counting and speed estimation (using multiple virtual detection lines), as well as vehicle type (local binary features and SVM classifier) and colour (k-means classifier and YCbCr colourspace analysis) recognition. The solution exploits the hardware–software architecture, i.e. the combination of reconfigurable resources and the efficient ARM processor. Most of the modules were implemented in hardware, using Verilog HDL, taking full advantage of the possible parallelization and pipeline, which allowed to obtain real-time image processing. The ARM processor is responsible for executing some parts of the algorithm, i.e. high-level image processing and analysis, as well as for communication with the external systems (e.g. traffic lights controllers). The demonstrated results indicate that modern SoC systems are a very interesting platform for advanced ITS systems and other advanced embedded image processing, analysis and recognition applications.     

Using derivatives in time series classification

Over recent years the popularity of time series has soared. Given the widespread use of modern information technology, a large number of time series may be collected during business, medical or biological operations, for example. As a consequence there has been a dramatic increase in the amount of interest in querying and mining such data, which in turn has resulted in a large number of works introducing new methodologies for indexing, classification, clustering and approximation of time series. In particular, many new distance measures between time series have been introduced. In this paper, we propose a new distance function based on a derivative. In contrast to well-known measures from the literature, our approach considers the general shape of a time series rather than point-to-point function comparison. The new distance is used in classification with the nearest neighbor rule. In order to provide a comprehensive comparison, we conducted a set of experiments, testing effectiveness on 20 time series datasets from a wide variety of application domains. Our experiments show that our method provides a higher quality of classification on most of the examined datasets.     

Fine polymer imprinted layers for the monitoring of bisphenol A in aqueous solutions

The present work proposes the use of molecularly imprinted polymer layers (MIPLs) on dehydrochlorinated poly(vinyl chloride) (DHPVC) particles, which could serve as new materials for the separation of bisphenol A (BPA). The best material with MIPLs was obtained using a mixture of methyl methacrylate (MMA) and ethylene glycol dimethacrylate (EGDMA) with the molar ratio of 4:6 in n-octane as the solvent and with 7 wt.% of BPA, which were grafted onto DHPVC particles. The synthesized materials were investigated for their possible application in the monitoring of BPA contamination in real samples received after the treatment of can of some popular beverages.     

Solvent selection for CO<Subscript>2</Subscript> capture from gases with high carbon dioxide concentration

Amine absorption processes are widely used to purify both refinery and process gases and natural gas. Recently, amine absorption has also been considered for application to CO₂ removal from flue gases. It has a number of advantages, but there is one major disadvantage-high energy consumption. This can be solved by using an appropriate solvent. From a group of several dozen solutions, seven amine solvents based on primary amine, tertiary amine and sterically hindered amine were selected. For the selected solutions research was conducted on CO₂ absorption capacity, an absorption rate and finally a solvent vapor pressure. Furthermore, tests on an absorber-desorber system were also performed. In this study the most appropriate solvent for capturing CO₂ from flue gases with higher carbon dioxide concentrations was selected.