Eliciting Preferences on Multiattribute Societies with a Choquet Integral

This paper reexamines the construction of indicators of standards of living, by focussing on the challenges raised by the subjectivity and the multidimensionality of living conditions. For that purpose, we apply Choquet integral-based multiattribute value theory to the elicitation, from rankings of multiattribute hypothetical societies, of individual preferences on different dimensions of living conditions. A simple application of the proposed approach highlights that preferences on multiattribute societies cannot, in general, be represented by an additive value model, as there exist complementarities and redundancies between different dimensions of standards of living. Our elicitation exercise reveals also a strong heterogeneity of individual preferences on hypothetical societies. Finally, we explore how elicited preferences can be used to cast a new light on the ranking of actual societies.     

On the decoding of binary cyclic codes with the Newton identities

We revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Gröbner bases.Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas.Then we consider the so-called online Gröbner basis decoding, where the work of computing a Gröbner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred).     

Kinetic masks: a new approach and device for dispersing biologically relevant fluids

The controlled dispersion of fluids, particularly biologically relevant solutions in micro-volumes, is of high practical interest in biotechnology and medicine. Pharmaceutical test assays, for example, need a method for the fast and defined deposition of fluid samples. Most current micro-dispensing methods, i.e. contact-based pin printing, have problems such as time delays, limited dosing velocity, minimum volume or high interference that limit biological applications. Spraying techniques suffer from a lack of reproducibility; a defined deposition of samples on targets is not possible. Here, we introduce a new method for the parallel and spatially defined dispersion of many micro-volumes that overcomes disadvantages of common micro-dispensers. The overall approach is that a fluid drop, produced by a droplet generator, falls on a free trajectory with a defined kinetic energy, and is split by a masking unit placed perpendicular to the flight direction into at least two smaller droplets (Zimmermann et al. in Method and device for dosing fluid media, WO/2002/102515, Germany, 2002). On the target, the resulting droplets form reproducible patterns, which are enlarged and scalable images of the grid pattern. Possible applications for this method are non-contact cell patterning, cell encapsulation, cryopreservation and fast mixing processes in micro-volumes. Here, we use this method for the direct and defined parallel positioning of cell suspensions on specific substrates, which can be useful for test assays, tissue engineering and cryopreservation.     

Ahead of time static analysis for automatic generation of debugging interfaces to the Linux kernel

The Linux kernel does not export a stable, well-defined kernel interface, complicating the development of kernel-level services, such as device drivers and file systems. While there does exist a set of functions that are exported to external modules, this set of functions frequently changes, and the functions have implicit, ill-documented preconditions. No specific debugging support is provided. We present Diagnosys, an approach to automatically constructing a debugging interface for the Linux kernel. First, a designated kernel maintainer uses Diagnosys to identify constraints on the use of the exported functions. Based on this information, developers of kernel services can then use Diagnosys to generate a debugging interface specialized to their code. When a service including this interface is tested, it records information about potential problems. This information is preserved following a kernel crash or hang. Our experiments show that the generated debugging interface provides useful log information and incurs a low performance penalty.     

The subspace global skyline query processing over dynamic databases

The global skyline, as an important variant of the skyline, has been widely applied in multi-criteria decision making, business planning and data mining. In this paper, we extend our early work and propose the maintenance methods to process the subspace global skyline (SGS) queries in dynamic databases. In the previous work, we proposed the index structure RB-tree, which can effectively manage the data to accelerate the subspace global skyline calculation. Also, the basic single SGS algorithm based on RB-tree (SSRB) and the optimized single SGS algorithm (OSSRB) were proposed to process a single SGS query. In addition, the multiple SGS algorithm (MSRB) was proposed to calculate multiple SGS queries by sharing the scan spaces of different queries. In this paper, we design some data structures and propose the maintenance approaches of SSRB, OSSRB and MSRB to cope with updates that happen to data sets. Thus our extended algorithms can be adopted for dynamic data sets. Finally, the experimental results show that the proposed algorithms OSSRB and MSRB have good performance to process SGS queries and they can be easily maintained with dynamic datasets.     

Multifidelity surrogate modeling based on radial basis functions

Multiple models of a physical phenomenon are sometimes available with different levels of approximation. The high fidelity model is more computationally demanding than the coarse approximation. In this context, including information from the lower fidelity model to build a surrogate model is desirable. Here, the study focuses on the design of a miniaturized photoacoustic gas sensor which involves two numerical models. First, a multifidelity metamodeling method based on Radial Basis Function, the co-RBF, is proposed. This surrogate model is compared with the classical co-kriging method on two analytical benchmarks and on the photoacoustic gas sensor. Then an extension to the multifidelity framework of an already existing RBF-based optimization algorithm is applied to optimize the sensor efficiency. The co-RBF method does not bring better results than co-kriging but can be considered as an alternative for multifidelity metamodeling.     

Compliance by design – Bridging the chasm between auditors and IT architects

System and process auditors assure – from an information processing perspective – the correctness and integrity of the data that is aggregated in a company’s financial statements. To do so, they assess whether a company’s business processes and information systems process financial data correctly. The audit process is a complex endeavor that in practice has to rely on simplifying assumptions. These simplifying assumptions mainly result from the need to restrict the audit scope and to focus it on the major risks. This article describes a generalized audit process. According to our experience with this process, there is a risk that material deficiencies remain undiscovered when said simplifying assumptions are not satisfied. To address this risk of deficiencies, the article compiles thirteen control patterns, which – according to our experience – are particularly suited to help information systems satisfy the simplifying assumptions. As such, use of these proven control patterns makes information systems easier to audit and IT architects can use them to build systems that meet audit requirements by design. Additionally, the practices and advice offered in this interdisciplinary article help bridge the gap between the architects and auditors of information systems and show either role how to benefit from an understanding of the other role’s terminology, techniques, and general work approach.     

Adaptive records for volume irradiance caching

In this paper, we present a new irradiance caching scheme using Monte Carlo ray tracing for efficiently rendering participating media. The irradiance cache algorithm is extended to participating media. Our method allows to adjust the density of cached records depending on illumination changes. Direct and indirect contributions can be stored in the records but also multiple scattering. An adaptive shape of the influence zone of records, depending on geometrical features and irradiance variations, is introduced. To avoid a high density of cached records in low interest areas, a new method controls the density of the cache when adding new records. This record density control depends on the interpolation quality and on the photometric characteristics of the medium. Reducing the number of records accelerates both the computation pass and the rendering pass by decreasing the number of queries to the cache data structure (Kd-tree). Finally, instead of using an expensive ray marching to find records that cover the ray, we gather all the contributive records along the ray. With our method, pre-computing and rendering passes are significantly speeded-up.     

Accessible design and testing in the application development process: considerations for an integrated approach

Accessible design principles should permeate virtually all phases of the application development cycle, using existing “best practices of software engineering” for accessibility purposes. This paper proposes a methodology for accessible design and testing that includes proven tools of software engineering, namely use cases and scenarios, to capture functional requirements. Guidelines developed through user testing and heuristics are made real using personas to exemplify accessibility requirements, reflecting a diversity of user capabilities and use contexts. For implementation and testing, test cases containing accessibility checkpoints are generated, based on the guidelines. Complementary to this methodology, expert reviews and user testing should be conducted for evaluation of the developed products and further refinement of the development process.