Component registration diagnosis for printed circuit boards using process-oriented basis elements Modern product and process sensors are capable of making repeated measurements of similar characteristics at multiple locations on a part. Under such conditions, is possible to produce process diagnostic analyzing the multivariate process vector using a process-oriented basis (POB). Many potential production problems will have characteristic signatures that can be detected in the multivariate quality vector. Each pattern (signature) is associated with a basis element in the POB. The multivariate quality vector can be represented as a linear combination of these basis elements. Patterns with large coefficients in the representation suggest particular causes for process problems allowing manufacturing diagnostic information to be derived from the decomposition of the multivariate SPC data. The methodology is applied to the registration problem in fine pitch components for Printed Circuit Boards (PCB). Each PCB panel consists of 16 components, each of them with 8 measurements, resulting in a multivariate vector of 128 components. The suggested control procedure monitors through control charts the representation of each defined pattern to identify time periods in which such patterns are active. (C) 1997 Elsevier Science 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 O O O O O O O O O O O O O O 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

statistical process control (spc)
process diagnostics


Comparative study between incremental and ensemble learning on data streams: Case study With unlimited growth of real-world data size and increasing requirement of real-time processing, immediate processing of big stream data has become an urgent problem. In stream data, hidden patterns commonly evolve over time (i.e.,concept drift), where many dynamic learning strategies have been proposed, such as the incremental learning and ensemble learning. To the best of our knowledge, there is no work systematically compare these two methods. In this paper we conduct comparative study between theses two learning methods. We first introduce the concept of concept drift, and propose how to quantitatively measure it. Then, we recall the history of incremental learning and ensemble learning, introducing milestones of their developments. In experiments, we comprehensively compare and analyze their performances w.r.t. accuracy and time efficiency, under various concept drift scenarios. We conclude with several future possible research problems.

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

incremental learning
ensemble learning
concept drift


Interorganisational Information Systems: issues affecting interorganisational cooperation Advances in the use of interorganisational information systems (IOS) entail greater interdependence between, and deeper systems penetration into, organisations. The success of IOS will depend more on trust and cooperation between organisations, but these are problematic in interorganisational relations (IOR). Moreover, there are different types of IOR, and their varying characteristics are likely to have different effects on cooperation and IOS use between organisations. A framework for IOR analysis and a typology of IOR are combined to identify important differences between IOR and suggest implications for IOS. (C) 1997 Elsevier Science B.V.

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

interorganisational information systems (ios)


expected current distributions for cmos circuits The analysis of CMOS VLSI circuit switching current has become an increasingly important and difficult task from both a VLSI design and simulation software perspective. This paper presents a new static switching current estimation algorithm based on the idea of "Expected Current Distributions" (ECDs). Unlike previous "expected waveform" approaches, ECDs model not only the expected value of switching current waveforms over all time, but also the variances and covariances of all waveform segments as well. This extra information allows a switching current wave form to be modeled by a random process with both first and second order ensemble statistics. This specification provides the power spectral density of the switching current and allows the use of traditional frequency domain noise analysis to simulate the behavior of the switching current in the electrical supply network. An ECD simulation procedure is described and results are presented for the ISCAS85 combinational benchmark circuits. Estimated quantities include total average and RMS VDD current, the autocorrelation function of the total VDD current waveform and per-gate average and RMS VDD currents. The results show speedups of up to 100x and good agreement with respect to figures obtained using dynamic logic simulation and statistical mean estimation.

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

power spectral density
mean estimation
expected waveform
cmos
autocorrelation
switching current

static analysis
random processes
statistical analysis


Vibration of Timoshenko beams on three-parameter elastic foundation In the present paper, the process of the formulation of the equations of dynamic equilibrium and of the respective equations of natural vibration of Timoshenko beams on three-parameter elastic foundation within the framework of the second order theory is presented. The corresponding mass matrices are also formulated. In order to define the values of the parameters of the three-parameter model, an analytical method is applied. With the aid of two numerical examples, it is proved that the three-parameter model is capable of yielding natural period values that sufficiently approximate those derived by the solution using 2D finite element soil models.

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

beams on elastic foundation
three-parameter elastic foundation
eigenvalue analysis
vibrations
timoshenko beam
finite element method


Aeroelastic simulations using gridless boundary condition and small perturbation techniques This paper examines the use of stationary Cartesian mesh for non-linear flutter computations involving complex geometries. The surface boundary conditions are implemented using reflected points which are determined via a gridless approach. The method uses a cloud of nodes in the vicinity of the surface to get a weighted-average of the flow properties using radial basis functions. To ensure computational efficiency and for local grid refinements, multigrid computations within an embedded grids framework are used. As the displacements of moving surfaces from their original position are typically small for flutter problems, a small perturbation boundary condition method is used to account for the moving surfaces. The method therefore does not require repeated grid re-generation for the deforming surfaces. The overall method is both accurate and robust. Computations of the well-known Onera M6 wing, RAE wing-body configuration, the AGARD 445.6 wing flutter test case show good accuracy and efficiencies. Simulations of the aeroelastic behavior of a complete fighter-type aircraft with wing tip missiles at high transonic speeds further demonstrate the practical usefulness of the present boundary conditions technique. (C) 2010 Elsevier Ltd. All rights reserved.

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

aeroelastic
small perturbation
multigrid
gridless


Detection of Harmful Schizophrenic Statements in Esterel In imperative synchronous languages, a statement is called schizophrenic if it is executed more than once in a single clock. When a schizophrenic statement is translated into a circuit, the circuit can behave abnormally because of the multiple executions. To solve the problems caused by schizophrenic statements, compilers duplicate the statements to avoid multiple executions. Esterel is an imperative synchronous language. Schizophrenic statements in Esterel are considered to occur due to the instantaneous reentrance of local signal declarations or parallel statements. However, if the corresponding circuit of a schizophrenic statement behaves normally, it is harmless and thus curing is not necessary. In this paper, we identify the conditions under which a schizophrenic statement of the Esterel program must be cured during circuit translation. We also propose an algorithm to detect schizophrenic statements that have to be cured on the control flow graphs (CFGs) of source codes. Our algorithm detects all schizophrenic statements that have to be cured and results in fewer false alarms on the benchmark programs used in the previous work. It is simple and based on the CFG of a program, implying that it can be merged into existing compilers easily.

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

algorithms
verification
synchronous languages
static analysis


Design of Last-Level On-Chip Cache Using Spin-Torque Transfer RAM (STT RAM) Because of its high storage density with superior scalability, low integration cost and reasonably high access speed, spin-torque transfer random access memory (STT RAM) appears to have a promising potential to replace SRAM as last-level on-chip cache (e. g., L2 or L3 cache) for microprocessors. Due to unique operational characteristics of its storage device magnetic tunneling junction (MTJ), STT RAM is inherently subject to a write latency versus read latency tradeoff that is determined by the memory cell size. This paper first quantitatively studies how different memory cell sizing may impact the overall computing system performance, and shows that different computing workloads may have conflicting expectations on memory cell sizing. Leveraging MTJ device switching characteristics, we further propose an STT RAM architecture design method that can make STT RAM cache with relatively small memory cell size perform well over a wide spectrum of computing benchmarks. This has been well demonstrated using CACTI-based memory modeling and computing system performance simulations using SimpleScalar. Moreover, we show that this design method can also reduce STT RAM cache energy consumption by up to 30% over a variety of benchmarks.

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


Delay-constrained survivable multicast routing problem in WDM networks with shared segment-based protection For a delay-constrained multicast transmission request, the goal of delay-constrained survivable multicast routing problem is to provide the primary multicast tree and the tree protecting sparse resources. The shared segment-based protection (SSBP) method is used in this article to protect the delay-constrained multicast transmission. Two heuristic methods are proposed to find the delay-constrained primary tree and the backup segments with delay constraint. Experiments are conducted to evaluate the performance of the proposed methods, and the performance to be evaluated includes wavelength efficiency ratio (WER), blocking ratio (BR), and executing time. Simulations show that the SSBP method can get better BR and WER than the previous results demonstrated Din and Jiang (Comput Commun 35(10):11721184, 2012).

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

delay-constrained
survivability
shared segment based protection (ssbp)


Building a General Purpose Pedagogical Agent in a Web-Based Multimedia Clinical Simulation System for Medical Education In medical education, pedagogical agents are widely used by computer learning systems to simulate tutors and/or mimic tutoring interactions, as well as offering just-in-time and adaptive feedback. Although the theoretical aspect of the pedagogical agents has been well-documented in literature, relatively fewer efforts have been made on how a pedagogical agent should be implemented in a real multimedia computerized simulation learning environment. In this paper, we propose a general purpose pedagogical agent architecture and implement it in the multimedia medical simulation Web-based learning system called Health Information Network Teaching System (HINTS) to further facilitate students' learning and thereby make the HINTS a more helpful educational tool. Our focus is the design of the general purpose pedagogical architecture and its implementation in a multimedia computerized simulation learning environment. A preliminary students' performance evaluation result is also reported. We analyzed how to evaluate the students' performance and how the hints were given by the pedagogical agent. The system has been installed in the National Cheng Kung University Medical Center, Tainan, Taiwan for trial purposes. Some experiments have been conducted and the results have shown that the pedagogical agent indeed help the students in their learning process.

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

e-learning for medical education
computer-assisted learning
virtual peers
human-computer interaction
learning companions


optimal status sets of heterogeneous agent programs There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions that optimizes some objective function. In past work, Eiter et. al. have proposed a rule based framework for programming agents on top of heterogeneous data sources, but they provide no solutions to the above problem. In this paper, we propose a semantics called optimal feasible status set semantics for agents which allows the agent to associate an objective function with feasible status sets and act according to the feasible status set that optimizes this objective function. We provide both an algorithm to compute exact optimal feasible status sets as well as the TierOpt and FastOpt algorithms to find (suboptimal) feasible status set much faster. We report on experiments on a suite of real agent applications showing that the heuristic algorithms works well in practice.

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

heterogeneous agents
non-ground representations
heuristic search


A Computational-RAM (C-RAM) architecture for real-time mesh-based video motion tracking: Part 2: Motion compensation This paper presents a new Computational-RAM (C-RAM) architecture for real-time mesh-based video motion tracking. In Part 1, the motion estimation part of the proposed architecture is presented. Here in Part 2, a new C-RAM mesh-based motion compensation architecture is presented. The input data to the architecture is the mesh nodes motion vectors and the reference frame and the output data is the compensated (i.e., predicted) frame. The architecture uses the affine transformation for warping the deformed patches in the reference frame into the undeformed patches in the current frame. The architecture computes the affine parameters using a multiplication-free algorithm. The reference and current frames are stored in embedded S-RAMs generated with Virage (TM) Memory Compiler. The proposed motion compensation architecture has been prototyped, simulated and synthesized using the TSMC 0.18 mu m CMOS technology. Using 100 MHz clock frequency, the proposed architecture processes one CIF video frame (i.e., 352 x 288 pixels) in 0.59-ms, which means it can process up to 1694 frames per second. The core area of the proposed motion compensation architecture is 28.04 mm(2) and it consumes 31.15 mW.

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

computational ram
mesh-based architectures
video coding


bounds on scheduling with limited resources A number of authors (of. [12],[6], [7],[3],[11],[4],[5],[9]) have recently been concerned with scheduling problems associated with a certain model of an abstract multiprocessing system (to be described in the next section) and, in particular, with bounds on the worst-case behavior of this system as a function of the way in which the inputs are allowed to vary. In this paper, we introduce an additional element of realism into the model by postulating the existence of a set of resources with the property that at no time may the system use more than some predetermined amount of each resource. With this extra constraint taken into consideration, we derive a number of bounds on the behavior of this augmented system. It will be seen that this investigation leads to several interesting results in graph theory and analysis.

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

scheduling
use
analysis
behavior
graph theory
model
paper
constraint
resource

author systems abstraction association functional case timing


A novel XML document structure comparison framework based-on sub-tree commonalities and label semantics XML similarity evaluation has become a central issue in the database and information communities, its applications ranging over document clustering, version control, data integration and ranked retrieval. Various algorithms for comparing hierarchically structured data, XML documents in particular, have been proposed in the literature. Most of them make use of techniques for finding the edit distance between tree structures, XML documents being commonly modeled as Ordered Labeled Trees. Yet, a thorough investigation of current approaches led us to identify several similarity aspects, i.e., sub-tree related structural and semantic similarities, which are not sufficiently addressed while comparing XML documents. In this paper, we provide an integrated and fine-grained comparison framework to deal with both structural and semantic similarities in XML documents (detecting the occurrences and repetitions of structurally and semantically similar sub-trees), and to allow the end-user to adjust the comparison process according to her requirements. Our framework consists of four main modules for (i) discovering the structural commonalities between sub-trees, (ii) identifying sub-tree semantic resemblances, (iii) computing tree-based edit operations costs, and (iv) computing tree edit distance. Experimental results demonstrate higher comparison accuracy with respect to alternative methods, while timing experiments reflect the impact of semantic similarity on overall system performance.

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

xml (semi-structured) data
structural similarity
information retrieval
vector space model


A case study of the legitimation process undertaken to gain support for an information system in a Chinese university This research examines the legitimation process that was undertaken to gain stakeholder support for the development of a smartcard system for student services at a local university in China. We employed a theoretical framework consisting of Suchman's typology of legitimacy and the Legitimation Activity Model (LAM) for sense-making of the process. We obtained insights into how legitimation of the system was gained, maintained and repaired through the project team's strategic actions. We conceptualized the rotation of legitimation gaining, maintaining and repairing activities in the project and make suggestions for improving the LAM. We emphasize that monitoring and evaluating legitimation is a dynamic, continuous process, involving the concept of legitimation status, and linking the planned actions of legitimation-gaining and responsive actions for legitimation maintaining and repairing. We suggest that to achieve legitimation for information systems, managers should plan strategies to construct and present an appropriate image of the system, in which stakeholders perceive that it meets their needs, and, in addition, closely monitor the status of legitimation granted over a continuous period. This is because legitimation is a 'fragile flower' that may wilt if not attended to adequately. European Journal of Information Systems (2012) 21, 212-228. doi:10.1057/ejis.2011.27; published online 28 June 2011

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

legitimation
legitimacy
stakeholder support

information systems development
adoption
stakeholder acceptance
interpretivist qualitative case study


Simple algorithms for multimessage multicasting with forwarding We consider multimessage multicasting over the n processor complete (or fully connected) static network when the forwarding of messages is allowed. We present an efficient algorithm that constructs for every degree d problem instance a communication schedule with total communication time at most 2d, where d is the maximum number of messages that each processor may send (or receive). Our algorithm consists of two phases. In the first phase a set of communications are scheduled to be carried out in d time periods in such a way that the resulting problem is a multimessage unicasting problem of degree d. In the second phase we generate a communication schedule for this problem by reducing it to the Makespan Openshop Preemptive Scheduling problem which can be solved in polynomial time. The final schedule is the concatenation of the communication schedules for each of these two phases. For 2 less than or equal to l less than or equal to d, we present an algorithm to generate a communication schedule with total communication time at most [(2-1/l)d] + 1, for problem instances where each processor needs to send messages to at most ld destinations. We also discuss multimessage multicasting for dynamic networks.

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

multimessage multicasting
dynamic networks
communication schedules
forwarding

approximation algorithms
parallel iterative methods


A unified approach to simulation and upscaling of single-phase flow through vuggy carbonates Numerical modeling of flow through vuggy porous media, mainly vuggy carbonates, is a challenging endeavor. Firstly, because the presence of vugs can significantly alter the effective porosity and permeability of the medium. Secondly, because of the co-existence of porous and free flow regions within the medium and the uncertainties in defining the exact boundary between them. Traditionally, such heterogeneous systems are modeled by the coupled DarcyStokes equations. However, numerical modeling of flow through vuggy porous media using coupled DarcyStokes equations poses several numerical challenges particularly with respect to specification of correct interface condition between the porous and free-flow regions. Hence, an alternative method, a more unified approach for modeling flows through vuggy porous media, the StokesBrinkman model, is proposed here. It is a single equation model with variable coefficients, which can be used for both porous and free-flow regions. This also makes the requirement for interface condition redundant. Thus, there is an obvious benefit of using the StokesBrinkman equation, which can be reduced to Stokes or Darcy equation by the appropriate choice of parameters. At the same time, the StokesBrinkman equation provides a smooth transition between porous and free-flow region, thereby taking care of the associated uncertainties. A numerical treatment for upscaling StokesBrinkman model is presented as an approach to use StokesBrinkman model for multi-phase flow. Numerical upscaling methodology is validated by analyzing the error norm for numerical pressure convergence. StokesBrinkman single equation model is tested on a series of realistic data sets, and the results are compared with traditional coupled DarcyStokes model. Copyright (C) 2011 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

heterogeneity
carbonate
stokes-brinkman
stokes-darcy
numerical simulation
porous medium
vuggy porosity
darcy's law
upscaling and numerical convergence


Social Choice Theory in HOL This article presents formalizations in higher-order logic of two proofs of Arrow's impossibility theorem due to Geanakoplos. The Gibbard-Satterthwaite theorem is derived as a corollary. Lacunae found in the literature are discussed.

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

arrow's theorem
gibbard-satterthwaite theorem
higher-order logic
theorem proving


Modeling human mobility in obstacle-constrained ad hoc networks In this paper we present a mobility model for ad hoc networks consisting of human-operated nodes that are deployed in obstacle-constrained environments. According to this model, the network nodes move around the obstacles in a way that resembles how humans bypass physical obstructions. A recursive procedure is executed by each node at its current position to determine the next intermediate destination point until the final destination point is reached. The proposed mobility model is validated using real-life trace data and studied using both mathematical analysis and simulations. Furthermore, the model is extended to incorporate several operational aspects of ad hoc networks in mission critical scenarios, where it is best applicable. These extensions include hierarchical node organization, distinct modes of node activity, event-based destination selection and impact of the physical obstacles on signal propagation. The model is implemented as an add-on module in Network Simulator (ns-2).

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

ad hoc networks
mobility model
modeling
obstacles


Boolean functions with five controllable cryptographic properties The strict avalanche criterion (SAC) was introduced by Webster and Tavares [10] in a study of cryptographic design criteria. This is an indicator for local property. In order to improve the global analysis of cryptographically strong functions, Zhang and Zheng [ 11] introduced the global avalanche characteristics (GAC). The sum-of-squares indicator related to the GAC is defined as sigma(f) = Sigma(nu)Delta(f)(2)(nu), where Delta(f)(nu) = Sigma(x)(-1)(f(x)+ f(x + nu)). In this paper, we give a few methods to construct Boolean functions controlling five good cryptographic properties, namely balancedness, good local and GAC, high nonlinearity and high algebraic degree. We improve upon the results of Stanica [ 8] and Zhang and Zheng [11].

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

nonlinearity
boolean functions
strict avalanche criterion
global avalanche characteristics


Optimizing neuro-fuzzy modules for data fusion of vehicular navigation systems using temporal cross-validation The last two decades have shown an increasing trend in the use of positioning and navigation technologies in land vehicles. Most of the present navigation systems incorporate global positioning system (GPS) and inertial navigation system (INS), which are integrated using Kalman filtering (KF) to provide reliable positioning information. Due to several inadequacies related to KF-based INS/GPS integration, artificial intelligence (AI) methods have been recently suggested to replace KF. Various neural network and neuro-fuzzy methods for INS/GPS integration were introduced. However, these methods provided relatively poor positioning accuracy during long GPS outages. Moreover, the internal system parameters had to be tuned over time of the navigation mission to reach the desired positioning accuracy. In order to overcome these limitations, this study optimizes the AI-based INS/GPS integration schemes utilizing adaptive neuro-fuzzy inference system (ANFIS) by implementing, a temporal window-based cross-validation approach during the update procedure. The ANFIS-based system considers a non-overlap moving window instead of the commonly used sliding window approach. The proposed system is tested using differential GPS and navigational grade INS field test data obtained from a land vehicle experiment. The results showed that the proposed system is a reliable modeless system and platform independent module that requires no priori knowledge of the navigation equipment utilized. In addition, significant accuracy improvement was achieved during long GPS outages.

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


Application of Shearlet transform to classification of surface defects for metals ? We developed a method called DST-KLPP which is effective in classification of surface defects of different metals. DST-KLPP was tested with samples of three typical metals, including slabs, hot-rolled steels and aluminum sheets. DST-KLPP provides higher classification rates than other methods, including Wavelet, Curvelet and Contourlet transform. DST-KLPP can recognize defects from complex backgrounds efficiently. DST-KLPP can recognize tiny defects from low-contrast images availably.

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

surface inspection
feature extraction
multi-scale geometric analysis
kernel locality preserving projections


Demo: Runtime MAC Reconfiguration Using a Meta-compiler Assisted Toolchain A rapid reconfiguration of medium access scheme is required in order to achieve runtime performance optimization for dynamic spectrum access and fulfilling varying Quality of Service (QoS) demands. We have developed TRUMP, a toolchain which allows composing MAC solutions at runtime [1] [2]. In this demonstration, we will show how MAC reconfiguration can be achieved efficiently using TRUMP. Inspired by the optimum route calculation method used in car navigation systems, the compiler toolchain in TRUMP realizes an appropriate MAC solution at runtime. TRUMP allows expressing various types of constraints and options such as speed, energy consumption and packet delivery rate which leads to different MAC compositions. The live demonstration of MAC reconfiguration will be carried out on WARP SDR platform [3].

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

performance
mac
reconfiguration
sdr platform

design
experimentation
compiler assisted


BioUSeR: a semantic-based tool for retrieving Life Science web resources driven by text-rich user requirements Open metadata registries are a fundamental tool for researchers in the Life Sciences trying to locate resources. While most current registries assume that resources are annotated with well-structured metadata, evidence shows that most of the resource annotations simply consists of informal free text. This reality must be taken into account in order to develop effective techniques for resource discovery in Life Sciences.

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

resources discovery
semantic annotation
information retrieval


exploiting predicate structure for efficient reachability detection Partial order (p.o.) reduction techniques are a popular and effective approach for tackling state space explosion in the verification of concurrent systems. These techniques generate a reduced search space that could be exponentially smaller than the complete state space. Their major drawback is that the amount of reduction achieved is highly sensitive to the properties being verified. For the same program, different properties could result in very different amounts of reduction achieved.We present a new approach which combines the benefits of p.o. reduction with the added advantage that the size of the constructed state space is completely independent of the properties being verified. As in p.o. reduction, we use the notion of persistent sets to construct a representative interleaving for each maximal trace of the program. However, we retain concurrency information by assigning vector timestamps to the events in each interleaving. Our approach hinges upon the use of efficient algorithms that parse the encoded concurrency information in the representative interleaving to determine whether a safety violation exists in any interleaving of the corresponding trace. We show that, for some types of predicates, reachability detection can be performed in time that is polynomial in the length of the interleaving. Typically, these predicates exhibit certain characteristics that can be exploited by the detection algorithm.We implemented our algorithms in the popular model checker SPIN, and present experimental results that demonstrate the effectiveness of our techniques. For example, we verified a distributed dining philosophers protocol in 0.03 seconds, using 1.253 MB of memory. SPIN, using traditional p.o. reduction techniques, took 759.71 seconds and 439.116 MB of memory.

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


Feature sensitive deformation for triangular mesh models Shape deformation is a useful tool for shape modeling and animation in computer graphics. In this paper, we propose a novel surface deformation method based on a feature sensitive (FS) metric. Firstly, taking unit normal vectors into account, we derive a FS Laplacian operator, which is more sensitive to featured regions of mesh models than existing operators. Secondly, we use the 1-ring tetrahedron in the dual mesh, a volumetric structure, to encode geometric details. To preserve the shape of the tetrahedron, we introduce linear tetrahedron constraints minimizing both the distortion of the base triangle and the change of the corresponding height. These ensure that geometric details are accurately preserved during deformation. The time complexity of our new method is similar to that of existing linear Laplacian methods. Examples are included to show that our FS deformation method better preserves mesh details, especially features, than existing Laplacian methods. Copyright (C) 2010 John Wiley & Sons, Ltd.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 mining of user interaction logs for a post-deployment usability evaluation of a radiology PACS client Usability evaluation of a PACS based on pattern mining of user interaction log data. Comparison to a field study based usability evaluation of the same PACS. The pattern mining evaluation revealed four usability issues with the PACS. These issues were also found in the field study, which revealed 48 issues in total.

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

picture archiving and communication system


Feature analysis using line sweep thinning algorithm In this article, we propose a new thinning algorithm based on line sweep operation. A line sweep is a process where the plane figure is divided into parallel slabs by lines passing through certain "events." Assuming that the contour of the figure to be thinned has been approximated by polygons, the "events" are then the vertices of the polygons, and the line sweep algorithm searches for pairs of edges lying within each slab. The pairing of edges is useful for detecting both regular and intersection regions. The regular regions can be found at the sites where pairings between edges exist. Intersection regions are those where such relations would cease to exist. A salient feature of our approach is that it finds simultaneously the set of regular regions that attach to the same intersection region. Such a set is thus called an intersection set. The output of our algorithm consists of skeletons as well as intersection sets. Both can be used as features for subsequent character recognition. Moreover, the line sweep thinning algorithm is efficient in computation as compared with a pixel-based thinning algorithm which outputs skeletons only.

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

line sweep
thinning
intersection set
feature analysis
character recognition

line sweep thinning algorithm
path
junction
regular region
singular region


Fuzzy-scorecard based logistics management in robust SCM Due to the IT advances, the logistics management faces a change to the new era. This article proposes a novel method to evaluate the real-time overall performance of a logistics network for a supply chain. The corresponding strategies to manage the underperformed channels can be subsequently obtained in the method. Thus, the logistics network can be managed timely under the stochastic environment, and it makes the SCM robust. The overall performance of the logistics network is integrated by the individual logistics channel real-time performance which can be easily obtained by the new IT technologies such as RFID, etc. The fuzzy-scorecard is introduced to indicate the measured key performance indicators (KPI) for the network. Some numerical examples are presented to illustrate the various scenarios of management for the proposed method. (c) 2011 Elsevier Ltd. All rights reserved.

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

supply chain management
business intelligence
reliability
fuzzy-scorecard


Concatenative speech synthesis based on the plural unit selection and fusion method This paper proposes a novel speech synthesis method to generate human-like natural speech. The conventional unit-selection-based synthesis method selects speech units from a large database, and concatenates them with or without modifying the prosody to generate synthetic speech. This method features highly human-like voice quality. The method, however, has a problem that a suitable speech unit is not necessarily selected. Since the unsuitable speech unit selection causes discontinuity between the consecutive speech units, the synthesized speech quality deteriorates. It might be considered that the conventional method can attain higher speech quality if the database size increases. However, preparation of a larger database requires a longer recording time. The narrator's voice quality does not remain constant throughout the recording period. This fact deteriorates the database quality, and still leaves the problem of unsuitable selection. We propose the plural unit selection and fusion method which avoids this problem. This method integrates the unit fusion used in the unit-training-based method with the conventional unit-selection-based method. The proposed method selects plural speech units for each segment, fuses the selected speech units for each segment, modifies the prosody of the fused speech units, and concatenates them to generate synthetic speech. This unit fusion creates speech units which are connected to one another with much less voice discontinuity, and realizes high quality speech. A subjective evaluation test showed that the proposed method greatly improves the speech quality compared with the conventional method. Also, it showed that the speech quality of the proposed method is kept high regardless of the database size, from small (10 minutes) to large (40 minutes). The proposed method is a new framework in the sense that it is a hybrid method between the unit-selection-based method and the unit-training-based method. In the framework, the algorithms of the unit selection and the unit fusion are exchangeable for more efficient techniques. Thus, the framework is expected to lead to new synthesis methods.

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

speech synthesis
plural unit selection
unit fusion

unit training
sense of stability and sense of voice


Optimum and heuristic synthesis of multiple word-length Architectures This paper explores the problem of architectural synthesis (scheduling, allocation, and binding) for multiple word-length systems. It is demonstrated that the resource allocation and binding problem, and the interaction between scheduling, allocation, and binding, are complicated by the existence of multiple word-length operators. Both optimum and heuristic approaches to the combined problem are formulated. The optimum solution involves modeling as an integer linear program, while the heuristic solution considers intertwined scheduling, binding, and resource word-length selection. Techniques are introduced to perform scheduling with incomplete word-length information, to combine binding and word-length selection, and to refine word-length information based on critical path analysis. Results are presented for several benchmark and artificial examples, demonstrating significant resource savings of up to 46% are possible by considering these problems within the proposed unified framework.

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

bitwidth
digital signal processing
field-programmable gate array
high-level synthesis
word-length


Using clausal deductive databases for defining semantics in disjunctive deductive databases This paper investigates the novel concept of clausal deductive databases (cd-databases), which are special normal deductive databases - i.e., deductive databases which may contain default negation in rule bodies - over a typed meta-language L-cd with a fixed set of predicate symbols, namely dis, con, and some built-in predicate symbols. The arguments of the literals in L-cd are given by disjunctive and conjunctive clauses of a basic first-order language l. Disjunctive deductive databases (dd-databases) generalize normal deductive databases by allowing for disjunctions of atoms or literals in rule heads. We present a transformation which maps a dd-database D into a cd-database D-cd that talks about the clauses of D. cd-databases provide a flexible framework for declaratively specifying the semantics of dd-databases: we can fix a standard control strategy, e.g., stable model or well-founded semantics, and vary the logical description D-cd for specifying different semantics. The transformed database D-cd usually consists of a part D-circle times which naturally expresses the rules of D, and two generic parts which are independent of D: D-logic specifies logical inference rules like resolution and subsumption, and D-cwa specifies non-monotonic inference rules like closed-world-assumptions. Another program transformation, which uses the idea of bringing sets of clauses to the argument level is given for hypothetical logic programs: a hypothetical logic program D is mapped to a classical normal logic program D-circle dot, such that well-known semantics and inference methods for normal logic programs can be used for hypothetical reasoning as well.

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

disjunctive deductive databases
hypothetical reasoning

clausal logic programming
program transformations
non-monotonic reasoning
stable models
closed-world-assumptions


Series Parallel Digraphs with Loops In the conversion of finite automata to regular expressions, an exponential blowup in size can generally not be avoided. This is due to graph-structural properties of automata which cannot be directly encoded by regular expressions and cause the blowup combinatorially. In order to identify these structures, we generalize the class of arc-series-parallel digraphs beyond the acyclic case. The resulting digraphs are shown to be reversibly encoded by linear-sized regular expressions. Also, a characterization of this new class by a set of seven forbidden substructures is given. Automata that require expressions of superlinear size must contain some of these substructures.

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


Following the red thread of information in information literacy research: Recovering local knowledge through interview to the double A new technique for information practice research is introduced. Strengths and weakness of the technique are considered. A suite of new concepts for the information sciences is explored.

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

information literacy
information practice
interview to the double


On the complexity of case-based planning This paper analyses the computational complexity of problems related to case-based planning: planning when a plan for a similar instance is known, and planning from a library of plans. It is proven that planning from a single case has the same complexity than generative planning (i.e. planning 'from scratch'); using an extended definition of cases, complexity is reduced if the domain stored in the case is similar to the one to search plans for. Planning from a library of cases is shown to have the same complexity. In both cases, the complexity of planning remains, in the worst case, PSPACE-complete.

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


An algorithmic analysis of DNA structure Bilinearity, complementarity and antiparallelism of the double stranded DNA structure are proved, in a general and abstract setting, as requirements of an efficient duplication algorithm for 'mobile strings'.

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 B

duplication algorithms
dna computing
molecular computing


Embedding sensitivity theory in ordinal optimization for decentralized optimal power flow control In this paper, the decentralized optimal power flow with continuous and discrete control variables problem is firstly formulated as a NP-hard optimization problem - Block Additive constrained with Continuous and Discrete variables (BACD) problem. Secondly, an algorithm of embedding sensitivity theory (ST) in ordinal optimization (OO), abbreviated as STOO, is proposed for solving this NP-hard optimization problem. The STOO algorithm consists of three stages and three models of performance evaluation. The proposed method not only copes with the computational complexity due to huge solution space but also obtains a good enough solution with high probability guaranteed by the OO theory. Finally, this work demonstrates the computational efficiency of the STOO algorithm via various tests on the IEEE 118-bus and 244-bus systems partitioned into four subsystems using a 4-PC network and compares the results with those obtained using other heuristic methods, Genetic Algorithm, Tabu Search, Ant Colony Optimization and Simulated Annealing. Test results show the validity, robustness and excellent computational efficiency of the STOO algorithm for obtaining a good enough solution.

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

np-hard optimization problem
power systems


Large capacity optical networks applying multi-stage hetero-granular optical path routing We propose a novel scalable large-scale OXC architecture with a two-stage hetero-granular optical path switching mechanism based on a combination of different granular optical selective switches and an appropriate network design algorithm that can make the best use of the proposed OXC architecture for building cost-effective large capacity optical networks. Simulation results verify that our proposed solution can offer a significant overall network cost reduction. The cost efficiency of networks based on the architecture is also investigated in relation to switching component cost and different network parameters.

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

optical networks
network design algorithm

optical cross-connects
routing and wavelength assignment


on selfish routing in internet-like environments A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves ( e.g. , source routing) or use overlay routing networks ( e.g. , Detour or RON). Such approaches result in selfish routing, because routing decisions are no longer based on system-wide criteria but are instead designed to optimize host-based or overlay-based metrics. A series of theoretical results showing that selfish routing can result in suboptimal system behavior have cast doubts on this approach. In this paper, we use a game-theoretic approach to investigate the performance of selfish routing in Internet-like environments. We focus on intra-domain network environments and use realistic topologies and traffic demands in our simulations. We show that in contrast to theoretical worst cases, selfish routing achieves close to optimal average latency in such environments. However, such performance benefit comes at the expense of significantly increased congestion on certain links. Moreover, the adaptive nature of selfish overlays can significantly reduce the effectiveness of traffic engineering by making network traffic less predictable.

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

network
use
traffic engineering
selfish routing
performance
topologies
links
paper
traffic
research
latency
environments
behavior
overlay
routing
congestion

game theory
optimization
simulation
traffic equilibrium
game
metrication
predict
adapt
relaxation
systems
internet
effect


safety verification in murphy using fault tree analysis MURPHY is a language-independent, experimental methodology for building safety-critical, real time software, which will include an integrated tool set. Using Ada as an example, this paper presents a technique for verifying the safety of complex, real-time software using Software Fault Tree Analysis. The templates for Ada are presented along with an example of applying the technique to an Ada program. The tools in the MURPHY tool set to aid in this type of analysis are described.

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

tree software methodology analysis verification tool fault paper tools

examples
experimentation
language
complexity
safety critical
template
real-time
integrability


Classification-based de-mosaicing for digital cameras In this paper, we propose a content adaptive demosaicing algorithm, utilising content analysis and correlation between the red, green and blue planes of a particular image. These two aspects are used for the classification of the technique in the generated trained filters. The proposed method aims to reconstruct a high quality demosaiced image from a CFA Bayer pattern. The strategy highlighted in this paper is very effective, as many of the image details are maintained during reconstruction. Since image content analysis and filter coefficient optimisation are performed during training and the training process is offline, the online de-mosaicing filter is very efficient.

O O O O O O O O O O O O O O O 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 O O O O O O 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 bi-objective fuzzy c-means cluster analysis for TSK fuzzy system identification For conventional fuzzy clustering-based approaches to fuzzy system identification, a fuzzy function is used for cluster formation and another fuzzy function is used for cluster validation to determine the number and location of the clusters which define IF parts of the rule base. However, the different fuzzy functions used for cluster formation and validation may not indicate the same best number and location of the clusters. This potential disparity motivates us to propose a new fuzzy clustering-based approach to fuzzy system identification based on the bi-objective fuzzy c-means (BOFCM) cluster analysis. In this approach, we use the BOFCM function for both cluster formation and validation to simultaneously determine the number and location of the clusters which we hope can efficiently and effectively define IF parts of the rule base. The proposed approach is validated by applying it to the truck backer-upper problem with an obstacle in the center of the field.

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

fuzzy system identification
fuzzy clustering
fuzzy cluster analysis
learning


Knowledge modeling of program supervision task and its application to knowledge base verification This paper presents a knowledge-level analysis of the program supervision task based on two different systems: PEGASE and PULSAR. A knowledge-level analysis of a knowledge-based system reveals the organisation of the knowledge it uses and how it uses this knowledge to solve the task. It is also the key to determine the properties that it assumes about domain knowledge. These aspects of knowledge-level analysis have been successfully used as a framework to compare different systems, mostly for knowledge engineering purposes. This paper also describes how domain knowledge assumptions have been exploited in the implementation of a verification module for program supervision knowledge bases.

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

knowledge modeling
program supervision task


Designing an expert system for fraud detection in private telecommunications networks Telecommunications fraud not only burdens telecom providers accountings but burdens individual users as well. The latter are particularly affected in the case of superimposed fraud where the fraudster uses a legitimate users account in parallel with the user. These cases are usually identified after user complaints for excess billing. However, inside the network of a large firm or organization, superimposed fraud may go undetected for some time. The present paper deals with the detection of fraudulent telecom activity inside large organizations premises. Focus is given on superimposed fraud detection. The problem is attacked via the construction of an expert system which incorporates both the network administrators expert knowledge and knowledge derived from the application of data mining techniques on real world data.

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

user modeling
expert systems
data mining applications


context browsing with mobiles - when less is more Except for a handful of "mobile" Web sites, the Web is designed for browsing using personal computers with large screens capable of fully rendering the content of most Web pages. Browsing with handhelds, such as small-screen PDA's or cell phones, usually involves a lot of horizontal and vertical scrolling, thus making Web browsing time-consuming and strenuous. At the same time, one isoften only interested in a fragment of a Web page, which again may not fit on the limited-size screens of mobile devices, requiring more scrolling in both dimensions. In this paper, we address the problem of browsing fatigue during mobile Web access using geometric segmentation of Web pages and the notion of context . Our prototype system, CMo, reduces information overload by allowing its users to see the most relevant fragment of the page and then navigate between other fragments if necessary. On following a link, CMo captures the context of the link, employing a simple topic-boundary detection technique; then, it uses the context to identify relevant information in the next page with the help of a Support Vector Machine, a statistical machine-learning model. Our experiments show that the use of context can potentially save browsing time and improve the mobile browsing experience.

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

partitioning
content adaptation
context-directed browsing
semantic blocks
pda


Bad luck when joining the shortest queue A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in ones own queue. This paper quantifies the probability that ones service would have started earlier if one had joined another queue than the queue that was actually chosen, for exponential multiserver systems with queues in parallel in which customers join one of the shortest queues upon arrival and in which jockeying is not possible.

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

queueing
join-the-shortest-queue
probability of bad luck
power-series algorithm
overtaking customers
dedicated customers


A heuristic for single-warehouse multiretailer supply chains with all-unit transportation cost discounts In supply chain management research, transportation costs, if explicitly considered at all, are frequently assumed to be linear. These costs often have a more complex form, such as an all-unit discount structure this piecewise cost function adds significant complexity when included in supply chain management problems and is therefore often ignored due to solution time or tractability concerns. We present and evaluate a new heuristic procedure which provides good solutions to problems involving all-unit discount cost functions while significantly reducing solution times. The general nature of this procedure does not require assumptions about the supply chain structure or policies, and is therefore applicable in a wide range of settings.

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


Haptic robotization of the human body by data-driven vibrotactile feedback ? We propose haptic robotization of the human body using vibrotactile feedback. Vibration recording, modeling, and rendering create robot-like body sense. We examine the contribution of the vibration to the subjective robot-like feeling. We developed virtual reality application with HMD and motion capture camera. VR system with haptic feedback enables us immersive robotized body experience.

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

body sense
robotization
vibrotactile feedback


Ereignisverarbeitung zur Flexiblen Dynamischen Informationsverarbeitung in Smart Cities Ein Pfeiler des Smart City Konzeptes ist die Verfgbarkeit von groen Datenmengen, sowie die Fhigkeit diese flexibel und intelligent in Nahe-Echtzeit analysieren und verarbeiten zu knnen. Als technologische Grundlage fr diese oft unterschtze Datenanalyse und -verarbeitungsfhigkeit werden vielfach Technologien aus dem Bereich der Ereignisverarbeitung genannt. In diesem Kapitel werden zentrale Konzepte der Ereignisverarbeitung kurz vorgestellt und deren Nutzen, Grenzen und zuknftige Entwicklungen anhand eines Szenarios aus dem Bereich ad-hoc Car-Sharings beschrieben.

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

complex event processing
big data
zeitnahe verarbeitung
flexible verarbeitung


A numerical method for the simulation of low Mach number liquid-gas flows This work is devoted to the numerical simulation of liquid-gas flows. The liquid phase is considered as incompressible, while the gas phase is treated as compressible in the low Mach number approximation. A single fluid two pressure model is developed and the front-tracking method is used to track the interface. Navier-Stokes equations coupled with that of temperature are solved in the whole computational domain. Velocity, pressure and temperature fields are computed yielding a complete description of the dynamics for both phases. We show that our method is much more efficient than the so-called all-Mach methods involving a single pressure, since large time steps can be used while retaining time accuracy. The model is first validated on a reference test problem solved using an accurate ALE technique to track the interface. Numerical examples in two space dimensions are next presented. They consist of air bubbles immersed in a closed cavity filled up with liquid water. The forced oscillations of the system consisting of the air bubbles and the liquid water are investigated. They are driven by a heat supply or a thermodynamic pressure difference between the bubbles. (C) 2010 Elsevier Inc. All rights reserved.

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

two-phase flow
front-tracking
low mach number flow
compressibility


Painting and rendering textures on unparameterized models This paper presents a solution for texture mapping unparameterized models. The quality of a texture on a model is often limited by the model's parameterization into a 2D texture space. For models with complex topologies or complex distributions of structural detail, finding this parameterization can be very difficult and usually must be performed manually through a slow iterative process between the modeler and texture painter. This is especially true of models which carry no natural parameterizations, such as subdivision surfaces or models acquired from 3D scanners. Instead, we remove the 2D parameterization and store the texture in 3D space as a sparse, adaptive octree. Because no parameterization is necessary, textures can be painted on any surface that can be rendered. No mappings between disparate topologies are used, so texture artifacts such as seams and stretching do not exist. Because this method is adaptive, detail is created in the map only where required by the texture painter, conserving memory usage.

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

paint systems
rendering systems
spatial data structures
level of detail algorithms


Study of Polynomial Mapping Functions in Video-Oculography Eye Trackers Gaze-tracking data have been used successfully in the design of new input devices and as an observational technique in usability studies. Polynomial-based Video-Oculography (VOG) systems are one of the most attractive gaze estimation methods thanks to their simplicity and ease of implementation. Although the functionality of these systems is generally acceptable, there has been no thorough comparative study to date of how themapping equations affect the final system response. After developing a taxonomic classification of calibration functions, we examined over 400,000 models and evaluated the validity of several conventional assumptions. Our rigorous experimental procedure enabled us to optimize the calibration process for a real VOG gaze-tracking system and halve the calibration time while avoiding a detrimental effect on the accuracy or tolerance to head movement. Finally, a geometry-based method is implemented and tested. The results and performance is compared with those obtained by the general purpose expressions.

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

human factors
algorithms
eye-tracking
gaze-tracking
video-oculography
human computer interaction
multiple linear regression


Wavelet families of increasing order in arbitrary dimensions We build discrete-time compactly supported biorthogonal wavelets and perfect reconstruction filter banks for any lattice in any dimension with any number of primal and dual vanishing moments. The associated scaling functions are interpolating. Our construction relies on the lifting scheme and inherits all of its advantages: fast transform, in-place calculation, and integer-to-integer transforms. We show that two lifting steps suffice: predict and update. The predict step can be built using multivariate polynomial interpolation, while update is a multiple of the adjoint of predict. While we concentrate on the discrete-time case, some discussion of convergence and stability issues together with examples is given.

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


a virtualized link layer with support for indirection The current Internet today hosts several extensions for indirection like Mobile IP, NAT, proxies, route selection and various network overlays. At the same time, user-controlled indirection mechanisms foreseen in the Internet architecture (e.g., loose source routing) cannot be used to implement these extensions. This is a consequence of the Internet's indirection semantics not being rich enough at some places and too rich at others. In order to achieve a more uniform handling of indirection we propose SelNet, a network architecture that is based on a virtualized link layer with explicit indirection support. Indirection in this context refers to user-controlled steering of packet flows through the network. We discuss the architectural implications of such a scheme and report on implementation progress.

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

network
order
architecture
implementation
context
virtualized link layer
routing
support
internet
indirection
scheme

select
place
semantic
mobility
overlay
underlay networks
layer
extensibility
timing
network architecture
internet architecture
user
linking


Cephalogram analysis applying template matching and fuzzy logic Cephalogram analysis has an important role in diagnosis, treatment and surgery of the skull and jaw. This field of science is mostly used by orthodontists. High speed and accuracy in automatic detection and geometrical evaluation and description of landmarks is widely demanded. An iterative self-organized data analysis technique using a combination of statistical pattern recognition and fuzzy logic-based decision making has been proposed as an efficient technique for detection of craniofacial landmarks. A large number of cephalograms has been considered in order to testify the performance of the system against different quality images. The images are primarily processed in order to enhance the regions of soft and hard tissues separately. Then for each landmark, different template matching plus fuzzy logic approach has been followed. Final landmarks are selected from a number of detected points by applying another fuzzy decision making criterion. The procedure is superior to the previous techniques for which either low accuracy has been reported or high quality images have been taken into consideration.

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

cephalogram
template matching
fuzzy logic


Nonintrusive tracing in the Internet Intruders that log in through a series of machines when conducting an attack are hard to trace because of the complex architecture of the Internet. The thumbprinting method provides an efficient way of tracing such intruders by determining whether two connections are part of the same connection chain. Because many connections are transient and therefore short in length, choosing the best time interval to thumbprint over can be an issue. In this paper, we provide a way to shorten the time interval used for thumbprinting. We then study some special properties of the thumbprinting function. We also study another mechanism for tracing intruders in the Internet based on a timestamping approach, which passively monitors flows between source and destination pairs. Given a potentially suspicious source, we identify its true destination. We compute the error probability of our algorithm and show that its value decreases exponentially as the observation time increases. Our simulation results show that our approach performs well. Copyright (c) 2012 John Wiley & Sons, Ltd.

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


towards many-core implementation of lu decomposition using peano curves We present our recent research on cache-oblivious algorithms and implementations of parallel LU decomposition on shared-memory multi- and manycore platforms. Our approach uses a block-recursive matrix storage scheme based on space filling curves, and thus extends our work presented at CF'08. The data structure is based on Peano curves, and is separated into a coarse-grain recursive block-matrix scheme, and a fine-grain iterative order for the elementary matrix blocks. The block element order is derived from the recursive construction of a Peano space-filling curve. The block matrices are stored in ordinary row-major order, and form elementary data types for the block operations. The block size is chosen to perfectly fit the lowest-level data cache in the CPU's cache hierarchy. All matrix operations on this two-level data structure are implemented via routines working on block matrices as operands, and are optimised assembler to exploit the SIMD capacities of the CPUs. For parallelisation on shared memory platforms, we compare two different OpenMP implementations -- one based on OpenMP 2.0, which requires explicit scheduling of the block operations to processor cores, and an implementation that exploits the new task concept in OpenMP 3.0. Performance tests on various platforms ranging from desktop systems to an SGI Altix supercomputer, showed that our implementation 'TifaMMy' optimises the use of the available memory hardware by reducing the bandwidth requirements. Hence, the cache-oblivious approach of TifaMMy is also efficient in the context of multi- and manycore environments. We also demonstrated that the OpenMP 3.0 task concept can lead to both well-structured implementations and competitive parallel efficiency for block-recursive, cache-oblivious algorithms.

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

multicore
cache-oblivious algorithms
matrix multiplication
matrix data structures
space-filling curve


threshold based wimax resource reservation A well designed resource allocation policy is important for network operators, especially in emerging networks with scarce resources such as wireless and mobile networks. Two promising wireless technologies nowadays are Wireless Metropolitan Area Network (WMAN) and Wireless Local Area Network (WLAN). The latter is already largely deployed whereas the former is more recently getting deployed as the wireless broadband access network. For better and cheaper wireless coverage extension, the integration of these two technologies seems to be a very good option. In this paper we introduce a method for resource allocation in the integrated WiFi-WiMax architecture. A mathematical model is proposed where the resource allocation is based on two thresholds corresponding to direct and indirect traffic to the WiMax Base Stations. Indirect traffic is the one coming from WiFi Access Points. The proposed model ensures that neither the direct nor the indirect traffic would suffer from a starvation problem. The results of our analysis show clearly that a well designed resource allocation policy improves the usage of combined WiFi-WiMax network, therefore increasing the number of served users which will raise the operator's profits.

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


Leftmove-bounded picture languages Let Pi = {u, d, r, l} be the chain-code picture alphabet such that u (d, r, l,) denotes the graphics command to move the drawing pen up (down, right, left) in the 2D Cartesian plane. It is known that the picture membership problem can be solved in polynomial time For each context-free language over (u, d, r) and is NP-complete for a so-called retreat-bounded regular (or reversal-bounded Linear) language over Pi. Imposing both retreat and reversal bounds on languages over Pi results in the leftmove-bounded languages whose words describe pictures by making no more than a bounded number of left moves. The picture membership problem can be solved in polynomial time for each leftmove-bounded context-free language over Pi and is NP-complete for a leftmove-unbounded (but retreat-bounded) linear language over (u, d, lr). There exists a context-sensitive language over {u, d, r} (or {u, d, lr}) for which the picture membership problem is undecidable. (C) 2000 Elsevier Science B.V. All rights reserved.

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


Learning-Based Vertebra Detection and Iterative Normalized-Cut Segmentation for Spinal MRI Automatic extraction of vertebra regions from a spinal magnetic resonance (MR) image is normally required as the first step to an intelligent spinal MR image diagnosis system. In this work, we develop a fully automatic vertebra detection and segmentation system, which consists of three stages; namely, AdaBoost-based vertebra detection, detection refinement via robust curve fitting, and vertebra segmentation by an iterative normalized cut algorithm. In order to produce an efficient and effective vertebra detector, a statistical learning approach based on an improved AdaBoost algorithm is proposed. A robust estimation procedure is applied on the detected vertebra locations to fit a spine curve, thus refining the above vertebra detection results. This refinement process involves removing the false detections and recovering the miss-detected vertebrae. Finally, an iterative normalized-cut segmentation algorithm is proposed to segment the precise vertebra regions from the detected vertebra locations. In our implementation, the proposed AdaBoost-based detector is trained from 22 spinal MR volume images. The experimental results show that the proposed vertebra detection and segmentation system can achieve nearly 98% vertebra detection rate and 96% segmentation accuracy on a variety of testing spinal MR images. Our experiments also show the vertebra detection and segmentation accuracies by using the proposed algorithm are superior to those of the previous representative methods. The proposed vertebra detection and segmentation system is proved to be robust and accurate so that it can be used for advanced research and application on spinal MR images.

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

adaptive boosting (adaboost) learning
magnetic resonance imaging (mri)
normalized-cut segmentation


Applications of Independent Component Analysis in Wireless Communication Systems Independent component analysis (ICA) is a signal processing technique used for separating statistically independent and non-Gaussian mixed signals. It is widely used in different areas e.g., wireless communication, speech and biomedical signal processing, vibration analysis, and machinery fault diagnosis. In wireless communication systems, ICA has been used in multiple input multiple output systems, wireless sensor networks, cognitive radio networks, code division multiple access , and orthogonal frequency division multiplexing. The applications of ICA in wireless communication include the suppression of inter symbol interference, cancellation of inter channel interference, direction of arrival estimation, automatic classification of modulation, and spectrum sensing etc. This paper provides a comprehensive survey on the applications of ICA in various wireless communication systems along with the survey of mixing models used in the theory of ICA. The techniques for estimating the number of signals in received mixed signals are also studied. We also surveyed the ICA applications in time varying mixing scenario. The challenges and limitations of ICA regarding wireless communication systems are also presented. This paper also outlines future research directions related to the field of applications of ICA in wireless communication systems.

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

independent component analysis
wireless communication systems
mixing models


Image Retargeting Using Mesh Parametrization Image retargeting aims to adapt images to displays of small sizes and different aspect ratios. Effective retargeting requires emphasizing the important content while retaining surrounding context with minimal visual distortion. In this paper, we present such an effective image retargeting method using saliency-based mesh parametrization. Our method first constructs a mesh image representation that is consistent with the underlying image structures. Such a mesh representation enables easy preservation of image structures during retargeting since it captures underlying image structures. Based on this mesh representation, we formulate the problem of retargeting an image to a desired size as a constrained image mesh parametrization problem that aims at finding a homomorphous target mesh with desired size. Specifically, to emphasize salient objects and minimize visual distortion, we associate image saliency into the image mesh and regard image structure as constraints for mesh parametrization. Through a stretch-based mesh parametrization process we obtain the homomorphous target mesh, which is then used to render the target image by texture mapping. The effectiveness of our algorithm is demonstrated by experiments.

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


Paired gang scheduling Conventional gang scheduling has the disadvantage that when processes perform I/O or blocking communication, their processors remain idle because alternative processes cannot be run independently of their own gangs. To alleviate this problem, we suggest a slight relaxation of this rule: match gangs that make heavy use of the CPU with gangs that make light use of the CPU (presumably due to I/O or communication activity), and schedule such pairs together, allowing the local scheduler on each node to select either of the two processes at any instant. As I/O-intensive gangs make light use of the CPU, this only causes a minor degradation in the service to compute-bound jobs. This degradation is more than offset by the overall improvement in system performance due to the better utilization of the resources.

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


New Balanced Boolean Functions with Good Cryptographic Properties It is known that Boolean functions used in stream ciphers should have good cryptographic properties to resist fast algebraic attacks. In this paper, we study a new class of Boolean functions with good cryptographic properties: balancedness, optimum algebraic degree, optimum algebraic immunity and a high nonlinearity.

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

boolean functions
algebraic immunity
nonlinearity


A dispatching method for automated lifting vehicles in automated port container terminals In automated container terminals, containers are transported from the marshalling yard to a ship and vice versa by automated vehicles. The automated vehicle type studied in this paper is an automated lifting vehicle (ALV) that is capable of lifting a container from the ground by itself. This study discusses how to dispatch ALVs by utilizing information about pickup and delivery locations and time in future delivery tasks. A mixed-integer programming model is provided for assigning optimal delivery tasks to ALVs. A procedure for converting buffer constraints into time window constraints and a heuristic algorithm for overcoming the excessive computational time required for solving the mathematical model are suggested. Numerical experiments are reported to compare the objective values and computational times by a heuristic algorithm with those by an optimizing method and to analyze the effects of dual cycle operation, number of ALVs, and buffer capacity on the performance of ALVs. (C) 2008 Elsevier Ltd. All rights reserved.

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

automated lifting vehicle
dispatching
time window


automatic acquisition of phrase semantic rule for chinese The semantic collocations play important roles in parsing Chinese phrases. They are useful for both semantic disambiguation and structural disambiguation. In this paper, a representation of phrase semantic rules for Chinese is presented to formulate such knowledge, and a corpus-based method was proposed to acquire phrase semantic rules from a Chinese phrase corpus annotated with syntactic and semantic information. The method includes a metarule-guided algorithm for mining cross-level association rules to acquire phrase semantic rules and an optimization algorithm to filter these rules. The experiment results showed the effectiveness of the method. Disambiguation performance of these resulting rules was quiet well.

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


A note on circle packing The problem of packing circles into a domain of prescribed topology is considered. The circles need not have equal radii. The Collins-Stephenson algorithm computes such a circle packing. This algorithm is parallelized in two different ways and its performance is reported for a triangular, planar domain test case. The implementation uses the highly parallel graphics processing unit (GPU) on commodity hardware. The speedups so achieved are discussed based on a number of experiments.

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

algorithm performance
parallel computation
graphics processing unit (gpu)


Basic properties and chaotic synchronization of complex Lorenz system This paper aims at studying the basic properties and chaotic synchronization of complex Lorenz system: x = alpha(y - x), y = gamma x - y - xz, z = -beta z + 1/2 ((x) over bar y + x (y) over bar), (*) where alpha, gamma, beta are positive ( real or complex) parameters, x and y are complex variables, z is a real variable, an overbar denotes complex conjugate variable and dots represent derivatives with respect to time. This system arises in many important applications in physics, for example, in laser physics and rotating fluids dynamics. Numerically we show that this system is a chaotic system and exhibits chaotic attractors. The necessary conditions for system (*) to generate chaos are obtained. Analytical and numerical calculations are presented to achieve synchronization. Active control technique is used to synchronize chaotic attractors of equations (*).

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

basic properties
chaos
synchronization
active control
complex

chaotic attractor
error system
equilibria
dissipation


Ensembles of evolutionary product unit or RBF neural networks for the identification of sound for pass-by noise test in vehicles In order to ensure the success of new product developments and to study different alternatives of designs before their manufacture, it is primordial to assess identification models. This practice is an extensive one in the automotive industry. Automotive manufacturers invest a lot of effort and money to improve the vibro-acoustics performance of their products because they have to comply with the noise emission standards. International standards, commonly known as pass-by and coast-by noise test, define a procedure for measuring vehicle noise at different receptor positions. The aim of this work is to develop a novel model which can be used in pass-by noise test in vehicles based on ensembles of hybrid evolutionary product unit or radial basis function neural networks (EPUNNs or ERBFNNs) at high frequencies. Statistical models and ensembles of hybrid EPUNN and ERBFNN approaches have been used to develop different noise identification models. The results obtained using different ensembles of hybrid EPUNNs and ERBFNNs show that the functional model and the hybrid algorithms proposed provide a very accurate identification compared to other statistical methodologies used to solve this regression problem.

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

ensembles
radial basis function neural networks
regression
identification of sound

product unit neural networks
evolutionary algorithms
hybrid algorithm