?-DSMC: a general viscosity method for rarefied flow A modified DSMC method for rarefied flows is described, by which any viscosity law ?=?(T) may be simulated. The method is simple to implement. The collision cross-section of a simple collision model, such as the hard sphere or variable hard sphere (VHS) is made to vary from cell to cell, based on the time-averaged cell temperature and the required viscosity at that temperature. The method is here demonstrated for two viscosity laws which fit experimental data better than does the hard sphere or variable hard sphere viscosity laws, but in principle the method can use the experimental data directly. The new method is tested in two different flows: high speed Couette flow and a plane 1D shock. For Couette flow, the shear stress and heat transfer, calculated from the velocity distribution, agree with the theoretical values calculated from the flow gradients and the theoretical transport coefficients. For the plane 1D shock, the new method is compared with the generalized hard sphere (GHS) model. The new method produces profiles of density and temperature within the shock which are generally indistinguishable from the GHS results except for a deviation in the Tx temperature component in a small region ahead of the shock. This deviation depends on the shock Mach number; for the worst case it is 4.6%. The deviation can be reduced by basing the imposed viscosity on the maximum component of kinetic temperature (in this case Tx) rather than the mean kinetic temperature. The new method is shown to be insensitive to the number of simulator particles used in each cell. Three translational degrees of freedom are considered here. However, because ?-DSMC is based on a hard sphere or VHS cross-section, it is compatible with the most commonly used BorgnakkeLarsen energy exchange model for translationalrotational energy exchange.

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

numerical simulation (65c)
sutherland viscosity
ghs viscosity (82a71)


A simple iterative approach to parameter optimization Various bioinformatics problems require optimizing several different properties simultaneously, For example, in the protein threading problem, a scoring function combines the values for different parameters of possible sequence-to-structure alignments into a single score to allow for unambiguous optimization. In this context, an essential question is how each property should be weighted. As the native structures are known for some sequences, a partial ordering on optimal alignments to other structures, e.g., derived from structural comparisons, may be used to adjust the weights. To resolve the arising interdependence of weights and computed solutions, we propose a heuristic approach: iterating the computation of solutions (here, threading alignments) given the weights and the estimation of optimal weights of the scoring function given these solutions via systematic calibration methods, For our application (i.e., threading), this iterative approach results in structurally meaningful weights that significantly improve performance on both the training and the test data sets, In addition, the optimized parameters show significant improvements on the recognition rate for a grossly enlarged comprehensive benchmark, a modified recognition protocol as well as modified alignment types (local instead of global and profiles instead of single sequences), These results show the general validity of the optimized weights for the given threading program and the associated scoring contributions.

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

protein fold recognition
parameter calibration
linear programming
structure prediction benchmark


quality-driven approximate methods for integrating gis data GIS data distributed in local, state, federal, and private data clearinghouses are being made accessible through the efforts of organizations such as Federal Geographic Data Committee (FGDC) and GeoData.gov. Many database applications, such as disaster management, transportation, and national infrastructure protection, need to access GIS information from such various data sources. In this paper we study how to answer keyword-based spatial queries approximately using information from heterogeneous GIS sources. An example query specifies the region of Orange County and keywords "junior schools," which asks for geospatial objects relevant to junior schools in Orange County. The answers to such a query provided by different sources differ widely in their content and quality. It is computationally expensive to access all the datasets to retrieve all the relevant objects. We develop approximate algorithms for answering such queries based on the local analysis of the query region using space-partitioning techniques. Our methods rank datasets in a partition based on parameters such as their spatial coverage and content matching the query keywords. The quality of the answers keeps improving progressively as we do deeper local analysis. We develop an efficient traversal strategy to maximize the quality refinement within a given time limit. We conducted experiments to evaluate the proposed techniques.

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

gis data integration
heterogeneous data sources


A succinct canonical register automaton model ? A MyhillNerode congruence for register automata. Suppressing unnecessary equality tests on data values leads to a more compact representation of a data language. Canonical register automata that are more succinct than other proposals and well-suited for automata learning.

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

data languages
canonical model
automata theory


Information technology as an infrastructure for patient safety: nursing research needs This article describes the process utilized to create research questions which promote technology as an infrastructure to enable safe nursing practice. Beginning with scenarios of safety problems related to nursing practice, the team identified information technology including hardware, software, and organizational and operational components to help improve the safety aspects addressed in the scenarios. Further discussed are characteristics of technology necessary at each step in the nursing process and finally recommendations are presented for various research questions that would be needed to enable research on the use of the proposed technologies.

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

information technology
hardware
software
patient safety
nursing research


Technology selection and capacity investment under uncertainty Technology selection and capacity investment for electricity generation is analyzed. Firms decide about the portfolio of technologies, capacities and production levels. The equilibrium characterization is analytically presented. Diversification arises even with risk-neutral firms and different technologies.

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


leakage-aware energy synchronization for wireless sensor networks To ensure sustainable operations of wireless sensor systems, environmental energy harvesting has been regarded as the right solution for long-term applications. In energy-dynamic environments, energy conservation is no longer considered necessarily beneficial, because energy storage units (e.g., batteries or capacitors) are limited in capacity and leakage-prone. In contrast to legacy energy conservation approaches, we aim at energy synchronization for wireless sensor devices. The starting point of this work is TwinStar, which uses ultra-capacitor as the only energy storage unit. To efficiently use the harvested energy, we design and implement leakage-aware feedback control techniques to match local and network-wide activity of sensor nodes with the dynamic energy supply from environments. We conduct system evaluation under three typical real-world settings - indoor, outdoor, and mobile backpack under a wide range of system settings. Results indicate our leakage-aware control can effectively utilize energy that could otherwise leak away. Nodes running leakage-aware control can enjoy 70\% more energy than the ones running non-leakage-aware control and application performance (e.g., event detection) can be improved significantly.

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

sensor
point
applications
use
synchronization
batteries
performance
design
energy conservation
control
evaluation
systems
environments
dynamic
storage
energy
event detection

network
activation
mobility
leakage
energy harvest
feedback control
locality
wireless sensor networks
sustainability
device
matching
capacities
operability
ultra-capacitor
dynamic environment
wireless sensor


The impact of farm management on value of management information systems The value of management information systems (MISs) arises from improved managerial decision making and, therefore, will vary from farm to farm. Insight into this variation will be of use not only to farmers who consider (new) MIS investments, but also to companies that design and market MISs. In this study, the impact of farm management on the value of sow-herd MISs is investigated. Within the same research population, farm management is assessed with two conceptually different classification approaches the sociological style of farming approach and the farm-economic management level approach. Management levels of sow farmers turned out to be positively correlated with MIS value (r=0.35, P=0.02). Although farmers with high management levels tend to be better informed anyway than farmers with low management levels, they get more added value from MISs.

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

personal characteristics
pig farming
hog farming
production management
value of information technology


MAP estimation for hyperspectral image resolution enhancement using an auxiliary sensor This paper presents a novel maximum a posteriori estimator for enhancing the spatial resolution of an image using co-registered high spatial-resolution imagery from an auxiliary sensor. Here, we focus on the use of high-resolution panchomatic data to enhance hyperspectral imagery. However, the estimation framework developed allows for any number of spectral bands in the primary and auxiliary image. The proposed technique is suitable for applications where some correlation, either localized or global, exists between the auxiliary image and the image being enhanced. To exploit localized correlations, a spatially varying statistical model, based on vector quantization, is used. Another important aspect of the proposed algorithm is that it allows for the use of an accurate observation model relating the "true" scene with the low-resolutions observations. Experimental results with hyperspectral data derived from the airborne visible-infrared imaging spectrometer are presented to demonstrate the efficacy of the proposed estimator.

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

maximum a posteriori (map) estimation
multisensor
multispectral
panchromatic sharpening


A 147?W, 0.8V and 7.5 (mV/V) LIR regulator for UHF RFID application In this paper a low power consumption regulator has been proposed for ultra high frequency (UHF) RFID tag that has a stable output voltage. The sub-blocks of the regulator are supplied with the elementary stage output of the rectifier. The proposed operational amplifier (OPA) circuit works in class-AB and it is biased by an adaptive biasing circuit. Besides, in the proposed regulator the used bandgap reference (BGR) circuit and the sampling circuit are based on CMOS technology and they have low power consumption. The output of this regulator is 0.81V that has 1.5mV ripple. The values of LIR, PSRR and the efficiency of the regulator are about 7.5 (mV/V), 42.5dB and 53% respectively. Considering 10K? load, the power consumption of the regulator has been calculated as 147?W. The operating frequency is 960MHz and it is simulated in TSMC 0.18?m CMOS technology.

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

bandgap reference (bgr)
operational amplifier (opa)


Optimistic parallelism benefits from data partitioning Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism arising from the use of iterative algorithms that perform computations on elements of worklists. In some irregular applications, the computations on different elements are independent. In other applications, there may be complex patterns of dependences between these computations. The Galois system was designed to exploit this kind of irregular data parallelism on multicore processors. Its main features are (i) two kinds of set iterators for expressing worklist-based data parallelism, and (ii) a runtime system that performs optimistic parallelization of these iterators, detecting conflicts and rolling back computations as needed. Detection of conflicts and rolling back iterations requires information from class implementors. In this paper, we introduce mechanisms to improve the execution efficiency of Galois programs: data partitioning, data-centric work assignment, lock coarsening, and over-decomposition. These mechanisms can be used to exploit locality of reference, reduce mis-speculation, and lower synchronization overhead. We also argue that the design of the Galois system permits these mechanisms to be used with relatively little modification to the user code. Finally, we present experimental results that demonstrate the utility of these mechanisms.

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

optimistic parallelism
data partitioning
locality
lock coarsening

languages
irregular programs
over-decomposition


BizPro: Extracting and categorizing business intelligence factors from textual news articles A BI factor is qualitative evidence that influences market reactions on a company. We developed an intelligent system to extract and categorize BI factors from news. We examined the system's capability in profiling four IT companies BI factors. The system outperformed a benchmark technique in profiling BI factors. Our research addresses an important yet under-explored concern of BI research.

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

bi factor extraction
categorization
online news


Automatic determination about precision parameter value based on inclusion degree with variable precision rough set model The rough set theory provides a powerful approach for attributes reduction and data analysis. The variable precision rough set (VPRS) model, an extension of the original rough set approach, tolerates misclassifications of the training data to some degree, which promotes the applications of rough set theory in inconsistent information systems. However, in most existing algorithms of feature reduction based on VPRS, the precision parameter (?) is introduced as prior knowledge, which restricts their applications because it is not clear how to set the ? value. By studying ?-consistency in the measurement of a decision table and the threshold value of the ?-consistent decision table, this paper presents an algorithm for automatic determination of the precision parameter value from a decision table based on VPRS. At the same time, the precision parameter value from our proposed method is compared with the thresholds from the decision-theoretic rough set (DTRS). The influences of the precision parameter are also discussed on attribute reduction, which shows the necessity of the estimated precision parameter from a decision table. The simulation results including VPRS and other classification methods in real data further indicate that different precision parameter values make a great difference on rules and setting a precise parameter near the threshold value of the ?-consistent decision table can precisely reflect the decision distribution of the decision table.

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

precision parameter value
decision table

decision-theoretic rough set
symmetric variable precision rough set


Inverse heat conduction analysis of quenching process using finite-element and optimization method The calculation of surface heat transfer coefficient during quenching process is one of the inverse heat conduction problems, and it is a nonlinear and ill-posed problem. A new method to calculate the temperature-dependent surface heat transfer coefficient during quenching process is presented, which applies finite-element method (FEM), advanceretreat method and golden section method to the inverse heat conduction problem, and can calculate the surface heat transfer coefficient according to the temperature curve gained by experiment. In order to apply the advanceretreat method to the inverse heat conduction problem during quenching process, the arithmetic is improved, so that the searching interval of optimization can be gained by the improved advanceretreat method. The optimum values of surface heat transfer coefficient can be easily obtained in the searching interval by golden section method. During the calculation process, the phase-transformation volume and phase-transformation latent heat of every element in every time interval can be calculated easily by FEM. The temperature and phase-transformation volume of every element are calculated with the coupling calculation of phase-transformation latent heat.

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

quenching
inverse heat conduction
optimization


Recursive maximum likelihood estimation of time-varying carrier frequency offset for orthogonal frequency-division multiplexing systems A recursive maximum likelihood carrier frequency offset (CFO) estimator is proposed in this work, where redundancy information contained in the cyclic prefix of multiple consecutive orthogonal frequency-division multiplexing (OFDM) symbols is exploited in an efficient recursive fashion. Because the estimator is based on multiple OFDM symbols, the time-varying CFO must be considered. We investigate the effect of time-varying CFO on the performance of the estimator and the trade-off between fast tracking ability and low estimation variance. We show that, without channel noise, the mean squared error (MSE) of estimation due to CFO estimation variation increases approximately quadratically with n, where n is the number of OFDM symbols used for CFO estimation (estimation window size), whereas the MSE due to channel noise decreases proportionally to 1/n (approximately) if the CFO is constant. A closed-form expression of the optimal estimation window size (approximately) is derived by minimizing the MSE caused by both time-varying CFO and channel noise. For wireless systems with time-varying rate of change for CFO, the proposed estimator can be implemented adaptively. In addition, typical optimal estimation window sizes for WiMAX, DVB-SH and MediaFLO systems are evaluated as an example. Copyright (c) 2011 John Wiley & Sons, Ltd.

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


Children's interaction with cross-cultural and multilingual digital libraries: I. Understanding interface design representations This paper reports the results of a study that examined Arabic-speaking children's interaction with the International Children's Digital Library (ICDL). Assessment of the ICDL to Arabic-speaking children as a culturally diverse group was grounded in "representations" and "meaning" rather than in internationalization and localization. The utility of the ICDL navigation controls was judged based on the extent it supported children's navigation. Most of the ICDL representations and their meanings were found to be highly appropriate for older children but inappropriate for younger ones. The design of the ICDL navigation controls was supportive of children's navigation. Recommendations for assessing the cross-cultural usability of the ICDL are made and suggestions for system design improvements are provided. (c) 2006 Elsevier Ltd. 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 O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O 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

children
digital libraries
system design

international children's digital library (icdl)


Evolutionary rule mining in time series databases Data mining in the form of rule discovery is a growing field of investigation. A recent addition to this field is the use of evolutionary algorithms in the mining process. While this has been used extensively in the traditional mining of relational databases, it has hardly, if at all, been used in mining sequences and time series. In this paper we describe our method for evolutionary sequence mining, using a specialized piece of hardware for rule evaluation, and show how the method can be applied to several different mining tasks, such as supervised sequence prediction, unsupervised mining of interesting rules, discovering connections between separate time series, and investigating tradeoffs between contradictory objectives by using multiobjective evolution.

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

knowledge discovery
genetic programming
specialized hardware


On the length of integers in telescopers for proper hypergeometric terms We show that the number of digits in the integers of a creative telescoping relation of expected minimal order for a bivariate proper hypergeometric term has essentially cubic growth with the problem size. For telescopers of higher order but lower degree we obtain a quintic bound. Experiments suggest that these bounds are tight. As applications of our results, we give an improved bound on the maximal possible integer root of the leading coefficient of a telescoper, and the first discussion of the bit complexity of creative telescoping.

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

symbolic summation
hypergeometric identities
zeilberger's algorithm


Defect-Oriented LFSR Reseeding to Target Unmodeled Defects Using Stuck-at Test Sets Defect screening is a major challenge for nanoscale CMOS circuits, especially since many defects cannot be accurately modeled using known fault models. The effectiveness of test methods for such circuits can therefore be measured in terms of the coverage obtained for unmodeled faults. In this paper, we present a new defect-oriented dynamic LFSR reseeding technique for test-data compression. The proposed technique is based on a new output-deviation metric for grading stuck-at patterns derived from LFSR seeds. We show that, compared to standard compression-driven dynamic LFSR reseeding and a previously proposed deviation-based method, higher defect coverage is obtained using stuck-at test cubes without any loss of compression.

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

defect-oriented testing
dynamic reseeding
embedded testing
linear decompressors
static reseeding


A framework and model for evaluating clinical decision support architectures In this paper, we develop a four-phase model for evaluating architectures for clinical decision support that focuses on: defining a set of desirable features for a decision support architecture; building a proof-of-concept prototype; demonstrating that the architecture is useful by showing that it can be integrated with existing decision support systems and comparing its coverage to that of other architectures. We apply this framework to several well-known decision support architectures, including Arden Syntax, GLIF, SEBASTIAN, and SAGE. (c) 2008 Elsevier Inc. All rights reserved.

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

computer-assisted decision support techniques

information systems/organization & administration/standards


Robust Bilateral Filter Using Switching Median Filter This paper proposes a robust bilateral filter which can handle mixed Gaussian and impulsive noise by hybridizing the conventional bilateral filter and the switching median filter. The effectiveness of the proposed method is verified in comparison with other conventional methods by some experiments using the natural digital images.

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

switching median filter
bilateral filter
mixed gaussian and impulsive noise


A parallel circuit differential class-E power amplifier using series capacitance Class-E amplifiers are attractive for wireless handsets because of their high efficiency and simple implementation. However, it requires inductors in its output matching network that are inherently low Q components affecting efficiency and may require significantly large area in fully integrated implementation. In this paper a novel approach of implementing parallel circuit differential class-E amplifier is presented. Instead of using an inductor parallel to the transistor drain of each amplifier, a single capacitor at the single ended side of the balun provides the parallel inductance effect to the switching transistors. As a result, number of inductors required for circuit implementation is reduced which means reduced losses, less area and better tuning of reactance can be achieved. A test circuit is implemented in 0.13 mu m CMOS process. Measurement results verify the validity of the concept. The Power Amplifier achieves 22 dBm output power at 2.4 GHz from a 2.5 V with an overall Power Added Efficiency of 38 %.

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


Subsampling tests of parameter hypotheses and overidentifying restrictions with possible failure of identification We introduce a general testing procedure in models with possible identification failure that has exact asymptotic rejection probability under the null hypothesis. The procedure is widely applicable and in this paper we apply it to tests of arbitrary linear parameter hypotheses as well as to tests of overidentification in time series models given by unconditional moment conditions. The main idea is to subsample classical tests, like for example the Wald or the J test. More precisely, instead of using critical values based on asymptotic theory, we compute data-dependent critical values based on the subsampling technique. We show that under full identification the resulting tests are consistent against fixed alternatives and that they have exact asymptotic rejection probabilities under the null hypothesis independent of identification failure. Furthermore, the subsampling tests of parameter hypotheses are shown to have the same local power as the original tests under full identification. An algorithm is provided that automates the block size choice needed to implement the subsampling testing procedure. A Monte Carlo study shows that the tests have reasonable size properties and often outperform other robust tests in terms of power. (C) 2013 Elsevier Inc. All rights reserved.

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

hypothesis testing
nonlinear moment conditions
partial identification
weak identification


An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers This paper proposes an effective hybrid algorithm based on differential evolution (DE), namely HDE, to solve multi-objective permutation flow shop scheduling problem (MPFSSP) with limited buffers between consecutive machines, which is a typical NP-hard combinatorial optimization problem with strong engineering background. Firstly, to make DE suitable for solving scheduling problems, a largest-order-value (LOV) rule is presented to convert the continuous values of individuals in DE to job permutations. Secondly, after the DE-based exploration, an efficient local search, which is designed based on the landscape of MPFSSP with limited buffers, is applied to emphasize exploitation. Thus, not only does the HDE apply the parallel evolution mechanism of DE to perform effective exploration (global search) in the whole solution space, but it also adopts problem-dependent local search to perform thorough exploitation (local search) in the promising sub-regions. In addition, the concept of Pareto dominance is used to handle the updating of solutions in sense of multi-objective optimization. Moreover, the convergence property of HDE is analyzed by using the theory of finite Markov chain. Finally, simulations and comparisons based on benchmarks demonstrate the effectiveness and efficiency of the proposed HDE.

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

differential evolution
limited buffers
hybrid algorithm
local search

multi-objective flow shop scheduling
exploration and exploitation


A map of dependencies among three-valued logics Three-valued logics arise in several fields of computer science, both inspired by concrete problems (such as in the management of the null value in databases) and theoretical considerations. Several three-valued logics have been defined. They differ by their choice of basic connectives, hence also from a syntactic and proof-theoretic point of view. Different interpretations of the third truth value have also been suggested. They often carry an epistemic flavor. In this work, relationships between logical connectives on three-valued functions are explored. Existing theorems of functional completeness have laid bare some of these links, based on specific connectives. However we try to draw a map of such relationships between conjunctions, negations and implications that extend Boolean ones. It turns out that all reasonable connectives can be defined from a few of them and so all known three-valued logics appear as a fragment of only one logic. These results can be instrumental when choosing, for each application context, the appropriate fragment where the basic connectives make full sense, based on the appropriate meaning of the third truth-value.

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

three-valued logic
truth-table
mv-algebra


understanding mobile web and mobile search use in today's dynamic mobile landscape The term mobile Web is changing. Mobile is traditionally associated with on-the-move, portable and dynamic. However, with the advent of smartphones, an increasing number of users are accessing the mobile Internet via their phone while in more stationary and familiar settings, like at home or at work. This shift in the meaning of mobile is having a significant effect on mobile Web behavior. Designing great mobile Web experiences requires a deeper understanding of the information needs, behaviors and underlying motivations of mobile users. As such, the goal of this work is to study this shift and its impact on mobile Internet access, with a view to determining what this means for the future of the mobile Web and in particular mobile search. In this paper we present the results of an online diary and interview study of 18 active mobile Web users over a 4-week period focusing on how, why, where and in what situations people use the mobile Internet and mobile search. Our findings raise a new set of open research questions and point to a number of implications for enriching the experiences of mobile Web users.

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

mobile web
mobile internet
mobile search

user behavior
design implications
context
diary study


Synthesis of large scale hand-shape databases for biometric applications ? Novel methodology for hand-shape image synthesis. Method for large scale hand-shape database generation. Study of intra-class and inter-class natural variability of hand-shapes. Experiments to show the suitability of the synthetic data. Two novel applications of hand-shape synthetic samples.

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

biometric synthesis
biometric recognition
hand-shape


type-matching clock tree for zero skew clock gating Clock skew minimization is always very important in the clock tree synthesis. Due to clock gating, the clock tree may include different types of logic gates, e.g., AND gates, OR gates, and buffer gates. If the logic gates at the same level are in different types, which have different timing behaviors, the control of clock skew becomes difficult. Based on that observation, in this paper, we present a novel clock tree design style, called type-matching clock tree, to ensure that the logic gates at the same level are in the same type. We prove that any clock control logic can always be transformed to our type-matching clock tree. Then, based on the idea of type-matching clock tree, we propose a zero skew gated clock tree synthesis algorithm. Compared with the industry-strength gated clock tree synthesis, experimental data show that our approach can significantly reduce the clock skew in every process corner with a small penalty on the clock tree area and the clock tree power consumption.

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


A multiscale decomposition approach to detect abnormal vasculature in the optic disc We propose an adaptive vessel segmentation approach to characterize vasculature. We apply AM-FM along with this vessel segmentation method to better capture NVD. We characterize the entire vasculature in the optic disc to detect NVD. This approach is validated on a large dataset and achieves good results.

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


Validated Computation of Certain Hypergeometric Functions We present an efficient algorithm for the validated high-precision computation of real continued fractions, accurate to the last digit. The algorithm proceeds in two stages. In the first stage, computations are done in double precision. A forward error analysis and some heuristics are used to obtain an a priori error estimate. This estimate is used in the second stage to compute the fraction to the requested accuracy in high precision (adaptively incrementing the precision for reasons of efficiency). A running error analysis and techniques from interval arithmetic are used to validate the result. As an application, we use this algorithm to compute Gauss and confluent hypergeometric functions when one of the numerator parameters is a positive integer.

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

continued fractions
hypergeometric functions

algorithms
reliability
validated software


A new intelligent method for minerals segmentation in thin sections based on a novel incremental color clustering An intelligent method for minerals segmentation in thin sections is proposed. We use an incremental color clustering algorithm. Our method works well in both thin sections with and without altered minerals. We create a full automatic and real time segmentation map. Our method can be applied in the NASA's Mars explorers.

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

intelligent mineral segmentation
incremental learning
rgb and hsi color features
image processing


vulnerability in socially-informed peer-to-peer systems The recent increase in the volume of recorded social interactions has the potential to enable a large class of innovative social applications and services. The decentralized management of such social information as a social graph distributed on a user-contributed peer-to-peer network is appealing due to privacy concerns. This paper studies the vulnerability of such a peer-to-peer system to attacks staged by malicious users who try to manipulate the graph or by malicious peers who try to manipulate the mining of the social graph. We discuss the effects and limitations of such attacks and we show experimentally how the distribution of the social data onto peers affects the system's resilience.

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

security
peer-to-peer
socially-aware applications
social data management


a generic approach for on-the-fly adding of context-aware features to existing websites More and more, mobile devices act as personal information managers and are able to obtain rich contextual information on the user's environment. Mobile, context-aware web applications can exploit this information to better address the needs of mobile users. Currently, such websites are either developed separately from their associated desktop-oriented version, or both versions are created simultaneously by employing methodologies that support multi-platform context-aware websites, requiring an extensive engineering effort. While these approaches provide a solution for developing new websites, they go past the plethora of existing websites. To address this issue, we present an approach for enhancing existing websites on-the-fly with context-aware features. We first discuss the requirements for such an adaptation process, and identify applicable adaptation methods to realize context-aware features. Next, we explain our generic approach, which is grounded in the use of semantic information extracted from existing websites. Finally, we present a concrete application of our approach that is based on the SCOUT framework for mobile and context-aware application development.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 web
client-side adaptation
semantic web
context-aware


Data-mining based SQL injection attack detection using internal query trees We propose a framework to detect SQL injection attacks at database level. To use classification algorithm, internal query trees transform into feature vectors. Our feature extraction methods use syntactic and semantic features of query trees. Our feature transformation methods use combined statistical models. Experimental results using query trees of PostgreSQL validate our proposal.

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


Parallel performance of an IB-LBM suspension simulation framework We present performance results from ficsion, a general purpose parallel suspension solver, employing the Immersed-Boundary lattice-Boltzmann method (IB-LBM). ficsion is built on top of the open-source LBM framework Palabos, making use of its data structures and their inherent parallelism. We describe in brief the implementation and present weak and strong scaling results for simulations of dense red blood cell suspensions. Despite its complexity the simulations demonstrate a fairly good, close to linear scaling, both in the weak and strong scaling scenarios.

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


Delineating fluid-filled region boundaries in optical coherence tomography images of the retina We evaluate the ability of a deformable model to yield accurate shape descriptions of fluid-filled regions associated with age-related macular degeneration. Calculation of retinal thickness and volume by the current optical coherence tomography (OCT) system includes fluid-filled regions or lesions along with actual retinal tissue. In order to quantify these lesions independently from the retinal tissue, they must be outlined. A deformable model was applied to OCT images of retinas demonstrating cystoids and subretinal fluid spaces. Several implementation issues were addressed in order to choose appropriate parameters. The use of a nonlinear anisotropic diffusion filter to suppress speckle noise while at the same time preserving the edges of the original image was explored. Once the contours of the lesions were outlined, quantitative analysis of the surface area and volume of the lesions was performed. The deformable model could accurately outline fluid-filled regions within the retina. The detection method tested proved effective in capturing the complexity of fluid-filled regions in OCT images. Deformable models combined with nonlinear anisotropic diffusion filtering show promise in the detection of retinal features of interest for diagnosis in clinical OCT images. Thus, fluid-filled region detection may significantly aid in analysis of treatments and diagnosis.

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

deformable models
optical coherence tomography
retina

active contour models
age-related macular degeneration
edge detection
lesion volume
ophthalmology
snakes


Optimizing computations for effective block-processing Block-processing can decrease the time and power required to perform any given computation by simultaneously processing multiple samples of input data. The effectiveness of block-processing can be severely limited, however, if the delays in the dataflow graph of the computation are placed suboptimally. In this paper we investigate the application of retiming for improving the effectiveness of block-processing in computations. In particular, we consider the k-delay problem: Given a computation dataflow graph and a positive integer k, we wish to compute a retimed computation graph in which the original delays have been relocated so that k data samples can be processed simultaneously and fully regularly. We give an exact integer linear programming formulation for the k-delay problem. We also describe an algorithm that solves the k-delay problem fast in practice by relying on a set of necessary conditions to prune the search space. Experimental results with synthetic and random benchmarks demonstrate the performance improvements achievable by block-processing and the efficiency of our algorithm.

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

combinatorial optimization
computation dataflow graphs
embedded systems
high-level synthesis
scheduling
vectorization


The Price of Resiliency: a Case Study on Sorting with Memory Faults We address the problem of sorting in the presence of faults that may arbitrarily corrupt memory locations, and investigate the impact of memory faults both on the correctness and on the running times of mergesort-based algorithms. To achieve this goal, we develop a software testbed that simulates different fault injection strategies, and perform a thorough experimental study using a combination of several fault parameters. Our experiments give evidence that simple-minded approaches to this problem are largely impractical, while the design of more sophisticated resilient algorithms seems really worth the effort. Another contribution of our computational study is a carefully engineered implementation of a resilient sorting algorithm, which appears robust to different memory fault patterns.

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

memory models
computing with unreliable information
experimental algorithmics


Numerical modelling of contaminant transport in coastal aquifers This paper employs a two-dimensional variable density flow and transport model to investigate the transport of a dense contaminant plume in an unconfined coastal aquifer. Experimental results are also presented to show the contaminant plume in a freshwater-seawater flow system. Both the numerical and experimental results suggest that the neglect of the seawater interface does not noticeably affect the horizontal migration rate of the plume before it reaches the interface. However, the contaminant will travel further seaward and part of the solute mass will exit under the sea if the higher seawater density is not included. If the seawater density is included, the contaminant will travel upwards towards the beach along the freshwater-saltwater interface as shown experimentally. Neglect of seawater density, therefore, will result in an underestimate of solute mass rate exiting around the coastline. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.

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

contaminant transport
variable density
numerical modelling
unconfined coastal aquifer


Learning management systems and cloud file hosting services: A study on students acceptance Why students use Dropbox instead of in-house LMS? Approach based on the Technology Acceptance Model (TAM) 3 factors. Attitude toward using technology, Perceived ease of use and Perceived usefulness. The perceived ease of use of cloud file hosting services is above that of LMS tools. Same applies to perceived usefulness and attitude toward using Dropbox.

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

learning management systems
technology acceptance model
attitude toward using technology
perceived ease of use
perceived usefulness


Featherweight X10: A Core Calculus for Async-Finish Parallelism We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analyses for languages with async-finish parallelism, and for tractable proofs of correctness. For example, we give a short proof of the deadlock-freedom theorem of Saraswat and Jagadeesan. Our main contribution is a type system that solves the open problem of context-sensitive may-happen-in- parallel analysis for languages with async-finish parallelism. We prove the correctness of our type system and we report experimental results of performing type inference on 13,000 lines of X10 code. Our analysis runs in polynomial time, takes a total of 28 seconds on our benchmarks, and produces a low number of false positives, which suggests that our analysis is a good basis for other analyses such as race detectors.

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

algorithms
theory
verification
operational semantics
static analysis


The many-body Wigner Monte Carlo method for time-dependent ab-initio quantum simulations The aim of ab-initio approaches is the simulation of many-body quantum systems from the first principles of quantum mechanics. These methods are traditionally based on the many-body Schrdinger equation which represents an incredible mathematical challenge. In this paper, we introduce the many-body Wigner Monte Carlo method in the context of distinguishable particles and in the absence of spin-dependent effects. Despite these restrictions, the method has several advantages. First of all, the Wigner formalism is intuitive, as it is based on the concept of a quasi-distribution function. Secondly, the Monte Carlo numerical approach allows scalability on parallel machines that is practically unachievable by means of other techniques based on finite difference or finite element methods. Finally, this method allows time-dependent ab-initio simulations of strongly correlated quantum systems. In order to validate our many-body Wigner Monte Carlo method, as a case study we simulate a relatively simple system consisting of two particles in several different situations. We first start from two non-interacting free Gaussian wave packets. We, then, proceed with the inclusion of an external potential barrier, and we conclude by simulating two entangled (i.e. correlated) particles. The results show how, in the case of negligible spin-dependent effects, the many-body Wigner Monte Carlo method provides an efficient and reliable tool to study the time-dependent evolution of quantum systems composed of distinguishable particles.

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

quantum many-body problem
time-dependent wigner equation
monte carlo methods
ab-initio


SciScope: a participatory geoscientific web application The combination of low-cost in situ sensors, internet connectivity, and commodity computing is changing earth science research. This unprecedented data availability is enabling science synthesis; studies that span disciplines, bridge local field, modeling and remote sensing methodologies and/or span local, regional, and global scales. Data discovery, retrieval, and heterogeneity act as cyberinfrastructure barriers to synthesis. Much of the available data is discovered by serendipity or word of mouth from independent, disconnected nodes with different interfaces and semantics. Before scientific analysis, data must be harmonized to a common understandable format. As the number of publishers increase, particularly when the publishers are small groups, this problem can only worsen. We have been developing SciScope (www.sciscope.org), a search tool that aggregates data set information and presents a simple map-based interface across diverse data publishers. SciScope unites data catalog, semantic, structural and syntactic mediation, and Geographical Information Systems (GIS) functions. The current catalog contains 1.7 million observation sites from five different sources in the United States and Australia. SciScope encourages participatory science. Data consumers can find and retrieve data sets simply as well as annotate data sets. Data contributors can register and upload data sets as well as extend the semantic mediation to enable richer data searches. SciScopes can be federated to bridge between science communities that may not be willing or able to share a single catalog. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

data discovery
geographical information systems

semantic computing
web mashups
sensor networks
web 2.0
user participation


Combined double-diffusive convection and radiation in a square enclosure filled with semitransparent fluid A 2D numerical assessment of coupled double diffusive convection and volumetric radiation in a differentially heated square enclosure filled with a gray fluid participating in absorption, emission and non-scattering is carried out. Temperatures and concentrations are imposed at the vertical walls, whereas the horizontal walls are insulated and impermeable. All cavity walls are assumed to be opaque, diffuse and gray. The governing equations are solved by a hybrid scheme with multiple relaxation time lattice Boltzmann (MRT-LBM) and finite difference method (FDM). The velocity field is computed by D2Q9 MRT model while the temperature field is determined by resolution of the energy equation using FDM. The radiative source term in the energy equation is calculated by the discrete ordinates method (DOM) with 58 quadrature. A parametric study illustrating the influence of the buoyancy number (N) and the wall emissivity (epsilon(i)) on the flow field and the heat and mass transfer is performed. Results are presented in terms of isotherms, streamlines, iso-concentrations, Nusselt and Sherwood numbers. Generally the isotherms and iso-concentrations are inclined in the core cavity, the flow is more stabilized in presence of cooperating flow case but opposing flows are found to be a catalyser of the multi-cellular structures. (C) 2012 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

numerical analysis
heat transfer
double diffusive natural convection
lattice boltzmann method
discrete ordinate method


Validation of an approach for improving existing measurement frameworks Software organizations are in need of methods to understand, structure, and improve the data they are collecting. We have developed an approach for use when a large number of diverse metrics are already being collected by a software organization [1], [2]. The approach combines two methods. One looks at an organization's measurement framework in a top-down goal-oriented fashion and the other looks at it in a bottom-up data-driven fashion. The top-down method is based on a measurement paradigm called Goal-Question-Metric (GQM). The bottom-up method is based on a data mining technique called Attribute Focusing (AF). A case study was executed to validate this approach and to assess its usefulness in an industrial environment. The top-down and bottom-up methods were applied in the customer satisfaction measurement framework at the IBM Toronto Laboratory. The top-down method was applied to improve the customer satisfaction (CUSTSAT) measurement from the point of view of three data user groups. It identified several new metrics for the interviewed groups, and also contributed to better understanding the data user needs. The bottom-up method was used to gain new insights into the existing CUSTSAT data. Unexpected associations between key variables prompted new business insights, and revealed problems with the process used to collect and analyze the CUSTSAT data. This paper uses the case study and its results to qualitatively compare our approach against current ad hoc practices used to improve existing measurement frameworks.

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

software metrics
goal-oriented measurement
knowledge discovery
experimental validation
method evaluation


Visualization of dynamic stress and strain fields in plate vibrations A computer program for the visualization of dynamic fields of displacement, strain, stress, and moment in plate vibration was developed. The simulated fields are animated to enhance learning of vibrations by university undergraduates. The software could be used for effective computer-aided teaching in classroom or laboratory lessons. It is suitable for undergraduate and graduate courses in structural mechanics and computer-aided engineering. (C) 1999 John Wiley & Sons, Inc.

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

education
vibration simulation
animation


Teaching visual aspects in an introductory computer graphics course Computer science students contemplating a career in graphics need to develop a visual sense, but traditional course topics do not meet this need. Visual analysis is a teaching technique developed for computer science instructors that helps impart this ability. Requiring a minimal amount of classroom time, visual analysis imparts a broad knowledge of visual effects not covered in a traditional introductory course. Through the use of a few visual cues, students learn to visually identify surface algorithms, shaders and lighting techniques. An interactive software package called TERA (Tool for Exploring Rendering Algorithms) provides nearly a million image combinations that students can use to practice their visual identification skills. As a result, students gain a broader knowledge of graphics and become better program developers.

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

algorithm visualization
computer graphics education


Semantic errors in SQL queries: A quite complete list We investigate classes of SQL queries which are syntactically correct, but certainly not intended, no matter for which task the query was written. For instance, queries that are contradictory, i.e. always return the empty set, are obviously not intended. However, current database management systems (DBMS) execute such queries without any warning. In this paper, we give an extensive list of conditions that are strong indications of semantic errors. Of course, questions like the satisfiability are in general undecidable, but a significant subset of SQL queries can actually be checked. We believe that future DBMS will perform such checks and that the generated warnings will help to develop application programs with fewer bugs in less time. (c) 2005 Elsevier Inc. All rights reserved.

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

databases
semantic errors
logical errors
software correctness
static analysis
teaching
database courses
sql exams


On the desirability of mechanizing calculational proofs Dijkstra argues that calculational proofs are preferable to traditional pictorial and/or verbal proofs. First, due to the calculational proof format, incorrect. proofs are less likely. Second, syntactic considerations (letting the "symbols do the work") have led to an impressive array of techniques for elegant proof construction. However, calculational proofs are not formal and are not flawless. Why not make them formal and check them mechanically? (C) 2001 Elsevier Science B.V. All rights reserved.

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

mechanical reasoning
automatic theorem proving
formal methods


Back analysis of slope failure with Markov chain Monte Carlo simulation Field observed performance of slopes can be used to back calculate input parameters of soil properties and evaluate uncertainty of a slope stability analysis model. In this paper, a new probabilistic method is proposed for back analysis of slope failure. The proposed back analysis method is formulated based on Bayes theorem and solved using the Markov chain Monte Carlo simulation method with a MetropolisHasting algorithm. The method is very flexible as any type of prior distribution can be used. The method is also computationally efficient when a response surface method is employed to approximate the slope stability model. An illustrative example of back analysis of a hypothetical slope failure is presented. Effects of jumping distribution functions and number of samples on the efficiency of Markov chains are studied. It is found that the covariance matrix of the jumping function can be set to be one half of the covariance of the prior distribution to achieve a reasonable acceptance rate and that 80,000 samples seem to be sufficient to obtain robust posterior statistics for the example. It is also found that the correlation of cohesion and friction angle of soil does not affect the posterior statistics and the remediation design of the slope significantly, while the type of the prior distribution seems to have much influence on the remediation design.

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

slope stability
back analysis
monte carlo simulation


Reactivity-based toxicity modelling of five-membered heterocyclic compounds: Application to Tetrahymena pyriformis A diverse set of 57 heterocyclic organic chemicals, consisting of a five-membered unsaturated ring of four carbon atoms and one oxygen (furans), or sulfur (thiophenes), or nitrogen (pyrroles) were evaluated for reactivity with thiol and acute aquatic toxicity assays using glutathione (GSH) as a model nucleophile and the ciliate Tetrahymena pyriformis, respectively. Reactivity was quantified by the RC50 value, the concentration of test compound that produced 50% reaction of the GSH thiol groups in 2 hours. Under standard conditions, RC50 values are mathematically proportional to reciprocal rate constants. Toxicity was quantified by the IGC50, the concentration of the test compound that produces 50% inhibition of population growth in 40 hours. Pyrroles with polarized ,-unsaturated substructures were found to be non-reactive with GSH and did not exhibit excess toxicity in the Tetrahymena assay. In contrast, those furans and thiophenes with polarized ,-unsaturated substructures were reactive with GSH via the Michael addition mechanism and did exhibit excess acute aquatic toxicity in Tetrahymena. For furans and thiophenes, reactivity and toxicity varied with the number, type, and location on the ring of the -bond-containing polarized moieties. Comparisons of reactivity and toxicity potency between furan and thiophene derivatives revealed furans to be twice as potent as thiophenes. QSAR analysis revealed that aquatic toxicity IGC50 to Tetrahymena is correlated with RC50 values: log ([image omitted]) = 1.13 log ([image omitted]) + 1.43; n = 23, r2 = 0.815, r2(adj) = 0.806, s = 0.41, F = 92.

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

thiol reactivity
tetrahymena pyriformis toxicity


Magneto-Optic Imaging for Aircraft Skins Inspection: A Probability of Detection Study of Simulated and Experimental Image Data The increasing fleet of aging aircrafts has resulted in an increasing demand for cost effective nondestructive evaluation (NDE) techniques that are accurate, reliable, and easy to use. Magneto-Optic Imaging (MOI) is such a technique, which has gained wide acceptance for detection of both surface and subsurface defects in multi-layer aircraft structures. The main advantage of MOI is rapid inspection and ease of interpreting image data in contrast to complex impedance signals from conventional eddy current instruments. One missing piece of the puzzle for advanced MOI systems is how to quantitatively analyse the MO images, and understand the detectability limits when image data are acquired under varying operational conditions. This paper presents a probability of detection (POD) study that is conducted using both simulation model-predicted and experimental MO image data. Simulated panels from a 3-D FEM model and experimental panels with machined defects are used to generate data for interpretation by human inspectors or automated systems, and subsequently for POD studies. The POD curves demonstrate the merits in opti-mizing inspection parameters that maximized the performance of current MOI systems. Parameters quantifying the detectability of MO image data using skewness functions are also presented and discussed.

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

aircraft safety and reliability
magneto-optic imaging


Das Zusammenspiel von Projektsteuerung und interorganisationalem Lernen und dessen Effekt auf kulturelle Unterschiede in globalen ISE-Outsourcing-Projekten mit mehreren Dienstleistern Das Management von weltweit verteilten Softwareentwicklungsprojekten stellt insbesondere in Bezug auf den Umgang mit kulturellen Unterschieden eine besondere Herausforderung dar. Bisherige Studien konnten zwar den positiven Effekt von verschiedenen Steuerungsmechanismen und interorganisationalem Lernen zeigen, lieen die Interaktion zwischen diesen Mechanismen aber weitestgehend unbercksichtigt. Die vorliegende Studie verwendet eine explorative Einzelfallstudie um eben dieses Zusammenspiel von formalen und informellen Steuerungsmechanismen sowie von interorganisationalem Lernen sowie dessen Effekt auf kulturelle Unterschiede zu untersuchen. Ein zentrales Ergebnis unserer Analyse ist, dass sich der Einfluss von informellen Steuerungsmechanismen und interorganisationalem Lernen auf formale Steuerungsmechanismen ber die Zeit verndert: kurzfristig werden zunchst operative Informationen zur Feinsteuerung des formalen Managements zur Verfgung gestellt; mittel- bis langfristig wird dann aber eine Reduzierung des formalen Managementaufwandes ermglicht.

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

kulturelle unterschiede
formale steuerungsmechanismen

global verteilte entwicklung von informationssystemen


Biophysical constraints on neuronal branching We investigate rules that govern neuronal arborization, specifically the local geometry of the bifurcation of a neurite into its sub-branches. In the present study we set out to determine the relationship between branch diameter and angle. Existing theories are based on minimizing a neuronal volume cost function, or, alternatively, on the equilibrium of mechanical tension forces, which depend on branch diameters. Our experimental results utilizing two-dimensional cultured neural networks partly corroborate both the volume optimization principles and the tension theory. Deviation from pure tension forces equilibrium is explained by an additional force exerted by the anchoring of the junction to the substrate.

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


Parallelization of entanglement-resistant multi-prover interactive proofs We study classical multi-prover interactive proofs which are sound also against entangled provers. Such interactive proofs have been studied widely in quantum complexity theory. We prove such interactive proofs can be parallelized to two rounds by adding one prover.

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

computational complexity
quantum computing
interactive proof
quantum nonlocality


Fixation or inspiration? A meta-analytic review of the role of examples on design processes We conducted a meta-analysis of studies examining the effect of examples on design. Examples led individuals to explore the problem space more narrowly and deeply. The presence of example reduced the variety of the design solution ideas. The presence of example improved the novelty and quality of the solution ideas. Providing one single and uncommon example facilitated the design processes most.

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

creativity
innovation
design process(es)
design strategy


Decision support for preference elicitation in multi-attribute electronic procurement auctions through an agent-based intermediary It proposes a preference elicitation framework. It enables to utilize auctioneers' preferences information in a flexible way It proposes a method for selecting a representative preference model. It designes an intelligent buyer agent (i.e., e-buyer) to implement the framework.

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

electronic procurement
preference elicitation

multi-criteria decision making
disaggregation approach


Nonlinear systems control using self-constructing wavelet networks This paper describes a self-constructing wavelet network (SCWN) controller for nonlinear systems control. The proposed SCWN controller has a four-layer structure. We adopt the orthogonal wavelet functions as its node functions. An online learning algorithm, structure learning and parameter learning, allows the dynamic determining of the number of wavelet bases, and adjusting the shape of the wavelet bases and the connection weights. The SCWN controller is a highly autonomous system. Initially, there are no hidden nodes. They are created and begin to grow as learning proceeds. Computer simulations have been conducted to illustrate the performance and applicability of the proposed learning scheme.

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

temperature control
wavelet neural networks
back-propagation
degree measure


Development planning based on interoperable agent driven simulation We provided a description of researches on agent based simulation, human behavioral models and interoperability. We listed some previous experiences concerning M&S for operational planning and dynamic crisis management. We provided some results derived from CAPRICORN project.

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

intelligent agents computer generated forces (ia_cgf)

interoperable simulation crisis management


Landscape futures analysis: Assessing the impacts of environmental targets under alternative spatial policy options and future scenarios Environmental targets are often used in planning for sustainable agricultural landscapes but their impacts are rarely known. In this paper we introduce landscape futures analysis as a method which combines linear programming optimisation with scenario analysis in quantifying the environmental, economic, and social impacts associated with achieving environmental targets, on a landscape scale. We applied the technique in the Lower Murray in southern Australia. Landscape futures models were used to identify specific geographic locations in the landscape for six natural resource management (NRM) actions such that regional environmental targets are achieved. The six potential NRM actions that may be undertaken to achieve environmental targets include remnant vegetation management, ecological restoration, conservation farming, deep-rooted perennials, and the production of biomass and biofuels feedstock for renewable energy generation. We developed landscape futures under four alternative spatial prioritisation policy options and four future climate and commodity price scenarios. The impacts of each landscape future were calculated across a range of environmental, economic, and social indicators. The external drivers, climate change and commodity prices, and internal decisions such as policy options for spatially prioritising NRM actions, both have a strong influence on the costs and benefits of achieving environmental targets. Illustrative results for the cleared agricultural areas in the Mallee region indicate that whilst achieving targets can have substantial environmental benefits, it requires large areas of land use and land management change, and is likely to be costly (up to $348.5M per year) with flow-on impacts on the regional economy and communities. Environmental targets can be achieved more cost-effectively through spatial planning. Costs can be further reduced if markets are established for carbon, biomass, and biofuels to enable landholders to generate income from undertaking NRM. Landscape futures analysis is an effective tool for supporting the strategic regional NRM policy and planning decisions of how best to set and achieve environmental targets.

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

regional
futures analysis
scenarios
optimisation

landscape planning
gis
integrated assessment


Visualization of Advection-Diffusion in Unsteady Fluid Flow Advection has been the standard transport mechanism in flow visualization. Diffusion, in contrast, has not been considered important in visual flow field analysis so far, although it is inherent to many physical processes. We present a novel technique that allows for interactive 3D visualization of both advection and diffusion in unsteady fluid flow. We extend texture-based flow visualization, which is advection-oriented, by diffusion. Our finite volume approach based on WENO (weighted essentially non-oscillatory) reconstruction is well parallelizable and features low numerical diffusion at interactive rates. Our scheme contributes to three different applications: (a) high-quality dye advection at low numerical diffusion, (b) physically-based dye advection accounting for diffusivity of virtual media, and (c) visualization of advection-diffusion fluxes in physical media where the velocity field is accompanied by a concentration field. Interactive rendering of the virtual dye is accomplished by ray casting. We apply our GPU implementation to CFD examples of thermal convection and evaporation phenomena.

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

i.6.6 [simulation and modeling]: simulation output analysis

j.2 [physical sciences and engineering]: physics


Efficient Convertible Undeniable Signatures with Delegatable Verification Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a signature, and hence allow the signer to control the verifiability of his signatures. Convertible undeniable signatures, introduced by Boyar, Chaum, Damgard, and Pedersen, furthermore allow the signer to convert signatures to publicly verifiable ones by publicizing a verification token, either for individual signatures or for all signatures universally. In addition, the original definition allows the signer to delegate the ability to prove validity and convert signatures to a semi-trusted third party by providing a verification key. While this functionality is implemented by the early convertible undeniable signature schemes, most recent schemes do not consider this form of delegation despite its practical appeal. In this paper we present an updated definition and security model for schemes allowing delegation, and furthermore highlight a new essential security property, token soundness, which is not formally treated in the previous security models for convertible undeniable signatures. We then propose a new convertible undeniable signature scheme. The scheme allows delegation of verification and is provably secure in the standard model assuming the computational co-Dillie-Hellman problem, a closely related problem, and the decisional linear problem are hard. Furthermore, unlike the recently proposed schemes by Phong et al. and Huang et al., our scheme provably fulfills all security requirements while providing short signatures.

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

universal/selective convertibility
provable security


NCASH: NFC Phone-Enabled Personalized Context Awareness Smart-Home Environment Near Field Communication (NFC) is a two-way communication technology based on radio frequency identification (RFID), which in recent years has become one of the most popular devices in a great variety of applications. The NFC-equipped phone (NFC phone) that embeds NFC technology into a cellular phone makes it increasing attractive for business uses, such as for making payments or ticketing. This paper presents a novel architecture for NFC phone-driven, personalized, context-aware smart spaces. With this architecture, users can employ the phone, which carries predefined personal desires, to control devices, such as home appliances. The appliances are automatically controlled and driven in response to a request sent from the phone by using predefined ontology and rule-based reasoning. We also implement a prototype to demonstrate the feasibility of the architecture, evaluate its performance, and show its efficiency.

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

nfc phone
personalization
smart home environment


Scalable Video Multicast With Adaptive Modulation and Coding in Broadband Wireless Data Systems Future mobile broadband networks are characterized with high data rate and improved coverage, which will enable real-time video multicast and broadcast services. Scalable video coding (SVC), combined with adaptive modulation and coding schemes (MCS) and wireless multicast, provides an excellent solution for streaming video to heterogeneous wireless devices. By choosing different MCSs for different video layers, SVC can provide good video quality to users in good channel conditions while maintaining basic video quality for users in bad channel conditions. A key issue to apply SVC to wireless multicast streaming is to choose appropriate MCS for each video layer and to determine the optimal resource allocation among multiple video sessions. We formulate this problem as total utility maximization, subject to the constraint of available radio resources. We prove that the formulated problem is NP-hard and propose an optimal, two-step dynamic programming solution with pseudo-polynomial time complexity. Simulation results show that our algorithm offers significant improvement on the video quality over a naive algorithm and an adapted greedy algorithm, especially in the scenarios with multiple real video sequences and limited radio resources.

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

4g
adaptive modulation and coding (amc)
multicarrier wireless network
scalable video coding (svc)


BPMN MUSIM: Approach to improve the domain experts efficiency in business processes modeling for the generation of specific software applications Improve the efficiency of domain experts that use BPMN to model processes. Multi-domain approach for business process modeling by domain experts. Use business process models made by domain experts for automatic code generation. Reducing the cost of developing software used to assist domain experts in their daily tasks.

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

domain experts systems
modeling tools
software generation


A case-based reasoning system with the two-dimensional reduction technique for customer classification Many studies have tried to optimize parameters of case-based reasoning (CBR) systems. Among them, selection of appropriate features to measure similarity between the input and stored cases more precisely, and selection of appropriate instances to eliminate noises which distort prediction have been popular. However, these approaches have been applied independently although their simultaneous optimization may improve the prediction performance synergetically. This study proposes a case-based reasoning system with the two-dimensional reduction technique. In this study, vertical and horizontal dimensions of the research data are reduced through our research model, the hybrid feature and instance selection process using genetic algorithms. We apply the proposed model to a case involving real-world customer classification which predicts customers buying behavior for a specific product using their demographic characteristics. Experimental results show that the proposed technique may improve the classification accuracy and outperform various optimized models of the typical CBR system.

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

case-based reasoning
feature selection
customer relationship management


parallel view-dependent tessellation of catmull-clark subdivision surfaces We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends the concept of breadth-first subdivision, which up to this point has only been applied to parametric patches. While mesh representations designed for a CPU often involve pointer-based structures and irregular perelement storage, neither of these is well-suited to GPU execution. To solve this problem, we use a simple yet effective data structure for representing a subdivision mesh, and design a careful algorithm to update the mesh in a completely parallel manner. We demonstrate that in spite of the complexities of the subdivision procedure, real-time tessellation to pixel-sized primitives can be done. Our implementation does not rely on any approximation of the limit surface, and avoids both subdivision cracks and T-junctions in the subdivided mesh. Using the approach in this paper, we are able to perform real-time subdivision for several static as well as animated models. Rendering performance is scalable for increasingly complex models.

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

adaptive surface subdivision
gpgpu
catmull-clark


Simplified Relative Model to Measure Visual Fatigue in a Stereoscopy In this paper, we propose a quantitative metric of measuring the degree of the visual fatigue in a stereoscopy. To the best of our knowledge, this is the first simplified relative quantitative approach describing visual fatigue value of a stereoscopy. Our experimental result shows that the correlation index of more than 98% is obtained between our Simplified Relative Visual Fatigue (SRVF) model and Mean Opinion Score (MOS).

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

simplified relative visual fatigue model


Structural and electron properties of the highest epoxygenated fullerene C60O30, a DFT study Ab initio HartreeFock (HF) and density functional theory (DFT) calculations were carried out to determine the structural and electronic properties of the highest epoxygenated fullerenes C60O30. For comparison, other fullerene oxides C60O29, C60O3, C60O2 and C60O were also studied. The highly symmetrical Ih structure of the parent C60 is reserved in C60O30 and C60O30 was calculated to be a nonpolar molecule. It was demonstrated that C60O30 should be more stable than other C60 oxides such as C60O29, C60O3, C60O2 and C60O. Compared with C60, it is less possible for C60O30 to accept or donate electrons from the reduced EAs and enhanced IPs. The IR active modes and harmonic vibrational frequencies of C60O30 were also discussed.

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


Managing approximation models in collaborative optimization Collaborative optimization (CO), one of the multidisciplinary design optimization techniques, has been credited with guaranteeing disciplinary autonomy while maintaining interdisciplinary compatibility due to its bi-level optimization structure. However, a few difficulties caused by certain features of its architecture have been also reported. The architecture, with discipline-level optimizations nested in a system-level optimization, leads to considerably increased computational time. In addition, numerical difficulties such as the problem of slow convergence or unexpected nonlinearity of the compatibility constraint in the system-level optimization are known weaknesses of CO. This paper proposes the use of an approximation model in place of the disciplinary optimization in the system-level optimization in order to relieve the aforementioned difficulties. The disciplinary optimization result, the optimal discrepancy function value, is modeled as a function of the interdisciplinary target variables, and design variables of the system level. However, since this approach is hindered by the peculiar form of the compatibility constraint, it is hard to exploit well-developed conventional approximation methods. In this paper, neural network classification is employed as a classifier to determine whether a design point is feasible or not. Kriging is also combined with the classification to make up for the weakness that the classification cannot estimate the degree of infeasibility. In addition, for the purpose of enhancing the accuracy of the predicted optimum, this paper also employs two approximation management frameworks for single-objective and multi-objective optimization problem in the system-level optimization. The approximation is continuously updated using the information obtained from the optimization process. This can cut down the required number of disciplinary optimizations considerably and lead to a design (or Pareto set) near to the true optimum (or true Pareto set) of the system-level optimization.

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

collaborative optimization
neural network classification


A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code In this letter, we first introduce a stronger notion of the optimistic achievable coding rate and discuss a coding theorem. Next, we give a necessary and sufficient condition under which the coding rates of all the optimal FF codes asymptotically converge to a constant.

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

information spectrum
general source
ff code