Design of microvascular flow networks using multi-objective genetic algorithms A multi-objective genetic algorithm is used to design 2D and 3D microvascular networks embedded in bio-mimetic self-healing/self-cooling polymeric materials. Various objective functions and constraints are considered, ranging from flow efficiency and homogeneity to network redundancy and void volume fraction. The design variables include the network topology defined over a template and the microchannel diameters chosen among a finite set of values. The effect of network redundancy, template geometry and microchannel diameters on the Pareto-optimal fronts generated by the genetic algorithm is investigated.

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

microvascular network
multi-objective optimization
bio-mimetic material


Virtual prototyping of mold design: geometric mouldability analysis for near-net-shape manufactured parts by feature recognition and geometric reasoning This paper presents a virtual prototyping (VP) approach for geometric mouldability analysis of near-net-shape manufactured parts. The geometric mouldability of a part depends on the geometry of the part and is affected by the number and types of undercut features. A virtual prototype (VP) of a mold, which is a realistic digital product model, is generated by combining automated and interactive approaches to evaluate the mouldability of a part in the early stages of the product development cycle. The automated approaches for generating a VP are proposed to construct the parting surface, cores and cavity of the mold based on the recognized undercut features. Interaction with the VP in the virtual reality environment allows the designers to evaluate the mouldability of a part in an intuitive way. A new volume-based feature recognition method and data structure using non-directional blocking graph (NDBG) have been developed to recognize both isolated and interacting undercut features in a uniform way. Firstly, a set of potential undercuts are generated by performing the regularized difference between the part and its convex hull. The optimal parting direction is then determined by minimizing the number of undercuts. Finally, undercut features are identified from a set of potential features with respect to the optimal parting direction. The potential features of an interacting feature are generated by two stages: volume decomposition, in which the volume to be recognized is decomposed into convex cells by intersecting it with half spaces of its faces having concave edges; and reconstruction of features, in which potential features are reconstructed through systematically connecting the small cells using NDBG of the cells and the part. Moreover, multiple interpretations of an interacting feature can be easily generated by simply subtracting potential external undercut features from each other in different orders. A system configuration for the proposed VP has been developed and implemented using available virtual reality technologies.

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

virtual prototyping
mold design
feature recognition
geometric reasoning


GENERATING A FAST ROI MASK USING APPROXIMATE DIVISION OF CODE BLOCKS IN JPEG2000 In the current methods of ROI coding methods, after all the pixels have been scanned in order and the ROI is distinguished, an ROI mask is generated. So, to support a dynamic Region-of-Interest (ROI) in JPEG2000, fast ROI mask generation is needed. Our method scans 4 pixels of the corners in one code block and then, based on the information, scans the edges from the corners to get the boundaries of the ROI and background. This information consists of distributed information about the ROI and two coordinates of the pixels, which are the points where the edges and boundaries meet. This information is transmitted to the encoder and supported for fast ROI mask generation. There are no great differences between the proposed method and the existing methods in terms of quality, but the proposed method showed superiority in speed.

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


Developing a service robot for a children's library: A design-based research approach Understanding book-locating behavior in libraries is important and leads to more effective services that support patrons throughout the book-locating process. This study adopted a design-based approach to incorporate robotic assistance in investigating the book-locating behaviors of child patrons, and developed a service robot for child patrons in library settings. We describe the iterative cycles and process to develop a robot to assist with locating resources in libraries. Stakeholders, including child patrons and librarians, were consulted about their needs, preferences, and performance in locating library resources with robotic assistance. Their needs were analyzed and incorporated into the design of the library robot to provide comprehensive support. The results of the study suggest that the library robot was effective as a mobile and humanoid service agent for providing motivation and knowledgeable guidance to help child patrons in the initially complicated sequence of locating 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

robotics
children-s services
access to resources


Efficiency frontiers of XML cardinality constraints XML has gained widespread acceptance as a premier format for publishing, sharing and manipulating data through the web. While the semi-structured nature of XML provides a high degree of syntactic flexibility there are significant shortcomings when it comes to specifying the semantics of XML data. For the advancement of XML applications it is therefore a major challenge to discover natural classes of constraints that can be utilized effectively by XML data engineers. This endeavor is ambitious given the multitude of intractability results that have been established. We investigate a class of XML cardinality constraints that is precious in the sense that it keeps the right balance between expressiveness and efficiency of maintenance. In particular, we characterize the associated implication problem axiomatically and develop a low-degree polynomial time algorithm that can be readily applied for deciding implication. Our class of constraints is chosen near-optimal as already minor extensions of its expressiveness cause potential intractability. Finally, we transfer our findings to establish a precious class of soft cardinality constraints on XML data. Soft cardinality constraints need to be satisfied on average only, and thus permit violations in a controlled manner. Soft constraints are therefore able to tolerate exceptions that frequently occur in practice, yet can be reasoned about efficiently.

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

semi-structured data and xml
database semantics
database constraints
cardinality estimation


Modified immune algorithm for job selection and operation allocation problem in flexible manufacturing systems The advent of automated manufacturing systems and the variability in demand pattern have forced the manufacturers to increase the flexibility and efficiency of their automated systems to stay competitive in the dynamic market. Loading decisions play an important role in determining the efficiency of manufacturing systems. Machine loading problems in flexible manufacturing systems (FMSs) are known to be NP-hard problems. Although some NP-hard problems could still be optimized for very small instances, machine loading complexity is so extensive that even small problems take excessive computational time to reach the optimal solution. To ease the tedious computations, and to get a good solution for large problems, this paper develops a special Immune Algorithm (IA) named Modified immune algorithm (MIA). IA is a suitable method due to its self learning capability and memory acquisition. This paper improves some issues inherent in existing IAs and proposes a more effective immune algorithm with reduced memory requirements and reduced computational complexity. In order to verify the efficacy and robustness of the proposed algorithm, the paper presents comparisons to existing immune algorithms with benchmark functions and standard data sets related to the machine loading problem. In addition proposed algorithm has been tested at different noise level to examine the efficiency of algorithm on different platforms. The comparisons show consistently that the proposed algorithm outperforms the existing techniques. For all machine loading dataset proposed algorithm has shown good results as compared to the best results reported in the literature.

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

np-hard
artificial immune system
gaussian mutation
cauchy mutation


Image classification based on saliency coding with category-specific codebooks This paper presents a feature encoding scheme for image classification by combining the salient coding method with the category-specific codebooks, which are generated separately using the training images of each category. Different from the usual way of concatenating or merging the category codebooks to form a global dictionary, we employ the category codebooks to calculate a type of category-sensitive saliency feature, and then, encode the saliency features to form a representation of image content. Compared to the state-of-the-art methods such as LC-KSVD, the dictionary generation and feature encoding in our scheme are pretty simple, and no complicated optimization is involved. However, our scheme can achieve better, in some cases, significantly better results, in terms of the classification accuracy, than the state-of-the-art methods. Extensive experiments are carried out to show the effectiveness of our method in comparing with various image classification methods.

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


Pattern clustering based on noise modeling in wavelet space We describe an effective approach to object or feature detection in point patterns via noise modeling. This is based on use of a redundant or non-pyramidal wavelet transform. Noise modeling is based on a Poisson process. We illustrate this new method with a range of examples. We use the close relationship between image (pixelated) and point representations to achieve the result of a clustering method with constant-time computational cost.

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

cluster analysis
point pattern
trous wavelet transform
poisson distribution
minefield detection


an e-mail signature protocol for anti-spam work-in-progress Communication via E-mail is one of the most convenient ways to replace the traditional mailing system. However, spam appears and has become a serious problem. Most computation is on the spam e-mails, which becomes heavy burden of a mail server. In this paper, we proposed an e-mail authentication protocol to solve the problems of spam and phishing attacks by verifying if the e-mails come from the reliable source.

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


A decision support system for order selection in electronic commerce based on fuzzy neural network supported by real-coded genetic algorithm This research attempts to develop a decision support system for order selection. The proposed system is able to integrate both the quantitative and qualitative factors together. For the qualitative factors, the fuzzy IFTHEN rules are summarized from the questionnaire survey for the production experts and learned by a proposed fuzzy neural network (FNN) with initial weights generated by real-coded genetic algorithm (GA). Then, a feedforward artificial neural network (ANN) with error back-propagation (EBP) learning algorithm is employed to integrate the above two parts together. Both the simulation and real-life problem provided by an internationally OEM company results show that the proposed FNN can well learn the fuzzy IFTHEN rules. In addition, real-coded GA is proved to be better than the binary GA both in speed and accuracy. Considering both the quantitative and qualitative factors has more accurate results compared with considering only the quantitative factors.

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

artificial neural networks
fuzzy neural networks
real-coded genetic algorithm


Image indexing and retrieval in JPEG compressed domain based on vector quantization This paper presents a new and effective image indexing technique that extracts features from JPEG compressed images. Using vector quantization techniques (VQ) and a codebook generated using a K-means clustering algorithm, the proposed technique is able to create an effective histogram from DCT coefficients, which are the major components of JPEG. The proposed method only needs to do partial decoding, therefore it can accelerate the work of indexing images. Experimental results show that its retrieval performance is higher compared with those of other methods from pixel and compressed domains. All experiments confirm the effectiveness and efficiency of the proposed method. (C) 2011 Elsevier Ltd. All rights reserved.

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

image indexing
vector quantization
histogram

content based image retrieval
compressed jpeg images


A new fuzzy time series forecasting model combined with ant colony optimization and auto-regression This paper presents a new fuzzy time series model combined with ant colony optimization (ACO) and auto-regression. The ACO is adopted to obtain a suitable partition of the universe of discourse to promote the forecasting performance. Furthermore, the auto-regression method is adopted instead of the traditional high-order method to make better use of historical information, which is proved to be more practical. To calculate coefficients of different orders, autocorrelation is used to calculate the initial values and then the LevenbergMarquardt (LM) algorithm is employed to optimize these coefficients. Actual trading data of Taiwan capitalization weighted stock index is used as benchmark data. Computational results show that the proposed model outperforms other existing models.

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

auto-regression
stock forecasting
levenbergmarquardt algorithm


Equivalent, waveform propagation for static timing analysis This paper proposes a scheme that captures diverse input waveforms of CMOS gates for static timing analysis (STA). Conventionally latest arrival and transition times are calculated from the timings when a transient waveform. goes across predetermined reference voltages. However, this method cannot accurately consider the impact of waveform shape on gate delay when crosstalk-induced nonmonotonic waveforms or inductance-dominant stepwise waveforms are injected. We propose a new timing analysis scheme called "equivalent waveform propagation." The proposed scheme calculates the equivalent waveform that makes the output waveform close to the actual waveform, and uses the equivalent waveform for timing calculation. The proposed scheme can cope with various waveforms affected by resistive shielding, crosstalk noise, wire inductance, etc. In this paper, we devise a method to calculate the equivalent waveform. The proposed calculation method is compatible with conventional methods in gate delay library and characterization and, hence, our method is easily implemented with conventional STA tools.

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

crosstalk noise
inductance
resistive shielding

slope propagation
static timing analysis (sta)
waveform diversity


Leptin Is a Link between Adipose Tissue and Inflammation Leptin is a hormone of the pluripotent white adipose tissue and confers a multitude of regulatory functions within the organism. It controls the energy storage, lipoprotein metabolism, acute phase reactants, sex hormones and glucocorticoid metabolism, and immune function. In this review, we describe these multiple functions of leptin, the regulation of leptin expression, and how leptin can modulate the immune system via direct and indirect mechanisms. We show how leptin can be a link between the adipose tissue and inflammation

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


Logarithmic Adaptive Quantization Projection for Audio Watermarking In this paper, a logarithmic adaptive quantization projection (LAQP) algorithm for digital watermarking is proposed. Conventional quantization index modulation uses a fixed quantization step in the watermarking embedding procedure, which leads to poor fidelity. Moreover, the conventional methods are sensitive to value-metric scaling attack. The LAQP method combines the quantization projection scheme with a perceptual model. In comparison to some conventional quantization methods with a perceptual model, the LAQP only needs to calculate the perceptual model in the embedding procedure, avoiding the decoding errors introduced by the difference of the perceptual model used in the embedding and decoding procedure. Experimental results show that the proposed watermarking scheme keeps a better fidelity and is robust against the common signal processing attack. More importantly, the proposed scheme is invariant to value-metric scaling attack.

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

quantization index modulation (qim)
psychoacoustic model


Combining expert judgment: On the performance of trimmed mean vote aggregation procedures in the presence of strategic voting Analytic group decision techniques for selecting a subset of alternatives range between multicriteria decision analysis techniques such as multiattribute utility theory and the analytic hierarchy process to voting techniques where each member of the decision group submits a ranking of the alternatives, and these individual rankings are then aggregated into an overall ranking. The obvious advantage of voting is that it bypasses the rather intensive data generation requirements of multicriteria techniques. In this paper we compare the performance of trimmed mean rank-order aggregation procedures in the case where a subset of the individuals in the group charged with the decision vote strategically. We employ a Monte Carlo simulation experiment on a specific decision instance and find that trimmed mean aggregation compares favorably with other procedures.

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


An identification and classification of enterprise portal functions and features Enterprise portal is a type of new information system that can help companies and their employees to manage, share, and use previously disparate information. There are more than 60 vendors that are offering corporate portal solutions. With so many vendors, selecting the right one can be a difficult task. The primary objective of this research is to identify and evaluate the functions and features in enterprise portal products. In particular, this study develops a simplified model that can be used for identifying and classifying the functions and features in corporate portal software. The results of this study may be useful to information technology managers, educators, and students involved in knowledge management, business intelligence, information systems resources management, and data management. System developers, software engineers, project managers, financial managers, and data architects can use the functions and features identified in this study as benchmarking tools for evaluating portals capabilities.

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

knowledge workers
internet
information management


Domain-dependent information gathering agent A universal agent should be capable of gathering information from arbitrary heterogeneous sites and offer intelligent information services on its own based on information so gathered. We present a domain-dependent agent for information gathering. It can visit an arbitrary domain-related site by observing a user perform the first query. By understanding key concepts of the first query, the agent performs subsequent queries autonomously. When a user asks the agent about a particular item, the agent gathers relevant information from various sites. The major advantage of the agent is a semi-automatic creation of a wrapper around a particular site with few human interventions. We have implemented two versions of such information gathering agents: ShinA (SHoppINg Assistant) for e-trading tasks, and EMA (EMployment Agent), which performs employment and job related functions over the Internet.

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

intelligent agent
comparison shopping
information extraction
inductive learning


Improving decision making in fault detection and isolation using model validity Fault detection and isolation commonly relies on the computation of numerical residuals deduced from the analytical model of the process to be diagnosed. This model can be more or less valid, due to the difficulty of getting good data sets in industry and to the process ageing. If this validity is not taken into account during the evaluation of the residuals, false symptoms may be produced and consequently a false diagnosis. The aim of this paper is to explicitly take into account the validity of the model to make the diagnostic decision. The decision formulation is inspired by the logical approach to consistency-based diagnosis proposed by the artificial intelligence community. However, in this paper fuzzy aggregation is used because it allows gradual diagnostic decision making. A fuzzy indicator of the model validity is first evaluated a priori during the model identification and further modified on-line to take into account actual operating conditions. The numerical residuals are fuzzified, taking into consideration their dynamical evolution. Finally, the model validity is aggregated on-line with the fuzzy residuals in order to provide fuzzy symptoms and a diagnostic decision that reflects both the residual value and the model validity. Academic examples illustrate the benefits of the proposed method.

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

fault detection
model validity
fuzzy aggregation

model-based diagnosis
logical principles of diagnosis
fault isolation
symptom generation


Quadrature for Self-affine Distributions on \({\mathbb R}^d\) This article presents a systematic treatment of quadrature problems for self-similar probability distributions. We introduce explicit deterministic and randomized algorithms and study their errors for integrands of fractional smoothness of HlderLipschitz type. Conversely, we derive lower bounds for worst-case errors of arbitrary integration schemes that prove optimality of our algorithms in many cases. In particular, we see that the effective dimension of the quadrature problem for functions of smoothness \(q>0\) is given by the quantization dimension of order \(q\) of the fractal measure.

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

self-similar distribution
numerical integration
lower error bounds
cutset
primary: 65d30
secondary: 65c05
28a80


a method for digitally determining amplitude and phase-response information from analog swept sine vibration data A method where only portions of analog swept sine vibration data channels need to be digitized for extracting amplitude and phase response information is suggested. The method was used on actual vibration data for initial analysis while error studies were conducted on a modeled system with known input and output functions.

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

digitize
error model
fourier transform
amplitude response
data compression
data reduction


high-speed storage control schemes of hitachi supercomputer s-820 system The HITACHI supercomputer S-820 has been developed as Hitachi's top end supercomputer. It is also rated as one of the most powerful supercomputers in the world. To match high performance of arithmetic units, the S-820 employed advanced storage control schemes. Of these schemes, this paper introduces the parallel structure of the storage control, section number assigning, bank group number modifying and vector indirect store instruction. By parallel structure of the storage control and section number assigning, peak memory throughput of 16 Gbytes/sec is achieved. By bank group number modifying, critical memory access conflicts are avoided and excellent memory throughput is achieved especially for vectors with short strides. By using vector indirect store instruction, the performance of store-type list vector operation without duplicated list vector elements is 2.3-fold improved over that obtained by using conventional store-type list vector instructions.

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

structure parallel performance storage supercomputer throughput instruction group access paper control

vectorization systems conflict high-performance matching memorialized critic scheme


Searching for the best elimination sequence in Bayesian networks by using ant colony optimization The knowledge base of a probabilistic expert system is usually represented as a Bayesian network. Most of the knowledge engineering tools used in the development of probabilistic expert systems do not carry out the inference process directly over the network, but in a secondary graphical structure called a junction tree. The efficiency of inference (propagation) algorithms depends on the size of the junction tree obtained, and this size depends on the elimination sequence used during the compilation/transformation of the Bayesian network into a junction tree. The problem of searching for the best elimination sequence is an NP-hard problem [W. Wen, in: P. Bonissone, M. Henrion, L. Kanal and Z. Lemmer (Eds.), Uncertainty in Artificial Intelligence, vol. 6, North-Holland, Amsterdam, 1991, pp. 209224], and this has motivated the proliferation of approximate methods to approach it (based variously on greedy heuristics, genetic algorithms, simulated annealing, etc.). In this paper we investigate the applicability to this problem of a new combinatorial optimization technique, inspired by a natural model, which has appeared recently: ant colony optimization [M. Dorigo, Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, Italy, 1992; M. Dorigo and L. Gambardella, IEEE Trans. Evol. Comput. 1 (1997) 53; M. Dorigo and G.Di. Caru, in: New Ideas in Optimization, McGraw-Hill, New York, 1999]. Our approach is validated by using a set of complex networks obtained from a repository.

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

ant colony optimization
probabilistic expert systems

bayesian (belief) networks
graph triangulation
np-hard problems


EWD: A metamodeling driven customizable multi-MoC system modeling framework We present the EWD design environment and methodology, a modeling and simulation framework suited for complex and heterogeneous embedded systems with varying degrees of expressibility and modeling fidelity. This environment promotes the use of multiple models of computation (MoCs) to support heterogeneity and metamodeling for conformance tests of syntactic and static semantics during the process of modeling. Therefore, EWD is a multiple MoC rnodeling and simulation framework that ensures conformance of the MoC formalisms during model construction using a metamodeling approach. In addition, EWD provides a suite of translation tools that generate executable models for two simulation frameworks to demonstrate its language-independent modeling framework. The EWD methodology uses the Generic Modeling Environment for customization of the MoC-specific modeling syntax into a visual representation. To embed the execution semantics of the MoCs into the models, we have built parsing and translation tools that leverage an XML-based interoperability language. This interoperability language is then translated into executable Standard ML or Haskell models that can also be analyzed by existing simulation frameworks such as SML-Sys or ForSyDe. In summary, EWD is a metamodeling driven multitarget design environment with multi-MoC modeling capability.

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

languages
verification
metamodel
functional language
denotational semantics
interoperable modeling language
heterogeneous system design
ptolemy ii
systemc


Identifying conserved gene clusters in the presence of homology families The study of conserved gene clusters is important for understanding the forces behind genome organization and evolution, as well as the function of individual genes or gene groups. In this paper, we present a new model and algorithm for identifying conserved gene clusters from pairwise genome comparison. This generalizes a recent model called "gene teams." A gene team is a set of genes that appear homologously in two or more species, possibly in a different order yet with the distance of adjacent genes in the team for each chromosome always no more than a certain threshold. We remove the constraint in the original model that each gene must have a unique occurrence in each chromosome and thus allow the analysis on complex prokaryotic or eukaryotic genomes with extensive paralogs. Our algorithm analyzes a pair of chromosomes in O(mn) time and uses O(m+n) space, where m and n are the number of genes in the respective chromosomes. We demonstrate the utility of our methods by studying two bacterial genomes, E. coli K-12 and B. subtilis. Many of the teams identified by our algorithm correlate with documented E. coli operons, while several others match predicted operons, previously suggested by computational techniques. Our implementation and data are publicly available at euler.slu.edu/similar to goldwasser/homologyteams/.

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

cluster of orthologous genes
comparative genomics
conserved gene cluster


A multi-agent optimization formulation of earthquake disaster prevention and management We model three different agencies involved in disaster management through OR. We coordinate agencies responsible for different phases of disaster management. Coordination indicates an average improvement of 7.524% in the death toll. Through multi-agent optimization, connections between the agencies are observed. Efficiency of relief operations is dependent on transportation network reliability.

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

or in societal problem analysis
multi-agent optimization
emergency response


AUTOMATING ACTUALISATION OF GEOGRAPHIC INFORMATION USING THE TWOFOLD FUZZY REGION MODEL In this paper a new method is proposed for automating quality control and actualisation of spatial information using image data. A new model for imperfect geographic information is explored for this purpose: a two fold fuzzy region model; which is an extension of both the fuzzy region model and the egg/yolk model. This model is used to interpret spatial classifications and its imperfections in a new way. By defining different operators on the model an imprecise quality report can be developped for geographic databases that uses the imperfect spatial classification as reference information. The model makes it possible, despite the large amount of imperfection in spatial classifications, to use them for rather accurate error detection on geographic databases.

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

geographical information systems
qualitative spatial reasoning
imperfect data modelling
image processing
fuzzy sets


multimodal interactive machine translation Interactive machine translation (IMT) [1] is an alternative approach to machine translation, integrating human expertise into the automatic translation process. In this framework, a human iteratively interacts with a system until the output desired by the human is completely generated. Traditionally, interaction has been performed using a keyboard and a mouse. However, the use of touchscreens has been popularised recently. Many touchscreen devices already exist in the market, namely mobile phones, laptops and tablet computers like the iPad. In this work, we propose a new interaction modality to take advantage of such devices, for which online handwritten text seems a very natural way of input. Multimodality is formulated as an extension to the traditional IMT protocol where the user can amend errors by writing text with an electronic pen or a stylus on a touchscreen. Different approaches to modality fusion have been studied. In addition, these approaches have been assessed on the Xerox task. Finally, a thorough study of the errors committed by the online handwritten system will show future work directions.

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

multimodality
interactive machine translation


An Open-label Study Adding Creatine Monohydrate to Ongoing Medical Regimens in Patients with the Fibromyalgia Syndrome Fibromyalgia is an ill-defined condition that causes pain and disability but still lacks effective treatment. The aim of this open-label study was to assess the efficacy of administering a food supplement, creatine monohydrate, in an add on to existing therapies in patients with fibromyalgia. This study included 30 patients with fibromyalgia. After 8 weeks of receiving creatine, we witnessed a significant improvement in parameters reflecting severity of fibromyalgia, quality of life and sleep, disability, and pain. These results deteriorated 4 weeks after stopping creatine therapy. The findings of this study are preliminary and limited due to the small sample and relatively high rate of dropouts.

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


The ASSISTment Builder: Supporting the Life Cycle of Tutoring System Content Creation Content creation is a large component of the cost of creating educational software. Estimates are that approximately 200 hours of development time are required for every hour of instruction. We present an authoring tool designed to reduce this cost as it helps to refine and maintain content. The ASSISTment Builder is a tool designed to effectively create, edit, test, and deploy tutor content. The Web-based interface simplifies the process of tutor construction to allow users with little or no programming experience to develop content. We show the effectiveness of our Builder at reducing the cost of content creation to 40 hours for every hour of instruction. We describe new features that work toward supporting the life cycle of ITS content creation through maintaining and improving content as it is being used by students. The Variabilization feature allows the user to reuse tutoring content across similar problems. The Student Comments feature provides a way to maintain and improve content based on feedback from users. The Most Common Wrong Answer feature provides a way to refine remediation based on the users' answers. This paper describes our attempt to support the life cycle of content creation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 and intelligent educational systems


Automatic syllabification for Spanish using lemmatization and derivation to solve the prefixs prominence issue We describe the problem of the syllabification when the word has a prefix. An algorithm that identifies the prefixs prominence and applies the right syllabification. The automatic syllabification is possible using a specific lemmatizer. The algorithm uses the information provided by a knowledge database about derivation. We use information about prefixes current productivity and word frequency.

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

syllabification lemmatization derivation prefix


Experience using an intermediate compiler target language for parallel machines The generalised computational model of term graph rewriting systems (TGRSs) has been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) logic programming ones and various amalgamations of them, to (concurrent) object-oriented ones. More recently, the relationship between TGRSs and process calculi (such as the ?-calculus) as well as linear logic has also been explored. In this paper we describe our experience in using the intermediate compiler target language Dactl based on TGRSs for mapping a variety of programming paradigms of the aforementioned types onto it. In particular, we concentrate on some of the issues that we feel have played an important role in our work (in, say, affecting performance, etc.), the aim being to derive a list of features that we feel every language model which intends to be used as an intermediate representation between (concurrent) high-level languages and (parallel) computer architectures must have.

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

compiler target languages
intermediate representations
parallel and distributed computing
language embeddings


Finite element simulation of steady state and transient forced convection in superfluid helium In this paper, the solution of transient mass, momentum and energy balances in superfluid helium are discussed by means of a finite element algorithm. A simple linearization procedure is used for the non-linear pseudo-diffusion term in the energy balance arising because of the unique counterflow heat transport mechanism in superfluid helium. The linearization algorithm is analyzed for accuracy order and stability. The reliability of the algorithm devised is shown in practical tests, comparing the numerical solutions with experimental data available in the literature. Copyright (C) 1999 John Wiley & Sons, Ltd.

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

finite element simulation
steady state
forced convection


semantics-based change impact analysis for heterogeneous collections of documents An overwhelming amount of documents is produced and changed every day in most areas of our everyday life, such as, for instance, business, education, research or administration. The documents are seldom isolated artifacts but are related to other documents. Therefore changing one document possibly requires adaptations to other documents. Although dedicated tools may provide some assistance when changing documents, they often ignore other documents or documents of a different type. To resolve that discontinuity, we present a framework that embraces existing document types and supports the declarative specification of semantic annotation and propagation rules inside and across documents of different types, and on which basis we define change impact analysis for heterogeneous collections of documents. The framework is implemented in the tool GMoC which can be used to semantically annotate collections of documents and to analyze the impacts of changes made in different documents of a collection.

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

graph rewriting
document collections
semantics
document management


NCBO Technology: Powering semantically aware applications As new biomedical technologies are developed, the amount of publically available biomedical data continues to increase. To help manage these vast and disparate data sources, researchers have turned to the Semantic Web. Specifically, ontologies are used in data annotation, natural language processing, information retrieval, clinical decision support, and data integration tasks. The development of software applications to perform these tasks requires the integration of Web services to incorporate the wide variety of ontologies used in the health care and life sciences. The National Center for Biomedical Ontology, a National Center for Biomedical Computing created under the NIH Roadmap, developed BioPortal, which provides access to one of the largest repositories of biomedical ontologies. The NCBO Web services provide programmtic access to these ontologies and can be grouped into four categories; Ontology, Mapping, Annotation, and Data Access. The Ontology Web services provide access to ontologies, their metadata, ontology versions, downloads, navigation of the class hierarchy (parents, children, siblings) and details of each term. The Mapping Web services provide access to the millions of ontology mappings published in BioPortal. The NCBO Annotator Web service tags text automatically with terms from ontologies in BioPortal, and the NCBO Resource Ind ex Web services provides access to an ontology-based index of public, online data resources. The NCBO Widgets package the Ontology Web services for use directly in Web sites. The functionality of the NCBO Web services and widgets are incorporated into semantically aware applications for ontology development and visualization, data annotation, and data integration. This overview will describe these classes of applications, discuss a few examples of each type, and which NCBO Web services are used by these applications.

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

bioportal
ontology
web service
annotator


Numerical simulation of flood waves and calculation of exerted forces on the cylindrical piers in contraction channels with different cross section profiles A numerical model based on two-dimensional shallow water equations is presented. The depth-averaged velocity components with free-surface elevation have been used as independent variables in the model. The finite element technique is applied to discretize the spatial derivatives. Triangular elements with quadratic and linear interpolating functions are employed for two horizontal velocity components and the free-surface elevation, respectively. The standard Galerkin method is applied for discretization of the governing equations. Time discretization is performed using an implicit scheme. The resulting linear system of equations is solved by the GMRES method. The model is validated using three test cases and the results are compared with an analytical solution, the result of numerical work and experimental data, respectively. Favorable agreement was achieved in all three cases. Subsequently, the developed model is applied to simulate free-surface elevation through a channel contraction. The effects of width of the narrow section as well as the profile of the cross section of the channel on the wave forces exerted on a circular cylinder were studied. This was done in a channel with a quartic narrow section. Plots of time histories of the drag coefficient on the cylinder were produced, demonstrating the effects of the mentioned parameters.

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

different cross sections
finite element method
shallow water equation


Electrical behavior of the Diamond layout style for MOSFETs in X-rays ionizing radiation environments This paper aims to describe some innovative layout styles, which are capable to boost the electrical performance and, in the same time, the Total Ionizing Dose (TID) tolerance of Metal-Oxide-Semiconductor (MOS) Field Effect Transistors (MOSFET), without burdening the current planar Complementary MOS (CMOS) Integrated Circuits (ICs) manufacturing processes. To illustrate the potential use of these new alternative devices in analog and digital CMOS ICs applications, this work focuses on the Diamond layout style for MOSFET that presents hexagonal gate geometry. The new effects associated to this innovative transistor structure and its modeling are presented and discussed in detail. Some experimental results are illustrated to evidence its use mainly in space and medical CMOS ICs applications.

diamond (hexagonal gate geometry)
lce
pamdle
depambbre
x-rays radiation
total ionizing dose (tid)


Determination of nonlinear fibre-reinforced biphasic poroviscoelastic constitutive parameters of articular cartilage using stress relaxation indentation testing and an optimizing finite element analysis An inverse method was developed to determine the material constitutive parameters of human articular cartilage from stress relaxation indentation tests. The cartilage was modeled as a fibre-reinforced nonlinear biphasic poroviscoelastic material, and a finite element (FE) model was used with a simulated annealing (SA) optimization algorithm to determine the material parameters that minimized the error between the experimental and predicted time dependant indentation loads. The values of the 15 optimized material parameters were found to be insensitive to the initial guesses, and, when friction between the indenter and the cartilage was considered, resulted in good agreement between the measured stress relaxation response and the FE prediction (R2=0.99). The optimized material parameters determined from experiments that used two different indenter sizes on the same samples were compared. When assuming frictionless contact between the indenter and the cartilage, all of the optimized parameters except for the Poisson's ratio were found to be relatively insensitive to indenter size. A second set of models that included frictional contact greatly reduced the sensitivity of the optimized Poisson's ratio to indenter size, thus confirming the validity of the model and demonstrating the importance of modeling friction. The results also demonstrate the robustness of the SA optimization algorithm to ensure convergence of a large number of material properties to a global minimum regardless of the quality of the initial guesses.

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

cartilage
stress relaxation indentation
optimization
finite element
friction
human

nonlinear biphasic poroviscoelastic fibre-reinforced


Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM Parallel Givens sequences for computing the QR decomposition of an m x n (m > n) matrix are considered. The Givens rotations operate on adjacent planes. A pipeline strategy for updating the pair of elements in the affected rows of the matrix is employed. This allows a Givens rotation to use rows that have been partially updated by previous rotations. Two new Givens schemes, based on this pipeline approach, and requiring respectively n n(2)/2 and n processors, are developed. Within this context a performance analysis on an exclusive-read, exclusive-write (EREW) parallel random access machine (PRAM) computational model establishes that the proposed schemes are twice as efficient as existing Givens sequences. (c) 2005 Elsevier B.V. All rights reserved.

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


Quarantine region scheme to mitigate spam attacks in wireless sensor networks The Quarantine Region Scheme (QRS) is introduced to defend against spam attacks in wireless sensor networks where malicious antinodes frequently generate dummy spam messages to be relayed toward the sink. The aim of the attacker is the exhaustion of the sensor node batteries and the extra delay caused by processing the spam messages. Network-wide message authentication may solve this problem with a cost of cryptographic operations to be performed over all messages. QRS is designed to reduce this cost by applying authentication only whenever and wherever necessary. In QRS, the nodes that detect a nearby spam attack assume themselves to be in a quarantine region. This detection is performed by intermittent authentication checks. Once quarantined, a node continuously applies authentication measures until the spam attack ceases. In the QRS scheme, there is a trade-off between the resilience against spam attacks and the number of authentications. Our experiments show that, in the worst-case scenario that we considered, a not quarantined node catches 80 percent of the spam messages by authenticating only 50 percent of all messages that it processes.

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

wireless sensor networks
authentication
quarantine region
spam attacks


Real-time disk scanning for timely retrieval of continuous media objects In recent years, demands for multimedia applications have rapidly grown with the advances in computing power and network technology. To fulfill the demands, it is crucial to establish the multimedia information systems supporting continuous media (CM) streams without hiccups. Many useful methods have been proposed in the past so that CM steams with VCR-quality can be supported. Although these earlier approaches can be used for the service of VCR-quality streams, they cannot provide a good system performance for the CM streams with various playback rates and rather short durations of playback. In the paper, we propose a new CM playback method that consists of bulk-scanning and an earliest-deadline-first style scheduling algorithm. Our proposed method provides both good response times and high I/O utilization using the efficient disk scheduling. In addition, our mechanism for admission control makes CM streams never experience hiccups until the ends of playback. Through experimental analyses, we show the performance advantages of the proposed method over the earlier methods.

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

multimedia system
real-time disk scheduling


fourier slice photography This paper contributes to the theory of photograph formation from light fields. The main result is a theorem that, in the Fourier domain, a photograph formed by a full lens aperture is a 2D slice in the 4D light field. Photographs focused at different depths correspond to slices at different trajectories in the 4D space. The paper demonstrates the utility of this theorem in two different ways. First, the theorem is used to analyze the performance of digital refocusing, where one computes photographs focused at different depths from a single light field. The analysis shows in closed form that the sharpness of refocused photographs increases linearly with directional resolution. Second, the theorem yields a Fourier-domain algorithm for digital refocusing, where we extract the appropriate 2D slice of the light field's Fourier transform, and perform an inverse 2D Fourier transform. This method is faster than previous approaches.

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

plenoptic camera
projection-slice theorem
digital photography


perceived physicality in audio-enhanced force input This paper investigates how the perceived physicality of the action of applying force with a finger on a rigid surface (such as on a force-sensing touch screen) can be enhanced using real-time synthesized audio feedback. A selection of rich and evocative audio designs was used. Additionally, audio-tactile cross-modal integration was encouraged, by observing that the main rules of multisensory integration were supported. The study conducted showed that richness of perceived physicality increased considerably, mostly in its auditory expression (what pressing sounded like). In addition, in many instances it was observed that the haptic expression of physicality also increased (what pressing felt like), including some perception of compliance. This last result was particularly interesting as it showed that audio-tactile cross-modal integration might be present.

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


Extending Removed Sets Revision to partially preordered belief bases Most of belief revision operations have been proposed for totally preordrered information. However, in case of partial ignorance, pieces of information are partially preordered and few effective approaches of revision have been proposed. The paper presents a new framework for revising partially preordered information, called Partially Preordered Removed Sets Revision (PPRSR). The notion of removed set, initially defined in the context of the revision of non ordered or totally preordered information is extended to partial preorders. The removed sets are efficiently computed thanks to a suitable encoding of the revision problem into logic programming with answer set semantics. This framework captures the possibilistic revision of partially preordered information and allows for implementing it with ASP. Finally, it shows how PPRSR can be applied to a real application of the VENUS european project. (C) 2010 Elsevier Inc. All rights reserved.

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

revision
partially preordered belief bases


Assessing users' subjective quality of experience with the world wide web: an exploratory examination of temporal changes in technology acceptance Contemporary information technology-(IT)-related research has focused on use or user acceptance as a key dependent measure for valuing IT. By understanding the determinants of IT use, we gain descriptive information about successful IT, and prescriptive information for better deploying IT resources and improving their utility. Although there are several competing theories regarding IT use, research findings often cite their inability to account for temporal changes in usage behaviors. Furthermore, contemporary human-computer interaction perspectives often focus on the robust and growing literature surrounding usability and likeability; however, few studies have provided insight into the components of, or antecedents to, the utility dimension. This research attempts to address these gaps by introducing the construct of users ' quality of experience as a potential mediator between the determinants of use and actual usage behaviors and their outcomes. A pilot survey concerning Internet usage generated potentially relevant items which were later refined into a questionnaire assessing each item 's relative importance to perceptions of quality of experience. Initial indications suggest 10 of the items represent a temporally stable and unidimensional construct. Findings are also interpreted within the context of IT and cognitive/behavioral science perspectives, further providing for face validity of the quality of experience construct. (C) 2001 Academic Press.

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

technology acceptance
usability
experience


Numerical simulation of two-phase flow in deformable porous media: Application to carbon dioxide storage in the subsurface In this paper, conceptual modeling as well as numerical simulation of two-phase flow in deep, deformable geological formations induced by CO2 injection are presented. The conceptual approach is based on balance equations for mass, momentum and energy completed by appropriate constitutive relations for the fluid phases as well as the solid matrix. Within the context of the primary effects under consideration, the fluid motion will be expressed by the extended Darcy's law for two phase flow. Additionally, constraint conditions for the partial saturations and the pressure fractions of carbon dioxide and brine are defined. To characterize the stress state in the solid matrix, the effective stress principle is applied. Furthermore, the interaction of fluid and solid phases is illustrated by constitutive models for capillary pressure, porosity and permeability as functions of saturation. Based on this conceptual model, a coupled system of nonlinear differential equations for two-phase flow in a deformable porous matrix ((HM)-M-2 model) is formulated. As the displacement vector acts as primary variable for the solid matrix, multiphase flow is simulated using both pressure/pressure or pressure/saturation formulations. An object-oriented finite element method is used to solve the multi-field problem numerically. The capabilities of the model and the numerical tools to treat complex processes during CO2 sequestration are demonstrated on three benchmark examples: (1) a 1-D case to investigate the influence of variable fluid properties, (2) 2-D vertical axi-symmetric cross-section to study the interaction between hydraulic and deformation processes, and (3) 3-D to test the stability and computational costs of the (HM)-M-2 model for real applications. (c) 2012 IMACS. Published by Elsevier B.V. All rights reserved.

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

two-phase flow consolidation
heat transport
carbon capture storage (ccs)
opengeosys (ogs)


FCA-CIA: An approach of using FCA to support cross-level change impact analysis for object oriented Java programs Background: Software Change Impact Analysis (CIA) is an essential technique in software engineering to identifying the potential influences of a change, or determining change entities to accomplish such a change. The results derived, in many cases, ambiguous for the software maintainers, introduces the problem of unclear starting point of these impacted entities. Objective: In an attempt to address this issue, this work proposes a novel approach for cross-level CIA, producing a ranked list of potentially impacted methods derived from class-level changes. Moreover, the approach of ranking the impact results is expected to be effective for maintainers to distinguish the probability of the impacted methods to be false-positives. Such results provide an eclectic approach for CIA. Method: The approach, FCA-CIA, uses formal concept analysis (FCA) to produce an intermediate representation of the program based on the static analysis of the source code. The representation is called Lattice of Class and Method Dependence (LoCMD). FCA-CIA takes the changed classes in the change set as a whole, and determines the reachable set from the changed classes on the LoCMD. Based on the hierarchical property of the LoCMD, the impacted methods are ranked according to the impact factor metric which corresponds to the priority of these methods to be inspected. Result: Empirical evaluations on four real-world software projects demonstrate the effectiveness of the impact factor metric and the FCA-CIA technique. The result shows the predicted impacted methods with higher impact factor values are more likely to be affected by the changes. Our study also shows that the FCA-CIA technique generates more accurate impact set than the JRipples and ICP coupling based CIA technique. (C) 2013 Elsevier B.V. All rights reserved.

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

formal concept analysis
change impact analysis
lattice of class and method dependence
impact factor


compiler and tool support for debugging object protocols We describe an extension to the Java programming language that supports static conformance checking and dynamic debugging of object protocols, i.e., sequencing constraints on the order in which methods may be called. Our Java protocols have a statically checkable subset embedded in richer descriptions that can be checked at run time. The statically checkable subtype conformance relation is based on Nierstrasz' proposal for regular (finite-state) process types, and is also very close to the conformance relation for architectural connectors in the Wright architectural description language by Allen and Garlan. Richer sequencing properties, which cannot be expressed by regular types alone, can be specified and checked at run time by associating predicates with object states. We describe the language extensions and their rationale, and the design of tool support for static and dynamic checking and debugging.

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

order
protocols
dynamic
design
types
object
process
relation
debugging
subtype
sequencing constraints
programming language

method
architecture
compilation
extensibility
connector
timing
tool-support
architecture description language
constraint
sequence
language extensibility
embedding


ai middleware as means for improving gameplay Current commercial AI middleware are still far from being a generic and flexible tool for developing computer games. Also the literature lacks proposals in this field. In this work we present some of our current research on developing a new proposal for a flexible architecture that can be used in several types of games. This AI engine is designed to provide support for the implementation of AI functionalities in computer games, streamlining this implementation and allowing the developers to focus their attention on the creative side of the game, but is also focused on introducing new techniques that could allow for an improved gameplay experience or even new gameplay styles. In order to fulfill this goal, this research focuses on the design issues of such a system and its integration into games, using more powerful techniques from academic AI and strongly relying on software engineering principles.

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

artificial intelligence
software architecture
design patterns
game ai


selecting languages for pedagogical tools in the computer science curriculum The selection of languages for use as pedagogical aids in the teaching of computer science is still a big issue at most universities. The rebellion against FORTRAN has given rise to numerous heirs to the throne, eg, PL/1, ALGOL, PASCAL, etc. In deciding how to resolve this issue small departments have to consider the effect the decision might have on the productivity of their faculty. The analysis of this problem as viewed at SIU-Carbondale is described within. The analysis is performed by applying a set of criteria to a list of potential languages.

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

computer science
teaching
faculty
use
effect
analysis
tools

select
product
computer science curriculum
language


union types for object-oriented programming We propose union types for statically typed class-based object-oriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be considered a set union of instances of several types and behaves as their least common supertype. It also plays the role of an interface that 'factors out' commonality of given types---fields of the same name and methods with similar signatures. Union types can be useful for implementing heterogeneous collections and for grouping independently developed classes with similar interfaces, which has been considered difficult in languages like Java. To rigorously show the safety of union types, we formalize them on top of Featherweight Java and prove that the type system is sound.

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

type system
role
union types
java
sound
subtyping
types
flexibility
interfaces

object-oriented programming
method
language semantics
factor
language
collect
signature
group
language design
heterogeneity
class
object oriented language


Modeling frame-level errors in GSM wireless channels We compare four different approaches to modeling frame-level errors in GSM channels. One of these, the Markov-based Trace Analysis (MTA) model, was developed explicitly for this purpose. The next two, kth-order Markov models and hidden Markov models (HMMs), have been widely used to model loss in wired networks. All three of these have difficulty in modeling empirical GSM frame-level error traces. The MTA model and HMM predict frame-error rates substantially different from that measured from the trace, and all three models have difficulty in capturing the long term temporal correlation structure. We propose a fourth model, the extended On/Off model, which alternates between an On (error-free) and an Off (error-filled) state. The state holding times are taken from mixtures of geometric distributions. We show that this model, with mixtures of 47 geometric distributions captures first- and second-order statistics significantly better than the preceding three approaches.

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

markov-based trace analysis
on/off model
frame-level errors


graphical data structures in apl The continuing reduction in the price of graphics terminals has led to greater interest in graphics and computer aided design. This trend has in turn focussed attention on methods of modelling graphical data using programming languages and databases. This paper presents a method of defining, analyzing and transforming graphical data using an extended APL notation. The fundamental extension this notation makes to APL is to allow the items in an APL array to have a user defined data structure. A consequence of this extension is that the items in an array can now represent graphical entities such as circles, lines, points etc. In conventional APL an item in an array must be either a number or a character. In this extended notation an item in an array might be a structure designed to represent a point, or a circle, or any other entity.

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

attention
character
point
terminals
structure
method
price
design
data structures
reduction
data
graphics
paper
user

computation
arrays
extensibility
model
database
programming language


On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources Given a discrete memoryless source X, it is well known that the expected codeword length per symbol. L(n) (X) of an optimal prefix code for the extended source X(n) converges to the source entropy as n approaches infinity. However, the sequence L(n) (X) need not be monotonic in n, which implies that the coding efficiency cannot be increased by simply encoding a larger block of source symbols (unless the block length is appropriately chosen). As the encoding and decoding complexity increases exponentially with the block length, from a practical perspective it is useful to know when an increase in the block length guarantees a decrease in the expected codeword length per symbol. While this paper does not provide a complete answer to that question, we give some properties of L(n) (X) and obtain for each n >= 1 and nondyadic p(1)(n) (p(1) is the probability of the most likely source symbol) an integer k* for which L(kn) (X) = k*, implying that the coding efficiency of encoding blocks of length k(n) is higher than that of encoding blocks of length it for all k >= k*. This question is simpler in part because L(kn) (X) = 1 and k >= 1, but our results distinguish scenarios where increasing the multiplicative factor guarantees strict improvement. These results extend and generalize those by Montgomery and Kumar.

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

huffman codes
minimum codeword length
optimal codes


digital storytelling and computer game design This workshop uses a combination of short lecture and hands on practice to introduce digital storytelling and computer game design and the multitude of skills needed to successfully design digital stories and computer games. Working examples are taken from two current projects at Indiana University: Lost Highways and Rock-Paper-Scissors in Lizard Land.

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

computer game design
digital storytelling


A multi-instance ensemble learning model based on concept lattice This paper introduces concept lattice and ensemble learning technique into multi-instance learning, and proposes the multi-instance ensemble learning model based on concept lattice which can be applied to content-based image retrieval, etc. In this model, a ? ? -concept lattice is built based on training set firstly. Because bags rather than instances in bags will serve as objects of formal context in the process of building ? ? -concept lattice, the corresponding time complexity and space complexity can be effectively descend to a certain extent; Secondly, the multi-instance learning problem is divided into multiple local multi-instance learning problems based on ? ? -concept lattice, and local target feature sets are found further in each local multi-instance learning problem. Finally, the whole training set can be classified almost correctly by ensemble of multiple local target feature sets. Through precise theorization and extensive experimentation, it proves that the method is effective. Conclusions of this paper not only help to understand multi-instance learning better from the prospective of concept lattice, but also provide a new theoretical basis for data analysis and processing.

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

? ? -concept lattice ? ? ? ? ?
multi-instance learning
local target feature set
content-based image retrieval


can we elect if we cannot compare? The aim of this paper is to study the computational power of the qualitative model, where entities are given distinct labels which are however mutually incomparable; this model is opposed to the quantitative model, where labels are integers. The qualitative model captures, for example,the case when the labels are written in different alphabets (e.g., Cyrillic, Latin) and there is no a priori agreement on a common encoding. We investigate the qualitative model through the problem of leader election in a distributed mobile environment. All known leader election protocols assume that the initial input values are distinct and pairwise comparable. While distinctness of the input values is clearly required, the comparability assumption is questionable. Our concern is whether it is possible to remove this comparability assumption. To focus solely on this concern, we consider theproblem in its weakest setting: anonymous highly symmetric networks (i.e.,Cayley graphs). In this way, to break the symmetry (and thus elect a leader) among the incomparable mobile agents, we can not rely on the existence of distinguished node labels nor on any topological asymmetry of the network. We describe a generic election protocol which is effective for all anonymous Cayley graphs; i.e., it solves the election problem if the problem is solvable, otherwise it determines that the problem is not solvable. For arbitrary networks, our protocol is conditionally effective; that is, it performs election of one agent among any set of agents in any network, under some weak conditions on the network and on the initial positions of the agents. Our work is a first step toward a better understanding of the inherent differences between "quantitative computing" where parameters are taken from a total order, and "qualitative computing" where parameters are taken from a partial order.

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

rendezvous
anonymous networks
distributed computing


PREDOSE: A semantic web platform for drug abuse epidemiology using social media We present a semantic web platform for drug abuse research using social media. Social media texts could be an important resource in identifying new epidemiological trends. Extraction of appropriate semantic information may be beneficial to epidemiological research.

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

entity identification
relationship extraction
triple extraction
sentiment extraction
drug abuse ontology
opiod abuse
prescription drug abuse


Sufficient Conditions for Global Stability and Existence of Almost Automorphic Solution of a Class of RNNs In this paper a class of recurrent neural networks with variable coefficients and mixed delays is considered. After introducing definitions and preliminary lemmas, we prove under convenient assumptions the existence of an almost automorphic solution of the considered model. Moreover, the global exponential stability of the almost automorphic solution is studied. In addition, two examples are also given to illustrate the theory.

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

almost automorphic solution
rnns
global exponential stability


Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems We study the transmission of two discrete memoryless correlated sources, consisting of a common and a private source, over a discrete memoryless multiterminal channel with two transmitters and two receivers. At the transmitter side, the common source is observed by both encoders but the private source can only be accessed by one encoder. At the receiver side, both decoders need to reconstruct the common source, but only one decoder needs to reconstruct the private source. We hence refer to this system by the asymmetric two-user source-channel coding system. We derive a universally achievable lossless joint source-channel coding (JSCC) error exponent pair for the two-user system by using a technique which generalizes Csiszar's type-packing lemma (1980) for the point-to-point (single-user) discrete memoryless source-channel system. We next investigate the largest convergence rate of asymptotic exponential decay of the system (overall) probability of erroneous transmission, i.e., the system JSCC error exponent. We obtain lower and upper bounds for the exponent. As a consequence, we establish a JSCC theorem with single-letter characterization and we show that the separation principle holds for the asymmetric two-user scenario. By introducing common randomization, we also provide a formula for the tandem (separate) source-channel coding error exponent. Numerical examples show that for a large class of systems consisting of two correlated sources and an asymmetric multiple-access channel with additive noise, the JSCC error exponent considerably outperforms the corresponding tandem coding error exponent.

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

common randomization
discrete memoryless correlated sources
error exponent
separation principle
tandem coding

asymmetric two-user source-channel system

lossless joint source-channel coding (jscc)


The Effects of Leader-Member Exchange on Member Performance in Virtual World Teams Understanding the role of leadership in virtual world teams may help shed light on how to manage synchronous and highly interdependent work activities. Based upon leader-member exchange (LMX) theory, we propose that the relationship between a leader and a team member (LMX) influences 1) the degree to which a team member is allocated resources by the leader (empowerment and group assignments), 2) the degree to which a team member develops relational resources with the team (trust, obligation, norms, and identification), and 3) the extent to which a team member receives or develops resources results in higher levels of individual performance. Our findings from a longitudinal field study of one large virtual world team in the massively multiplayer online game (MMOG) EverQuest suggest that the leader member relationship does impact members' allocation and development of resources, and that it's not just the quantity of members' resources, but also the type of member resources, that has a direct influence on performance. Our findings also indicate that the influence of the leader-member relationship on member performance is fully mediated by the allocation and development of resources. Surprisingly, there was no relationship between LMX, trust, and performance, which suggests that trust may not be as vital in virtual teams where everyone's actions are visible. Lastly, the findings suggest that building relational capital to facilitate the transformation from self to collective interest may be an effective leadership tactic when managing large virtual teams or social collectives.

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

virtual world team
resources
relational capital
performance
collective interest

leader-member exchange (lmx)
social collective
mmogs
virtual team


reference-driven performance anomaly identification Complex system software allows a variety of execution conditions on system configurations and workload properties. This paper explores a principled use of reference executions--those of similar execution conditions from the target--to help identify the symptoms and causes of performance anomalies. First, to identify anomaly symptoms, we construct change profiles that probabilistically characterize expected performance deviations between target and reference executions. By synthesizing several single-parameter change profiles, we can scalably identify anomalous reference-to-target changes in a complex system with multiple execution parameters. Second, to narrow the scope of anomaly root cause analysis, we filter anomaly-related low-level system metrics as those that manifest very differently between target and reference executions. Our anomaly identification approach requires little expert knowledge or detailed models on system internals and consequently it can be easily deployed. Using empirical case studies on the Linux I/O subsystem and a J2EE-based distributed online service, we demonstrate our approach's effectiveness in identifying performance anomalies over a wide range of execution conditions as well as multiple system software versions. In particular, we discovered five previously unknown performance anomaly causes in the Linux 2.6.23 kernel. Additionally, our preliminary results suggest that online anomaly detection and system reconfiguration may help evade performance anomalies in complex online systems.

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


context-aware middleware for mobile multimedia applications We present a context-aware middleware for mobile multimedia applications. The middleware offers functionality for service discovery, asynchronous messaging, publish/subscribe event management, storing and management of context information, building the user interface, and handling the local and network resources. It supports a wide range of context information including location, time, and user's preferences. Further, it allows controlling the connectivity of the device; the middleware is capable of switching traffic from one network connection to another. It can locate the services and software components as well. It facilitates development of multimedia applications by handling such functions as capture and rendering, storing, retrieving and adapting of media content to various mobile devices. The middleware offers facilities for media alerts, which are multimedia messages that are generated when predefined context is recognized. With these capabilities, it enables development of complex context-aware multimedia applications for mobile devices.

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

multimedia content adaptation
context-aware and mobile computing


Semantics-based services for a low carbon society: An application onemissions trading system data and scenarios management A semantics-based approach for the Low Carbon Society is proposed. A Knowledge Base for the Emissions Trading System (ETS) is presented. Ontological foundations of the ETS ontology (EREON) are described. Rules Taxonomy and Rules Catalogue are the basis for the semantic services.

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

low carbon society
emissions trading system
ontology

semantic rule
semantics-based technology


fast evaluation of structured queries for information retrieval Information retrieval systems are being challenged to manage larger and larger document collections. In an effort to provide better retrieval performance on large collections, more sophisticated retrieval techniques have been developed that support rich, structured queries. Structured queries are not amenable to previously proposed optimization techniques. Optimizing execution, however, is even more important in the context of large document collections. We present a new structured query optimization technique which we have implemented in an inference network-based information retrieval system. Experimental results show that query evaluation time can be reduced by more than half with little impact on retrieval effectiveness.

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

inference systems performance context retrieval queries evaluation query

network
structure
experimentation
optimality
collect
timing
documentation
effect
information retrieval


Numerically stable fluid-structure interactions between compressible flow and solid structures We propose a novel method to implicitly two-way couple Eulerian compressible flow to volumetric Lagrangian solids. The method works for both deformable and rigid solids and for arbitrary equations of state. The method exploits the formulation of [11] which solves compressible fluid in a semi-implicit manner, solving for the advection part explicitly and then correcting the intermediate state to time t(n+1) using an implicit pressure, obtained by solving a modified Poisson system. Similar to previous fluid-structure interaction methods, we apply pressure forces to the solid and enforce a velocity boundary condition on the fluid in order to satisfy a no-slip constraint. Unlike previous methods, however, we apply these coupled interactions implicitly by adding the constraint to the pressure system and combining it with any implicit solid forces in order to obtain a strongly coupled, symmetric indefinite system (similar to [17], which only handles incompressible flow). We also show that, under a few reasonable assumptions, this system can be made symmetric positive-definite by following the methodology of [16]. Because our method handles the fluid-structure interactions implicitly, we avoid introducing any new time step restrictions and obtain stable results even for high density-to-mass ratios, where explicit methods struggle or fail. We exactly conserve momentum and kinetic energy (thermal fluid-structure interactions are not considered) at the fluid-structure interface, and hence naturally handle highly non-linear phenomenon such as shocks, contacts and rarefactions. (C) 2011 Elsevier Inc. All rights reserved.

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

fluid-structure interactions
implicit methods
conservative schemes