Delayed open access: An overlooked high-impact category of openly available scientific literature Delayed open access (OA) refers to scholarly articles in subscription journals made available openly on the web directly through the publisher at the expiry of a set embargo period. Although a substantial number of journals have practiced delayed OA since they started publishing e-versions, empirical studies concerning OA have often overlooked this body of literature. This study provides comprehensive quantitative measurements by identifying delayed OA journals and collecting data concerning their publication volumes, embargo lengths, and citation rates. Altogether, 492 journals were identified, publishing a combined total of 111,312 articles in 2011; 77.8% of these articles were made OA within 12 months from publication, with 85.4% becoming available within 24 months. A journal impact factor analysis revealed that delayed OA journals have citation rates on average twice as high as those of closed subscription journals and three times as high as immediate OA journals. Overall, the results demonstrate that delayed OA journals constitute an important segment of the openly available scholarly journal literature, both by their sheer article volume and by including a substantial proportion of high-impact journals.

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


Minimising Cell Transmit Power: Towards Self-organized Resource Allocation in OFDMA Femtocells With the introduction of femtocells, cellular networks are moving from the conventional centralised architecture to a distributed one, where each network cell should make its own radio resource management decisions, while providing inter-cell interference mitigation. However, realising this distributed cellular network architecture is not a trivial task. In this paper, we first introduce a simple self-organisation rule under which a distributed cellular network is able to converge into an efficient resource allocation pattern, then propose a novel resource allocation model taking realistic resource allocation constraints into account, and finally evaluate the performance of the proposed self-organisation rule and resource allocation model using system-level simulations.

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


ROBUST H-infinity CONTROL OF AN UNCERTAIN SYSTEM VIA A STABLE DECENTRALIZED OUTPUT FEEDBACK CONTROLLER This paper presents a procedure for constructing a stable decentralized output feedback controller for a class of uncertain systems in which the uncertainty is described by Integral Quadratic Constraints. The controller is constructed to solve a problem of robust H-infinity control. The proposed procedure involves solving a set of algebraic Riccati equations of the H-infinity control type which are dependent on a number of scaling parameters. By treating the off-diagonal elements of the controller transfer function matrix as uncertainties, a decentralized controller is obtained by taking the block-diagonal part of a non-decentralized stable output feedback controller which solves the robust H infinity control problem. This approach to decentralized controller design enables the controller to exploit the coupling between the subsystems of the plant.

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

robust control
decentralized control
h-infinity control


A Bayesian approach to information fusion for evaluating the measurement uncertainty The Bayesian approach to uncertainty evaluation is a classical example of the fusion of information from different sources. Basically, it is founded on both the knowledge about the measurement process and the influencing quantities and parameters. The knowledge about the measurement process is primarily represented by the so-called model equation, which forms the basic relationship for the fusion of all involved quantities. The knowledge about the influencing quantities and parameters is expressed by their degree of belief, i.e. appropriate probability density functions that usually are obtained by utilizing the principle of maximum information entropy and the Bayes theorem. Practically, the Bayesian approach to uncertainty evaluation is put into effect by employing numerical integration techniques, preferably Monte-Carlo methods. Compared to the ISO-GUM procedure, the Bayesian approach does not have any restrictions with respect to nonlinearities and calculation of confidence intervals.

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

measurement uncertainty
fusion
bayes
probability density


Modeling and simulating coordination in projects A main challenge in managing projects is identification and understanding of interactions between subtasks. These interactions give rise to dependencies between activities in the project plan. The resulting interdependence between members of the project team requires them to coordinate extensively during project execution. Project managers need a systematic methodology for describing and analyzing coordination requirements on project teams. This need is not met in traditional tools for project planning and scheduling. In this article, we describe an object-oriented framework for modeling projects and a methodology for formalizing these models such that they can be used for discrete event simulation of information processing and coordination in project execution. Our modeling framework represents projects in terms of objective (requirements), product (solution deliverables), process (activities), and organization (participants and relations). We then use matrix techniques to explicate the constraints between project requirements and deliverables (complexity), the contingencies in information flow between activities (uncertainty), and the resulting coordination requirements between project team members. The model and coordination measures can be used as input for simulation of project execution and give predictions for the probable effects of carrying out proposed changes in planning and managing projects. To illustrate how enterprise modeling and analysis can inform project planing and execution, we apply our framework and methodology to model and simulate a simplified project for development of hydraulic systems. Our simulation results demonstrate how project performance is contingent on the fit between the project policies and the objectives and preferences of the project team.

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

enterprise modeling
coordination
information processing
simulation

project management
quality function deployment


Stochastic approximation for background modelling Many background modelling approaches are based on mixtures of multivariate Gaussians with diagonal covariance matrices. This often yields good results, but complex backgrounds are not adequately captured, and post-processing techniques are needed. Here we propose the use of mixtures of uniform distributions and multivariate Gaussians with full covariance matrices. These mixtures are able to cope with both dynamic backgrounds and complex patterns of foreground objects. A learning algorithm is derived from the stochastic approximation framework, which has a very reduced computational complexity. Hence, it is suited for real time applications. Experimental results show that our approach outperforms the classic procedure in several benchmark videos.

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

background modelling
stochastic approximation

probabilistic mixture models
unsupervised learning


A rational approach to memory search termination An important component of many, if not all, real-world retrieval tasks is the decision to terminate memory search. Despite its importance, systematic evaluations of the potential rules for terminating search are scarce. Recent work has focused on two variables: the total time spent in memory search before search is terminated and the exit latency (the time between the last retrieved item and the time of search termination). These variables have been shown to limit the number of plausible rules for terminating memory search. Here, we introduce an alternative stopping rule based on a rational moment-to-moment costbenefit analysis and derive a closed-form expression of the exit latency function using this rational approach. We show the models ability to capture critical latency data and make testable predictions about the influence of changing the relative costs and benefits of memory search. Results from an experiment are presented that support the models predictions. We conclude that the decision to terminate memory search is based on moment-to-moment changes in subjective utility of retrieved memories.

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


Dealing with inconsistent secure messages by weighting majority Messages transmitted between senders and receivers might be inconsistent owing to potential communication block, message lost and/or malicious attacks, in electronic commerce. And current formal methods for security protocol analysis show limitations in handling the incoherent secure messages that may be derived from different sources or at different moments. This results in increasing risk of e-commerce activities. This paper thus proposes a formal framework to deal with the inconsistency in secure messages by weighting majority. The freshness and dynamics properties of secure messages are considered and a reliability function is developed to measure the belief in secure messages. This helps us verify protocols in an intuitive way and guarantees correct verification results. The experimental results demonstrate our method is useful in secure protocol analysis. (C) 2010 Elsevier B.V. All rights reserved.

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

inconsistency reliability freshness dynamics majority belief


Aqueous solubility of a simple (single-carbon) organic molecule as a function of its size & dipole moment The aqueous solubility of a single-carbon organic molecule as a function of its size & dipole moment was investigated. The molecular dipole moment was chosen to represent the polar character of a poly-atomic molecule. It is hypothesized here that at a given pH, temperature, and pressure, the solubility of a single-carbon organic molecule in water will be a function of its polar character; namely, dipole moment and of its molecular size. Different forms of the solubility function were tested; it was found that the solubility model, given by Eq. 1, which is based on the polar character and the molecular volume, adequately described the aqueous solubility of single-carbon organic moieties. The aqueous solubility of single-carbon organic solutes exhibits maximum at the condition of high polar character (large dipole moment) and low molecular volume. The general trend of the solubility of single-carbon organic solutes, based on the proposed model (Eq. 1) could be explained in terms of the trade-off between the driving force (degree of polar character of the solute) for solubilization versus the resistance to be solubilized as a result of the entropic effects which increase with increasing molecular volume of the organic moiety.

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

aqueous solubility
dipole moment
entropic effects
polar

single-carbon organic solute
van der waals volume


Variable-strength conditional preferences for ranking objects in ontologies ? We introduce conditional preference bases as a means for ranking objects in ontologies. Conditional preference bases consist of a description logic knowledge base and a finite set of conditional preferences, which are statements of the form generally, in the context ? ? , property ? ? is preferred over property ? ? with strength s . They are inspired by variable-strength defaults in conditional knowledge bases. We define the notion of consistency for conditional preference bases, and we show how consistent conditional preference bases can be used for ranking objects in ontologies, where every object represents essentially a set of individuals that are sharing the same ranking-relevant properties. More concretely, we define two object rankings, denoted ?sum ? sum and ?lex ? lex , which evaluate the strengths of conditional preferences in an additive and a lexicographic way, respectively. Furthermore, we provide algorithms for the main computational tasks for ranking objects under conditional preference bases, we analyze the complexity of these tasks, and we delineate a tractable special case. To give evidence of the usefulness of this approach in practice, we describe two applications in the areas of product and literature search, where it allows especially for a flexible user-defined ranking of the query results reflecting personal preferences.

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

ranking
description logic
literature search


Multilevel modeling and inference of transcription regulation The understanding of transcription regulation is a major goal of today's biology. The challenge is to utilize diverse high-throughput data in order to infer mechanistic models of transcription control. We propose a new model which integrates transcription factor-gene affinity, protein abundance, and gene expression profiles. The model provides a detailed, yet computationally tractable description of the relations between transcription factors, their binding sites at gene promoters, and the combinatorial regulation of transcription. At the core, our model manipulates dose-affinity-response functions that associate transcription factor concentrations and transcription factor-DNA affinities to determine the rate of transcription factor-DNA reactions. We study computational problems that arise in optimizing such models and develop polynomial algorithms for certain problems. We show how to assess missing values (notably protein abundance) and describe a novel framework to infer models from currently available data. On budding yeast carbohydrate metabolism data, our results demonstrate the sensitivity and specificity of the approach. They also suggest new active binding sites and a regulation model for the transcription program of the galactose system.

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

transcriptional programs
gene expression analysis
sequence motifs


Framework for managing business development in the networked organisation Successful business practice is traditionally discussed in terms of the operational characteristics of business organisations. How successful organisations operate and behave is of interest to all analysts. Increasingly, however, business success is viewed through the process of managing development, where management decisions are informed by appropriate and timely information. Managing development information such as customer requirements, business strategies, development projects and idea generation is central to achieving business growth. This paper presents research aimed at developing an information architecture and associated toolset for understanding and managing the process of business development. The research has lead to the creation of a groupware application that marries a number of distinct areas of research including strategic planning, performance measurement, enterprise modelling, project portfolio management and team management. The groupware helps communicate all the core development information necessary for informed decision-making and brings all the people responsible for development in the organisation closer together. (C) 2002 Elsevier Science B.V. All rights reserved.

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

networked organisations
teams
development funnel
internet teams


Managing deadline miss ratio and sensor data freshness in real-time databases The demand for real-time data services is increasing in many applications including e-commerce, agile manufacturing, and telecommunications network management. In these applications, it is desirable to execute transactions within their deadlines, i.e., before the real-world status changes, using fresh (temporally consistent) data. However, meeting these fundamental requirements is challenging due to dynamic workloads and data access patterns in these applications. Further, transaction timeliness and data freshness requirements may conflict. In this paper, we define average/transient deadline miss ratio and new data freshness metrics to let a database administrator specify the desired quality of real-time data services for a specific application. We also present a novel QoS management architecture for real-time databases to support the desired QoS even in the presence of unpredictable workloads and access patterns. To prevent overload and support the desired QoS, the presented architecture applies feedback control, admission control, and flexible freshness management schemes. A simulation study shows that our QoS-aware approach can achieve a near zero miss ratio and perfect freshness, meeting basic requirements for real-time transaction processing. In contrast, baseline approaches fail to support the desired miss ratio and/or freshness in the presence of unpredictable workloads and data access patterns.

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

deadline miss ratio
sensor data freshness
qos management


making virtual conversational agent aware of the addressee of users' utterances in multi-user conversation using nonverbal information In multi-user human-agent interaction, the agent should respond to the user when an utterance is addressed to it. To do this, the agent needs to be able to judge whether the utterance is addressed to the agent or to another user. This study proposes a method for estimating the addressee based on the prosodic features of the user's speech and head direction (approximate gaze direction). First, a WOZ experiment is conducted to collect a corpus of human-humanagent triadic conversations. Then, analysis is performed to find out whether the prosodic features as well as head direction information are correlated with the addressee-hood. Based on this analysis, a SVM classifier is trained to estimate the addressee by integrating both the prosodic features and head movement information. Finally, a prototype agent equipped with this real-time addressee estimation mechanism is developed and evaluated.

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

verbal and nonverbal expressiveness
agents in games and virtual enviroments
multimodal interaction


a study on government-dominated e-government outsourcing model Based on interviews and field research, this paper presents a comparison of the strengths and weaknesses of various outsourcing models generally adopted by Chinese government agencies in their e-government initiatives, with special focus laid on the elaboration of the government-dominated e-government outsourcing model. With a view to solving the problem of staff shortage, ensuring governmental information security, and promoting sustainable development of e-government, China's General Administration of Quality Supervision, Inspection and Quarantine (AQSIQ) has organized a limited liability company--Beijing iTowNet Cyber Technology Ltd, to provide outsourcing services concerning e-government system development, operation and maintenance for the administration. With such measures as rational ownership structure, adequate management, and introduction of standards, AQSIQ has not only successfully addressed difficulties caused by lack of human, technical, and financial resources, but ensured its dominance, supervision and control over e-government outsourcing. This paper not only advocates a specific government-dominated approach for other Chinese government agencies to learn from in their e-government initiatives, but provides an innovative theoretical perspective and serves as a typical case for study for government agencies of many other developing countries.

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

e-government outsourcing
quality inspection and quarantine
government-dominated


A recurrent neuro-fuzzy system and its application in inferential sensing Conventional neuro-fuzzy systems cannot effectively cope with dynamic processes, such as the heating systems of the buildings, due to the feed forward network structure. To overcome this problem, the existing hybrid system is incorporated with a feedback loop so that it can model the dynamical behavior of the process. As a case study, this improved hybrid system is employed to build an inferential model that estimates the average air temperature in a building served by a forced-warm-air heating system. The results show that the inferential model based on this improved hybrid system is accurate and robust. The parameter identification and tuning process is effective. Compared with conventional hybrid neuro-fuzzy system, it can significantly improve the performance of the inferential models. The neuro-fuzzy model incorporated with the feed-back loop has been tested using experimental data and the worst monthly RMSE as 0.062C. This means that the inferential model can be employed to design better control schemes to improve indoor environmental quality and to save energy in buildings.

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

adaptive systems
fuzzy logic
hybrid learning
neuro-fuzzy systems


Generation Y, web design, and eye tracking Generation Y (age 1831) is a very large and economically powerful generation, containing eighty-two million people and spending $200 billion annually. It is not surprising that companies are interested in gaining the patronage of this group, particularly via the web. Surprisingly, very little research into making web pages appealing to this important demographic has been done. This paper addresses this need through two separate studies. The first, an online survey, provides evidence that our proposed score for predicting the visual appeal of web pages reflects the self report measure of what pages Generation Y likes. To refine these findings, an eye tracking study is conducted using the pages that were most and least liked in Study I. Participants eye movement is tracked while browsing these pages, providing evidence of what attracts their attention. The results of these two studies suggest that Generation Y may prefer pages that include a main large image, images of celebrities, little text, and a search feature. This research has important implications.

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

millenials
hci
human computer interaction
eye tracker
fixation
gaze
usability


Entropy based Binary Particle Swarm Optimization and classification for ear detection Entropy based Binary Particle Swarm Optimization for enhanced ear detection independent of the dataset. Entropy based classifier for accurate classification of ear and non-ear segments in the detected regions. Dual Tree Complex Wavelet Transform for threshold based background pruning.

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

entropy
ear detection
binary particle swarm optimization
dual tree complex wavelet transform


Development of a wavenumber-preserving scheme for solving Maxwells equations in curvilinear non-staggered grids In this paper a compact finite-difference solver for solving the Maxwells equations in curvilinear coordinates is presented. The scheme formulated in time domain can theoretically preserve zero-divergence condition and scaled wavenumber characteristics in non-staggered grids. The inherent local conservation laws are also retained discretely all the time. The space and time derivative terms are approximated to yield an equal fourth-order spatial and temporal accuracy. In irregular physical domain, Maxwells equations are recast in terms of the contravariant and covariant field variables so that the developed dual-preserving solver can be directly implemented. In addition, in curvilinear coordinates the four components in the metric tensor have been calculated under the guideline that the determinant of the transformation matrix is computed exactly. Through the computational exercises, it is demonstrated that the newly proposed solver with a fairly small numerical scaled wavenumber error in curvilinear coordinates is computationally efficient for use to get the long time accurate Maxwells solutions in irregular physical domain.

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

maxwells equations
curvilinear coordinates
numerical scaled wavenumber error

non-staggered grids
zero-divergence
fourth-order
dual-preserving solver


Parallel design for error-resilient entropy coding algorithm on GPU The error-resilient entropy coding (EREC) algorithm is an effective method for combating error propagation at low cost in many compression methods using variable-length coding (VLC). However, the main drawback of the EREC is its high complexity. In order to overcome this disadvantage, a parallel EREC is implemented on a graphics processing unit (GPU) using the NVIDIA CUDA technology. The original EREC is a finer-grained parallel at each stage which brings additional communication overhead. To achieve high. efficiency of parallel EREC, we propose partitioning the EREC (P-EREC) algorithm, which splits variable-length blocks into groups and then every group is coded using the EREC separately. Each GPU thread processes one group so as to make the EREC coarse-grained parallel. In addition, some optimization strategies are discussed in order to obtain higher performance using the GPU. In the case that the variable-length data blocks are divided into 128 groups (256 groups, resp.), experimental results show that the parallel P-EREC achieves 32x to 123x (54x to 350x, resp.) speedup over the original C code of EREC compiled with the 02 optimization option. Higher speedup can even be obtained with more groups. Compared to the EREC, the P-EREC not only achieves a good speedup performance, but it also slightly improves the resilience of the VLC bit-stream against burst or random errors. (C) 2013 Elsevier Inc. All rights reserved.

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


Investigation of long throw PVD of titanium films from polycrystalline targets with texture The influence of target properties on the deposition of titanium films by long throw sputtering has been studied using Monte Carlo simulation. The precise knowledge and consideration of existing textures is shown to be a necessary prerequisite for the correct prediction of deposition rates and the radial dependence of film thickness as well. The experimental investigation of target textures has been carried out both by electron backscatter diffraction and X-ray diffraction. The results are compared and discussed.

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

physical vapor deposition
target texture


Inequalities of NordhausGaddum type for doubly connected domination number A set S S of vertices of a connected graph G G is a doubly connected dominating set if every vertex not in S S is adjacent to some vertex in S S and the subgraphs induced by S S and V?S V ? S are connected. The doubly connected domination number ?cc(G) ? c c ( G ) is the minimum size of such a set. We prove that when G G and G are both connected of order n n , ? c c ( G ) + ? c c ( G ) ? n + 3 and we describe the two infinite families of extremal graphs achieving the bound.

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

doubly connected dominating set
doubly connected domination number


end-host multicasting in support of distributed real-time simulation systems There has recently been a tremendous level of interest inthe use of end-host multicast to provide group communicationwithin a wide area network. End-host multicast shiftsthe burden of group-communication support from networkrouters to the host. End-host multicasting is required whenIP multicasting is not available. The difficulty in using thistechnique is that it requires additional resource consumptionwhen compared to native IP multicasting. This paperpresents several novel end-host multicast algorithms designedfor peer-to-peer real-time simulation systems. Ourtechniques utilize application level admission control inorder to more fairly balance the communication load in thephysical network. We propose and evaluate an adaptiverouting policy to find overflow paths between end-hostsand simulation agents placed within the system. We alsopresent several heuristics for routing tree construction,including a simulated annealing approach. We haveevaluated our methods through simulation, and the resultsshow that our methods achieve performance similar to optimalIP multicasting.

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

end-host multicasting
system support for agent-based systems
overlay multicasting


EMPIRICAL EVALUATION OF CLASSIFIERS FOR SOFTWARE RISK MANAGEMENT Software development involves plenty of risks, and errors exist in software modules represent a major kind of risk. Software defect prediction techniques and tools that identify software errors play a crucial role in software risk management. Among software defect prediction techniques, classification is a commonly used approach. Various types of classifiers have been applied to software defect prediction in recent years. How to select an adequate classifier (or set of classifiers) to identify error prone software modules is an important task for software development organizations. There are many different measures for classifiers and each measure is intended for assessing different aspect of a classifier. This paper developed a performance metric that combines various measures to evaluate the quality of classifiers for software defect prediction. The performance metric is analyzed experimentally using 13 classifiers on 11 public domain software defect datasets. The results of the experiment indicate that support vector machines (SVM), C4.5 algorithm, and K-nearest-neighbor algorithm ranked the top three classifiers.

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

classification
software risk management
software defect prediction
performance metric


scoring missing terms in information retrieval tasks An usual approach to address mismatching vocabulary problem is to augment the original query using dictionaries and other lexical resources and/or by looking at pseudo-relevant documents. Either way, terms are added to form a new query that will be used to score all documents in a subsequent retrieval pass, and as consequence the original query's focus may drift because of the newly added terms. We propose a new method to address the mismatching vocabulary problem, expanding original query terms only when necessary and complementing the user query for missing terms while scoring documents. It allows related semantic aspects to be included in a conservative and selective way, thus reducing the possibility of query drift. Our results using replacements for the missing query terms in modified document and passages retrieval methods show significant improvement over the original ones.

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

select
addressing
automatic query expansion
passage retrieval
relevance
aspect
documentation
resource
document retrieval
information retrieval


Pointillist video stylization based on particle tracing We present an algorithm that stylizes an input video into a painterly animation without user intervention. In particular, we focus on pointillist animation with stable temporal coherence. Temporal coherence is an important problem in non-photorealistic rendering for videos. To realize pointillist animation, the various characters of pointillism should be considered in painting process to maintain temporal coherence. For this, weused the particle video algorithm which is a new approach to long-range motion estimation in video. Based on this method, we introduce a method to control the density of particles considering the features of frames and importance maps. Finally, the propagation methods of stroke to minimize flickering effects of brush strokes are introduced.

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

video stylization
pointillist animation
temporal coherence

non-photorealistic rendering and animation


Optimal economic dispatch with valve loading effect using self-adaptive firefly algorithm Economic dispatch (ED) problem exhibits highly nonlinear characteristics, such as prohibited operating zone, ramp rate limits, and non-smooth property. Due to its nonlinear characteristics, it is hard to achieve the expected solution by the classical methods. To overcome the challenging difficulty, this paper proposes an improved firefly algorithm (FA) to solve economic dispatch (ED) problem. The improved FA employs two strategies to enhance the search ability and avoid the premature usually suffered from in standard FA. The first one is based on the distance information among the fireflies, and it adjusts the light absorption coefficient adaptively. The other one is a decreasing strategy for the randomization parameter. Additionally, a crossover operation is employed to create potential solution with high diversity. The designs are able to enhance the search ability and performance of FA, which have been demonstrated on six benchmark functions. To validate the proposed algorithm, we also use three different systems to demonstrate its efficiency and feasibility in solving ED problem. The experimental results show that the proposed FA method was capable of achieving higher quality solutions in ED problems.

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

firefly algorithm
economic dispatch
valve loading effect


Normal forms in BL-algebra and their contribution to universal approximation of functions This paper continues the investigation of approximating properties of generalized normal forms in fuzzy logic. The problem is formalized and solved algebraically. Normal forms are considered in two variants: infinite and finite. It is proved that infinite normal forms are universal representation formulas whereas finite normal forms are universal approximation formulas for any L-valued function where L is a support set of any complete BL-algebra. The estimation of the quality of approximation is suggested. Moreover, functions which can be precisely represented by the discrete normal forms are considered. (C) 2003 Elsevier B.V. All rights reserved.

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

disjunctive and conjunctive normal forms


Diagnosability of star graphs with missing edges ? In this paper, we study the system diagnosis on an n-dimensional star under the comparison model. Following the concept of local diagnosability [3], the strong local diagnosability property [7] is discussed; this property describes the equivalence of the local diagnosability of a node and its degree. We prove that an n-dimensional star has this property, and it keeps this strong property even if there exist n?3 missing edges in it.

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

star graph
comparison diagnosis model
mm? diagnosis model
extended star structure
strong local diagnosability property


Electric machine operational modeling utilizing coupled electromagnetic and electric drives simulations Purpose - The purpose of this research is to develop new techniques for component physical modeling for the dynamic simulation of integrated power systems. Design/methodology/approach - A FE-based phase variable model is proposed so as to achieve fast and accurate simulation. Such a model is established based on the nonlinear transient FE analysis, in order to take into consideration the harmonic effects due to the nonlinear magnetization property, magnetic circuit geometry as well as other design variations. Findings - In the FE-based phase variable model, the inductances are described as functions of the phase angle and the magnitude of winding currents, the rotor position and other operational parameters. They are obtained from the transient FE solutions, stored in tables, and retrieved during the simulation. The FE-based phase variable model is implemented in Simulink in two ways. The first is the equation-based block and the second is the circuit component-based block. The FE-based phase variable models of various electrical components in the power system were studied. This includes various types of rotating machines and transformers. Examination and application examples show the correctness and effectiveness of the proposed operational modeling procedures. Originality/value - The developed FE-based physical phase variable model is as accurate as the full FE model with much faster simulation speed. It will benefit the dynamic simulation of integrated power system. This combination of physical modeling and integrated dynamic simulation is original and represents an added value to the state-of-the-art in this field.

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

modelling
finite element analysis
electric machines


Comparison between longitudinal tensile characteristics of thin and thick thermoset composite laminates: influence of curing conditions In a previous study we set up an optimization procedure for thick laminate cure cycles. This procedure enabled us to determine an optimized cure cycle for manufacturing two 31.5 mm thick laminates with different stacking sequences. We also analyzed their physical characteristics which were found to be uniform throughout the laminate thickness except for the fiber volume fraction. The next stage consisted of comparing the longitudinal tensile mechanical behavior of 31.5 mm thick and thin laminates with similar stacking sequences and physical characteristics. The tests performed on thick (252 plies) and thin (28 plies) laminates prove the validity of the optimized cure cycle, since the difference between thin and thick laminates mechanical characteristics was shown to be highly dependent on the testing conditions.

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

thin laminates
thick laminates
longitudinal tensile characteristics

composite materials
cure cycles optimization


Loop summarization using state and transition invariants This paper presents algorithms for program abstraction based on the principle of loop summarization, which, unlike traditional program approximation approaches (e.g., abstract interpretation), does not employ iterative fixpoint computation, but instead computes symbolic abstract transformers with respect to a set of abstract domains. This allows for an effective exploitation of problem-specific abstract domains for summarization and, as a consequence, the precision of an abstract model may be tailored to specific verification needs. Furthermore, we extend the concept of loop summarization to incorporate relational abstract domains to enable the discovery of transition invariants, which are subsequently used to prove termination of programs. Well-foundedness of the discovered transition invariants is ensured either by a separate decision procedure call or by using abstract domains that are well-founded by construction.

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

program abstraction
loop summarization
transition invariants
termination


Managing risks in an open computing environment using mean absolute deviation portfolio optimization Users who execute their jobs in an open computing environment are exposed to risks, because open computing resources have variance in their performance. This paper proposes the mean absolute deviation portfolio optimization model to control uncertainties of open resources. The effect of the model was investigated using simulations. The simulation results show that diversified resource portfolios can satisfy users risk requirements and maintain the stability of the open computing market only if either the risk information of the global data repository can be checked in real-time or service brokers directly record the performance history of used resources.

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


Generalized satisfiability for the description logic ALC l The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSpAcE-complete, and it is EXPTIME-complete in the presence of general concept inclusions. Several fragments of ALC, notably logics in the F L, E L, and DL-Lite families, have an easier satisfiability problem; for some of these logics, satisfiability can be decided in polynomial time. We classify the complexity of the standard variants of the satisfiability problem for all possible Boolean and quantifier fragments of ALC with and without general concept inclusions. (C) 2013 Published by Elsevier B.V.

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

satisfiability
alc
complexity
description logic


Impact of protocol overheads on network throughput over high-speed interconnects: measurement, analysis, and improvement Although extremely high-speed interconnects are available today, the traditional protocol stacks such as TCP/IP and UDP/IP are not able to utilize the maximum network bandwidth due to inherent overheads in the protocol stacks. Such overheads are a big obstacle for high-performance computing applications to exploit highspeed interconnects in cluster environments. To address this issue, many researchers have been presenting analyses of protocol overheads and suggesting a number of optimization approaches to harness the TCP/IP suite over high-speed interconnects. However, to the best of our knowledge, there is no study that analyzes and optimizes the protocol overheads thoroughly in an integrated manner. In this paper, we exploit a set of protocol optimization mechanisms in an integrated manner while dealing with the full spectrum of the protocol layers from the transport layer to the physical layer. To evaluate the impact of each protocol overhead, we apply the optimization mechanisms one by one and perform detailed analyses at each step. The thorough overhead measurements and analyses reveal the dependencies between protocol overheads. With our comprehensive optimizations, we show that UDP/IP can utilize more than 95% of the maximum network throughput a Myrinet-based experimental system can provide.

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

udp/ip
myrinet
clusters
high-speed interconnects
programmable network interface cards


A Framework for Theory Development in Design Science Research: Multiple Perspectives One point of convergence in the many recent discussions on design science research in information systems (DSRIS) has been the desirability of a directive design theory (ISDT) as one of the outputs from a DSRIS project. However, the literature on theory development in DSRIS is very sparse. In this paper, we develop a framework to support theory development in DSRIS and explore its potential from multiple perspectives. The framework positions ISDT in a hierarchy of theories in IS design that includes a type of theory for describing how and why the design functions: Design-relevant explanatory/predictive theory (DREPT). DREPT formally captures the translation of general theory constructs from outside IS to the design realm. We introduce the framework from a knowledge representation perspective and then provide typological and epistemological perspectives. We begin by motivating the desirability of both directive-prescriptive theory (ISDT) and explanatory-predictive theory (DREPT) for IS design science research and practice. Since ISDT and DREPT are both, by definition, mid-range theories, we examine the notion of mid-range theory in other fields and then in the specific context of DSRIS. We position both types of theory in Gregor's (2006) taxonomy of IS theory in our typological view of the framework. We then discuss design theory semantics from an epistemological view of the framework, relating it to an idealized design science research cycle. To demonstrate the potential of the framework for DSRIS, we use it to derive ISDT and DREPT from two published examples of DSRIS.

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

design science research
theory development
framework


A domain decomposition method for biharmonic equation The domain decomposition method proposed by Schwarz [1] is gaining significance in view of the possibilities for parallel implementation. In this paper, we apply the domain decomposition method to the biharmonic equation in two overlapping discs. In each subdomain, a boundary integral formula is used to obtain the solution. Unlike the finite element or finite difference methods where the iterations have to be performed on the entire domain, the iterations of the boundary integral formulation need to be done only at the discretized points of the boundaries. Another aspect of the paper is that, in order to handle the operations with dense matrices arising from the boundary integral formulation, the discrete wavelet transform is used to compress the matrices which results in reduced computations without loss of accuracy. Examples involving a Laplace equation in an L-shaped region and a domain bounded by a cardioid and a circle are also illustrated. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

domain decomposition method
wavelet transform
biharmonic equation


ranking-based clustering of heterogeneous information networks with star network schema A heterogeneous information network is an information network composed of multiple types of objects. Clustering on such a network may lead to better understanding of both hidden structures of the network and the individual role played by every object in each cluster. However, although clustering on homogeneous networks has been studied over decades, clustering on heterogeneous networks has not been addressed until recently. A recent study proposed a new algorithm, RankClus, for clustering on bi-typed heterogeneous networks. However, a real-world network may consist of more than two types, and the interactions among multi-typed objects play a key role at disclosing the rich semantics that a network carries. In this paper, we study clustering of multi-typed heterogeneous networks with a star network schema and propose a novel algorithm, NetClus, that utilizes links across multityped objects to generate high-quality net-clusters. An iterative enhancement method is developed that leads to effective ranking-based clustering in such heterogeneous networks. Our experiments on DBLP data show that NetClus generates more accurate clustering results than the baseline topic model algorithm PLSA and the recently proposed algorithm, RankClus. Further, NetClus generates informative clusters, presenting good ranking and cluster membership information for each attribute object in each net-cluster.

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

heterogeneous information network
clustering


On the b b -chromatic number of regular graphs without 4-cycle The b b -chromatic number of a graph G G , denoted by ?(G) ? ( G ) , is the largest integer k k for which G G admits a proper coloring by k k colors, such that each color class has a vertex that is adjacent to at least one vertex in each of the other color classes. We prove that, for each d d -regular graph G G which contains no 4-cycle, ? ( G ) ? ? d + 3 2 ? ; and besides, if G G has a triangle, then ? ( G ) ? ? d + 4 2 ? . Also, if G G is a d d -regular graph that contains no 4-cycle and diam(G)?6 d i a m ( G ) ? 6 , then ?(G)=d+1 ? ( G ) = d + 1 . Finally, we show that, for any d d -regular graph G G which does not contain 4-cycle and has vertex connectivity less than or equal to d + 1 2 , ?(G)=d+1 ? ( G ) = d + 1 . Moreover, when the vertex connectivity is less than 3 d ? 3 4 , we introduce a lower bound for the b b -chromatic number in terms of the vertex connectivity.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 I O 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 b -chromatic number b b b b b
girth
diameter


Socioeconomic gradients in health in international and historical context This article places socioeconomic gradients in health into a broader international and historical context. The data we present supports the conclusion that current socioeconomic gradients in health within the United States are neither inevitable nor immutable. This literature reveals periods in the United States with substantially smaller gradients, and identifies many examples of other countries whose different social policy choices appear to have led to superior health levels and equity even with fewer aggregate resources. The article also sheds light on the potential importance of various hypothesized mechanisms in driving major shifts in U.S. population health patterns. While it is essential to carefully examine individual mechanisms contributing to health patterns, it is also illuminating to take a more holistic view of the set of factors changing in conjunction with major shifts in population health. In this article, we do so by focusing on the period of the 1980s, during which U.S. life expectancy gains slowed markedly relative to other developed countries, and U.S. health disparities substantially increased. A comparison with Canada suggests that exploring broad social policy differences, such as the weaker social safety net in the United States, may be a promising area for future investigation.

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

socioeconomic status
inequality
historical trends
mortality
cardiovascular disease


Optimal wide-area monitoring and nonlinear adaptive coordinating neurocontrol of a power system with wind power integration and multiple FACTS devices Wide-area coordinating control is becoming an important issue and a challenging problem in the power industry. This paper proposes a novel optimal wide-area coordinating neurocontrol (WACNC), based on wide-area measurements, for a power system with power system stabilizers, a large wind farm and multiple flexible ac transmission system (FACTS) devices. An optimal wide-area monitor (OWAM), which is a radial basis function neural network (RBFNN), is designed to identify the input-output dynamics of the nonlinear power system. Its parameters are optimized through particle swarm optimization (PSO). Based on the OWAM. the WACNC is then designed by using the dual heuristic programming (DHP) method and RBFNNs, while considering the effect of signal transmission delays. The WACNC operates at a global level to coordinate the actions of local power system controllers. Each local controller communicates with the WACNC, receives remote control signals from the WACNC to enhance its dynamic performance and therefore helps improve system-wide dynamic and transient performance. The proposed control is verified by simulation studies on a multimachine power system. (C) 2007 Elsevier Ltd. All rights reserved.

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

facts devices
particle swarm optimization
wind power

adaptive critic designs
radial basis function network
wide-area control


Global Classical Large Solutions with Vacuum to 1D Compressible MHD with Zero Resistivity We establish the global-in-time existence and uniqueness of classical solutions of the initial boundary value problem for 1D compressible magnetohydrodynamics with zero magnetic resistivity, where the initial vacuum is allowed. In present paper, we do not require initial value to be small.

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

magnetohydrodynamics
zero resistivity
vacuum


Ex vivo and in vivoinduced dead tumor cells as modulators of antitumor responses Joint application of standard tumor therapies like radiotherapy and/or chemotherapy with immune therapy has long been considered not to fit. However, it has become accepted that immune responses may contribute to the elimination of cancer cells. We present how in vivoinduced tumor cell death by irradiation, chemotherapeutic agents, or hyperthermia can be rendered more immunogenic. High hydrostatic pressure is introduced as an innovative inactivation method for tumor cells used as vaccines. Annexin A5, being a natural occurring ligand for phosphatidylserine that is exposed by dying tumor cells, renders apoptotic tumor cells immunogenic and induces tumor regression. Combinations of irradiation with hyperthermia may also foster antitumor responses. For preparation of autologous tumor cell vaccines, high hydrostatic pressure is suitable to induce immunogenic cancer cell death. Future work will be aimed toward evaluating which combination and chronological sequence of radiotherapy, chemotherapy, hyperthermia, annexin A5, and/or autologous tumor cell vaccines will induce specific and long-lasting antitumor immunity.

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

dead tumor cells
high hydrostatic pressure
annexin a5
hyperthermia


Multicriterion decision making in river basin planning and development Five Multicriterion Decision Making (MCDM) methods, namely, ELECTRE-2, PROMETHEE-2, Analytic Hierarchy Process (AHP), Compromise Programming (CP) and EXPROM-2 are employed to select the best reservoir configuration for the case study of Chaliyar river basin, Kerala, India. Spearman rank correlation coefficient is used to assess the correlation between the ranks obtained by the above MCDM methods. Although, these methods follow different approaches, the analysis has shown that the same preference strategy is reached by all the methods. Comparative evaluation of MCDM methods revealed that Compromise Programming is best suited for the present case study.

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

multicriterion decision making
river basin planning
spearman rank correlation coefficient
india


Optimal exponential synchronization of general chaotic delayed neural networks: An LMI approach This paper investigates the optimal exponential synchronization problem of general chaotic neural networks with or without time delays by virtue of Lyapunov-Krasovskii stability theory and the linear matrix inequality (LMI) technique. This general model, which is the interconnection of a linear delayed dynamic system and a bounded static nonlinear operator, covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks (CNNs), bidirectional associative memory (BAM) networks, and recurrent multilayer perceptrons (RMLPs) with or without delays. Using the drive-response concept, time-delay feedback controllers are designed to synchronize two identical chaotic neural networks as quickly as possible. The control design equations are shown to be a generalized eigenvalue problem (GEVP) which can be easily solved by various convex optimization algorithms to determine the optimal control law and the optimal exponential synchronization rate. Detailed comparisons with existing results are made and numerical simulations are carried out to demonstrate the effectiveness of the established synchronization laws. (C) 2009 Elsevier Ltd. All rights reserved.

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

exponential synchronization
optimal control
linear matrix inequality

drive-response conception
lyapunov-krasovskii functional
generalized eigenvalue problem (gevp)
chaotic neural network
time-delay feedback control


Design of a soft-error robust microprocessor The costs to protect a commercial microprocessor against soft errors are discussed in this work. Based on hardware and time redundancies, a protection scheme was designed at RT level to mitigate transient faults on combinational and memory circuits. A fault-tolerant IC version of a mass-produced 8-bit microprocessor is protected by the scheme. Design issues and results in area, performance and power are presented comparing the robust microprocessor with its non-protected version. The costs by flip-flop are also discussed permitting to estimate the overheads in area for any architecture. Furthermore, the RT-level protection scheme is compared with an electrical-level scheme based on a non-standard gate.

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

fault-tolerant microprocessors
single-event transients
single-event upsets


what is cyberinfrastructure Cyberinfrastructure is a word commonly used but lacking a single, precise definition. One recognizes intuitively the analogy with infrastructure , and the use of cyber to refer to thinking or computing -- but what exactly is cyberinfrastructure as opposed to information technology infrastructure? Indiana University has developed one of the more widely cited definitions of cyberinfrastructure. Cyberinfrastructure consists of computing systems, data storage systems, advanced instruments and data repositories, visualization environments, and people, all linked together by software and high performance networks to improve research productivity and enable breakthroughs not otherwise possible. A second definition, more inclusive of scholarship generally and educational activities, has also been published and is useful in describing cyberinfrastructure: Cyberinfrastructure consists of computational systems, data and information management, advanced instruments, visualization environments, and people, all linked together by software and advanced networks to improve scholarly productivity and enable knowledge breakthroughs and discoveries not otherwise possible. In this paper, we describe the origin of the term cyberinfrastructure based on the history of the root word infrastructure, discuss several terms related to cyberinfrastructure, and provide several examples of cyberinfrastructure

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


navigation in degree of interest trees We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users do attend to more information in the DOI browser, they do not complete the task faster than in an Explorer-like browser. However, in both types of browser, users are faster to complete high information scent search tasks than low information scent tasks. We present an ACT-R computational model of the search task in the DOI browser. The model describes how a visual search strategy may combine with semantic aspects of processing, as captured by information scent. We also describe a way of automatically estimating information scent in an ontological hierarchy by querying a large corpus (in our case, Google's corpus).

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

user models
doi trees
act-r
information visualization
user studies


Numerical simulation of thermal disposition with induction heating used for oncological hyperthermic treatment Hyperthermia plays an important role in oncological therapies, most often being used in combination with radiotherapy, chemotherapy and immunotherapy. The success of this therapy is strongly dependent on the precision and control of thermal deposition. Hyperthermia based on induction heating, with thermally self-regulating thermoseeds inserted into the tumorous mass, is used for interstitial treatment. The technique was the subject of the numerical study presented in the paper. The analysis was carried out using coupled electromagnetic heating and thermo-fluid dynamic FEM simulations. During thermal deposition by induction heating of inserted seeds, the simulations estimated the thermal field inside and outside the tumour, as well as the sensitivity of the thermal field to variations regarding seed temperature, configuration and proximity to vessels. The method, for which accurate anatomical patient's information is essential, is suitable for providing useful qualitative and quantitative information about thermal transients and power density distribution for hyperthermic treatment. Several grid steps were analysed and compared. A 1 cm seed grid was resulted in good homogeneity and effectiveness of the thermal deposition. The cold spot effect caused by large vessels was demonstrated and quantified. Simulations of the heating of a tumorous mass in the liver showed that an indcutor generator operating at 200 kHz frequency and 500 A current, producing a pulsating magnetic field of H = 60 A cm(-1), was adequate for the treatment. The seeds that perform best among those tested (Nicu (28% Cu), PdNi (27.2% Ni), PdCo (6.15% Co) and ferrite core) were the PdNi (1 mm radius, 10 mm length), as they have a low Curie temperature (52degreesC), which is the closest to the desired treatment temperature and thus reduces the risk of hot spots.

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


Study of OpenMP applications on the InfiniBand-based software distributed shared-memory system For the past decades computer engineers have focused on building high-performance and large-scale computer systems with low-cost. One of the examples is a distributed-memory computer system like a cluster, where fast processing nodes to use commodity processors are connected through a high speed network. But it is not easy to develop applications on this system, because a programmer must consider all data and control dependences between processes and program them explicitly. For alleviating this problem the distributed virtual shared-memory (DVSM) system has been proposed. It is well known that the performance of the DVSM system highly depends on the network's performance and programming semantics, and currently its performance is very limited on a conventional network. Recently many advanced hardware-based interconnection technologies have been introduced, and one of them is the InfiniBand Architecture (IBA) which supports shared-memory programming semantics by means of remote direct-memory access (RDMA) and atomic operations. In this paper, we present the implementation of our InfiniBand-based DVSM system and analyze the performance of SPEC OMP benchmarks in detail by comparing with the DVSM based on the traditional network architecture and the hardware shared-memory multiprocessor (SMP) system. As experiment result, we show that our DVSM system to use full features of the IBA can improve the performance significantly over the IPoIB-based traditional system on the IBA, and furthermore the performance of one application on the IBA-based DVSM system is better than on the hardware SNIP. (c) 2005 Elsevier B.V. All rights reserved.

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


Project HealthDesign: Rethinking the power and potential of personal health records Project HealthDesign, a multi-year, multi-site project sponsored by the Robert Wood Johnson Foundation with additional support from the California HealthCare Foundation, is designed to stimulate innovation in personal health records (PHRs). Project HealthDesign teams employed user-centered design processes to create designs and prototypes of computer-based applications to support and enhance human health for a wide range of patients, from children with chronic health conditions to elders transitioning from hospital to home. A program design philosophy encouraged designers to envision PHRs as a suite of personal health information management tools, or applications, separate from, but drawing upon, personal health data from a variety of sources. In addition to information contained in ones medical record, these personal health data included patient-supplied clinical parameters such as blood glucose and daily weights; as well as patient-generated observations of daily living (ODLs) the unique, idiosyncratic cues, such as sleep adequacy or confidence in self care, that inform patients about their abilities to manage health challenges and take healthy action. A common technical platform provided infrastructure services such as data standards and identity-management protocols, and helped to demonstrate a scalable, efficient approach to user-centered design of personal health information management systems. The programs ethical, legal and social issues consultancy identified challenges to acceleration of action-focused PHRs: personal control of privacy choices, management of privacy in home conditions, and rebalancing power structures in shared decision making.

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

observations in daily living
consumer health informatics
design of hit


On the order of accuracy of the immersed boundary method: Higher order convergence rates for sufficiently smooth problems The immersed boundary method is both a mathematical formulation and a numerical scheme for problems involving the interaction of a viscous incompressible fluid and a (visco-)elastic structure. In [M.-C. Lai, Simulations of the flow past an array of circular cylinders as a test of the immersed boundary method, Ph.D. thesis, Courant Institute of Mathematical Sciences, New York University, 1998; M.-C. Lai, C.S. Peskin, An immersed boundary method with formal second-order accuracy and reduced numerical viscosity, J. Comput. Phys. 160 (2000) 705719], Lai and Peskin introduced a formally second order accurate immersed boundary method, but the convergence properties of their algorithm have only been examined computationally for problems with nonsmooth solutions. Consequently, in practice only first order convergence rates have been observed. In the present work, we describe a new formally second order accurate immersed boundary method and demonstrate its performance for a prototypical fluidstructure interaction problem, involving an immersed viscoelastic shell of finite thickness, studied over a broad range of Reynolds numbers. We consider two sets of material properties for the viscoelastic structure, including a case where the material properties of the coupled system are discontinuous at the fluidstructure interface. For both sets of material properties, the true solutions appear to possess sufficient smoothness for the method to converge at a second order rate for fully resolved computations.

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


Fourier methods for testing multivariate independence Recently a power study of some popular tests for bivariate independence based on ranks has been conducted. An alternative class of tests appropriate for testing not only bivariate, but also multivariate independence is developed, and their small-sample performance is studied. The test statistics employ the familiar equation between the joint characteristic function and the product of component characteristic functions, and may be written in a closed form convenient for computer implementation. Simulations on a distribution-free version of the new test statistic show that the proposed method compares well to standard methods of testing independence via the empirical distribution function. The methods are applied to multivariate observations incorporating data from several major stock-market indices. Issues pertaining to the theoretical properties of the new test are also addressed. (C) 2007 Elsevier B.V. All rights reserved.

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

empirical characteristic function
multivariate distribution
non-parametric test


An Improved Model of Ant Colony Optimization Using a Novel Pheromone Update Strategy The paper introduces a novel pheromone update strategy to improve the functionality of ant colony optimization algorithms. This modification tries to extend the search area by an optimistic reinforcement strategy in which not only the most desirable sub-solution is reinforced in each step, but some of the other partial solutions with acceptable levels of optimality are also favored, therefore, it improves the desire for the other potential solutions to be selected by the following artificial ants towards a more exhaustive algorithm by increasing the overall exploration. The modifications can be adopted in all ant-based optimization algorithms; however, this paper focuses on two static problems of travelling salesman problem and classification rule mining. To work on these challenging problems we considered two ACO algorithms of ACS (Ant Colony System) and Ant Miner 3.0 and modified their pheromone update strategy. As shown by simulation experiments, the novel pheromone update method can improve the behavior of both algorithms regarding almost all the performance evaluation metrics.

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

ant colony optimization
ant colony system
classification rule mining

ant-miner
learning automata
reinforcement learning


Robust image retrieval approach based on clustering analysis of re-quantized color image In this paper, we propose a robust approach about color image retrieval. It can realize fast matching in CBIR (Content-Based Image Retrieval) when we search in large image databases. Indexes root in object features of Z image which is the result of re-quantization in HSV color space, matching with a non-geometrical distance is based on objects, so time consumption pixel by pixel can be avoided. Because Z image is made up of many color clustering regions and invariant moments are used for feature representation, our approach is robust to translation, scale and rotation.

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

quantization
robustness
non-geometrical distance


Polar Codes for Degradable Quantum Channels Channel polarization is a phenomenon in which a particular recursive encoding induces a set of synthesized channels from many instances of a memoryless channel, such that a fraction of the synthesized channels becomes near perfect for data transmission and the other fraction becomes near useless for this task. Mahdavifar and Vardy have recently exploited this phenomenon to construct codes that achieve the symmetric private capacity for private data transmission over a degraded wiretap channel. In this paper, we build on their work and demonstrate how to construct quantum wiretap polar codes that achieve the symmetric private capacity of a degraded quantum wiretap channel with a classical eavesdropper. Due to the Schumacher-Westmoreland correspondence between quantum privacy and quantum coherence, we can construct quantum polar codes by operating these quantum wiretap polar codes in superposition, much like Devetak's technique for demonstrating the achievability of the coherent information rate for quantum data transmission. Our scheme achieves the symmetric coherent information rate for quantum channels that are degradable with a classical environment. This condition on the environment may seem restrictive, but we show that many quantum channels satisfy this criterion, including amplitude damping channels, photon-detected jump channels, dephasing channels, erasure channels, and cloning channels. Our quantum polar coding scheme has the desirable properties of being channel-adapted and symmetric capacity-achieving along with having an efficient encoder, but we have not demonstrated that the decoding is efficient. Also, the scheme may require entanglement assistance, but we show that the rate of entanglement consumption vanishes in the limit of large blocklength if the channel is degradable with classical environment.

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

degradable quantum channels
quantum polar codes
symmetric coherent information


Sums of ranking differences and inversion numbers for method discrimination Heberger and colleagues [Trends Anal Chem 2010;29:101-109; J Chemometrics 2011;25:151-158] have introduced the sum of ranking differences as a measure for comparing models or methods and have demonstrated its applicability in a variety of settings. The sum of ranking differences is closely related to another distance measure for permutations, namely, the inversion number. In this note, we describe the inversion number along with some of its distributional properties and draw comparisons with the sum of ranking differences for model comparison. Copyright (c) 2013 John Wiley & Sons, Ltd.

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

sum of ranking differences
inversion number
permutations


Cooperative and joint video multicast over MIMOOFDM networks ? Systems that broadcast/multicast over cellular networks have recently been intensively investigated. When compared to conventional terrestrial or satellite broadcasting systems, the Quality of Service (QoS) experienced by edge users is an important issue due to the inevitable inter-cell interference (ICI) that occurs within multi-cell environments. In order to resolve this issue, we have developed cooperative sub-band allocation (CSA) and CSA-joint transmission (CSA-JT) techniques that operate as a function of defined visual importance levels assigned to multi-layer videos, where the number of service users is limited over the macro/micro cell environment. To ensure that an acceptable level of video quality is delivered to edge users, an adaptive sub-band allocation scheme for layered video is designed to enhance the overall experience for all users based on maintaining program fairness. In a multiple-input/multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) system, CSA can effectively mitigate ICI at the cell border via base station (BS) cooperation. Moreover, CSA-JT can improve the QoS for cell border users via joint transmission among the cooperating BSs. In order to achieve the delivery of optimal visual quality, an optimization problem is formulated that seeks to maximize the sum experience of the multicast users. A dual decomposition technique is applied in order to reduce the computational complexity of the system. Simulation results show that the CSA and CSA-JT algorithms exhibit a remarkable reduction of outage probability.

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

cooperative video transmission
utility maximization
adaptive resource allocation
optimization decomposition
multicast service


A resource reservation scheme for synchronized distributed multimedia sessions Guarantees of services in a networked environment are provided by the proper allocation and scheduling of network and system resources. A lot of research in packet scheduling, QoS routing, traffic multiplexing, etc. has been aimed at providing deterministic or statistical service guarantees, while utilizing resources efficiently. In this paper, we propose a resource reservation scheme for a class of multimedia presentations. We characterize this class of multimedia presentations as synchronized distributed multimedia sessions, which we believe are important components of many multimedia applications. In addition to multimedia presentations, the reservation scheme applies to applications with synchronized resource requirements. Based on resource inquiry and interval analysis, the scheme is also able to find feasible resource allocation schedules for resource reservation requests. Built upon a layer of resource abstraction, the scheme suits well with today's heterogeneous network environment.

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

multimedia presentation
synchronization
quality-of-service
advance reservation
bandwidth allocation


On composing stream applications in peer-to-peer environments Stream processing has become increasingly important as many emerging applications call for continuous real- time processing over data streams, such as voice-over-IP telephony, security surveillance, and sensor data analysis. In this paper, we propose a composable stream processing system for cooperative peer-to-peer environments. The system can dynamically select and compose stream processing elements located on different peers into user desired applications. We investigate multiple alternative approaches to composing stream applications: 1) global-state-based centralized versus local-state-based distributed algorithms for initially composing stream applications at setup phase. The centralized algorithm performs periodical global state maintenance while the distributed algorithm performs on-demand state collection. 2) Reactive versus proactive failure recovery schemes for maintaining composed stream applications during runtime. The reactive failure recovery algorithm dynamically recomposes a new stream application upon failures while the proactive approach maintains a number of backup compositions for failure recovery. We conduct both theoretical analysis and experimental evaluations to study the properties of different approaches. Our study illustrates the performance and overhead trade-offs among different design alternatives, which can provide important guidance for selecting proper algorithms to compose stream applications in cooperative peer-to-peer environments.

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

peer-to-peer
service composition
resource management
quality-of-service


Modelling and analysis of spiking neural P systems with anti-spikes using Pnet lab Petri Nets are promising methods for modelling and simulating biological systems. Spiking Neural P system with anti-spikes (SN PA systems) is a biologically inspired computing model that incorporates two types of objects called spikes and anti-spikes thus representing binary information in a natural way. In this paper, we propose a methodology to simulate SN PA systems using a Petri net tool called Pnet Lab. It provides a promising way for SN PA systems because of its parallel execution semantics and appropriateness to represent typical working processes of these systems. This enables us to verify system properties, system soundness and to simulate the dynamic behaviour.

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

spiking neural p system with anti-spikes


An explanation for the logarithmic connection between linear and morphological system theory Dorst/van den Boomgaard and Maragos introduced the slope transform as the morphological equivalent of the Fourier transform. Generalising the conjugacy operation from convex analysis it formed the basis of a morphological system theory that bears an almost logarithmic relation to linear system theory; a connection that has not been fully understood so far. Our article provides an explanation by disclosing that morphology in essence is linear system theory in specific algebras. While linear system theory uses the standard plus-prod algebra, morphological system theory is based on the max-plus algebra and the min-plus algebra. We identify the nonlinear operations of erosion and dilation as linear convolutions in the latter algebras. The logarithmic Laplace transform makes a natural appearance as it corresponds to the conjugacy operation in the max-plus algebra. Its conjugate is given by the so-called Cramer transform. Originating from stochastics, the Cramer transform maps Gaussians to quadratic functions and relates standard convolution to erosion. This fundamental transform relies on the logarithm and constitutes the direct link between linear and morphological system theory. Many numerical examples are presented that illustrate the convexifying and smoothing properties of the Cramer transform.

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

linear system theory
morphology
convex analysis
slope transform
cramer transform


A speech distortion weighting based approach to integrated active noise control and noise reduction in hearing aids Introduce speech distortion weighted integrated ANC and NR. Theoretical derivation of the output SNR in the single speech source case. Theoretical validation of the previous results: weighted ANC and NR (EUSIPCO '09). Experimental comparison of un-weighted ANC and NR and weighted approaches.

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

hearing aids
active noise control
noise reduction

signal-to-noise ratio
multichannel wiener filter


Switching times variation of MOSFET devices with temperature and high-field stress Switching times of power MOSFET devices are investigated as function of temperature and high-field stress. Measurements show that important variations are obtained on the devices turn-on time. The threshold voltage is decreasing with temperature and varies with stress, especially at low temperatures. The oxide leakage current is found to be having safe values even at high temperatures, stressing the devices does not increase the leakage current to unsafe values except for very high temperatures.

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


The influence of footwear tread groove parameters on available friction The available friction provided by a shoe outsole is influenced by many factors, including the design of tread grooves. We investigated the influence of three tread groove parameters (width, depth, and orientation) on available friction. Groove orientation had the greatest impact on available friction.

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