Mobile network evolution toward IMT-2000 in Korea: a techno-economic analysis This paper develops a techno-economic model for evaluating mobile network evolution strategies and demonstrates its real-world applicability, using a Korean case study. A number of mobile network evolution strategies toward IMT-2000 are generated and evaluated with this model. The overall market performance is evaluated and its sensitivity to the key strategic variables such as technology choice, time to market and service coverage is analyzed. Given the regulatory condition that W-CDMA network should be deployed no later than 2004, it is found that direct evolution from cdma2000 1x to W-CDMA is more profitable than evolving via 1xEV-DO. Also, direct evolution from cdma2000 1x to 1xEV-DV appears to be a comparable choice, but with a higher supplier market risk. Finally, strategic implications of the empirical findings obtained in this study are discussed along with some further research issues.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

techno-economic analysis
korean mobile market
imt-2000
network evolution strategy


Cognitive mismatches in the cockpit: Will they ever be a thing of the past? Changes in aviation over the last 30 years have dramatically affected the way that flight crews fly aircraft. The implementation and evolution of the glass cockpit, however, has happened in an almost ad hoc fashion, meaning that it does not always properly support the flight crew in carrying out their tasks. In such situations, the crew's mental model of what is happening does not always match the real state of affairs. In other words, there is a cognitive mismatch. An initial taxonomy of cognitive mismatches is defined, and the problem illustrated using an example from an aviation accident. Consideration is then given to how cognitive mismatches can be managed. A call is made for the development of an integrated cockpit architecture that takes better account of human capabilities and allows for new developments to be added to the cockpit in a more seamless manner.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

flight deck systems
humanmachine interaction


A mobile device application applied to low back disorders Many muscular function assessments require the monitoring of muscular activity in different environments. This can happen in the gymnasium during a training session or while practising a sport; at work, where movements and specific actions are executed; at school, where the child adopts an incorrect posture, or even while we walk. In this paper, we propose a system to allow the assessment of the muscular condition in any of these environments in a comfortable and simple way for the patient and using the advances in wireless communications. Just a wireless biomonitor (we have used the ME6000 biomonitor, a medical portable equipment of very small dimensions) and one PDA or mobile phone with wireless interface are needed. The medical device is configured from the mobile device. Then, wireless communications are used to transmit online the electromyographic signals registered by the medical equipment to a mobile device. The specific protocol used by the medical device is implemented to carry out the communication. There are two ways to configure the system: offline and online. In offline mode, once all the information is received, it is sent to a server using a connection to the Internet instead of the online way, where this information is sent simultaneously. The server includes a background application to process the information in real-time with the aim to evaluate the function of the muscle during the exercise and to establish healthy behaviours for the patient. Then, this information can be consulted by the specialist and also by the client using the PDA or mobile phone to show the report. A prototype of this system has been developed and implemented. The system has been evaluated by a preliminary usability, reliability, feasibility and communication performance study.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O

wireless telemedicine
handheld devices
multimedia
health monitoring
electromyography


Decoding techniques for alternate-relaying BICM cooperative systems In this paper, we propose the use of bit-interleaved coded modulation in alternate-relaying decode-and-forward cooperative communication systems. At the destination, we exploit the interference signal, which results from the simultaneous transmission of data streams through both direct and one of the relay channels to develop an optimal detector. It is shown that the proposed detector can be implemented by parallel concatenating maximum a posteriori (MAP) algorithms and demappers to the decoders. The detector exchanges soft information between the decoders and the MAP algorithms in an iterative way for performance improvement. The proposed optimal detector requires a long delay as the destination has to receive and store the entire frame before performing data detection. To avoid this, a sub-optimal detector is also proposed. Unlike the optimal detector, the sub-optimal one exploits two consecutive received packets to decode one packet. It turns out that the sub-optimal detector has less reduced delay, complexity, memory size, and bandwidth loss with a slight increase of the bit-error-rate. Extensive simulation results are presented to demonstrate the effectiveness of the proposed detectors.

O O O O B B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Inter-firm IT governance in power-imbalanced buyer-supplier dyads: exploring how it works and why it lasts Using a multiple case study design, we investigate the issue of inter-firm IT governance and its impact on information sharing in buyer-supplier dyadic relationships. We interviewed 38 managers of operations, purchasing, and IT in five dyadic relationships, and identified and examined one type of inter-firm IT governance: unilateral IT governance. In this type of IT governance, one party of the dyad dominates the relationship and the decision rights regarding inter-firm IT systems and data sharing. We find that unilateral inter-firm IT governance develops under contract-based and relationship-supplemented inter-firm governance arrangements in which significant power imbalance exists. However, contrary to the prediction of resource dependence theory, power-imbalanced governance can survive and thrive over a long period of time. We find that the inter-firm relational norms and trust that develop between these dyads constrain opportunistic and myopic behaviors in both parties, thus sustaining the seemingly unstable unilateral inter-firm IT governance. We also find that the operational necessity of the buyers and the IT capability of the suppliers are two primary factors that constrain inter-firm information sharing in these dyads. On the basis of these findings, we propose a process model for understanding and managing this type of inter-firm IT governance.

O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

it governance
resource dependence
power imbalance

inter-firm governance
inter-firm it governance
inter-firm relationship


Coexistence of wireless LANs and Bluetooth networks in mutual interference environment: An integrated analysis In this paper, a model is developed for the performance analysis of IEEE 802.11 b and Bluetooth systems in mutual interference environment. Based on this model, a scheme is proposed to select appropriate parameters, such as packet type, packet segmentation size, an adaptive data rate and transmit distance. Consequently the proposed scheme allows the two systems to operate in a shared environment without significantly impacting the performance of each other. The analysis comprises the collision probability for Bluetooth or IEEE 802.11 b packet overlapped by interference packets in both time and frequency, and the Packet Error Rate (PER) performance with distance. By using the proposed evaluation framework, the optimum packet type, segmentation size, data rate and safe distance ratio for the transmitter and receiver in a mutual interference scenario can easily be obtained. (c) 2006 Elsevier B.V. All rights reserved.

B O O O O B O O O B O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O


Ladder-network-based model for interconnects and transmission lines time delay and cutoff frequency determination Half-T RC ladder networks (LNs) are proven to be first-order models of transmission lines (TLs) and interconnections. In this paper, the determination of LNs electrical characteristics, in terms of internal electrical parameters and number of cells, has allowed to calculate, in an approximated but very accurate way, the time delay and cutoff frequency of open-ended RC LN. Numerical examples on real designs confirm the validity of the proposed method in terms of robustness and accuracy.

O O O B O B I O O O B I O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O

interconnects
transmission lines
ladder networks
cutoff frequency


Fuzzy statistics: hypothesis testing Our method of estimation of parameters in statistics uses a set of confidence intervals producing a triangular shaped fuzzy number for the estimator. Using this fuzzy estimator in hypothesis testing produces a fuzzy test statistic and fuzzy critical values in fuzzy hypothesis testing. We show how these fuzzy sets may be used to derive the usual conclusion of: (1) reject the null hypothesis, or (2) do not reject the null hypothesis.

O B B I O O O O O O O B O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O

statistics
hypothesis testing
fuzzy sets


Improving short utterance i-vector speaker verification using utterance variance modelling and compensation techniques It was found that short utterance varies with speaker, channel and utterance information. SUVN is introduced to compensate the channel and utterance variance in CSS i-vector system. SUV modelling is used to model these variations in GPLDA speaker verification.

O O O O B I O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O B I


An alternative formulation of kernel LPP with application to image recognition Locality preserving projections (LPP) is a new subspace feature extraction method which seeks to preserve the local structure and intrinsic geometry of the data space. As the LPP model is linear, it may fail to extract the nonlinear features. This paper proposes to address this problem using an alternative formulation, kernel locality preserving projections (KLPP). Our algorithm consists of two steps: kernel principal component analysis (KPCA) plus LPP. We provide an outline for implementing KLPP. Experiments on the ORL face database and PolyU palmprint database demonstrate the effectiveness of the proposed algorithm.

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

kernel principal component analysis (kpca)


An energy-aware framework for dynamic software management in mobile computing systems Energy efficiency has become a very important and challenging issue for resource-constrained mobile computers. In this article, we propose a novel dynamic software management (DSOM) framework to improve battery utilization. We have designed and implemented a DSOM module in user space, independent of the operating system ( OS), which explores quality-of-service ( QoS) adaptation to reduce system energy and employs a priority-based preemption policy for multiple applications to avoid competition for limited energy resources. Software energy macromodels for mobile applications are employed to predict energy demand at each QoS level, so that the DSOM module is able to select the best possible trade-off between energy conservation and application QoS; it also honors the priority desired by the user. Our experimental results for some mobile applications ( video player, speech recognizer, voice-over-IP) show that this approach can meet user-specified task-oriented goals and significantly improve battery utilization.

O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

performance
measurement
software adaptation
energy macromodel
runtime coordination


Quasi-interpolating spline models for hexagonally-sampled data The reconstruction of a continuous-domain representation from sampled data is an essential element of many image processing tasks, in particular, image resampling. Until today, most image data have been available on Cartesian lattices, despite the many theoretical advantages of hexagonal sampling. In this paper, we propose new reconstruction methods for hexagonally sampled data that use the intrinsically 2-D nature of the lattice, and that at the same time remain practical and efficient. To that aim, we deploy box-spline and hex-spline models, which are notably well adapted to hexagonal lattices. We also rely on the quasi-interpolation paradigm to design compelling prefilters; that is, the optimal filter for a prescribed design is found using recent results from approximation theory. The feasibility and efficiency of the proposed methods are illustrated and compared for a hexagonal to Cartesian grid conversion problem.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O

box-splines
hex-splines
interpolation
linear shift invariant signal spaces
quasi-interpolation


Searching Appropriate Mother Wavelets for Hyperanalytic Denoising The aim of this paper is the association of a new variant of Hyperanalytic Wavelet Transform (HWT) with a maximum a posteriori (MAP) filter, named bishrink for the denoising of images affected by additive white Gaussian noise (AWGN). The best results are obtained with the biorthogonal mother wavelets Daubechies 9/7.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wavelet transforms
hilbert transforms
white noise
filtering
map estimation


Image encryption based on the Jacobian elliptic maps An image encryption algorithm based chaotic Jacobian elliptic maps is presented. The proposed scheme is subjected to some security analyses as well as statistical tests suites. Security analysis and simulation results indicate that the scheme possesses high security.

B I O O O B I I O B I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cryptography
lyapunov characteristic exponent


Development of a portable grain mass flow sensor test rig A portable grain mass flow sensor test rig was built to measure the accuracy of a mass flow sensor with dual use in the field as well as in the lab. Concurrently, a synchronization method was developed that employs GPS timing data to synchronize the mass flow sensor data with the reference scale data. Two-point calibration was compared to multi-point calibration under steady-state flow. These tests on mass flow rate of corn with no variation in ground slope indicated that a multi-point calibration is preferable to a two-point calibration, confirming the results of previous research. The results indicated that the accuracy of the mass flow sensor is very good (R2=0.99) if it is run about the specific flow rate for which it was calibrated. Errors up to 8.2% occurred at lower flow rates when the system had been calibrated only at zero and the maximum flow rate. The effect of slope on accuracy of the mass flow sensor was investigated by inclining the clean grain elevator in two planes simulating pitch and roll. A roll of 5 (sideways) did not alter the mass flow sensor zero-point calibration and showed no significant effect on accuracy of the mass flow sensor. At 10 pitch, the calibration was altered and significantly affected the accuracy of the mass flow sensor, especially at lower grain flow rates. Ground slope could have an adverse effect on mass flow sensor accuracy; however, the mass flow sensor can perform well when calibrated for a given slope. The results with a relatively small test rig verify the concept, and show that a larger rig could accurately simulate field conditions for mass flow sensors on the biggest combines available.

O O O O O B I I B I O O O B I I B I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I I O O O B I I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O

yield monitor accuracy
yield monitor error


Generate-map-reduce: An extension to map-reduce to support shared data and recursive computations It is difficult to express the parallelism present in complex computations by using existing higher level abstractions such as MapReduce and Dryad. These computations include applications from wide variety of domains, like Artificial Intelligence, Decision Tree Algorithms, Association Rule Mining, Recommender Systems, Graph Algorithms, Clustering Algorithms, Compute Intensive Scientific Workflows, Optimization Algorithms, and so forth. Their execution graphs introduce new challenges in terms of programmer expressibility and runtime performance such as iterative and recursive computations, shared communication model, and so forth. We propose an extension to MapReduce, called Generate-Map-Reduce (GMR), targeted towards modeling these applications. GMR introduces a new Generate abstraction into the MapReduce framework that captures recursive computations. The runtime also supports iterative jobs and a distributed communication model by using shared data structures. We illustrate recursive computations with GMR by modeling complex applications such as simulated annealing, A* search, and adaptive quadrature computation that require recursive spawning of new tasks to handle variable degree of parallelism. GMR runtime supports caching of common data across iterations in memory and local disks. We illustrate how this caching helps in achieving significant speedup for iterative computations by modeling k-means clustering. Copyright (c) 2013 John Wiley & Sons, Ltd.

O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B O O O O O O O O O O O O O O O O B O O O B I O O O O O O O O O O O O O B I I O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mapreduce
recursive computations
adaptive quadrature
shared data structures


A new hybrid heuristic approach for solving large traveling salesman problem This paper presents a new metaheuristic approach called ACOMAC algorithm for solving the traveling salesman problem (TSP). We introduce multiple ant clans' concept from parallel genetic algorithm to search solution space utilizing various islands to avoid local minima and thus can yield global minimum for solving the traveling salesman problem. Moreover, we present two approaches named the multiple nearest neighbor (NN) and the dual nearest neighbor (DNN) to ACOMAC to enhance large TSPs. To validate the proposed methods, numerous simulations were conducted to compare ACOMAC and Dorigo's ACS with and without the addition of the multiple nearest neighbor (NN) method or the dual nearest neighbor (DNN) approach, using a range of TSP benchmark problems. According to the results of the simulation, adding the NN or DNN approach to ACOMAC or ACS, as initial solutions, also significantly enhances the performance of ACOMAC and ACS in solving the traveling salesman problem. Meanwhile, using ACOMAC + DNN with TSP can yield better solutions than the other stated approaches. Additionally, ACOMAC or ACOMAC + NN, utilizing five ant clans with a total of 20 ants, is verified to yield better solutions. Furthermore, ACOMAC with a local weighting (w) set to 0.6 can yield better solutions in terms of length. (C) 2003 Elsevier Inc. All rights reserved.

O O O O O O O O B I I O O O O O B I O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

traveling salesman problem
metaheuristic approach


Active object recognition based on Fourier descriptors clustering This paper presents a new 3D object recognition/pose strategy based on Fourier descriptors clustering for silhouettes. The method consists of two parts. Firstly, an off-line process calculates and stores a clustered Fourier descriptors database corresponding to the silhouettes of the synthetic model of the object viewed from multiple viewpoints. Next, an on-line process solves the recognition/pose problem for an object that is sensed by a camera placed at the end of a robotic arm. The method solves the ambiguity problem due to object symmetries or similar projections belonging to different objects by taking a minimum number of additional views of the scene which are selected through a heuristic next best view (NBV) algorithm. The method works in reduced computational time conditions and provides identification and pose of the object. A validation test of this method has been carried out in our lab yielding excellent results.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Synthesis of complex dynamic character motion from simple animations In this paper we present a general method for rapid prototyping of realistic character motion. We solve for the natural motion from a simple animation provided by the animator. Our framework can be used to produce relatively complex realistic motion with little user effort. We describe a novel constraint detection method that automatically determines different constraints on the character by analyzing the input motion. We show that realistic motion can be achieved by enforcing a small set of linear and angular momentum constraints. This simplified approach helps us avoid the complexities of computing muscle forces. Simpler dynamic constraints also allow us to generate animations of models with greater complexity, performing more intricate motions. Finally, we show that by learning a small set of key parameters that describe a character pose we can help a non-skilled animator rapidly create realistic character motion.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

animation w/constraints
physically based animation
physically based modeling
motion transformation
spacetime constraints


On the use of plate-type normal pressure cells in silos Part 1: Calibration and evaluation Pressure cells are measuring devices commonly used in silo research to study loads exerted by a granular material stored against a silo wall. The design of normal pressure cells for use in an experimental silo research project is critical, mainly because measuring errors complicate the interpretation of results. Once the cells have been delivered from the manufacturer to the researcher, they should be calibrated and validated with reference to the measurement of pressure from a granular material against a silo wall. Two related papers deal with a specific plate-type normal pressure cell for use in an installation of three full-scale steel silos with different hopper eccentricities (concentric, half-eccentric and full-eccentric) as part of a silo research project. It was found to be necessary to validate the performance of the cells when measuring pressures in the silos in order to arrive at a solid basis for the interpretation of the pressure measurements in the silo installation aforementioned. This paper presents calibration results from three investigated methods as well as results from a finite element analysis of the plate deflection of the pressure cell which were performed to evaluate the non-linear behaviour of the signal from the cell. Results suggested that the air-pressure calibration method turned out to be the most suitable in this particular case, that a lack of stiffness of the plate cell was revealed and that its boundary constraint conditions were not stable. Amendments were proposed in order to improve the accuracy of measurements. Furthermore, the knowledge acquired from the study of these plate-type cells constitutes the basis of recommendations for another design of pressure cells for which the calibration as well as the interpretations of test results would become simpler. (C) 2009 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

plate-type
calibration methods
measuring error


A new 3D finite element sandwich plate for predicting the vibroacoustic response of laminated steel panels A new sandwich finite element has been previously applied successfully to the vibration analysis of damped metalpolymermetal beams [1]. In this paper, this element is extended to the vibration of unsymmetrical sandwich plates with a viscoelastic core. The rotational influence of the transversal shearing in the core on the skins behaviour, ensures a displacement consistency over the interfaces between the viscoelastic core and the elastic skins resulting in accurate representations of the physics. To enable the analysis of plates with arbitrary orientation in three-dimensional space, a formulation with nine degrees of freedom per node is employed. Moreover, the element is shown to interface easily with classical plates elements. Comparisons with both experimental tests and classical solid FE modeling are shown to prove the accuracy and computational efficiency of the presented element for the modeling of the vibro-acoustic response of the studied metalpolymermetal panels.

O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

finite element method
damping
viscoelasticity
dash
vibro-acoustic


An ontological approach to describe the SQL : 2003 object-relational features The SQL (Structured Query Language) is currently available in most database management systems and is the focus of an intense standardization process resulting in the latest version of the SQL:2003 standard. Standards are fundamental, but often they are difficult to use, due to their lack of understandability and the occurrence of inconsistencies. An ontology is useful for clarifying the elements of a standard, along with their interrelationships, as well as for detecting inconsistencies. In this paper we propose an ontology for the object-relational features of the new SQL:2003 standard, formalized with UML 2.0 class diagrams and OCL well-formedness rules. The ontology is instantiated with an example in which most of the new object-relational features of the SQL:2003 standard are presented. (C) 2005 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O

databases
sql : 2003 standard
object-relational features
cwm


rethinking cyber security It is clear that the Internet is transforming the way we live and the recent decades have witnessed dramatic developments in information and communication technologies (ICT). Along with the phenomenal growth in technology enabled information economy has been a growth in computing technology related crimes. Security and privacy issues have become increasingly significant over the years and expected to continue to dominate the technology scene with the increased focus on digital economy and dramatic growth in social networking and the adoption of technologies such as cloud computing by businesses. In this talk I will begin with a brief look at current trends in the technology scenery and some of the key security issues that are impacting on business and society. In particular, I will describe the notion that I refer to as increasing threat velocity, with more and more attacks and their dynamic nature, an evolving set of bad guys with different motives and sophisticated easy to use tools readily available for ordinary users to conduct severe attacks. Hence there is a need for security professionals and researchers to rethink about cyber threats and how to respond to them. In this regard, we will examine attribution which is one of the key issues when it comes to counteracting security attacks. The unauthenticated nature of the Internet makes attribution difficult and furthermore has implications on accountability. Then the talk will focus on attacks and risks in cloud computing, where issues of security, trust and accountability are particularly significant. Cloud computing with its shared multi-tenancy environment aggravates the traditional security threats. Trust that cloud providers will provide proper security measures to counteract the security threats and ensure availability of services and data stored data become paramount. We will conclude the talk by discussing some key security technologies that are relevant for cloud services.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Model based vehicle detection and tracking for autonomous urban driving Situational awareness is crucial for autonomous driving in urban environments. This paper describes the moving vehicle detection and tracking module that we developed for our autonomous driving robot Junior. The robot won second place in the Urban Grand Challenge, an autonomous driving race organized by the U.S. Government in 2007. The module provides reliable detection and tracking of moving vehicles from a high-speed moving platform using laser range finders. Our approach models both dynamic and geometric properties of the tracked vehicles and estimates them using a single Bayes filter per vehicle. We present the notion of motion evidence, which allows us to overcome the low signal-to-noise ratio that arises during rapid detection of moving vehicles in noisy urban environments. Furthermore, we show how to build consistent and efficient 2D representations out of 3D range data and how to detect poorly visible black vehicles. Experimental validation includes the most challenging conditions presented at the Urban Grand Challenge as well as other urban settings.

O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

autonomous driving
urban driving
laser range finders

vehicle tracking
bayesian model
particle filter


An Augmented Value Difference Measure In order to relax the attribute independence assumption by VDM, we proposed an augmented MBR transform. Based on our augmented MBR transform, we then proposed an Augmented Value Difference Measure (AVDM). The experimental results on a large number of UCI datasets validate its effectiveness.

O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

value difference metric
the memory-based reasoning transform
distance measure


Simultaneous discriminative projection and dictionary learning for sparse representation based classification Sparsity driven classification method has been popular recently due to its effectiveness in various classification tasks. It is based on the assumption that samples of the same class live in the same subspace, thus a test sample can be well represented by the training samples of the same class. Previous methods model the subspace for each class with either the training samples directly or dictionaries trained for each class separately. Although enabling strong reconstructive ability, these methods may not have desirable discriminative ability, especially when there are high correlations among the samples of different classes. In this paper, we propose to learn simultaneously a discriminative projection and a dictionary that are optimized for the sparse representation based classifier, to extract discriminative information from the raw data while respecting the sparse representation assumption. By formulating the task of projection and dictionary learning into an optimization framework, we can learn the discriminative projection and dictionary effectively. Extensive experiments are carried out on various datasets and the experimental results verify the efficacy of the proposed method.

O O O O B I O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

discriminative projection learning
metric learning


Prenatal Cocaine Exposure Cardiac vagal tone (VT) was studied as a resilience factor in children prenatally exposed to cocaine and nonexposed controls (n= 550). A cumulative risk index was derived and used to classify children as high versus low risk. VT was measured during mildly stressful observations at 1 and 36 months of age. Children were classified as having consistently high, consistently low, or fluctuating VT. Risk and VT interacted to predict adaptive behaviors. For high-risk children, low VT was related to higher ratings of adaptive behaviors. This finding suggests that regulatory functioning, as indexed by VT, may be a protective factor in prenatal CE

O B O O B I O O O O O O O O B O O O B O O O O O O B I O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cocaine
cumulative risk
children
vagal tone

prenatal drug exposure
heart rate variability
developmental outcome


A case study of gesture expressivity breaks In this paper we propose a study of co-verbal gesture expressivity during a conversational interaction. The work is based on the analysis of gesture expressivity over time, that we have conducted on two clips of 2D animations. The first results point out two types of modulations in gesture expressivity that we relate to the rhetorical functions of the discourse. These results extend the knowledge about gesture expressivity from emotion and personality issues to pragmatical ones. An evaluation study is proposed to measure the effects of the modulations.

O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O

cartoon animation
annotation schema for gestures


n-Mode Singular Vector Selection in Higher-Order Singular Value Decomposition In this paper, we propose a method for selecting n-mode singular vectors in higher-order singular value decomposition. We select the minimum number of n-mode singular vectors, when the upper bound of a least-squares cost function is thresholded. The reduced n-ranks of all modes of a given tensor are determined automatically and the tensor is represented with the minimum number of dimensions. We apply the selection method to simultaneous low rank approximation of matrices. Experimental results show the effectiveness of the n-mode singular vector selection method.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Low power design of DCT and IDCT for low bit rate video codecs This paper examines low power design techniques for discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT) circuits applicable for low bit rate wireless video systems. The techniques include skipping DCT computation of low energy macroblocks, skipping IDCT computation of blocks with all coefficients equal to zero, using lower precision constant multipliers, gating the clock, and reducing transitions in the data path. The proposed DCT and IDCT circuits reduce power dissipation by, on average, 94% over baseline reference circuits.

B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

inverse discrete cosine transform (idct)


achieving both model and code coverage with automated gray-box testing We have devised a novel technique to automatically generate test cases for a software system, combining black-box model-based testing with white-box parameterized unit testing. The former provides general guidance for the structure of the tests in the form of test sequences, as well as the oracle to check for conformance of an application under test with respect to a behavioral model. The latter finds a set of concrete parameter values that maximize code coverage using symbolic analysis. By applying these techniques together, we can produce test definitions (expressed as code to be run in a test management framework) that exercise all selected paths in the model, while also covering code branches specific to the implementation. These results cannot be obtained from any of the individual approaches alone, as the model cannot predict what values are significant to a particular implementation, while parameterized unit testing requires manually written test sequences and correctness validations. We provide tool support, integrated into our model-based testing tool.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O

concolic execution
test-case generation
symbolic execution
model-based testing


A linear time approximation algorithm for movement minimization in conveyor flow shop processing ? We consider the movement minimization problem in a conveyor flow shop processing controlled by one worker for all machines. A machine can only execute tasks if the worker is present. Each machine can serve as a buffer. The worker has to cover a certain distance to move from one machine to the other. The distance between two machines Pp and Pq is |p?q|. The objective is to minimize the total distance the worker has to cover for the processing of all jobs. We introduce a linear time approximation algorithm for the conveyor flow shop problem with performance 3. Such minimization problems usually appear in conveyor controlled manufacturing systems.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

problem complexity
approximation algorithms
movement optimization control


Evolutionary optimisation of noisy multi-objective problems using confidence-based dynamic resampling Many real-world optimisation problems approached by evolutionary algorithms are subject to noise. When noise is present, the evolutionary selection process may become unstable and the convergence of the optimisation adversely affected. In this paper, we present a new technique that efficiently deals with noise in multi-objective optimisation. This technique aims at preventing the propagation of inferior solutions in the evolutionary selection due to noisy objective values. This is done by using an iterative resampling procedure that reduces the noise until the likelihood of selecting the correct solution reaches a given confidence level. To achieve an efficient utilisation of resources, the number of samples used per solution varies based on the amount of noise in the present area of the search space. The proposed algorithm is evaluated on the ZDT benchmark problems and two complex real-world problems of manufacturing optimisation. The first real-world problem concerns the optimisation of engine component manufacturing in aviation industry, while the second real-world problem concerns the optimisation of a camshaft machining line in automotive industry. The results from the optimisations indicate that the proposed technique is successful in reducing noise, and it competes successfully with other noise handling techniques.

O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O

evolutionary computations
multi-objective optimisation
simulation


The

Monte

Carlo

event

generator

AcerMC

versions

to

with

interfaces

to

PYTHIA

HERWIG

and

ARIADNE

The

AcerMC

Monte

Carlo

generator

is

dedicated

to

the

generation

of

Standard

Model

background

processes

which

were

recognised

as

critical

for

the

searches

at

LHC,

and

generation

of

which

was

either

unavailable

or

not

straightforward

so

far.

The

program

itself

provides

a

library

of

the

massive

matrix

elements

(coded

by

MADGRAPH)

and

native

phase

space

modules

for

generation

of

a

set

of

selected

processes.

The

hard

process

event

can

be

completed

by

the

initial

and

the

final

state

radiation,

hadronisation

and

decays

through

the

existing

interface

with

either

PYTHIA,

HERWIG

or

ARIADNE

event

generators

and

(optionally)

TAUOLA

and

PHOTOS.

Interfaces

to

all

these

packages

are

provided

in

the

distribution

version.

The

phase-space

generation

is

based

on

the

multi-channel

self-optimising

approach

using

the

modified

KajantieByckling

formalism

for

phase

space

construction

and

further

smoothing

of

the

phase

space

was

obtained

by

using

a

modified

ac-VEGAS

algorithm.

An

additional

improvement

in

the

recent

versions

is

the

inclusion

of

the

consistent

prescription

for

matching

the

matrix

element

calculations

with

parton

showering

for

a

select

list

of

processes.

Program

title:

AcerMC

version

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

FORTRAN

with

popular

extensions

gfortran).

Computer:

All

running

Linux.

Operating

system:

Linux.

Classification:

External

routines:

CERNLIB

LHAPDF

Catalogue

identifier

of

previous

version:

Journal

reference

of

previous

version:

Comput.

Phys.

Comm.

Does

the

new

version

supersede

the

previous

version?:

Yes

Nature

of

problem:

Despite

a

large

repertoire

of

processes

implemented

for

generation

in

event

generators

like

or

a

number

of

background

processes,

crucial

for

studying

the

expected

physics

of

the

LHC

experiments,

is

missing.

For

some

of

these

processes

the

matrix

element

expressions

are

rather

lengthy

and/or

to

achieve

a

reasonable

generation

efficiency

it

is

necessary

to

tailor

the

phase

space

selection

procedure

to

the

dynamics

of

the

process.

That

is

why

it

is

not

practical

to

imagine

that

any

of

the

above

general

purpose

generators

will

contain

every,

or

even

only

observable,

processes

which

will

occur

at

LHC

collisions.

A

more

practical

solution

can

be

found

in

a

library

of

dedicated

matrix-element-based

generators,

with

the

standardised

interfaces

like

that

proposed

to

the

more

universal

one

which

is

used

to

complete

the

event

generation.

Solution

method:

The

AcerMC

EventGenerator

provides

a

library

of

the

matrix-element-based

generators

for

several

processes.

The

initial-

and

final-state

showers,

beam

remnants

and

underlying

events,

fragmentation

and

remaining

decays

are

supposed

to

be

performed

by

the

other

universal

generator

to

which

this

one

is

interfaced.

We

will

call

it

a

supervising

generator.

The

interfaces

to

PYTHIA

ARIADNE

and

HERWIG

as

such

generators,

are

provided.

Provided

is

also

an

interface

to

and

packages

for

-lepton

decays

(including

spin

correlations

treatment)

and

QED

radiations

in

decays

of

particles.

At

present,

the

following

matrix-element-based

processes

have

been

implemented:

g

g

q

q

t

t

b

b

q

q

W

b

b

q

q

W

t

t

g

g

q

q

Z

b

b

g

g

q

q

Z

b

b

t

t

complete

EW

g

g

q

q

Z

W

t

t

b

b

g

g

q

q

t

t

t

t

g

g

q

q

t

t

f

f

b

f

f

b

g

g

q

q

W

W

b

b

f

f

f

f

b

b

Both

interfaces

allow

the

use

of

the

LHAPDF/LHAGLUE

library

of

parton

density

functions.

Provided

is

also

a

set

of

control

processes

q

q

W

q

q

Z

g

g

q

q

t

t

and

g

g

t

t

W

b

W

b

Reasons

for

new

version:

Implementation

of

several

new

processes

and

methods.

Summary

of

revisions:

Each

version

added

new

processes

or

functionalities,

a

detailed

list

is

given

in

the

section

Changes

since

AcerMC

Restrictions:

The

package

is

optimised

for

the

TeV

pp

p

p

collision

simulated

in

the

LHC

environment

and

also

works

at

the

achieved

LHC

energies

of

TeV

and

TeV.

The

consistency

between

results

of

the

complete

generation

using

PYTHIA

or

HERWIG

interfaces

is

technically

limited

by

the

different

approaches

taken

in

both

these

generators

for

evaluating

?QCD

Q

C

D

and

?QED

Q

E

D

couplings

and

by

the

different

models

for

fragmentation/hadronisation.

For

the

consistency

check,

in

the

AcerMC

library

contains

native

coded

definitions

of

the

QCD

and

?QED

Q

E

D

Using

these

native

definitions

leads

to

the

same

total

cross-sections

both

with

PYTHIA

or

HERWIG

interfaces.

Additional

comments:

The

distribution

file

for

this

program

is

over

Mbytes

and

therefore

is

not

delivered

directly

when

download

or

Email

is

requested.

Instead

an

html

file

giving

details

of

how

the

program

can

be

obtained

is

sent.

Running

time:

On

an

PIII

MHz

PC

it

amounts

to

events/sec,

depending

on

the

choice

of

process.

References:

T.

Sjostrand

etal.,

High

energy

physics

generation

with

PYTHIA

eprint

LU-TP

August

G.

Julyesini

etal.,

Comp.

Phys.

Commun.

G.

Corcella

etal.,

JHEP

E.

Boos

at

al.,

Generic

user

process

interface

for

event

generators,

hepph

S.

Jadach,

J.

H.

Kuhn,

Z.

Was,

Comput.

Phys.

Commun.

M.

Jezabek,

Z.

Was,

S.

Jadach,

J.

H.

Kuhn,

Comput.

Phys.

Commun.

R.

Decker,

S.

Jadach,

J.

H.

Kuhn,

Z.

Was,

Comput.

Phys.

Commun.

E.

Barberio

and

Z.

Was,

Comp.

Phys.

Commun.

O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

massive matrix elements
monte carlo generator

sm backgrounds at lhc
heavy flavour production
multi-channel phase-space generation


Text de-identification for privacy protection: A study of its impact on clinical text information content Text de-identification minimally reduces the informativeness of clinical notes. About 1.23% of clinical concepts in text are altered by de-identification. Only 0.81% of the annotated clinical concepts fully overlap with PHI. Only 1.78% of the annotated clinical concepts partly overlap with PHI.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

united states department of veterans affairs


3-d interaction with a large wall display using transparent markers In this paper we proposed a new interface for interacting with large displays via small video devices such as a cell phone. We estimate the location of the camera relative to the display using a matrix of transparent markers embedded on display. As a result, our interface allows the user to interact with digital contents without being distracted by opaque visual markers. Our interface enables intuitive interactions such as pointing, rotating, dragging and dropping. Moreover, our use of a small hand-held camera device allows for interaction with large scale displays without the need for direct contact with the display surface. Thus our system is well suited for interactions when there is some distance between the user and the display. Our proposed system has applications to large scale advertisement displays and can enable interactions between individuals and large scale digital content.

O B O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

transparent markers
wall display
interaction

lcd
marker
polarization
vision-based hci
augmented reality


Integrality and Separability of Multitouch Interaction Techniques in 3D Manipulation Tasks Multitouch displays represent a promising technology for the display and manipulation of data. While the manipulation of 2D data has been widely explored, 3D manipulation with multitouch displays remains largely unexplored. Based on an analysis of the integration and separation of degrees of freedom, we propose a taxonomy for 3D manipulation techniques with multitouch displays. Using that taxonomy, we introduce Depth-Separated Screen-Space (DS3), a new 3D manipulation technique based on the separation of translation and rotation. In a controlled experiment, we compared DS3 with Sticky Tools and Screen-Space. Results show that separating the control of translation and rotation significantly affects performance for 3D manipulation, with DS3 performing faster than the two other techniques.

O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

3d manipulation task
direct manipulation
dof separation


Salient Stills Salient Stills are a class of images that reflect the aggregation of the temporal changes that occur in a moving-image sequence with the salient features of individual frames preserved. They convey the intended expression of an entire series of moving frames - a visual summary of camera and object movements. The original frames, which may include variations in focal length or field of view, or moving objects, are combined to create a single still image. The still image may have multiresolution patches, a larger field of view, or higher overall resolution than any individual frame in the original image sequence. Salient Stills may also contain selected significant objects from individual or multiple video frames. Salient Stills attempt to retain much of the original content ( detail) and spatial and temporal extent ( context) of the original video or film sequence.

B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O

algorithms
semantic image processing
video summary
video database
timeprints
media transcoding
shape-time photography
synopsis mosaic
video mosaic


Detecting moving shadows: Algorithms and evaluation Moving shadows need careful consideration in the development of robust dynamic scene analysis systems. Moving shadow detection is critical for accurate object detection in video streams since shadow points are often misclassified as object points, causing errors in segmentation and tracking. Many algorithms have been proposed in the literature that deal with shadows. However, a comparative evaluation of the existing approaches is still lacking. In this paper, we present a comprehensive survey of moving shadow detection approaches. We organize contributions reported in the literature in four classes two of them are statistical and two are deterministic. We also present a comparative empirical evaluation of representative algorithms selected from these four classes. Novel quantitative (detection and discrimination rate) and qualitative metrics (scene and object independence, flexibility to shadow situations, and robustness to noise) are proposed to evaluate these classes of algorithms on a benchmark suite of indoor and outdoor video sequences. These video sequences and associated "ground-truth" data are made available at http://cvrr.ucsd.edu/aton/shadow to allow for others in the community to experiment with new algorithms and metrics.

O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

shadow detection
object detection
segmentation

performance evaluation
traffic scene analysis
visual surveillance


Fast Second Order Learning Algorithm for Feedforward Multilayer Neural Networks and its Applications The paper presents the efficient training program of multilayer feedforward neural networks. It is based on the best second order optimization algorithms including variable metric and conjugate gradient as well as application of directional minimization in each step. Its efficiency is proved on the standard tests, including parity, dichotomy, logistic and two-spiral problems. The application of the algorithm to the solution of higher dimensionality problems like deconvolution, separation of sources and identification of nonlinear dynamic plant are also given and discussed. It is shown that the appropriately trained neural network can be used for the nonconventional solution of these standard signal processing tasks with satisfactory accuracy. The results of numerical experiments are included and discussed in the paper. Copyright 1996 Elsevier Science Ltd.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

feedforward neural networks second order learning algorithms


Robustness of Fourier estimator of integrated volatility in the presence of microstructure noise The finite sample properties of the Fourier estimator of integrated volatility under market microstructure noise are studied. Analytic expressions for the bias and the mean squared error (MSE) of the contaminated estimator are derived. These formulae can be practically used to design optimal MSE-based estimators, which are very robust and efficient in the presence of noise. Moreover an empirical analysis based on a simulation study and on high-frequency logarithmic prices of the Italian stock index futures (FIB30) validates the theoretical results.

O O O O O B I O O O O B O O O O O O O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

nonparametric estimation
fourier analysis
optimal sampling


Vertical separation as means to establish interoperability in road tolling in Europe As more European roads become tolled by various means, an increasing share of road users become subject to more than one tolling scheme in their regular driving. This can be especially burdensome for long distance hauliers, who may pass several countries and tolled motorway systems during the course of 1day. For this reason, a range of projects have been initiated attempting to increase the level of interoperability between tolling systems, many of which with only limited success. By analyzing current incentives, costs and benefits for toll operators and road users, we conclude firstly that the current level of interoperability is likely to be lower than socially optimal, and secondly that a direct regulation making the provision of interoperability mandatory is likely to be in excess of what is socially optimal. We argue that vertically separating the monopolistic toll operators could be a cost-efficient way to achieve a socially optimal level of interoperability as a equilibrium market outcome.

O O O O O O B O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O

road user charging
eets
industrial organisation


APPLICATION OF MIXED INTEGER LINEAR PROGRAMMING IN THE GENERATION OF VECTORS WITH MAXIMUM DATAPATH COVERAGE FOR COMBINATIONAL LOGIC CIRCUITS In this paper, we present a novel methodology for vector generation that maximizes the metric of datapath coverage for a given combinational logic circuit. The proposed methodology is based on Mixed Integer Linear Programming (MILP). The search of input vectors based on the datapath coverage metric is a satisficability (SAT) problem. In order to obtain maximum coverage vectors, we use a novel model for the Boolean logic gates to translate the original SAT problem into an MILP optimization problem. Next, the new problem is solved following the MILP optimization environment and an exhaustive search strategy. We compare our proposed methodology with the exhaustive search algorithm. Experimental results and performance comparisons based on the large set of MCNC'91 suite of benchmark circuits are presented. They show significant speedups of MILP methodology against the exhaustive search algorithm for the complex circuits.

O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mixed integer linear programming (milp)
vlsi


A clustering method based on fuzzy equivalence relation for customer relationship management In real world, customers commonly take relevant attributes into consideration for the selection of products and services. Further, the attribute assessment of a product or service is often presented by a linguistic data sequence. To partition these linguistic data sequences of customers assessment on a product or service, a proper clustering method is essential and proposed in this paper. In the clustering method, the linguistic data sequences are presented by fuzzy data sequences and a fuzzy compatible relation is first constructed to present the binary relation between two data sequences. Then a fuzzy equivalence relation is derived by maxmin transitive closure from the fuzzy compatible relation. Based on the fuzzy equivalence relation, the linguistic data sequences are easily classified into clusters. The clusters representing the selection preferences of different customers on the product or service will be the foundation of developing customer relationship management (CRM).

O B O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I I O O O O B I O O B I I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O

clustering
customer relationship management
fuzzy compatible relation
fuzzy equivalence relation
transitive closure


Wifi-Reports: Improving Wireless Network Selection with Collaboration Wi-Fi clients can obtain much better performance at some commercial hot spots than others. Unfortunately, there is currently no way for users to determine which hot spot access points (APs) will be sufficient to run their applications before purchasing access. To address this problem, this paper presents Wifi-Reports, a collaborative service that provides Wi-Fi clients with historical information about AP performance and application support. The key research challenge in Wifi-Reports is to obtain accurate user-submitted reports. This is challenging because two conflicting goals must be addressed in a practical system: preserving the privacy of users' reports and limiting fraudulent reports. We introduce a practical cryptographic protocol that achieves both goals, and address the important engineering challenges in building Wifi-Reports. Using a measurement study of APs in a busy commercial district, we show that Wifi-Reports would improve the performance over previous AP selection approaches in 30-60 percent of locations.

O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Pseudo-zernike moments-based audio content authentication algorithm robust against feature-analysed substitution attack Content-based audio content authentication algorithms provide a method to solve the veracity and integrity of audio content. On the basic of pseudo-Zernike moments, an audio content authentication algorithm robust against feature-analysed substitution attack is proposed, which is aimed at some insecure issues in the existing content-based audio content authentication schemes. Firstly, the audio signal is cut into non-overlapping frames and each frame is divided into two segments, and each segment is scrambled. Then, synchronization codes generated by pseudo random sequence and watermark bits generated by pseudo-Zernike moments are embedded in the first and second segment, respectively, which are completed by quantizing the modulus of pseudo-Zernike moments. The scrambled segments used to generate and extract watermark are unknown to attackers. So, it is difficult for attackers to get the watermark generated and extracted to perform feature-analysed substitution attack. The synchronization code and watermark embedding method proposed is inaudible and has excellent ability to tolerance against common signal processing operations. Compared with the existing audio watermark algorithms based on pseudo-Zernike moments, the algorithm increases the embedding capacity and improves the security of the watermarking system.

O O B I I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

audio content authentication
synchronization code

pseudo-zernike moments
tamper localization


Friendly bin packing instances without Integer Round-up Property It is well known that the gap between the optimal values of bin packing and fractional bin packing, if the latter is rounded up to the closest integer, is almost always null. Known counterexamples to this for integer input values involve fairly large numbers. Specifically, the first one was derived in 1986 and involved a bin capacity of the order of a billion. Later in 1998 a counterexample with a bin capacity of the order of a million was found. In this paper we show a large number of counterexamples with bin capacity of the order of a hundred, showing that the gap may be positive even for numbers which arise in customary applications. The associated instances are constructed starting from the Petersen graph and using the fact that it is fractionally, but not integrally, 3-edge colorable.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O

05c15 coloring of graphs and hypergraphs


DSS: Distributed SINR-Based Scheduling Algorithm for Multihop Wireless Networks The problem of developing distributed scheduling algorithms for high throughput in multihop wireless networks has been extensively studied in recent years. The design of a distributed low-complexity scheduling algorithm becomes even more challenging when taking into account a physical interference model, which requires the SINR at a receiver to be checked when making scheduling decisions. To do so, we need to check whether a transmission failure is caused by interference due to simultaneous transmissions from distant nodes. In this paper, we propose a scheduling algorithm under a physical interference model, which is amenable to distributed implementation with 802.11 CSMA technologies. The proposed scheduling algorithm is shown to achieve throughput optimality. We present two variations of the algorithm to enhance the delay performance and to reduce the control overhead, respectively, while retaining throughput optimality.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wireless scheduling
discrete time markov chain


Investigating Musical Disorders with Diffusion Tensor Imaging The arcuate fasciculus (AF) is a bundle of white matter traditionally thought to be responsible for language function. However, its role in music is not known. Here we investigate the connectivity of the AF using diffusion tensor imaging (DTI) and show that musically tone-deaf individuals, who show impairments in pitch discrimination, have reduced connectivity in the AF relative to musically normal-functioning control subjects. Results were robust to variations in imaging parameters and emphasize the importance of brain connectivity in para-linguistic processes, such as music.

O B I O O O O O B I O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

musical disorders
arcuate fasciculus
language

diffusion tensor imaging (dti)
pitch perception


A socio-technical analysis of work with ideas in NPD: an industrial case study The work with ideas is perceived by both academics and industry to be an important element in new product development and has thus been the subject of investigation in many different research fields. In this paper, we investigate a specific case showing how a successful product was developed based on piecing together a number of ideas that were developed and disseminated in a large industrial company. We do this through an in-depth case study of the development of the energy-labeled circulation pump Alpha Pro, developed by one of the worlds leading pump manufacturers, Grundfos. Using a socio-technical approach, we focus especially on the actors involved and the contextual factors, and less on the detailed development of technical ideas. In our study, we observe that (1) ideas are pieced together from previous ideas and results; (2) ideas are implemented through continuous mobilization of support and development of legitimate arguments; and (3) idea work is also a socio-technical process, because contextual factors matter. We observe that idea work is an ongoing process undertaken across different projects, actors, departments, strategies, and visions within Grundfos, while also involving external actors outside Grundfos. Based on our socio-technical approach and observations, we begin to develop a broader understanding of idea work in new product development and sketch an analytical framework that can be used to make socio-technical analyses of product development projects in future research.

O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I I O O O O O O O O O O O O O O O O O O O O

new product development
idea work
case study


Maritime abnormality detection using Gaussian processes Novelty, or abnormality, detection aims to identify patterns within data streams that do not conform to expected behaviour. This paper introduces novelty detection techniques using a combination of Gaussian processes, extreme value theory and divergence measurement to identify anomalous behaviour in both streaming and batch data. The approach is tested on both synthetic and real data, showing itself to be effective in our primary application of maritime vessel track analysis.

O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

gaussian processes
extreme value theory
novelty detection

hellinger distance
nonnegative matrix factorisation
maritime traffic
outlier detection


Post-pruning in decision tree induction using multiple performance measures The decision tree (DT) induction process has two major phases: the growth phase and the pruning phase. The pruning phase aims to generalize the DT that was generated in the growth phase by generating a sub-tree that avoids over-fitting to the training data. Most post-pruning methods essentially address post-pruning as if it were a single objective problem (i.e. maximize validation accuracy), and address the issue of simplicity (in terms of the number of leaves) only in the case of a tie. However, it is well known that apart from accuracy there are other performance measures (e.g. stability, simplicity, interpretability) that are important for evaluating DT quality. In this paper, we propose that multi-objective evaluation be done during the post-pruning phase in order to select the best sub-tree, and propose a procedure for obtaining the optimal sub-tree based on user provided preference and value function information.

O O B I O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

post-pruning
multi-criteria decision analysis
mixed integer programming
analytic hierarchy processing


The bridge-connectivity augmentation problem with a partition constraint In this paper, we consider the augmentation problem of an undirected graph with k partitions of its vertices. The main issue is how to add a set of edges with the smallest possible cardinality so that the resulting graph is 2-edge-connected, i.e., bridge-connected, while maintaining the original partition constraint. To solve the problem, we propose a simple linear-time algorithm. To the best of our knowledge, the most efficient sequential algorithm runs in O(n(m+n log n) log n) time. However, we show that it can also run in 0(log n) parallel time on an EREW PRAM using a linear number of processors, where n is the number of vertices in the input graph. If a simple graph exists, our main algorithm ensures that it is as simple as possible. (C) 2010 Elsevier B.V. All rights reserved.

O O B O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


an asymmetric communications platform for knowledge sharing with low-end mobile phones We present Awaaz.De ("give voice"), a social platform for communities to access and share knowledge using low-end mobile phones. Awaaz.De features a configurable mobile voice application organized into asynchronous voice mes-sage boards. For poor, remote and marginal communities, the voice-touchtone interface addresses the constraints of low literacy, language diversity, and affordability of only basic mobile devices. Voice content also presents a low barrier to content authoring, encouraging otherwise disconnected communities to actively participate in knowledge exchange. Awaaz.De includes a web-based administration interface for Internet-connected community managers to moderate, annotate, categorize, route, and narrow-cast voice messages. In this paper we describe the platform's design, implementation, and future directions.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


SPANNERS OF COMPLETE k-PARTITE GEOMETRIC GRAPHS We address the following problem: Given a complete k-partite geometric graph K whose vertex set is a set of n points in R(d), compute a spanner of K that has a "small" stretch factor and "few" edges. We present two algorithms for this problem. The first algorithm computes a (5+ subset of)spanner of K with O(n) edges in O(n log n) time. The second algorithm computes a (3 + is an element of)-spanner of K with O(n log n) edges in O(n log n) time. The latter result is optimal: We show that for any 2 <= k <= n - circle minus(root n log n), spanners with O(n log n) edges and stretch factor less than 3 do not exist for all complete k-partite geometric graphs.

B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O

computational geometry
k-partite geometric graphs


Model-robust designs for split-plot experiments Split-plot experiments are appropriate when some factors are more difficult and/or expensive to change than others. They require two levels of randomization resulting in a non-independent error structure. The design of such experiments has garnered much recent attention, including work on exact D D -optimal split-plot designs. However, many of these procedures rely on the a priori assumption that the form of the regression function is known. We relax this assumption by allowing a set of model forms to be specified, and use a scaled product criterion along with an exchange algorithm to produce designs that account for all models in the set. We include also a generalization which allows weights to be assigned to each model, though they appear to have only a slight effect. We present two examples from the literature, and compare the scaled product designs with designs optimal for a single model. We also discuss a maximin alternative.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O

d d -optimality d d d d d
exact experimental design
model-robust
split-plot


towards a taxonomy of approaches for mining of source code repositories Source code version repositories provide a treasure of information encompassing the changes introduced in the system throughout its evolution. These repositories are typically managed by tools such as CVS. However, these tools identify and express changes in terms of physical attributes i.e., file and line numbers. Recently, to help support the mining of software repositories (MSR), researchers have proposed methods to derive and express changes from source code repositories in a more source-code "aware" manner (i.e., syntax and semantic). Here, we discuss these MSR techniques in light of what changes are identified, how they are expressed, the adopted methodology, evaluation, and results. This work forms the basis for a taxonomic description of MSR approaches.

O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A readability analysis for QR code application in a traceability system Paper suggests recording the data on the product package in the form of a QR code. Experiments were performed with various types of printed materials. QR code readability analysis was also done for geometric deformation of the code. QR code readability is influenced by the module size that constitutes the code. The change of the printed material influences the code readability.

O B O O B I O O O B O O O O O O O O O O O O O O O B I O O O O O O O O O B I B O O O O O O O O O O B I B O O O O O O O O O O O O O O O O O O O B


Generalization performance of support vector classifiers for density level detection This paper investigates the generalization performance of support vector classifiers for density level detection (DLD) when the input term belongs to a separable Hilbert space. The estimate of learning rate for DLD problem is established by Rademacher average and iterative techniques, which is independent of the assumption of covering number used in the previous literature.

O O O O O O O B I I O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O

learning rate
density level detection
rademacher average


Additive rules in discrete allocation problems In this paper, we study allocation problems and other related problems where a discrete estate should be divided among agents who have claims on it. We characterize the set of rules satisfying additivity on the estate along with additivity on the estate and the claims. These results complete the characterizations given by Bergantios and Vidal-Puga (Mathematical Social Sciences 47 (2004), 87101) in the continuous case.

O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Effect of Cell-Free DNA of Patients with Cardiomyopathy and rDNA on the Frequency of Contraction of Electrically Paced Neonatal Rat Ventricular Myocytes in Culture There is evidence that infarcted myocardium contributes to the increase of cell-free DNA levels (cfDNA). We studied the effect of different human DNA fragments on the rate of contraction of the electrically paced neonatal rat ventricular myocytes in culture (spontaneously hypertensive line SHR). AT-rich fragments of the human satellite 3 tandem repeat (1q12 region) at a concentration of 1 ng/mL increase the frequency of cardiomyocyte contractions by 22.5 times. GC-rich fragments of the rDNA at 0.5 ng/mL decrease the cardiomyocyte contraction frequency by 1.52 times. The serum cfDNA of patients with acute myocardial infarction decreases the frequency of the contraction of cardiomyocytes proportionally to the amount of the rDNA fragments it contains. The rDNA effect is similar to the E. coli DNA effect and is presumably being realized through TLR9. In the presence of the inhibitor of these receptors, rDNA operates the same way as the fragment of the satellite 3increasing the frequency of the cardiomyocyte contractions. Accumulation of the GC-rich fragments of the cfDNA in the blood of the AMI patients might have an influence on the contractile function of myocardial cells.

O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Reversing compiled executables for malware analysis via visualization Reverse engineering-compiled executables is a task with a steep learning curve. It is complicated by the task of translating assembly into a series of abstractions that represent the overall flow of a program. Most of the steps involve finding interesting areas of an executable and determining their general functionality. This article presents a method using dynamic analysis of program execution to visually represent the general flow of a program. We use the Ether hypervisor framework to covertly monitor a program. The data are processed and presented for the reverse engineer. The VERA (Visualization of Executables for Reversing and Analysis) system specifically accelerates the location of the original entry point and understanding of overall executable functionality. Using this method, the amount of time needed to extract key features of an executable is greatly reduced, improving productivity. Two malware samples are used to demonstrate the advantages of using the VERA system to reverse engineer malware. Further, these examples exemplify a reversing process enhanced through effective use of dynamic analysis tools. Preliminary user study indicates that the tool is useful for both new and experienced users. Information Visualization (2011) 10, 117-126. doi:10.1057/ivs.2010.11; published online 13 January 2011

O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O


Resolving motion correspondence for densely moving points This paper studies the motion correspondence problem for which a diversity of qualitative and statistical solutions exist. We concentrate on qualitative modeling, especially in situations where assignment conflicts arise either because multiple features compete for one detected point or because multiple detected points fit a single feature point. We leave out the possibility of point track initiation and termination because that principally conflicts with allowing for temporary point occlusion. We introduce individual, combined, and global motion models and fit existing qualitative solutions in this framework. Additionally, we present a new efficient tracking algorithm that satisfies these-possibly constrained-models in a greedy matching sense, including an effective way to handle detection errors and occlusion. The performance evaluation shows that the proposed algorithm outperforms existing greedy matching algorithms. Finally, we describe an extension to the tracker that enables automatic initialization of the point tracks. Several experiments show that the extended algorithm is efficient, hardly sensitive its few parameters, and qualitatively better than other algorithms, including the presumed optimal statistical multiple hypothesis tracker.

O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O


differential synchronization This paper describes the Differential Synchronization (DS) method for keeping documents synchronized. The key feature of DS is that it is simple and well suited for use in both novel and existing state-based applications without requiring application redesign. DS uses deltas to make efficient use of bandwidth, and is fault-tolerant, allowing copies to converge in spite of occasional errors. We consider practical implementation of DS and describe some techniques to improve its performance in a browser environment.

O B O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Weaknesses and Improvement of Secure Hash-Based Strong-Password Authentication Protocol In 2008, Kim-Koc proposed a secure hash-based strong-password authentication protocol using one-time public key cryptography. He claimed that the protocol was secure against guessing, stolen-verifier, replay, denial-of-service, and impersonation attacks. However, we show that the protocol is vulnerable to impersonation, guessing, and stolen-verifier attacks. We propose improvements to increase the security level of the protocol.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

impersonation attack
guessing attack
stolen-verifier attack
password-based authentication
hash-based password authentication


trace analysis of erlang programs The paper reports on an experiment to provide the Erlang programming language with a tool package for convenient trace generation, collection and to support analysis of traces using a set of techniques. Due to the frequent use of state-based software design patterns in Erlang programming we can in many cases recover not only the events from a trace log, but also the program states causing these events. This makes it possible to obtain program models from execution traces. In our work we make use of these program models for program visualization and model checking.

O B O B O O B O O O O O O O B B I O O B O O O O B O O O B B O B O O O O O O O O O B O O B I O O B O O O O O O O O O O O O O O B O O O B O O O O O O O O O O B O O O B O O O O O B O O B O O B O O B I

program
model checking
traces
generation
use
log
analysis
software design
tool
support
paper
erlang
programming language

event
program visualization
packaging
collect
trace analysis
experience
program modelling
pattern


Smoothly approximated support vector domain description Smoothly approximates the objective function of support vector domain description. Gradient based optimization method could be applied to the smoothed model. The proposed algorithms have asymptotic training complexity (n2) ( n 2 ) . The algorithm is easy to implement, without requiring any optimization package.

O O B I I I O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

smooth approximation
quadratic programming
conjugate gradient


An Object Based Cooperative Spectrum Sensing Scheme with Best Relay The performance of cooperative spectrum sensing (CSS) is limited not only by the imperfect sensing channels but also by the imperfect reporting channels. In order to improve the transmission reliability of the reporting channels, an object based cooperative spectrum sensing scheme with best relay (P-e-BRCS) is proposed, in which the best relay is selected by minimizing the total reporting error probability to improve the sensing performance. Numerical results show that, the reduced total reporting error probability and the improved sensing performance can be achieved by the P-e-BRCS scheme.

O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B O O O O O O B I I O O O O O O O O O O O O B I I O O O O O O O O O O O O


Damped oscillators: A continuous model for velocity dependent drag We study a continuous model which describes the action of a velocity dependent drag on an oscillatory system. The solution of the resulting differential equation turns out to be asymptotic to a function which is expressible by means of the gamma and the hypergeometric functions. Among the applications, we consider that to the free oscillations around the fixed point which are ruled by van der Pols equation. A section is devoted to computational procedures and simulations.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

asymptotic approximations
hypergeometric function
euler gamma function


On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity An infinite sequence X is said to have trivial (prefix-free) initial segment complexity if the prefix-free Kolmogorov complexity of each initial segment of X is the same as the complexity of the sequence of 0s of the same length, up to a constant. We study the gap between the minimum complexity K(0 n ) and the initial segment complexity of a nontrivial sequence, and in particular the nondecreasing unbounded functions f such that (?) for a nontrivial sequence X, where K denotes the prefix-free complexity. Our first result is that there exists a \(\varDelta^{0}_{3}\) unbounded nondecreasing function f which does not have this property. It is known that such functions cannot be \(\varDelta^{0}_{2}\) hence this is an optimal bound on their arithmetical complexity. Moreover it improves the bound \(\varDelta^{0}_{4}\) that was known from Csima and Montalbn (Proc. Amer. Math. Soc. 134(5):14991502, 2006).

O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

initial segment prefix-free complexity
k-triviality
low for ?


Visualizing explicit and implicit relations of complex information spaces In this work, we describe how EdgeMaps provide a new method for integrating the visualization of explicit and implicit data relations. Explicit relations are specific connections between entities already present in a given data set, while implicit relations are derived from multidimensional data based on similarity measures. Many data sets include both types of relations, which are often difficult to represent together in information visualizations. Node-link diagrams typically focus on explicit data connections while not incorporating implicit similarities between entities. Multidimensional scaling considers similarities between items; however, explicit links between nodes are not displayed. In contrast, EdgeMaps visualize both explicit and implicit relations by combining graph drawing and spatialization techniques. We have applied this technique to three case studies (philosophers, painters, and musicians) and explored how integrated visualizations of explicit and implicit relations reveal novel patterns and relationships.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information visualization
explicit and implicit relationships
dimensionality reduction
aesthetics
design
www