Cardinality Networks: a theoretical and empirical study We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of E,n and Sorensson (JSAT 2:1-26, 2006) in that it requires much less clauses and auxiliary variables, while arc consistency is still preserved: e.g., for a constraint x (1) + ... + x (n) a parts per thousand currency signaEuro parts per thousand k, as soon as k variables among the x (i) 's become true, unit propagation sets all other x (i) 's to false. Our encoding also still admits incremental strengthening: this constraint for any smaller k is obtained without adding any new clauses, by setting a single variable to false. Here we give precise recursive definitions of the clause sets that are needed and give detailed proofs of the required properties. We demonstrate the practical impact of this new encoding by careful experiments comparing it with previous encodings on real-world instances.

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 O O O O O O O O O O O O O O O O O O O O O O


John and Loewner Ellipsoids John's ellipsoid criterion characterizes the unique ellipsoid of globally maximum volume contained in a given convex body C. In this article local and global maximum properties of the volume on the space of all ellipsoids in C are studied, where ultra maximality is a stronger version of maximality: the volume is nowhere stationary. The ellipsoids for which the volume is locally maximum, resp. locally ultra maximum are characterized. The global maximum is the only local maximum and for generic C it is an ultra maximum. The characterizations make use of notions originating from the geometric theory of positive quadratic forms. Part of these results generalize to the case where the ellipsoids are replaced by affine copies of a convex body D. In contrast to the ellipsoid case, there are convex bodies C and D, such that on the space of all affine images of D in C the volume has countably many local maxima. All results have dual counterparts. Extensions to the surface area and, more generally, to intrinsic volumes are mentioned.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

john ellipsoid
loewner ellipsoid
eutaxy
perfection


improving proactive information systems Proactive contextual information systems help people locate information by automatically suggesting potentially relevant resources based on their current tasks or interests. Such systems are becoming increasingly popular, but designing user interfaces that effectively communicate recommended information is a challenge: the interface must be unobtrusive, yet communicate enough information at the right time to provide value to the user. In this paper we describe our experience with the FXPAL Bar, a proactive information system designed to provide contextual access to corporate and personal resources. In particular, we present three features designed to communicate proactive recommendations more effectively: translucent recommendation windows increase the user's awareness of particularly highly-ranked recommendations, query term highlighting communicates the relationship between a recommended document and the user's current context, and a novel recommendation digest function allows users to return to the most relevant previously recommended resources. We present empirical evidence supporting our design decisions and relate lessons learned for other designers of contextual recommendation systems.

O O O B O B I B B 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 B O O O O O O O B O O O O O O O O O O O O O O O B O O B O O B O O O B O O O O O O B I O O O B B O O O O O O O O O O O O O O B I O O O B O O O B B O O O O O O O O O O O O O O O O B O B O O O B O O O B O O O O O O O O O O O O B O O B O O O O O O O O O B B B

help
challenge
value
design
interfaces
experience
evidence
paper
access
information system
user
proactive recommendations
recommendation
systems
users
contextual information
awareness
context
contextual

communication
personality
agents
relevance
timing
recommendation system
informal
relationships
functional
user interface
documentation
feature
resource


On the Laplace-Beltrami operator and brain surface flattening In this paper, using certain conformal mappings from uniformization theory, we give an explicit method far flattening the brain surface in a way which preserves angles. From a triangulated surface representation of the cortex, we indicate how the procedure may be implemented using finite elements. Further, we show how the geometry of the brain surface may be studied using this approach.

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

brain flattening
functional mri
harmonic maps
segmentation


Generalized projection method for a variational inequality system with different mapping in Banach spaces ? The approximate solution of a system for variational inequality with different mapping in Hilbert spaces has been studied, based on the convergence of projection methods. However, little research has been done in Banach space. The primary reason is that projection mapping lacks preferable properties in Banach space. In this paper, we introduce generalized projection methods. By using these methods, the results presented in this paper have extended the main results of Chang et al.s and Huang and Noors recent works [S.S. Chang, H.W. Joseph Lee, C.K. Chan, Generalized system for relaxed cocoercive variational inequalities in Hilbert spaces, Appl. Math. Lett. 20 (2007) 329334; Zhenyu Huang, Muhammad Aslam Noor, An explicit projection method for a system of nonlinear variational inequalities with different (?,r) ( ? , r ) -cocoercive mappings, Appl. Math. Comput. 190 (2007) 356361] from Hilbert spaces to Banach space.

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

generalized variational inequalities system


The priority factor model for customer relationship management system success As the market competition becomes keen, constructing a customer relationship management system is coming to the front for winning over new customers, developing service and products for customer satisfaction and retaining existing customers. However, decisions for CRM implementation have been hampered by inconsistency between information technology and marketing strategies, and the lack of conceptual bases necessary to develop the success measures. Using a structural equation analysis, this study explores the CRM system success model that consists of CRM initiatives: process fit, customer information quality, and system support; intrinsic success: efficiency and customer satisfaction; and extrinsic success: profitability. These constructs underlie much of the existing literature on information system success and customer satisfaction perspectives. We found the empirical support for CRM implementation decision-making from 253 respondents of 14 companies which have implemented the CRM system. These findings should be of great interest to both researchers and practitioners.

O O O O O B I I 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 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 B I O O O B O O O O O O O O O B I 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

customer relationship management
information system success
customer satisfaction
profitability


Limit theorems and absorption problems for quantum random walks in one dimension In this paper we consider limit theorems, symmetry of distribution, and absorption problems for two types of one-dimensional quantum random walks determined by 2 x 2 unitary matrices using our PQRS method. The one type was introduced by Gudder in 1988, and the other type was studied intensively by Ambainis et al. in 2001. The difference between both types of quantum random walks is also clarified.

B I O B I 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 O O O O O O O O O O O O O O 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 evaluation of the middlewares impact on the performance of object oriented distributed systems ? In this paper, we present a performance analysis of the response time of a clientserver e-banking application running over three different enterprise middleware platforms, namely HTTPServlets, RMI and Web services with JAX-RPC. We conducted performance testing with the purpose to reveal the specific characteristics of each middleware technology and the impact that they infer on the distributed applications performance. A server node running the three J2EE platforms was benchmarked over a wide array of intranet usage patterns. A statistical analysis of the collected data led into conclusions regarding the benefits of each middleware technology. The simulation framework can be further extended to become a testing tool able to differentiate on various service demand classes as an input in distributed applications so as to offer first-cut validated results concerning the systems performance.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

clientserver interactions
middleware software
emulation


Improvement of Raman amplifier bandwidth by means of slow light in photonic crystal based waveguide structure In this paper, we investigate the enhancement of Raman amplification bandwidth with self phase modulation (SPM) effect in silicon based photonic crystal waveguides. The Maxwell equations are solved using finite difference time domain method considering two photon absorption, free carrier absorption, Kerr and SPM effects. We also study the effects of shape, width and average power on the Raman amplification bandwidth. Then by changing the photonic crystal geometrical parameters, pump and signal group velocity are reduced to achieve higher Raman bandwidth.

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 B O O O O B I O O O O O O O O O O O O O B I I B I I O O B O 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

raman amplification
photonic crystal
spm
two photon absorption
free carrier absorption


The Degrees of Freedom of Isotropic MIMO Interference Channels Without State Information at the Transmitters This paper fully determines the degree-of-freedom (DoF) region of two-user interference channels with arbitrary number of transmit and receive antennas in the case of isotropic and independent (or block-wise independent) fading, where the channel state information is available to the receivers but not to the transmitters. Thus, the DoF gap between previous upper and lower bounds due to the authors, Vaze and Varanasi, and Huang, Jafar, Shamai, and Vishwanath is closed. The DoF result characterizes the capacity region to the first order of the logarithm of the signal-to-noise ratio (SNR) in the high-SNR regime. The DoF region is achievable by using random Gaussian codebooks independent of the channel states, which implies that it is impossible to increase the DoF using beamforming and interference alignment in the absence of channel state information at the transmitters.

O O O O O O O O O O O O O O O O O O O O O O O O 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 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 B I I O O O

capacity region
channel state information

multiple-input multiple-output (mimo) channel


Predicting nearest agent distances in artificial worlds In a number of multi-agent artificial life studies where agents interact over limited distances, the emergence and/or evolution of a specific behavior may depend critically upon interagent distances. Little theoretical analysis has been done previously concerning how to predict such distances. In this paper, we derive a probabilistic method that, for an agent at an arbitrary location in a two-dimensional cellular world, predicts the expected distance to a nearest other agent. Our method works for many world topologies, and we apply it to determine the expected distance for six commonly used ones. Further, the method is readily adapted to handle special restrictions. Over a wide variety of agent densities we show that the theoretically predicted distances are largely in agreement with the distances measured in computational experiments with randomly placed agents. We then utilize our prediction method to interpret recent observations that an imprecise threshold in the density of agents exists for the evolution of communication. We thus illustrate that, despite its conceptual simplicity, our method can aid the analysis and even the design of complex artificial environments populated by agents that have the potential to interact with one another.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multi-agent system
evolution of comimmication
agent density
topology


A non-cooperative game approach for power-aware MAC in ad hoc wireless networks In this paper, the problem of designing a power-aware medium access control (MAC) algorithm for Ad hoc wireless networks is considered. Based on the insights obtained from analyzing the problem in optimization framework, we formulate it as a random scheduling MAC in the game theory framework. Defining a payoff for each link as a function of its persistence probability and power, the objective of the proposed non-cooperative static power-aware MAC game (PAMG) is to find the appropriate strategy for the link in its 2D strategy space. The game theoretic aspects of PAMG including existence, uniqueness, and convergence to the Nash equilibrium are investigated analytically under some mild conditions. Based on PAMG, a message passing totally asynchronous distributed power-aware MAC (PAM) algorithm is presented. In the proposed algorithm, at each active time slot the link broadcasts a message simultaneous to its transmission. At each inactive time slot it listens to the channel to capture the other active links messages and updates its cost factor. Simulation results are provided to evaluate the convergence and performance of the algorithm and are compared to the optimal solution. (C) 2010 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Optimization problems of replacement first or last in reliability theory ? This paper takes up age and periodic replacement last models with working cycles, where the unit is replaced before failure at a total operating time T or at a random working cycle Y, whichever occurs last, which is called replacement last. Expected cost rates are formulated, and optimal replacement policies which minimize them are discussed analytically. Comparisons between such a replacement last and the conventional replacement first are made in detail. It is determined theoretically and numerically which policy is better than the other according to the ratios of replacement costs and how the mean time of working cycles affects the comparison results. It is also shown that the unit can be operating for a longer time and avoid unnecessary replacements when replacement last is done. For further studies, expected cost rates of modified models and their applications in a standard cumulative damage model with working cycles are obtained and computed numerically. Finally, case studies on replacement last and first in maintaining electronic systems of naval ships under battle and non-battle statuses are given.

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 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 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 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 B I O O O O O O O O O O O O O O O O

periodic replacement
replacement last
working cycle
cumulative damage model


Studying transition dynamics via focusing on underlying feedback interactions Modelling the Dutch waste management transition The emerging need for societal transitions raises the need for a better understanding of the dynamic nature of large scale societal systems, and therefore the development of an analytical approach for drawing dynamic conclusions based on system's dynamic mechanisms, feedback relationships and interacting components. The objective of this study is to explore the degree to which System Dynamics as an approach enhances the process of understanding transition dynamics in socio-technical systems. In other words, it is aimed to reveal the type of insights that can be developed about such systems and their dynamic behaviour using the approach, as well as the shortcomings of the approach in this challenging task. In order to do so, a modeling study aiming to understand the underlying mechanisms of the waste management transition in the Netherlands is conducted. The quantitative model developed is based on the historical case of the waste management transition of the Netherlands, and it portrays issues as the dynamics of actors' preferences, development of infrastructure and environmental consequences of dominant mode of functioning and provides an instance for demonstrating and evaluating the feedback-focused perspective discussed in this paper. Finally, the paper discusses a set of points regarding the utilized approach, System Dynamics, observed during this study both in general and in the specific context of transitions. In short, System Dynamics stands as a promising approach mainly due to its strength in explaining the source of complex dynamics based on interacting feedback loops, but it also has certain drawbacks in the context of transitions.

O O O O O O O O O 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 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 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 O O O O O O O O O O O O O O O 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 B 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 B

transitions
system dynamics
waste management


A cognitive model fleshes out Kahnemans fast and slow systems Daniel Kahneman (2011) posits two main processes that characterize thinking: System 1 is a fast decision making system responsible for intuitive decision making based on emotions, vivid imagery, and associative memory. System 2 is a slow system that observes System 1s outputs, and intervenes when intuition is insufficient. Such an intervention occurs when an event is detected that violates the model of the world that System 1 maintains (Kahneman, 2011, p. 24). Here, we propose specific underlying mechanisms for Kahnemans Systems 1 and 2, in terms of the LIDA model, a broad, systems-level, cognitive architecture (Franklin et al., 2014). LIDA postulates that human cognition consists of a continuing, overlapping iteration of cognitive cycles, each a cognitive atom, out of which higher-order processes are built. In LIDA terms, System 1 employs consciously mediated action selection in which a stimulus is acted upon within one or two cognitive cycles. In contrast, System 2, which LIDA posits to operate according to James ideomotor theory (James, 1950), requires more cognitive cycles in its deliberative decision making. Thus, we suggest that System 2 employs multiple occurrences of System 1 in its operation. To test the proposed mechanisms, we perform an in silico experiment using a LIDA-based software agent.

O O O O O B I 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 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 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 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

kahnemans fast and slow systems
cognitive architecture
consciously mediated action selection
deliberative decision making

learning intelligent distribution agent (lida)


leveraging conductive inkjet technology to build a scalable and versatile surface for ubiquitous sensing In this paper we describe the design and implementation of a new versatile, scalable and cost-effective sensate surface. The system is based on a new conductive inkjet technology, which allows capacitive sensor electrodes and different types of RF antennas to be cheaply printed onto a roll of flexible substrate that may be many meters long. By deploying this surface on (or under) a floor it is possible to detect the presence and whereabouts of users through both passive and active capacitive coupling schemes. We have also incorporated GSM and NFC electromagnetic radiation sensing and piezoelectric pressure and vibration detection. We report on a number of experiments which evaluate sensing performance based on a 2.5m x 0.3m hardware test-bed. We describe some potential applications for this technology and highlight a number of improvements we have in mind.

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

distributed sensor network
location tracking
sensate skin surface
flexible electronics


A new C C -space method to automate the layout design of injection mould cooling system A configuration space (C C -space) method was developed in a previous study to support the automation of the layout design of cooling systems. The main function of the C C -space is to capture all of the feasible geometry of the layout design so that a genetic algorithm (GA) can be used to explore the design space. This paper reports a further extension of the C C -space method in two respects. The new method overcomes the previous limitation of the non-variability of the design topology. By capturing useful information generated during the computation of the C C -space, the new method enables the GA to explore both the geometry and the topology of the design during the evolutionary process. A new technique is also developed that enables the method to handle user-defined constraints on the layout design. These constraints are captured by additional C C -spaces, and a special procedure is developed for computing the C C -spaces of cooling systems and generating candidate designs so that the resulting design always satisfies the constraints. Vigorous proof of the validity of the new method is provided, and a case study is presented to demonstrate the capability of the method in generating a practical layout design for a cooling system.

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

cooling system design
plastic injection mould
configuration space method


A neuron model of stochastic resonance using rectangular pulse trains Stochastic resonance (SR) is the enhanced representation of a weak input signal by the addition of an optimal level of broadband noise to a nonlinear (threshold) system. Since its discovery in the 1980s the domain of input signals shown to be applicable to SR has greatly expanded, from strictly periodic inputs to now nearly any aperiodic forcing function. The perturbations (noise) used to generate SR have also expanded, from white noise to now colored noise or vibrational forcing. This study demonstrates that a new class of perturbations can achieve SR, namely, series of stochastically generated biphasic pulse trains. Using these pulse trains as noise we show that a Hodgkin Huxley model neuron exhibits SR behavior when detecting weak input signals. This result is of particular interest to neuroscience because nearly all artificial neural stimulation is implemented with square current or voltage pulses rather than broadband noise, and this new method may facilitate the translation of the performance gains achievable through SR to neural prosthetics.

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 B I

sensory enhancement
information transmission
spectral analysis
stochastic pulse train


Recommendation of programming activities by multi-label classification for a formative assessment of students The task of recommending activities for students can be treated as a multi-label classification problem. Our system recommends activities according to students learning difficulties. We provided a new data set of profiles and recommendations done by an instructor. The metrics of multi-label classification can help in formative assessment.

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

multi-label classification
multidimensional profiles
recommendation of activities


Architectural Analysis for Wirelessly Powered Computing Platforms We present a design framework for wirelessly powered generic computing platforms that takes into account various system parameters in response to a time-varying energy source. These parameters are the charging profile of the energy source, computing speed (f(clk)), digital supply voltage (V-DD), energy storage capacitance (C-s), and power conversion efficiency (eta). We address both continuous and discrete operational modes of computation based on the energy source's charging profile. Unlike other reported works where investigations are limited to wireless energy transfer and functional demonstrations, our aim is to develop a theoretical model that comprises the complete system architecture by combining energy transfer and consumption in a step-by-step manner. We show that field resilience operation in a wireless energy field can be incorporated by modulating the power consumption in the digital platform in response to changing energy fields using this analysis. This paper also allows guidelines for choosing the appropriate computing policies based on the charging profile of energy source. This leads to an optimal, adaptive use of available energy in order to optimize the overall performance.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

field resilience adaptive computation (throughput)


Fuzzy logic in computer-aided breast cancer diagnosis: analysis of lobulation1 This paper illustrates how a fuzzy logic approach can be used to formalize terms in the American College of Radiology (ACR) Breast Imaging Lexicon. In current practice, radiologists make a relatively subjective determination for many terms from the lexicon related to breast cancer diagnosis. Lobulation and microlobulation of nodules are two important features in the ACR lexicon. We offer an approach for formalizing the distinction of these features and also formalize the description of intermediate cases between lobulated and microlobulated masses. In this paper it is shown that fuzzy logic can be an effective tool in dealing with this kind of problem. The proposed formalization creates a basis for the next three steps: (i) extended verification with blinded comparison studies, (ii) the automatic extraction of the related primitives from the image, and (iii) the detection of lobulated and microlobulated masses based on these primitives.

B I O O B I 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 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 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

feature formalization
image recognition
neural networks


Small retinal vessels extraction towards proliferative diabetic retinopathy screening This paper introduces a systematic approach for segmentation of retinal blood vessels towards the diagnosis of proliferative diabetic retinopathy (PDR) from digital fundus images. Here, 2D-Match (Gabor) filters are used on digital fundus images in which the vessels are enhanced by contrast-limited adaptive histogram equalization (CLAHE). A double sided thresholding scheme is then used to segment the vessels. Hysteresis thresholding is performed with the large and small vessels clipped at different intensity levels in order to reconstruct the vessels in the image. This vessel extraction technique leads to high accuracy (93.1%) in comparison with the ground truth images provided in the DRIVE database. (C) 2011 Elsevier Ltd. All rights reserved.

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 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 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

proliferative diabetic retinopathy
hysteresis thresholding
clahe


an efficient method of image identification by combining image features This paper proposes an efficient image identification method by combining image features and using image clustering. For more efficient image identification, we use global and local features in a hierarchical manner. The combined global feature reflecting general information of image helps faster retrieval of candidate images and the feature point based local feature facilitates more accurate fine matching with the candidate images. We consider the Fuzzy C-Means clustering method since it is effective for the image data which are characteristically alike and have fuzzy boundary in coordinate by their global features. The global feature vector which we use is very effective in clustering and retrieval since it represents general properties of image and its dimension is very low. As a result, the number of fine matching which requires very large computing time and high complexity is considerably decreased since searching original image of query is done by fine matching within partial database of candidate images.

O O O O B I O O O O O O O O O B I 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 B I O O O O O O O O O O O O O B I O B I 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 B I 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

local feature
global feature
feature point
image identification
clustering

descriptor
interest point
image retrieval
identifier


Stochastically bounded burstiness for communication networks A network calculus is developed for processes whose burstiness is stochastically hounded by general decreasing functions, This calculus is useful for a large class of input processes, including important processes exhibiting "subexponentially bounded burstiness" such as fractional Brownian motion. Moreover, it allows judicious capture of the salient features of real-time traffic, such as the "cell" and "burst" characteristics of multiplexed traffic. This accurate characterization is achieved by setting the bounding function as a sum of exponentials.

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

multiple time-scale traffic
statistical bounds


Mining class outliers: concepts, algorithms and applications in CRM Outliers, or commonly referred to as exceptional cases, exist in many real-world databases. Detection of such outliers is important for many applications and has attracted much attention from the data mining research community recently. However, most existing methods are designed for mining outliers from a single dataset without considering the class labels of data objects. In this paper, we consider the class outlier detection problem given a set of observations with class labels, find those that arouse suspicions, taking into account the class labels. By generalizing two pioneer contributions [Proc WAIM02 (2002); Proc SSTD03] in this field, we develop the notion of class outlier and propose practical solutions by extending existing outlier detection algorithms to this case. Furthermore, its potential applications in CRM (customer relationship management) are also discussed. Finally, the experiments in real datasets show that our method can find interesting outliers and is of practical use.

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 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 O O O O O O O O O O O O O O O O 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 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


Efficiency and effectiveness of query processing in cluster-based retrieval Our research shows that for large databases, without considerable additional storage overhead, cluster-based retrieval (CBR) can compete with the time efficiency and effectiveness of the inverted index-based full search (FS). The proposed CBR method employs a storage structure that blends the cluster membership information into the inverted file posting lists. This approach significantly reduces the cost of similarity calculations for document ranking during query processing and improves efficiency. For example, in terms of in-memory computations, our new approach can reduce query processing time to 39% of FS. The experiments confirm that the approach is scalable and system performance improves with increasing database size. In the experiments, we use the cover coefficient-based clustering methodology ((CM)-M-3), and the Financial Times database of TREC containing 210 158 documents of size 564 MB defined by 229 748 terms with total of 29 545 234 inverted index elements. This study provides CBR efficiency and effectiveness experiments using the largest corpus in an environment that employs no user interaction or user behavior assumption for clustering. (C) 2003 Elsevier Ltd. All rights reserved.

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 B 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 B 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 B O O O O O O O

cluster-based retrieval
information retrieval


Fully non-homogeneous hidden Markov model double net: A generative model for haplotype reconstruction and block discovery In the last decade, haplotype reconstruction in unrelated individuals and haplotype block discovery have riveted the attention of computer scientists due to the involved strong computational aspects. Such tasks are usually addressed separately, but recently, statistical techniques have permitted them to be solved jointly. Following this trend we propose a generative model that permits researchers to solve the two problems jointly. The model inference is based on variational learning, which permits one to estimate quickly the model parameters while remaining robust even to local minima. The model parameters are then used to segment genotypes into blocks by thresholding a quantitative measure of boundary presence. Experiments on real data are presented, and state-of-the-art systems for haplotype reconstruction and strategies for block estimation are considered as comparison. The proposed method can be used for a fast and reliable estimation of haplotype frequencies and the relative block structure. Moreover, the method can be easily used as part of a more complex system. The threshold used for block discovery can be related to the quality-of-fit reached in the model learning, resulting in an unsupervised strategy for block estimation.

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 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 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 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

haplotype reconstruction
variational learning
block structure


Transmission method of synchronized streaming data in digital data broadcasting environment In this paper, we propose a transmission method of the synchronized streaming data in digital broadcasting environment. The ancillary data that is used in the data broadcasting can be classified into three types: asynchronous, synchronous, and synchronized data. While the transmission of the asynchronous data is very simple, that of the synchronous or synchronized data is more complex because the synchronous and the synchronized data have time information for the presentation. Inaccurate transmission time without regarding the presentation time for the synchronous or synchronized data can cause a buffer overflow or delayed reception of a data in the receiver. Therefore, we propose a method to calculate the accurate transmission time of the synchronized data by using the MPEG-2 Program Clock Reference (PCR) and the Presentation Time Stamp (PTS) of the synchronized data. To verify the proposed method, we make an MPEG2 Transport Stream (TS) by multiplexing the synchronized data with an A/V program based on the proposed method, and then analyze the multiplexed MPEG-2 TS. Also, the screen shots of the displayed synchronized data are presented in the receiver.

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 B I O O O O O O O O O B I 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 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 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 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 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 B I O O O O O

digital broadcasting
data broadcasting
synchronized data


on-line multi-modal speaker diarization This paper presents a novel framework that utilizes multi-modal information to achieve speaker diarization. We use dynamic Bayesian networks to achieve on-line results. We progress from a simple observation model to a complex multi-modal one as more data becomes available. We present an efficient way to guide the learning procedure of the complex model using the early results achieved with the simple model. We present the results achieved in various real-world situations, including videos coming from webcameras, human computer interaction and video conferences.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

speaker detection
multi-modal
audio-visual


Efficient solutions to factored MDPs with imprecise transition probabilities When modeling real-world decision-theoretic planning problems in the Markov Decision Process (MDP) framework, it is often impossible to obtain a completely accurate estimate of transition probabilities. For example, natural uncertainty arises in the transition specification due to elicitation of MOP transition models from an expert or estimation from data, or non-stationary transition distributions arising from insufficient state knowledge. In the interest of obtaining the most robust policy under transition uncertainty, the Markov Decision Process with Imprecise Transition Probabilities (MDP-IPs) has been introduced to model such scenarios. Unfortunately, while various solution algorithms exist for MDP-IPs, they often require external calls to optimization routines and thus can be extremely time-consuming in practice. To address this deficiency, we introduce the factored MDP-IP and propose efficient dynamic programming methods to exploit its structure. Noting that the key computational bottleneck in the solution of factored MDP-IPs is the need to repeatedly solve nonlinear constrained optimization problems, we show how to target approximation techniques to drastically reduce the computational overhead of the nonlinear solver while producing bounded, approximately optimal solutions. Our results show up to two orders of magnitude speedup in comparison to traditional "flat" dynamic programming approaches and up to an order of magnitude speedup over the extension of factored MDP approximate value iteration techniques to MDP-IPs while producing the lowest error of any approximation algorithm evaluated. (C) 2011 Elsevier B.V. All rights reserved.

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 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


Efficient memory-reference checks for Real-Time Java The scoped-memory feature is central to the Real-Time Specification for Java. It allows greater control over memory management, in particular the deallocation of objects without the use of a garbage collector. To preserve the safety of storage references associated with Java(TM) since its inception, the use of scoped memory is constrained by a set of rules in the specification. While a program's adherence to the rules can be partially checked at compile-time, undecidability issues imply that some-perhaps, many-checks may be required at run-time. Poor implementations of those run-time checks could adversely affect overall performance and predictability, the latter being a founding principle of the specification. In this paper we present efficient algorithms for managing scoped memories and the checks they impose on programs. Implementations and results published to date require time linear in the depth of scope nesting; our algorithms operate in constant time. We describe our approach and present experiments quantifying the gains in efficiency.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B 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 B O O O O O O O O O O O O O O O O

design
real-time java
object oriented languages
garbage collection memory management


Perceptual attributes of crosstalk in 3D images Nowadays, crosstalk is probably one of the most annoying distortions in 3D displays. So far, display designers still have a relative lack of knowledge about the relevant subjective attributes of crosstalk and how they are combined in an overall 3D viewing experience model. The aim of the current experiment is to investigate three perceptually important attributes influencing the overall viewing experience: perceived image distortion, perceived depth, and visual strain. The stimulus material used in this experiment consisted of two natural scenes varying in depth (0, 4, and 12cm camera base distance) and crosstalk level (0, 5, 10, and 15%). Subjects rated the attributes according to the ITU BT.50010 in a controlled experiment. Results show that image distortion ratings show a clear increase with increasing crosstalk and increasing camera base distance. Especially higher crosstalk levels are more visible at larger camera base distances. Ratings of visual strain and perceived depth only increase with increasing camera base distance and remain constant with increasing crosstalk (at least until 15% crosstalk).

O O O B O B 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 B 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 B I O B O B I O O O O O O O O O O O O O O B O O O O B I I O B 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 B O O B I I O O B O O O O O O O O O O O B I O O B O O O O B I I O O O O O B O O O O B

3d
crosstalk
camera base distance
image distortion
depth
visual strain


Evaluation of supply chain structures through modularization and postponement This paper introduces a conceptual framework for evaluating different supply chain structures in the context of modularization and postponement. In our analysis, modularization is linked to inbound logistics as the combination of different components (or modules) allow for the assembly of the final product. Postponement, however, corresponds with the outbound logistics since it is through the distribution function that customers' specific demand is satisfied. Given this perspective, we introduce a taxonomy and develop a corresponding framework for the characterization of four supply chain structures, defined according to the combined levels of modularization and postponement: Rigid, Postponed, Modularized and Flexible. We also illustrate the applicability of the resulting framework through quantifying the total cost differential for utilizing a particular supply chain structure. By quantifying the total cost for employing a particular supply chain structure we can numerically illustrate structural results that allow for an objective comparison among them. As such, our findings substantiate the empirical evidence that vertical integration along the supply chain is not always desirable. A point of emphasis in this paper is the notion that firms may be better off making combined modularization (outsourcing) and postponement decisions as opposed to separate ones (as they currently do). This also suggests that modularization and postponement decisions need not be independent and that their joint consideration extends operational advantages worthy of contemplation.

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 B 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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O B 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


A new pruning method for decision tree based on structural risk of leaf node Pruning is an effective technique in improving the generalization performance of decision tree. However, most of the existing methods are time-consuming or unsuitable for small dataset. In this paper, a new pruning algorithm based on structural risk of leaf node is proposed. The structural risk is measured by the product of the accuracy and the volume (PAV) in leaf node. The comparison experiments with Cost-Complexity Pruning using cross-validation (CCP-CV) algorithm on some benchmark datasets show that PAV pruning largely reduces the time cost of CCP-CV, while the test accuracy of PAV pruning is close to that of CCP-CV.

O O B O O B I O O B I O O O B 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 B 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 O O O B 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


Visualization of differences between rules' syntactic and semantic similarities using multidimensional scaling One of the most important problems with rule induction methods is that it is very difficult for domain experts to check millions of rules generated from large datasets, although the discovery from these rules requires deep interpretation from domain knowledge. Although several solutions have been proposed in the studies on data mining and knowledge discovery, these studies are not focused on similarities between rules obtained. When one rule r(1), has reasonable features and the other rule r(2) with high similarity to r(1) includes unexpected factors, the relations between these rules will become a trio-er to the discovery of knowledge. In this paper, we propose a visualization approach to show the similarity relations between rules based on multidimensional scaling, which assign a two-dimensional cartesian coordinate to each data point from the information about similarities between this data and others data. We evaluated this method on two medical data sets, whose experimental results show that knowledge useful for domain experts can be found.

B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

rule induction
multidimensional scaling
visualization


Aseismic ability estimation of school building using predictive data mining models The aseismic ability of buildings is generally analyzed using a nonlinear model. Numerical models are constructed based on the structural configuration and material property of buildings by simulating their stress responses and behaviors to obtain their aseismic ability. This method is complex and time-consuming and should be conducted by professionals. Hence, the aseismic ability of buildings cannot be determined rapidly on a large scale. Additionally, rapidly sequencing and screening the aseismic ability of a large number school buildings to make maintenance and management decisions is extremely difficult. This work adopts predictive data-mining models to determine the relationship between basic design parameters of school buildings and their aseismic ability, and then proposes a best model for predicting the aseismic ability of school buildings. Only basic geometric information of school buildings is needed to estimate quickly their aseismic ability. This prediction model must be able to handle the heavy load of evaluating the aseismic ability of school buildings. The proposed model will help maintenance managers conduct detailed assessments and sequencing of reinforcement work through nonlinear analysis. The proposed model can serve as a reference for disaster prevention in disaster plans and staff rescue during rescue work. (C) 2011 Elsevier Ltd. All rights reserved.

B I O O B I O O B I 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 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 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 B I 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 B 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

aseismic ability
data mining
prediction
school building


The case for mesodata: An empirical investigation of an evolving database system Database evolution can be considered a combination of schema evolution, in which the structure evolves with the addition and deletion of attributes and relations, together with domain evolution in which an attributes specification, semantics and/or range of allowable values changes. We present the results of an empirical investigation of the evolution of a commercial database system that measures and delineates between changes to the database that are (a) structural and (b) attribute domain related. We also estimate the impact that modelling using the mesodata approach would have on the evolving system.

O O O B 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 O O O O O O 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

database evolution
domain evolution
mesodata


Comments on Lascu and Clow (2008) Lascu and Clow provide a helpful literature review into web site satisfaction, detail a repeatable process for other researchers and propose their own scale of website interactivity with four subscales with low-to-strong internal reliability. The major disadvantage of the new scale is one-third of the 15-item questionnaire measures aspects of customer service center quality. Although such measures of 'Customer Centeredness' are important, it tends to be less universally helpful to many large e-commerce websites which have little telephonic interaction with their customers.

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


Realization using the Roesser model for implementations in distributed grid sensor networks Using the Roesser model, a method for distributed information processing in grid sensor networks is presented by Sumanasena and Bauer (A Roesser model based multidimensional systems approach for grid sensor networks. Pacific Grove, California, 2009). The method can be used to implement linear systems in grid sensor networks. Unless information originating in a node can be conveyed over the entire sensor network in a single time slot, for a system described by the Roesser model to be implementable in real-time on a sensor network, the system matrices of the Roesser model have to assume a particular form. A necessary and sufficient condition for a proper transfer matrix to be realizable in the constrained Roesser model is established in this paper. A realization algorithm to derive the Roesser model of the desired form, given an admissible transfer matrix is derived. The analogues problem for the realization of non-proper transfer matrices is also addressed.

B O O B I O O O O B I I O O B I O O O O O O O B I I O O O O O O O B I 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 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 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 B O O O O B I O O O O O O O O O O O O O O O O B O O O O O O O

grid sensor networks
roesser model
realization


Hyperbolic logistic difference equation with infinitely many delays A difference equation with infinitely many delays was considered, which gives a 'best' approximation of logistic integrodifferential equation. Some biological and evolutionary consequences are briefly discussed. (C) 2000 IMACS/Elsevier Science B.V. All rights reserved.

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

dynamical consistency
time delay
stability


Band offsets at the (100)GaSb/Al2O3 interface from internal electron photoemission study From electron internal photoemission and photoconductivity measurements at the (100)GaSb/Al2O3 interface, the top of the GaSb valence band is found to be 3.050.10eV below the bottom of the Al2O3 conduction band. This interface band alignment corresponds to conduction and valence band offsets of 2.30.10eV and 3.050.15eV, respectively, indicating that the valence band in GaSb lies energetically well above the valence band of InxGa1?xAs (0?x?0.53) or InP.

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


Parallel Frequent Item Set Mining with Selective Item Replication We introduce a transaction database distribution scheme that divides the frequent item set mining task in a top-down fashion. Our method operates on a graph where vertices correspond to frequent items and edges correspond to frequent item sets of size two. We show that partitioning this graph by a vertex separator is sufficient to decide a distribution of the items such that the subdatabases determined by the item distribution can be mined independently. This distribution entails an amount of data replication, which may be reduced by setting appropriate weights to vertices. The data distribution scheme is used in the design of two new parallel frequent item set mining algorithms. Both algorithms replicate the items that correspond to the separator. NoClique replicates the work induced by the separator and NoClique2 computes the same work collectively. Computational load balancing and minimization of redundant or collective work may be achieved by assigning appropriate load estimates to vertices. The experiments show favorable speedups on a system with small-to-medium number of processors for synthetic and real-world databases.

O B I I I O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

parallel data mining
mining methods and algorithms
selective data replication
graph partitioning by vertex separator


On lower bounds for the communication complexity of private information retrieval Private information retrieval for k greater than or equal to 1 databases (denoted by (k,l)-PIR for short) is a protocol that (1) a user sends an l tuple query to each of k noncommunicating replicated databases; (2) each database responds the user with an answer corresponding to the l tuple query; (3) the user privately retrieve any single bit out of the n bits of data stored in ii databases. In this model, "privacy" implies that the user retrieves the bit he is interested in but releases to each database nothing about which bit he wishes to get. In general, the efficiency of (k, l)-PIR is measured by the total amount of bits exchanged between the user and the k databases, but few about its lower bounds are known except for restricted cases. In this paper, we classify (k, l)-PIR into a linear type, a multilinear type, and an affine type with respect to the relationship between queries to each database (made by the user) and answers to the user (made by each database), and show that (1) the lower bound for the communication complexity of any multilinear type (k, l)-PIR is Omega( (l+1)rootn) (Theorem 3.1); (2) the lower bound for the communication complexity of any linear type (k, l)-PIR is Ohm(rootn) (Corollary 3.2); (3) the lower bound for the communication complexity of any affine type (k, l)-PIR is Omega( (l+1)rootn) (Theorem 4.2).

O O O O O B I O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 B I O O B I O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O B I O O B I O O O O O O O

private information retrieval
communication complexity
linear type
multilinear type
affine type


visual contextrank for web image re-ranking Previous web image re-ranking approaches usually construct similarity measure on image level. Considering the diversity of large scale web image database, these approaches ignore the difference of importance between target area and background area in images, thus are not robust to background clutter and may bring some false similarity contribution among images, especially for object query images. We propose ContextRank, re-ranking images by building Markov random process of a surfer jumping across visual words within and among images. For intra-image context, links of visual words are constructed if they are close enough within an image. For inter-image context, links of visual words between image pairs are constructed by incorporating both feature similarity and spatial consistency. Equally speaking, we build a random walk model on visual word level where spatial information is taken into account. The stationary distribution of visual words in each image is derived by calculating the principle eigenvector of link matrix. The score of images are the sum of scores of visual words in each image. Evaluation on object images collected from the Google search engine shows that our approach outperforms VisualRank, and is comparable with the state-of-art. Compared to VisualRank, our method reaches better performance without significant extra computation cost, which is suitable for potential requirement of large scale web image retrieval.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

visual matching.
image re-ranking
spatial co-occurrence


Three-dimensional lattice Boltzmann model results for complex fluids ordering The kinetics of domain growth of fluid mixtures quenched from a disordered to a lamellar phase has been studied in three dimensions. We use a numerical approach based on the lattice Boltzmann method (LBM). A novel implementation for LBM which "fuses" the collision and streaming steps is used in order to reduce memory and bandwidth requirements. We find that extended defects between stacks of lamellae with different orientation dominate the late time dynamics.

O O O O O O B 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 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

lattice boltzmann method
lamellar phase
complex fluids


The consistent value of fuzzy games In the framework of fuzzy parries, we offer an extension of the reduced game introduced by Hart and Mas-Colell, which we name the self-reduced game. According to consistency which related to the self-reduced game, we provide a definition of the consistent value which is a generalization of the Shapley value of fuzzy games. We adopt three existing concepts front coalitional game theory and reinterpret them in the framework of fuzzy games. The first one is that there exists a unique potential function and the resulting payoff vector coincides with the consistent value. Second, based on the properties of balanced contributions and consistency, we offer several axiomatizations of the consistent value. Finally, we propose a dynamic process to illustrate that the consistent value can be reached by players who start from an arbitrary efficient payoff vector and make successive adjustments. Crown Copyright (C) 2008 Published by 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 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 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 B I 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

shapley value
potential
balanced contributions
consistency


Real time distributed processing of multiple associated pulse pattern sequences A Real Time Distributed Associative Memory Artificial Neural Network (RTANN) is described. This network associates groups of pulse pattern sequences. The subsequent reoccurrence of some sequences will cause the remainder to be regenerated. Training is carried out in real time simply by feeding pattern sequences directly into the network. The connections between units incorporate a wide range of transmission delays. During training the network enhances connection weights on units where coincidences occur between input and delayed pulses. Pattern regeneration utilises the reoccurrence of coincidences between delayed pulses. The simulation of an RTANN is presented. Continuous dual pattern sequences from notional sensors monitoring the shape and colour of an object were associated directly with a third dual pattern sequence having the form These objects look colour. After training the network was able to correctly generate sentences describing combinations of object and colour not encountered during training.

B I B I O O O O 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 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 O O O O O O O O O O O O O O O

associative memory
distributed processing
pattern sequence
real time


Disclosure Intention of Location-Related Information in Location-Based Social Network Services Although location-based social network (LBSN) services have developed rapidly in recent years, the reasons why people disclose location-related information under this environment have not been adequately investigated. This study builds a privacy calculus model to investigate the factors that influence LBSN users' intention to disclose location-related information in China. In addition, this study applies justice theory to investigate the role of privacy intervention approaches used by LBSN Web sites in enhancing users' perception of justice, including incentives provision, interaction promotion, privacy control, and privacy policy. Model testing using structural equation modeling reveals that perceived cost (users' privacy concerns) and perceived benefits (personalization and connectedness) influence intention to disclose location-related information. Meanwhile, providing incentives and promoting interaction enhance, respectively, personalization and connectedness. Privacy control and privacy policies both help in reducing privacy concerns. We also find that individuals' awareness of Internet privacy legislation negatively influences privacy concerns, whereas previous privacy invasions do not. Finally, we find that personal innovativeness significantly influences intention to disclose location-related information. This study not only extends the privacy research on social networking sites under mobile environments but also provides practical implications for service providers and policy makers to develop better LBSNs.

O O O O O O O O O O O O O O O O O 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 B O O O O O O O O O O O O O O O O O O B 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 B O O B O O O O O B O O O O O O O O O B 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 B O O O O O O O O O O O O O O O O O O O O O O O

location-based e-commerce
location-based social network
location-related information disclosure
privacy calculus


I-Swifter: Improving chunked network coding for peer-to-peer content distribution Network coding has been proposed as a promising approach for peer-to-peer content distribution in recent literature. Not only reducing the average download time, but also improving resilience to peer churn has been showed as the benefits brought by network coding. State-of-the-art network coding content distribution systems perform network coding within segments or chunks, in order to reduce computational overhead. In our previous work (Xu et al. 2008), we proposed to schedule segment requests at a local-rarest-first basic. Local-rarest-first segment scheduling, as we demonstrated, is superior to the random scheduling. In this paper, we make a further step towards improving chunked network coding content distribution systems. We propose a requests reducer that reduces the overhead in control traffic and an encoding vectors reducer that eliminates the transmission of encoding vectors. Our contributions are to save unnecessary requests from downstream peers, and to reduce encoding vectors payload when the upstream peer owns the complete requested segment. This paper presents a realistic implementation, named I-Swifter. And we also make a comparative study on various related implementations. Experimental results show that there is about 1020% of encoding vectors can be saved in I-Swifter. Moreover, I-Swifter improves average and maximum download time, the server load as well.

O O O B I O O B I B I 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 B I B I 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 B I B I O O O O B I 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

network coding
content distribution
requests reducer
encoding vectors reducer


Replicated batch means variance estimators in the presence of an initial transient Independent replications (IR) and batch means (BM) are two of the most widely used variance-estimation methods for simulation output analysis. Alexopoulos and Goldsman conducted a thorough examination of IR and BM; and Andradottir and Argon proposed the method of replicated batch means (RBM), which combines good characteristics of IR and BM. This article gives analytical results for the mean and variance of the RBM estimator for a class of processes having initial transients with an additive form. Along the way, we provide succinct complementary extensions of some of the results in the aforementioned papers. Our expressions explicitly show how the transient function affects estimator performance and suggest that in some cases, the RBM estimator is a good compromise choice with respect to bias and variance. However, care must be taken to avoid an excessive number of replications when the transient function is pervasive. An example involving a simple moving average process illustrates our findings.

O B I O O O O O O O O O B I 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 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

steady-state analysis
stochastic simulation
transient analysis
variance estimation


Bidirectional model transformations in QVT: semantic issues and open questions We consider the OMG's queries, views and transformations standard as applied to the specification of bidirectional transformations between models. We discuss what is meant by bidirectional transformations, and the model-driven development scenarios in which they are needed. We analyse the fundamental requirements on tools which support such transformations, and discuss some semantic issues which arise. In particular, we show that any transformation language sufficient to the needs of model-driven development would have to be able to express non-bijective transformations. We argue that a considerable amount of basic research is needed before suitable tools will be fully realisable, and suggest directions for this future research.

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

bidirectional model transformation
model-driven development
semantics


A systematic approach to model validation based on Bayesian updates and prediction related rejection criteria This work describes a solution to the validation challenge problem posed at the SANDIA Validation Challenge Workshop, May 2123, 2006, NM. It presents and applies a general methodology to it. The solution entails several standard steps, namely selecting and fitting several models to the available prior information and then sequentially rejecting those which do not perform satisfactorily in the validation and accreditation experiments. The rejection procedures are based on Bayesian updates, where the prior density is related to the current candidate model and the posterior density is obtained by conditioning on the validation and accreditation experiments. The result of the analysis is the computation of the failure probability as well as a quantification of the confidence in the computation, depending on the amount of available experimental data.

O O O O B I 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 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 B I O O O O O O O O O O O O O O O O O O O

model validation
bayesian updates
failure probability


a progress report on large capacity magnetic film memory development In 1964 we proposed an approach to magnetic film memory development aimed at providing large, high-speed, low-cost random-access memories. Almost without exception, all early attempts at film memory design emphasized speed with little consideration for the potential of batch-fabrication to reduce costs. Based on our earlier work in building the first film memory in 1959, and a 1,000 word, 400 nsec model for the TX-2 computer in 1962, we had reached some fundamental conclusions about the compatibility of high speed and low cost for destructive-readout film memories.

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 B 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 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 B O O O O O B O O B O

exception model compatibility cost film design

capacities
memorialized
developer
random access
computation


Multidisciplinary heat generating logic block placement optimization using genetic algorithm A multidisciplinary optimization methodology for placement of heat generating semiconductor logic blocks on integrated circuit chips is presented. The methodology includes thermal and wiring length criteria, which are optimized simultaneously using a genetic algorithm. An effective thermal performance prediction methodology based on a superposition method is used to determine the temperature distribution on a silicon chip due to multiple heat generating logic blocks. Using the superposition method, the predicted temperature distribution in the silicon chip is obtained in much shorter time than with a detailed finite element model and with comparable accuracy. The main advantage of the present multidisciplinary design and optimization methodology is its ability to handle multiple design objectives simultaneously for optimized placement of heat generating logic blocks. Capabilities of the present methodology are demonstrated by applying it to several standard benchmarks. The multidisciplinary logic block placement optimization results indicate that the maximum temperature on a silicon chip can be reduced by up to 7.5C, compared to the case in which only the wiring length is minimized.

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

ic logic block placement
multidisciplinary design optimization
ic thermal design
ic wiring length


The Steiner Tree Problem with Delays: A compact formulation and reduction procedures This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size formulation for this challenging NP-hard problem. The LP relaxation of this formulation is enhanced through the derivation of new lifted MillerTuckerZemlin subtour elimination constraints. Furthermore, we present several preprocessing techniques for both reducing the problem size and tightening the LP relaxation. Finally, we report the results of extensive computational experiments on instances with up to 1000 nodes. These results attest to the efficacy of the combination of the enhanced formulation and reduction techniques.

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 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 B I

steiner tree problem
reduction techniques


Dynamics of the quorum sensing switch: stochastic and non-stationary effects A wide range of bacteria species are known to communicate through the so called quorum sensing (QS) mechanism by means of which they produce a small molecule that can freely diffuse in the environment and in the cells. Upon reaching a threshold concentration, the signalling molecule activates the QS-controlled genes that promote phenotypic changes. This mechanism, for its simplicity, has become the model system for studying the emergence of a global response in prokaryotic cells. Yet, how cells precisely measure the signal concentration and act coordinately, despite the presence of fluctuations that unavoidably affects cell regulation and signalling, remains unclear.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

noise
stochastic modeling
vibrio fischeri
autoinducer
synchronization


On multi-granulation covering rough sets We presented four new types of multi-granulation covering rough set models. We disclosed the relationships and differences among the classical MGRS and MGCRS. We investigated the conditions for two MGCRS produce identical approximations. We found that the approximations can construct a lattice.

O 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 O O O O O O O O O O O O O O

lower and upper approximations
multi-granulation
reduct


A radio frequency identification based optimal material delivery method for digital plant production Currently, Just-in-Time (JIT) is becoming one of the increasingly important manufacturing modes applied by enterprises for surviving in drastic market competition. As a key function of JIT manufacturing, the material delivery characterised by real time, accuracy and optimisation can make sure of JIT's implementation in enterprises effectively and efficiently. In the study, we present a new kind of real-time optimal material delivery method for plant production by utilising radio frequency identification (RFID) technology. In the method, the precise and visual layouts for the whole physical plant and all kinds of its inner manufacturing resources such as machines, RFID devices, forklifts and inventories are realised. Later, the mathematical model for dynamically obtaining the optimal routes for forklifts is established by taking the minimal travel distance as the objective. Particularly, to solve the problem, a real-time optimum route planning method based on the ant colony optimisation (ACO) algorithm is developed. In order to monitor and navigate the forklifts in real time during material distribution in the plant for material delivery planners and operators, a position locating scheme for forklifts and materials is proposed. Finally, a case study is carried out to demonstrate the feasibility of the presented method, which establishes the base for implementing JIT manufacturing in plant production.

O O O O O O B I 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 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 B I O O B I 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 O O 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 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

material delivery
rfid
plant production
route planning


Numerical problems encountered in the simulation of reactive absorption : DAE index reduction and consistent initialisation A general simulation model able to represent mass transfer in the presence of chemical reactions is presented. The model developed describes the behaviour of an absorption column. This model needs to be able to access certain information such as kinetic constants, equilibrium constants, activity coefficients,:etc. Among these auxilary models, is the need to be able to calculate the mass flux and compositions at the boundary of the diffusional Nm. A set of equations describing the film has therefore been developed, and its resolution has proved to be troublesome. Indeed we have run into two problems that have had to be tackled. The problems encountered are directly due to the nature of the equations to be solved, that is a system of differential algebraic equations (DAE). These problems arise from the approach desired to treat the equations, based on Gear's algorithm. The first problem deals with the solution of high order index systems, and the second involves the necessity of having consistent initial conditions. A suitable procedure has been implemented for index reduction, and several. techniques have been tested for the obtention of consistent initial conditions. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.

O O O O O O O B I O B I 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 O O O O O O O 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

reactive absorption
differential algebraic equations
dae index reduction
consistent initialisation

industrial application
sour gas treatment
absorption column simulation


Multiple-parameter coupling metrics for layered component-based software Coupling represents the degree of interdependence between two software components. Understanding software dependency is directly related to improving software understandability, maintainability, and reusability. In this paper, we analyze the difference between component coupling and component dependency, introduce a two-parameter component coupling metric and a three-parameter component dependency metric. An important parameter in both these metrics is coupling distance, which represents the relevance of two coupled components. These metrics are applicable to layered component-based software. These metrics can be used to represent the dependencies induced by all types of software coupling. We show how to determine coupling and dependency of all scales of software components using these metrics. These metrics are then applied to Apache HTTP, an open-source web server. The study shows that coupling distance is related to the number of modifications of a component, which is an important indicator of component fault rate, stability and subsequently, component complexity.

O B B O O O O B 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 B O O B O O O O B O O O O O B O O O O O O O B O B 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 B O O O O O B O B 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 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

coupling distance
component-based software


Sharing clinical decisions for multimorbidity case management using social network and open-source tools Use assessment of social network technologies shows the benefits for decision making. Clinical decision support architecture makes practical use of specialized standards. Combining clinical decision support and social network, consensus will be fostered. Open source with the social network encourages adoption and collaboration.

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

vruh virgen del roco university hospital

stopp screening tool of older peoples prescriptions

start screening tool to alert doctors to right treatment

icd-9 international classifications of disease 9


experimental evaluation of animated-verifying object viewers for java Although many visualization techniques have been shown to be pedagogically effective, they are still not widely adopted. The reasons include: lack of suitable methods of automatic-generation of visualizations, lack of integration among visualizations, and lack of integration with basic integrated development environment (IDE) support. To effectively use visualizations when developing code, it is useful to automatically generate multiple synchronized views without leaving the IDE. The jGRASP IDE provides object viewers that automatically generate dynamic, state-based visualizations of objects and primitive variables in Java. Such seamless integration of a lightweight IDE with a set of pedagogically effective software visualizations is unique and is currently unavailable in any other environment. Multiple instructors have reported positive anecdotal evidence of their usefulness. We conducted formal, repeatable experiments to investigate the effect of these viewers for singly linked lists on student performance and we found a statistically significant improvement over traditional methods of visual debugging that use break-points.

B I O 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 B I I O B O O B O O O B O O O O O O O O B 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 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 B 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 B O B O

integrated development environment
use
performance
object
evidence
software
views
visualization
experimental evaluation
code
dynamic
support
effect
debugging

point
generation
synchronization
program visualization
experience
posit
algorithm animation
variability
reasoning
method
environments
formalism
data structures
repeatability
integrability


TAILORABLE GROUPWARE DESIGN BASED ON THE 3C MODEL In this paper, we propose a software architecture based on Web services and Software agents for groupware tailorability. Through our literature study, we realize that the property of tailorability has a significant impact on designing collaborative applications. Although online applications in the recent years have been growing exponentially, online collaborative work between users is often supported by software applications that provide static basic functionalities, mostly centered on communication tools (text, audio and video). Hence, adding more sophisticated tools for enriching the collaborative experience, as for example, an integrated environment for task coordination and production, requires manually coding them into the application, which requires a significant effort in order to adapt the system to the real needs of users. In a collaborative context, the application designers are not able to predict all users' needs at design time. To remedy this problem, we propose a tailorable groupware architecture that enables the dynamic integration/composition of services into the collaborative application, gaining both in time and performance. Our work is based on the 3C functional model by Ellis that decomposes collaboration between users into communication, coordination and cooperation spaces. Through our research, we realized that Web services are powerful distributed components offering the desired tools to adapt a groupware to the real needs of users. In this paper, we propose a collaboration protocol based on Web services between machines over the network in order to exchange common services. Based on this protocol, we propose our groupware architecture, U3D, that introduces tailorability in collaboration applications.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


memory system support for image processing Image processing applications tend to access their data non-sequentially and reuse that data infrequently. As a result, they tend to perform poorly on conventional memory systems due to high cache and TLB miss rates and are particularly sensitive to the growing latency of main memory. In this paper, we analyze the memory performance of three image processing algorithms (volume rendering, image warping, and image filtering) on both a conventional memory system and on the Impulse memory system. The Impulse memory system allows application software to control how, when, and where data are loaded into a conventional processor cache. It does this by letting software configure how the memory controller interprets the physical addresses exported by the processor, which enables an application to dynamically change how data are fetched. Sparse data can be accessed densely, which improves both cache and TLB utilization, and memory latency is hidden by prefetching data within the memory controller. We find that for these image processing codes, using an Impulse memory system yields speedups of 40\% to 226\% over an otherwise identical machine with a conventional memory system.

O O O O 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 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 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

cache efficiency
memory architecture
bus utilization
memory bandwidth
virtual memory


Dynamic modeling and optimization for technology management This paper presents a new approach to computer simulation of the production process for the optimization of production parameters. The dynamic model of the production process of a small factory toasting green coffee beans [1] has been used. This model incorporates all the operations to which the coffee is subjected, starting from loading it to the hopper at the beginning of the production process and ending with packing the final product into bags. The computer simulation allows one to follow the flow of the coffee in the real time of production, evaluates the cost of each operation separately and the final cost of production. On the bases of such a simulation, the process engineer can check and select the optimal parameters of the production process. (C) 1997 Elsevier Science Ltd.

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

simulation of production system
decision support systems
engineering economy
cost estimation


New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration We modify our earlier homotopic (continuation) process for iterative matrix inversion to improve the choice of the initial approximate inverse at every homotopic step. This enables us to control the condition of the auxiliary matrices and to accelerate the convergence of the iteration. The algorithm also extends our earlier approach where we factorized the input matrix into the product of better conditioned factors. We accelerate our new algorithm in the case of a Toeplitz-like input, comment on the extensions to the computations with other structured matrices such as Cauchy-Pick and banded matrices, and propose new techniques for the compression of the displacement of Hermitian matrices. (c) 2007 Elsevier Ltd. All rights reserved.

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

newton's iteration
homotopic (continuation) processes
toeplitz matrices


Delta-wing vortex visualization using micro-sized water droplets generated by an ultrasonic humidifier An off-surface visualization method using micro water droplets and a laser beam sheet was developed. The average size of the water droplets generated by the home-style ultrasonic humidifier was about 5-10 mu m. This method was pollution-free, eliminated the problem of toxicity, and provided a sufficient density of tracing particles for good visibility. The method was successfully applied to a visualization of the complex vortex flow of a double-delta wing with strake.

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 B I O O O O O O


A hybrid token-CDMA MAC protocol for wireless ad hoc networks Token-passing medium access control (MAC) protocols are gaining interest among wireless ad hoc network researchers as they provide unrivaled advantages over the existing IEEE 802.11 standards. This paper introduces a hybrid token-code division multiple access (CDMA) MAC protocol that is based on a token-passing scheme with the incorporation of CDMA. With its unique CDMA feature, the proposed MAC is able to support multiple simultaneous transmissions. The proposed protocol provides both quality of service (QoS) and high network resource utilization while ensuring the stability of the network. This paper examines the performance of the proposed MAC scheme by simulation and compares its performance against that of other MAC protocols that have appeared in the literature. Simulation results demonstrate that our proposed MAC scheme is effective in decreasing the packet delay and significantly shortens the length of the queue. The input traffic model used in the simulation is a two-state Markov-Modulated Poisson Process (MMPP). The data rate QoS is enforced by implementing a modified leaky bucket mechanism in the proposed MAC scheme. The simulation also takes into account channel link errors caused by the wireless link by implementing a multilayered Gilbert-Elliot model.

O O O O O O O O O O O O O O O O O O O O O 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

gilbert-elliot model
medium access control (mac)
quality of service (qos)
token passing


A threshold for the Maker-Breaker clique game We study the Maker-Breaker k-clique game played on the edge set of the random graph G(n, p). In this game, two players, Maker and Breaker, alternately claim unclaimed edges of G(n, p), until all the edges are claimed. Maker wins if he claims all the edges of a k-clique; Breaker wins otherwise. We determine that the threshold for the graph property that Maker can win this game is at , for all k > 3, thus proving a conjecture from Ref. [Stojakovi? and Szab, Random Struct Algor 26 (2005), 204223]. More precisely, we conclude that there exist constants such that when the game is Maker's win a.a.s., and when it is Breaker's win a.a.s.

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