Evaluating the integration of fuzzy logic into the student model of a web-based learning environment In this paper, we evaluate the effectiveness and accuracy of the student model of a web-based educational environment for teaching computer programming. Our student model represents the learners knowledge through an overlay model and uses a fuzzy logic technique in order to define and update the students knowledge level of each domain concept, each time that s/he interacts with the e-learning system. Evaluation of the student model of an Intelligent Tutoring System (ITS) is an aspect for which there are not clear guidelines to be provided by literature. Therefore, we choose to use two well-known evaluation methods for the evaluation of our fuzzy student model, in order to design an accurate and correct evaluation methodology. These evaluation models are: the Kirkpatricks model and the layered evaluation method. Our system was used by the students of a postgraduate program in the field of Informatics in the University of Piraeus, in order to learn how to program in the programming language C. The results of the evaluation were very encouraging.

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


Fair Round-Robin: A Low-Complexity Packet Scheduler with Proportional and Worst-Case Fairness Round-robin-based packet schedulers generally have a low complexity and provide long-term fairness. The main limitation of such schemes is that they do not support short-term fairness. In this paper, we propose a new low-complexity round-robin scheduler, called Fair Round-Robin (FRR), that overcomes this limitation. FRR has similar complexity and long-term fairness properties as the STratified Round-Robin (STRR) scheduler, a recently proposed scheme that arguably provides the best quality-of-service properties among all existing round-robin-based low-complexity packet schedulers. FRR offers better short-term fairness than STRR and other existing round-robin schedulers.

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

packet scheduling
proportional fairness
worst-case fairness
round-robin scheduler


Advanced support vector machines and kernel methods Kernel methods (KMs) and support vector machines (SVMs) have become very popular as methods for learning from examples. The basic theory is well understood and applications work successfully in practice. Initially illustrated by their use in classification and regression tasks, recent advanced techniques are presented and key applications are described. Issues of numerical optimization, working set selection, improved generalization, model selection, and parameter tuning are addressed. Application research covering the use of SVMs in text categorization, computer vision, and bioinformatics is discussed.

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

reproducing kernel hilbert spaces (rkhs)


Stability and transient behavior of homogeneous azeotropic distillation In this article, the steady state and dynamic behavior of an azeotropic distillation column separating the homogeneous ternary mixture acetone-benzene-heptane is studied. Nonlinear phenomena reported in earlier studies like multiple steady states (Bekiaris et al., 1993) and limit cycles (Lee et al., 1999) are shown for this mixture. In addition, a new phenomenon is reported: the occurrence of homoclinic bifurcations resulting in cases of only one attractor in the presence of three steady states. It is discussed how these phenomena are influenced by operating parameters such as distillate and reflux flow rate, feed composition, etc.. The steady state and dynamic behavior is classified in the parameter space.

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

azeotropic distillation
multiple steady states

instability
oscillation
hopf bifurcation
homoclinic bifurcation


Discovering Multirelational Structure in Social Media Streams In this article, we present a novel algorithm to discover multirelational structures from social media streams. A media item such as a photograph exists as part of a meaningful interrelationship among several attributes, including time, visual content, users, and actions. Discovery of such relational structures enables us to understand the semantics of human activity and has applications in content organization, recommendation algorithms, and exploratory social network analysis. We are proposing a novel nonnegative matrix factorization framework to characterize relational structures of group photo streams. The factorization incorporates image content features and contextual information. The idea is to consider a cluster as having similar relational patterns; each cluster consists of photos relating to similar content or context. Relations represent different aspects of the photo stream data, including visual content, associated tags, photo owners, and post times. The extracted structures minimize the mutual information of the predicted joint distribution. We also introduce a relational modularity function to determine the structure cost penalty, and hence determine the number of clusters. Extensive experiments on a large Flickr dataset suggest that our approach is able to extract meaningful relational patterns from group photo streams. We evaluate the utility of the discovered structures through a tag prediction task and through a user study. Our results show that our method based on relational structures, outperforms baseline methods, including feature and tag frequency based techniques, by 35%-420%. We have conducted a qualitative user study to evaluate the benefits of our framework in exploring group photo streams. The study indicates that users found the extracted clustering results clearly represent major themes in a group; the clustering results not only reflect how users describe the group data but often lead the users to discover the evolution of the group activity.

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 B O O B I I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
social media
social network analysis
nonnegative matrix factorization

experimentation
measurement
human factors
structure mining
multirelational learning


development of a semantic web based mobile local search system This paper describes the development of a semantic web and ontology based local search system that can be used in wireless mobile communication services.

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


SYN flooding attack detection by TCP handshake anomalies We present an original approach to identify synchronize (SYN) flooding attacks from the victim's side, on the basis of a classification of the different forms that TCP handshakes can take during a connection set-up between a client and a server (e.g. for Web traffic). We first identify the unusual handshake sequences that result from an attack and show how such observations can be used for SYN flooding attack detection. We then introduce a data structure to monitor, in real time, the state of the TCP handshake and study its performance. In addition, we explain the management of the data structure for operations such as initialization, adding and removing flows. Finally, we analyse the effectiveness of our TCP handshake monitoring to identify the presence of SYN flooding attacks by applying it to real traffic traces. To allow quick protection and help guarantee a proper defence, the detection is done in real time. Our detection system uses a non-parametric cumulative sum algorithm (CUSUM), which has the benefit of not requiring a detailed model of the normal and attack traffic while achieving excellent detection levels. Copyright (C) 2011 John Wiley & Sons, Ltd.

B I 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 B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O 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
transmission control protocol
network security


Vehicle detection grammars with partial occlusion handling for traffic surveillance A two-layer part division of the vehicle is proposed for efficient representation. Novel vehicle detection grammars are designed and realized with pairwise SVMs. Partial vehicle occlusion is handled with the proposed grammar model.

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

grammar model
occlusion handling
vehicle detection

computer vision
part-based object detection


Determination of autoregressive model orders for seizure detection In the present study, a step-wise least square estimation algorithm (SLSA), unplemented in a Matlab package called as A Rfit, has been newly applied to clinical data for estimation of the accurate Auto-Regressive (AR) model orders of both normal and ietal EEG series where the power spectral density (PSD) estimations are provided by the Burg Method. The ARfit module is found to be useful in comparison to a large variety of traditional methods such as Forward Prediction Error (FPE), Akaike's Information Criteria (AIC), Minimum Description Lenght (MDL), and Criterion of Autoregression Transfer function (CAT) for EEG discrimination. According to tests, the PPE, AIC and CAT give the identical orders for both normal and epileptic series whereas the MDL produces lower orders Considering the resulting PSD estimations, it can be said that the most descriptive orders are provided by the SLSA In conclusion, the SLSA can mark the seizure, since the estimated AR model orders meet the EEG complexity/regularity such that the low orders indicate an increase of EEG regularity in seizure. Then, the SLSA is proposed to select the accurate AR orders of long EEG series in diagnose for many possible future applications The SLSA implemented by A Rfit module is found to be superior to traditional methods since it is not heuristic and it is less computational complex In addition , lite more reasonable orders can be provided by the SLSA

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

a r model
stepwise least square algorithm


intersection of ideals with non-commutative subalgebras Computation of an intersection of a left ideal with a subalgebra, which is not fully investigated until now, is important for different areas of mathematics.We present an algorithm for the computation of the preimage of a left ideal under a morphism of non-commutative GR -algebras, and show both its abilities and limitations.The main computational tools are the elimination of variables by means of Grbner bases together with the constructive treatment of opposite algebras and the utilization of a special bimodule structure.

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

homomorphism of algebras
non-commutative algebra
intersection with subalgebra
groebner bases
preimage of ideal
restriction


model checking implicit-invocation systems While implicit invocation (publish-subscribe) systems have good engineering properties, they are difficult to reason about and to test. Model checking such systems is an attractive alternative. However, it is not clear what kinds of state models are best suited for this. In this paper, we propose a structural approach, which factors the model-checking problem into two parts: behavior specific to a particular implicit invocation system, and reusable run-time infrastructure that handles event-based communication and delivery policies. The reusable portion is itself structured so that alternative run-time mechanisms may be experimented with.

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

communication
systems
test
behavior
infrastructure
model
paper
implicit invocation

publish-subscribe
policy
structure
engine
factor
event
timing
reusability
model checking


CGLXTouch: A multi-user multi-touch approach for ultra-high-resolution collaborative workspaces This paper presents an approach for empowering collaborative workspaces through ultra-high resolution tiled display environments concurrently interfaced with multiple multi-touch devices. Multi-touch table devices are supported along with portable multi-touch tablet and phone devices, which can be added to and removed from the system on the fly. Events from these devices are tagged with a device identifier and are synchronized with the distributed display environment, enabling multi-user support. As many portable devices are not equipped to render content directly, a remotely scene is streamed in. The presented approach scales for large numbers of devices, providing access to a multitude of hands-on techniques for collaborative data analysis.

O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-touch interaction
high-resolution displays
multi-device interaction
tiled displays


A Virtual Collaborative Environment Helps University Students to Learn Maths The technological advances taking place in recent times have led us to consider the use of computers in classrooms as an indispensable tool. This paper details the experience of last year related to the use of different forms of interaction among students and new technological tools. The proposed learning system allows university students to go into computers and specific software in depth get. The use of new tools could enhance the teaching-learning process and adapt it to the new situation of Spanish university system. We have used both, an online platform and specifically designed programs to solve mathematical problems and learn Mathematics.

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


Detection, Diagnosis, and Recovery From Clock-Domain Crossing Failures in Multiclock SoCs Clock-domain crossing (CDC) faults require careful post-silicon testing for multiclock circuits. Even when robust design methods based on synchronizers and design verification techniques are used, process variations can introduce subtle timing problems that affect data transfer across clock-domain boundaries for fabricated chips. We integrate solutions for detecting and locating CDC faults, and ensuring post-silicon recovery from CDC failures. In the proposed method, CDC faults are located using a CDC-fault dictionary, and their impact is masked using post-silicon clock-path tuning. To quantify the impact of process variations in the transfer of data at clock domain boundaries of multiclock circuits and to validate the proposed error-recovery method, we conducted a series of HSpice simulations using a 45-nm technology. The results demonstrate high incidence of process variation-induced violation of setup and hold time at the boundary flip-flops, even when synchronizer flip-flops are employed. The results also confirm the effectiveness of the proposed error-recovery scheme in recovering from CDC failures.

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

clock domain crossing
error recovery
fault detection


Decomposing the global financial crisis: A Self-Organizing Time Map This paper applies the Self-Organizing Time Map (SOTM) in financial stability surveillance. The SOTM is combined with classical cluster analysis for visual dynamic clustering. The SOTM presents a holistic view of cross-sectional patterns over time. The SOTM is used for identifying temporal structural changes. The SOTM is used for decomposing the global financial crisis that started in 2007.

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

visual dynamic clustering
financial crisis
financial stability surveillance

self-organizing time map
exploratory temporal structure analysis


Noise-tolerance feasibility for restricted-domain Information Retrieval systems Information Retrieval systems normally have to work with rather heterogeneous sources, such as Web sites or documents from Optical Character Recognition tools. The correct conversion of these sources into flat text files is not a trivial task since noise may easily be introduced as a result of spelling or typeset errors. Interestingly, this is not a great drawback when the size of the corpus is sufficiently large, since redundancy helps to overcome noise problems. However, noise becomes a serious problem in restricted-domain Information Retrieval specially when the corpus is small and has little or no redundancy. This paper devises an approach which adds noise-tolerance to Information Retrieval systems. A set of experiments carried out in the agricultural domain proves the effectiveness of the approach presented.

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

noise-tolerance
restricted domain
edit distance


Filling N-Sided Regions by Quad Meshes for Subdivision Surfaces Given an n-sided region bounded by a loop of n polylines, we present a general algorithm to fill such a region by a quad mesh suitable for a subdivision scheme. Typically, the approach consists of two phases: the topological phase and the geometrical phase. In the first part, the connectivity of the mesh is based on determining a partitioning of the region into rectangular subregions across which regular grid could be constructed. The geometrical phase generalizes discrete Coon's patches to position the vertices in the 3D space. The generated mesh could be taken as input to any quad-based subdivision scheme, such as that of Catmull-Clark or Doo-Sabin to generate the corresponding limit surface. The goal of the algorithm is to generate smooth meshes with minimum number and less valence of extraordinary vertices deemed undesirable in such subdivision schemes.

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

5 [computer graphics]: computational geometry and object modeling


attracting communities and students to it with a community service web contest This paper describes a high school web design contest held by a computer and information technology program. The goals were to serve the community with community engagement websites and also to provide experiential learning in an IT field and hopefully to encourage students to pursue careers in IT. Five high schools competed, with forty-eight students in thirteen different teams.

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


Source controlled semi-reliable multimedia streaming using selective retransmission in DCCP/IP networks In the past few years we have witnessed an explosive growth in the usage of media streaming applications. The newly appeared audio/video applications are becoming increasingly popular in IP networks, while in mobile environment the limited bandwidth and the higher error rate arise in spite of its popularity. Retransmission-based error recovery is considered inappropriate for multimedia applications, because of its latency. This solution can be attractive because it requires minimal network bandwidth, processing cost and efficiently improves the stream quality. Despite its latency, retransmission can be used successfully in many cases, especially if playout buffering is employed. Only the successfully retransmitted packets will improve the quality parameters of the multimedia stream, therefore it is worth to examine which packets should be retransmitted. In this paper a source controlled selective retransmission algorithm is presented with a decision algorithm based on the actual RTT and sending rate determined. by the TFRC. In our scheme the transmitter determines the playout delay caused by the playout buffer using the proposed Flood method. The needed information about the network congestion state and the network delay are provided by the TFRC (TCP Friendly Rate Control) algorithm. Our proposal does not need additional administration messages because the decision procedure and its inputs are at the transmitter. The obtained results show that significant quality improvement is possible with the proposed selective retransmission scheme. (c) 2008 Elsevier B.V. All rights reserved.

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


accelerated focused crawling through online relevance feedback The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate and click on links that best satisfy their information need. Can an automatic program emulate this human behavior and thereby learn to predict the relevance of an unseen HREF target page w.r.t. an information need, based on information limited to the HREF source page? Such a capability would be of great interest in focused crawling and resource discovery, because it can fine-tune the priority of unvisited URLs in the crawl frontier, and reduce the number of irrelevant pages which are fetched and discarded.

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

tree
tag
crawl
resource discovery
human
links
relevance
online
focused crawling
predict
organization
structure
information need
behavior
text

paging
browser
relevance-feedback
informal
document object model
reinforcement learning
region
learning
embedding
priorities


Monolithic and partitioned coupling schemes for thermo-viscoplasticity ? In this article we investigate a fully, thermo-mechanically coupled viscoplasticity model in view of various numerical aspects. First, we develop the entire system of differentialalgebraic equations resulting from the spatially discretized principle of virtual displacements, the principle of virtual temperatures, and the evolution equations of the internal variables provided by the constitutive model. In the time-integration step this system is solved both using a fully monolithic approach based on a BackwardEuler scheme in combination with the Multilevel-Newton algorithm as well as a partitioned approach solving the fully coupled system. The latter is treated by means of a combination of a BackwardEuler method and an accelerated GaussSeidel/Multilevel-Newton scheme to solve the resulting system of algebraic equations within each time-integration step. Additionally, we consider a specific treatment of the interpolation between different meshes within the partitioned approach. This is shown for p p -version finite elements based on hierarchical shape functions. Finally, it turns out that the specific constitutive model of small-strain thermo-viscoplasticity, which is based on the decomposition into kinematic hardening and energy storing strains, yields a problem-adapted stress algorithm. This allows to reduce the stress algorithm on Gauss-point level to the solution of one scalar equation. Numerical examples serve to elucidate the behavior and properties of the proposed 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

partitioned approach
monolithic approach
differentialalgebraic equations

thermo-viscoplasticity
fully coupled finite elements


A 3D CAD knowledge-based assisted injection mould design system This paper presents the basic structure of an interactive knowledge-based injection mould design system (IKB-MOULD). The basis of this system arises from an analysis of the injection mould design process for mould design companies. This injection mould design system covers both the mould design process and mould knowledge management. IKB-MOULD integrates the intelligent design process and knowledge management with many developed interactive tools in a commercial solid modelling software environment.

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

knowledge base
injection mould object representation


Exploration of energy efficient memory organisations for dynamic multimedia applications using system scenarios We propose a memory-aware system scenario approach that exploits variations in memory needs during the lifetime of an application in order to optimize energy usage. Different system scenarios capture the applications different resource requirements that change dynamically at run-time. In addition to computational resources, the many possible memory platform configurations and data-to-memory assignments are important system scenario parameters. In this work we focus on clustering of different memory requirements into groups and presenting the system scenario generation in detail. The clustering is a non-trivial problem due to the many different memory requirements, which leads to a very large exploration space. An extended memory model is used as a practical enabler, in order to evaluate the methodology. The memory models include existing state-of-the-art memories, available from industry and academia, and we show how they are employed during the system design exploration phase. Both commercial SRAM and standard cell based memory models are explored in this study. The effectiveness of the proposed methodology is demonstrated and tested using a large set of multimedia benchmarks published in the Polybench, Mibench and Mediabench suites, representative for the domain of multimedia applications. Reduction in energy consumption in the memory subsystem ranges from 35 to 55% for the chosen set of benchmarks.

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

system scenarios
dynamic multimedia applications

design space exploration
reconfigurable design
memory reconfiguration


Graph theory applications to continuity and ranking in geologic models Continuity of permeable and impermeable units strongly affects the flow simulation response in geologic media. Important factors include the size of permeable and impermeable bodies, their internal geometries, and whether they connect to injection and production wells at different stages of reservoir development. Most of the currently available analysis tools for geologic modeling cannot easily handle irregularities such as faults, onlap and truncations, or they are strongly limited in the dimensions of the models that are amenable to analysis. We adopt algorithmic graph theory for computationally efficient, continuity analysis. This method can treat irregularities in the geologic model including unstructured grids of unequal cell sizes. Geologic models are transformed from a cell-based representation to a node- and connection-based representation, where both nodes and arcs (connections) can have associated properties. Quantities such as connected components, maximum flow, shortest paths, minimum-cost paths and many other connectivity measures can be determined. These connectivity measures involve connections whose lengths or values are weighted by reservoir parameters such as porosity and permeability. Because graph algorithms are efficient, connectivity can be rapidly evaluated for different wells that might become important during reservoir development. Graph theory algorithms can be applied to rank the anticipated flow performance of different geologic model realizations, to aid in delineating contiguous regions of similar character for use in up-scaling, as well as to assess how well a scaled-up model preserves the continuity of the original detailed geologic model.

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

graph theory
continuity
connectivity
geologic models


Differentiated wavelength assignment with QoS recovery for DWDM next generation internet backbone networks This paper describes a differentiated wavelength assignment strategy for the appropriate allocation of wavelengths on wavelength-routed quality of service (QoS) routes with differentiated QoS class and recovery capabilities. The paper is based on the differentiated MPlambdaS services (DMS) model as a framework for optical bandwidth management and the real time provisioning of optical channels in re-configurable transport networks. MPlambdaS stands for multi protocol lambda switching which is a functional part of GMPLS (generalized MPLS). We discuss here a QoS recovery scheme at the optical layer, at the MPlambdaS layer, and at the IP layer, as related to QoS failure caused by device failures or attack-induced faults in dense-wavelength division multiplexing (DWDM) transport networks. According to the QoS characteristics of wavelength in optical links and the type of used optical cross-connect (OXC) nodes, a differentiated wavelength assignment strategy that considers QoS recovery capability is also described. We point out important problems that should be resolved in the DMS model for optical QoS routing with differentiated wavelength assignment.

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


faster symmetry discovery using sparsity of symmetries Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this symmetry. However, existing tools suffer quadratic runtime in the number of symmetries explicitly returned and are of limited use on very large, sparse, symmetric graphs. This paper introduces a new symmetry-discovery algorithm which exploits the sparsity present not only in the input but also the output, i.e., the symmetries themselves. By avoiding quadratic runtime on large graphs, it improves state-of-the-art runtimes from several days to less than a second.

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

graph automorphism
partition refinement
constraint satisfaction problems
boolean satisfiability
model checking


learning organization principles & project management Technology projects are getting more numerous and more complex for nearly everyone. At the same time, our colleagues are becoming less accepting of older management models. This combination can be a formula for disaster or can be used as a springboard to initiate management changes and simultaneously do better in managing both single projects and entire slates of projects. At the University of Memphis under the leadership of Dr. James I. Penrod who was at that time the CIO, we began a concerted effort to create a cultural transformation of the information technology organization by using Peter Senge's learning organization principles. This article shows how these principles were applied to improving the way our division handled the management of technology projects on behalf of the University.

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

pert
cpm
complexity
team learning
slate
shared vision
project slate
personal mastery
mental models
alignment
project
systems thinking
accountability


Estimation of Distribution Algorithms as Logistic Regression Regularizers of Microarray Classifiers Objectives: The "large k (genes), small N (samples)" phenomenon complicates the problem of microarray classification with logistic regression. The indeterminacy of the maximum likelihood solutions, multicollinearity of predictor variables and data over-fitting cause unstable parameter estimates. Moreover, computational problems arise due to the large number of predictor (genes) variables. Regularized logistic regression excels as a solution. However, the difficulties found here involve an objective function hard to be optimized from a mathematical viewpoint and a careful required tuning of the regularization parameters. Methods: Those difficulties are tackled by introducing a new way of regularizing the logistic regression. Estimation of distribution algorithms (EDAs), a kind of evolutionary algorithms, emerge as natural regularizers. Obtaining the regularized estimates of the logistic classifier amounts to maximizing the likelihood function via our EDA, without having to be penalized. Likelihood penalties add a number of difficulties to the resulting optimization problems, which vanish in our case. Simulation of new estimates during the evolutionary process of EDAs is performed in such a way that guarantees their shrinkage while maintaining their probabilistic dependence relationships learnt. The EDA process is embedded in an adapted recursive feature elimination procedure, thereby providing the genes that are best markers for the classification. Results: The consistency with the literature and excellent classification performance achieved with our algorithm are illustrated on four microarray data sets: Breast, Colon, Leukemia and Prostate. Details on the last two data sets are available as supplementary material. Conclusions: We have introduced a novel EDA-based logistic regression regularizer. It implicitly shrinks the coefficients during EDA evolution process while optimizing the usual likelihood function. The approach is combined with a gene subset selection procedure and automatically tunes the required parameters. Empirical results on microarray data sets provide sparse models with confirmed genes and performing better in classification than other competing regularized methods.

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

logistic regression
regularization
estimation of distribution algorithms


Approximate steady-state analysis of large Markov models based on the structure of their decision diagram encoding We propose a new approximate numerical algorithm for the steady-state solution of general structured ergodic Markov models. The approximation uses a state-space encoding based on multiway decision diagrams and a transition rate encoding based on a new class of edge-valued decision diagrams. The new method retains the favorable properties of a previously proposed Kronecker-based approximation, while eliminating the need for a Kronecker-consistent model decomposition. Removing this restriction allows for a greater utilization of event locality, which facilitates the generation of both the state-space and the transition rate matrix, thus extends the applicability of this algorithm to larger and more complex models. (C) 2011 Elsevier B.V. All rights reserved.

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

markov chains
steady-state analysis
aggregation


Bilingual cluster based models for statistical machine translation We propose a domain specific model for statistical machine translation. It is well-known that domain specific language models perform well in automatic speech recognition. We show that domain specific language and translation models also benefit statistical machine translation. However, there are two problems with using domain specific models. The first is the data sparseness problem. We employ an adaptation technique to overcome this problem. The second issue is domain prediction. In order to perform adaptation, the domain must be provided, however in many cases, the domain is not known or changes dynamically. For these cases, not only the translation target sentence but also the domain must be predicted. This paper focuses on the domain prediction problem for statistical machine translation. In the proposed method, a bilingual training corpus, is automatically clustered into sub-corpora. Each sub-corpus is deemed to be a domain. The domain of a source sentence is predicted by using its similarity to the sub-corpora. The predicted domain (sub-corpus) specific language and translation models are then used for the translation decoding. This approach gave an improvement of 2.7 in BLEU score on the IWSLT05 Japanese to English evaluation corpus (improving the score from 52.4 to 55.1). This is a substantial gain and indicates the validity of the proposed bilingual cluster based models.

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

statistical machine translation
domain specific model


Rapid re-meshing and re-solution of three-dimensional boundary element problems for interactive stress analysis Structural design of mechanical components is an iterative process that involves multiple stress analysis runs; this can be time consuming and expensive. It is becoming increasingly possible to make significant improvements in the efficiency of this process by increasing the level of interactivity. One approach is through real-time re-analysis of models with continuously updating geometry. A key part of such a strategy is the ability to accommodate changes in geometry with minimal perturbation to an existing mesh. This work introduces a new re-meshing algorithm that can generate and update a boundary element mesh in real-time as a series of small changes are sequentially applied to the associated model. The algorithm is designed to make minimal updates to the mesh between each step whilst preserving a suitable mesh quality that retains accuracy in the stress results. This significantly reduces the number of terms that need to be updated in the system matrix, thereby reducing the time required to carry out a re-analysis of the model. A range of solvers are assessed to find the most efficient and robust method of re-solving the system. The GMRES algorithm, using complete approximate LU preconditioning, is found to provide the fastest convergence rate.

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

boundary element method
meshing
re-analysis
linear solvers


localization for mobile sensor networks Many sensor network applications require location awareness, but it is often too expensive to include a GPS receiver in a sensor network node. Hence, localization schemes for sensor networks typically use a small number of seed nodes that know their location and protocols whereby other nodes estimate their location from the messages they receive. Several such localization techniques have been proposed, but none of them consider mobile nodes and seeds. Although mobility would appear to make localization more difficult, in this paper we introduce the sequential Monte Carlo Localization method and argue that it can exploit mobility to improve the accuracy and precision of localization. Our approach does not require additional hardware on the nodes and works even when the movement of seeds and nodes is uncontrollable. We analyze the properties of our technique and report experimental results from simulations. Our scheme outperforms the best known static localization schemes under a wide range of conditions.

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

network
sensor networks
applications
method
localization
use
accuracy
movement
exploit
mobility
monte carlo
hardware
paper
scheme

precise
estimates
simulation
experimentation
locatability
message
monte carlo localization
mobile sensor
location-aware


VMNet: Realistic emulation of wireless sensor networks Many research activities on Wireless Sensor Networks (WSNs) need detailed performance statistics about protocols, systems, and applications; however, current simulation tools and testbeds lack mechanisms to report these statistics realistically and conveniently. To address this need, we have developed a WSN emulator, VMNet. VMNet emulates networked sensor nodes at the level of CPU clock cycles and executes the binary code of real applications directly. It emulates the radio channel with loss and noise as well as emulates the peripherals in sufficient detail. Moreover, VMNet takes parameter values from the real world and logs detailed runtime information of emulated nodes. Consequently, the application performance, both in response time and in power consumption, is reported realistically in VMNet, as demonstrated by our comparison studies with real sensor networks.

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


A logic for reasoning about ambiguity ? Standard models of multi-agent modal logic do not capture the fact that information is often ambiguous, and may be interpreted in different ways by different agents. We propose a framework that can model this, and consider different semantics that capture different assumptions about the agents' beliefs regarding whether or not there is ambiguity. We examine the expressive power of logics of ambiguity compared to logics that cannot model ambiguity, with respect to the different semantics that we propose.

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


A shock model for the maintenance problem of a repairable system In this paper, a shock model for the maintenance problem of a repairable system is studied. Assume that shocks will arrive according to a Poisson process. If the interarrival time of two successive shocks is less than a threshold, then the system will fail. For a deteriorating system, we assume that the successive threshold values are geometrically nondecreasing after repair, and the consecutive repair times after failure form an increasing geometric process. For an improving system, we assume that the successive threshold values are geometrically decreasing after repair, and the consecutive repair times after failure form a decreasing geometric process. A replacement policy N is adopted by which we shall replace the system by an identical new one at the time following the Nth failure. Then for each of the deteriorating system and improving system, an optimal policy N? for minimizing the long-run average cost per unit time is determined explicitly.

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


phase coupling and constant generation in an optimizing microcode compiler The designer of an optimizing compiler must concern himself with the order in which optimization phases are performed; a pair of phases may be interdependent in the sense that each phase could benefit from information produced by the other. In a compiler for a horizontal target architecture, one such phase-ordering problem occurs between code-generation and compaction . Presented here is an overview of a research effort at Carnegie-Mellon University which has examined solutions to this problem. One aspect of the code generation problem-that of generating constants intelligently-is discussed in detail. A technique, called constant-unfolding , is described that can be used to produce code sequences that generate constants in unusual ways during execution; such code sequences can lead to more compact code when the literal field of the microinstruction is a bottleneck.

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

order
generation
research
aspect
optimizing compiler
compact
code
architecture

optimality
couples
design
compilation
informal
sequence
code generation


SVM-based feature selection to optimize sensitivityspecificity balance applied to weaning Classification algorithms with unbalanced datasets tend to produce high predictive accuracy over the majority class, but poor predictive accuracy over the minority class. This problem is very common in biomedical data mining. This paper introduces a Support Vector Machine (SVM)-based optimized feature selection method, to select the most relevant features and maintain an accurate and well-balanced sensitivityspecificity result between unbalanced groups. A new metric called the balance index (B) is defined to implement this optimization. The balance index measures the difference between the misclassified data within each class. The proposed optimized feature selection is applied to the classification of patients' weaning trials from mechanical ventilation: patients with successful trials who were able to maintain spontaneous breathing after 48h and patients who failed to maintain spontaneous breathing and were reconnected to mechanical ventilation after 30min. Patients are characterized through cardiac and respiratory signals, applying joint symbolic dynamic (JSD) analysis to cardiac interbeat and breath durations. First, the most suitable parameters (C+,C?,? C + , C ? , ? ) are selected to define the appropriate SVM. Then, the feature selection process is carried out with this SVM, to maintain B lower than 40%. The best result is obtained using 6 features with an accuracy of 80%, a B of 18.64%, a sensitivity of 74.36% and a specificity of 82.42%.

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

balance index
sensitivityspecificity balance
feature selection

support vector machines
cardiorespiratory interaction
joint symbolic dynamics
weaning procedure


On the importance of breaking ties in the relaxed plan heuristic The relaxed plan heuristic is a domain-independent heuristic for automated planning that computes an estimate of the cost for achieving the goals from a given state. This heuristic is based on the idea of solving a relaxed version of the planning task. Due to the great size of the state space, most heuristic search algorithms in planning suffer from scalability problems. These algorithms have to evaluate a great amount of states, and the time devoted to heuristic evaluations is one of the causes of the scalability problems. We argue that one way to lighten this problem is breaking ties in the heuristic value using additional information computed during the relaxed plan construction. We add a complementary value to the heuristic, allowing algorithms to discriminate between states with relaxed plans of the same length but with a different difficulty. The experimental evaluation in some planning benchmarks shows that the modification to the original heuristic can reduce the number of evaluated nodes for the most common algorithms used in heuristic planning.

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


Context-Based Matching and Ranking of Web Services for Composition In this work, we propose a two-step, context-based semantic approach to the problem of matching and ranking Web services for possible service composition. We present an analysis of different methods for classifying Web services for possible composition and supply a context-based semantic matching method for ranking these possibilities. Semantic understanding of Web services may provide added value by identifying new possibilities for compositions of services. The semantic matching ranking approach is unique since it provides the Web service designer with an explicit numeric estimation of the extent to which a possible composition "makes sense." First, we analyze two common methods for text processing, TF/IDF and context analysis; and two types of service description, free text and WSDL. Second, we present a method for evaluating the proximity of services for possible compositions. Each Web service WSDL context descriptor is evaluated according to its proximity to other services' free text context descriptors. The methods were tested on a large repository of real-world Web services. The experimental results indicate that context analysis is more useful than TF/IDF. Furthermore, the method evaluating the proximity of the WSDL description to the textual description of other services provides high recall and precision results.

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

intelligent web services and semantic web


Multiobjective layout optimization of robotic cellular manufacturing systems This paper proposes a multiobjective layout optimization method for the conceptual design of robot cellular manufacturing systems. Robot cellular manufacturing systems utilize one or more flexible robots which can carry out a large number of operations, and can conduct flexible assemble processes. The layout design stage of such manufacturing systems is especially important since fundamental performances of the manufacturing system under consideration are determined at this stage. In this paper, the design criteria for robot cellular manufacturing system layout designs are clarified, and objective functions are formulated. Next, layout design candidates are represented using a sequence-pair scheme to avoid interference between assembly system components, and the use of dummy components is proposed to represent layout areas where components are sparse. A multiobjective genetic algorithm is then used to obtain Pareto optimal solutions for the layout optimization problems. Finally, several numerical examples are provided to illustrate the effectiveness and usefulness of the proposed method. (c) 2012 Elsevier Ltd. All rights reserved.

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

robot cell
assembly layout
design optimization
sequence-pair representation


Organizing thematic, geographic, and temporal knowledge in a well-founded navigation space: Logical and algorithmic foundations for EFGT nets We introduce a family of symbolic logical formalisms for reasoning with named entities, associated topics or thematic fields, geographic areas, and temporal periods, We argue that this kind of knowledge is useful for various applications in a Semantic Web context, in other words, for the content-oriented description of Web services and yellow pages. In our approach, entities and their relationships are positioned in a well-founded (i.e., acyclic) navigation space, called an EFGT Net. Large (small) entries regarding the navigation order represent general (specific) topics and large (small) geographic or temporal areas. This acyclic organization of knowledge aims to support indexing, search, and classification tasks directly. Each entry comes with a unique identifier that describes the role of the corresponding concept, using techniques from description logics. A formal semantics for the language of identifiers is given. For the resulting logic, role hierarchies and role-value maps are characteristic and crucial. Based on the semantics of identifiers, a set of intensionally typed links is defined that induces the aforementioned navigation structure on the set of all entries. We then introduce a set of deduction rules and a saturation procedure for computing all links between concepts, as well as intensional types for links. We prove soundness, completeness, and termination of the link derivation calculus.

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

data organization
data semantics
geographic and temporal information
hierarchical model
knowledge classification
knowledge models
knowledge utilization logic
ontologies
semantic matching
term hierarchies


The Partitioning MinMax Weighted Matching Problem We introduce the Partitioning MinMax Weighted Matching Problem (PMMWM). PMMWM combines a maximum matching and a partitioning problem. Applications arise in the field of intermodal container terminals and sea ports. We prove strong NP-hardness of PMMWM. We present two heuristic frameworks and an extensive computational study.

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

assignment
bipartite graph
container transshipment


Introduction of architecturally visible storage in instruction set extensions Instruction set extensions (ISEs) can be used effectively to accelerate the performance of embedded,processors. The critical and difficult task of ISE selection is often performed manually by designers. A few automatic methods for ISE generation have shown good capabilities but are still limited in the handling of memory accesses, and so they fail to directly address the memory wall problem. We present here the first ISE identification technique that can automatically. identify state-holding application-specific functional units (AFUs) comprehensively, thus being able to eliminate a large portion of memory traffic from cache and the main memory. Our cycle-accurate results obtained by the SimpleScalar simulator show that the identified AFUs with architecturally visible storage gain significantly more than previous techniques and achieve an average speedup of 2.8x over pure software execution with a little area overhead., Moreover, the number of required memory-access instructions is reduced by two thirds on average, suggesting corresponding benefits on energy consumption.

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

application-specific processors
instruction set extensions (ises)


Subset construction complexity for homogeneous automata, position automata and ZPC-structures The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subset-automaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the computation of deterministic transitions and the set equality tests, is examined depending on whether the nondeterministic automaton is an unrestricted one, an homogeneous one. a position one or a ZPC-structure, which is an implicit construction for a position automaton. (C) 2001 Elsevier Science B.V. All rights reserved.

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

homogeneous automaton
position sets
zpc-structure


Parameterization of All Stabilizing Two-Degrees-of-Freedom Simple Repetitive Controllers with Specified Frequency Characteristics The simple repetitive control system proposed by Yamada et al. is a type of servomechanism for periodic reference inputs. This system follows a periodic reference input with a small steady-state error, even if there is periodic disturbance or uncertainty in the plant. In addition, simple repetitive control systems ensure that transfer functions from the periodic reference input to the output and from the disturbance to the output have finite numbers of poles. Yamada et al. clarified the parameterization of all stabilizing simple repetitive controllers. Recently, Yamada et al. proposed the parameterization of all stabilizing two-degrees-of-freedom (TDOF) simple repetitive controllers that can specify the input-output characteristic and the disturbance attenuation characteristic separately. However, when using the method of Yamada et al., it is complex to specify the low-pass filter in the internal model for the periodic reference input that specifies the frequency characteristics. This paper extends the results of Yamada et al. and proposes the parameterization of all stabilizing TDOF simple repetitive controllers with specified frequency characteristics in which the low-pass filter can be specified beforehand.

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

finite number of poles
low-pass filter
two-degrees-of-freedom control


10-bit 100-MS/s Pipelined ADC Using Input-Swapped Opamp Sharing and Self-Calibrated V/I Converter A 31 mW, 10-bit 100-MS/s pipelined analog-to-digital converter (ADC), which alleviates the memory effect occurring in the opamp-sharing technique, and automatically corrects the current error of the V/I converter, has been developed. The proposed ADC achieves low-power consumption, high noise immunity, and has a small area, by employing an input-swapped opamp-sharing technique that switches the summing node in an multiplying digital-to-analog converter and a V/I converter with a process, supply voltage, and temperature condition detector. The ADC shows a differential nonlinearity of less than 0.48 LSB, and an integral nonlinearity of less than 0.95 LSB. Also, an signal-to-noise-and-distortion ratio of 56.2 dB is measured with a 1 MHz input frequency. This has been implemented in a 0.18-mu m CMOS process, and occupies 1.6 x 0.8 mm(2) of active area.

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

pipelined analog-to-digital converter (adc)


A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand We consider a generalization of the well-known capacitated facility location problem with single source constraints in which customer demand contains a flexible dimension. This work focuses on providing fast and practically implementable optimization-based heuristic solution methods for very large scale problem instances. We offer a unique approach that utilizes a high-quality efficient heuristic within a neighborhood search to address the combined assignment and fixed-charge structure of the underlying optimization problem. We also study the potential benefits of combining our approach with a so-called very large-scale neighborhood search (VLSN) method. As our computational test results indicate, our work offers an attractive solution approach that can be tailored to successfully solve a broad class of problem instances for facility location and similar fixed-charge problems.

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


EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS In this paper, we study several interesting optimal-ratio region detection (ORD) problems in d-D (d >= 3) discrete geometric spaces, which arise in high dimensional medical image segmentation. Given a d-D voxel grid of n cells, two classes of geometric regions that are enclosed by a single or two coupled smooth heighfield surfaces defined on the entire grid domain are considered. The objective functions are normalized by a function of the desired regions, which avoids a bias to produce an overly large or small region resulting from data noise. The normalization functions that we employ are used in real medical image segmentation. To our best knowledge, no previous results on these problems in high dimensions are known. We develop a unified algorithmic framework based on a careful characterization of the intrinsic geometric structures and a nontrivial graph transformation scheme, yielding efficient polynomial time algorithms for solving these ORD problems. Our main ideas include the following. We observe that the optimal solution to the ORD problems can be obtained via the construction of a convex hull for a set of O(n) unknown 2-D points using the hand probing technique. The probing oracles are implemented by computing a minimum s-t cut in a weighted directed graph. The ORD problems are then solved by O(n) calls to the minimum s-t cut algorithm. For the class of regions bounded by a single heighfield surface, our further investigation shows that the O(n) calls to the minimum s-t cut algorithm are on a monotone parametric flow network, which enables to detect the optimal-ratio region in the complexity of computing a single maximum flow.

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

parametric search
minimum closed set
optimal-ratio region detection


Expert system to evaluate English medium instruction in Korean Universities Recently, many Universities in Korea have been encouraging English Medium Instruction (EMI) to cope up with globalization, but many problems have emerged. We use the Structural Equation Model (SME) to understand the causal relationship among potential factors on engineering students satisfaction on the EMI. In addition, we develop Customer Satisfaction Index (CSI) to estimate the students satisfaction about EMI, based on the proposed SEM. This satisfaction index is used to improve the currently employed EMI. In addition, we suggest some alternatives using the cluster analysis.

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


Nonparametric Scene Parsing via Label Transfer While there has been a lot of recent work on object recognition and image understanding, the focus has been on carefully establishing mathematical models for images, scenes, and objects. In this paper, we propose a novel, nonparametric approach for object recognition and scene parsing using a new technology we name label transfer. For an input image, our system first retrieves its nearest neighbors from a large database containing fully annotated images. Then, the system establishes dense correspondences between the input image and each of the nearest neighbors using the dense SIFT flow algorithm [28], which aligns two images based on local image structures. Finally, based on the dense scene correspondences obtained from SIFT flow, our system warps the existing annotations and integrates multiple cues in a Markov random field framework to segment and recognize the query image. Promising experimental results have been achieved by our nonparametric scene parsing system on challenging databases. Compared to existing object recognition approaches that require training classifiers or appearance models for each object category, our system is easy to implement, has few parameters, and embeds contextual information naturally in the retrieval/alignment procedure.

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

object recognition
scene parsing
label transfer
sift flow


Research trends in teens health information behaviour: a review of the literature This study aims to examine trends in studies of teens health information behaviour.

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


The roles of sharing, transfer, and public funding in nanotechnology knowledge-diffusion networks Understanding the knowledge-diffusion networks of patent inventors can help governments and businesses effectively use their investment to stimulate commercial science and technology development. Such inventor networks are usually large and complex. This study proposes a multidimensional network analysis framework that utilizes Exponential Random Graph Models (ERGMs) to simultaneously model knowledge-sharing and knowledge-transfer processes, examine their interactions, and evaluate the impacts of network structures and public funding on knowledge-diffusion networks. Experiments are conducted on a longitudinal data set that covers 2 decades (19912010) of nanotechnology-related US Patent and Trademark Office (USPTO) patents. The results show that knowledge sharing and knowledge transfer are closely interrelated. High degree centrality or boundary inventors play significant roles in the network, and National Science Foundation (NSF) public funding positively affects knowledge sharing despite its small fraction in overall funding and upstream research topics.

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


Differential fault analysis on the contracting UFN structure, with application to SMS4 and MacGuffin The contracting unbalanced Feistel networks (UFN) is a particular structure in the block ciphers, where the left half and the right half are not of equal size, and the size of the domain of one half is larger than that of the range. This paper studies the security of the contracting UFN structure against differential fault analysis (DFA). We propose two basic byte-oriented fault models and two corresponding attacking methods. Then we implement the attack on two instances of the contracting UFN structure, the block ciphers SMS4 and MacGuffin. The experiments require 20 and 4 faulty ciphertexts to recover the 128-bit secret key of SMS4 in the two fault models, respectively. Under similar hypothesis, MacGuffin is breakable with 355 and 165 faulty ciphertexts, respectively. So our work not only builds up a general model of DFA on the contracting UFN structure and ciphers, but also provides a new reference for fault analysis on other block ciphers.

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

differential fault analysis
block ciphers
sms4
macguffin


cross-contamination aware design methodology for pin-constrained digital microfluidic biochips Digital microfluidic biochips have emerged as a popular alternative for laboratory experiments. Pin-count reduction and cross-contamination avoidance are key design considerations for practical applications with different droplets being transported and manipulated on highly integrated biochips. We present in this paper the first design automation flow that considers the cross-contamination problems on pin-constrained biochips. We explore the factors that make the problems harder on pin-constrained biochips. To cope with these cross contaminations, we propose (1) early crossing minimization algorithms during placement, and (2) systematic wash droplet scheduling and routing that require only one extra control pin and zero assay completion time overhead for practical bioassays. Experimental results show the effectiveness and scalability of our algorithms for practical bioassays.

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


Patient-directed intelligent and interactive computer medical history-gathering systems: A utility and feasibility study in the emergency department Patients can be used as a resource to enter their own pertinent medical information. This study will evaluate the feasibility of an intelligent computer medical history-taking device directed at patients in the emergency department (ED). Two of the authors (MB, RE) developed an expert system that can take patient-directed medical histories. Patients interacted with the computer in the ED waiting room while it gathered a medical history based on chief complaint (CC). A survey was completed post history. A sub-study assessed the computer's ability to take an adequate history for an index CC. We compared the computer and emergency physician histories for the presence or absence of important historical elements. Sixty-seven patients used the interactive computer system. The mean time to complete the history was 5min and 32s1min and 21s. The patient response rate was 97%. Over 83% felt that the computer was very easy to use and over 92% would very much use the computer again. A total of 15 patients with abdominal pain (index CC) were evaluated for the sub-study. The computer history asked 907%, and the emergency physician asked 5518%, of the important historical elements. These groups were statistically different with a p-value of <0.00001. This feasibility study has shown that the computer history-taking device is well accepted by patients and that such a system can be integrated into the normal process of patient triage without delaying patient care. Such a system can serve as an initial mode for documentation and data acquisition directly from the patient.

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

medical history taking/methods
attitude to computers
point-of-care systems
medical record systems
computerized
expert systems
automatic data processing


Modelling potential movement in constrained travel environments using rough space-time prisms The widespread adoption of location-aware technologies (LATs) has afforded analysts new opportunities for efficiently collecting trajectory data of moving individuals. These technologies enable measuring trajectories as a finite sample set of time-stamped locations. The uncertainty related to both finite sampling and measurement errors makes it often difficult to reconstruct and represent a trajectory followed by an individual in space-time. Time geography offers an interesting framework to deal with the potential path of an individual in between two sample locations. Although this potential path may be easily delineated for travels along networks, this will be less straightforward for more nonnetwork-constrained environments. Current models, however, have mostly concentrated on network environments on the one hand and do not account for the spatiotemporal uncertainties of input data on the other hand. This article simultaneously addresses both issues by developing a novel methodology to capture potential movement between uncertain space-time points in obstacle-constrained travel environments.

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

space-time prism
obstacles
accessibility


Sparse multivariate function recovery with a small number of evaluations ? In Kaltofen and Yang (2014) we give an algorithm based algebraic error-correcting decoding for multivariate sparse rational function interpolation from evaluations that can be numerically inaccurate and where several evaluations can have severe errors (outliers). Our 2014 algorithm can interpolate a sparse multivariate rational function from evaluations where the error rate 1/q 1 / q is quite high, say q=5 q = 5 . For the algorithm with exact arithmetic and exact values at non-erroneous points, one avoids quadratic oversampling by using random evaluation points. Here we give the full probabilistic analysis for this fact, thus providing the missing proof to Theorem 2.1 in Section 2 of our ISSAC 2014 paper. Our argumentation already applies to our original 2007 sparse rational function interpolation algorithm (Kaltofen et al., 2007), where we have experimentally observed that for T unknown non-zero coefficients in a sparse candidate ansatz one only needs T+O(1) T + O ( 1 ) evaluations rather than O(T2) O ( T 2 ) (cf. Cands and Tao sparse sensing), the latter of which we have proved in 2007. Here we prove that T+O(1) T + O ( 1 ) evaluations at random points indeed suffice.

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

error correcting coding
fault tolerance
cauchy interpolation
multivariate rational function model


The phrase information storage and retrieval (IS&R): An historical note Scholars have uncovered abundant data about the history of the term information, as well as some of its many combined phrases (e.g., information science, information retrieval, and information technology). Many other compounds that involve information seem, however, not to have a known origin yet. In this article, further information about the phrase information storage and retrieval is provided. Knowing the history of terms and their associated concepts is an important prescription against poor terminological phrasing and theoretical confusion.

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

information storage and retrieval systems


Adaptive grid optical tomography Image-based modeling of semi-transparent, dynamic phenomena is a challenging task. We present an optical tomography method that uses an adaptive grid for the reconstruction of a three-dimensional density function from its projections. The proposed method is applied to reconstruct thin smoke and flames volumetrically from synchronized multi-video recordings. Our adaptive reconstruction algorithm computes a time-varying volumetric model, that enables the photorealistical rendering of the recorded phenomena from arbitrary viewpoints. In contrast to previous approaches we sample the underlying unknown, three-dimensional density function adaptively which enables us to achieve a higher effective resolution of the reconstructed models.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 based reconstruction
dynamic volumetric models
natural phenomena


Proactive privacy practices in transition: Toward ubiquitous services As the Internet paved the way for electronic businesses, ubiquitous services (u-services) will be the next wave launched by electronic services based on current customer information potential. However, privacy is a strategic issue and has been identified as a key hindrance to u-services. As a proactive approach and drawing upon integrative social contracts theory, this study presents a proactive privacy practices framework to examine how the interplays within electronic service, providers proactive approaches influence customer disclosure willingness for future u-services, adoption. The results and implications of this study are discussed and expected to shed light on privacy practices.

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

electronic services
ubiquitous services
disclosure willingness
integrative social contracts theory

mobile services
mobile commerce
ubiquitous
commerce
proactive privacy governance


Deterministic Extractors for Independent-Symbol Sources In this paper, we consider the task of deterministically extracting randomness from sources consisting of a sequence of n independent symbols from {0, 1}(d). The only randomness guarantee on such a source is that the whole source has min-entropy k. We give an explicit deterministic extractor which extract Omega(log k - log log(1/epsilon)) bits with error epsilon, for any, n, d, k is an element of N and epsilon is an element of (0, 1). For sources with a larger min-entropy, we can extract even more randomness. When k >= n(1/2+gamma), for any constant gamma is an element of (1, 1/2), we can extract m = k - O(d log(1/epsilon)) bits with any error epsilon >= 2(-Omega(n gamma)). When k >= log(c) n, for some constant c > 0 , we can extract m = k - (1/epsilon)(O(1)) bits with any error epsilon >= k(-Omega(1)). Our results generalize those of Kamp and Zuckerman and Gabizon et al. which only work for bit-fixing sources (with d = 1 and each bit of the source being either fixed or perfectly random). Moreover, we show the existence of a nonexplicit deterministic extractor which can extract m = k - O(log(1/epsilon)) bits whenever k = omega(d + log(n/epsilon)). Finally, we show that even to extract from bit-fixing sources, any extractor, seeded or not, must suffer an entropy loss k - m = Omega(log(1/epsilon)). This generalizes a lower bound of Radhakrishnan and Ta-Shma on extracting from general sources.

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

independent-symbol sources
min-entropy
pseudo-randomness
randomness extractors


A comparison of clustering-based privacy-preserving collaborative filtering schemes Privacy-preserving collaborative filtering (PPCF) methods designate extremely beneficial filtering skills without deeply jeopardizing privacy. However, they mostly suffer from scalability, sparsity, and accuracy problems. First, applying privacy measures introduces additional costs making scalability worse. Second, due to randomness for preserving privacy, quality of predictions diminishes. Third, with increasing number of products, sparsity becomes an issue for both CF and PPCF schemes. In this study, we first propose a content-based profiling (CBP) of users to overcome sparsity issues while performing clustering because the very sparse nature of rating profiles sometimes do not allow strong discrimination. To cope with scalability and accuracy problems of PPCF schemes, we then show how to apply k-means clustering (KMC), fuzzy c-means method (FCM), and self-organizing map (SOM) clustering to CF schemes while preserving users confidentiality. After presenting an evaluation of clustering-based methods in terms of privacy and supplementary costs, we carry out real data-based experiments to compare the clustering algorithms within and against traditional CF and PPCF approaches in terms of accuracy. Our empirical outcomes demonstrate that FCM achieves the best low cost performance compared to other methods due to its approximation-based model. The results also show that our privacy-preserving methods are able to offer precise predictions.

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

privacy
collaborative filtering
accuracy
profiling
clustering


STUCK IN THE CONFLICTED MIDDLE: A ROLE-THEORETIC PERSPECTIVE ON B2B E-MARKETPLACES Over the years, research on the implications of information technology on network governance structures has explored the "move to the market" and the "move to the middle" hypotheses. The middle is a space in which the logic and modalities of markets and hierarchies are intermingled. There is increasing evidence that most network relations reflect mixed-mode or hybrid logic. Despite the apparent advantages that make the middle so populous or "swollen" (Hennart 1993, p. 472), Kambil et al. (1999) highlight that it is riddled with uncertainty and high transaction costs. They label it "the conflicted middle" and propose that online marketplaces, specifically all-in-one markets, are capable of resolving this conflict. Unfortunately, however, Kambil et al. provide limited insight into both the nature of the conflict that plagues the middle and the ability of all-in-one markets to resolve it. To address these questions, this paper applies a role-theoretic perspective to the study of an e-marketplace that served the energy industry and evolved into an all-in-one market. Relying on an interpretive case study, this paper addresses the following research questions: (I) What is the nature of the conflict that characterizes the conflicted middle? (2) How do e-marketplaces, specifically all-in-one markets, help resolve this conflict? Our research highlights that brokers, trading partners, and agents who operate in the middle (where the contradictory logic of markets and hierarchies are mixed) experience goal, behavior, and identity conflict. All-in-one markets can help resolve these conflicts by supporting role integration at the group level and role segmentation at the individual level.

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

network governance structures
market
move to the middle

b2b e-marketplace
all-in-one markets
hierarchy
role theory
role conflict


Exact Random Coding Exponents for Erasure Decoding Random coding of channel decoding with an erasure option is studied. By analyzing the large deviations behavior of the code ensemble, we obtain exact single-letter formulas for the error exponents in lieu of Forney's lower bounds. The analysis technique we use is based on an enhancement and specialization of tools for assessing the statistical properties of certain distance enumerators. We specialize our results to the setup of the binary symmetric channel case with uniform random coding distribution and derive an explicit expression for the error exponent which, unlike Forney's bounds, does not involve optimization over two parameters. We also establish the fact that for this setup, the difference between the exact error exponent corresponding to the probability of undetected decoding error and the exponent corresponding to the erasure event is equal to the threshold parameter. Numerical calculations indicate that for this setup, as well as for a Z-channel, Forney's bound coincides with the exact random coding exponent.

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


Regularities and their relations to error bounds In this paper. we mainly study various notions of regularity for a finite collection (C-1,...,C-m) of closed convex Subsets of a Barrach space X and their relations with other fundamental concepts. We show that a proper lower semicontinuous function f on X has a Lipschitz error bound (resp., Y-error bound) if and only if the pair {epi (f), X x {0}} of sets in the product space X x R is linearly regular (resp., regular). Similar results for multifunctions are also established. Next. we prove that {C-1,...,C-m} is linearly regular if and onIy if it has the strong CHIP and the collection {N-C1 (z),...,N-Cm (z)} of normal cones at z has property (G) for each z is an element of C := boolean AND(i=1)(m) C-i. Provided that C-1 is a closed convex cone and that C-2 = Y is a closed vector subspace of X, we show that (C-1, Y) is linearly regular if and only if there exists alpha > 0 such that each positive (relative to the order induced by C,) linear functional on Y of norm one can be extended to a positive linear functional on X with norm bounded by alpha. Similar characterization is given in terms of normal cones.

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

error bound
linearly regular
regular
strong chip
positive linear functional

epigraph
graph
multifunction
normal cone
property (g)
tangent cone


Kubios HRV Heart rate variability analysis software Kubios HRV is an advanced and easy to use software for heart rate variability (HRV) analysis. The software supports several input data formats for electrocardiogram (ECG) data and beat-to-beat RR interval data. It includes an adaptive QRS detection algorithm and tools for artifact correction, trend removal and analysis sample selection. The software computes all the commonly used time-domain and frequency-domain HRV parameters and several nonlinear parameters. There are several adjustable analysis settings through which the analysis methods can be optimized for different data. The ECG derived respiratory frequency is also computed, which is important for reliable interpretation of the analysis results. The analysis results can be saved as an ASCII text file (easy to import into MS Excel or SPSS), Matlab MAT-file, or as a PDF report. The software is easy to use through its compact graphical user interface. The software is available free of charge for Windows and Linux operating systems at http://kubios.uef.fi.

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

heart rate variability
hrv
analysis software
matlab


Hierarchies of probabilistic and team FIN-learning A FIN-leaming machine M receives successive values of the function f it is learning and at some moment outputs a conjecture which should be a correct index of f. FIN learning has two extensions: (1) If M flips fair coins and learns a function with certain probability p, we have FIN -leaming. (2) When n machines simultaneously try to learn the same function f and at least k of these machines output correct indices of f, we have learning by a [k,n]FIN team. Sometimes a team or a probabilistic learner can simulate another one, if their probabilities p(1), p(2) (Or team success ratios k(1)/n(1),k(2)/n(2)) are close enough (Daley et al., in: Valiant, Waranth (Eds.), Proc. 5th Annual Workshop on Computational Learning Theory. ACM Press, New York, 1992, pp. 203-217: Daley and Kalanasundaram, Available from http://www.cs.pitt.edu/(similar to)daley /fin/fin.html, 1996). On the other hand, there are cut-points r which make simulation of FM(p2) by FIN impossible whenever p(2) less than or equal to r < p(1). Cut-points above (10)/(21) are known (Daley and Kalyanasundaram, Available from http://www.cs.pitt.edu/(similar to)daley/fin/fin.html, 1996). We show that the problem for given k(1),n(1) to determine whether [k(1),n(1)]FIN subset of or equal to [k(2),n(2)]FIN is algorithmically solvable. The set of all FIN cut-points is shown to be well ordered and recursive. Asymmetric teams are introduced and used as both a tool to obtain these results, and are of interest in themselves. The framework of asymmetric teams allows us to characterize intersections [k(1),n(1)]FIN boolean AND [k(2),n(2)]FIN, unions [k(1),n(1)]FIN boolean OR [k(2),n(2)]FIN. and memberwise unions [k(1),n(1)]FIN + [k(2),n(2)]FIN, i.e. collections of all unions U-1 boolean OR U-2 where U-1 is an element of [k(1),n(1)]FIN. Hence, we can compare the learning power of traditional FIN-teams [k,n]FIN as well as all kinds of their set-theoretic combinations. (C) 2001 Elsevier science B.V. All rights reserved.

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

team learning
probabilistic learning
inductive inference