A high quality single-image super-resolution algorithm based on linear Bayesian MAP estimation with sparsity prior This paper proposes a novel single-image super-resolution algorithm based on linear Bayesian maximum a posteriori (MAP) estimation and sparse representation. Starting from constructing several probability distribution priors in representation vector, we develop a linear Bayesian MAP estimator to acquire the most probable high-resolution (HR) image behind the low-resolution (LR) observation. Our new algorithm involves three main steps: (1) obtaining an initial estimate of the HR image via bi-cubic interpolation algorithm, (2) performing sparse coding on the initial estimate to get the representation vector and its support, (3) using the MAP estimator to restore the desired representation vector and then reconstructing the HR output. Simulated results show that the proposed method can achieve a more competitive performance both in subjective visual quality and in peak-signal-to-noise ratio (PSNR) and structural similarity (SSIM) measures, compared with other state-of-the-art super-resolution methods.

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

image super-resolution
linear bayesian estimation


In the fall of 2002, the ANP had shown a better way to deal with Iraq In 2003. the United States launched a pre-emptive strike against lraq which was largely defended by the Bush Administration as an act to protect national security. In the months leading up to the attack, however, the US was still in the decision-making process - should we work with the UN on enforcing sanctions? go in only with Allied support? launch a pre-emptive strike with mainly US forces? During this time, the Analytic Network Process [T.L. Saaty, The Analytic Network Process, Fundamentals of Decision Making and Priority Theory, second ed., RWS Publications, Pittsburgh, 2001] was used to determine the best course of action. Working with the UN to ensure weapons inspections was found to be the best choice; the model showed that other alternatives, such as a pre-emptive attack on Iraq or attacking Iraq with Allied help would increase the possibility of such risks as increased oil prices, increased terrorism, decreased domestic support for the war, and high economic costs of sustaining the war itself. (C) 2007 Elsevier Ltd. All rights reserved.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 a covariate on optimal designs in longitudinal studies with discrete-time survival endpoints Longitudinal intervention studies on event occurrence can measure the timing of an event at discrete points in time. To design studies of this kind as inexpensively and efficiently as possible, researchers need to decide on the number of subjects and the number of measurements for each subject. Different combinations of these design factors may produce the same level of power, but each combination can have different costs. When applying a cost function, the optimal design gives the optimal number of subjects and measurements, thus maximizing the power for a given budget and achieving sufficient power at minimal costs. Only very limited research has been conducted on the effect of a predictive covariate on optimal designs for a treatment effect estimator. Here, we go one step further than previous studies on optimal designs and demonstrate the extent to which a binary covariate influences the optimal design. An examination of various covariate effects and prevalences shows how substantially the covariate affects the optimal design and this effect is partly associated with the cost ratio between sampling subjects and measurements, and the survival pattern. So since the optimal design is sensitive to misspecification of these factors, we advise researchers to carefully specify the covariate effect and prevalence.

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

optimal design
treatment effect estimator
covariate effect and prevalence

longitudinal intervention study
discrete-time survival endpoint


real-time path planning for virtual agents in dynamic environments We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG), which is constructed from the first- and second-order Voronoi diagrams. The MaNG is used to perform route planning and proximity computations for each agent in real time. We compute the MaNG using graphics hardware and present culling techniques to accelerate the computation. We also address undersampling issues for accurate computation. Our algorithm is used for real-time multi-agent planning in pursuit-evasion and crowd simulation scenarios consisting of hundreds of moving agents, each with a distinct goal.

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


recommending topics for self-descriptions in online user profiles Traditional social networking sites allow users to enter responses to a set of predefined fields when populating their personal profiles. In the system discussed in this work, freeform 'About You' entries allow users to craft their own questions / topics. We found that this kind of flexibility often leads to low content contributions and infrequent updates. The 'About You' recommender system described in this paper differs from many recommender systems in that it recommends content for users to create, rather than consume. We present empirical data from an experiment with 2,000 users of a social networking site during a one month period. Our findings suggest that users who receive recommendations create more entries and update them more over time. Further, using articulated social network information for recommendations performed better than content-based matching.

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

self description
recommendation
impression formation


Electronic trading systems: Strategic implications of market design choices Modem financial markets compete aggressively for trading activity and investor interest. Information technology, once a crucial element in streamlining paper flows and operations, is now a strategic resource used in attracting or retaining market liquidity. Established exchanges introduce technology to enhance their markets. New market venues challenge the status quo and rely on technology to offer diverse services to increasingly sophisticated investors. In this article, we examine the strategic design decisions embedded in these new electronic trading systems. Design decisions are critical, as they determine the market microstructure that influences investing strategies, patterns of trade, liquidity, and volatility. We propose a taxonomy of design alternatives based on 6 major dimensions: market structure, type of orders, order execution priority rules, price discovery rules, time stamping, and transparency. Using examples of existing systems, we discuss the potential impact of the various alternatives on the eventual attractiveness of the market to the investors.

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

economic theory
financial economics
financial services
electronic market design
stock exchanges
strategy
trading technology


Partial isomorphisms over finite fields In this paper, we construct a combinatorial algebra of partial isomorphisms that gives rise to a projective limit of the centers of the group algebras \(\mathbb {C}\mathrm {GL}(n,\mathbb {F}_{q})\). It allows us to prove a \(\mathrm {GL}(n,\mathbb {F}_{q})\)-analogue of a theorem of Farahat and Higman regarding products of conjugacy classes of permutations.

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

combinatorics over finite fields
linear groups
ivanovkerov algebra


Montmorillonite and beidellite intercalated with tetramethylammonium cations Molecular mechanics simulations, combined with X-ray powder diffraction and infrared spectroscopy, have been used in structure analysis of montmorillonite and beidellite intercalated with tetramethylammonium cations. A complex structure analysis provided us with the detailed structure model, including characterization of the disorder, the total sublimation energy and a charge distribution in the structure of intercalates. The calculated basal spacings (14.36 Angstrom for TMA-montmorillonite and 14.12 Angstrom for TMA-beidellite) are in good agreement with the experimental values (14.31 Angstrom for TMA-montmorillonite and 14.147 Angstrom for TMA-beidellite). Both intercalated structures exhibit positional and orientational disorder in the arrangement of TMA cations, and consequently disorder in layer-stacking. In the present work we analyse the effect of octahedral and tetrahedral substitutions in a 2:1 silicate layer on the arrangement of tetramethylammonium (TMA) cations in the interlayer space of montmorillonite and beidellite. The most significant difference between TMA-montmorillonite and TMA-beidellite is in the charge distribution on the TMA cations and silicate layer. The TMA-beidellite structure is highly polarized, the total charge on one TMA cation is +0.167 e(-), while the total charge on the TMA cation in montmorillonite is +0.050 e(-).

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

molecular mechanics
montmorillonite
beidellite

intercalated clays
tetramethylammonium-clays
modeling


The effects of feedback protocol on self-regulated learning in a web-based worked example learning environment The current research investigated the effects of differing feedback protocols in a Web-based worked example learning environment to determine if changes would occur over time in goal orientation, self-regulation, self-efficacy or achievement. Participants from an undergraduate chemistry course were assigned to either a norm-referenced or self-referenced feedback group to receive feedback in relation to their performance on a weekly quiz administered via the Web. Results revealed that participants did not significantly change their goal orientation type or magnitude as a result of the differing feedback protocols, even with the addition of learning environment perception as a potential mediating variable. However, participants made significant decreases along the mastery approach and performance approach goal orientation sub-scales, regardless of the type of feedback received. While this was not anticipated, the results are consistent with other recent research within this context. An unanticipated trend also emerged, as those from the norm-referenced feedback group with a class-task perception of the learning environment were less likely to use worked examples but also demonstrated the greatest gains in self-efficacy. These were unanticipated outcomes and contrary to prior research. Recommendations for future research within this context such as authenticating participants' perceptions of their assigned treatment condition, introducing additional feedback protocols such as a combined, choice, or control condition and building in a better gauge to track the time and context of changes within the constructs of interest are also discussed. (C) 2010 Elsevier Ltd. All rights reserved.

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

feedback
goal orientation
worked examples
achievement

self-regulated learning
e-learning
self-efficacy
learning theory


a mobile tourist assistance and recommendation system based on complex networks In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining mobile guiding and route recommendation based on community networks. We use complex networks to tackle problems, such as deriving optimal routes in conjunction with knowledge deduced from our social tourist network, and giving a respectable prediction of which meta- and multimedia data about touristic objects are needed while the tourist is on tour. This article describes ongoing work on the recommendation system and mobile semantic replication strategies.

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

tourist recommendation
mobile assistance
social networks


Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow Nets A workflow net (WF-net for short) is a Petri net which represents a workflow. There are two important subclasses of WF-nets: extended free-choice (EFC for short) and well-structured (WS for short). It is known that most actual workflows can be modeled as EFC WF-nets; Acyclic WS is a subclass of acyclic EFC but has more analysis methods. An acyclic EFC WF-net may be transformed to an acyclic WS WF-net without changing the external behavior of the net. We name such a transformation Acyclic EFC WE-net refactoring. We give a formal definition of acyclic EFC WF-net refactoring problem. We also give a necessary condition and a sufficient condition for solving the problem. Those conditions can be checked in polynomial time. These result in the enhancement of the analysis power of acyclic EFC WF-nets.

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

well-structured
soundness
branching bisimilarity


Linear-Time Algorithm for the Length-Constrained Heaviest Path Problem in a Tree with Uniform Edge Lengths Given a tree T with edge lengths and edge weights, and a value B, the length-constrained heaviest path problem is to find a path in T with maximum path weight whose path length is at most B. We present a linear time algorithrn for the problem when the edge lengths are uniform, i.e., all one. This algorithm with slight modification can be used to find the heaviest path of length exactly B in T in linear time.

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


Multi-operator image retargeting with automatic integration of direct and indirect seam carving Multi-operator image resizing can preserve important objects and structure in an image by combining multiple image resizing operators. However, traditional multi-operator methods do not take both horizontal and vertical content-aware resizing potential into consideration, which essentially leads to squeeze/stretch effect in the resultant images. In this paper, we propose a new multi-operator scheme that addresses aforementioned issue by integrating direct and indirect seam carving. Compared with previous methods, the proposed scheme remarkably reduces the cost of deciding when to change operators, by employing a newly defined image artifact measure. Furthermore, we propose a novel seam carving enhancement, named ACcumulated Energy Seam Carving (ACESC), as a basic operator to improve global structure preservation. By combining horizontal and vertical seam carving, our scheme preserves the shapes of important objects well. We present typical results to demonstrate the effectiveness of our method. User study shows that our method has high user preference. (C) 2012 Elsevier B.V. All rights reserved.

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

multi-operator
cropping method
image similarity


Regional protection scheme designed for low-voltage micro-grids Guaranteeing selectivity and rapidity of LV micro-grid protection. Practical in engineering application and low cost implementation. Adaptive to coexistence of DGs, energy storage, loads. Reasonable partitioning principle of regional protection of micro-grid. Islanding operation strategy of isolated region.

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


Adaptive dual boundary element method for solving oblique incident wave passing a submerged breakwater In this paper, an adaptive mesh scheme in boundary element computations for solving the propagation of oblique incident wave passing a breakwater is developed. The purpose is to demonstrate cost savings engendered through adaptivity. The computation is performed on meshes of constant boundary elements, and are adapted to the solution by locally changing element sizes (h-version). Two error indicators obtained from the dual integral equations are used as local error norm, which are essential ingredients for all adaptive mesh schemes in boundary element method (BEM). The evaluation of two local error norms is the norm between the obtained boundary condition and the given boundary condition. The two error tracking curves are in good agreement with their shapes. Two examples show that the adaptive mesh based on the error indicators converge to the solution more efficiently using the same number of elements than does uniform mesh discretization for each segment of the boundary. To check the validity of the present formulation, the transmission and reflection coefficients are determined by using the developed dual BEM program, and are compared well with those of experiment and analytical solution using the eigenfunction expansion method.

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

adaptive mesh
breakwater
oblique incident wave
local error norm

dual boundary integral equation
hypersingular equation
error indicator


Comparing the inference capabilities of binary, trivalent and sigmoid fuzzy cognitive maps In this paper, we compare the inference capabilities of three different types of fuzzy cognitive maps (FCMs). A fuzzy cognitive map is a recurrent artificial neural network that creates models as collections of concepts/neurons and the various causal relations that exist between these concepts/neurons. In the paper, a variety of industry/engineering FCM applications is presented. The three different types of FCMs that we study and compare are the binary, the trivalent and the sigmoid FCM, each of them using the corresponding transfer function for their neurons/concepts. Predictions are made by viewing dynamically the consequences of the various imposed scenarios. The prediction making capabilities are examined and presented. Conclusions are drawn concerning the use of the three types of FCMs for making predictions. Guidance is given, in order FCM users to choose the most suitable type of FCM, according to (a) the nature of the problem, (b) the required representation capabilities of the problem and (c) the level of inference required by the case.

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

fuzzy inference
simulation
decision making
strategic planning


Exchange strategies for multiple Ant Colony System In this paper we apply the concept of parallel processing to enhance the performance of the Ant Colony System algorithm. New exchange strategies based on a weighting scheme are introduced under three different types of interactions. A search assessment technique based on a team consensus methodology is developed to study the influence of these strategies on the search behavior. This technique demonstrates the influence of these strategies in terms of search diversity. The performance of the Multiple Ant Colony System algorithm, applied to the Vehicle Routing Problem with Time Windows as well as the Traveling Salesman Problem, is investigated and evaluated with respect to solution quality and computational effort. The experimental studies demonstrate that the Multiple Ant Colony System outperforms the sequential Ant Colony System. The studies also indicate that the weighting scheme improves performance, particularly in strategies that share pheromone information among all colonies. A considerable improvement is also obtained by combining the Multiple Ant Colony System with a local search procedure.

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

vehicle routing problem with time windows

parallel and distributed ant colony optimization


a software-svm-based transactional memory for multicore accelerator architectures with local memory We propose a software transactional memory (STM) for heterogeneous multicores with small local memory. The heterogeneous multicore architecture consists of a general-purpose processor element (GPE) and multiple accelerator processor elements (APEs). The GPE is typically backed by a deep, on-chip cache hierarchy and hardware cache coherence. On the other hand, the APEs have small, explicitly addressed local memory that is not coherent with the main memory. Programmers of such multicore architectures suffer from explicit memory management and coherence problems. The STM for such multicores can alleviate the burden of the programmer and transparently handle data transfers at run time. Moreover, it makes the programmer free from controlling locks. Our TM is based on an existing software SVM for the accelerator architecture. The software SVM exploits software-managed caches and coherence protocols between the GPE and APEs. We also propose an optimization technique, called abort prediction, for the TM. It blocks a transaction from running until the chance of potential conflicts is eliminated. We implement the TM system and the optimization technique for a single Cell BE processor and evaluate their effectiveness with six compute-intensive benchmark applications.

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

transactional memory
heterogeneous multicores


A unified multimodal control framework for humanrobot interaction A unified multimodal sensor-based control framework is proposed. Pose, vision and force tasks can be realized either exclusively or simultaneously. Self-adapting gains and homotopies between the tasks guarantee safe operation. The approach is validated in an industrial task: collaborative screwing.

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

reactive and sensor-based control
visual servoing


A denial-of-service resistant intrusion detection architecture As the capabilities of intrusion detection systems (IDSs) advance, attackers may disable organizations IDSs before attempting to penetrate more valuable targets. To counter this threat, we present an IDS architecture that is resistant to denial-of-service (DOS) attacks. The architecture frustrates attackers by making IDS components invisible to attackers normal means of seeing in a network. Upon a successful attack, the architecture allows IDS components to relocate from attacked hosts to operational hosts thereby mitigating the attack. These capabilities are obtained by using mobile agent technology, utilizing network topology features, and by restricting the communication allowed between different types of IDS components.

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

denial of service
security architecture
mobile agents
computer security


Design and fabrication of diverse three-dimensional shell-like nano-structures Firstly, we propose a simple method to obtain diverse three-dimensional shell-like structures. Secondly, the number of the shell-like structures, which can be fabricated through the proposed method, is very large. Thirdly, all of these structures can be pre-designed and simulated through our established geometrical model.

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

shell-like nano-structure
microsphere self-assembly technology
semi-shell


Steps to take before intelligent user interfaces become real Intelligent user interfaces have been proposed as a means to overcome some of the problems that direct manipulation interfaces cannot handle, such as: information overflow problems; providing help on how to use complex systems; or real-time cognitive overload problems. Intelligent user interfaces are also being proposed as a means to make systems individualised or personalised, thereby increasing the system's flexibility and appeal. Unfortunately, there are a number of problems not yet solved that prevent us from creating good intelligent user interface applications. We do not have efficient methods for developing them. There are demands on better usability principles for them. We need a better understanding of the possible ways the interface can utilise intelligence to improve the interaction. Finally, we need to design better tools that will enable an intelligent system to survive the full life cycle of a system (including updates of the database, system support, etc.). We define these problems further and point out some possible solutions. (C) 2000 Elsevier Science B.V. All rights reserved.

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


Introduction of affinity set and its application in data-mining example of delayed diagnosis At least 44,000 people die in hospitals each year as a result of medical errors, and these deaths are becoming the eighth-leading cause of death in the United States. Thus, medical providers have the responsibility to pay attention for reducing avoidable medical errors and improve patient safety as best as they can. It requires the rapid evaluation and prioritisation of life threatening injuries in the primary survey followed by a detailed secondary survey in the emergency room. However, time is always valuable and limited such that some important vital signs may be delayed and ignored. This research explores delayed diagnosis problem and uses the affinity set by Topology concept to classify/focus on key attributes causing delayed diagnosis (missed injury) in order to reduce error risk. Results interestingly indicate that when a patient can breathe normally, but his (or her) blood-pressure or pulse is abnormal, a high probability of delayed diagnosis exists. This affinity work also compares the performance with the model of rough set (Rosetta), neural network, support vector machine and logistic regression. And our affinity model shows its advantage by prediction accuracy and explanation power.

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

delayed diagnosis
affinity set
topology
rough set
neural network
support vector machine


A fast greedy heuristic for scheduling modular projects This article describes a heuristic for scheduling so-called modular projects. Exact solutions to this NP-hard problem can be obtained with existing branch-and-bound and dynamic-programming algorithms, but only for small to medium-size instances. The proposed heuristic, by contrast, can be used even for large instances, or when instances are particularly difficult because of their characteristics, such as a low network density. The proposed heuristic draws from existing results in the literature on sequential testing, which will be briefly reviewed. The performance of the heuristic is assessed over a dataset of 360 instances.

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


Qualitative Concurrent Parity Games We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider omega-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n(2d+2)) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP boolean AND coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory.

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

verification
omega-regular objectives
temporal logics
games on graphs


The dynamics of design Purpose - This paper seeks to develop the argument that a cybernetic framework will enable designers to act as an observer and participant in the process of designing. The dynamic nature of the design process will be discussed in order to better understand how these aspects impact on a designer's ability to act effectively in design. Design/methodology/approach - A second-order cybernetic framework is offered as a means to facilitate a designer's capacity to act as an observer-participant in the co-creation of a design solution. It characterizes the design process as a conversation to enhance a designer's ability to conceptually develop novel design solutions in participative situations. Findings - The significance of the designer in the design process and the design solution is established. A second-order cybernetic framework provides an explanation for a designer's actions by acknowledging their presence in the design process. This makes possible the collaborative development of a design situation and its solution between various participants in this process through negotiation and mutual understanding. Practical implications - It is envisaged that the value of cybernetic concepts as a means to augment interaction, reflection, mutual understanding, creativity and innovation to facilitate designerly ways of knowing, thinking, and acting, is realized. Originality/value - The main value of this framework is for designers who struggle with finding an appropriate framework to facilitate and rationalize the subjective nature of human-centred design methods and the complexity of design.

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


The ring grooming problem The problem of minimizing the number of bidirectional SONET rings required to support a given traffic demand has been studied by several researchers. Here we study the related ring-grooming problem of minimizing the number of add/drop locations instead of the number of rings; in a number of situations this is a better approximation to the true equipment cost. Our main result is a new lower bound for the case of uniform traffic. This allows us to prove that a certain simple algorithm for uniform traffic is, in fact, a constant-factor approximation algorithm, and it also demonstrates that known lower bounds for the general problem-in particular, the linear programming relaxation-are not within a constant factor of the optimum. We also show that our results for uniform traffic extend readily to the more practically important case of quasi-uniform traffic. Finally, we show that if the number of nodes on the ring is fixed, then ring grooming is solvable in polynomial time; however, whether ring grooming is fixed-parameter tractable is still an open question. (C) 2004 Wiley Periodicals, Inc.

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

adm minimization
ring loading
blsr
sonet over wdm
traffic grooming
parameterized complexity


Minimal Time Functions and the Smallest Intersecting Ball Problem with Unbounded Dynamics The smallest enclosing circle problem introduced in the nineteenth century by Sylvester asks for the circle of smallest radius enclosing a given set of finite points in the plane. An extension of this problem, called the smallest intersecting ball problem, was also considered recently: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that intersects all of the sets. In this paper, we initiate the study of minimal time functions generated by unbounded dynamics and discuss their applications to further extensions of the smallest enclosing circle problem. This approach continues our effort in applying convex and nonsmooth analysis to the well-established field of facility location.

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

minimal time functions
smallest intersecting ball problem

subdifferential
subgradient method
1-center problem


The Solar Photon Thruster as a Terrestrial Pole Sitter Geosynchronous satellites are invisible at high latitudes. A pole-sitting spacecraft would have communication, climate-studies, and near-polar Earth observation applications. We present a pole-sitter based on the solar photon thruster (SPT), a two-sail variant of the solar sail using a large curved collector sail (always normal to the Sun) to direct sunlight against a much smaller thruster. Thrust decreases slower for an SPT than for a conventional sail arrangement as the angle between sunlight and the collector normal increases. An SPT pole-sitter is offset from the terrestrial pole so that a component of Earth gravity balances the solar radiation-pressure component pushing the SPT off station. The component of gravitational attraction of the Earth pulling the spacecraft towards Earth is also balanced by a solar radiation-pressure component. Results are presented for 80-100% collector/thruster reflectivities. For a spacecraft areal mass thickness of 0.002 kg/m2, collector and thruster reflectivities of 0.9, the SPT can be situated above latitude 45 at a distance of approximately 60 Earth radii. An SPT pole sitter would be affected by lunar perturbation, which can be compensated for by an on-board rocket thruster producing 2 10?6g acceleration, a second SPT thruster sail thrusting against the influence of the Moon, or by directing a microwave beam against the spacecraft. Since an SPT pole sitter is in a position rather than an orbit, the effect of terrestrial gravitation limits the size and design of the payload package, which limits terrestrial target resolution.

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

solar photon thruster
terrestrial pole sitter


Comparison of four polynomial kernels for enhancement of autocorrelation-based pitch estimates Whereas the autocorrelation is frequently used for pitch estimation, the resultant estimates usually suffer from inaccuracy. Instead of upsampling, we can improve the accuracy of the estimates by applying polynomial interpolation to the autocorrelation directly. For that purpose, four kernels, which are interpolating quadratic, quadratic-B spline, cubic-B spline, and cubic convolution kernels respectively, have been compared. Experiments show that the cubic B spline kernel shows the best performance, a little inferior to the computationally intensive upsampling procedure. The quadratic B spline kernel shows also reasonable performance with the merit of the further reduced computational complexities compared with the cubic B spline kernel.

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

autocorrelation
pitch estimation
polynomial interpolation


SELECTION OF SPECTRAL CHANNELS FOR SATELLITE SENSORS IN MONITORING YELLOW RUST DISEASE OF WINTER WHEAT Remote sensing has great potential to serve as a useful means in crop disease detection at regional scale. With the emerging of remote sensing data on various spectral settings, it is important to choose appropriate data for disease mapping and detection based on the characteristics of the disease. The present study takes yellow rust in winter wheat as an example. Based on canopy hyperspectral measurements, the simulative multi-spectral data was calculated by spectral response function of ten satellite sensors that were selected on purpose. An independent t-test analysis was conducted to access the disease sensitivity for different bands and sensors. The results showed that the sensitivity to yellow rust varied among different sensors, with green, red and near infrared bands been identified as disease sensitive bands. Moreover, to further assess the potential for onboard data in disease detection, we compared the performance of most suitable multi-spectral vegetation index (MVI)-GNDVI and NDVI based on Quickbird band settings with a classic hyperspectral vegetation index (HVI) and PRI (photochemical reflectance index). The validation results of the linear regression models suggested that although the MVI based model produced lower accuracy (R-2 = 0.68 of GNDVI, and R-2 = 0.66 of NDVI) than the HVI based model (R-2 = 0.79 of PRI), it could still achieve acceptable accuracy in disease detecting. Therefore, the probability to use multi-spectral satellite data for yellow rust monitoring is illustrated in this study.

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

yellow rust
winter wheat
hyperspectral vegetation index

relative spectral response function
multi-spectral vegetation index


Progressive skylining over Web-accessible databases Skyline queries return a set of interesting data points that are not dominated on all dimensions by any other point. Most of the existing algorithms focus on skyline computation in centralized databases, and some of them can progressively return skyline points upon identification rather than all in a batch. Processing skyline queries over the Web is a more challenging task because in many Web applications, the target attributes are stored at different sites and can only be accessed through restricted external interfaces. In this paper, we develop PDS (progressive distributed skylining), a progressive algorithm that evaluates skyline queries efficiently in this setting. The algorithm is also able to estimate the percentage of skyline objects already retrieved, which is useful for users to monitor the progress of long running skyline queries. Our performance study shows that PDS is efficient and robust to different data distributions and achieves its progressive goal with a minimal overhead.

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

distributed dbs
query optimization
information services on the web
web-based information systems


Improving the flexibility for replicated data management in distributed database systems This paper presents a novel scheme for implementing the flexible replica control protocol[13] in the distributed database systems. The scheme requires less nodes to be locked to perform the read(write) operations. This not only provides better performance, but also provides the system designer extra flexibility to implement the protocol.

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

replica control
distributed database systems


Theoretical analysis of singleton arc consistency and its extensions Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but they have a high time complexity. In this paper, we give a lower bound to the worst-case time complexity of enforcing SAC on binary constraints. We discuss two interesting features of SAC, The first feature leads us to propose an algorithm for SAC that has optimal time complexity when restricted to binary constraints. The second feature leads us to extend SAC to a stronger level of local consistency that we call Bidirectional SAC (BiSAC). We also show the relationship between SAC and the propagation of disjunctive constraints. (c) 2007 Elsevier B.V. All rights reserved.

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

local consistency
singleton arc consistency
disjunctive constraints

constraint satisfaction problems
constructive disjunction
bidirectional singleton arc consistency


Algorithm for recognizing Cartesian graph bundles Graph bundles generalize the notion of covering graphs and graph products. In [8], authors constructed an algorithm that finds a presentation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over triangle-free simple base. In [21], the unique square property is defined and it is shown that any equivalence relation possessing the unique square property determines the fundamental factorization of a graph as a nontrivial Cartesian graph bundle over arbitrary base graph. In this paper we define a relation ? having a unique square property on Cartesian graph bundles over K4?e-free simple base. We also give a polynomial algorithm for recognizing Cartesian graph bundles over K4?e-free simple base.

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

cartesian graph bundles
unique square property
fundamental factorization
polynomial algorithm


CREAM: CREAting Metadata for the Semantic Web Richly interlinked, machine-understandable data constitute the basis for the Semantic Web. We provide a framework, CREAM, that allows for creation of metadata. While the annotation mode of CREAM allows creation of metadata for existing Web pages, the authoring mode lets authors create metadataalmost for freewhile putting together the content of a page. As a feature of our framework, CREAM allows creating relational metadata, i.e., metadata that instantiate interrelated definitions of classes in a domain ontology rather than a comparatively rigid template-like schema such as Dublin Core. We discuss some of the requirements one has to meet when developing such an ontology-based framework, e.g., the integration of a metadata crawler, inference services, document management and a meta-ontology, and describe its implementation, viz. OntoMat, a component-based, ontology-driven Web-page authoring and annotation tool.

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

semantic web
ontology
metadata
authoring


Node-based dynamic adaptive grid with quadrilateral and hexahedral elements A node-based data structure is developed for use in either two-dimensional (2-D) or three-dimensional (3-D) finite element method (FEM) problems. This grid uses quadrilateral (2-D) or hexahedral (3-D) elements and is dynamically adaptive according to the 1-irregular requirement for refinementderefinement. Implemented in C++, the grid consists of node objects linked with pointers to neighboring node objects. The algorithm used to traverse the grid starts at the first node of the grid and constructs each FEM element by following the links of the nodes. This algorithm uses a stack to maintain the correct order of elements during the grid traversals. Because the elements and their connectivity are not permanently stored, the computer storage requirements for the grid are reduced significantly in 3-D compared with an element-based approach. Although the node-based approach may increase the CPU-time and complexity to access an element, it reduces the complexity and time required to refine and derefine an element. This implementation is applicable to many FEM domains.

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

dynamic adaptive mesh
adaptive finite elements
nodal based-data structures
object-oriented programming
c++
fortran


Real-Time PCR Duplex Assay for Rickettsia prowazekii and Borrelia recurrentis Rickettsia prowazekii, the etiologic agent for epidemic typhus, and Borrelia recurrentis, the etiologic agent of relapsing fever, both utilize the same vector, the human body louse (Pediculus humanus), to transmit human disease. We have developed an assay to detect both bacterial pathogens in a single tube utilizing real-time PCR. Assays for both agents are specific. The R. prowazekii and B. recurrentis assays do not detect nucleic acid from R. typhi, R. canada, or any of eight spotted fever rickettsiae. In addition they did not react with Neorickettsia risticii, N. sennetsu, Franciscella persica, Bartonella quintana, Legionella pneumophila, Proteus mirabilis, Salmonella enterica, Escherichia coli, and Staphylococcus aureus. Moreover, the B. recurrentis assay did not detect B. duttonii, B. coriaceae, B. afzelii, B. garinii, B. hermsii, or B. burgdorferi nucleic acid. Both assays detected repeatedly only R. prowazekii or B. recurrentis either when tested alone or together in one test tube.

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

typhus
rickettsia prowazekii
borrelia recurrentis
human body louse


OpenAD/F: A modular open-source tool for automatic differentiation of Fortran codes The OpenAD/F tool allows the evaluation of derivatives of functions defined by a Fortran program. The derivative evaluation is performed by a Fortran code resulting from the analysis and transformation of the original program that defines the function of interest. OpenAD/F has been designed with a particular emphasis on modularity, flexibility, and the use of open source components. While the code transformation follows the basic principles of automatic differentiation, the tool implements new algorithmic approaches at various levels, for example, for basic block preaccumulation and call graph reversal. Unlike most other automatic differentiation tools, OpenAD/F uses components provided by the OpenAD framework, which supports a comparatively easy extension of the code transformations in a language-independent fashion. It uses code analysis results implemented in the OpenAnalysis component. The interface to the language-independent transformation engine is an XML-based format, specified through an XML schema. The implemented transformation algorithms allow efficient derivative computations using locally optimized cross-country sequences of vertex, edge, and face elimination steps. Specifically, for the generation of adjoint codes, OpenAD/F supports various code reversal schemes with hierarchical checkpointing at the subroutine level. As an example from geophysical fluid dynamics, a nonlinear time-dependent scalable, yet simple, barotropic ocean model is considered. OpenAD/F's reverse mode is applied to compute sensitivities of some of the model's transport properties with respect to gridded fields such as bottom topography as independent (control) variables.

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

performance
source transformation
adjoint compiler


Transition-Based Deadlock Detection and Recovery Policy for FMSs Using Graph Technique A transition-controlled deadlock detection and recovery prevention policy is presented for a subclass of Petri nets used to model flexible manufacturing systems. The subclass is called systems of simple sequential processes with resources ((SPR)-P-3). The proposed policy is different from the standard deadlock prevention policies. Instead of adding control places, this policy adds a controlled transition to solve a group of deadlocked markings that have the same graph-based property. Finally, the results of our study indicate that the proposed policy appears to be more permissive than those existing ones that add control places.

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

algorithms
performance
theory
petri net
flexible manufacturing system


Usability of a cloud-based collaborative learning framework to improve learners experience Usability of a cloud based framework is presented for collaborative learning. Focus on the importance of data replication in the design of such a framework. A distributed replication technique to improve learners data access performance. The replication problem is formulated using dynamic programming. Experimental studies show the efficacy of the proposed framework.

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

collaborative learning
dynamic programming
replication
learners experience


Advanced high-level cache management by processor access information In this paper, we propose an advanced high-level cache management policy based on the processor access information, named as L1VPAI (L1 plus Victim cache with Processor Access Information). The L1VPAI is a cache replacement policy that uses the frequency of the specific cache line. In this policy, conflicted lines in the L1 cache are placed selectively in the victim cache or the level 2 (L2) cache based on previous memory access patterns. In this manner, the L1VPAI policy can make the frequently used address of cache locations reside longer in the high-level caches. We simulate our policy with RSIM, the event-driven simulator, and analyze the simulation results. The simulation results show that the average execution time of the L1VPAI outperforms the simple victim cache (L1V) by up to 6.44%. Moreover, performance gain is expected to increase, in the case of multiprocessor systems.

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

l1 cache
victim cache
cache replacement policy
processor access information


Relational information gain We introduce relational information gain, a refinement scoring function measuring the informativeness of newly introduced variables. The gain can be interpreted as a conditional entropy in a well-defined sense and can be efficiently approximately computed. In conjunction with simple greedy general-to-specific search algorithms such as FOIL, it yields an efficient and competitive algorithm in terms of predictive accuracy and compactness of the learned theory. In conjunction with the decision tree learner TILDE, it offers a beneficial alternative to lookahead, achieving similar performance while significantly reducing the number of evaluated literals.

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

relational learning
inductive logic programming


IRM: Integrated File Replication and Consistency Maintenance in P2P Systems In peer-to-peer file sharing systems, file replication and consistency maintenance are widely used techniques for high system performance. Despite significant interdependencies between them, these two issues are typically addressed separately. Most file replication methods rigidly specify replica nodes, leading to low replica utilization, unnecessary replicas and hence extra consistency maintenance overhead. Most consistency maintenance methods propagate update messages based on message spreading or a structure without considering file replication dynamism, leading to inefficient file update and hence high possibility of outdated file response. This paper presents an Integrated file Replication and consistency Maintenance mechanism (IRM) that integrates the two techniques in a systematic and harmonized manner. It achieves high efficiency in file replication and consistency maintenance at a significantly low cost. Instead of passively accepting replicas and updates, each node determines file replication and update polling by dynamically adapting to time-varying file query and update rates, which avoids unnecessary file replications and updates. Simulation results demonstrate the effectiveness of IRM in comparison with other approaches. It dramatically reduces overhead and yields significant improvements on the efficiency of both file replication and consistency maintenance approaches.

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

file replication
consistency maintenance


Deriving a Floyd-Hoare logic for non-local jumps from a formulae-as-types notion of control We derive a Floyd-Hoare logic for non-local jumps and mutable higher-order procedural variables from a formula-as-types notion of control for classical logic. A key contribution of this work is the design of an imperative dependent type system for Hoare triples, which corresponds to classical logic, but where the famous consequence rule is admissible. Moreover, we prove that this system is complete for a reasonable notion of validity for Hoare judgments. (C) 2012 Elsevier Inc. All rights reserved.

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

floyd-hoare logic
higher-order procedure
jump
callcc
continuation
monad


Runge-Kutta discontinuous Galerkin method using WENO limiters II: Unstructured meshes In [J. Qiu, C.-W. Shu, Runge-Kutta discontinuous Galerkin method using WENO limiters, SIAM Journal on Scientific Computing 26 (2005) 907-929], Qiu and Shu investigated using weighted essentially non-oscillatory (WENO) finite volume methodology as limiters for the Runge-Kutta discontinuous Galerkin (RKDG) methods for solving nonlinear hyperbolic conservation law systems on structured meshes. In this continuation paper, we extend the method to solve two-dimensional problems on unstructured meshes, with the goal of obtaining a robust and high order limiting procedure to simultaneously obtain uniform high order accuracy and sharp, nonoscillatory shock transition for RKDG methods. Numerical results are provided to illustrate the behavior of this procedure. (C) 2008 Elsevier Inc. All rights reserved.

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

runge-kutta discontinuous galerkin method


A Power Consumption Analysis for IP-Over-WDM Core Network Architectures As Internet traffic is estimated to substantially grow in the near future, one of the most challenging issues will concern the reduction of its power requirement. For the core/transport section of the Internet, various network architectures can be considered, typicallymulti-layer architectures composed of an optical wavelength division multiplexing (WDM) transport layer under the classical electronic IP layer. Thus, we consider in this paper four architectures: basic IP over WDM with no optical switching, IP over synchronous digital hierarchy (SDH) over WDM, and IP over WDM with transparent or translucent switching. Energy efficiency in these architectures is expected to be enabled by optical switching technologies, mainly due to the significant reduction in the number of required optical/electronic/optical conversions. However, since optical signals are subject to relevant physical layer impairments when traversing core network devices, signal regeneration is often required, which has to be accomplished either at the electronic layer by routers/digital cross connects (DXCs) or directly at the optical layer through 3R-regenerators. Therefore, it is important to know which network architecture may provide the highest energy efficiency. In this paper we perform a comprehensive comparison between the four above-mentioned optical core network architectures, by performing energy assessment of the devices used at the transport layer of a telecom network and by developing an integer linear programming formulation for an energy-minimized and impairment-aware design of each of the considered architectures. We find that optical technology can enable power savings up to 60% with respect to classical IP-over-WDM architectures with no optical switching, but the best "optical" architecture is not univocal, and it is influenced by some crucial network parameters (connectivity, geographical extension, etc.).

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

transparent and translucent architectures


Visualizing Situational Data: Applying Information Fusion for Detecting Social-Ecological Events As anthropogenic and environmental behaviors rapidly evolve many ecosystems and communities, managers of natural resources, scientists, and other stakeholders increasingly need tools that can rapidly alert them to emerging events that can affect social well-being. Data detailing such behaviors may derive from textual sources with varying content, requiring an approach to merge multiple media sources and create linked relationships between relevant event terms. In addition, applied methods need to provide both quantitative capacity and qualitative functionality, which can rapidly display emerging trends and potentially significant individual events. This article presents an information fusion approach for conducting text searches on web-based sources to provide managers and scientists with rapid search capabilities identifying potentially significant social-ecological events. Along with general analytical utility, a network approach that links associated terms is used to show semantic relationships between social-ecological terms at different timescales.

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

visualization
decision support
text analysis
data mining
social-ecological


dynamic prediction of communication flow using social context In this paper, we develop a temporally evolving representation framework for context that can efficiently predict communication flow in social networks between a given pair of individuals. The problem is important because it facilitates determining social and market trends as well as efficient information paths among people. We describe communication flow by two parameters: the intent to communicate and communication delay. To estimate these parameters, we design features to characterize communication and social context. Communication context refers to the attributes of current communication. Social context refers to the patterns of participation in communication (information roles) and the degree of overlap of friends between two people (strength of ties). A subset of optimal features of the communication and social context is chosen at a given time instant using five different feature selection strategies. The features are thereafter used in a Support Vector Regression framework to predict the intent to communicate and the delay between a pair of individuals. We have excellent results on a real world dataset from the most popular social networking site, www.myspace.com. We observe interestingly that while context can reasonably predict intent, delay seems to be more dependent on the personal contextual changes and other latent factors characterizing communication, e.g. 'age' of information transmitted and presence of cliques among people.

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

support vector regression
information roles
feature selection
communication flow
social context
social networks


Robust transmission network expansion planning in energy systems: Improving computational performance An efficient method for robust capacity expansion planning is proposed. Outperforms previous methods in terms of computational time. The reduction in complexity is demonstrated analytically. The method is tested using a real-size network.

O O O O O O O O O O O O O O O O O O O O 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 robust optimization
or in energy
transmission expansion
two-stage


HVDC transmission system using multilevel power converters based on dual three-phase two-level inverters A HVDC transmission system based on a multilevel structure with two DC links. Multilevel AC voltage waveforms from standard three-phase converters connected to a three-phase open winding transformer. The total power transmitted in the DC link is shared by the two three-phase converters. The control algorithm is based on sliding mode control theory coupled to a space vector modulator. The proposed HVDC system has been tested by numerical simulations.

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

high-voltage direct-current (hvdc)
multilevel power converter
two level voltage source converters
dual converters


An empirical study of using rule induction and rough sets to software cost estimation This paper concerns problems of applying the approach based on rough sets and rule induction to a software engineering data analysis. More precisely, we focus our interest on a software cost estimation problem, which includes predicting the effort required to develop a software system basing on values of cost factors. The case study of analysing the COCOMO data set, containing descriptions of representative historical projects, allows us to discuss how this approach could be used to: identify the most discriminatory cost factors, extract meaningful rule representation of classification knowledge from data, construct accurate rule based classifiers.

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

machine learning
preference modeling
software cost prediction
cocomo model


ARTKOHONEN neural network for fault diagnosis of rotating machinery In this paper, a new neural network (NN) for fault diagnosis of rotating machinery which synthesises the theory of adaptive resonance theory (ART) and the learning strategy of Kohonen neural network (KNN), is proposed. For NNs, as the new case occurs, the corresponding data should be added to their dataset for learning. However, the off-line NNs are unable to adapt autonomously and must be retrained by applying the complete dataset including the new data. The ART networks can solve the plasticitystability dilemma. In other words, they are able to carry out on-line training without forgetting previously trained patterns (stable training); it can recode previously trained categories adaptive to changes in the environment and is self-organising. ARTKNN also holds these characteristics, and more suitable than original ART for fault diagnosis of machinery. In order to test the proposed network, the vibration signal is selected as raw inputs due to its simplicity, accuracy and efficiency. The results of the experiments confirm the performance of the proposed network through comparing with other NNs, such as the self-organising feature maps (SOFMs), learning vector quantisation (LVQ) and radial basis function (RBF) NNs under the same conditions.The diagnosis success rate for the ARTKohonen network was 100%, while the rates of SOFM, LVQ and RBF networks were 93%, 93% and 89%, respectively.

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

fault diagnosis
rotating machinery
vibration signal

artificial neural network
feature extraction


Retinopathy Online Challenge: Automatic Detection of Microaneurysms in Digital Color Fundus Photographs The detection of microaneurysms in digital color fundus photographs is a critical first step in automated screening for diabetic retinopathy (DR), a common complication of diabetes. To accomplish this detection numerous methods have been published in the past but none of these was compared with each other on the same data. In this work we present the results of the first international microaneurysm detection competition, organized in the context of the Retinopathy Online Challenge (ROC), a multi-year online competition for various aspects of DR detection. For this competition, we compare the results of five different methods, produced by five different teams of researchers on the same set of data. The evaluation was performed in a uniform manner using an algorithm presented in this work. The set of data used for the competition consisted of 50 training images with available reference standard and 50 test images where the reference standard was witheld by the organizers (M. Niemeijer, B. van Ginneken, and M. D. Abramoff). The results obtained on the test data was submitted through a website after which standardized evaluation software was used to determine the performance of each of the methods. A human expert detected microaneurysms in the test set to allow comparison with the performance of the automatic methods. The overall results show that microaneurysm detection is a challenging task for both the automatic methods as well as the human expert. There is room for improvement as the best performing system does not reach the performance of the human expert. The data associated with the ROC microaneurysm detection competition will remain publicly available and the website will continue accepting submissions.

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

retinopathy online challenge (roc) competition


Automated detection of pulmonary nodules in helical CT images based on an improved template-matching technique The purpose of this study is to develop a technique for computer-aided diagnosis (CAD) systems to detect lung nodules in helical X-ray pulmonary computed tomography CT) images. We propose a novel template-matching technique based on a genetic algorithm (GA) template matching (GATM) for detecting nodules existing within the lung area; the GA was used to determine the target position in the observed image efficiently and to select an adequate template image from several reference patterns for quick template matching. In addition, a conventional template matching was employed to detect nodules existing on the lung wall area,lung wall template matching (LWTM), where semicircular models were used as reference patterns; the semicircular models were rotated according to the angle of the target point on the contour of the lung wall. After initial detecting candidates using the two template-matching methods, we extracted a total of 13 feature values and used them to eliminate false-positive findings. Twenty clinical cases involving a total of 557 sectional images were used in this study. 71 nodules out of 98 were correctly detected by our scheme (i,e,, a detection rate of about 72%), with the number of false positives at approximately 1.1/sectional image, Our present results show that our scheme can be regarded as a technique for CAD systems to detect nodules in helical CT pulmonary images.

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

chest helical ct images
computer-aided diagnosis
pulmonary nodule


Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes ? An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code are asked to be identified, we get the related concept of a locating-dominating set. These notions are closely related to a number of similar and well-studied concepts such as the one of a test cover. In this paper, we study the decision problems Identifying Code and Locating-Dominating Set (which consist in deciding whether a given graph admits an identifying code or a locating-dominating set, respectively, with a given size) and their minimization variants Minimum Identifying Code and Minimum Locating-Dominating Set. These problems are known to be NP-hard, even when the input graph belongs to a number of specific graph classes such as planar bipartite graphs. Moreover, it is known that they are approximable within a logarithmic factor, but hard to approximate within any sub-logarithmic factor. We extend the latter result to the case where the input graph is bipartite, split or co-bipartite: both problems remain hard in these cases. Among other results, we also show that for bipartite graphs of bounded maximum degree (at least 3), the two problems are hard to approximate within some constant factor, a question which was open. We summarize all known results in the area, and we compare them to the ones for the related problem Dominating Set. In particular, our work exhibits important graph classes for which Dominating Set is efficiently solvable, but Identifying Code and Locating-Dominating Set are hard (whereas in all previous works, their complexity was the same). We also introduce graph classes for which the converse holds, and for which the complexities of Identifying Code and Locating-Dominating Set differ.

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

test cover
identifying code
approximation

separating system
locating-dominating set
np-completeness


Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics ? In this paper we introduce an extension of the Traveling Salesman Problem (TSP TSP ), which is motivated by an important application in bioinformatics. In contrast to the TSP TSP the costs do not only depend on each pair of two nodes traversed in succession in a cycle but on each triple of nodes traversed in succession. This problem can be formulated as optimizing a quadratic objective function over the traveling salesman polytope, so we call the combinatorial optimization problem quadratic TSP (QTSP QTSP ). Besides its application in bioinformatics, the QTSP QTSP is a generalization of the Angular-Metric TSP TSP and the TSP TSP with reload costs. Apart from the TSP TSP with quadratic cost structure we also consider the related Cycle Cover Problem with quadratic objective function (QCCP QCCP ). In this work we present three exact solution approaches and several heuristics for the QTSP QTSP . The first exact approach is based on a polynomial transformation to a TSP TSP , which is then solved by standard software. The second one is a branch-and-bound algorithm that relies on combinatorial bounds. The best exact algorithm is a branch-and-cut approach based on an integer programming formulation with problem-specific cutting planes. All heuristical approaches are extensions of classic heuristics for the TSP TSP . Finally, we compare all algorithms on real-world instances from bioinformatics and on randomly generated instances. In these tests, the branch-and-cut approach turned out to be superior for solving the real-world instances from bioinformatics. Instances with up to 100 100 nodes could be solved to optimality in about ten minutes.

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

traveling salesman problem
bioinformatics

branch-and-bound
branch-and-cut
heuristical methods
exact methods


FUZZY LINGUISTIC AND METRIC FORMALIZATIONS OF COGNITIVE DISTANCE Subjects engaged in learning their spatial environmental have increasingly detailed and complete information available to them at each stage in the process. This paper describes a three-stage spatial learning process based on three fuzzy formalizations of cognitive distance involving three types of information: (1) relative distance expressed linguistically in terms of closeness and/or remoteness, (2) absolute distance expressed linguistically in terms of short, long and their shades of meaning and (3) absolute distance expressed numerically. Finally, a precise method of matching subjects' linguistic and numerical judgments on absolute distances is set out.

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

fuzzy binary relation
linguistic judgment
numerical judgment


Implementing a database encryption solution, design and implementation issues In this paper, we analyze and compare five traditional architectures for database encryption. We show that existing architectures may provide a high level of security, but have a significant impact on performance and impose major changes to the application layer, or may be transparent to the application layer and provide high performance, but have several fundamental security weaknesses. We suggest a sixth novel architecture that was not considered before. The new architecture is based on placing the encryption module inside the database management software (DBMS), just above the database cache, and using a dedicated technique to encrypt each database value together with its coordinates. These two properties allow our new architecture to achieve a high level of data security while offering enhanced performance and total transparency to the application layer. We also explain how each architecture can be implemented in a commercial, open source DBMS. We evaluate the performance of the various architectures both analytically and through extensive experimentation. Our performance evaluation results demonstrate that in most realistic scenarios, i.e., where only a part of the database content is stored in the database cache, the suggested architecture outperforms the others.

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

relational database
integrity
and protection
data encryption
transparent data encryption


How to Enhance Privacy Within DaaS Service Composition? The composition of data-as-a-service (DaaS) services is a powerful solution for building value-added applications on top of existing ones. However, privacy concerns are still among the key challenges that keep hampering DaaS composition. Indeed, services may follow different, conflicting privacy specifications with respect to the data they use and provide. In this paper, we propose an approach for the privacy-aware composition of DaaS services. Our approach allows us to specify privacy requirements and policies and verify the compatibility of services involved in a composition. We propose an adaptation protocol that makes it possible to reconcile the privacy specifications of services when incompatibilities arise in a composition. We validate the applicability of our proposal through a set of experiments.

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


Multiple comparisons in induction algorithms A single mechanism is responsible for three pathologies of induction algorithms: attribute selection errors, overfitting, and oversearching. In each pathology, induction algorithms compare multiple items based on scores from an evaluation function and select the item with the maximum score. We call this a multiple comparison procedure (MCP). We analyze the statistical properties of MCPs and show how failure to adjust for these properties leads to the pathologies. We also discuss approaches that can control pathological behavior, including Bonferroni adjustment, randomization testing, and cross-validation.

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

overfitting
oversearching
attribute selection

inductive learning
hypothesis testing
parameter estimation


personalized learning using adapted content modality design for science students Motivation -- The mismatch between current e-Learning design and user needs has drawn the research attention on personalized instruction. Our research intends to investigate the impact on e-Learners' learning performance and experience using various modalities presenting the learning content based on Felder-Silverman's learning style theory, and eventually to provide the possible suggestions on content modality design. Research approach -- Laboratory experiment is our main approach to conduct this research. 28 participants with similar profiles pertaining to the dominant styles will be recruited from Computing and Information Systems subjects. A two-group design with repeated measures is selected so the same participants will use two different e-Learning environments in order to investigate their influences on the students' learning performance and experience. Findings/Design -- Our previous studies claimed the suitability of Felder-Silverman's theory as the theoretical basis for the research. A framework was also developed to identify the main e-Learning system features accommodated to typical science and technology students. Take away message -- As learning styles are believed to be considerably important to instruction, our research on content modality design is likely to help facilitate the users' learning performance and experience in e-Learning.

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

adaptation
personalization
e-learning
cognitive learning style


Adaptive hierarchic transformations for dynamically p-enriched slope-limiting over discontinuous Galerkin systems of generalized equations We study a family of generalized slope limiters in two dimensions for RungeKutta discontinuous Galerkin (RKDG) solutions of advection-diffusion systems. We analyze the numerical behavior of these limiters applied to a pair of model problems, comparing the error of the approximate solutions, and discuss each limiters advantages and disadvantages. We then introduce a series of coupled p-enrichment schemes that may be used as standalone dynamic p-enrichment strategies, or may be augmented via any in the family of variable-in-p slope limiters presented.

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

finite element
strong stability preserving (ssp)
total variation diminishing (tvd)
adaptive slope limiting
shock capturing
dynamic p-adaptivity
dynamic p-enrichment
error analysis
advective transport
hyperbolic pde


Minimal rational parametrizations of canal surfaces It is well known that canal surfaces defined by a rational spine curve and a rational radius function are rational. The aim of the present paper is to construct a rational parameterization of low degree. The author uses the generalized stereographic projection in order to transform the problem to a parameterization problem for ruled surfaces. Two problems are discussed: parameterization with boundary conditions (design of canal surfaces with two curves on it, as is the case for rolling ball blends) and parameterization without boundary conditions.

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

rational parametrization
rolling ball blend


Fault tolerant quantum key distributions using entanglement swapping of GHZ states over collective-noise channels This work proposes two fault tolerant quantum key distribution (QKD) protocols. Each of which is robust under one kind of collective noises: collective-dephasing noise and collective-rotation noise, respectively. Due to the use of the entanglement swapping of GreenbergerHorneZeilinger (GHZ) state as well as the decoy logical qubits, the new protocols provide the best qubit efficiency among the existing fault tolerant QKD protocols over the same collective-noise channel. The receiver simply performs two Bell measurements to obtain the raw key. Moreover, the proposed protocols are free from several well-known attacks and can also be secure over a lossy channel.

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

entanglement swapping
ghz state
quantum key distribution


Quantum wire splitting in nanostructures The electron transport processes in novel semiconductor nanostructures are mainly influenced by quantum mechanical effects. Especially in heterostructures the effect of energy quantisation appears at the heterojunctions. This can be considered in device simulation by solving the Schrodinger equation in connection with the Poisson equation. In nanostructures the appearance of 1-dimensional or 2-dimensional electron gases is used for devices as current channels with a high electron mobility. The first systematic investigation of quantum wire structures is carried out to find the conditions for the creation of a real 1-dimensional electron gas as well as for the splitting of it into several electron gases at enlarged structure dimensions. A coupled microscopic/macroscopic algorithm is applied to simulate several nanometre quantum wire structures. The electron density in the quantum wire is calculated and compared for different shapes of the wire structure and for different material compounds and material dopings.

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


Using acoustic diffraction to determine the seabed slope In this paper, we present a new seabed detection method based on the use of a single beam electro-acoustic transducer (echo sounder). This method uses both acoustic diffraction and bottom backscattering properties to determine the 2D or 3D equation for seabed slopes. It can thus be used for bottom tracking (e,g, for autonomous underwater vehicles). In comparison to existing sonar-based processes, our method offers the advantages of mono-beam transducers: low computational cost, lower power consumption and higher sampling rate.

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

auv
undersea robotics
navigation
obstacle detection


Sentiment analysis: A combined approach Sentiment analysis is an important current research area. This paper combines rule-based classification, supervised learning and machine learning into a new combined method. This method is tested on movie reviews, product reviews and MySpace comments. The results show that a hybrid classification can improve the classification effectiveness in terms of micro- and macro-averaged F1 F 1 . F1 F 1 is a measure that takes both the precision and recall of a classifiers effectiveness into account. In addition, we propose a semi-automatic, complementary approach in which each classifier can contribute to other classifiers to achieve a good level of effectiveness.

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

sentiment analysis
machine learning
hybrid classification


Unboundedness of thresholding and quantization for bandlimited signals It is well-known that the Shannon sampling series is locally uniformly convergent for all signals in the PaleyWiener space PW ? 1 . An interesting question is how this good local approximation behavior is affected if the samples are disturbed by the non-linear threshold operator. This operator, which sets to zero all samples with absolute value smaller than some threshold, arises in the modeling of many applications, e.g., in wireless sensor networks. Moreover, it constitutes an essential part of a large class of quantizers, and consequently is important for all digital signal processing applications that involve conversion between analog and digital domains. In this paper, the approximation behavior of the Shannon sampling series that only uses the samples with absolute value larger than or equal to some threshold is analyzed. It is shown that there exists a signal in PW ? 1 such that the local approximation error increases unboundedly as the threshold tends to zero. Moreover, for a fixed threshold, the local approximation error can grow arbitrarily large on the set of signals whose norm is bounded by one. With this, we generalize results of Butzer et al. that were given in the paper On quantization, truncation and jitter errors in the sampling theorem and its generalizations, Signal Processing (2) 1980 [1]. We conclude the paper with a discussion about the differences in the reconstruction behavior between the sampling series which is truncated in the domain of the sampled signal, i.e., time-domain truncation, and the sampling series which is truncated in the range of the sampled signal.

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

shannon sampling series
threshold operator
quantization
paleywiener space