Functional dependencies distorted by errors A relational database D is given with ? ? as the set of attributes. We assume that the rows (tuples, data of one individual) are transmitted through a noisy channel (or, as many times in case of the data mining applications, the observed data is distorted from the real values in a manner which we cannot know). In case of low probability of the error it may be supposed that at most one data in a row is changed by the transmission or observation. We say that A ? b ( A ? ? , b ? ? ) is an error-correcting functional dependency if the data in A uniquely determine the data in b in spite of this error. We investigate the problem how much larger a minimal error-correcting functional dependency can be than the original one. We will give upper and lower bounds showing that it can be considerably larger than the original sizes, but the growth is only polynomial.

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

relational database
functional dependencies


Development of a rapid prototyping design advice system This paper describes the initial development of a computer based Rapid Prototyping Design Advice System. The system is intended to assist the designer or project manager, particularly those in small and medium sized companies, in planning the prototyping stage of product development. It provides the user with an efficient and user friendly development aid which uses information obtained from the user and Computer Aided Design data to recommend suitable rapid prototyping solutions.

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

expert system
knowledge based system
decision support
product development aid


Arbitrary LagrangianEulerian finite element analysis of free surface flow using a velocityvorticity formulation This paper describes the application of velocityvorticity formulation of the NavierStokes equations for two-dimensional free surface flow using an arbitrary LagrangianEulerian method. The velocity Poisson equations and the vorticity transport equations are solved using a finite element method to obtain the velocity and the vorticity fields in the interior region of the computational domain. The boundary-fitted coordinates system is adopted to solve the boundary equations for kinematic and dynamic conditions at the free surface using a finite difference method. The numerical model for the velocityvorticity formulation is validated for a square cavity flow at Re=400 and 1000. The solitary wave reflected from a vertical wall is chosen as a test case for comparison and validation of the free surface flow model. Then the proposed numerical model is used to obtain flow results for the following free surface flow cases: (i) interaction between two opposite solitary waves, (ii) seiche phenomenon in a rectangular reservoir, and (iii) solitary wave through a submerged rectangular structure in a viscous fluid. The efficiency of the present numerical model for numerical treatment of free surface flows is discussed. Furthermore the advantage of this formulation with respect to primitive variables formulation is addressed from the computational point of view.

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

arbitrary lagrangianeulerian
free surface flow
velocityvorticity formulation


Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications We provide an improved FPTAS for multiobjective shortest paths-a fundamental (NP-hard) problem in multiobjective optimization-along with a new generic method for obtaining FPTAS to any multiobjective optimization problem with non-linear objectives. We show how these results can be used to obtain better approximate solutions to three related problems, multiobjective constrained [optimal] path and non-additive shortest path, that have important applications in QoS routing and in traffic optimization. We also show how to obtain a FPTAS to a natural generalization of the weighted multicommodity flow problem with elastic demands and values that models several realistic scenarios in transportation and communication networks.

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

multiobjective shortes path
non-linear objectives
multiple constrained (optimal) path
non-additive shortest path
qos-aware multicommodity flow


rapid modeling of animated faces from video images Generating realistic 3D human face models and facial animations has been a persistent challenge in computer graphics. We have developed a system that constructs textured 3D face models from videos with minimal user interaction. Our system takes images and video sequences of a face with an ordinary video camera. After five manual clicks on two images to tell the system where the eye corners, nose top and mouth corners are, the system automatically generates a realistic looking 3D human head model and the constructed model can be animated immediately. A user, with a PC and an ordinary camera, can use our system to generate his/her face model in a few minutes. We will demonstrate the system at the conference.

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

facial animation
geometric modeling
computer vision


A framework for assessing the relationship between information technology investments and firm performance There have been several attempts in the past to assess the impact of information technology on firm performance that have yielded conflicting results. Researchers have been unable to conclude that IT spending by an organization results in increases in key performance indicators. Two major recent studies have attempted to address the issue by putting greater emphasis on the theoretical underpinnings of the solution to the problem, although they chose different theoretical frameworks. The present study extends that work to yield a framework that shows the relationship between firm performance and both IT and corporate investments. The data used to validate the framework exceeds that used in previous analyses in both quality and quantity, thereby permitting appropriate statistical analyses. A large database consisting of over 2,000 observations of 624 firms was constructed, using data provided by the International Data Corporation, Standard & Poor's Compustat, and Moody's. This allowed us to pose the following research questions: (a) Can the relationship between sets of investment measures and firm performance be demonstrated (as opposed to individual measures)? (b) How are IT investments related to a firm's market value, market share, sales, and assets? and (c) Is there a difference in the effect of computer capital and noncomputer capital? Seven measures of firm performance were initially incorporated as outputs in the framework, related to sales, assets, and market value. Similarly, seven input measures of IT and corporate investments were initially included. Two output measures and one input were eventually eliminated to formulate a refined framework with strong explanatory power. After careful editing, canonical analyses were performed, resulting in several important findings. Both IT and corporate investments have a strong positive relationship with sales, assets, and equity, but not with net income. Spending on IS staff and staff training is positively correlated with firm performance, even more so than computer capital.

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

information technology payoff
information technology investment
organizational performance


ibm system/38 support for capability-based addressing The IBM System/38 provides capability-based addressing. This paper describes how support is divided among architectural definition, microcode, and hardware to minimize overhead for this function.

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


Development and Pilot Test of a Culturally Sensitive CD-ROM for Hypertensive, Older Chinese Immigrants Hypertension control remains an issue for older Chinese immigrants because of the unique cultural health practices they use to manage their hypertension. Limited health education information on how to manage hypertension is available in Chinese. Because San Francisco has a large population of older Chinese immigrants, development of culturally sensitive educational material is important to help this population to achieve better blood pressure control. The purpose of this study was to develop and pilot test an innovative, culturally based CD-ROM with a focus on hypertension education and management, directed to the older Chinese immigrant population. The results of this pilot study found that the content of CD-ROM was culturally acceptable for the target population. Given a lack of educational material in Chinese in the United States, this CD-ROM has a potential to be used for a large population of Chinese elders in the United States.

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

asian americans
cd-rom
cultural diversity
patient education


Multiresolution signal decomposition and approximation based on support vector machines The fusion of wavelet technique and support vector machines (SVMs) has become an intensive study in recent years. Considering that the wavelet technique is the theoretical foundation of multiresolution analysis (MRA), it is valuable for us to investigate the problem of whether a good performance could be obtained if we combine the MRA with SVMs for signal approximation. Based on the fact that the feature space of SVM and the scale subspace in MRA can be viewed as the same Reproducing Kernel Hilbert Spaces (RKHS), a new algorithm named multiresolution signal decomposition and approximation based on SVM is proposed. The proposed algorithm which approximates the signals hierarchically at different resolutions, possesses better approximation of smoothness for signal than conventional MRA due to using the approximation criterion of the SVM. Experiments illustrate that our algorithm has better approximation of performance than the MRA when being applied to stationary and non-stationary signals.

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

support vector machines
multiresolution analysis
signal approximation
reproducing kernel


A software tool for designing cost-effective compensation payments for conservation measures Compensation payments to farmers who apply species-friendly farming activities are a common instrument to reconcile nature conservation with agriculture in Europe. In order to design cost-effective and ecologically effective compensation payments for conservation measures an ecologicaleconomic modelling procedure has been developed using the example of protecting Large Blue butterflies. The modelling procedure forms the basis for the decision support tool EcoEcoMod. By comparing the effects of different mowing regimes on the butterfly populations for a given budget, the user can identify the cost-effective mowing regime and the corresponding compensation payments for that budget.

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

ecologicaleconomic model
simulation model
habitats
directive
online tool
biodiversity conservation
maculinea
cost-effectiveness


Successive Interference Cancelers for Multimedia Multicode DS-CDMA Systems Over Frequency-Selective Fading Channels Noncoherent and coherent multicode direct-sequence code-division multiple access (DS-CDMA) systems with successive interference cancellation (SIC) for multimedia reverse links over frequency-selective fading channels are studied. Followed by a RAKE receiver, the SIC scheme is applied for combating the multiple access interference. The bit error rate (BER) using the SIC technique over Nakagami-m fading channels is derived. Simulation results show that the multicode DS-CDMA system with SIC has demonstrated better performance than that without SIC under the multipath fading environment, while their corresponding numerical results from performance analyses are also provided for verifications. Furthermore, the coherent receiver could achieve a more satisfactory BER than the noncoherent counterpart at the expense of synchronization.

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

rake
successive interference cancellation

frequency-selective
multicode ds-cdma
multiple-access interference
nakagami-m fading channel


game design from the lens of a student The efficacy of games-based instruction in computer science education ultimately depends on the student experience. As there remains a continued emphasis on the use of games in computer science education, there is a need for a deeper exploration on the impact of the structure of game design and development courses on computer science student's overall experience. Though current research reflects the benefits of games within computer science courses, there is limited research that depicts the voice of the students. Student's insight is both necessary and relevant both to researchers and educators if games are to be sought to further the agenda of increasing participation in computer science education. This paper describes a game design course from the lens of six graduate students; it explores some of their challenges and their gratifications.

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


Quality control system design through the goal programming model and the satisfaction functions The goal programming (GP) model has been utilized for designing a quality control system (QCS) where several features are simultaneously considered. In the context of the quality control, the parameters can be imprecise and expressed through intervals. The aim of this paper is to propose two formulations for designing a QCS based on the imprecise GP model. The concept of satisfaction functions will be utilized to integrate explicitly the decision-makers preference. The developed formulations are illustrated through an example of a paper factory.

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

fuzzy goal programming
imprecise goals
satisfaction function
decision-makers preferences


Compression of 3D triangular meshes with progressive precision In this paper we introduce a novel approach for progressive transmission of three-dimensional (3D) triangular meshes. This algorithm is based on a new reversing approach of the irregular mesh subdivision that enables a wavelet representation of any mesh geometry. In this paper, we show how to achieve progressive compression of 3D models by transmitting more and more wavelet coefficients computed from the original mesh vertices coordinates. The connectivity of the reconstructed mesh remains the same as the original one, but its geometry is progressively refined by means of bitplane encoding. This approach processes directly floating point coordinates which is the most common representation for 3D meshes, and does not need quantization, which is a lossy transformation. Experimental results are given and demonstrate the efficiency of our encoding scheme versus other approaches. (C) 2003 Elsevier Ltd. All rights reserved.

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

triangular meshes
progressive compression


On the properties of sequences of fuzzy-valued Choquet integrable functions In this paper, we focus on investigating the properties of sequences of fuzzy-valued Choquet (for short, (C)-) integrable functions. Firstly, the concept of uniform (C)-integrabiliy and other new concepts like uniform absolute continuity and uniform boundedness for sequences of fuzzy-valued (C)-integrable functions are introduced and then the relations among them are discussed. As the applications of these concepts, we also present several convergence theorems for sequences of fuzzy-valued (C)-integrable functions by using uniform (C)-integrability.

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

uniform absolute continuity
uniform boundedness

uniform (c)-integrability
convergence theorem


ANALYTIC MODEL OF BEB ALGORITHM WITH MULTIPLE PRIORITIES IN MOBILE INFORMATION SYSTEMS In this paper we propose analytic model for computing the delay of the slotted ALOHA protocol with Binary Exponential Backoff (BEB) with multiple priorities as a collision resolution algorithm in mobile information systems. If a packet which tries to reserve a, channel collides times, it chooses one of the next 2(n) frames with equal probabilities and attempts the reservation again. We derive the expected access delay until an arbitrary packet reserves a, channel in any cell. Then the expected transmission delays for packets of calls with Multiple priorities re calculated analytically. Proposed analytic model is checked against simulation.

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

analytic model
slotted aloha protocol
beb
access delay
mobile information systems


mining hepatitis data with temporal abstraction The hepatitis temporal database collected at Chiba university hospital between 1982--2001 was recently given to challenge the KDD research. The database is large where each patient corresponds to 983 tests represented as sequences of irregular timestamp points with different lengths. This paper presents a temporal abstraction approach to mining knowledge from this hepatitis database. Exploiting hepatitis background knowledge and data analysis, we introduce new notions and methods for abstracting short-term changed and long-term changed tests. The abstracted data allow us to apply different machine learning methods for finding knowledge part of which is considered as new and interesting by medical doctors.

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


sybil Efficient constraint-based modelling in R Constraint-based analyses of metabolic networks are widely used to simulate the properties of genome-scale metabolic networks. Publicly available implementations tend to be slow, impeding large scale analyses such as the genome-wide computation of pairwise gene knock-outs, or the automated search for model improvements. Furthermore, available implementations cannot easily be extended or adapted by users.

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

constraint-based modelling
flux-balance analysis
fba
moma
room
gnu r


Numerical analysis of a synthetic jet using an automated adaptive method An automated adaptive remeshing methodology is applied to a synthetic jet. A set of two-dimensional, axisymmetric, time-dependent Computational Fluid Dynamics analyses are performed. Grid independence is achieved via successive levels of adaptive refinement using a novel methodology. The method employs adaptive remeshing, performed in an automated fashion. Adaptation criteria are based upon the undivided differences in select field variables. Sensors are placed at strategic locations within the flow field, which are used to aid in judging grid independence. The resulting analytical predictions are compared to an experimental dataset. The automated methodology yields both a verified and validated set of analysis results for the synthetic jet. Copyright (c) 2011 John Wiley & Sons, Ltd.

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

grid independence adaptation synthetic jet


Drug target identification in sphingolipid metabolism by computational systems biology tools: Metabolic control analysis and metabolic pathway analysis Sphingolipids regulate cellular processes that are critically important in cells fate and function in cancer development and progression. This fact underlies the basics of the novel cancer therapy approach. The pharmacological manipulation of the sphingolipid metabolism in cancer therapeutics necessitates the detailed understanding of the pathway. Two computational systems biology tools are used to identify potential drug target enzymes among sphingolipid pathway that can be further utilized in drug design studies for cancer therapy. The enzymes in sphingolipid pathway were ranked according to their roles in controlling the metabolic network by metabolic control analysis. The physiologically connected reactions, i.e. biologically significant and functional modules of network, were identified by metabolic pathway analysis. The final set of candidate drug target enzymes are selected such that their manipulation leads to ceramide accumulation and long chain base phosphates depletion. The mathematical tools efficiency for drug target identification performed in this study is validated by clinically available drugs.

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

sphingolipid metabolism
ceramide
cancer
systems biology
metabolic control analysis
metabolic pathway analysis


clustering support for automated tracing Automated trace tools dynamically generate links between various software artifacts such as requirements, design elements, code, test cases, and other less structured supplemental documents. Trace algorithms typically utilize information retrieval methods to compute similarity scores between pairs of artifacts. Results are returned to the user as a ranked set of candidate links, and the user is then required to evaluate the results through performing a top-down search through the list. Although clustering methods have previously been shown to improve the performance of information retrieval algorithms by increasing understandability of the results and minimizing human analysis effort, their usefulness in automated traceability tools has not yet been explored. This paper evaluates and compares the effectiveness of several existing clustering methods to support traceability; describes a technique for incorporating them into the automated traceability process; and proposes new techniques based on the concepts of theme cohesion and coupling to dynamically identify optimal clustering granularity and to detect cross-cutting concerns that would otherwise remain undetected by standard clustering algorithms. The benefits of utilizing clustering in automated trace retrieval are then evaluated through a case study

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

aspects
requirements clustering
cross-cutting concerns


Channel, capacity, and flow assignment in wireless mesh networks ? We study the problem of channel capacity, and flow assignment (CCFA) in multi-channel wireless mesh networks (WMNs). CCFA involves the joint assignment of channels, distribution of wireless capacity, and determination of link flows to enhance the effectiveness of WMNs. We first study the capacity assignment (CA) problem in WMNs (WMN-CA) which involves the distribution of wireless capacity, given the topology and the flows (i.e., traffic demands and routing). Unlike wired networks, the capacities of different wireless links in a WMN have to be carved out of the capacities of wireless nodes. Since the wireless medium is shared by various wireless nodes, interference between different wireless links constrains the distribution of the wireless capacity available at individual nodes. We formulate WMN-CA as a convex non-linear optimization problem (NLP). We also present efficient heuristics to solve the problem and compare their relative performance. We then propose a linear programming (LP) based iterative algorithm for CCFA. We define a new metric, called network utility, which takes both throughput and average packet delay into account and includes a parameter that can be used to emphasize one over the other. Our approach has two separate phases (1) channel assignment and (2) multi-channel capacity and flow assignment. The two phases of the iterative CCFA algorithm are performed repeatedly to improve the network utility which allows for a tradeoff between delay and throughput that can be achieved in a WMN.

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

channel assignment
capacity assignment
flow assignment


Using artificial neural networks to investigate the influence of temperature on hot extrusion of AZ61 magnesium alloy The hot extrusion process of magnesium alloy involves many processing parameters, billet temperature is one of the parameters that directly affect the tensile strength of finished product. Hot extrusion experiments of involving rectangular tubes are conducted at selected billet temperatures of 320, 350, 380 and 400 degrees C. Artificial neural networks (ANN) analysis then is performed at increments of 10 degrees C each time between the temperature 320 and 400 degrees C. Consequently, the magnesium alloy product can be obtained at the optimum tensile strength, as well as the most suitable temperature range for billet heating during hot extrusion process. This study mainly explores the relationship between the billet temperature and product tensile strength of the hot extrusion of magnesium alloy, and obtains the optimum temperature range through ANN analysis, and analyzes the relationship between the temperature and the tensile strength of a rectangular tube for various extrusion speeds and extrusion ratios. Subsequently, experiments are performed to confirm the accuracy of the results by using ANN analysis at different extrusion speeds and extrusion ratios. Finally, observing the microstructure enables researchers to acquire the relationship between the sizes of the crystalline grain of the magnesium alloy product at the different formation temperature.

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

magnesium alloy
ann
billet temperature
rectangular tube
extrusion


Combining Conventional Therapies with Intratumoral Injection of Autologous Dendritic Cells and Activated T Cells to Treat Patients with Advanced Cancers Dendritic cells (DCs) are potent antigen-presenting cells that have been used in cancer immunotherapy. To take advantage of the ability of DCs to acquire antigenic materials from their environment and generate primary as well as recall immune responses, 37 patients with advanced cancers were enrolled in a series of protocols based on direct intratumoral injection of immature DCs. To augment antigen uptake and antitumor immune response, DC injection was combined with radiotherapy or chemotherapy and/or injection of activated T cells. Treatments were well tolerated with no adverse reactions. Clinical responses were based on Response Evaluation Criteria in Solid Tumors, with the majority of patients showing stable disease. One of two patients who also received local radiation achieved a sustained complete response at injected and metastatic sites. The clinical responses observed in cancer patients with advanced disease suggest potential effectiveness of combination strategies and establish the basis for the current treatment protocol that is underway.

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

dendritic cells
activated t cells
intratumoral injection

combination immunotherapy
cancer vaccine


Adaptive memory-based local search for MAX-SAT Many real world problems, such as circuit designing and planning, can be encoded into the maximum satisfiability problem (MAX-SAT). To solve MAX-SAT, many effective local search heuristic algorithms have been reported in the literature. This paper aims to study how useful information could be gathered during the search history and used to enhance local search heuristic algorithms. For this purpose, we present an adaptive memory-based local search heuristic (denoted by AMLS) for solving MAX-SAT. The AMLS algorithm uses several memory structures to define new rules for selecting the next variable to flip at each step and additional adaptive mechanisms and diversification strategies. The effectiveness and efficiency of our AMLS algorithm is evaluated on a large range of random and structured MAX-SAT and SAT instances, many of which are derived from real world applications. The computational results show that AMLS competes favorably, in terms of several criteria, with four state-of-the-art SAT and MAX-SAT solvers AdaptNovelty+, AdaptG2WSATp, IRoTS and RoTS.

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

tabu search
sat and max-sat
hybrid algorithm
metaheuristics


An asymptotic preserving unified gas kinetic scheme for frequency-dependent radiative transfer equations This paper presents an extension of previous work (Sun et al., 2015 [22]) of the unified gas kinetic scheme (UGKS) for the gray radiative transfer equations to the frequency-dependent (multi-group) radiative transfer system. Different from the gray radiative transfer equations, where the optical opacity is only a function of local material temperature, the simulation of frequency-dependent radiative transfer is associated with additional difficulties from the frequency-dependent opacity. For the multiple frequency radiation, the opacity depends on both the spatial location and the frequency. For example, the opacity is typically a decreasing function of frequency. At the same spatial region the transport physics can be optically thick for the low frequency photons, and optically thin for high frequency ones. Therefore, the optical thickness is not a simple function of space location. In this paper, the UGKS for frequency-dependent radiative system is developed. The UGKS is a finite volume method and the transport physics is modeled according to the ratio of the cell size to the photon's frequency-dependent mean free path. When the cell size is much larger than the photon's mean free path, a diffusion solution for such a frequency radiation will be obtained. On the other hand, when the cell size is much smaller than the photon's mean free path, a free transport mechanism will be recovered. In the regime between the above two limits, with the variation of the ratio between the local cell size and photon's mean free path, the UGKS provides a smooth transition in the physical and frequency space to capture the corresponding transport physics accurately. The seemingly straightforward extension of the UGKS from the gray to multiple frequency radiation system is due to its intrinsic consistent multiple scale transport modeling, but it still involves lots of work to properly discretize the multiple groups in order to design an asymptotic preserving (AP) scheme in all regimes. The current scheme is tested in a few frequency-dependent radiation problems, and the results are compared with the solutions from the well-defined implicit Monte Carlo (IMC) method. The UGKS is much more efficient than IMC, and the computational times of both schemes for all test cases are listed. The UGKS seems to be the first discrete ordinate method (DOM) for the accurate capturing of multiple frequency radiative transport physics from ballistic particle motion to the diffusive wave propagation.

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

frequency-dependent radiative transfer
optically thick and thin
asymptotic preserving scheme


A review on vision techniques applied to Human Behaviour Analysis for Ambient-Assisted Living Human Behaviour Analysis (HBA) is more and more being of interest for computer vision and artificial intelligence researchers. Its main application areas, like Video Surveillance and Ambient-Assisted Living (AAL), have been in great demand in recent years. This paper provides a review on HBA for AAL and ageing in place purposes focusing specially on vision techniques. First, a clearly defined taxonomy is presented in order to classify the reviewed works, which are consequently presented following a bottom-up abstraction and complexity order. At the motion level, pose and gaze estimation as well as basic human movement recognition are covered. Next, the mainly used action and activity recognition approaches are presented with examples of recent research works. Increasing the degree of semantics and the time interval involved in the HBA, finally the behaviour level is reached. Furthermore, useful tools and datasets are analysed in order to provide help for initiating projects.

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

human behaviour
computer vision
activity recognition

ambient-assisted living
motion analysis
action recognition
activities of daily living (adls)


Streamline modeling with subdivision surfaces on the Gaussian sphere Curvature and variation of curvature are the essential factors in determining the fairness of a surface. Unfortunately, most of the traditional surface representation schemes do not provide users with direct manipulation techniques of these quantities. Streamline modeling, a recently proposed free-form surface design methodology, is aimed at overcoming this shortcoming by allowing a user to control tangent vectors (and, consequently, curvature and variation of curvature) of the surface to be designed directly. A free-form surface is regarded as a set of streamlines: iso-parametric lines defined by blending directions of tangent vectors instead of blending positions of control points. This new surface design methodology can generate high quality smooth surfaces but requires much processing power for tangent vector blending. In this paper, we present subdivision based blending techniques of tangent vectors. These techniques can be used to develop subdivision techniques for curves and surfaces on the Gaussian sphere, such as DooSabin, CatmullClark, and Kobbelt subdivisions. We also present new streamline modeling techniques based on the new tangent vector blending techniques. The new techniques reduce the processing time for the integration process required in streamline modeling. A prototype system based on the new techniques shows that free-form surface design using the streamline modeling methodology can achieve real-time performance.

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

streamline modeling
gaussian sphere
tangent vector blending


TrackerDetector: A system to detect third-party trackers through machine learning Privacy violation caused by third-party tracking has become a serious problem, and the most effective defense against it is blocking. However, as the core part of blocking, the blacklist is usually manually curated and is difficult to maintain. To make it easier to generate a blacklist and reduce human work, we propose an effective system with high accuracy, named TrackerDetector, to detect third-party trackers automatically. Intuitively, the behaviors of trackers and non-trackers are different, which leads to different JavaScript API sets being called. Thus, an incremental classifier is trained from JavaScript files crawled from a large number of websites to detect whether a website is a third-party tracker. High accuracy of 97.34% is obtained with our dataset and that of 93.56% is obtained within a 10-fold cross validation.

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


Personalized Sightseeing Tours Support Using Mobile Devices In this paper, we present PSiS (Personalized Sightseeing Tours Recommendation System) Mobile. PSiS Mobile is our proposal to a mobile recommendation and planning support system, which is designed to provide effective support during the tourist visit with context-aware information and recommendations about places of interest (POI), exploiting tourist preferences and context.

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

mobile recommendation system
sight information provider
context-aware
client-server application


staging static analyses for program generation Program generators are most naturally specified using a quote/antiquote facility; the programmer writes programs with holes which are filled in, at program generation time, by other program fragments. If the programs are generated at compile-time, analysis and compilation follow generation, and no changes in the compiler are needed. However, if program generation is done at run time, compilation and analysis need to be optimized so that they will not overwhelm overall execution time. In this paper, we give a compositional framework for defining program analyses which leads directly to a method of staging these analyses. The staging allows the analysis of incomplete programs to be started at compile time; the residual work to be done at run time may be much less costly than the full analysis. We give frameworks for forward and backward analyses, present several examples of specific analyses, and give timing results showing significant speed-ups for the run-time portion of the analysis relative to the full analysis.

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

static analysis
run-time code generation


Sentence recognition using artificial neural networks The paper describes an application of artificial neural networks (ANN) for natural language text reasoning. The task of knowledge discovery in text from a database, represented with a database file consisting of sentences with similar meanings but different lexico-grammatical patterns, was solved with ANNs which recognize the meaning of the text using training files with limited dictionary. The paper features recognition algorithms of text meaning from a selected source using 3-layer ANNs. Tests of the new method have also been described. (c) 2008 Elsevier B.V. All rights reserved.

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

knowledge discovery
sentence recognition

artificial intelligence
human-computer interaction
natural language processing


Power minimization algorithms for LUT-Based FPGA technology mapping We study the technology mapping problem for LUT-based FPGAs targeting at power minimization. The problem has been proved to be NP-hard previously. Therefore, we present an efficient heuristic algorithm to generate low-power mapping solutions. The key idea is to compute and select low-power K-feasible cuts by an efficient incremental network flow computation method. Experimental results show that our algorithm reduces power consumption as well as area over the best algorithms reported in the literature. In addition, we present an extension to compute depth-optimal low-power mappings. Compared with Cutmap, a depth-optimal mapper with simultaneous area minimization, we achieve a 14% power savings on average without any depth penalty.

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


OBIWAN: Design and implementation of a middleware platform Programming distributed applications supporting data sharing is very hard. In most middleware platforms, programmers must deal with system-level issues for which they do not have the adequate knowledge, e.g., object replication, abusive resource consumption by mobile agents, and distributed garbage collection. As a result, programmers are diverted from their main task: the application logic. In addition, given that such system-level issues are extremely error-prone, programmers spend innumerous hours debugging. We designed, implemented, and evaluated a middleware platform called OBIWAN that releases the programmer from the above mentioned system-level issues. OBIWAN has the following distinctive characteristics: 1) allows the programmer to develop applications using either remote object invocation, object replication, or mobile agents, according to the specific needs of applications, 2) supports automatic object replication (e.g., incremental on-demand replication, transparent object faulting and serving, etc.), 3) supports distributed garbage collection of useless replicas, and 4) supports the specification and enforcement of history-based security policies well adapted to mobile agents needs (e.g., preventing abusive resource consumption).

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

middleware
replication
distributed garbage collection
security policies
mobile agents


A novel approach to the low cost real time eye mouse We show the impact of the eye mouse performance depend on modified pupil center corneal reflection(PCCR) method We analyze various major reasons to make an eye gaze tracking system to be a system have a lower performance. We propose a solution reducing the complexities of the previous system, so that proposed system may produce a great performance.

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

accessibility
eye gaze system
real time embedded system


Information sharing in DEA: A cooperative game theory approach In this paper, a cooperative DEA game is proposed based on the idea that different organizations can gain if they share data on the input consumption and output production of their processing units. A larger data sample allows a more complete description of the Production Possibility Set and, consequently, of the efficient frontier. However, since not all organizations will benefit in the same way, it is convenient to use cooperative game theory in order to share the benefits of the cooperation. The proposed cooperative DEA game is shown to be subadditive and balanced. Models for computing the ?-value of the game and checking its stability, taking into account the exponential number of coalitions that exist when the number of organizations is large, are also presented. The approach is illustrated with a dataset from the literature.

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

cooperative dea game
information sharing
cooperative game theory

data envelopment analysis
horizontal cooperation
row generation
?-value


Structural changes estimation for strongly dependent processes In this paper, we consider the problem of estimating multiple structural breaks in a long-memory fractional autoregressive integrated moving-average time series. The number of break points as well as their locations, the orders and the parameters of each regime are assumed to be unknown. A selection criterion based on the minimum description length principle is proposed and a genetic algorithm is implemented for its optimization. Monte Carlo simulation results show the effectiveness of this criterion and an application to the Nile River data is considered.

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

minimum description length principle
genetic algorithm

structural change
long-memory
non-stationary time series


multimodal interaction to support multilingualism acquisition and development in young children The aim of our research is to explore new interaction paradigms for the design of multilingual educational software. In this poster, we present some early work on the use of multimodal interaction techniques to facilitate the simultaneous acquisition of more than one language during the period of primary language development. We suggest that multimodality can be used to deal with common multilingual phenomena such as language mixing and language dominance or specialization.

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

multilingualism
language mixing
educational software
multimodal interaction

modality fission
language acquisition and development


On judgment aggregation in abstract argumentation Judgment aggregation is a field in which individuals are required to vote for or against a certain decision (the conclusion) while providing reasons for their choice. The reasons and the conclusion are logically connected propositions. The problem is how a collective judgment on logically interconnected propositions can be defined from individual judgments on the same propositions. It turns out that, despite the fact that the individuals are logically consistent, the aggregation of their judgments may lead to an inconsistent group outcome, where the reasons do not support the conclusion. However, in this paper we claim that collective irrationality should not be the only worry of judgment aggregation. For example, judgment aggregation would not reject a consistent combination of reasons and conclusion that no member voted for. In our view this may not be a desirable solution. This motivates our research about when a social outcome is 'compatible' with the individuals' judgments. The key notion that we want to capture is that any individual member has to be able to defend the collective decision. This is guaranteed when the group outcome is compatible with its members views. Judgment aggregation problems are usually studied using classical propositional logic. However, for our analysis we use an argumentation approach to judgment aggregation problems. Indeed the question of how individual evaluations can be combined into a collective one can also be addressed in abstract argumentation. We introduce three aggregation operators that satisfy the condition above, and we offer two definitions of compatibility. Not only does our proposal satisfy a good number of standard judgment aggregation postulates, but it also avoids the problem of individual members of a group having to become committed to a group judgment that is in conflict with their own individual positions.

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

discursive dilemma
group decision making


Shape optimization of quasi-brittle axisymmetric shells by genetic algorithm This paper describes the application of genetic algorithm to the shape optimization of axisymmetric shells. The primary problem of axisymmetric shell optimization under fracture mechanics constraint is formulated as the weight (volume of shell material) minimization under stress intensity constraints. It is assumed that the shells are made from quasi-brittle materials and through-thickness crack presence is admitted. Taking into account the fact of incomplete information concerning crack arising (size, location and orientation) this paper presents some numerical results based on a guaranteed approach.

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


Calculation of Gaussian-type quadratures with multiple nodes A new algorithm for constructing quadrature formulas with multiple Gaussian nodes in the presence of certain fixed nodes is presented. It can be used in construction for measures with the bounded and infinite supports. The algorithm includes a simple and fast method for finding elements of the Jacobian matrix in an iterative process with quadratic convergence, which is based on using the fundamental three-term recurrence relation for the corresponding orthogonal polynomials with respect to a given measure. Numerical experiments with respect to several different measures are also included. Finally, a simple method for calculating weight coefficients (Cotes numbers of higher order) of Gaussian and prescribed nodes is presented. Numerical examples are included. (C) 2004 Elsevier Ltd. All rights reserved.

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

quadratures with multiple nodes
orthogonal polynomials
nodes

gauss-turan-type quadratures
s- and sigma-orthogonal polynomials
zero distribution
nonnegative measure
weights
degree of precision
moments


Simple decision forests for multi-relational classification An important task in multi-relational data mining is link-based classification which takes advantage of attributes of links and linked entities, to predict the class label. The relational Naive Bayes classifier exploits independence assumptions to achieve scalability. We introduce a weaker independence assumption to the effect that information from different data tables is independent given the class label. The independence assumption entails a closed-form formula for combining probabilistic predictions based on decision trees learned on different database tables. Logistic regression learns different weights for information from different tables and prunes irrelevant tables. In experiments, learning was very fast with competitive accuracy.

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

multi-relational naive bayes classifiers


Compact DC model for submicron GaAs MESFETs including gate-source modulation effects Recent submicron DC GaAs MESFET models (Ahmed et al., IEEE Trans. Electron. Devices, ED-44 (1997) 360) are improved in order to more accurately facilitate non-linear small-signal circuit designs. The AhmedAhmedLadbrooke (AAL) model (Ahmed et al., IEEE Trans. Electron. Devices, ED-44 (1997) 360), allowed for the prediction of the DC characteristics of large-signal submicron devices by using the concept of a shift in threshold voltage. The new model proposed in this paper uses a small number of variables and, while improving on the AAL model, retains the essential form of the more common Curtice and Advanced Curtice models (Curtice, IEEE Trans. Microwave Theory Tech., MTT-28 (1980) 4456; de Graaff and klaassen, Compact Transistor Modelling for Circuit Design, Springer, Vienna, 1990) together with accounting for gate-source voltage modulation effects.

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

submicron gaas mesfet
gate-source modulation


infinite arrays and diagonalization This paper discusses the application of infinite arrays to several areas, notably the formation of do-while expressions. The functions diagonal and inverse diagonal are defined, with applications to processing both finite and infinite arrays. Infinite arrays are shown to be useful in mathematical exposition. Finally, suggestions are given for the implementation of diagonalization functions.

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


Rao-Blackwellized particle filter for multiple target tracking In this article we propose a new Rao-Blackwellized particle filtering based algorithm for tracking an unknown number of targets. The algorithm is based on formulating probabilistic stochastic process models for target states, data associations, and birth and death processes. The tracking of these stochastic processes is implemented using sequential Monte Carlo sampling or particle filtering, and the efficiency of the Monte Carlo sampling is improved by using Rao-Blackwellization. (C) 2005 Elsevier B.V. All rights reserved.

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

multiple target tracking
unknown number of targets
sequential monte carlo
particle filtering


Conditional value-at-risk in stochastic programs with mixed-integer recourse In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades - have attracted attention in stochastic programming. We consider Conditional Value-at-Risk as risk measure in the framework of two-stage stochastic integer programming. The paper addresses structure, stability, and algorithms for this class of models. In particular, we study continuity properties of the objective function, both with respect to the first-stage decisions and the integrating probability measure. Further, we present an explicit mixed-integer linear programming formulation of the problem when the probability distribution is discrete and finite. Finally, a solution algorithm based on Lagrangean relaxation of nonanticipativity is proposed.

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

mean-risk models
mixed-integer optimization
conditional value-at-risk


1.2nm capacitance equivalent thickness gate stacks on Si-passivated GaAs Experiments to increase the specific capacitance of MOS capacitors consisting of HfO2 on a passivating interfacial layer (IL) of amorphous Si (a-Si) on GaAs are described. XPS analysis of the layers and electrical measurements on the capacitors are combined to study the evolution of the gate stack during deposition and subsequent heat treatments. It is shown that oxidation of the a-Si IL is a major factor in preventing the attainment of a scaled capacitance equivalent thickness (CET). By controlling the deposition of the layers, the gate metal and the heat treatments, a highly scaled gate stack with a CET of 1.2nm and a leakage reduction of more than 4 orders of magnitude with respect to SiO2/Si was realized.

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


Evaluation of four models for the sonification of elite rowing Many aspects of sonification represent potential benefits for the practice of sports. Taking advantage of the characteristics of auditory perception, interactive sonification offers promising opportunities for enhancing the training of athletes. The efficient learning and memorizing abilities pertaining to the sense of hearing, together with the strong coupling between auditory and sensorimotor systems, make the use of sound a natural field of investigation in quest of efficiency optimization in individual sports at a high level. This study presents an application of sonification to elite rowing, introducing and evaluating four sonification models. The rapid development of mobile technology capable of efficiently handling numerical information offers new possibilities for interactive auditory display. Thus, these models have been developed under the specific constraints of a mobile platform, from data acquisition to the generation of a meaningful sound feedback. In order to evaluate the models, two listening experiments have then been carried out with elite rowers. Results show a good ability of the participants to efficiently extract basic characteristics of the sonified data, even in a non-interactive context. Qualitative assessment of the models highlights the need for a balance between function and aesthetics in interactive sonification design. Consequently, particular attention on usability is required for future displays to become widespread.

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


Combinatorial optimization in Biology using Probability Collectives Multi-agent Systems We present a study of Probability Collectives Multi-agent Systems (PCMAS) for combinational optimization problems in Biology. This framework for distributed optimization is deeply connected with both game theory and statistical physics. In contrast to traditional biologically-inspired algorithms, Probability-Collectives (PC) based methods do not update populations of solutions; instead, they update an explicitly parameterized probability distribution p over the space of solutions by a collective of agents. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. In this paper we demonstrate PCMAS as a promising combinational optimization method for biological network construction. This computational approach to response networks enables robust prediction of activated crucial sub-networks in biological systems under the presence of specific drugs, thereby facilitating the identification of important nodes for potential drug targets and furthering hypotheses about biological and medical problems on a systems level. The application of PCMAS in this context therefore sheds light on how this multi-agent learning methodology advances the current state of research in agent-based models for combinational optimization problems in Biology.

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

probability collectives
combinational optimization

multi-agent systems
biological networks
mycobacterium tuberculosis


Sample size calculations for controlled clinical trials using generalized estimating equations (GEE) Objectives: Clinical trials with correlated response data based on generalized estimating equations (GEE) have become increasingly popular as they require smaller samples than classical methods that ignore the clustered nature of the data. We have recently derived the recommendation to use the independence estimating equations (IEE) as primary analysis in most controlled clinical trials instead of GEE with estimated correlations [1]. Although several approaches for sample size and power calculation have been proposed, we have shown that most of these procedures are very specific and not as general as required for designing clinical trials. Methods: We extended the previously developed SAS macro GEESIZE to overcome this restriction. Specifically, we have added the option of an independence working correlation matrix required for the IEE. Additionally, we have reformulated the hypotheses to allow for coding that includes an intercept term instead of the previously used analysis of variance coding. Results: To demonstrate the validity of GEESIZE we investigate the calculated sample sizes for specific models where closed formulae are available. For illustration, we utilize GEESIZE for planning a new trial on the treatment of hypertension and thereby exemplify its flexibility. Conclusions: We show that our freely available macro is a very general and useful tool for sample size calculation purposes in clinical trials with correlated data.

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

sample size calculation
controlled clinical trials
generalized estimating equations


A cost-oriented approach for the design of IT architectures Multiple combinations of hardware and network components can be selected to design an information technology ( IT) infrastructure that satisfies organizational requirements. The professional criterion to deal with these degrees of freedom is cost minimization. However, a scientific approach has been rarely applied to cost minimization and a rigorous verification of professional design guidelines is still lacking. The methodological contribution of this paper is the representation of complex infrastructural design issues as a single cost-minimization problem. The approach to cost-minimization is empirically verified with a database of costs that has also been built as part of this research. The paper shows how an overall cost-minimization approach can provide significant cost reductions and indicates that infrastructural design rules previously identified by the professional literature can lead to sub-optimal solutions.

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

it costs
distributed systems
distributed networks


Energy adaptation of non-associated plasticity tangent matrices for symmetric solvers The behaviour of most civil engineering materials is considered by many to be best characterised by non-associated plasticity models which generate unsymmetric stiffness matrices. Various non-symmetric solution algorithms have been developed for solving such problems but these require large core storage, (approximately twice the size required for symmetric solution algorithms), and the computational process is consequently slowed down especially for very large problems. Two groups of eight symmetric solution techniques are proposed in this paper for non-associated plasticity problems using the total and plastic work done as scalar measures to adapt their tangent matrices for symmetric solvers. Five numerical examples are used to illustrate the performance and limitations of the techniques in terms of numerical stability, solution accuracy and computation times.

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

non-associated plasticity
symmetrization techniques
symmetric and non-symmetric solvers
scalar mapping constraints
yield surface
plastic potential


Personalized and mobile digital TV applications The introduction of mobile and broadband networks in complement to the existing satellite, cable, and terrestrial platforms, opens new opportunities for interactive TV (ITV) applications. In addition, the widespread adoption of multimedia computing has enabled the processing of TV content on personal devices such as mobile phones and PCs. The above developments raise novel issues and require the adoption of new multimedia standards and application frameworks. In particular, the explosion in the amount of available TV channels over digital television platforms (broadcast or internet protocol) makes searching and locating interesting content a cumbersome task. In this context, personalization research is concerned with the adaptation of content (e.g. movies, news, advertisements). Personalization is achieved with the employment of algorithms and data collection schemes that predict and recommend to television viewers content that match their interests. In addition, the distribution of TV content to mobile devices over broadband wireless raises the issue of video quality. Video quality depends on many aspects of the video encoding systems, such as bit rate and algorithms that model human perception of video on small screens. In this article, we examine contemporary research in personalized and mobile digital TV applications. Moreover, we present a critical survey of the most prominent research and provide directions for further research in personalized and mobile digital TV (DTV) applications.

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

digital tv
interactive tv
personalization


Integrating local action elements for action analysis In this paper, we propose a framework for human action analysis from video footage. A video action sequence in our perspective is a dynamic structure of sparse local spatialtemporal patches termed action elements, so the problems of action analysis in video are carried out here based on the set of local characteristics as well as global shape of a prescribed action. We first detect a set of action elements that are the most compact entities of an action, then we extend the idea of Implicit Shape Model to space time, in order to properly integrate the spatial and temporal properties of these action elements. In particular, we consider two different recipes to construct action elements: one is to use a Sparse Bayesian Feature Classifier to choose action elements from all detected Spatial Temporal Interest Points, and is termed discriminative action elements. The other one detects affine invariant local features from the holistic Motion History Images, and picks up action elements according to their compactness scores, and is called generative action elements. Action elements detected from either way are then used to construct a voting space based on their local feature representations as well as their global configuration constraints. Our approach is evaluated in the two main contexts of current human action analysis challenges, action retrieval and action classification. Comprehensive experimental results show that our proposed framework marginally outperforms all existing state-of-the-arts techniques on a range of different datasets.

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

action retrieval
action classification
implicit shape model

action matching
spatial temporal feature
generalized hough transform
sparse bayesian classifier
multi-dimensional density estimation
action distance function


Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing We study routing overhead due to location information collection and retrieval in mobile ad-hoc networks employing geographic routing with no hierarchy. We first provide a new framework for quantifying overhead due to control messages generated to exchange location information. Second, we compute the minimum number of bits required on average to describe the locations of a node, borrowing tools from information theory. This result is then used to demonstrate that the expected overhead is Omega(n(1.5) log(n)), where n is the number of nodes, under both proactive and reactive geographic routing, with the assumptions that 1) nodes' mobility is independent, and 2) nodes adjust their transmission range to maintain network connectivity. Finally, we prove that the minimum expected overhead under the same assumptions is Theta(n log(n)).

data communications
mobile communication systems
network management
routing protocols


an efficient approach to simultaneous transistor and interconnect sizing In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We define a class of optimization problems as CH-posynomial programs and reveal a general dominance property for all CH-posynomial programs. We show that the STIS problems under a number of transistor delay models are CH-posynomial programs and propose an efficient and near-optimal STIS algorithm based on the dominance property. When used to solve the simultaneous driver/buffer and wire sizing problem for real designs, it reduces the maximum delay by up to 16.1\%, and more significantly, reduces the power consumption by a factor of 1.63X, when compared with the original designs. When used to solve the transistor sizing problem, it achieves a smooth area-delay trade-off. Moreover, the algorithm optimizes a clock net of 367 drivers/buffers and 59304 /spl mu/m-long wire in 120 seconds, and a 32-bit adder with 1026 transistors in 66 seconds on a SPARC-5 workstation.

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

wire sizing problem
power consumption
factor
delay
clock
interconnect
general
smooth
algorithm
paper
dominance
stis
transistor sizing
class

program
efficiency
optimality
size
design
model
circuit cad
buffers
transistor and interconnect sizing
driver/buffer
ch-posynomial programs


Individualized closed-loop control of propofol anesthesia: A preliminary study An individualized strategy for closed-loop propofol administration is proposed. The controller was evaluated in simulation on 44 previously published PKPD models. The proposed controller offers a 25% improvement compared to a population-based one.

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

automatic control
individualized treatment


Optimal parallel clustering algorithms on a reconfigurable array of processors with wider bus networks Clustering techniques are usually used in pattern recognition, image segmentation and object detection. For N patterns and k centers each with M features, in this paper, we first design an O(kM) time optimal parallel algorithm for one pass process of clustering with the k-means method on a linear array of processors with a wider bus network using N1+1/epsilon processors with one bus network, where c is any constant and c greater than or equal to 1. Then, based on the proposed algorithm, two O(k) and O(1) time optimal parallel clustering algorithms are also derived using MN1+1/epsilon and kMN(1+1/epsilon) processors with M row and MN row bus networks, respectively. These results improve the best known bounds and achieve cost optimal in their time and processor complexities. (C) 1999 Elsevier Science 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

array of processors with a wider bus network (rapwbn)


a spatially-adaptive bus interface for low-switching communication (poster session) Adaptive encoding has shown to be an effective approach to bus power minimization in situations where characterization of the input statistics is not available. In this paper, we propose a novel technique for adaptive bus encoding that, conversely from existing solutions, exploits spatial correlations in the input data being transmitted to increase the accuracy in the dynamic selection of the encoding function. We discuss the encoding algorithm and we describe an architecture for its implementation as bus interface. We present experimental data collected in a realistic simulation framework on a number of meaningful benchmarks, and we compare them to those obtained through the application of existing encoding schemes. Adaptive encoding has shown to be an effective approach to bus power minimization in situations where characterization of the input statistics is not available. In this paper, we propose a novel technique for adaptive bus encoding that, conversely from existing solutions, exploits spatial correlations in the input data being transmitted to increase the accuracy in the dynamic selection of the encoding function. We discuss the encoding algorithm and we describe an architecture for its implementation as bus interface. We present experimental data collected in a realistic simulation framework on a number of meaningful benchmarks, and we compare them to those obtained through the application of existing encoding schemes.

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

communication framework statistics simulation characterization input paper spatial accuracy dynamic architecture implementation data power algorithm

applications benchmark correlation interfaces minimal situated select adapt experimentation exploit functional switch effect encode scheme


On the deterministic solution of multidimensional parametric models using the Proper Generalized Decomposition This paper focuses on the efficient solution of models defined in high dimensional spaces. Those models involve numerous numerical challenges because of their associated curse of dimensionality. It is well known that in mesh-based discrete models the complexity (degrees of freedom) scales exponentially with the dimension of the space. Many models encountered in computational science and engineering involve numerous dimensions called configurational coordinates. Some examples are the models encountered in biology making use of the chemical master equation, quantum chemistry involving the solution of the Schrodinger or Dirac equations, kinetic theory descriptions of complex systems based on the solution of the so-called Fokker-Planck equation, stochastic models in which the random variables are included as new coordinates, financial mathematics, etc. This paper revisits the curse of dimensionality and proposes an efficient strategy for circumventing such challenging issue. This strategy, based on the use of a Proper Generalized Decomposition, is specially well suited to treat the multidimensional parametric equations. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.

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

curse of dimensionality
parametric models

multidimensional models
proper generalized decompositions
separated representations


Simulation of a turbulent channel flow with an entropic Lattice Boltzmann method The Lattice Boltzmann method (LBM) is used to simulate turbulent channel flow. Two simulations are performed. One uses high enough grid resolution in order for it to be considered a direct numerical simulation (DNS). LBM in its traditional form is adopted for this simulation. The other simulation uses lower resolution for which the original method becomes unstable. An entropy condition is used to render this simulation stable. Results from these two numerical experiments are compared with the results from a DNS performed with traditional numerical techniques. It is concluded that LBM can be used as tool to simulate turbulent flows and entropy stabilized LBM schemes can be used to achieve accurate results with reasonably low grid resolution. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

lbm
lattice
boltzmann
entropy
channel flow
direct numerical simulation

numerical methods
incompressible flow
turbulence
lattice boltzmann method


Five facets of social presence in online distance education Social presence in online learning environments refers to the degree to which a learner feels personally connected with other students and the instructor in an online learning community. Based on a 19 item Online Social Presence Questionnaire (OSPQ) given to college students in two different online learning courses, a series of exploratory and confirmatory factor analyses consistently revealed five factors representing facets of social presence in online learning environments: social respect (e.g. receiving timely responses), social sharing (e.g., sharing information or expressing beliefs), open mind (e.g., expressing agreement or receiving positive feedback), social identity (e.g., being called by name), and intimacy (e.g., sharing personal experiences). Together, the five factors accounted for 58% of the variance and were based on 19 items. Although much previous research focuses on cognitive aspects of learning in online environments, understanding the role of the learners sense of presence may be particularly important in distance learning situations in which students and the instructor are physically separated.

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

distance learning
social presence
online learning


indoor localization based on response rate of bluetooth inquiries Location is considered as the most important and relevant context information. Bluetooth technology, being a common feature of commercial mobile devices, is a (or the) key technology that is pervasively available nowadays. There has been not much success in using Bluetooth technology for indoor localization, mainly due to the limitation of the technology. Using the Context Management Frame (CMF) infrastructure deployed in our office building, we have designed, implemented and evaluated a Bluetooth based indoor localization solution that determines the locations of stationary mobile users at a room level. The solution is based on the inquiry response rate of Bluetooth technology. This approach does not require establishing any connectivity between Bluetooth devices. Further, since the solution is infrastructure- and network-based, it does not require mobile devices to be upgraded in any way in order to be localized. The results of experiments show that our solution has 98\% accuracy in rooms with full Bluetooth sensor coverage, when the target device being stationary for 3 minutes.

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

response rate
indoor localization
bluetooth


Theoretical study of electronic absorptions in aminopyridines - TCNE CT complexes by quantum chemical methods, including solvent The geometric and electronic structure of donor-acceptor complexes of TCNE with aniline, o-, m- and p- aminopyridines and pyridine has been studied in gas phase and in solution using CC2, TDDFT and CIS methods. Concerning interaction energy between particular donor and TCNE acceptor it is fairly described by both CC2 (MP2) and DFT-D approaches. Transition energies in gas phase calculated by CC2 approach are in good agreement with available experimental data for aniline. TDDFT calculations with LC-BLYP functional (with standard value of range separation factor mu = 0.47) gives transition energies too high although not as high as CIS. The red solvent shifts, calculated by PCM model with CIS method are qualitative correct, but error in the range of 0.1-0.2 eV should be expected.

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

electron donor acceptor complex
aminopyridine
cc2 method
dft-d
solvent shift
transition energy


A vision-based system for measuring the displacements of large structures: Simultaneous adaptive calibration and full motion estimation Non-contact measurement system for structural monitoring of large structures. Simultaneous adaptive vision system calibration and full motion estimation. Vision system calibration performed in-situ, continuously and in real-time. A set of kinematic and camera parameters are used to create a state-space model. Performance evaluation by numerical simulation and real imagery experiments.

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

vision metrology
non-contact measuring system
3d motion estimation
structural health monitoring
long range photogrammetry


improving test suites for efficient fault localization The need for testing-for-diagnosis strategies has been identified for a long time, but the explicit link from testing to diagnosis (fault localization) is rare. Analyzing the type of information needed for efficient fault localization, we identify the attribute (called Dynamic Basic Block) that restricts the accuracy of a diagnosis algorithm. Based on this attribute, a test-for-diagnosis criterion is proposed and validated through rigorous case studies: it shows that a test suite can be improved to reach a high level of diagnosis accuracy. So, the dilemma between a reduced testing effort (with as few test cases as possible) and the diagnosis accuracy (that needs as much test cases as possible to get more information) is partly solved by selecting test cases that are dedicated to diagnosis.

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


Eyeglasses removal of thermal image based on visible information Recently, a number of studies have demonstrated that thermal infrared (IR) imagery offers a promising alternative to visible imagery in face recognition problems due to its invariance to visible illumination changes. However, thermal IR has other limitations such as being opaque to glass. As a result, thermal IR imagery is very sensitive to facial occlusion caused by eyeglasses. Fusion of the visible and thermal IR images is an effective way to solve this problem. In this paper, using the face reconstruction information of the visible images, we propose two thermal image reconstruction algorithms, called the visible information aided eyeglasses removing algorithm (VIAER) and the refined visible information aided eyeglasses removing algorithm (refined VIAER). Experiments on publicly available data set show the excellent performance of our algorithms. (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 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

face image reconstruction
thermal infrared imagery


Acceleration of algebraically-converging Fourier series when the coefficients have series in powers of 1/n If the coefficients in a Fourier cosine series, f(x) approximate to f(N) = Sigma(infinity)(n=0)a(n) cos(nx), decrease as a small negative power of n, then one may need millions of terms to sum the series to high accuracy. We show that if the a(n) are known analytically and have a power series in 1/n, then it is straightforward to approximate f(x) as a series of what we shall the Lanczos-Krylov (LK) functions. (We describe the similar methodology for sine series; general Fourier series are merely the sum of a cosine series with a sine series and thus are implicitly handled, too.) For cosine coefficients that involve only even powers of n and sine coefficients that are functions of odd powers of n, the LK functions may be expressed in terms of Bernoulli polynomials. The LK functions for cosine coefficients involving odd powers of n and for sine coefficients in even powers of n are not known explicitly; these are also known as "Clausen functions". We provide rapidly convergent series to compute these Clausen functions to high accuracy. Our method includes the "endpoint subtraction" ideas of Lanczos and Krylov, but is more general. The sum Sigma(infinity)(n=1) (+/- 1)(n+1) (1/(n + lambda)) cos(nx), where lambda > 0 is a constant, arises in phase transitions in absorbed monolayers on metal surfaces. It is easily summed by our method, which correctly incorporates the logarithmic singularities at x = +/-pi. (c) 2008 Elsevier Inc. All rights reserved.

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

pseudospectral
spectral method
gibbs phenomenon


design of a 10ghz clock distribution network using coupled standing-wave oscillators In this paper, a global clock network that incorporates standing waves and coupled oscillators to distribute a high-frequency clock signal with low skew and low jitter is described. The key design issues involved in generating standing waves on a chip are discussed, including minimizing wire loss within an available technology. A standing-wave oscillator, a distributed oscillator that sustains ideal standing waves on lossy wires, is introduced. A clock grid architecture comprised of coupled, standing-wave oscillators and differential, low-swing clock buffers is presented. The measured results for a prototyped standing-wave clock grid operating at 10GHz and fabricated in a 0.18?m 6M CMOS logic process are presented. A technique is proposed for on-chip skew measurements with sub-picosecond precision.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 oscillators
standing wave
on-chip phase measurement
salphasic
resonant clocking


multimedia-based authorization and access control policy specification Exchanging multimedia objects between wide ranges of distributed applications, web services, and end-users is rapidly increasing in several application domains (medicine, surveillance, e-learning, etc.). In confidential applications, one of the emergent problems to deal with is data authorization and access control. Several textual-oriented authorization models have been provided in the literature. However, multimedia data are more complex in structure and content than textual ones, and thus require new relevant models to provide full multimedia-oriented components specification. In this paper, we address this problem and present a new approach able to improve authorization and access control policies by combining multimedia objects features (shape, color, texture, etc.) with textual descriptors. We also extend the widely used Role Based Access Control (RBAC) model by considering additional concepts useful to improve authorization control, and by integrating different types of possible links between users of different roles to avoid security breaches.

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

authorization and access control
security
role based access control


A spiking neural network (SNN) forecast engine for short-term electrical load forecasting Implementation of SNN to STLF is proposed in this paper. Testing and validation is carried out on the load data for Victoria in Australia. The impact of weather variables on the accuracy of proposed model is discussed. The error indices obtained indicate that SNN is superior to ANN and Hybrid models.

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

spiking neurons
spike response model (srm)
hybrid model


Type M for E-J generalized quasi-Hausdorff matrices In this paper, we determine sufficient condition for the transpose of an E-J generalized Hausdorff matrix to be of type M. (C) 2010 Elsevier Ltd. All rights reserved.

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

e-j generalized quasi-hausdorff matrices