Flow Network QSAR for the Prediction of Physicochemical Properties by Mapping an Electrical Resistance Network onto a Chemical Reaction Poset Usual quantitative structure-activity relationship (QSAR) models are computed from unstructured input data, by using a vector of molecular descriptors for each chemical in the dataset. Another alternative is to consider the structural relationships between the chemical structures, such as molecular similarity, presence of certain substructures, or chemical transformations between compounds. We defined a class of network-QSAR models based on molecular networks induced by a sequence of substitution reactions on a chemical structure that generates a partially ordered set (or poset) oriented graph that may be used to predict various molecular properties with quantitative superstructure-activity relationships (QSSAR). The network-QSAR interpolation models defined on poset graphs, namely average poset, cluster expansion, and spline poset, were tested with success for the prediction of several physicochemical properties for diverse chemicals. We introduce the flow network QSAR, a new poset regression model in which the dataset of chemicals, represented as a reaction poset, is transformed into an oriented network of electrical resistances in which the current flow results in a potential at each node. The molecular property considered in the QSSAR model is represented as the electrical potential, and the value of this potential at a particular node is determined by the electrical resistances assigned to each edge and by a system of batteries. Each node with a known value for the molecular property is attached to a battery that sets the potential on that node to the value of the respective molecular property, and no external battery is attached to nodes from the prediction set, representing chemicals for which the values of the molecular property are not known or are intended to be predicted. The flow network QSAR algorithm determines the values of the molecular property for the prediction set of molecules by applying Ohm's law and Kirchhoff's current law to the poset network of electrical resistances. Several applications of the flow network QSAR are demonstrated.

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

flow network
electrical resistance network

quantitative structure-activity relationship (qsar)

quantitative superstructure-activity relationships (qssar)


Multimedia-integrated application for computer-assisted teaching of technical drawing (AIMEC-DT) This application contributes two fundamental tools for the improvement of the educational process in graphic engineering. On the one hand, the students can develop the training features of the subject by means of a computer program that allows them to have feedback from their work, and on the other, develop abilities in the use of Computer Assisted Drawing (CAD) systems for the execution of technical drawings. Everything is developed in a self-determining way starting from a strategy that the professor has previously personalized. (C) 2004 Wiley Periodicals, Inc.

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

computer-assisted teaching
multimedia systems
educational quality


From rendering to tracking point-based 3D models This paper adds to the abundant visual tracking literature with two main contributions. First, we illustrate the interest of using Graphic Processing Units (GPU) to support efficient implementations of computer vision algorithms, and secondly, we introduce the use of point-based 3D models as a shape prior for real-time 3D tracking with a monocular camera. The joint use of point-based 3D models together with GPU allows to adapt and simplify an existing tracking algorithm originally designed for triangular meshes. Point-based models are of particular interest in this context, because they are the direct output of most laser scanners. We show that state-of-the-art techniques developed for point-based rendering can be used to compute in real-time intermediate values required for visual tracking. In particular, apparent motion predictors at each pixel are computed in parallel, and novel views of the tracked object are generated online to help wide-baseline matching. Both computations derive from the same general surface splatting technique which we implement, along with other low-level vision tasks, on the GPU, leading to a real-time tracking algorithm.

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


formal validation of deadlock prevention in networks-on-chips Complex systems-on-chips (SoCs) are built as the assembly of pre-designed parameterized components. The specification and validation of the communication infrastructure becomes a crucial step in the early phase of any SoC design. The Generic Network-on-Chip model (GeNoC) has been recently proposed as a generic specification environment, restricted to safety properties. We report on an initial extension of the GeNoC model with a generic termination condition and a generic property showing the prevention of livelock and deadlock. The latter shows that all messages injected in the network eventually reach their destination for all possible values of network parameters like topology, size of the network, message length or injection time. We illustrate our initial results with the validation of a circuit switching technique.

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

formal methods
liveness
networks-on-chips


Using a Delphi process and the Analytic Hierarchy Process (AHP) to evaluate the complexity of projects Project complexity is ever growing and needs to be understood, analysed and measured better to assist modern project management. The overall ambition of this paper is therefore to define a measure of project complexity in order to assist decision-making, notably when analysing several projects in a portfolio, or when studying different areas of a project. A synthesised literature review on existing complexity measures is firstly proposed in order to highlight their limitations. Then, we identify the multiple aspects of project complexity thanks to the construction and refinement of a project complexity framework thanks to an international Delphi study. We then propose a multi-criteria approach to project complexity evaluation, underlining the benefits of such an approach. In order to solve properly this multi-criteria problem, we first conduct a critical state of the art on multi-criteria methodologies. We then argue for the use of the Analytic Hierarchy Process. In the end, this tool permits to define a relative project complexity measure, which can notably assist decision-making. Complexity scales and subscales are defined in order to highlight the most complex alternatives and their principal sources of complexity within the set of criteria and sub-criteria which exist in the hierarchical structure. Finally, a case study within a start-up firm in the entertainment industry (musicals production) is performed. Conclusions, limitations and perspectives of research are given in the end.

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

project
complexity
delphi process
evaluation

multi-criteria
analytic hierarchy process (ahp)


WinNet - a network tool Building Internet-like network topologies and performing simulations and/or emulations on them is a task that all network-related topic researchers came across during their study. We propose here a new tool which incorporates network topology generation, visualization, simulation and an analyzing mobile agent based tool. This application can be used for research purposes as well as an educational instrument. Even if it is mainly aimed for computer networks, this application can be also used to solve non-computer network related problems such as logical tasks or database searches.

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

network simulator
topology generator
wave


Motion4D-A library for lightrays and timelike worldlines in the theory of relativity The Motion4D-library solves the geodesic equation as well as the parallel- and Fermi-Walker-transport in four-dimensional Lorentzian spacetimes numerically. Initial conditions are given with respect to natural local tetrads which are adapted to the symmetries or the coordinates of the spacetime. Beside some already implemented metrics like the Schwarzschild and Kerr metric, the object oriented structure of the library permits to implement other metrics or integrators in a straight forward manner.

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

general relativity
timelike and lightlike geodesics


?-RST: a generalization of rough set theory The paper presents a transition from the crisp rough set theory to a fuzzy one, called Alpha Rough Set Theory or, in short, ?-RST. All basic concepts or rough set theory are extended, i.e., information system, indiscernibility, dependency, reduction, core, definability, approximations and boundary. The resulted theory takes into account fuzzy data and allows the approximation of fuzzy concepts. Besides, the control of knowledge granularity is natural in ?-RST which is based on a parameterized indiscernibility relation. ?-RST is developed to recognize non-deterministic relationships using notions as ?-dependency, ?-reduct and so forth. On the other hand, we introduce a notion of relative dependency as an alternative of the absolute definibility presented in rough set theory. The extension ?-RST leads naturally to the new concept of alpha rough sets which represents sets with fuzzy non-empty boundaries.

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

fuzzy sets
attributes dependency
concept approximation


CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing bounded-error summaries of high-dimensional binary attributed data in a distributed environment. Such summaries enable more expensive analysis techniques to be applied efficiently under constraints on computation, communication, and privacy with little loss in accuracy. While the discrete and high-dimensional nature of the dataset makes the problem difficult in its serial formulation, the loose-coupling of distributed servers hosting the data and the heterogeneity in network bandwidth present additional challenges. CONQUEST is based on a novel linear algebraic tool, PROXIMUS, which is shown to be highly effective on a serial platform. In contrast to traditional fine-grained parallel techniques that distribute the kernel operations, CONQUEST adopts a coarse-grained parallel formulation that relies on the principle of sampling to reduce communication overhead while maintaining high accuracy. Specifically, each individual site computes its local patterns independently. Various sites cooperate in dynamically orchestrated work groups to construct consensus patterns from these local patterns. Individual sites may then decide to continue their participation in the consensus or leave the group. Such parallel formulation implicitly resolves load-balancing and privacy issues while reducing communication volume significantly. Experimental results on an Intel Xeon cluster demonstrate that this strategy is capable of excellent performance in terms of compression time, ratio, and accuracy with respect to post-processing tasks.

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

coarse-grained data mining algorithms
compressing binary attributed vectors
non-orthogonal matrix decompositions
correlations in high dimensions


Person recognition by fusing palmprint and palm vein images based on "Laplacianpalm" representation Unimodal analysis of palmprint and palm vein has been investigated for person recognition. One of the problems with unimodality is that the unimodal biometric is less accurate and vulnerable to spoofing, as the data can be imitated or forged. In this paper, we present a multimodal personal identification system using palmprint and palm vein images with their fusion applied at the image level. The palmprint and palm vein images are fused by a new edge-preserving and contrast-enhancing wavelet fusion method in which the modified multiscale edges of the palmprint and palm vein images are combined. We developed a fusion rule that enhances the discriminatory information in the images. Here, a novel palm representation, called "Laplacianpalm" feature, is extracted from the fused images by the locality preserving projections (LPP). Unlike the Eigenpalm approach, the "Laplacianpalm" finds an embedding that preserves local information and yields a palm space that best detects the essential manifold structure. We compare the proposed "Laplacianpalm" approach with the Fisherpalm and Eigenpalm methods on a large data set. Experimental results show that the proposed "Laplacianpalm" approach provides a better representation and achieves lower error rates in palm recognition. Furthermore, the proposed multimodal method outperforms any of its individual modality. (c) 2007 Elsevier Ltd. All rights reserved.

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

palmprint
palm vein
eigenpalm
fisherpalm
laplacianpalm


Pruning an ensemble of classifiers via reinforcement learning This paper studies the problem of pruning an ensemble of classifiers from a reinforcement learning perspective. It contributes a new pruning approach that uses the Q-learning algorithm in order to approximate an optimal policy of choosing whether to include or exclude each classifier from the ensemble. Extensive experimental comparisons of the proposed approach against state-of-the-art pruning and combination methods show very promising results. Additionally, we present an extension that allows the improvement of the solutions returned by the proposed approach over time, which is very useful in certain performance-critical domains.

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


The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach In a typical location-allocation problem, customer demand data are often aggregated according to some arbitrary spatial points (e.g. population centers) or boundaries (e.g. census districts). Since such points or boundaries do not represent true sources of customer demands, allocation of aggregated customers to distribution centers can lead to underutilization of distribution centers and deterioration of customer services. In an effort to design a supply chain network that maintains the best balance of transportation cost and customer service, this paper proposes a new model based on naive balanced star spanning forest formulation. This model goes beyond traditional mathematical programming by incorporating a genetic algorithm that is proven to be effective in dealing with the NP-hard problem. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

supply chain
allocation
genetic algorithm


A sonar, interactive dance and music system This paper describes an interactive system which allows dancers to program music in real time. It uses ultrasonic sonar to determine the positions of the dancers and translates this information into multichannel MIDI output.

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

interactive dance
music synthesis
cognitive map
semantic net
feature extraction
computer music
cyberdeck


Parallel implementations of block-based motion vector estimation for video compression on four parallel processing systems Parallel algorithms, based on a distributed memory machine modal, for an exhaustive search technique for motion vector estimation in video compression are being designed and evaluated. Results from the execution on a 16,384 processor MasPar MP-1 (an SIMD machine), a 140 node Intel Paragon XP/S and a 16 node IBM SP2 (two MIMD machines), and the 16 processor PASM prototype ia partitionable SIMD/MIMD mixed-mode machine) are presented. The trade-offs of using different modes of parallelism (SIMD, SPMD, and mixed-mode) and different data partitioning schemes (thc rectangular and stripe subimage methods are examined. The analytical and experimental results shown in this application study will help practitioners to predict and contrast the performance of different approaches to parallel implementation of this important video compression technique. The results presented are also applicable to a large class of image and video processing tasks. Case studies, such as the one presented here, are a necessary step in developing software tools for mapping an application task onto a single parallel machine and for mapping a set of independent application tasks, or the subtasks of a single application task, onto a heterogeneous suite of parallel machines.

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

mimd
motion vector estimation
simd
video compression


Open source tools for measuring the Internal Quality of Java software products. A survey Automatic measure of metrics with suitable tools is very relevant in development. This paper presents a survey of open source software tools. These tools automate the collection of metrics, particularly for Java code. The paper is based on a Systematic Literature Review Process.

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

tools
open source
metrics
internal quality
java

software product
automation
static analysis
source code


transistor-level layout of high-density regular circuits In this paper, we describe an automatic place and route strategy for a high-density, super-regular, double-gate transistor-array-based layout. Interconnects on all metal layers are uni-directional and can be manufactured by an OPC-free process [4]. Our objective is to achieve a circuit layout area equal to the transistor footprint. Such layout constraints limit routing flexibility and render traditional approaches impractical. Our tools automatically generate circuits with several tens of transistors. Experimental results demonstrate both the efficiency of the proposed algorithms and the high quality of the layouts produced.

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

dfm
regular fabric
transistor layout
placement and routing


Planning in partially-observable switching-mode continuous domains Continuous-state POMDPs provide a natural representation for a variety of tasks, including many in robotics. However, most existing parametric continuous-state POMDP approaches are limited by their reliance on a single linear model to represent the world dynamics. We introduce a new switching-state dynamics model that can represent multi-modal state-dependent dynamics. We present the Switching Mode POMDP (SM-POMDP) planning algorithm for solving continuous-state POMDPs using this dynamics model. We also consider several procedures to approximate the value function as a mixture of a bounded number of Gaussians. Unlike the majority of prior work on approximate continuous-state POMDP planners, we provide a formal analysis of our SM-POMDP algorithm, providing bounds, where possible, on the quality of the resulting solution. We also analyze the computational complexity of SM-POMDP. Empirical results on an unmanned aerial vehicle collisions avoidance simulation, and a robot navigation simulation where the robot has faulty actuators, demonstrate the benefit of SM-POMDP over a prior parametric approach.

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

partially observable markov decision process


Buckling analysis of shear deformable shallow shells by the boundary element method In this work a boundary element (BE) formulation for buckling problem of shear deformable shallow shells is presented. A set of five boundary integral equations are obtained by coupling two-dimensional plane stress elasticity with shear deformable plate bending (Reissner). The domain integrals appearing in the formulation (due to the curvature and due to the domain load) are transferred into equivalent boundary integrals. The BE formulation is presented as an eigenvalue problem, to provide direct evaluation of critical load factors and buckling modes. Several examples are presented. The BE results for a cylindrical shallow shell with different curvatures are compared with other numerical solutions and good agreements are obtained.

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

curved plate
buckling coefficients
shear deformable theory


packet classifiers in ternary cams can be smaller Serving as the core component in many packet forwarding, differentiating and filtering schemes, packet classification continues to grow its importance in today's IP networks. Currently, most vendors use Ternary CAMs (TCAMs) for packet classification. TCAMs usually use brute-force parallel hardware to simultaneously check for all rules. One of the fundamental problems of TCAMs is that TCAMs suffer from range specifications because rules with range specifications need to be translated into multiple TCAM entries. Hence, the cost of packet classification will increase substantially as the number of TCAM entries grows. As a result, network operators hesitate to configure packet classifiers using range specifications. In this paper, we optimize packet classifier configurations by identifying semantically equivalent rule sets that lead to reduced number of TCAM entries when represented in hardware. In particular, we develop a number of effective techniques, which include: trimming rules, expanding rules, merging rules, and adding rules. Compared with previously proposed techniques which typically require modifications to the packet processor hardware, our scheme does not require any hardware modification, which is highly preferred by ISPs. Moreover, our scheme is complementary to previous techniques in that those techniques can be applied on the rule sets optimized by our scheme. We evaluate the effectiveness and potential of the proposed techniques using extensive experiments based on both real packet classifiers managed by a large tier-1 ISP and synthetic data generated randomly. We observe significant reduction on the number of TCAM entries that are needed to represent the optimized packet classifier configurations.

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


Computational trust and reputation models for open multi-agent systems: a review In open environments, agents depend on reputation and trust mechanisms to evaluate the behavior of potential partners. The scientific research in this field has considerably increased, and in fact, reputation and trust mechanisms have been already considered a key elements in the design of multi-agent systems. In this paper we provide a survey that, far from being exhaustive, intends to show the most representative models that currently exist in the literature. For this enterprise we consider several dimensions of analysis that appeared in three existing surveys, and provide new dimensions that can be complementary to the existing ones and that have not been treated directly. Moreover, besides showing the original classification that each one of the surveys provide, we also classify models that where not taken into account by the original surveys. The paper illustrates the proliferation in the past few years of models that follow a more cognitive approach, in which trust and reputation representation as mental attitudes is as important as the final values of trust and reputation. Furthermore, we provide an objective definition of trust, based on Castelfranchi's idea that trust implies a decision to rely on someone.

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

computational trust and reputation models


the language observatory project (lop) The first part of the paper provides a brief description of the Language Observatory Project (LOP) and highlights the major technical difficulties to be challenged. The latter part gives how we responded to these difficulties by adopting UbiCrawler as a data collecting engine for the project. An interactive collaboration between the two groups is producing quite satisfactory results.

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

language digital divide
language identification
character sets
web crawler
scripts


Evaluation of the effect of c.2946+1G>T mutation on splicing in the SCN1A gene Mutagenesis PCR was employed to induce a c.2946+1G>T mutation The c.2946+1G>T mutation caused a total skipping of exon 15. The c.2946+1G>T mutation lead to a deletion of the amino acids (853 Leu 971 Val). The c.2946+1G>T mutation was predicted by the human splicing finder (HSF).

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

cryptogenic generalized epilepsy
directed mutagenesis
functional analysis
exon skipping


A model of collaborating agents for content-based electronic document filtering The huge volume of distributed information that is nowadays available in electronic multimedia documents forces a lot of people to consume a significant percentage of their time looking for documents that contain information useful to them. The filtering of electronic documents seems hard to automate, partly because of document heterogeneity, but mainly because it is difficult to train computers to have an understanding of the contents of these documents and make decisions based on user-subjective criteria. In this paper, we suggest a model for the automation of content-based electronic document filtering, supporting multimedia documents in a wide variety of forms. The model is based on multi-agent technology and utilizes an adaptive knowledge base organized as a set of logical rules. Implementations of the model using the client-server architecture should be able to efficiently access documents distributed over an intranet or the Internet.

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

content-based filtering
office automation
multi-agent model
intelligent software agents


Maximizing the spread of influence ranking in social networks Information flows in a network where individuals influence each other. In this paper, we study the influence maximization problem of finding a small subset of nodes in a social network that could maximize the spread of influence. We propose a novel information diffusion model CTMC-ICM CTMC - ICM , which introduces the theory of Continuous-Time Markov Chain (CTMC) into the Independent Cascade Model (ICM). Furthermore, we propose a new ranking metric named SpreadRank generalized by the new information propagation model CTMC-ICM. We experimentally demonstrate the new ranking method that can, in general, extract nontrivial nodes as an influential node set that maximizes the spread of information in a social network and is more efficient than a distance-based centrality.

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

social network
influence maximization
information propagation


MRL and SuperFine+MRL: new supertree methods Supertree methods combine trees on subsets of the full taxon set together to produce a tree on the entire set of taxa. Of the many supertree methods, the most popular is MRP (Matrix Representation with Parsimony), a method that operates by first encoding the input set of source trees by a large matrix (the "MRP matrix") over {0,1, ?}, and then running maximum parsimony heuristics on the MRP matrix. Experimental studies evaluating MRP in comparison to other supertree methods have established that for large datasets, MRP generally produces trees of equal or greater accuracy than other methods, and can run on larger datasets. A recent development in supertree methods is SuperFine+MRP, a method that combines MRP with a divide-and-conquer approach, and produces more accurate trees in less time than MRP. In this paper we consider a new approach for supertree estimation, called MRL (Matrix Representation with Likelihood). MRL begins with the same MRP matrix, but then analyzes the MRP matrix using heuristics (such as RAxML) for 2-state Maximum Likelihood.

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


predicting and bypassing end-to-end internet service degradations We study the patterns and predictability of Internet End-to-End service degradations , where a degradation is a significant deviation of the round trip time between a client and a server. We use simultaneous RTT measurements collected from several locations to a large representative set of Web sites and study the duration and extent of degradations. We combine these measurements with BGP cluster information to learn on the location of the cause.We evaluate a number of predictors based upon Hidden Markov Models and Markov Models. Predictors typically exhibit a tradeoff between two types of errors, false positives (incorrect degradation prediction) and false negatives (a degradation is not predicted). The costs of these error-types is application dependent, but we capture the entire spectrum using a precision versus recall tradeoff. Using this methodology, we learn what information is most valuable for prediction (recency versus quantity of past measurements). Surprisingly, we also conclude that predictors that utilize history in a very simple way perform as well as more sophisticated ones.One important application of prediction is gateway selection , which is applicable when a LAN is connected through multiple gateways to one or several ISP's. Gateway selection can boost reliability and survivability by selecting for each connection the (hopefully) best gateway. We show that gateway selection using our predictors can reduce the degradations to half of that obtained by routing all the connections through the best gateway.

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

survivability use methodology reliability types routing internet connection errors server cluster

select
precise
measurement
dependencies
applications
histories
locatability
boosting
web site
timing
learning
model
informal
hidden markov model
evaluation
predict
false positive
pattern


Linear semi-supervised projection clustering by transferred centroid regularization We propose a novel method, called Semi-supervised Projection Clustering in Transfer Learning (SPCTL), where multiple source domains and one target domain are assumed. Traditional semi-supervised projection clustering methods hold the assumption that the data and pairwise constraints are all drawn from the same domain. However, many related data sets with different distributions are available in real applications. The traditional methods thus can not be directly extended to such a scenario. One major challenging issue is how to exploit constraint knowledge from multiple source domains and transfer it to the target domain where all the data are unlabeled. To handle this difficulty, we are motivated to construct a common subspace where the difference in distributions among domains can be reduced. We also invent a transferred centroid regularization, which acts as a bridge to transfer the constraint knowledge to the target domain, to formulate this geometric structure formed by the centroids from different domains. Extensive experiments on both synthetic and benchmark data sets show the effectiveness of our method.

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

transferred centroid regularization
transfer learning

semi-supervised projection clustering
domain adaptation
pairwise constraint


hardware support for interprocess communication In recent years there has been increasing interest in message-based operating systems, particularly in distributed environments. Such systems consist of a small message-passing kernel supporting a collection of system server processes that provide such services as resource management, file service, and global communications. For such an architecture to be practical, it is essential that basic messages be fast, since they often replace what would be a simple procedure call or kernel call in a more traditional system. Careful study of several operating systems shows that the limiting factor, especially for small messages, is typically not network bandwidth but processing overhead. Therefore, we propose using a special-purpose coprocessor to support message passing. Our research has two parts: First, we partitioned an actual message-based operating system into communication and computation parts interacting through shared queues and measured its performance on a multiprocessor. Second, we designed hardware support in the form of a special-purpose smart bus and smart shared memory and demonstrated the benefits of these components through analytical modeling using Generalized Timed Petri Nets . Our analysis shows good agreement with the experimental results and indicates that substantial benefits may be obtained from both the partitioning of the software and the addition of a small amount of special-purpose hardware.

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

communication
network
analysis
performance
service
practical
software
research
systems
environments
factor
message
architecture
operating system
bandwidth
support
hardware
distributed
resource management
multiprocessor
global

analytic models
collect
queue
component
sharing
partition
experimentation
process
message-passing


A novel Volt-VAR Optimization engine for smart distribution networks utilizing Vehicle to Grid dispatch A novel Volt-VAR Optimization (VVO) engine proposed using Vehicle to Grid dispatch. Quasi Real-time Advanced Metering Infrastructure data applied as VVO inputs. Impacts of Electric Vehicles on Smart Grid-based VVO engine fully studied. How a typical VVO engine could benefit from V2Gs reactive power support demonstrated. To test the accuracy of proposed VVO, IEEE-123 feeder employed in presence of various EV and load types.

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

distribution network
electric vehicle
smart grid
volt-var optimization
power loss


On plateaued functions The focus of this correspondence is on nonlinear characteristics of cryptographic Boolean functions. First, we introduce the notion of plateaued Functions that have many cryptographically desirable properties. Second, we establish a sequence of strengthened inequalities on some of the most important nonlinearity criteria, including nonlinearity, avalanche, and correlation immunity, and prove that critical cases of the inequalities coincide with characterizations of plateaued functions. We then proceed to prove that plateaued functions include as a proper subset all partially bent functions that were introduced earlier by Claude Carlet, This solves an interesting problem that arises naturally from previously known results on partially bent functions. In addition, we construct plateaued, but not partially bent, functions that have many properties useful in cryptography.

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

bent functions
cryptography
nonlinear characteristics
plateaued functions


Dynamic Load Balancing for Real-Time Video Encoding on Heterogeneous CPU plus GPU Systems The high computational demands and overall encoding complexity make the processing of high definition video sequences hard to be achieved in real-time. In this manuscript, we target an efficient parallelization and RD performance analysis of H.264/AVC inter-loop modules and their collaborative execution in hybrid multi-core CPU and multi-GPU systems. The proposed dynamic load balancing algorithm allows efficient and concurrent video encoding across several heterogeneous devices by relying on realistic run-time performance modeling and module-device execution affinities when distributing the computations. Due to an online adjustment of load balancing decisions, this approach is also self-adaptable to different execution scenarios. Experimental results show the proposed algorithm's ability to achieve real-time encoding for different resolutions of high-definition sequences in various heterogeneous platforms. Speed-up values of up to 2.6 were obtained when compared to the video inter-loop encoding on a single GPU device, and up to 8.5 when compared to a highly optimized multi-core CPU execution. Moreover, the proposed algorithm also provides an automatic tuning of the encoding parameters, in order to meet strict encoding constraints.

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

video coding
gpgpu
hybrid cpu plus gpu system


Kei-Tying teens: Using mobile phone e-mail to bond, bridge, and break with social tiesa study of Japanese adolescents This paper examines the extent to which Japanese adolescents use mobile phone e-mail to bond, bridge, and break with their social ties. Although existing literature shows that adolescents use mobile phone e-mail to bond with intimate strong ties, the fluid nature of social networks during adolescence suggests that mobile phone e-mail may also be used to bridge to new ties and to break with old ties. Drawing on a stratified random sample survey of 501 high school students living in Tokyo, we find that mobile phone e-mail is used both to bond and bridge, but not to break with ties. We also find that the intensity with which Japanese adolescents use mobile phone e-mail is more fundamentally a result of bridging than bonding. These findings apply both to typical users and heavy users.

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

mobile phone
adolescence
social ties
bonding
bridging


The Organization of On-Chip Data Memory in One Coarse-Grained Reconfigurable Architecture RCP (Reconfigurable Computing Processor) is intended to fill the gap between ASIC and GPP (General Purpose processor), which achieves much higher energy efficiency than GPP, while is much more flexible than ASIC. In this paper, one organization of on-chip data memory called LIBODM (Lifetime Based On-chip Data Memory) is proposed to reduce the reference delay for data and on-chip data memory size in RCP. In the LIBODM, the allocation of data is based on the data dependency. The data with low data dependency are stored off-chip to save the storage costs, while the data with high data dependency are stored on-chip to reduce the reference delay. Besides, in the LIBODM, the on-chip data are classified into two types, and the classification is based on the lifetime of data. For short lifetime data, they are preferred to be stored into FIFO to increase the reuse ratio of memory space naturally. For long lifetime data, they are preferred to be stored into RAM for several time references. The LIBODM has been testified in one CGRA (Coarse Grained Reconfigurable Architecture) called RPU (Reconfigurable Processing Unit), and two RPUs has been integrated in a RCP-REMUS_HP (High Performance version of Reconfigurable MUlti-media System) focused on video decoding. Thanks to the LIBODM, although the size of on-chip data memory in REMUS_HP is small, a high performance can still be achieved. Compared with XPP and ADRES, in REMUS_HP, the on-chip data memory size at same performance level is only 23.9% and 14.8%. REMUS_HP is implemented on a 48.9 mm(2) silicon with TSMC 65nm technology. Simulation shows that 1920* 1088 @30 fps can be achieved for H.264 high-profile decoding when exploiting a 200 MHz working frequency. Compared with the high performance version of XPP, the performance is 150% boosted, while the energy efficiency is 17.59x boosted.

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

dynamic reconfigurable
on-chip data memory
fast reference
low storage costs


Proving isometry for homogeneous Einstein metrics on flag manifolds by symbolic computation The question whether two Riemannian metrics on a certain manifold are isometric is a fundamental and also a challenging problem in differential geometry. In this paper we ask whether two non-Khler homogeneous Einstein metrics on a certain flag manifold are isometric. We tackle this question by reformulating it into a related question on a parametric system of polynomial equations and answering it by carefully combining Grbner bases and geometrical arguments. Using this technique, we are able to prove the isometry of such metrics.

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

homogeneous manifold
einstein metric
generalized flag manifold
algebraic system of equations
grbner basis
lexicographic order


mechanisms for compile-time enforcement of security This paper discusses features of a secure systems programming language designed and implemented at IBM's Watson Research Lab. Two features of the language design were instrumental in permitting security to be enforced with minimum run-time cost: (1) Language constructs (e.g. pointer variables) which could result in aliasing were removed from the programmer's direct control and replaced by higher level primitive types; and (2) traditional strong type checking was enhanced with typestate checking, a new mechanism in which the compiler guarantees that for all execution paths, the sequence of operations on each variable obeys a finite state grammar associated with that variable's type. Examples are given to illustrate the application of these mechanisms.

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

research
typestate
examples
language design
language
direct
secure
paper
sequence
control
cost
grammar
aliasing
systems programming

variability applications association operability compilation timing instrument feature pointers programmer


Ultrastability of nth minimal errors We use the ultraproduct technique to study local properties of basic quantities of information-based complexity theory - the nth minimal errors. We consider linear and nonlinear operators in normed spaces; information consists of continuous linear functionals and is assumed to be adaptive. We establish ultrastability and disprove regularity of nth minimal errors. As a consequence, we answer a question posed by Hinrichs et al. in a recent paper [A. Hinrichs, E. Novak, H. Wozniakowski, Discontinuous information in the worst case and randomized settings, Math. Nachr. http://dx.doi:10.1002/mana.201100128]. (c) 2012 Elsevier Inc. All rights reserved.

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

information-based complexity
nth minimal error
banach space
s-number


Hair removal methods: A comparative study for dermoscopy images Removal and restoration of hair and hair-like regions within skin lesion images is needed so features within lesions can be more effectively analyzed for benign lesions, cancerous lesions, and for cancer discrimination. This paper refers to melanoma texture as a rationale for supporting the need for the proposed hair detection and repair techniques, which incompletely represents why hair removal is an important operation for skin lesion analysis. A comparative study of the state-of-the-art hair-repaired methods with a novel algorithm is also proposed by morphological and fast marching schemes. The hair-repaired techniques are evaluated in terms of computational, performance and tumor-disturb patterns (TDP) aspects. The comparisons have been done among (i) linear interpolation, inpainting by (ii) non-linear partial differential equation (PDE) and (iii) exemplar-based repairing techniques. The performance analysis of hair detection quality, was based on the evaluation of the hair detection error (HDE), quantified by statistical metrics and manually used to determine the hair lines from a dermatologist as the ground truth. The results are presented on a set of 100 dermoscopic images. For the two characteristics measured in the experiments the best method is the fast marching hair removal algorithm (HDE: 2.98%, TDP: 4.21%). This proposed algorithm repaired the texture of the melanoma, which becomes consistent with human vision. The comparisons results obtained, indicate that hair-repairing algorithm based on the fast marching method achieve an accurate result.

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

dermoscopy
melanoma
linear interpolation
pde
fast marching

skin cancer
hair segmentation
image inpainting


Subdifferential representations of risk measures Measures of risk appear in two categories: Risk capital measures serve to determine the necessary amount of risk capital in order to avoid ruin if the outcomes of an economic activity are uncertain and their negative values may be interpreted as acceptability measures (safety measures). Pure risk measures (risk deviation measures) are natural generalizations of the standard deviation. While pure risk measures are typically convex, acceptability measures are typically concave. In both cases, the convexity (concavity) implies under mild conditions the existence of subgradients (supergradients). The present paper investigates the relation between the subgradient (supergradient) representation and the properties of the corresponding risk measures. In particular, we show how monotonicity properties are reflected by the subgradient representation. Once the subgradient (supergradient) representation has been established, it is extremely easy to derive these monotonicity properties. We give a list of Examples.

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


High-throughput DNA methylation datasets for evaluating false discovery rate methodologies When analyzing high-throughput genomic data, the multiple comparison problem is most often addressed through estimation of the false discovery rate (FDR), using methods such as the Benjamini & Hochberg, Benjamini & Yekutieli, the q-value method, or in controlling the family-wise error rate (FWER) using Holms step down method. To date, research studies that have compared various FDR/FWER methodologies have made use of limited simulation studies and/or have applied the methods to one or more microarray gene expression dataset(s). However, for microarray datasets the veracity of each null hypothesis tested is unknown so that an objective evaluation of performance cannot be rendered for application data. Due to the role of methylation in X-chromosome inactivation, we postulate that high-throughput methylation datasets may provide an appropriate forum for assessing the performance of commonly used FDR methodologies. These datasets preserve the complex correlation structure between probes, offering an advantage over simulated datasets. Using several methylation datasets, commonly used FDR methods including the q-value, Benjamini & Hochberg, and Benjamini & Yekutieli procedures as well as Holms step down method were applied to identify CpG sites that are differentially methylated when comparing healthy males to healthy females. The methods were compared with respect to their ability to identify CpG sites located on sex chromosomes as significant, by reporting the sensitivity, specificity, and observed FDR. These datasets are useful for characterizing the performance of multiple comparison procedures, and may find further utility in other tasks such as comparing variable selection capabilities of classification methods and evaluating the performance of meta-analytic methods for microarray data.

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

false discovery rate
methylation
sensitivity
specificity

family wise error rate
multiple comparisons


A comparison of allocation policies in wavelength routing networks We consider wavelength routing networks with and without wavelength converters, and several wavelength allocation policies. Through numerical and simulation results we obtain upper and lower bounds on the blocking probabilities for two wavelength allocation policies that are most likely to be used in practice, namely, most-used and first-fit allocation. These bounds are the blocking probabilities obtained by the random wavelength allocation policy with either no converters or with converters at all nodes of the network. Furthermore, we demonstrate that using the most-used or first-fit policies gives an improvement on call blocking probabilities that is equivalent to employing converters at a number of nodes in a network with the random allocation policy. These results have been obtained for a wide range of loads for both single-path and general mesh topology networks. The main conclusion of our work is that the gains obtained by employing specialized and expensive hardware (namely, wavelength converters) can be realized cost-effectively by making more intelligent choices in software (namely, the wavelength allocation policy).

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

wavelength routing networks
wavelength allocation

wavelength division multiplexing
call blocking probability


An expert system for detecting automobile insurance fraud using social network analysis The article proposes an expert system for detection, and subsequent investigation, of groups of collaborating automobile insurance fraudsters. The system is described and examined in great detail, several technical difficulties in detecting fraud are also considered, for it to be applicable in practice. Opposed to many other approaches, the system uses networks for representation of data. Networks are the most natural representation of such a relational domain, allowing formulation and analysis of complex relations between entities. Fraudulent entities are found by employing a novel assessment algorithm, Iterative Assessment Algorithm (IAA), also presented in the article. Besides intrinsic attributes of entities, the algorithm explores also the relations between entities. The prototype was evaluated and rigorously analyzed on real world data. Results show that automobile insurance fraud can be efficiently detected with the proposed system and that appropriate data representation is vital. (C) 2010 Elsevier Ltd. All rights reserved.

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

automobile insurance
social network analysis

fraud detection
link analysis
assessment propagation


Tight bound for matching (vol 23, pg 322, 2012) The bound on the size of maximum matching given in the paper as follows: M >= {m/2 - m/2L, if k = 2 m/k - m/(k + L)k, if k > 2 is not accurate. We now correct the bound to M >= m/k - m/Lk, where M is the size of the maximum matching in any graph of degree k, m edges and length of the smallest odd size cycle L. When no simple odd-length cycle exists it is known previously that M >= m/k. We show that the new bound given here is tight.

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

combinatorial problems
graph algorithms
lower bound


PLEIADES: An Internet-based parallel/distributed system The use of LAN-based clusters of computers for computational purposes has been in use for several years with significant success and acceptability. The introduction of the Internet infrastructure as the interconnection medium of the cluster allows for additional flexibility and transparency of such systems. PLEIADES is an Internet-based parallel/distributed system whose purpose is to allow users to use distant computational resources in order to form virtual clusters. In addition, PLEIADES can be used as a computational infrastructure service provider for applications in need of computational resources. PLEIADES uses a tiered architecture with particular emphasis on the existence of a middle tier, whose task is to assist in the communication between the interface and the resource management tiers. The existence of the middle tier allows for the creation of an open system that is able to easily integrate with new resource management platforms and tools. Since the use of a mature resource management system for parallel/distributed computing was a prerequisite of the PLEIADES architecture, the Condor resource management environment was used. The design and implementation characteristics of PLEIADES together with some experimental uses of the system are also presented. Copyright (C) 2002 John Wiley Sons, Ltd.

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


FIRST-PRINCIPLES STUDY OF THE STRUCTURAL, ELECTRONIC AND OPTICAL PROPERTIES OF MgSiO3 AT HIGH PRESSURE The high-pressure behavior of perovskite (MgSiO3) is studied based on density functional simulations within generalized gradient approximation (GGA). All calculations are performed by using the linear augmented plane waves plus local orbital (LAPW+lo) method to solve the scalar-relativistic Kohn-Sham equations. The static calculations predict a perovskite (pnma phase) - post-perovskite (Cmcm phase) transition occurring at 86 gigapascals (GPa). The similar bulk modulus values, differing only 3 GPa, are given by using three kinds of equation of states. The electronic structure and optical properties of MgSiO3 at phase transition pressure are also 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O B I I O O O

equation of states
phase transition pressure


Competition and evolution of linear and two-part tariff ? The duopoly competition model presented in this paper tries to explain why a two-part tariff exists in the telecommunication industry. The investigation of competition and evolution between linear and two-part tariffs shows how the growth of the market and the sequence of action may affect equilibrium. The two pricing patterns are assumed to be virtual participants to constitute a tariff competition and evolution model, and by calculation, we can obtain metaphase equilibrium and evolution equilibrium. The conclusion shows that optimized Pareto equilibrium should be carried out by combining linear pricing and buffet pricing, this case being presented as a three-part tariff when many sub-markets coexist.

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


Biased p-norm support vector machine for PU learning We propose a new version of support vector machine named biased p-norm support vector machine (BPSVM). BPSVM can realize classification and feature selection simultaneously for PU learning problem. To realize feature selection, we prove the lower bounds of the optimal solution of BPSVM theoretically. The lower bounds can be used to identify which element should be eliminated. We test our BPSVM on text classification data set and phosphoralytion sites prediction sites and the numerical results show the effectiveness of our methods.

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

support vector machine
feature selection


In-chair movement: validity, reliability and implications for measuring sitting discomfort Sitting discomfort is traditionally evaluated with subjective rating scales which are referenced to an objective correlate (e.g. sitting posture) measured on a static (i.e. non-continuous) basis. Since sitting discomfort is dynamic in nature, it requires continuous, objective measurement. We therefore adapted an interface pressure mat to continuously record in-chair movement (ICM) as an indirect measurement of sitting discomfort by tracking the center of pressure (COP) at the buttockchair interface. Here we report on two phases in the development of the COP system: laboratory validity and field reliability. In the laboratory study we confirmed system validity by simultaneously tracking ICM with the mat and a force platform (r2>0.80) and by comparing subjects COP movement with their gross trunk movements (r2>0.86). In our field study we used the intraclass correlation coefficient to establish a data sampling (i.e. selection) protocol that was reliable. We collected ICM data on seated telecommunications Directory Assistance operators during 2h field tests. Results showed that using a minimum sampling time of 5min and then averaging a series of 5min samples of ICM was more reliable than single discrete samples. Using the averaging protocol, we also showed that ICM increased significantly over 2h and that ICM did not differ between trials.

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

sitting discomfort
sampling
reliability
telecommunications

interface pressure mapping
in-chair movement


Implementations of mesh refinement schemes for Particle-In-Cell plasma simulations Plasma simulations are often rendered challenging by the disparity of scales in time and in space which must be resolved. When these disparities are in distinctive zones of the simulation region, a method which has proven to be effective in other areas (e.g., fluid dynamics simulations) is the mesh refinement technique. We briefly discuss the challenges posed by coupling this technique with plasma Particle-In-Cell simulations and present two implementations in more detail, with examples. (C) 2004 Elsevier B.V. All rights reserved.

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


Spatial modelling for binary data using a hidden conditional autoregressive Gaussian process: a multivariate extension of the probit model A Bayesian approach to modelling binary data on a regular lattice is introduced. The method uses a hierarchical model where the observed data is the sign of a hidden conditional autoregressive Gaussian process. This approach essentially extends the familiar probit model to dependent data. Markov chain Monte Carlo simulations are used on real and simulated data to estimate the posterior distribution of the spatial dependency parameters and the method is shown to work well. The method can be straightforwardly extended to regression models.

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

binary data
markov chain monte carlo
probit model
spatial dependency


Energy expenditure at work in physical education teachers Energy expenditure (EE) was measured in physical educators during 2 workdays. Physical education teachers showed a high level of fitness level. Average EE was low-to-moderate (kcalmin?1) and low in relative values (% VO2max). However, physical educators reached very high work intensities for significant periods. Physical educators should be prepared to perform tasks with different levels of EE.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 state changing applied to multi-robot systems The target searching problem is a situation where a formation of multi-robot systems is set to search for a target and converge towards it when it is found. This problem lies in the fact that the target is initially absent and the formation must search for it in the environment. During the target search, false targets may appear dragging the formation towards it. Therefore, in order to avoid the formation following a false target, this paper presents a new methodology using the TakagiSugeno type fuzzy automaton (TS-TFA) in the area of formation control to solve the target searching problem. The TS fuzzy system is used to change the formation through the modifications in the states of the automaton. This change does not only switch the rules and therefore the state of each robot, but also the controllers and cost functions. This approach amplifies the versatility of the formation of mobile robots in the target searching problem. In this paper, the TS-TFA is presented and its implications in the formation are explained. Simulations and results with real robot are presented where it can be noticed that the formation is broken to maximize the perception range based on each robots observation of a possible target. Finally this work is concluded in the last section.

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


cultural intelligence as a strategic ressource in multicultural teams ABSTRACT In this poster proposal we present the three-year project "Cultural intelligence as a strategic resource" that started on April first 2008. In collaboration with Danish Multinationals (MNCs) we investigate how to strengthen Danish executives' and employees' cultural encounters in China, India, Indonesia, Malaysia and Japan. In this poster proposal, we focus on the concept of cultural intelligence. We list a number of questions concerning its practical applications and discuss how this concept might help us unfold, in an empirical study, what makes collaboration and synergy work in diverse global organizations with multicultural teams (MCT).

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

multicultural teams
cultural intelligence

intercultural collaboration
virutal teams
company cases


Statistical estimation for hyper shrinkage A new shrinkage technique in wavelet domain called hyper shrinkage that uses hyperbolic function for improved denoising is explained. The methodology is statistically significant in terms of signal recovery and improving signal-to-noise ratio over both hard and soft shrinkage. A mathematical treatment of proposed shrinkage function shows an improvement over the existing shrinkage function in terms of variance and bias. A simulation of mathematical model shows effectiveness of the proposed shrinkage function.

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

mean estimation
variance estimation
wavelet transforms


A block-diagonal recurrent fuzzy neural network for system identification A recurrent fuzzy neural network with internal feedback is suggested in this paper. The network is entitled dynamic block-diagonal fuzzy neural network (DBD-FNN), and constitutes a generalized Takagi-Sugeno-Kang fuzzy system, where the consequent parts of the fuzzy rules are small Block-Diagonal Recurrent Neural Networks. The proposed model is applied to a benchmark identification problem, where a dynamic system is to be identified. Additionally, an application of the proposed model to the problem of the analysis of lung sounds is presented. Particularly, a filter based on the DBD-FNN is developed, trained with the RENNCOM method. Extensive experimental and simulation results are given and performance comparisons with a series of other models are conducted, highlighting the modeling characteristics of DBD-FNN as an identification tool and the effectiveness of the proposed separation filter.

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

block-diagonal recurrent fuzzy-neural network


Existence results for vector equilibrium problems given by a sum of two functions We obtain existence results for the weak vector equilibrium problem where the function involved is a sum of two functions, and the assumptions are required separately on each of these functions. We show that some earlier results of this type contain too demanding assumptions. We relax several of these assumption without loosing the results. The special case of reflexive Banach spaces is also studied, where we make use of the fact that closed balls are weakly compact.

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

\(k\)-uppersemicontinuousfunction
essentiallyquasimonotonebifunction
\(k\)-convex bifunction
coercivity condition
kkm-mapping


priority-progress streaming for quality-adaptive multimedia The Internet's ubiquity amply motivates us to harness it for video distribution, however, its best-effort service model is in direct conflict with video's inherent timeliness requirements. Today, the Internet is unrivaled in its rich composition, consisting of an unparalleled assortment of networks and hosts. This richness is the result of an architecture that emphasizes interoperability over predictable performance. From the lowest levels, the Internet architecture prefers the best effort service model. We feel current solutions for media-streaming have yet to adequately address this conflict between timeliness and best-effort service.We propose that streaming-media solutions targetted at the Internet must fully embrace the notion of graceful degradation, they must be architected with the expectation that they operate within a continuum of service levels, adjusting quality-resource trade-offs as necessary to achieve timeliness requirements. In the context of the Internet, the continuum of service levels spans across a number oftime scales, ranging from sub-second timescales to timescales as long as months and years. We say sub-second timescales in relation to short-term dynamics such as network traffic and host workloads, while timescales of months and years relate to the continuous deployment of improving network, compute and storage infrastructure.We support our thesis with a proposal for a streaming model which we claim is simple enough to use end-to-end, yet expressive enough to tame the conflict between real-time and best-effort personalities of Internet streaming. The model is called Priority-Progress streaming. In this proposal, we will describe the main features of Priority-Progress streaming, which we have been implemented in a software-based streaming video system, called the Quasar pipeline.Our work is primarily concerned with the class of streaming applications. To prevent confusion, we now clarify the important distinction between streaming and other forms of distribution, namely download. For a video, we assume download is defined so that the transfer of the video must complete before the video is viewed. Transfer and viewing are temporally sequential. With this definition, it is a simple matter to employ Quality-adaptive video. One algorithm would be to deliver the entire video in the order from low to high quality components. The user may terminate the download early, and the incomplete video will automatically have as high quality as was possible. Thus, Quality-adaptive download can be implemented in an entirely best-effort, time-insensitive, fashion. On the other hand, we assume streaming means that the user views the video at the same time that the transfer occurs. Transfer and viewing are concurrent. There are timeliness requirements inherent in this definition, which can only be reconciled with best-effort delivery through a time-sensitive adaptive approach.

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

network requirements applications quality use conflict performance context direct user multimedia deployment support relation algorithm interoperability class order video definition model traffic views architecture storage internet

sensitive
media
streamed media
streams
express
pipeline
addressing
timing
infrastructure
real-time
predict
adapt
dynamic
resource
computation
compositing
component
software
systems
concurrency
distributed
feature
continuation
internet architecture
priorities
completeness


Propagating error in land-cover-change analyses: impact of temporal dependence under increased thematic complexity We examined the impact of temporal dependence between patterns of error in classified time-series imagery through a simulation modeling approach. This research extended the land-cover-change simulation model we previously developed to investigate: (1) the assumption of temporal independence between patterns of error in classified time-series imagery; and (2) the interaction of patterns of change and patterns of error in a post-classification change analysis. In this research, the thematic complexity of the classified land-cover maps was increased by increasing the number of simulated land-cover classes. Simulating maps with increased categorical resolution permitted the incorporation of: (1) higher-order, more complex spatial and temporal interactions between land-cover classes; and (2) patterns of error that better reproduce the complex error interactions that often occur in time-series classified imagery. The overall modeling framework was divided into two primary components: (1) generation of a map representing true change; and (2) generation of a suite of change maps that had been perturbed by specific patterns of error. All component maps in the model were produced using simulated annealing, which enabled us to create a series of map realizations with user-defined spatial and temporal patterns. Comparing the true map of change to the error-perturbed maps of change using accuracy assessment statistics showed that increasing the temporal dependence between classification errors did not improve the accuracy of resulting maps of change when the categorical scale of the land-cover classified maps was increased. The increased structural complexity within the time series of maps effectively inhibited the impact of temporal dependence. However, results demonstrated that there are interactions between patterns of error and patterns of change in a post-classification change analysis. These interactions played a major role in determining the accuracy associated with the maps of change.

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

geostatistics
land-use and land-cover change
uncertainty


Data mining source code for locating software bugs: A case study in telecommunication industry In a large software system knowing which files are most likely to be fault-prone is valuable information for project managers. They can use such information in prioritizing software testing and allocating resources accordingly. However, our experience shows that it is difficult to collect and analyze fine-grained test defects in a large and complex software system. On the other hand, previous research has shown that companies can safely use cross-company data with nearest neighbor sampling to predict their defects in case they are unable to collect local data. In this study we analyzed 25 projects of a large telecommunication system. To predict defect proneness of modules we trained models on publicly available Nasa MDP data. In our experiments we used static call graph based ranking (CGBR) as well as nearest neighbor sampling for constructing method level defect predictors. Our results suggest that, for the analyzed projects, at least 70% of the defects can be detected by inspecting only (i) 6% of the code using a Nave Bayes model, (ii) 3% of the code using CGBR framework.

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

software testing
software bugs
case study


Site-Based Partitioning and Repartitioning Techniques for Parallel PageRank Computation The PageRank algorithm is an important component in effective web search. At the core of this algorithm are repeated sparse matrix-vector multiplications where the involved web matrices grow in parallel with the growth of the web and are stored in a distributed manner due to space limitations. Hence, the PageRank computation, which is frequently repeated, must be performed in parallel with high-efficiency and low-preprocessing overhead while considering the initial distributed nature of the web matrices. Our contributions in this work are twofold. We first investigate the application of state-of-the-art sparse matrix partitioning models in order to attain high efficiency in parallel PageRank computations with a particular focus on reducing the preprocessing overhead they introduce. For this purpose, we evaluate two different compression schemes on the web matrix using the site information inherently available in links. Second, we consider the more realistic scenario of starting with an initially distributed data and extend our algorithms to cover the repartitioning of such data for efficient PageRank computation. We report performance results using our parallelization of a state-of-the-art PageRank algorithm on two different PC clusters with 40 and 64 processors. Experiments show that the proposed techniques achieve considerably high speedups while incurring a preprocessing overhead of several iterations (for some instances even less than a single iteration) of the underlying sequential PageRank algorithm.

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

pagerank
web search
parallelization
sparse matrix partitioning
repartitioning

sparse matrix-vector multiplication
graph partitioning
hypergraph partitioning


The effect of capital lockup and customer trade credits on the optimal lot sizea confirmation of the EPQ The classical economic production quantity (EPQ) formula, which is obtained by balancing set-up and carrying costs, is reconsidered in this paper. Since the cost of capital tied up in stocked items is the most important part of the carrying costs, a refined approach considering different components of the capital lockup, i.e. direct labour, material, and set-up costs, is presented. Furthermore, in addition to the intensively discussed supplier trade credit, the hitherto neglected customer trade credit is introduced into the analysis. A comparison of the resulting lot-size formula and the classical one indicates that the ongoing discussion about financial refinements of the EPQ might end up at its starting point given by Harris (Oper. Res. 38 (1990) 94750), as the classical formula can be transformed into the new one by choosing the crucial carrying cost parameter adequately. Consequently, several alternative approximations for the carrying cost parameter in the EPQ are evaluated. Typically, lot-size planning takes into consideration only data from the production sector. In doing this, the interdependencies between the production and the financial sector of a firm are neglected. Consequently, a recently emerging discussion intends to overcome the separation of these two firm sectors. We extend the approaches presented up to the present date by modelling capital lockup in a more detailed way considering both the supplier and the customer trade credit as well as the time structure of the capital lockup.

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

economic production quantity (epq)
costs per lot


An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid In this paper we characterize the class of plane graphs that can be embedded on the two-dimensional grid with at most one bend on each edge. In addition, we provide an algorithm that either detects a forbidden configuration or generates an embedding with at most one bend on each edge.

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

planar embedding
graph algorithm
vlsi design


A novel feature selection algorithm based on LVQ hypothesis margin Feature selection has been widely discussed as an important preprocessing step in machine learning and data mining. In this paper, a new feature selection evaluation criterion based on low-loss learning vector quantization (LVQ) classification is proposed. Based on the evaluation criterion, a feature selection algorithm that optimizes the hypothesis margin of LVQ classification through minimizing its loss function is presented. Some experiments that are compared with well-known SVM-RFE and Relief are carried out on 4 UCI data sets using Naive Bayes and RBF Network classifier. Experimental results show that new algorithm achieves similar or even higher performance than Relief on all training data and has better or comparable performance than SVM-RFE.

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

pattern recognition
learning vector quantization (lvq)


A method of generating tests with linearity property for gate delay faults in combinational circuits A. Chatterjee et al. proposed tests with linearity property for gate delay faults to determine, at a required clock speed, whether a circuit under test is a marginal chip or not [1]. The latest transition time at the primary output is changed linearly with the size of the gate delay Fault when the proposed test is applied to the circuit under test. To authors' knowledge, no reports on an algorithmic method for generating tests with linearity property have been presented before. In this paper, we propose a method for generating tests with linearity property for gate delay faults. The proposed method introduces a new extended timed calculus to calculate the size of a given gate delay fault that can be propagated to the primary output. The method has been applied to ISCAS benchmark circuits under the unit delay model.

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

combinational circuits
marginal chip
gate delay fault

test generation
test with linearlity property


A modified Chebyshev pseudospectral DD algorithm for the GBH equation In this paper, a Chebyshev spectral collocation domain decomposition (DD) semi-discretization by using a grid mapping, derived by Kosloff and Tal-Ezer in space is applied to the numerical solution of the generalized BurgersHuxley (GBH) equation. To reduce roundoff error in computing derivatives we use the above mentioned grid mapping. In this work, we compose the Chebyshev spectral collocation domain decomposition and Kosloff and Tal-Ezer grid mapping, elaborately. Firstly, the theory of application of the Chebyshev spectral collocation method with grid mapping and DD on the GBH equation is presented. This method yields a system of ordinary differential algebraic equations (DAEs). Secondly, we use a fourth order RungeKutta formula for the numerical integration of the system of DAEs. Application of this modified method to the GBH equation show that this method (M-DD) is faster and more accurate than the standard Chebyshev spectral collocation DD (S-DD) method.

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

pseudospectral method
generalized burgershuxley equation


high throughput and large capacity pipelined dynamic search tree on fpga We propose a pipelined Dynamic Search Tree (pDST) on FPGA which offers high throughput for lookup, insert and delete operations as well as the capability to perform in-place incremental updates. Based on the pipelined 2-3 tree data structure, our pDST supports one lookup per clock cycle and maintains tree balance under continual insert and delete operations. A novel buffered update scheme together with a bi-directional linear pipeline allows the pDST to perform one insert or delete operation per O (log N ) cycles ( N being the tree capacity) without stalling the lookup operations. Nodes at each pipeline stage are allocated and freed by a free-node chaining mechanism which greatly simplifies the memory management circuit. Our prototype implementation of a 15-level, 32-bit key dual-port pDST requires 192 blocks of 36 Kb BRAMs (64\%) and 12.8k LUTs (6.3\%) on a Virtex 5 LX330 FPGA. The circuit has a maximum capacity of 96k 32-bit keys and clock rate of 135 MHz, supporting 242 million lookups and concurrently 3.97 million inserts or deletes per second.

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

dynamic update
openflow
in-place update
ip forwarding
pipelined tree
incremental update
b-tree
2-3 tree


INSTANCE MIGRATION BETWEEN ONTOLOGIES HAVING STRUCTURAL DIFFERENCES Ontology instance migration is one of the complex and not fully solved problems in knowledge management. A solution is required when the ontology schema evolves in the life cycle and the assertions have to be transferred to the newer version. The problem may become more complex in distributed settings when, for example, several autonomous software entities use and exchange partial assertional knowledge in a domain that is formalized by different though semantically overlapping descriptive theories. Such an exchange is essentially the migration of the assertional part of an ontology to other ontologies belonging to or used by different entities. The paper presents our method and tool for migrating instances between the ontologies that have structurally different but semantically overlapping schemas. The approach is based on the use of the manually coded transformation rules describing the changes between the input and the output ontologies. The tool is implemented as a plug-in for the Project Navigator prototype software framework. The article also reports the results of our three evaluation experiments. In these experiments we evaluated the degree of complexity in the structural changes to which our approach remains valid. We also chose the ontology sets in one of the experiments to make the results comparable with the ontology alignment software. Finally we checked how well our approach scales with the increase of the quantity of the migrated ontology instances to the numbers that are characteristic to industrial ontologies. In our opinion the evaluation results are satisfactory and suggest some directions for the future work.

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

structural difference
methodology
software tool


Phenomenology in computational models of consciousness In this paper we argue that phenomenology needs to be supported by explicit mechanisms if one is to have computational models of consciousness. Computational work in this area is reviewed and a set of axioms that help to decompose being conscious into manageable concepts is evoked. This leads to a kernel architecture and a digital implementation which is shown to work in examples of visual illusions that are revealing of how the brain supports phenomenology. This model is used to address the unstable phenomenology related to observation of the ambiguous Necker cube.

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

computational consciousness
brain modeling