EAR: An Energy and Activity-Aware Routing Protocol for Wireless Sensor Networks in Smart Environments A sensor network, unlike a traditional communication network, is deeply embedded in physical environments and its operation is mainly driven by the event activities in the environment. In long-term operations, the event activities usually show certain patterns that can be learned and exploited to optimize the network design. However, this has been underexplored in the literature. One work related to this is using Activity Transition Probability Graph (ATPG) for radio duty cycling [Tang et al. (2011) ActSee: Activity-Aware Radio Duty-Cycling for Sensor Networks in Smart Environments. Proc. IEEE INSS 2011, Penghu, Taiwan, June 12-15. IEEE Press]. In this paper, we present a novel Energy and Activity-aware Routing (EAR) protocol for sensor networks. As a case study, we have evaluated EAR with the data trace of real Smart Environments. In EAR an ATPG is learned and built from the event activity patterns. EAR is an online routing protocol, that chooses the next-hop relay node by utilizing: activity pattern information in the ATPG graph and a novel index of energy balance in the network. EAR extends the network lifetime by maintaining an energy balance across the nodes in the network, while meeting the application performance with desired throughput and low data delivery latency. We theoretically prove that: (i) the network throughput with EAR achieves a competitive ratio (i.e. the ratio of the performance of any offline algorithm that has knowledge of all past and future packet arrivals to the performance of our online algorithm) that is asymptotically optimal, and (ii) EAR achieves a lower bound in the network lifetime. Extensive experimental results from: (i) a 82 node Motelab sensor network testbed [Werner-Allen et al. (2005) MoteLab: A Wireless Sensor Network Testbed. Proc. ACM IPSN 2005, Los Angeles, CA, USA, April 25-27, pp. 483-488. IEEE Press, NJ, USA] and (ii) a varying size network (20-100) in sensor network simulator TOSSIM, validate that EAR outperforms the existing methods both in terms of network performance (network lifetime, network energy consumption) and application performance (low latency, desired throughput) for an energy-constrained sensor network.

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

routing
energy balance
competitive ratio
wireless sensor networks
smart environments


On some aspects of fuzzy logic application in machine monitoring and diagnostics This paper discusses selected aspects of fuzzy logic (FL) application in machine monitoring and diagnostics. In the first part of the paper, a general idea of FL application is depicted. A concept of Intelligent Monitoring System is defined and its practical implementation in the form of Intelligent Monitoring System Designer is considered. Then, a short characteristics of the applied FL system is presented. The discussion focuses on methods for designing of fuzzy rule base. In the second part of the paper, selected examples of FL system application are shown in order to analyse applicability of the considered methods. The cutting tool wear monitoring is analysed. Thermal deformation monitoring and burr height modelling are shortly discussed, as well. In addition, the results achieved with the feed forward back propagation neural network are presented to generalise the assessment of performance of the FL systems designed.

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

automatic rule generation
machine tools and cutting process
neural networks


Built-in self-test of global interconnects of field programmable analog arrays Strategies for the test of Field Programmable Analog Arrays (FPAAs) have been devised based on testing separately their main three components: configurable analog blocks, I/O pads and interconnection network. In this work, a scheme for testing the interconnection network, in particular the global wiring, is presented. As long as analog wiring is considered, catastrophic faults at the switches and wires are considered, as well as parametric capacitive or resistive defects in interconnects. Similarly to FPGAs, critical path search is based on a graph model, so that known algorithms are reused, yielding a minimum number of Test Configurations. Then, a near-zero area overhead BIST procedure is proposed, in which Analog Built-in Block Observers are implemented as oscillators and integrators, respectively, generating test stimuli and analyzing output responses, using internal configurable resources of the FPAA.

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

global interconnection
graph modeling
ora
abilbo


?-Subgame Perfectness of an Open-Loop Stackelberg Equilibrium in Linear-State Games Open-loop Stackelberg equilibria in linear-state games are subgame perfect. This result holds under the hypothesis of unconstrained final state; whereas we need to take into account suitable final-state conditions in order to correctly formalize certain economic problems. A striking contribution of this paper is that it tackles the consistency problem for an open-loop Stackelberg equilibrium in linear-state games with a final-state constraint in the leaders problem. In this paper, after proving that such a type of equilibrium is not subgame perfect, we introduce a weaker definition of subgame perfectness, which we call ?-subgame perfectness. This new definition can be applied to the open-loop Stackelberg equilibrium of a constrained linear-state game. Finally, we present some explanatory examples to show how the definition of ?-subgame perfectness can be meaningful.

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

linear-state differential games
open-loop stackelberg equilibria
time consistency


"Don't trust anyone": Privacy protection for location-based services We present a decentralized approach that exploits the capability of mobile devices to form wireless personal ad-hoc networks in order to protect the privacy of users who access location-based services. The novelty of our approach is that users do not need to trust any party such as an intermediary server or peers with their locations and identities. We propose efficient algorithms for users to compute a k-anonymous imprecise location and to randomly select one of her peers with uniform probability who forwards the service request on behalf of the user. Our experimental evaluation shows that using our approach a user can enjoy a high quality of service with a high degree of privacy. (C) 2010 Elsevier B.V. All rights reserved.

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

anonymity
location-based service
obfuscation


Network numerical analysis for the smoother and the lagged joint-process estimator Motivated by the fact that the a priori least-squares-order-recursive lattice (LSORL) smoother is more robust than the LSORL joint-process estimator with lagged desired signals in the finite precision, we model numerical properties of the two algorithms by virtue of previous efforts. Then, we give the reason why the smoother is substantially more robust than the lagged joint-process estimator by providing the explicit analysis for the performance difference of the two algorithms.

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


H-bond refinement for electron transfer membrane-bound proteinprotein complexes: Cytochrome c oxidase and cytochrome c552 Cytochrome c552 surface lysine residues are crucial for proteinprotein recognition. Residue TRP121 behaves as the entry site in the electron transfer process. Hydrogen bond network optimizations need to be included in simulation protocols.

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

docking
membrane
dppc
molecular dynamics


Algorithm and architecture for logarithm, exponential, and powering computation An architecture for the computation of logarithm, exponential, and powering operations is presented in this paper, based on a high-radix composite algorithm for the computation of the powering function (XY). The algorithm consists of a sequence of overlapped operations: 1) digit-recurrence logarithm, 2) left-to-right carry-free (LRCF) multiplication, and 3) online exponential. A redundant number system is used and the selection in 1) and 3) is done by rounding except from the first iteration, when selection by table look-up is necessary to guarantee the convergence of the recurrences. A sequential implementation of the algorithm, with a control unit which allows the independent computation of logarithm and exponential, is proposed and the execution times and hardware requirements are estimated for single and double-precision floating-point computations. These estimates are obtained for radices from r = 8 to r = 1,024, according to an approximate model for the delay and area of the main logic blocks and help determining the radix values which lead to the most efficient implementations: r = 32 and r = 128.

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

logarithm
exponential
powering
lrcf multiplication

computer arithmetic
elementary function approximation
digit-recurrence algorithms
high-radix
online arithmetic


Noncoherent versus coherent MIMO radar: Performance and simplicity analysis MIMO radar with properly placed antennas that employs a coherent processing approach can provide superior MSE performance, as indicated by recent work. This paper demonstrates that the magnitude of these gains decreases with an increase in the product of the number of transmit and receive antennas if the antennas for the noncoherent system are also suitably placed, using a placement which is generally different from the one for the coherent processing approach. Initially, we study the systems without constraining the complexity and energy, where each added transmit antenna employs a fixed energy so that the total transmitted energy is allowed to increase as we increase the number of transmit antennas. Later we also look at constrained systems, where adding a transmit antenna splits the total system energy and the total number of antennas employed is restricted. A rigorous theorem is presented for the case of orthogonal signals in temporally and spatially white clutter-plus-noise, but numerical results for nonorthogonal signals and colored clutter-plus-noise follow a similar pattern.

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

estimation
mean square error
multiple-input multiple-output radar


evaluating the performance boundaries of wi-fi, wimax and umts using the network simulator (ns-2) Currently, the different wireless technologies available allow users to access the Internet under the "always on" paradigm. Therefore, switching from one wireless technology to another, a process known as vertical handover, is often required. It is very important for vertical handover agents to know the performance of each candidate wireless network in order to switch into a network that fulfills the applications' requirements. In this work we present a performance evaluation of the main wireless technologies currently in use by mobile devices: Wi-Fi, WiMAX and UMTS. In our set of experiments we tested various schemes with different parameters for each technology, including modulation and channel bandwidth. Using the Network Simulator ns-2, we evaluate the performance of each network technology under different network congestion conditions. Results show that each technology offers different data rates, depending on the selected parameters. Moreover, we found that bandwidth availability status becomes of utmost importance for successful vertical handover.

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


A CROWDSOURCED APPROACH FOR CONCERN-SENSITIVE INTEGRATION OF INFORMATION ACROSS THE WEB Currently, users navigate across the Web in order to accomplish complex tasks. Frequently, these tasks involve working with many different Web applications. For this kind of tasks users have to move information manually among Web pages. While in the field of Adaptive Web there is important and meaningful research about adapting Web sites according with the user's activity most adaptation approaches are applied only in the boundaries of single Web applications. In this work we show to use Client-Side adaptation to provide new techniques for concern-sensitive, task-based adaptations across the Web. We show an architectural overview of our tool and illustrate the power of the approach with examples.

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

concern-sensitive navigation
information integration
client-side adaptation


Optimal surface parameterization using inverse curvature map Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortion. Angle distortion can be eliminated by the use of conformal mapping, in principle. Our paper focuses on solving the problem of finding the best discrete conformal mapping that also minimizes area distortion. First, we deduce an exact analytical differential formula to represent area distortion by curvature change in the discrete conformal mapping, giving a dynamic Poisson equation. On a mesh, the vertex curvature is related to edge lengths by the curvature map. Our result shows the map is invertible, i.e., the edge lengths can be computed from the curvature ( by integration). Furthermore, we give the explicit Jacobi matrix of the inverse curvature map. Second, we formulate the task of computing conformal parameterizations with least area distortions as a constrained nonlinear optimization problem in curvature space. We deduce explicit conditions for the optima. Third, we give an energy form to measure the area distortions, and show that it has a unique global minimum. We use this to design an efficient algorithm, called free boundary curvature diffusion, which is guaranteed to converge to the global minimum; it has a natural physical interpretation. This result proves the common belief that optimal parameterization with least area distortion has a unique solution and can be achieved by free boundary conformal mapping. Major theoretical results and practical algorithms are presented for optimal parameterization based on the inverse curvature map. Comparisons are conducted with existing methods and using different energies. Novel parameterization applications are also introduced. The theoretical framework of the inverse curvature map can be applied to further study discrete conformal mappings.

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

conformal parameterization
metric
inverse map


THE STEADY-STATE IMPEDANCE OPERATOR OF A LINEAR PERIODICALLY TIME-VARYING ONE-PORT NETWORK AND ITS DETERMINATION The main subject of the paper is the description and determination of the impedance operator of a linear periodically time-varying (LPTV) one-port network in the steady-state. If the one-port network parameters and the supply vary periodically with the same period, the network reaches a periodic steady state. However, the sinusoidal supply may induce a non-sinusoidal voltage or current. It is impossible to describe such a phenomenon by means of one complex number. A periodically time-varying one-port network working in a steady-state regime can be described with a circular parametric operator. Within the domain of discrete time, such an operator takes the form of a matrix with real-valued entries. The circular parametric operator can be transformed into the frequency domain using a two-dimensional DFT. This description makes it possible to quantitatively assess LPTV system input and output harmonics aliasing. The paper also presents the derivation and the proof of convergence of an iteration scheme for the identification of circular parametric operators. The scheme may be used to determine the impedance of an LPTV one-port network. Some results of computer simulations are shown.

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

periodic steady state
circular parametric operator
harmonics aliasing
identification

periodically time-varying impedance
linear periodically time-varying system


The effects of radiation on combustion in porous media We present a mathematical model which describes the conversion of a gas fuel, or pollutant, inside a catalytic converter. After indicating how radiative heat effects can be described using a nonlinear diffusion term, we then show that including radiation in the model does not alter the qualitative behavior of steady state solutions. However, it does reduce both the maximum solid temperature and the region of parameter space in which optimal operation of the system-complete conversion of the gaseous fuel-occurs.

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


A novel approach to determine minimal tie-sets of complex network Network reliability analysis is usually based on minimal path or cut enumeration from which the associated reliability expressions are deduced. The cut-set method is a popular approach in the reliability analysis of many systems from simple to complex configurations. The computational requirements necessary to determine the minimal cut-sets of a network depend mainly on the number of minimal paths between the source and the sink. A technique designated as the "Path Tracing Algorithm" is presented in this paper, which can handle both simple and complex networks, and considers both unidirectional and bi-directional branches. A step by step procedure is explained using a bridge-network. The algorithm is easy to program, and does not require limits on the size of the network. The applicability of the proposed technique is illustrated by application to a more complicated system.

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

connection matrix
minimal cut-sets
minimal paths (tie-sets)


WM-DOVA maps for accurate polyp highlighting in colonoscopy: Validation vs. saliency maps from physicians We present WM-DOVA energy maps highlighting image areas likely to contain a polyp. We present the first available database with clinical metadata associated. WM-DOVA maps outperform other localization methods in two different databases. WM-DOVA performs similar to clinicians when searching for polyps in full sequences. Our maps outperform other saliency models, best candidates for clinical practice.

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


Multi-View Gait Based Human Identification System with Covariate Analysis This paper presents a multi-view gait based human identification system. The system is able to perform well under different walking trajectories and various covariate factors such as apparel, loan carrying and speed of walking. Our approach first applies perspective correction to adjust silhouettes from an oblique view to side-view plane. Joint positions of hip, knees and ankles are then detected based on human body proportion. Next, static and dynamic gait features are extracted and smoothed by the Gaussian filter to mitigate the effect of outliers. Feature normalization and selection are subsequently applied before the classification process. The performance of the proposed system was evaluated on SOTON Covariate Database and SOTON Oblique Database from University of Southampton. It achieved 92.1% correct classification rates for both databases.

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

gait recognition
biometrics
covariate factors and classification


Thermal Modeling and Management of DRAM Systems With increasing data rate and power density, high-performance memories have started to require dynamic thermal management (DTM), following the trend of processor and hard drive. There are also lack of a memory thermal model and simulation tools to facilitate the research of memory DTM. This study investigates the approach of coordinating processor, which is the source of memory access requests, and memory to improve system performance and/or power efficiency during memory thermal emergency. Two such schemes, namely adaptive core gating (DTM-ACG) and coordinated DVFS (DTM-CDVFS), are proposed and evaluated on a real server platform. DTM-ACG gates processor cores and DTM-CDVFS scales down the frequency and voltage level of processor cores according to memory thermal emergency level. Their combination, namely DTM-COMB, is also evaluated. The experimental results show that the two schemes, while successfully controlling memory activities and handling thermal emergencies, improve performance significantly under the given thermal envelope. The measurement results from an Intel SR1500AL server testbed show that on average, DTM-ACG and DTM-CDVFS improve performance by 6.7 and 15.3 percent, respectively, over a prior memory bandwidth throttling scheme. DTM-CDVFS also reduces the processor power rate by 15.5 percent and system (including processor and memory) energy by 22.7 percent. Additionally, we propose a DRAM thermal model and validate it with measurement on the instrumented server platform. We find that our proposed model faithfully catches the dynamic DRAM temperature changes; the average difference between the modeled and measured temperature is less than 1 degrees C.

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


anti-phishing based on automated individual white-list In phishing and pharming, users could be easily tricked into submitting their username/passwords into fraudulent web sites whose appearances look similar as the genuine ones. The traditional blacklist approach for anti-phishing is partially effective due to its partial list of global phishing sites. In this paper, we present a novel anti-phishing approach named Automated Individual White-List (AIWL). AIWL automatically tries to maintain a white-list of user's all familiar Login User Interfaces (LUIs) of web sites. Once a user tries to submit his/her confidential information to an LUI that is not in the white-list, AIWL will alert the user to the possible attack. Next, AIWL can efficiently defend against pharming attacks, because AIWL will alert the user when the legitimate IP is maliciously changed; the legitimate IP addresses, as one of the contents of LUI, are recorded in the white-list and our experiment shows that popular web sites' IP addresses are basically stable. Furthermore, we use Nave Bayesian classifier to automatically maintain the white-list in AIWL. Finally, we conclude through experiments that AIWL is an efficient automated tool specializing in detecting phishing and pharming.

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

anti-phishing
anti-pharming
individual white-list
login user interface
naive bayesian classifier


Output-feedback control of nonlinear systems using direct adaptive fuzzy-neural controller In this paper, a direct adaptive fuzzy-neural output-feedback controller (DAFOC) for a class of uncertain nonlinear systems is developed under the constraint that only the system output is available for measurement. An output feedback control law and an update law are derived for on-line tuning the weighting factors of the DAFOC. By using strictly positive-real Lyapunov theory, the stability of the closed-loop system compensated by the DAFOC can be verified. Moreover, the proposed overall control scheme guarantees that all signals involved are bounded and the output of the closed-loop system asymptotically tracks the desired output trajectory. To demonstrate the effectiveness of the proposed method, simulation results are illustrated in this paper. (C) 2002 Elsevier B.V. All rights reserved.

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

output feedback control
nonlinear systems

fuzzy-neural control
direct adaptive control


Design Exploration and Automatic Generation of MPSoC Platform TLMs from Kahn Process Network Applications With increasingly more complex Multi-Processor Systems on Chip (MPSoC) and shortening time-to-market projections, Transaction Level Modeling and Platform Aware Design are seen as promising approaches to efficient MPSoC design. In this paper, we present an automatized 3-phase process of Platform Aware Design and apply it to Kahn Process Networks (KPN) applications, a widely used model of computation for data-flow applications. We start with the KPN application and an abstract platform template and automatically generate an executable TLM with estimated timing that accurately reflects the system platform. We support homogeneous and heterogeneous multi-master platform models with shared memory or direct communication paradigm. The communication in heterogeneous platform modules is enabled with the transducer unit (TX) for protocol translation. TX units also act as message routers to support Network on Chip (NoC) communication. We evaluate our approach with the case study of the H.264 Encoder design process, in which the specification compliant design was reached from the KPN application in less than 2 hours. The example demonstrates that automatic generation of platform aware TLMs enables a fast, efficient and error resilient design process.

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

design
kahn process
automatic generation

performance
process mapping
process network
transaction level model


The representational power of discrete Bayesian networks One of the most important fundamental properties of Bayesian networks is the representational power, reflecting what kind of functions they can or cannot represent. In this paper, we establish an association between the structural complexity of Bayesian networks and their representational power. We use the maximum number of nodes' parents as the measure for the structural complexity of Bayesian networks, and the maximum XOR contained in a target function as the measure for the function complexity. A representational upper bound is established and proved. Roughly speaking, discrete Bayesian networks with each node having at most k parents cannot represent any function containing (k + 1)-XORs. Our theoretical results help us to gain a deeper understanding on the capacities and limitations of Bayesian networks.

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

bayesian networks
representational power


D-WARD: A source-end defense against flooding denial-of-service attacks Defenses against flooding distributed denial-of-service (DDoS) commonly respond to the attack by dropping the excess traffic, thus reducing the overload at the victim. The major challenge is the differentiation of the legitimate from the attack traffic, so that the dropping policies can be selectively applied. We propose D-WARD, a source-end DDoS defense system that achieves autonomous attack detection and surgically accurate response, thanks to its novel traffic profiling techniques, the adaptive response and the source-end deployment. Moderate traffic volumes seen near the sources, even during the attacks, enable extensive statistics gathering and profiling, facilitating high response selectiveness. D-WARD inflicts an extremely low collateral damage to the legitimate traffic, while quickly detecting and severely rate-limiting outgoing attacks. D-WARD has been extensively evaluated in a controlled testbed environment and in real network operation. Results of selected tests are presented in the paper.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-level security and protection
network monitoring
fault tolerance


OM3: Ordered maxitive, minitive, and modular aggregation operators Axiomatic and probabilistic properties in an arity-monotonic setting The recently-introduced OM3 aggregation operators fulfill three appealing properties: they are simultaneously minitive, maxitive, and modular. Among the instances of OM3 operators we find e.g. OWMax and OWMin operators, the famous Hirsch h-index and all its natural generalizations. In this paper the basic axiomatic and probabilistic properties of extended, i.e. in an arity-dependent setting, OM3 aggregation operators are studied. We illustrate the difficulties one is inevitably faced with when trying to combine the quality and quantity of numeric items into a single number. The discussion on such aggregation methods is particularly important in the information resources producers assessment problem, which aims to reduce the negative effects of information overload. It turns out that the Hirsch-like indices of impact do not fulfill a set of very important properties, which puts the sensibility of their practical usage into question. Moreover, thanks to the probabilistic analysis of the operators in an i.i.d. model, we may better understand the relationship between the aggregated items' quality and their producers' productivity.

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

ordered modularity
maxitivity and minitivity
arity-monotonicity
impact assessment
hirsch's h-index
informetrics


Dissecting SpyEye - Understanding the design of third generation botnets Botnet malware is improving with the latest (3rd) generation exemplified by the SpyEye and Zeus botnets. These botnets are important to understand because they target online financial transactions, primarily with banks. In this paper, we analyze the components from multiple generations of the SpyEye botnet in order to understand both how it works and how it is evolving. SpyEye is a sophisticated piece of malware with a modular design that eases the incorporation of improvements. We will discuss in detail the complete framework of SpyEye botnet consisting of the Bot Development Kit (BDK), the plugin architecture, the backend storage server, the bot design and the web-based Command and Control (C&C) management system. In addition, we also examine the techniques used by SpyEye to steal money. Crown Copyright (c) 2012 Published by Elsevier B.V. All rights reserved.

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


Sensor Fusion for SLAM Based on Information Theory We present a sensor fusion management technique based on information theory in order to reduce the uncertainty of map features and the robot position in SLAM. The method is general, has no extra postulated conditions, and its implementation is straightforward. We calculate an entropy weight matrix which combines the measurements and covariance of each sensor device to enhance reliability and robustness. We also suggest an information theoretic algorithm via computing the error entropy to confirm the relevant features for associative feature determination. We validate the proposed sensor fusion strategy in EKF-SLAM and compare its performance with an implementation without sensor fusion. The simulated and real experimental studies demonstrate that this sensor fusion management can reduce the uncertainty of map features as well as the robot pose.

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


Neighborhood hash graph kernel for protein-protein interaction extraction Automated extraction of protein-protein interactions (PPIs) from biomedical literatures is an important topic of biomedical text mining. In this paper, we propose an approach based on neighborhood hash graph kernel for this task. In contrast to the existing graph kernel-based approaches for PPI extraction, the proposed approach not only has the capability to make use of full dependency graphs to represent the sentence structure but also effectively control the computational complexity. We evaluate the proposed approach on five publicly available PPI corpora and perform detailed comparisons with other approaches. The experimental result shows that our approach is comparable to the state-of-the-art PPI extraction system and much faster than all-path graph kernel approach on all five PPI corpora. (C) 2011 Elsevier Inc. All rights reserved.

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

interaction extraction
hash
graph kernel


A low-distortion CMOS IFVGA with linear-in-dB control and temperature compensation A CMOS intermediate-frequency (IF) variable-gain amplifier (VGA) is presented in this paper. A transconductance linearization scheme is proposed for the VGA core based on a signal-subtracting structure to achieve low distortion. Temperature-independent decibel-linear gain control characteristic is achieved by an exponential voltage generator based on transfer characteristics of differential pair. The whole VGA, including a highly-linear output stage, is fabricated in 0.25 mu m CMOS technology. Measurements show that the VGA provides a total gain control range of 43 dB with less than 1.2 dB error over 0-80 degrees C, and a constant 3-dB bandwidth of 100 MHz. The third-order intermodulation (IM3) distortion at differential output of 2 V-PP is better than -55 dB. The VGA dissipates 22.6 mA averagely from 3.3 V supply, and occupies approximately 0.53 mm(2).

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

linear-in-db gain control
signal-subtracting
variable-gain amplifier (vga)


On the maximum number of feasible ranking sequences in multi-criteria decision making problems In many decision problems the focus is on ranking a set of m alternatives in terms of a number, say n, of decision criteria. Given are the performance values of the alternatives for each one of the criteria and the weights of importance of the criteria. This paper demonstrates that if one assumes that the criteria weights are changeable, then the number of all possible rankings may be significantly less than the upper limit of m!. As a matter of fact, this paper demonstrates that the number of possible rankings is a function of the number of alternatives and the number of criteria. These findings are important from a sensitivity analysis point of view or when a group decision making environment is considered.

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

sensitivity analysis
group decision making

deterministic decision making
ranking of alternatives
hyperplanes


Human Perception of Haptic-to-Video and Haptic-to-Audio Skew in Multimedia Applications The purpose of this research is to assess the sensitivity of humans to perceive asynchrony among media signals coming from a computer application. Particularly we examine haptic-to-video and haptic-to-audio skew. For this purpose we have designed an experimental setup, where users are exposed to a basic multimedia presentation resembling a ping-pong game. For every collision between a ball and a racket, the user is able to perceive auditory, visual, and haptic cues about the collision event. We artificially introduce negative and positive delay to the auditory and visual cues with respect to the haptic stream. We subjectively evaluate the perception of inter-stream asynchrony perceived by the users using two types of haptic devices. The statistical results of our evaluation show perception rates of around 100 ms regardless of modality and type of device.

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


Tracing Interrupts in Embedded Software During the system development, developers often must correct wrong behavior in the software-an activity colloquially called program debugging. Debugging is a complex activity, especially in real-time embedded systems because such systems interact with the physical world and make heavy use of interrupts for timing and driving I/O devices. Debugging interrupts is difficult, because they cause non-linear control flow in programs which is hard to reproduce in software. Record/replay mechanisms have proven their use to debugging embedded systems, because they provide means to recreate control flows offline where they can be debugged. In this work, we present the data tracing part of the record/replay mechanism that is specifically targeted to record interrupt behavior. To tune our tracing mechanism, we use the observed principle of return address clustering and a formal model for quantitative reasoning about the tracing mechanism. The presented heuristic and mechanisms show surprisingly good results-up to an 800 percent speedup on the selector function and a 300 percent reduction on duplicates for non-optimal selector functions-considering the leanness of the approach.

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

design
experimentation
debugging real-time systems


A comparison of networked approximators in parallel mode identification of a bioreactor This paper presents a simulation based comparison of Multilayer Perceptron (MLP), Adaptive Neuro-Fuzzy Inference Systems (ANFIS) and Least Squares Support Vector Machines (LS-SVM) in parallel mode identification of a chemical process displaying several challenges. The paper provides a graphical analysis of the nonlinear behavior for the system under investigation, a case study of purely parallel identification scheme, the effects of noise in the training data on the prediction performance and the performance comparison of the standard approaches under limited amount of numerical data. The results have shown that the emulators utilizing the MLP structure are superior to the others in terms of predicting the system trajectories, locating the limit cycle, noise driven response and predicting the steady state conditions given only 582 pairs of training data. Furthermore, as opposed to others, with the MLP structure, these qualities disappear smoothly as the noise level is increased gradually.

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

bioreactor
identification
multilayer perceptron
anfis

support vector machine
chemical process modeling


Outlier modeling in image matching We address the question of how to characterize the outliers that may appear when matching two views of the same scene. The match is performed by comparing the difference of the two views at a pixel level aiming at a better registration of the images. When using digital photographs as input, we notice that an outlier is often a region that has been occluded, an object that suddenly appears in one of the images, or a region that undergoes an unexpected motion. By assuming that the error in pixel intensity generated by the outlier is similar to an error generated by comparing two random regions in the scene, we can build a model for the outliers based on the content of the two views. We illustrate our model by solving a pose estimation problem: the goal is to compute the camera motion between two views. The matching is expressed as a mixture of inliers versus outliers, and defines a function to minimize for improving the pose estimation. Our model has two benefits: First, it delivers a probability for each pixel to belong to the outliers. Second, our tests show that the method is substantially more robust than traditional robust estimators (M-estimators) used in image stitching applications, with only a slightly higher computational complexity.

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

outlier model
outlier rejection
mixture model
robust pose estimation
m-estimators


high-quality unstructured volume rendering on the pc platform For the visualization of volume data the application of transfer functions is used widely. In this area the pre-integration technique allows high quality visualizations and the application of arbitrary transfer functions. For regular grids, this approach leads to a two-dimensional pre-integration table which easily fits into texture memory. In contrast to this, unstructured meshes require a three-dimensional pre-integration table. As a consequence the available texture memory limits the resolution of the pre-integration table and the maximum local derivative of the transfer function. Discontinuity artifacts arise if the resolution of the pre-integration table is too low. This paper presents a novel approach for accurate rendering of unstructured grids using the multi-texturing capabilities of commodity PC graphics hardware. Our approach achieves high quality by reconstructing the colors and opacities of the pre-integration table using the high internal precision of the pixel shader. Since we are using standard 2D multi-texturing we are not limited in the size of the pre-integration table. By combining this approach with a hardware-accelerated calculation of the pre-integration table, we achieve both high quality visualizations and interactive classification updates.

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

graphics hardware
volume rendering
unstructured meshes


A polyhedral study of the maximum edge subgraph problem The study of cohesive subgroups is an important aspect of social network analysis. Cohesive subgroups are studied using different relaxations of the notion of clique in a graph. For instance, given a graph and an integer k k , the maximum edge subgraph problem consists of finding a k k -vertex subset such that the number of edges within the subset is maximum. This work proposes a polyhedral approach for this NP-hard problem. We study the polytope associated to an integer programming formulation of the problem, present several families of facet-inducing valid inequalities, and discuss the separation problem associated to these families. Finally, we implement a branch and cut algorithm for this problem. This computational study illustrates the effectiveness of the classes of inequalities presented in this work.

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


The Only Constant is Change: Incorporating Time-Varying Network Reservations in Data Centers In multi-tenant datacenters, jobs of different tenants compete for the shared datacenter network and can suffer poor performance and high cost from varying, unpredictable network performance. Recently, several virtual network abstractions have been proposed to provide explicit APIs for tenant jobs to specify and reserve virtual clusters (VC) with both explicit VMs and required network bandwidth between the VMs. However, all of the existing proposals reserve a fixed bandwidth throughout the entire execution of a job. In the paper, we first profile the traffic patterns of several popular cloud applications, and find that they generate substantial traffic during only 30%-60% of the entire execution, suggesting existing simple VC models waste precious networking resources. We then propose a fine-grained virtual network abstraction, Time-Interleaved Virtual Clusters (TIVC), that models the time-varying nature of the networking requirement of cloud applications. To demonstrate the effectiveness of TIVC, we develop PROTEUS, a system that implements the new abstraction. Using large-scale simulations of cloud application workloads and prototype implementation running actual cloud applications, we show the new abstraction significantly increases the utilization of the entire datacenter and reduces the cost to the tenants, compared to previous fixed-bandwidth abstractions.

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

algorithms
design
network reservation
allocation
profiling


A dynamical systems framework for intermittent data assimilation We consider the problem of discrete time filtering (intermittent data assimilation) for differential equation models and discuss methods for its numerical approximation. The focus is on methods based on ensemble/particle techniques and on the ensemble Kalman filter technique in particular. We summarize as well as extend recent work on continuous ensemble Kalman filter formulations, which provide a concise dynamical systems formulation of the combined dynamics-assimilation problem. Possible extensions to fully nonlinear ensemble/particle based filters are also outlined using the framework of optimal transportation theory.

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

data assimilation
ensemble kalman filter
dynamical systems
optimal transportation


An online model composition tool for system biology models There are multiple representation formats for Systems Biology computational models, and the Systems Biology Markup Language (SBML) is one of the most widely used. SBML is used to capture, store, and distribute computational models by Systems Biology data sources (e.g., the BioModels Database) and researchers. Therefore, there is a need for all-in-one web-based solutions that support advance SBML functionalities such as uploading, editing, composing, visualizing, simulating, querying, and browsing computational models.

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


Analysis of a read disturb-free 9T SRAM cell with bit-interleaving capability In this work, we proposed a single-ended read disturb-free 9T SRAM cell for bit-interleaving application. A column-aware feedback-cutoff write scheme is employed in the cell to achieve higher write margin and non-intrusive bit-interleaving configuration. And a dynamic read-decoupled assist scheme is utilized by cutting loop to relax the interdependence between stability and read current, resulting in robust read operation and better read performance simultaneously. Moreover, the lower write and leakage energy consumptions are also achieved. We compared area, stability, SNM sensitivity and energy consumption between proposed 9T and standard 6T bit-cells. The write ability of 9T cell is 1.40 higher that of 6T cell at 1.0V, and 8.16 higher at 0.3V. The write and leakage energy dissipations are 26% and 13% lower than that of 6T at 1.0V. In addition, robust read and better process variation tolerance are provided for proposed design with area penalty.

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

disturb-free sram
bit-interleaving
loop-cutting


developing a web authoring tool that promotes accessibility in children's designs This paper describes the development, with full involvement by children, of a web development tool which reflects truly how children view the World Wide Web. The tool was designed in such a way that it promoted the understanding and implementation of accessibility principles to the users.

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

children
authoring tool
web development
users
web
implementation
tool
paper

web accessibility
understandability
developer
design
access
web authoring
world wide web


Multi-agent negotiation based on price schedules algorithm for distributed collaborative design Collaborative design is a common practice in modern product development. Companies specializing in different disciplines, which are often geographically separated, work together to develop solutions for the benefit of overall design. In such inter-organizational collaboration, participants hiding individual skills and design rationales is highly desirable. To fulfill this requirement, this study proposes a negotiation mechanism based on a price schedules decomposition algorithm originally developed in economics. The mechanism searches for globally optimal designs, where no participant is necessary to own full knowledge of the entire design space. This paper also applies multi-agent system technologies to realize a secure environment for automating distributed collaborative design. A test scenario of distributed tolerance allocation in assembly design validates the proposed mechanism.

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


Effect of dual swirling plasma arc cutting parameters on kerf characteristics A numerical control 3-D processing system was constituted for dual swirling plasma arc cutting. The effect of cutting energy parameters and operating gases on kerf characteristics was then investigated experimentally, so as to provide a reference for appropriately selecting process parameters to improve cut quality. It is shown that kerf widths reduce, and the bevel angle and the straightness increase with an increase of cutting speed and a decrease of arc current. Moreover, a smaller bevel angle, together with greater straightness and more dross, exhibits on the low speed side of the cut. As the oxygen content of the operating gas decreases, kerf widths decrease and the dross increases, while the bevel angle varies slightly on the high speed side of the cut. For the pure oxygen and pure air processes, the bevel angle on the low speed side and the straightness of cut surface are the smallest, but the pure oxygen cut surface is the roughest due to the occurrence of a saw-like kerf.

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

plasma arc cutting
kerf characteristics
cut quality


Small strong epsilon nets ? Let P be a set of n points in Rd R d . A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than d n d + 1 points of P. We call a point x a strong centerpoint for a family of objects C C if x?P x ? P is contained in every object C?C C ? C that contains more than a constant fraction of points of P . A strong centerpoint does not exist even for halfspaces in R2 R 2 . We prove that a strong centerpoint exists for axis-parallel boxes in Rd R d and give exact bounds. We then extend this to small strong ? -nets in the plane. Let ? i S represent the smallest real number in [0,1] [ 0 , 1 ] such that there exists an ? i S -net of size i with respect to S S . We prove upper and lower bounds for ? i S where S S is the family of axis-parallel rectangles, halfspaces and disks.

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

?-nets
axis-parallel rectangles
small weak ?-nets


The local discontinuous Galerkin finite element method for Burger's equation In this paper, we study the local discontinuous Galerkin (LDG) finite element method for solving a nonlinear Burger's equation with Dirichlet boundary conditions. Based on the Hopf-Cole transformation, we transform the original problem into a linear heat equation with Neumann boundary conditions. The heat equation is then solved by the LDG finite element method with special chosen numerical flux. Theoretical analysis shows that this method is stable and the (k + 1)th order of convergence rate when the polynomials P(k) are used. Finally, we present some examples of P(k) polynomials with 1 <= k <= 4 to demonstrate the high-order accuracy of this method. The numerical results are also shown to be more accurate than some available results given in the literature. (C) 2011 Elsevier Ltd. All rights reserved.

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

ldg finite element method
numerical flux

burger's equation
hopf-cole transformation
neumann boundary condition


A Low Complexity PTS Technique using Threshold for PAPR Reduction in OFDM Systems Traffic classification seeks to assign packet flows to an appropriate quality of service (QoS) class based on flow statistics without the need to examine packet payloads. Classification proceeds in two steps. Classification rules are first built by analyzing traffic traces, and then the classification rules are evaluated using test data. In this paper, we use self-organizing map and K-means clustering as unsupervised machine learning methods to identify the inherent classes in traffic traces. Three clusters were discovered, corresponding to transactional, bulk data transfer, and interactive applications. The K-nearest neighbor classifier was found to be highly accurate for the traffic data and significantly better compared to a minimum mean distance classifier.

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

unsupervised learning
k-nearest neighbor


Efficiency measurement using independent component analysis and data envelopment analysis Efficiency measurement is an important issue for any firm or organization. Efficiency measurement allows organizations to compare their performance with their competitors and then develop corresponding plans to improve performance. Various efficiency measurement tools, such as conventional statistical methods and non-parametric methods, have been successfully developed in the literature. Among these tools, the data envelopment analysis (DEA) approach is one of the most widely discussed. However, problems of discrimination between efficient and inefficient decision-making units also exist in the DEA context (Adler and Yazhemsky, 2010). In this paper, a two-stage approach of integrating independent component analysis (ICA) and data envelopment analysis (DEA) is proposed to overcome this issue. We suggest using ICA first to extract the input variables for generating independent components, then selecting the ICs representing the independent sources of input variables, and finally, inputting the selected ICs as new variables in the DEA model. A simulated dataset and a hospital dataset provided by the Office of Statistics in Taiwans Department of Health are used to demonstrate the validity of the proposed two-stage approach. The results show that the proposed method can not only separate performance differences between the DMUs but also improve the discriminatory capability of the DEAs efficiency measurement.

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

independent component analysis
data envelopment analysis
efficiency measurement


Statistical Performance Modeling in Functional Instruction Set Simulators Despite the recent progress in improving the speed of instruction-accurate simulators cycle-accurate simulation is still prohibitively slow for all but the most basic programs. In this article we present a statistical machine learning approach to performance estimation in fast, instruction accurate simulators and evaluate our methodology comprehensively against three popular embedded RISC processors and about 300 embedded applications. We show that our methodology is capable of providing accurate performance estimations with an average error of less than 3.9% while, on average, operating approximate to 14.5 times faster than cycle-accurate simulation.

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

experimentation
measurement
instruction set simulator
cycle-accurate simulator
statistical performance modeling


Shape and topology optimization for tailoring stress in a local region to enhance performance of piezoresistive sensors Based on the analysis of a typical configuration of piezoresistive sensors, the intensity and uniformity of stress in piezoresistive elements are identified as the parameters that affect the performance of a sensor. To enhance the performance, a shape and topology optimization problem is formulated to ensure the stress is high and uniform in a local region where the piezoresistive elements are placed. The optimization problem is solved via the level set based method. To compute stress accurately, artificial weak material conventionally used to mimic void is avoided in the finite element analysis. Numerical examples in two dimensions are investigated.

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


Performance analysis of multiple relay cooperative communication over generalized ?? and ?? fading channels In this paper, we derive the closed form expressions for symbol error rate (SER) of a multiple relay cooperative communication system using selective decode-and-forward protocol over generalized ?? and ?? independent identically distributed fading channels for different modulation schemes. We also derive the exact expression of SER for non-coherent detection and an approximate expression of SER for coherent detection. At the destination, we employ the maximal ratio combining to provide diversity. The final expressions of SER are represented in terms of moment generating function which is a combination of elementary functions. We also perform the Monte Carlo simulations by assuming different channels and by varying the number of relays to validate the analytical results.

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

symbol error rate
maximal ratio combining
moment generating function

?? and ?? distribution
selective decode and forward


Joint Beamforming and Power Allocation for Cognitive MIMO Systems Under Imperfect CSI Based on Game Theory The problem of joint beamforming and power allocation for cognitive multi-input multi-output systems is studied via game theory. The objective is to maximize the sum utility of secondary users (SUs) subject to the primary user (PU) interference constraint, the transmission power constraint of SUs, and the signal-to-interference-plus-noise ratio (SINR) constraint of each SU. In our earlier work, the problem was formulated as a non-cooperative game under the assumption of perfect channel state information (CSI). Nash equilibrium (NE) is considered as the solution of this game. A distributed algorithm is proposed which can converge to the NE. Due to the limited cooperation between the secondary base station (SBS) and the PU, imperfect CSI between the SBS and the PU is further considered in this work. The problem is formulated as a robust game. As it is difficult to solve the optimization problem in this case, existence of the NE cannot be analyzed. Therefore, convergence property of the sum utility of SUs will be illustrated numerically. Simulation results show that under perfect CSI the proposed algorithm can converge to a locally optimal pair of transmission power vector and beamforming vector, while under imperfect CSI the sum utility of SUs converges with the increase of the transmission power constraint of SUs.

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

power allocation
beamforming
game theory

cognitive radio
multi-input multi-output
imperfect channel state information


Describing function analysis of second-order sliding mode observers The second- order sliding mode observer dynamics are analyzed in the frequency domain. The so- called super- twisting algorithm is utilized for generating the second- order sliding mode in the observer dynamical system. The frequency response of the observer dynamics is obtained and used as a characteristic of the observer. The analysis proposed is based on the describing function method and the concept of the equivalent gains of nonlinear functions of the super- twisting algorithm.

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

sliding mode
observers
describing function


A belief-theoretic framework for the collaborative development and integration of para-consistent conceptual models Merging and integrating different conceptual models which have been collaboratively developed by domain experts and analysts with dissimilar perspectives on the same issue has been the subject of tremendous amount of research. In this paper, we focus on the fact that human analysts opinions possess a degree of uncertainty which can be exploited while integrating such information. We propose an underlying modeling construct which is the basis for transforming conceptual models into a manipulatable format. Based on this construct, methods for formally negotiating over and merging of conceptual models are proposed. The approach presented in this paper focuses on the formalization of uncertainty and expert reliability through the employment of belief theory. The proposed work has been evaluated for its effectiveness and usability. The evaluators (a group of Computer Science graduate students) believed that the proposed framework has the capability to fulfil its intended tasks. The obtained results from the performance perspective are also promising.

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

collaborative modeling
viewpoint integration
conceptualization
inconsistency management


Gossiping for resource discovering: An analysis based on complex network theory This paper analyzes the adoption of unstructured P2P overlay networks to build resource discovery services. We consider a simple distributed communication protocol, which is based on gossip and on the local knowledge each node has about resources hold by its neighbors. In particular, upon reception (or generation) of a novel query, a node relays the message to those neighbors that have resources whose profile matches the query. Moreover, the node gossips the query to other remaining neighbors, so that the query can be disseminated through the overlay. A mathematical analysis is provided to estimate the number of nodes receiving the query (and consequently, the portion of query hits), based on the network topology, resource availability and gossip probability. Results show that the use of unstructured networks, coupled with simple dissemination protocols, represent a viable approach to build P2P resource discovery systems.

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

unstructured overlays
complex networks
gossip protocols
modeling


MEASURING USER PARTICIPATION, USER INVOLVEMENT, AND USER ATTITUDE Defining user participation as the activities performed by users during systems development, user involvement as the importance and personal relevance of a system to its user, and user attitude as the affective evaluation of a system by the user, this study aims to: (1) develop separate measures of user participation, user involvement, and user attitude, (2) identify key dimensions of each construct, and (3) investigate the relationships among them. Responses from users in organizations developing new information systems were used to create an overall scale measuring user participation (along with three subscales reflecting the dimensions of responsibility, user-IS relationship, and hands-on activities), an overall scale measuring user involvement (along with two subscales reflecting the dimensions of importance and personal relevance), and a scale measuring user attitude. Analysis of the data provides evidence for the reliability and validity of the three constructs and their dimensions. User participation has long been considered a key variable in the successful development of information systems. However, Past research has failed to clearly demonstrate its benefits. The measures developed in this study provide a useful starting point for deciphering the precise nature of the relationship among user participation, involvement, and attitude during systems implementation.

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


A proposed synthesis method for Application-Specific Instruction Set Processors Due to the rapid technology advancement in integrated circuit era, the need for the high computation performance together with increasing complexity and manufacturing costs has raised the demand for high-performance configurable designs; therefore, the Application-Specific Instruction Set Processors (ASIPs) are widely used in SoC design. The automated generation of software tools for ASIPs is a commonly used technique, but the automated hardware model generation is less frequently applied in terms of final RTL implementations. Contrary to this, the final register-transfer level models are usually created, at least partly, manually. This paper presents a novel approach for automated hardware model generation for ASIPs. The new solution is based on a novel abstract ASIP model and a modeling language (Algorithmic Microarchitecture Description Language, AMDL) optimized for this architecture model. The proposed AMDL-based pre-synthesis method is based on a set of pre-defined VHDL implementation schemes, which ensure the qualities of the automatically generated register-transfer level models in terms of resource requirement and operation frequency. The design framework implementing the algorithms required by the synthesis method is also presented.

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

application-specific instruction set processor


designing suited interactions for a document management system handling localized documents This paper presents an approach for interaction design based on the specificity of the information involved in the interaction. The contribution is intended for application designers who wish to widen the traditional principles of design with a renovated view allowing the interactions of the future system to be imagined. The broad lines of this approach are described thanks to a prototype. The experimentation area considers a localized corpus where space criteria are used as guidelines in order to design interactions of the associated document management system

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

interaction design
document management system
localized documents


operational systems of computer machines in the galua's base In the article are circumscribed the theoretical fundamentalses and structural solutions of realization operational systems of computers because of submissions of datas in the Galua's base.

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

galua's base
vertical information technology


On the Number of Topological Types Occurring in a Parameterized Family of Arrangements Let S(R) be an o-minimal structure over R, T subset of Rk1+k2+l a closed definable set, and pi(1) : Rk1+k2+l -> Rk1+k2, pi(2) : Rk1+k2+l -> R-l, pi(3) : Rk1+k2 -> R-k2 the projection maps as depicted below: [GRAPHICS] For any collection A = {A(1),...,A(n)} of subsets of Rk1+k2, and z epsilon R-k2, let A(z) denote the collection of subsets of R-k1 {A(1), z,..., A(n,z)}, where Ai,z = Ai boolean AND pi(-1)(3) (z), 1 0 such that for any family A = {A(1),...,A(n)} of definable sets, where each A(i) = pi(1)(T boolean AND pi(-1)(2) (y(i))), for some y(i) epsilon R-l, the number of distinct stable homotopy types amongst the arrangements A(z), z epsilon R-k2 is bounded by C center dot n((k1+ 1)k2) while the number of distinct homotopy types is bounded by C center dot n((k1+3)k2). This generalizes to the o-minimal setting, bounds of the same type proved in Basu and Vorobjov J. Lond. Math. Soc. (2) 76(3): 757-776, 2007) for semi-algebraic and semi-Pfaffian families. One technical tool used in the proof of the above results is a pair of topological comparison theorems reminiscent of Helly's theorem in convexity theory. These theorems might be of independent interest in the quantitative study of arrangements.

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

combinatorial complexity
o-minimal structures


Symmetric active/active metadata service for high availability parallel file systems High availability data storage systems are critical for many applications as research and business become more data driven. Since metadata management is essential to system availability, multiple metadata services are used to improve the availability of distributed storage systems. Past research has focused on the active/standby model, where each active service has at least one redundant idle backup. However, interruption of service and even some loss of service state may occur during a fail-over depending on the replication technique used. In addition, the replication overhead for multiple metadata services can be very high. The research in this paper targets the symmetric active/active replication model, which uses multiple redundant service nodes running in virtual synchrony. In this model, service node failures do not cause a fail-over to a backup and there is no disruption of service or loss of service state. A fast delivery protocol is further discussed to reduce the latency of the total order broadcast needed. The prototype implementation shows that metadata service high availability can be achieved with an acceptable performance trade-off using the symmetric active/active metadata service solution.

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

metadata management
high availability
parallel file systems


identification and reconstruction of bullets from multiple x-rays We present a framework for the rapid detection and 3D localisation of bullets (or other compact shapes) from a sparse set of cross-sectional patient x-rays. The intention of this work is to assess a software architecture for an application specific alternative to conventional CT which can be leveraged in poor communities using less expensive technology. Of necessity such a system will not provide the diagnostic sophistication of full CT, but in many cases this added complexity may not be required. While a pair of x-rays can provide some 3D positional information to a clinician, such an assessment is qualitative and occluding tissue/bone may lead to an incorrect assessment of the internal location of the bullet.Our system uses a combination of model-based segmentation and CT-like back-projection to arrive at an approximate volume representation of the embedded shape, based on a sequence of x-rays which encompasses the affected area. Depending on the nature of the injury, such a 3D shape approximation may provide sufficient information for surgical intervention.The results of our proof-of-concept study show that, algorithmically, such system is indeed realisable: a 3D reconstruction is possible from a small set of x-rays, with only a small computational load. A combination of real x-rays and simulated 3D data are used to evaluate the technique.

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


Comprehensive learning particle swarm optimization for reactive power dispatch Reactive power dispatch (RPD) is an optimization problem that reduces grid congestion by minimizing the active power losses for a fixed economic power dispatch. RPD reduces power system losses by adjusting the reactive power control variables such as generator voltages, transformer tap-settings and other sources of reactive power such as capacitor banks and provides better system voltage control, resulting in an improved voltage profile, system security, power transfer capability and over all system operation. In this paper, RPD problem is solved using particle swarm optimization (PSO). To overcome the drawback of premature convergence in PSO, a learning strategy is introduced in PSO, and this approach called, comprehensive learning particle swarm optimization (CLPSO) is also applied to this problem and a comparison of results is made between these two. Three different test cases have been studied such as minimization of real power losses, improvement of voltage profile and enhancement of voltage stability through a standard IEEE 30-bus and 118-bus test systems and their results have been reported. The study results show that the approaches developed are feasible and efficient.

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

reactive power dispatch
voltage profile
voltage stability
particle swarm optimization


An M/G/1 retrial queue with an unreliable server and general repair times An M/G/1 type queueing system with an unreliable server is considered. If the server fails during the service of a customer, the customer leaves the server, joins a retrial group and in random intervals repeats the attempts to get service. We find the joint distribution of the server state, the number of customers in the queue and the number of customers in the retrial group in a steady state when both the service time and repair time have general distributions. (C) 2010 Elsevier B.V. All rights reserved.

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


Domain transfer via cross-domain analogy Analogical learning has long been seen as a powerful way of extending the reach of ones knowledge. We present the domain transfer via analogy (DTA) method for learning new domain theories via cross-domain analogy. Our model uses analogies between pairs of textbook example problems, or worked solutions, to create a domain mapping between a familiar and a new domain. This mapping allows us to initialize a new domain theory. After this initialization, another analogy is made between the domain theories themselves, providing additional conjectures about the new domain. We present two experiments in which our model learns rotational kinematics by an analogy with translational kinematics, and vice versa. These learning rates outperform those from a version of the system that is incrementally given the correct domain theory.

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


Approaches to knowledge reduction of covering decision systems based on information theory In this paper, we propose some new approaches for attribute reduction in covering decision systems from the viewpoint of information theory. Firstly, we introduce information entropy and conditional entropy of the covering and define attribute reduction by means of conditional entropy in consistent covering decision systems. Secondly, in inconsistent covering decision systems, the limitary conditional entropy of the covering is proposed and attribute reductions are defined. And finally, by the significance of the covering, some algorithms are designed to compute all the reducts of consistent and inconsistent covering decision systems. We prove that their computational complexity are polynomial. Numerical tests show that the proposed attribute reductions accomplish better classification performance than those of traditional rough sets. In addition, in traditional rough set theory, MIBARK-algorithm [G.Y. Wang, H. Hu, D. Yang, Decision table reduction based on conditional information entropy, Chinese J. Comput., 25 (2002) 18] cannot ensure the reduct is the minimal attribute subset which keeps the decision rule invariant in inconsistent decision systems. Here, we solve this problem in inconsistent covering decision systems.

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

covering decision systems
attribute reduction
information entropy
conditional entropy

limitary entropy
limitary conditional entropy


Joint transmitter power control and mobile cache management in wireless computing We investigate efficient schemes for data communication from a server (base station and access point) to a mobile terminal over a wireless channel of randomly fluctuating quality. The terminal user generates requests for data items. If the buffer (cache) of the terminal contains the requested data, no access delay/latency is incurred. If not, the data is downloaded from the server, and until becoming available locally at the terminal, the user incurs a delay cost. Moreover, a transmission/ power cost is incurred to transmit the data over the wireless link at a dynamically selected power level. To lower both the access delay and transmission costs, the system may prefetch data predictively and cache them on the terminal (especially during high-link-quality periods), anticipating future user requests. The goal is to jointly minimize the overall latency and power costs by dynamically choosing what data to (pre) fetch, what power level to use, and when to use it. We develop a modeling framework (based on dynamic programming and controlled Markov chains) that captures essential performance trade-offs. It allows for the computation of optimal decisions regarding what data to (pre) fetch and what power levels to use. To cope with emerging complexities, we then design efficient online heuristics whose simulation analysis demonstrates substantial performance gains over standard approaches.

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

data prefetching
wireless networking
mobile computing


Combinatorics on arrangements and parametric matroids: A bridge between computational geometry and combinatorial optimization Given a combinatorial problem on a set of weighted elements, if we change the weight using a parameter, we obtain a parametric version of the problem, which is often used as a tool for solving mathematical programming problems. One interesting question is how to describe and analyze the trajectory of the solution. If we consider the trajectory of each weight function as a curve in a plane, we have a set of curves from the problem instance. The curves induces a cell complex called an arrangement, which is a popular research target in computational geometry. Especially, for the parametric version of the problem of computing the minimum weight base of a matroid or polymatroid, the trajectory of the solution becomes a subcomplex in an arrangement. We introduce the interaction between the two research areas, combinatorial optimization and computational geometry, through this bridge.

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

computational geometry
combinatorics
matroids


Bound-preserving discontinuous Galerkin methods for conservative phase space advection in curvilinear coordinates ? We extend the positivity-preserving method of Zhang and Shu [49] to simulate the advection of neutral particles in phase space using curvilinear coordinates. The ability to utilize these coordinates is important for non-equilibrium transport problems in general relativity and also in science and engineering applications with specific geometries. The method achieves high-order accuracy using Discontinuous Galerkin (DG) discretization of phase space and strong stability-preserving, RungeKutta (SSP-RK) time integration. Special care is taken to ensure that the method preserves strict bounds for the phase space distribution function f ; i.e., f?[0,1] f ? [ 0 , 1 ] . The combination of suitable CFL conditions and the use of the high-order limiter proposed in [49] is sufficient to ensure positivity of the distribution function. However, to ensure that the distribution function satisfies the upper bound, the discretization must, in addition, preserve the divergence-free property of the phase space flow. Proofs that highlight the necessary conditions are presented for general curvilinear coordinates, and the details of these conditions are worked out for some commonly used coordinate systems (i.e., spherical polar spatial coordinates in spherical symmetry and cylindrical spatial coordinates in axial symmetry, both with spherical momentum coordinates). Results from numerical experiments including one example in spherical symmetry adopting the Schwarzschild metric demonstrate that the method achieves high-order accuracy and that the distribution function satisfies the maximum principle.

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

discontinuous galerkin
maximum principle

boltzmann equation
radiation transport
hyperbolic conservation laws
high order accuracy


Geodesic pancyclicity and balanced pancyclicity of Augmented cubes For two distinct vertices u, v epsilon V(G), a cycle is called geodesic cycle with u and v if a shortest path of G joining u and v lies on the cycle; and a cycle C is called balanced cycle with u and v if d(C) (u, v) = max{d(C) (x, y) vertical bar x, y is an element of V (C)}. A graph G is pancyclic [J. Mitchem, E. Schmeichel, Pancyclic and bipancyclic graphs a survey, Graphs and applications (1982) 271-278] if it contains a cycle of every length from 3 to vertical bar V(G)vertical bar inclusive. A graph G is called geodesic pancyclic [H.C. Chan, J.M. Chang, Y.L. Wang, S.J. Horng, Geodesic-pancyclic graphs, in: Proceedings of the 23rd Workshop on Combinatorial Mathematics and Computation Theory, 2006, pp. 181-187] (respectively, balanced pancyclic) if for each pair of vertices it, U E V (G), it contains a geodesic cycle (respectively, balanced cycle) of every integer length of l satisfying max{2d(G) (u, v), 3} = 2. (c) 2006 Elsevier B.V. All rights reserved.

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

panconnected
geodesic pancyclic
balanced pancyclic
interconnection networks


Optimal location area design to minimize registration signaling traffic in wireless systems In this paper, a new scheme is developed for optimal location area design in wireless systems. New algorithms based on intercell traffic prediction and traffic-based cell grouping are used to select the optimal set of cells for location areas (LAs). The expected intercell movement patterns of mobiles are determined by using the new intercell traffic prediction algorithm. Further, the cells are partitioned into LAs by applying the new traffic-based cell grouping algorithm where the cell pairs with higher intercell mobile traffic are grouped into the same LA. Hence, the inter-LA mobile traffic is decreased by increasing the intra-LA mobile traffic. Experimental results show that this cell grouping algorithm reduces the number of location updates by 27 percent to 36 percent on average compared to proximity-based cell grouping schemes.

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

traffic-based location area design
location update
paging
cellular wireless systems


Wavelet domain residual redundancy-based descriptions This paper presents a new multiple description (MD) method for wavelet transform (WT) coded images. This method combines partitioning with concealment to produce descriptions. An optimal concealment method for wavelet transform coded images for a given partitioning is derived based on the statistical characteristics in wavelet domain. Concealment in LL subband is treated differently and is based on its smoothness property. An optimal partitioning method is derived corresponding to the concealment. We have designed a coder for wireless image transmission which emphasizes the need for source and channel coding interaction based on residual redundancy. Optimal channel rate allocation is derived depending upon source significance and channel status information. The method is computationally inexpensive and does not sacrifice compression efficiency. Simulations for wireless image transmission have shown promising results.

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

wavelet transform
multiple description
concealment
partitioning