Improved treatment of source terms in upwind schemes for the shallow water equations in channels with irregular geometry This paper deals with the numerical solution of the shallow water equations in channels with irregular geometry but with a locally rectangular cross section. This type of channel leads to the presence of source terms involving the gradient of the depth and the breadth of the channel. Extensions of the e-scheme of van Leer and Roe are proposed which generate natural upwind discretizations of the source terms. The consistency of the proposed schemes is analyzed. A stationary solution that emphasizes the source terms considered is obtained which is used to test the proposed extensions in terms of a "conservation" property. A low-order asymptotic unsteady analytical solution for a small Froude number is also obtained. The numerical results presented confirm the improved properties of the proposed schemes for a transient test problem. (C) 1999 Academic Press.

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

upwind schemes
source terms
shallow water equations
channels with irregular geometry


Modeling, numerical methods, and simulation for particle-fluid two-phase flow problems In this paper, we study the issues of modeling, numerical methods, and simulation with comparison to experimental data for the particle-fluid two-phase flow problem involving a solid-liquid mixed medium. The physical situation being considered is a pulsed liquid fluidized bed. The mathematical model is based on the assumption of one-dimensional flows, incompressible in both particle and fluid phases, equal particle diameters, and the wall friction force on both phases being ignored. The model consists of a set of coupled differential equations describing the conservation of mass and momentum in both phases with coupling and interaction between the two phases. We demonstrate conditions under which the system is either mathematically well posed or ill posed. We consider the general model with additional physical viscosities and/or additional virtual mass forces, both of which stabilize the system. Two numerical methods, one of them is first-order accurate and the other fifth-order accurate, are used to solve the models. A change of variable technique effectively handles the changing domain and boundary conditions. The numerical methods are demonstrated to be stable and convergent through careful numerical experiments. Simulation results for realistic pulsed liquid fluidized bed are provided and compared with experimental data. (C) 2004 Elsevier Ltd. All rights reserved.

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

particle-fluid two-phase flow
two-phase models
weno scheme


Performance enhancement of evolutionary search for structural topology optimisation The use of evolutionary algorithms for topological design of structures has been investigated for many years. The methods have disadvantages in that they have slow convergence rate and a complete lack of consistency. In this paper, a number of well-established evolutionary methods including genetic algorithm, stud-genetic algorithm, population-based incremental learning and simulated annealing are reviewed in terms of their philosophical bases. The effective means to deal with topological design problems and prevent checkerboards on a topology are briefly detailed. A new set of design variables employing a numerical technique named approximate density distribution is proposed. The new technique and the classical 10 binary variables are applied to the various evolutionary methods and they are implemented on a number of structural topology optimisation problems. The results obtained from the various design strategies are compared, illustrated and discussed. Numerical experiment shows that using the present technique can improve both convergence rate and consistency of the evolutionary algorithms.

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

evolutionary algorithms
topology optimisation


Characterising trader manipulation in a limit-order driven market Use of trading strategies to mislead other market participants, commonly termed trade-based market manipulation, has been identified as a major problem faced by present day stock markets. Although some mathematical models of trade-based market manipulation have been previously developed, this work presents a framework for manipulation in the context of a realistic computational model of a limit-order market. The Maslov limit order market model is extended to introduce manipulators and technical traders. We show that "pump and dump" manipulation is not possible with traditional Maslov (liquidity) traders. The presence of technical traders, however, makes profitable manipulation possible. When exploiting the behaviour of technical traders, manipulators can wait some time after their buying phase before selling, in order to profit. Moreover, if technical traders believe that there is an information asymmetry between buy and sell actions, the manipulator effort required to perform a "pump and dump" is comparatively low, and a manipulator can generate profits even by selling immediately after raising the price. (c) 2012 IMACS. Published by Elsevier B.V. All rights reserved.

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

limit order markets
market micro-structure models
bayesian learning


Neighbourhood GMM estimation of dynamic panel data models A new approach is developed for estimation of short dynamic panel data models with spatially correlated errors. The method employs an additional set of moment conditions that become available for each i i specifically, instruments with respect to the individual(s) which unit i i is spatially correlated with. These moment conditions are non-redundant and remain informative even if the data generating process is close to a unit root one. The proposed GMM estimator is consistent and asymptotically normally distributed. An extensive Monte Carlo study also builds a GMM estimator that combines spatial and standard instruments. This estimator appears to perform very well under a wide range of parametrisations in terms of both bias and root mean square error. The proposed method is illustrated using crime data based on a panel of 153 local government areas in NSW, spanning a period of 5years.

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

spatial dependence
generalised method of moments


A case-based approach for coordinated action selection in robot soccer Designing coordinated robot behaviors in uncertain, dynamic, real-time, adversarial environments, such as in robot soccer, is very challenging. In this work we present a case-based reasoning approach for cooperative action selection, which relies on the storage, retrieval, and adaptation of example cases. We focus on cases of coordinated attacking passes between robots in the presence of the defending opponent robots. We present the case representation explicitly distinguishing between controllable and uncontrollable indexing features, corresponding to the positions of the team members and opponent robots, respectively. We use the symmetric properties of the domain to automatically augment the case library. We introduce a retrieval technique that weights the similarity of a situation in terms of the continuous ball positional features, the uncontrollable features, and the cost of moving the robots from the current situation to match the case controllable features. The case adaptation includes a best match between the positions of the robots in the past case and in the new situation. The robots are assigned an adapted position to which they move to maximize the match to the retrieved case. Case retrieval and reuse are achieved within the distributed team of robots through communication and sharing of own internal states and actions. We evaluate our approach, both in simulation and with real robots, in laboratory scenarios with two attacking robots versus two defending robots as well as versus a defender and a goalie. We show that we achieve the desired coordinated passing behavior, and also outperform a reactive action selection approach. (C) 2009 Elsevier B.V. All rights reserved.

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

case-based reasoning
cooperative task execution


Web Services Discovery with Rough Sets Web services are emerging as a major technology for building service-oriented distributed systems. Potentially, various resources on the Internet can be virtualized as Web services for a wider use by their communities. Service discovery becomes an issue of vital importance for Web services applications. This article presents ROSSE, a Rough Sets based Search Engine for Web service discovery. One salient feature of ROSSE lies in its capability to deal with uncertainty of service properties when matching services. A use case is presented to demonstrate the use of ROSSE for discovery of car services. ROSSE is evaluated in terms of its accuracy and efficiency in service discovery.

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


Key usability factors of service-oriented web sites for students: an empirical study Purpose - This paper aims to report on a web usability study and to identify and prioritise key web interface usability factors (WIUFs) for web sites of 36 student-related online services categorised into three groups: personal services, purchase services and study-related web sites. Design/methodology/approach - In this study, involving 400 student internet users (SIUs), 12,310 data points were collected and analysed using a multiple linear regression test. Seven WIUFs were tested: use of colour and font (UCF), use of graphics and multimedia (UGM), clarity of goals in web site (CGW), trustworthiness of web site (TOW), interactivity of web site (IOW), ease of web navigation (EWN), and download speed of web site (DSOW). Findings - The study results reveal that every online service category has a different set of crucial WIUFs. SIUs' web usability preferences were compared with those of general internet users. Research limitations/implications - The participants were all Malaysians; therefore, generalising the findings to all SIUs will require a confirmatory study with SIUs from other parts of the world. Practical implications - Web developers can use the results to design usable web sites for specific online service categories. Originality/value - The research offers a simpler alternative to measure web usability and to determine which WIUFs are crucial for a specific online service category with consideration of the users' role. This study overcomes some weaknesses of previous studies, i.e. small sample size, no consideration of product-task relationship, no specific customer group and cumbersome procedures.

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


Characterizing Web usage regularities with information foraging agents Researchers have recently discovered several interesting, self-organized regularities from the World Wide Web, ranging from the structure and growth of the Web to the access patterns in Web surfing. What remains to be a great challenge in Web log mining is how to explain user behavior underlying observed Web usage regularities. In this paper, we will address the issue of how to characterize the strong regularities in Web surfing in terms of user navigation strategies, and present an information foraging agent-based approach to describing user behavior. By experimenting with the agent-based decision models of Web surfing, we aim to explain how some Web design factors as well as user cognitive factors may affect the overall behavioral patterns in Web usage.

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

web log
regularities
user behavior
decision models
information foraging

web mining
power law
autonomous agents
agent-based simulation


B-Fetch: Branch Prediction Directed Prefetching for In-Order Processors Computer architecture is beset by two opposing trends. Technology scaling and deep pipelining have led to high memory access latencies; meanwhile, power and energy considerations have revived interest in traditional in-order processors. In-order processors, unlike their superscalar counterparts, do not allow execution to continue around data cache misses. In-order processors, therefore, suffer a greater performance penalty in the light of the current high memory access latencies. Memory prefetching is an established technique to reduce the incidence of cache misses and improve performance. In this paper, we introduce B-Fetch, a new technique for data prefetching which combines branch prediction based lookahead deep path speculation with effective address speculation, to efficiently improve performance in in-order processors. Our results show that B-Fetch improves performance 38.8% on SPEC CPU2006 benchmarks, beating a current, state-of-the-art prefetcher design at similar to 1/3 the hardware overhead.

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

data cache prefetching
memory systems
value prediction
in-order processors


Virtual machine migration in cloud data centers: a review, taxonomy, and open research issues Virtualization efficiently manages the ever-increasing demand for storage, computing, and networking resources in large-scale Cloud Data Centers. Virtualization attains multifarious resource management objectives including proactive server maintenance, load balancing, pervasive service availability, power management, and fault tolerance by virtual machine (VM) migration. VM migration is a resource-intensive operation as it constantly requires adequate CPU cycles, memory capacity, system cache, and network bandwidth. Consequently, it adversely affects the performance of running applications and cannot be entirely overlooked in contemporary data centers, particularly when user SLA and critical business goals are to be met. The unavailability of a comprehensive survey on VM migration schemes that coversvarious VM migration aspects such as migration patterns,sequence, application performance,bandwidth optimization, andmigration granularity has motivatedthis review of existing schemes. This paper reviews state-of-the-art live and non-live VM migration schemes. Through an extensive literature review, a detailed thematic taxonomy is proposed for the categorization of VM migration schemes. Critical aspects and related features of current VM migration schemes are inspected through detailed qualitative investigation. We extract significant parameters from existing literature to discuss the commonalities and variances among VM migration schemes. Finally, open research issues and challenges with VM migration that require further consideration to develop optimal VM migration schemes in Cloud Data Centers are briefly addressed.

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

virtualization
vm migration
data centers


Informative path planning as a maximum traveling salesman problem with submodular rewards ? In this paper we extend the classic problem of finding the maximum weight Hamiltonian cycle in a graph to the case where the objective is a submodular function of the edges. We consider a greedy algorithm and a 2-matching based algorithm, and we show that they have approximation factors of 1 2 + ? and max { 2 3 ( 2 + ? ) , 2 3 ( 1 ? ? ) } respectively, where ? ? is the curvature of the submodular function. Both algorithms require a number of calls to the submodular function that is cubic to the number of vertices in the graph. We then present a method to solve a multi-objective optimization consisting of both additive edge costs and submodular edge rewards. We provide simulation results to empirically evaluate the performance of the algorithms. Finally, we demonstrate an application in monitoring an environment using an autonomous mobile sensor, where the sensing reward is related to the entropy reduction of a given set of measurements.

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

traveling salesman problem
informative path planning


Autonomous Knowledge-oriented Clustering Using Decision-Theoretic Rough Set Theory In many applications, clusters tend to have vague or imprecise boundaries. It is desirable that clustering techniques should consider such an issue. The decision-theoretic rough set (DTRS) model is a typical probabilistic rough set model, which has the ability to deal with imprecise, uncertain, and vague information. This paper proposes an autonomous clustering method using the decision-theoretic rough set model based on a knowledge-oriented clustering framework. In order to get the initial knowledge-oriented clustering, the threshold values are produced autonomously based on semantics of clustering without human intervention. Furthermore, this paper estimates the risk of a clustering scheme based on the decision-theoretic rough set by considering various loss functions, which can process the different granular overlapping boundary. An autonomous clustering algorithm is proposed, which is not only experimented with the synthetic data and the standard data but also applied in the web search results clustering. The results of experiments show that the proposed method is effective and efficient.

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

knowledge-oriented clustering
decision-theoretic rough set theory
data mining


a densitometric analysis of web template content What makes template content in the Web so special that we need to remove it? In this paper I present a large-scale aggregate analysis of textual Web content, corroborating statistical laws from the field of Quantitative Linguistics. I analyze the idiosyncrasy of template content compared to regular "full text" content and derive a simple yet suitable quantitative model.

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

template detection
template removal
content analysis
web page segmentation
noise removal


A Simple Analytical Design Approach to Space Time Trellis Codes The space time trellis code (STTC) is a combined design of error-control coding, modulation and transmit-receive diversity that improves data rate and error performance in a wireless channel without any loss in spectral efficiency. It can either be described by a graphical representation, or, in terms of closed analytical forms that lead to a more tractable generator matrix description. However, the main difficulty in generating best code is the long search duration which makes both trellis implementation and generator matrix description difficult, thereby, limiting the use of STTC in wireless links. Since an exhaustive search over all the matrix entries turns out to be impractical if the number of transmitter, encoder states and/or constellation size is very high, some literature provide techniques to reduce the search complexity. Some of them are sub-optimal, some are good. However, none reports any straightforward rule of thumb to design the generator matrix. In this paper, we propose two very simple rules to construct the generator matrix for designing STTC with any arbitrary number of transmit antennas and any memory-less constellation. Mathematical justification behind the rules has been presented. It has been shown that the simplicity of proposed rules reduces the code search complexity to a large extent along with a similar or better coding gain compared to those presented in previous literature. In addition, the STTCs obtained from proposed rules perform no worse than the codes given in previous literature in terms of error rate.

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

space time trellis code
generator matrix
coding gain

multiple input multiple output system
space time coding
rank and determinant criteria


GPU-based trimming and tessellation of NURBS and T-Spline surfaces As there is no hardware support neither for rendering trimmed NURBS-the standard surface representation in CAD-nor for T-Spline surfaces the usability of existing rendering APIs like OpenGL, where a run-time tessellation is performed on the CPU, is limited to simple scenes. Due to the irregular mesh data structures required for trimming no algorithms exists that exploit the GPU for tessellation. Therefore, recent approaches perform a pretessellation and use level-of-detail techniques. In contrast to a simple API these methods require tedious preparation of the models before rendering and hinder interactive editing. Furthermore, due to the tremendous amount of triangle data smooth zoom-ins from long shot to close-up are not possible. In this paper we show how the trimming region can be defined by a trim-texture that is dynamically adapted to the required resolution and allows for an efficient trimming of surfaces on the GPU. Combining this new method with GPU-based tessellation of cubic rational surfaces allows a new rendering algorithm for arbitrary trimmed NURBS and T-Spline surfaces with prescribed error in screen space on the GPU. The performance exceeds current CPU-based techniques by a factor of up to 1000 and makes real-time visualization of real-world trimmed NURBS and T-Spline models possible on consumer-level graphics cards.

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

gpu-based algorithms
nurbs and t-spline surfaces


Area comparison between 6T and 8T SRAM cells in dual-V-dd scheme and DVS scheme This paper compares areas between a 6T and 8T SRAM cells, in a dual-V-dd scheme and a dynamic voltage scaling (DVS) scheme. In the dual-V-dd scheme, we predict that the area of the 6T cell keep smaller than that of the 8T cell, over feature technology nodes all down to 32 nm. In contrast, in the DVS scheme, the 8T cell will becomes superior to the 6T cell after the 32-nm node, in terms of the area.

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

6t sram cell
8t sram cell
v-th variation


A knowledge based component/service repository to enhance analysts domain knowledge for requirements analysis Knowledge of the business domain (e.g., insurance claim, human resources) is crucial to analysts ability to conduct good requirements analysis (RA). However, current practices afford little assistance to analysts in acquiring domain knowledge. We argue that traditional reuse repositories could be augmented by adding rich faceted information on component/services and artifacts such as business-process templates to help analysts acquire domain knowledge during RA. In this paper, we present the design of a Knowledge Based Component Repository (KBCR) for facilitating RA. Then, we report on the design and development of a KBCR prototype. We illustrate its application in a system that is populated with components and process templates for the auto insurance claim domain. An empirical study was conducted to assess its effectiveness in improving RA. Results showed that KBCR enhanced analysts business domain knowledge and helped them better prepare for RA. Our key research contribution is to offer analysts a rich repository (i.e., KBCR) containing domain knowledge that they could utilize to acquire domain knowledge that is crucial for carrying out RA. While repositories of reusable components have been employed for some time, no one has used such repositories to help analysts acquire domain knowledge in order improve the RA of the system.

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

component-based development
design research


Aligning archive maps and extracting footprints for analysis of historic urban environments Archive cartography and archaeologist's sketches are invaluable resources when analysing a historic town or city. A virtual reconstruction of a city provides the user with the ability to navigate and explore an environment which no longer exists to obtain better insight into its design and purpose. However, the process of reconstructing the city from maps depicting features such as building footprints and roads can be labour intensive. In this paper we present techniques to aid in the semi-automatic extraction of building footprints from digital images of archive maps and sketches. Archive maps often exhibit problems in the form of inaccuracies and inconsistencies in scale which can lead to incorrect reconstructions. By aligning archive maps to accurate modern vector data one may reduce these problems. Furthermore, the efficiency of the footprint extraction methods may be improved by aligning either modern vector data or previously extracted footprints, since common elements can be identified between maps of differing time periods and only the difference between the two needs to be extracted. An evaluation of two alignment approaches is presented: using a linear affine transformation and a set of piecewise linear affine transformations.

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

virtual reconstruction
historic urban environments


Analysis of voice features related to obstructive sleep apnoea and their application in diagnosis support Obstructive sleep apnoea (OSA) is a highly prevalent disease affecting an estimated 2-4% of the adult male population that is difficult and very costly to diagnose because symptoms can remain unnoticed for years. The reference diagnostic method, Polysomnography (PSG), requires the patient to spend a night at the hospital monitored by specialized equipment. Therefore fast and less costly screening techniques are normally applied for setting priorities to proceed to the polysomnography diagnosis. In this article the use of speech analysis is proposed as an alternative or complement to existing screening methods. A set of voice features that could be related to apnoea are defined, based on previous results from other authors and our own analysis. These features are analyzed first in isolation and then in combination to assess their discriminative power to classify voices as corresponding to apnoea patients and healthy subjects. This analysis is performed in a database containing three repetitions of four carefully designed sentences read by 40 healthy subjects and 42 subjects suffering from severe apnoea. As a result of the analysis, a linear discriminant model (LDA) was defined including a subset of eight features (signal-to-disperiodicity ratio, a nasality measure, harmonic-to-noise ratio, jitter, difference between third and second formants on a specific vowel, duration of two of the sentences and the percentage of silence in one of the sentences). This model was tested on a separate database containing 20 healthy and 20 apnoea subjects yielding a sensitivity of 85% and a specificity of 75%, with a F1-measure of 81%. These results indicate that the proposed method, only requiring a few minutes to record and analyze the patient's voice during the visit to the specialist, could help in the development of a non-intrusive, fast and convenient PSG-complementary screening technique for OSA. (C) 2013 Elsevier Ltd. All rights reserved.

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

osa screening tools
apnoea discrimination
feature selection
voice pathology


Publishing in Discipline-Specific Open Access Journals: Opportunities and Outreach for Librarians Open access (OA) journals promote the opportunity for peer-reviewed journal articles to be freely accessible. In recent years, the number of OA journals has exploded in all disciplines. Previous studies have identified print-based pedagogical discipline-specific journals outside the field of Library and Information Science (LIS) for librarians to consider as vehicles for publishing articles related to subject-based Information Literacy (IL). The present study explores the presence of discipline-specific pedagogical journals listed in the Directory of Open Access Journals (DOAJ) and presents a table of OA journals with their acceptance rates and review times. Pedagogical OA journals are highlighted as a potential opportunity for librarians to pro-actively reach out to faculty within a discipline and contribute towards the OA movement.

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

open access
information literacy
publishing


A road-matching method for precise vehicle localization using belief theory and Kalman filtering This paper describes a novel road-matching method designed to support the real-time navigational function of cars for advanced systems applications in the area of driving assistance. This method provides an accurate estimation of position for a vehicle relative to a digital road map using Belief Theory and Kalman filtering. Firstly, an Extended Kalman Filter combines the DGPS and ABS sensor measurements to produce an approximation of the vehicle's pose, which is then used to select the most likely segment from the database. The selection strategy merges several criteria based on distance, direction and velocity measurements using Belief Theory. A new observation is then built using the selected segment, and the approximate pose adjusted in a second Kalman filter estimation stage. The particular attention given to the modeling of the system showed that incrementing the state by the bias (also called absolute error) of the map significantly increases the performance of the method. Real experimental results show that this approach, if correctly initialized, is able to work over a substantial period without GPS.

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

sensor fusion
geographical information system
global positioning system


Validation of a QoS architecture for DVB-RCS satellite networks via the SATIP6 demonstration platform Full integration of satellite technology in future terrestrial infrastructures requires support for high-quality broadband bi-directional communications. Research efforts in the field of satellite communications are currently oriented in the study of QoS-aware solutions for DVB-S and DVB-RCS which allow seamless deployment in the Internet. In this paper, the QoS architecture of the SATIN project, sponsored within the 5th EU Research Programme Framework, is presented, along with the implemented demonstrator and the obtained results. The QoS architecture is organized into two main modules, the Traffic Control and Access Control modules, whose aims are (i) to provide for differentiated service of conveyed IP flows and (ii) to achieve efficient utilization of uplink bandwidth, respectively. Experimental results obtained through the developed demonstration platform are reported and discussed to assess the effectiveness of the designed solution in terms of both service differentiation and efficient utilization of satellite resources. (c) 2005 Elsevier B.V. All rights reserved.

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


Robots temperament This work explores a perspective on robotic behavior control based on mechanisms that are traditionally implicated in generation of emotions and temperament in humans. It is demonstrated that these complex psychological phenomena can be imitated by very simple means. At the heart of the emotional component of the robots architecture is Simonovs Information Theory of Emotions. The main assumption of this theory is that emotions represent the brains estimate of any actual need of the individual together with the probability of its satisfaction. The temperamental component of the model controls the balance of excitation and inhibition within the robots cognitive architecture. Experiments were conducted with a couple of simple mobile autonomous robots. Experimental results demonstrate distinct types of behavioral temperament exhibited by the robot, including melancholic, choleric, sanguine and phlegmatic. These types of behavior are determined by regulators of temperament in the robot architecture. It is shown that emotions and temperament can be very useful for a robot in complex environments with unknown characteristics. Various in character environments can demand various types of behavior: in quickly changing environments the choleric behavior is more preferable and in stationary ones are phlegmatic, etc. In some sense, different psychological organization of a robot can be considered as a convenient mechanism of adaptation. Emotions and temperament as biologically inspired mechanisms allow us not only to describe but also to control the robots behavior in a natural form.

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


Coordination mechanisms for selfish scheduling In machine scheduling, a set of jobs must be scheduled on a set of machines so as to minimize some global objective function, such as the makespan, which we consider in this paper. In practice, jobs are often controlled by independent, selfishly acting agents, which each select a machine for processing that minimizes the (expected) completion time. This scenario can be formalized as a game in which the players are job owners, the strategies are machines, and a player's disutility is the completion time of its jobs in the corresponding schedule. The equilibria of these games may result in larger-than-optimal overall makespan. The price of anarchy is the ratio of the worst-case equilibrium makespan to the optimal makespan. In this paper, we design and analyze scheduling policies, or coordination mechanisms, for machines which aim to minimize the price of anarchy of the corresponding game. We study coordination mechanisms for four classes of Multiprocessor machine scheduling problems and derive upper and lower bounds on the price of anarchy of these mechanisms. For several of the proposed mechanisms, we also prove that the system converges to a pure-strategy Nash equilibrium in a linear number of rounds. Finally, we note that our results are applicable to several practical problems arising in communication networks. (C) 2008 Elsevier B.V. All rights reserved.

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


Markov model aided decoding for image transmission using soft-decision-feedback Soft-decision-feedback MAP decoders are developed for joint source/channel decoding (JSCD) which uses the residual redundancy in two-dimensional sources. The source redundancy is described by a second order Markov model which is made available to the receiver for row-by-row decoding, wherein the output for one row is used to aid the decoding of the next row Performance can be improved by generalizing so as to increase the vertical depth of the decoder. This is called sheet decoding, and entails generalizing trellis decoding of one-dimensional data to trellis decoding of two-dimensional data (2-D), The proposed soft-decision-feedback sheet decoder is based on the Bahl algorithm, and it is compared to a hard-decision-feedback sheet decoder which is based on the Viterbi algorithm. The method is applied to 3-bit DPCM picture transmission over a binary symmetric channel, and it is found that the soft decision-feedback decoder with vertical depth V performs approximately as well as the hard-decision-feedback decoder with vertical depth V + 1, Because the computational requirement of the decoders depends exponentially on the vertical depth, the soft-decision-feedback decoder offers significant reduction in complexity. For standard monochrome Lena, at a channel bit error rate of 0.05, the V = 1 and V = 2 soft-decision-feedback decoder JSCD gains in RSNR are 5.0 and 6.3 dB, respectively.

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

image transmission
markov model aided decoding
residual redundancy

dpcm image encoding
joint source/channel coding
soft-decision feedback
three-dimensional trellis decoding


Hierarchical neural networks based prediction and control of dynamic reconfiguration for multilevel embedded systems Multimedia design such as video decoders are typically composed of several communicating tasks. Each task is characterized by its workload variation. The target device of this kind of application contains several processing unit. This calls for a dynamic management of hardware units to improve the QOS of the application and to optimally allocate resources. In this paper, we propose a new architecture based on hierarchical multilevel neural network to model workload variation of each task. The hierarchical structure of this neural network perfectly describes the multilevel decomposition of each hardware unit. The aim of this investigation is to build a design with a control unit that manages the architecture and resource allocation according to the neural network workload prediction.

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

hierarchical prediction
recurrent neural network
embedded system


Economic dispatch with minimization of power transmission losses using penalty-function nonlinear programming neural network This study describes the feasibility of using the penalty-function nonlinear programming neural network method to find the optimal power generating output which minimizes both the costs of generating power and power transmission losses. This method depends on neural network technology in acquiring exterior penalty function. Employing nonlinear function in equality and inequality constraints, the model is established using a neural network and additional objective functions; these additional objective functions expand cost function by using an appropriate penalty function. In this study, a 26-busbar including six generators was used to test the penalty function nonlinear programming neural network method. A comparison with the sequential unconstrained minimization technique (SUMT) demonstrates the reliability and precision of the optimal solution obtained using the new method.

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


History matching on the Imperial College fault model using parallel tempering The history-matching inverse problem from petroleum engineering is analysed using the Imperial College fault model. This fault model produces a challenging inverse problem and is designed to show some of the problems which can occur whilst performing history-matching calculations on complicated geologies. It is shown that there can be multiple distinct geologies which match the history data. Furthermore, it is shown that the maximum-a-posteriori estimate does not correspond to the true geology in some cases. Both of these statements are corroborated via numerical examples where the parameter spaces are a"e, a"e(3), a"e(7) and a"e(13). In addition, it is shown that the number of matches which agree with the data increases with dimension for these examples. It is also shown that the different matches can result in different reservoir management decision which, if incorrectly taken, would incur substantial financial penalties. All of these analyses are performed in a systematic manner, where it is shown that the standard algorithms can give a misleading answer. The history-matching problem is written as a minimisation problem, and it is shown that knowledge of all of the local minima is required. This presents significant computational issues as the resulting objective function is highly nonlinear, expensive to evaluate and multimodal. Previously used algorithms have been proved to be inadequate. Parallel tempering is a method which, if run for long enough, can find all the local minima. However, as the objective is expensive, a number of algorithm modifications had to be used to ensure convergence within a reasonable time. This new information is outlined in the paper. The algorithm as implemented produced results and new insights into this problem which were not suspected before. The results produced by this algorithm for the multimodal history-matching problem are superior to all other results of which we are aware. However, a considered amount of computation time was used within this paper, so this result does not infer that the algorithm cannot be improved upon. This algorithm not only produces good results but can be applied to all other history-matching problems. We have shown that this method provides a robust route of finding multiple local optima/solutions to the inverse problem, which is of considerable benefit to the petroleum industry. Furthermore, it is an entirely parallel algorithm which is becoming computationally feasible for other history-matching problems.

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

parallel tempering
inverse problem
history matching


Tensor-Based Transductive Learning for Multimodality Video Semantic Concept Detection Interaction and integration of multimodality media types such as visual, audio, and textual data in video are the essence of video semantic analysis. Contextual information propagation is useful for both intra-and inter-shot correlations. However, the traditional concatenated vector representation of videos weakens the power of the propagation and compensation among the multiple modalities. In this paper, we introduce a higher-order tensor framework for video analysis. We represent image frame, audio, and text in video shots as data points by the 3rd-order tensor. Then we propose a novel dimension reduction algorithm which explicitly considers the manifold structure of the tensor space from contextual temporal associated cooccurring multimodal media data. Our algorithm inherently preserves the intrinsic structure of the submanifold where tensorshots are sampled and is also able to map out-of-sample data points directly. We propose a new transductive support tensor machines algorithm to train effective classifier using large amount of unlabeled data together with the labeled data. Experiment results on TREVID 2005 data set show that our method improves the performance of video semantic concept detection.

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

multimodality video semantic concept detection

contextual temporal associated cooccurrence (ctac)

transductive support tensor machines (tstm)


Superpixel-based appearance change prediction for long-term navigation across seasons This work is about place recognition across seasons. We present the novel idea of an additional prediction step. We propose a superpixel based implementation: SP-APC. SP-APC can learn to predict e.g. winter images from summer images. Extensive evaluation is done on the Nordland dataset.

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

appearance change prediction
place recognition

long term navigation
appearance based localization
changing environments


A new nonlinear feature extraction method for face recognition Feature extraction is a crucial step for pattern recognition. In this paper, a nonlinear feature extraction method is proposed. The objective function of the proposed method is formed by combining the ideas of locally linear embedding (LLE) and linear discriminant analysis (LDA). Optimizing the objective function in a kernel feature space, nonlinear features can be extracted. A major advantage of the proposed method is that it makes full use of both the nonlinear structure and class-specific information of the training data. Experimental results on the AR face database demonstrate the effectiveness of the proposed method.

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

face recognition
linear discriminant analysis
feature extraction


Tape measure protein having MT3 motif facilitates phage entry into stationary phase cells of Mycobacterium tuberculosis Tape measure protein (TMP) having MT3 motif in mycobacteriophage TM4 genome has been reported to enable the phage infection of Mycobacterium smegmatis during stationary phase. In the present work looking at eight additional mycobacteriophage genomes by in silico analysis, six of them have been found to possess MT3 motif in TMP. The absence of MT3 motif in Che12 and D29 probably makes them incapable of infecting stationary phase cells of Mycobacterium tuberculosis which was experimentally evaluated by the performance of respective luciferase reporter phage constructs developed from the parental phages Che12, D29 and TM4.

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

stationary phase
tape measure protein
mycobacteriophage


SIGNAL PROCESSING TECHNIQUES FOR ESTIMATING POWER SYSTEM MODAL PARAMETERS Smart Grid is expected to provide a reliable power supply with fewer and briefer outages, cleaner power, and self-healing power systems through advanced Power Quality (PQ) monitoring, analysis and diagnosis of the PQ measurements and identification of the root cause, and timely automated controls. It is important to understand that signal processing has been an integral part of advancing and expanding the horizons of this PQ research significantly and the capabilities and applications of signal processing for PQ are continually evolving. This paper thus presents a survey on the proven and emerging signal applications for enhancing PQ, focusing on algorithms for estimating system modal parameters because resonant frequencies and their damping information are critical signatures in evaluating the PQ. In particular, we discuss the need for investigating time-varying and nonlinear characteristics of the modal parameters due to dynamic changes in system operating conditions and introduce promising signal processing techniques for this purpose.

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

prony analysis
hilbert transform
wavelet transform


Synthesis of SrAl2O4: Eu2+, Dy3+, Gd3+ phosphor by combustion method and its phosphorescence properties Eu2+, Dy3+ and Gd3+ co-doped strontium aluminate yellow-green phosphor was synthesized by combustion method using urea as reducer at 600C. The crystallization, particles size and luminescence properties of the sample have been investigated. The results are as follows: Eu2+, Dy3+ and Gd3+ doped into the phosphor do not change the crystalline structure of strontium aluminate. The average size of particles is about 100nm. The excitation and emission spectra are broad bands with the peaks at 348 and 515nm, respectively. Compared with SrAl2O4: Eu2+, Dy3+ phosphor, the initial brightness improved and the afterglow time prolonged.

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


An ensemble approach applied to classify spam e-mails Spam e-mails, known as unsolicited e-mail messages, have become an increasing problem for information security. The intrusion of spam e-mails persecute the users and waste the network resources. Traditionally, machine learning and statistical filtering systems are used to filter out spam e-mails. However, there is no unique method can be successfully applied to classify spam e-mails. It is necessary to apply multiple approaches to detect spam and effectively filter out the increasing volumes of spam e-mails. In this paper, an ensemble approach, based on decision tree, support vector machine and back-propagation network, is applied to classify spam e-mails. The proposed approach is based on the characteristics of the spam e-mails. The spam e-mails are categorized into 14 features and then the ensemble approach is performed to classify them. From simulation results, the proposed ensemble approach outperforms other approaches for two test datasets.

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

spam
ensemble
decision tree
support vector machine


A continuous description of discrete data points in informetrics Using spline functions Purpose - The paper aims to propose the use of spline functions for the description and visualization of discrete informetric data. Design/methodology/approach - Interpolating cubic splines: are interpolating functions (they pass through the given data points); are cubic, i.e. are polynomials of third degree; have first and second derivatives in the data points, implying that they connect data points in a smooth way; satisfy a best-approximation property which tends to reduce curvature. These properties are illustrated in the paper using real citation data. Findings - The paper reveals that calculating splines yields a differentiable function that still captures small but real changes. It offers a middle way between connecting discrete data by line segments and providing an overall best-fitting curve. Research limitations/implications - The major disadvantage of the use of splines is that accurate data are essential. Practical implications - Spline functions can be used for illustrative as well as modelling purposes. Originality/value - Splines have hardly ever been used or studied in the information sciences.

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

spline functions
discrete data
visualization
citation data

differentiable functions
data handling
information science


Estimation of global solar radiation using ANN over Turkey The main objective of the present study is to develop an artificial neural network (ANN) model based on multi-nonlinear regression (MNLR) method for estimating the monthly mean daily sum global solar radiation at any place of Turkey. For this purpose, the meteorological data of 31 stations spread over Turkey along the years 20002006 were used as training (27 stations) and testing (4 stations) data. Firstly, all independent variables (latitude, longitude, altitude, month, monthly minimum atmospheric temperature, maximum atmospheric temperature, mean atmospheric temperature, soil temperature, relative humidity, wind speed, rainfall, atmospheric pressure, vapor pressure, cloudiness and sunshine duration) were added to the Enter regression model. Then, the Stepwise MNLR method was applied to determine the most suitable independent (input) variables. With the use of these input variables, the results obtained by the ANN model were compared with the actual data, and error values were found within acceptable limits. The mean absolute percentage error (MAPE) was found to be 5.34% and correlation coefficient (R) value was obtained to be about 0.9936 for the testing data set.

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

global solar radiation
estimation
turkey

artificial neural networks
stepwise multi-nonlinear regression


Fast factorization by similarity of fuzzy concept lattices with hedges The paper presents results on factorization by similarity of fuzzy concept lattices with hedges. A fuzzy concept lattice is a hierarchically ordered collection of clusters extracted from tabular data. The basic idea of factorization by similarity is to have, instead of a possibly large original fuzzy concept lattice, its factor lattice. The factor lattice contains less clusters than the original concept lattice but, at the same time, represents a reasonable approximation of the original concept lattice and provides us with a granular view on the original concept lattice. The factor lattice results by factorization of the original fuzzy concept lattice by a similarity relation. The similarity relation is specified by a user by means of a single parameter, called a similarity threshold. Smaller similarity thresholds lead to smaller factor lattices, i.e. to more comprehensible but less accurate approximations of the original concept lattice. Therefore, factorization by similarity provides a trade-off between comprehensibility and precision. We first describe the notion of factorization. Second, we present a way to compute the factor lattice directly from input data, i.e. without the need to compute the possibly large original concept lattice. Third, we provide an illustrative example to demonstrate our method.

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

concept lattice
similarity
factorization

data analysis
formal concept analysis
fuzzy attribute


Modeling individual cognitive structure in contextual information retrieval ? In contextual information retrieval (CIR), the retrieval of information depends on the time and place of the submitting query, history of interaction, task in hand, and many other factors that are not given explicitly, but lie implicitly in the interaction and surroundings of searching, namely the context [P. Ingwersen, N. Belkin, Information retrieval in context, ACM SIGIR Forum 2 (2004)]. A users individual cognition is one of important contextual factors to help understand his or her personal needs. In this paper, we give a formal definition for a users individual cognitive structure (ICS) in CIR, and propose an approach called DOSAM to model it. DOSAM is inspired by the spreading activation model of psychology, and built on the domain ontology, while its goal is to get a users cognitive structure. Cost analysis of construction algorithm shows that it is feasible to get ICS by DOSAM, and personalized search experimental results on a digital library indicate that ICS based search can improve the search effectiveness and a users satisfaction.

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

contextual information retrieval
individual cognitive structure
spreading activation model
domain ontology


Fuzzy transforms: Theory and applications The technique of direct and inverse fuzzy (F-)transforms of three different types is introduced and approximating properties of the inverse F-transforms are described. All three types of the direct F-transform are transformations from a function space to a finite dimensional vector space. The first (ordinary) F-transform is constructed on the basis of the ordinary algebra of reals, while the other two types of the F-transform are constructed on the basis of residuated lattice. The core idea of the technique of F-transforms is a fuzzy partition of a universe into fuzzy subsets (factors, clusters, granules etc.). We claim that for a sufficient representation of a function defined on this universe, we may consider its average values over fuzzy subsets from the partition. Thus, a function can be associated with a mapping from a set of fuzzy subsets to the set of its thus obtained average values. A number of theorems establishing best approximation properties of the inverse F-transforms are proved. In fact, three types of the inverse F-transform are the best approximations in average, from below, and from above respectively. As one of many possible applications, we present a method of image compression and reconstruction on the basis of the Ftransform. (c) 2005 Elsevier B.V. All rights reserved.

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

universal approximation
fuzzy transform
data compression


Standard bases in K[[t(1),..., t(m)]][x(1),..., x(n)](s) In this paper we study standard bases for submodules of K\\t(1),..., t(m)\\\x(1),..., x(n)\(s) respectively of their localisation with respect to a t-local monomial ordering. The main step is to prove the existence of a division with remainder generalising and combining the division theorems of Grauert-Hironaka and Mora. Everything else then translates naturally, Setting either m = 0 or n = 0 we get standard bases for polynomial rings respectively for power series rings as a special case. We then apply this technique to show that the t-initial ideal of an ideal over the Puiseux series field can be read of from a standard basis of its generators. This is an important step in the constructive proof that each point in the tropical variety of such an ideal admits a lifting. (C) 2008 Elsevier Ltd. All rights reserved.

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

standard basis
monomial ordering
division with remainder
power series


Fuzzy Optimal Solution for Unbalanced Fully Fuzzy Minimal Cost Flow Problems To the best of our knowledge, till now there is no method in the literature to find the fuzzy optimal solution of unbalanced fully fuzzy minimal cost flow (FFMCF) problems. In this paper, a new method is proposed to find the fuzzy optimal solution of these problems. The proposed method is illustrated with the help of a numerical example. Also, the proposed method is used to find the fuzzy optimal solution of an unbalanced real life FFMCF problem.

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

fuzzy linear programming
lr flat fuzzy number


Concurrent event handling through multithreading Exceptions have traditionally been used to handle infrequently occurring and unpredictable events during normal program execution. Current trends in microprocessor and operating systems design continue to increase the cost of event handling. Because of the deep pipelines and wide out-of-order superscalar architectures of contemporary microprocessors, an event may need to nullify a large number of in-flight instructions. Large register files require existing software systems to save and restore a substantial amount of process state before executing an exception handler. At the same time, processors are executing in environments that supply higher event frequencies and demand higher performance. We have developed an alternative architecture, Concurrent Event Handling, that incorporates multithreading into event handling architectures. Instead of handling the event in the faulting thread's architectural and pipeline registers, the fault handler is forked into its own thread slot and executes concurrently with the faulting thread. Microbenchmark programs show a factor of 3 speedup for concurrent event handling over a traditional architecture on code that takes frequent exceptions. We also demonstrate substantial speedups on two event-based applications. Concurrent Event Handling is implemented in the MIT Multi-ALU Processor (MAP) chip.

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


flow graphs for testing sequential erlang programs Testing of software components during development is a heavily used approach to detect programming errors and to evaluate the quality of software. Systematic approaches to software testing get a more and more increasing impact on software development processes. For imperative programs there are several approaches to measure the appropriateness of a set of test cases for a program part under testing. Some of them are source code directed and are given as coverage criteria on flow graphs.This paper gives a definition of flow graphs for Erlang programs and describes a tool for generating such flow graphs. It provides a first step towards the transfer of advanced source code directed testing methods to functional programming.

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


optimization of a cyclic queue for mobile dentistry We consider the allocation of mobile dentistry resources to a scattered population. A cyclic queueing network is used to model the allocation process. The resulting model may be transformed to a geometric program. Numerical results are given.

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


on simulating episodic events against a background of noise-like non-episodic events Simulation, as an art and a science, deals with the issue of allowing the practitioner to model events using their respective probability distributions. Thus, it is customary for simulations to model the behaviour of accidents, telephone calls, network failures etc. In this paper, we consider a relatively new field, namely that of modelling episodic events such as earthquakes, nuclear explosions etc. The difficulty with such a modelling process is that most of the observations appear as noise. However, when the episodic event does occur, its magnitude and features far overshadow the background, as one observes after a seismic event. In this paper, we demonstrate how the effect of a particular form of episodic event can be modelled as it propagates through the underlying background noise. Furthermore, we illustrate how the subsequent decay of the event can also be modelled and simulated. In demonstrating this concept, we utilize the exemplar scenario posed by the Comprehensive Nuclear-Test-Ban Treaty (CTBT), and model the propagation and decay of radionuclides, emitted from clandestine, subterranean nuclear detonations, through the background levels resulting from the global nuclear industry.

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

pattern recognition
gaussian dispersion
data generation


An efficient distributed power control for infeasible downlink scenarios - Global-local fixed-point-approximation technique In this paper, we present an efficient downlink power control scheme, for wireless networks, based on two key ideas: (i) global-local fixed-point-approximation technique (GLOFPAT) and (ii) bottleneck removal criterion (BRC). The proposed scheme copes with all scenarios including infeasible case where no power allocation can provide all multiple accessing users with target quality of service (QoS). For feasible case, the GLOFPAT efficiently computes a desired power allocation which corresponds to the allocation achieved by conventional algorithms. For infeasible case, the GLOFPAT offers valuable information to detect bottleneck users, to be removed based on the BRC, which deteriorate overall QoS. The GLOFPAT is a mathematically-sound distributed algorithm approximating desired power allocation as a unique fixed-point of an isotone mapping. The unique fixed-point of the global mapping is iteratively computed by fixed-point-approximations of multiple distributed local mappings, which can be computed in parallel by base stations respectively. For proper detection of bottleneck users, complete analysis of the GLOFPAT is presented with aid of the Tarski's fixed-point theorem. Extensive simulations demonstrate that the proposed scheme converges faster than the conventional algorithm and successfully increases the number of happy users receiving target QoS.

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

bottleneck removal criterion
distributed power control


An improved anisotropic diffusion model for detail- and edge-preserving smoothing It is important in image restoration to remove noise while preserving meaningful details such as blurred thin edges and low-contrast fine features. The existing edge-preserving smoothing methods may inevitably take fine details as noise or vice versa. In this paper, we propose a new edge-preserving smoothing technique based on a modified anisotropic diffusion. The proposed method can simultaneously preserve edges and fine details while filtering out noise in the diffusion process. The classical anisotropic diffusion models consider only the gradient information of a diffused pixel, and cannot preserve detailed features with low gradient. Since the fine details in the neighborhood of the image generally have larger gray-level variance than the noisy background, the proposed diffusion model incorporates both local gradient and gray-level variance to preserve edges and fine details while effectively removing noise. Experimental results from a variety of test samples including shoulder patch images, medical images and artwork images have shown that the proposed anisotropic diffusion scheme can effectively smooth noisy background, yet well preserve edge and fine details in the restored image.

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

edge-preserving smoothing
image denoising


An iterative Lavrentiev regularization method This paper presents an iterative method for the computation of approximate solutions of large linear discrete ill-posed problems by Lavrentiev regularization. The method exploits the connection between Lanczos tridiagonalization and Gauss quadrature to determine inexpensively computable lower and upper bounds for certain functionals. This approach to bound functionals was first described in a paper by Dahlquist, Eisenstat, and Golub. A suitable value of the regularization parameter is determined by a modification of the discrepancy principle.

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

regularization
lanczos tridiagonalization
gauss quadrature
discrepancy principle


An impulsive diffusion predator-prey system in three-species with Beddington-DeAngelis response This paper is purported to investigate an impulsive diffusion predator-prey system in three-species with Beddington-DeAngelis response in a bounded domain with no flux boundary condition. Employing the upper and lower solution method and compare theory, we investigate the sufficient conditions of the upper ultimate boundedness and permanence of this system which imply that impulse always changes the situation of survival for species. The conditions for the existence of unique globally stable positive periodic solution are also obtained.

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


Triangular bubble spline surfaces We present a new method for generating a Gn G n -surface from a triangular network of compatible surface strips. The compatible surface strips are given by a network of polynomial curves with an associated implicitly defined surface, which fulfill certain compatibility conditions. Our construction is based on a new concept, called bubble patches, to represent the single surface patches. The compatible surface strips provide a simple Gn G n -condition between two neighboring bubble patches, which are used to construct surface patches, connected with Gn G n -continuity. For n?2 n ? 2 , we describe the obtained Gn G n -condition in detail. It can be generalized to anyn?3 n ? 3 . The construction of a single surface patch is based on GordonCoons interpolation for triangles. Our method is a simple local construction scheme, which works uniformly for vertices of arbitrary valency. The resulting surface is a piecewise rational surface, which interpolates the given network of polynomial curves. Several examples of G0 G 0 , G1 G 1 and G2 G 2 -surfaces are presented, which have been generated by using our method. The obtained surfaces are visualized with reflection lines to demonstrate the order of smoothness.

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

network of compatible surface strips
gordoncoons interpolation for triangles

gn g n -surface gn g n gn g n g n
triangular bubble patch


Computing behavior of finite fuzzy machines Algorithm and its application to reduction and minimization We define finite fuzzy machines and investigate their behavior. Algorithm and software are proposed for computing behavior, for establishing equivalence and redundancy of states and for solving reduction and minimization problems. Computational complexity of the algorithm is discussed. Testing examples are supplied. The results are valid for finite maxmin, minmax and maxproduct fuzzy machines.

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

behavior equivalence reduction minimization


Optimum electrode path generation for EDM manufacturing of aerospace components An optimized electrode path generation algorithm has been presented. The algorithm can be used to manufacture aerospace components by EDM. An objective function has been proposed to obtain smooth path and stable erosion. The chosen optimization method ensures a large electrode and low computational cost. The developed work has been validated applying it to the erosion of a shrouded blisk.

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

electrical discharge machining
aerospace component


computational algorithms for product form queueing networks In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.

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

mean
queueing networks
value
product
systems
communication networks
analysis

network
queue
model
algorithm
performance evaluation
product form
computation


High order X-FEM and levelsets for complex microstructures: Uncoupling geometry and approximation In this contribution, a strategy is proposed for uncoupling geometrical description and approximation with the X-FEM. The strategy is based on an uniform coarse mesh that defines a high order approximation of the mechanical fields and an adapted mesh that defines the geometrical features by means of levelsets. The connection between the geometry and the approximation is obtained by sharing the quadtree trees of the two meshes. Numerical examples involving level-set based parts, convergence studies, mechanical computations and numerical homogenization show good promise for this approach.

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

partition of unity
x-fem
image-based computations
nitsches method


InfraStructs: Fabricating Information Inside Physical Objects for Imaging in the Terahertz Region We introduce InfraStructs, material-based tags that embed information tion inside digitally fabricated objects for imaging in the Terahertz region. Terahertz imaging can safely penetrate many common materials, opening up new possibilities for encoding hidden information as part of the fabrication process. We outline the design, fabrication, imaging, and data processing steps to fabricate information inside physical objects. Prototype tag designs are presented for location encoding, pose estimation, object identification, data storage, and authentication. We provide detailed analysis of the constraints and performance considerations for designing InfraStruct tags. Future application scenarios range from production line inventory, to customized game accessories, to mobile robotics.

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

terahertz imaging data encoding materials

digital fabrication
thz
sensing
3d printer
laser cutter


inductive, coinductive, and pointed types An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for which general recursion is possible. The motivations for this work are certain natural constructions in category theory, in particular the notion of an algebraically bounded functor, due to Freyd. We propose that this is a particularly elegant core language in which to work with recursive objects, since the potential for general recursion is contained in a single operator which interacts well with the facilities for bounded iteration and coiteration.

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

recursion
language
types
lambda calculus
theory
general
core
class

structure motivation object operability extensibility inductance iter


Static analysis of real-time component-based systems configurations Nowadays, more and more often, complex systems are built by assembling together different system components. This technology also affects the construction of heterogeneous and/or hybrid systems where components can represent hardware sensors, software controllers, etc. Moreover the resulting system is normally distributed. These systems have often real-time constraints/ requirements and each component is characterized by its own speed determined by its local clock. In this paper we present a framework to specify and statically analyze the architecture of a system as a network of (parallel) components, each one with its own local clock. Configuring the system means to formally define how to get the global clock out of the local clocks. This clock configuration step is "optimal" that is, it is the best way to relate the local clocks so that the maximum number of synchronizations in the system can happen. Besides the usual behavioral and timing analysis, it is, for example, possible to verify if, and how changing the local speed of a component can affect the global performance of the system. Components behaviors are specified by means of a simple process algebra. Local clocks are modeled as higher order terms in a given signature, and unification is used to define the common clock. Then an operational semantics defines which transitions a process can perform and which transitions let time to elapse. A set of case studies illustrate the approach. (C) 2002 Elsevier Science B.V. All rights reserved.

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


Improving rate allocation for ephemeral traffic using a second-order algorithm Proportional fairness criterion which has been proposed the first time by F.P. Kelly and his colleagues has a number of properties in allocating users rates. For example, it resembles the AIMD in the TCP-Reno (Jacobson, 1988) in rate allocation to users and there exists a well-established stability analysis in Kellys work relating to stability of rate allocation algorithm. Another outstanding feature is that Kelly et al. try to solve the optimization problem of maximizing the aggregate utility of users in a distributed manner by decomposing the overall system problem into two sub-problems that can be solved by network and individual users by introducing a pricing scheme (Gibbens and Kelly, 1998). In the current paper, a new high-speed second-order rate allocation algorithm has been proposed which is based on the Jacobi method. The performance of the algorithm, under users arrival and departure and background variable bit-rate traffic is evaluated in comparison with the conventional Kellys algorithm. Simulation results show that proposed method outperforms that of Kelly in convergence rate and is particularly suitable for ephemeral (short-lived) users.

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

ephemeral traffic
rate allocation
fairness


A collocation method for solving singular integro-differential equations This paper describes a collocation method for numerically solving Cauchy-type linear singular integro-differential equations. The numerical method is based on the transformation of the integro-differential equation into an integral equation, and then applying a collocation method to solve the latter. The collocation points are chosen as the Chebyshev nodes. Uniform convergence of the resulting method is then discussed. Numerical examples are presented and solved by the numerical techniques.

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

integro-differential equation
cauchy singular integral-equation


Performance-controlled server consolidation for virtualized data centers with multi-tier applications ? Modern data centers must provide performance assurance for complex system software such as multi-tier web applications. In addition, the power consumption of data centers needs to be minimized to reduce operating costs and avoid system overheating. Various power-efficient performance management strategies have been proposed based on dynamic voltage and frequency scaling (DVFS). Virtualization technologies have also made it possible to consolidate multiple virtual machines (VMs) onto a smaller number of active physical servers for even greater power savings, but at the cost of a higher overhead. This paper proposes a performance-controlled power optimization solution for virtualized server clusters with multi-tier applications. While most existing work relies on either DVFS or server consolidation in a separate manner, our solution utilizes both strategies for maximized power savings by integrating feedback control with optimization strategies. At the application level, a novel multi-inputmulti-output controller is designed to achieve the desired performance for applications spanning multiple VMs, on a short time scale, by reallocating the CPU resources and conducting DVFS. At the cluster level, a power optimizer is proposed to incrementally consolidate VMs onto the most power-efficient servers on a longer time scale. Empirical results on a hardware testbed demonstrate that our solution outperforms pMapper, a state-of-the-art server consolidation algorithm, by having greater power savings and smaller consolidation overheads while achieving the required application performance. Extensive simulation results, based on a trace file of 5415 real servers, demonstrate the efficacy of our solution in large-scale data centers.

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

data centers
server consolidation
virtualization

power management
multi-tier web applications
control theory


LLVMVF: A Generic Approach for Verification of Multicore Software Proliferation of multicore hardware boosted the need for verification of multicore software that is running on these hardware. Multicore software demands new verification techniques different from the ones used for sequential software. Many optimized compiler frameworks are arising to address the complexities of multicore software. Among these compilers, Low Level Virtual Machine (LLVM) is especially gaining popularity because i) has a universal front-end that allows to read in many different input languages, ii) aggressive optimizations to improve code performance and quality, and iii) a well-defined intermediate bytecode representation, called LLVM IR, that allows a unified intermediate representation. In this work, we present a novel framework, called LLVM Verification Framework (LLVMVF), implemented in a purely functional language for verification of multicore software. To our knowledge, this is the first verification framework using the LLVM bytecode representation for multicore software. We present an SMT-based Bounded Model Checker backend of LLVMVF and perform initial experiments on multicore software using Pthreads library. Furthermore, we compare our results with an existing multicore software verification tool.

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

computer-aided verification
formal verification
multithreaded programs


a new algorithm for reconstruction of phylogenetic tree The abstract should summarize the contents of the paper and should contain at least 70 and at most 150 words. It should be set in 9-point font size and should be inset 1.0 cm from the right and left margins. There should be two blank (10-point) lines before and after the abstract. This document is in the required format. In this paper, we present a new algorithm for reconstructing large phylogenetic tree. This algorithm is based on a family of Disk-Covering Methods (DCMs) which are divide-and-conquer techniques by dividing input dataset into smaller overlapping subset, constructing phylogenetic trees separately using some base methods and merging these subtrees into a single one. Provided the high memory efficiency of RAxML (which the program inherited from fastDNAml) compared to other programs and the good performance on largereal-world data it appears to be best-suited for use as the base method. The experiments clearly show that the proposed algorithm improves over stand-alone RAxML on all datasets, i.e. yields better likelihood values than RAxML in the same amount of time. This results serve as an argument for the choice of the proposed algorithm instead of stand-alone RAxML.

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


Inferring laser-scan matching uncertainty with conditional random fields ? This paper proposes a novel algorithm for computing robot motion estimates from ranging sensors. The algorithm utilises the recently proposed CRF-Matching procedure which matches laser scans based on shape descriptors. The motion estimates are computed in a sound probabilistic framework by performing inference on a probabilistic graphical model. The Sampling-Product inference algorithm is proposed for obtaining probable association hypothesis from the probabilistic model. The hypothesis are used to generate estimates on the uncertainty of translational and rotational movements of the mobile robot. Experiments demonstrate the benefits of the approach on simulated data sets and on laser scans from an urban environment. The approach is also combined with the well-established delayed-state information filter for a large-scale outdoor simultaneous localisation and mapping task.

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

simultaneous localisation and mapping (slam)


An embedded system for knowledge-based cost evaluation of molded parts In this paper, we present an embedded knowledge-base system and apply it to estimate the manufacturing cost of molded parts. This system is designed on a tiny single board computer, called the Gumstix, which is an inexpensive and high-performance miniaturized platform. It consists of a knowledge-base, knowledge processing units and server service unit for user interactions, all of which are implemented on the Gumstix computer. A CAD server is provided for the interaction with commercial CAD software and all operations with users are performed via a web browser. This hardware and software structure features a realization of the Plug & Play concept and provides low-cost, low-power consumption, high-performance and high portability of complex engineering software. The system is demonstrated with cost estimation of molded parts. A knowledge set for the injection molding process is formalized in XML and a knowledge-base is constructed. The system is tested with examples, which illustrate the capability of our system for engineering applications.

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

knowledge-base
manufacturing cost evaluation