Box-Jenkins identification revisited—Part III : Multivariable systems

Part I of this series of three papers handles the identification of single input single output Box-Jenkins models on arbitrary frequency grids in an open and closed loop setting. Part II discusses the computational aspects and illustrates the theory on simulations and a real life problem. This paper extends the results of Parts I and II to multiple input multiple output systems. Contrary to the classical time domain approach, the presented technique does not require symbolic calculus for multiple output polynomial Box-Jenkins models.     

Good programming in transactional memory : Game theory meets multicore architecture

In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a thread provokes the better for the system. However, as a programmer is primarily interested in optimizing her individual code’s performance rather than the system’s overall performance, she does not have a natural incentive to provoke as little interference as possible. Hence, a TM system must be designed compatible with good programming incentives (GPI), i.e., writing efficient code for the overall system should coincide with writing code that optimizes an individual thread’s performance. We show that with most contention managers (CM) proposed in the literature so far, TM systems are not GPI compatible. We provide a generic framework for CMs that base their decisions on priorities and explain how to modify Timestamp-like CMs so as to feature GPI compatibility. In general, however, priority-based conflict resolution policies are prone to be exploited by selfish programmers. In contrast, a simple non-priority-based manager that resolves conflicts at random is GPI compatible.     

An international comparison of technology adoption : Testing the UTAUT model

We examined the relationships of the constructs in the UTAUT model to determine how they are affected by culture. In our study, we used data from Korea and the U.S. to examine two technologies: the MP3 player and Internet banking. Results showed that the UTAUT model fits our data well. The comparison of Korea and the U.S. revealed that the effects of effort expectancy on behavioral intention and the effects of behavioral intention on use behavior were greater in the U.S. sample. The implications of this are discussed.     

Non-local adaptive structure tensors : Application to anisotropic diffusion and shock filtering

Structure tensors are used in several PDE-based methods to estimate information on the local structure in the image, such as edge orientation. They have become a common tool in many image processing applications. To integrate the local data information, the structure tensor is based on a local regularization of a tensorial product. In this paper, we propose a new regularization model based on the non-local properties of the tensor product. The resulting non-local structure tensor is effective in the restitution of the non homogeneity of the local orientation of the structures. It is particularly efficient in texture regions where patches repeat non locally. The new tensor regularization also offers the advantage of automatically adapting the smoothing parameter to the local structures of the tensor product. Finally, we explain how this new adaptive structure tensor can be plugged into two PDEs: an anisotropic diffusion and a shock filter. Comparisons with other tensor regularization methods and other PDEs demonstrate the clear advantage of using the non-local structure tensor.     

Kanga(ROO): Handling the micro-DST of the BaBar experiment with ROOT

A system based on ROOT for handling the micro-DST of the BaBar experiment is described. The purpose of the Kanga system is to have micro-DST data available in a format well suited for data distribution within a world-wide collaboration with many small sites. The design requirements, implementation and experience in practice after three years of data taking by the BaBar experiment are presented.     

Dirac,dynamic information retrieval of atomic codes : 1. Physical design criteria

This communication describes a computer code, acronym DIRAC, to assist atomic physicists to control and process a library of computer codes. The objectives of DIRAC are to facilitate the preparation of input, the storage of output within the computer's memory hierarchy, and the comparative analysis of results of the codes from the library. At the present time, the library consists of codes for calculating electron and photon processes in atomic systems with L-S coupling. Library members can used to identify and store experimental results. The DIRAC system is based on the availability of an interactive graphics device and has been implemented on IBM-2250's attached to either the IBM System 360/65 of 360/91.     

New features in the simulation of neutrino oscillation experiments with GLoBES 3.0: (General Long Baseline Experiment Simulator)

We present version 3.0 of the GLoBES (“General Long Baseline Experiment Simulator”) software, which is a simulation tool for short- and long-baseline neutrino oscillation experiments. As a new feature, GLoBES 3.0 allows for user-defined systematical errors, which can also be used to simulate experiments with multiple discrete sources and detectors. In addition, the combination with external information, such as from different experiment classes, is simplified. As far as the probability calculation is concerned, GLoBES now provides an interface for the inclusion of non-standard physics without re-compilation of the software. The set of experiment prototypes coming with GLoBES has been updated. For example, built-in fluxes are now provided for the simulation of beta beams.     

How can the Web help build customer relationships?: An empirical study on e-tailing

The Web is increasingly being viewed as a tool and place to enhance customer relationship. In this paper we defined a model to analyze the Web characteristics that aid in building customer relationships and then used this model to examine consumer relationship building mechanisms in online retailing (e-tailing). Through a survey of 177 shoppers who had bought books, CDs, or DVDs online, the causal model was validated using LISREL; 13 out of 14 hypotheses were supported. This research has contributed to both theory and practice by providing a validated model to analyze online consumer relationship building and suggesting mechanisms to help e-tailers focus on online consumer relationship management.     

Complexiton solutions for (3+1) dimensional KdV-type equation

(3$+$1) dimensional nonlinear KdV-type equation is solved  by Wazwaz and Zhaqilao’s method which is arisen by employing complex parameters instead of real parameters and considered generalization of simplified Hirota method. Complexiton solutions which include both trigonometric and exponential functions are obtained for referred equation. Also some special conditions to specify the non-singularity and type of solutions are derived.     

Aspects of availability: Enforcing timed properties to prevent denial of service

We propose a domain-specific aspect language to prevent denial of service caused by resource management. Our aspects specify availability policies by enforcing time limits in the allocation of resources. In our language, aspects can be seen as formal timed properties on execution traces. Programs and aspects are specified as timed automata and the weaving process as an automata product. The benefit of this formal approach is two-fold: the user keeps the semantic impact of weaving under control and (s)he can use a model-checker to optimize the woven program and verify availability properties. This article presents the main approach (programs, aspects, weaving) formally using timed safety automata. The specification of resources, optimizations and verification are sketched in a more intuitive fashion. Even if a concrete implementation remains as future work, we address some high-level implementation issues and illustrate the approach by small examples and a case study.     

Lump solutions to a (2+1)-dimensional extended KP equation

With the aid of a computer algebra system, we present lump solutions to a ($2+1$)-dimensional extended Kadomtsev–Petviashvili equation (eKP) and give the sufficient and necessary conditions to guarantee analyticity and rational localization of the solutions. We plot a few solutions for some specific values of the free parameters involved and finally derive one of the lump solutions of the Kadomtsev–Petviashvili (KP) equations from the lump solutions of the eKP equation.     

Configuration landscape analysis and backbone guided local search.: Part I: Satisfiability and maximum satisfiability

Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are difficult combinatorial problems that have many important real-world applications. In this paper, we first investigate the configuration landscapes of local minima reached by the WalkSAT local search algorithm, one of the most effective algorithms for SAT. A configuration landscape of a set of local minima is their distribution in terms of quality and structural differences relative to an optimal or a reference solution. Our experimental results show that local minima from WalkSAT form large clusters, and their configuration landscapes constitute big valleys, in that high quality local minima typically share large partial structures with optimal solutions. Inspired by this insight into WalkSAT and the previous research on phase transitions and backbones of combinatorial problems, we propose and develop a novel method that exploits the configuration landscapes of such local minima. The new method, termed as backbone-guided search, can be embedded in a local search algorithm, such as WalkSAT, to improve its performance. Our experimental results show that backbone-guided local search is effective on overconstrained random Max-SAT instances. Moreover, on large problem instances from a SAT library (SATLIB), the backbone guided WalkSAT algorithm finds satisfiable solutions more often than WalkSAT on SAT problem instances, and obtains better solutions than WalkSAT on Max-SAT problem instances, improving solution quality by 20% on average.