Ambiguity and fuzziness measures defined on the set of closed intervals in [0,1] ? Starting from the idea of activity orders, we define a family of orders on the set of closed intervals of a distributive lattice L, that will allow us to set up some preorders associated to the ambiguity and fuzziness in order to measure the ambiguity and fuzziness degree of any closed interval in [0,1].

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


An efficient message access quality model in vehicular communication networks We propose a hierarchical message access quality model in VANET which is scalable and efficient in dynamic vehicular communication environment. Our scheme achieves fine-grained access control among various types of vehicles using well defined attributes. Our scheme enforces message authentication and maintain anonymity and privacy of the vehicles.

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

vanet security
attribute-based encryption
attribute-based signature


Effects of background doping concentration on electrostatic discharge protection of high voltage operating extended drain N-type MOS device In this study, the effects of background doping concentration (BDC) of a high voltage operating extended drain N-type MOSFET (EDNMOS) device on electrostatic discharge (ESD) protection performances were evaluated. The EDNMOS device with low BDC suffers from strong snapback in the high current region, which results in poor ESD protection performance and high latchup risk. However, the strong snapback can be avoided in the EDNMOS device with high BDC. This implies that both the good ESD protection performance and the latchup immunity can be realized in terms of the EDNMOS by properly controlling its BDC.

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

background doping concentration (bdc)
electrostatic discharge (esd)
extended drain n-type mosfet (ednmos)
double snapback


Run-Time Task Allocation Considering User Behavior in Embedded Multiprocessor Networks-on-Chip In this paper, we propose a run-time strategy for allocating application tasks to embedded multiprocessor systems-on-chip platforms where communication happens via the network-on-chip approach. As a novel contribution, we incorporate the user behavior information in the resource allocation process; this allows the system to better respond to real-time changes and to adapt dynamically to different user needs. Several algorithms are proposed for solving the task allocation problem while minimizing the communication energy consumption and network contention. When the user behavior is taken into consideration, we observe more than 70% communication energy savings (with negligible energy and run-time overhead) compared to an arbitrary contiguous task allocation strategy.

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

low-power design
multiprocessor interconnection
networks-on-chip
optimization methods
resource management


toward real-time simulation of cardiac dynamics We show that through careful and model-specific optimizations of their GPU implementations, simulations of realistic, detailed cardiac-cell models now can be performed in 2D and 3D in times that are close to real time using a desktop computer. Previously, large-scale simulations of detailed mathematical models of cardiac cells were possible only using supercomputers. In our study, we consider five different models of cardiac electrophysiology that span a broad range of computational complexity: the two-variable Karma model, the four-variable Bueno-Orovio-Cherry-Fenton model, the eight-variable Beeler-Reuter model, the 19-variable Ten Tusscher-Panfilov model, and the 67-variable Iyer-Mazhari-Winslow model. For each of these models, we treat both their single- and double-precision versions and demonstrate linear or even sub-linear growth in simulation times with an increase in the size of the grid used to model cardiac tissue. We also show that our GPU implementations of these models can increase simulation speeds to near real-time for simulations of complex spatial patterns indicative of cardiac arrhythmic disorders, including spiral waves and spiral wave breakup. The achievement of real-time applications without the need for supercomputers may, in the near term, facilitate the adoption of modeling-based clinical diagnostics and treatment planning, including patient-specific electrophysiological studies.

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


Generalized likelihood ratio test for varying-coefficient models with different smoothing variables Varying-coefficient models are popular multivariate nonparametric fitting techniques. When all coefficient functions in a varying-coefficient model share the same smoothing variable, inference tools available include the F-test, the sieve empirical likelihood ratio test and the generalized likelihood ratio (GLR) test. However, when the coefficient functions have different smoothing variables, these tools cannot be used directly to make inferences on the model because of the differences in the process of estimating the functions. In this paper, the GLR test is extended to models of the latter case by the efficient estimators of these coefficient functions. Under the null hypothesis the new proposed GLR test follows the ?2 ? 2 -distribution asymptotically with scale constant and degree of freedom independent of the nuisance parameters, known as Wilks phenomenon. Further, we have derived its asymptotic power which is shown to achieve the optimal rate of convergence for nonparametric hypothesis testing. A simulation study is conducted to evaluate the test procedure empirically.

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

different smoothing variables
generalized likelihood ratio test
wilks phenomenon

efficient estimator
varying-coefficient models


The strength of multilinear proofs We introduce an algebraic proof system that manipulates multilinear arithmetic formulas. We show that this proof system is fairly strong, even when restricted to multilinear arithmetic formulas of a very small depth. Specifically, we show the following: 1. Algebraic proofs manipulating depth 2 multilinear arithmetic formulas polynomially simulate Resolution, Polynomial Calculus (PC) and Polynomial Calculus with Resolution (PCR) proofs; 2. Polynomial size proofs manipulating depth 3 multilinear arithmetic formulas for the functional pigeonhole principle; 3. Polynomial size proofs manipulating depth 3 multilinear arithmetic formulas for Tseitin's graph tautologies. By known lower bounds, this demonstrates that algebraic proof systems manipulating depth 3 multilinear formulas are strictly stronger than Resolution, PC and PCR, and have an exponential gap over boundeddepth Frege for both the functional pigeonhole principle and Tseitin's graph tautologies. We also illustrate a connection between lower bounds on multilinear proofs and lower bounds on multilinear circuits. In particular, we show that (an explicit) super-polynomial size separation between proofs manipulating general arithmetic circuits and proofs manipulating multilinear circuits implies a super-polynomial size lower bound on multilinear circuits for an explicit family of polynomials.

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

multilinear arithmetic formulas
polynomial calculus

proof complexity
propositional pigeonhole principle
tseitin tautologies


solving toeplitz- and vandermonde-like linear systems with large displacement rank Linear systems with structures such as Toeplitz-, Vandermonde-or Cauchy-likeness can be solved in O ~(? 2 n ) operations, where n is the matrix size, ? is its displacement rank, and O ~denotes the omission of logarithmic factors. We show that for Toeplitz-like and Vandermonde-like trices, this cost can be reduced to O ~(? ?--1 n ), where ? is a feasible exponent for matrix multiplication over the base field. The best known estimate for ? is ?< 2.38, resulting in costs of order O ~(? 1.38 n ). We also present consequences for Hermite-Pad approximation and bivariate interpolation.

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

structured linear algebra
dense linear algebra


Many Distances in Planar Graphs We show how to compute in O(n (4/3)log (1/3) n+n (2/3) k (2/3)log n) time the distance between k given pairs of vertices of a planar graph G with n vertices. This improves previous results whenever (n/log n)(5/6)a parts per thousand currency signka parts per thousand currency signn (2)/log (6) n. As an application, we speed up previous algorithms for computing the dilation of geometric planar graphs.

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

distances in graphs
separators
decomposition of graphs
data structure


Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems In this paper, we present the design, implementation and evaluation of Rappel, a peer-to-peer feed-based publish-subscribe service. By using a combination of probabilistic and gossip-like techniques and mechanisms, Rappel provides noiselessness, i.e., updates from any feed are received and relayed only by nodes that are subscribers of that feed. This leads to a fair system: the overhead at each subscriber node scales with the number and nature of its subscriptions. Moreover, Rappel incurs small publisher and client overhead, and its clients receive updates quickly and with low IP stretch. To achieve these goals, Rappel exploits "interest locality" characteristics observed amongst real multi-user multi-feed populations. This is combined with systems design decisions that enable nodes to find other subscribers, and maintain efficient network locality-aware dissemination trees. We evaluate Rappel via both trace-driven simulations and a PlanetLab deployment. The experimental results from the PlanetLab deployment show that Rappel subscribers receive updates within hundreds of milliseconds after posting. Further, results from the trace-driven simulator match our PlanetLab deployment, thus allowing us to extrapolate Rappel's performance at larger scales. (C) 2009 Elsevier B.V. All rights reserved.

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

publish-subscribe
application-level multicast
gossip-based overlay construction
self-organization


every problem has a weakest failure detector Several basic problems that arise in fault-tolerant distributed computing were shown to have a weakest failure detector. We show here that every problem that is solvable with a failure detector has a weakest failure detector.

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


A secret sharing scheme based on (t, n) threshold and adversary structure The existing secret sharing schemes cannot be applied directly if the threshold and the adversary structures are both needed to meet. A secret sharing scheme which can meet the requirements of both the (t, n) threshold and the adversary structure is proposed basing on the existing (t, n) threshold schemes and the knowledge of set theory, and the validity of the proposed scheme is proved perfectly. The scheme does not need to traverse the whole set of participants to get the qualified or unqualified subsets, and can distribute the shadows according to the requirements of threshold and adversary structure directly. The scheme can prevent the participants from cheating, and does not need the participants to provide their real shadows when the shared secret is reconstructed. The shadows do not need to be renewed when the shared secret is changed. The comparisons to the existing schemes show that, the proposed scheme is more efficient when the threshold and the adversary structure are both required.

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

secret sharing
threshold
adversary structure


A multi-objective genetic optimization of interpretability-oriented fuzzy rule-based classifiers The paper presents a multi-objective genetic approach to design interpretability-oriented fuzzy rule-based classifiers from data. The proposed approach allows us to obtain systems with various levels of compromise between their accuracy and interpretability. Original crossover and mutation operators, as well as chromosome-repairing technique to directly transform the rules are also proposed. The interpretability measure is based on the arithmetic mean of three components: the average length of rules, the number of active fuzzy sets, and the number of active inputs of the system. Effectiveness of the proposed technique in various classification problems is confirmed by experimental results.

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

accuracy and interpretability of fuzzy rule-based systems


An efficient and inexpensive method for activity recognition within a smart home based on load signatures of appliances With the increasing demand in terms of non-intrusive appliance load monitoring (NIALM), more and more smart meters and smart analyzers were released on the market to extract well-defined load signatures and/or for performing autonomously the various monitoring operations as needed. Nevertheless, this hardware proves to be very expensive and not necessarily accessible to all. Moreover, most applications resulting from the use of these smart devices simply refer to energy saving and costs reducing of energy consumption. Thus, this paper proposes a new algorithmic method for an application field that is still very lightly exploited, i.e. the activity recognition of reduced-autonomy residents living in a smart habitat through load signatures. This one is based on steady-state operations and signatures and its extraction process of load signatures of appliances is carried out in a three-dimensional space through a single power analyzer which is non-intrusive (NIALM). This approach has been tested and verified rigorously through daily scenarios reproduced in the smart home prototype in a laboratory. Hence, we can affirm that, with an exceptionally minimal investment and the exploitation of especially limited data, our method can recognize the use of appliances with high precision and low-cost allowing us to compete with other approaches which are much more expensive and require supplementary equipment.

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

non-intrusive appliance load monitoring (nialm)


Partitioning Search Spaces of a Randomized Search This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what is the best way to use the computers to solve the instance? Two approaches, simple distribution and search space partitioning as well as their combinations are investigated both analytically and empirically. It is shown that the results depend heavily on the type of the problem (unsatisfiable, satisfiable with few solutions, and satisfiable with many solutions) as well as on how good the search space partitioning function is. In addition, the behavior of a real search space partitioning function is evaluated in the same framework. The results suggest that in practice one should combine the simple distribution and search space partitioning approaches.

O 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

sat solving
distributed constraint-based search


Upper bounds on the statistical distribution of the crest-factor in OFDM transmission This correspondence analyzes the crest-factor behavior of an orthogonal frequency-division multiplexing (OFDM) modem. The behavior is characterized in terms of the complementary distribution function of the crest-factor (CDFC). The CDFC is a key parameter of OFDM systems, for example it provides limits on achievable information rates. Several approximations have been developed in the literature so far, but no true upper bounds dependent on the different constellations that are used in OFDM modulation have been derived. A new approach is given providing upper bounds that substitute for time-consuming simulations.

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

orthogonal frequency-division multiplexing (ofdm)


Capturing and animating skin deformation in human motion During dynamic activities, the surface of the human body moves in many subtle but visually significant ways: bending, bulging, jiggling, and stretching. We present a technique for capturing and animating those motions using a commercial motion capture system and approximately 350 markers. Although the number of markers is significantly larger than that used in conventional motion capture, it is only a sparse representation of the true shape of the body. We supplement this sparse sample with a detailed, actor-specific surface model. The motion of the skin can then be computed by segmenting the markers into the motion of a set of rigid parts and a residual deformation ( approximated first as a quadratic transformation and then with radial basis functions). We demonstrate the power of this approach by capturing flexing muscles, high frequency motions, and abrupt decelerations on several actors. We compare these results both to conventional motion capture and skinning and to synchronized video of the actors.

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


Reliable water supply system design under uncertainty Given the natural variability and uncertainties in long-term predictions, reliability is a critical design factor for water supply systems. However, the large scale of the problem and the correlated nature of the involved uncertainties result in models that are often intractable. In this paper, we consider a municipal water supply system over a 15-year planning period with initial infrastructure and possibility of construction and expansion during the first and sixth year on the planning horizon. Correlated uncertainties in water demand and supply are applied on the form of the robust optimization approach of Bertsimas and Sim to design a reliable water supply system. Robust optimization aims to find a solution that remains feasible under data uncertainty. Such a system can be too conservative and costly. In the Bertsimas and Sim approach, it is possible to vary the degree of conservatism to allow for a decision maker to understand the tradeoff between system reliability and economic feasibility/cost. The degree of conservatism is incorporated in the probability bound for constraint violation. As a result, the total cost increases as the degree of conservatism (and reliability) is increased. In the water supply system application, a tradeoff exists between the level of conservatism and imported water purchase. It was found that the robust optimization approach addresses parameter uncertainty without excessively affecting the system. While we applied our methodology to hypothetical conditions, extensions to real-world systems with similar structure are straightforward. Therefore, our study shows that this approach is a useful tool in water supply system design that prevents system failure at a certain level of risk.

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

water supply system
data uncertainty
robust optimization


extending the arc model with generative coordination The ARC (Actor, Role, Coordinator) model extends the actor model with roles and coordinators to achieve a behavior-based coordination model that preserves the semantics of the actor model. An ARC role coordinates a dynamic set of actors whose intensional representation and membership criteria are defined by a static description of abstract behavior. An ARC coordinator enacts role-based coordination policies expressed in terms of ARC roles. In this paper, we focus on the satisfaction of functional coordination requirements via the generation and manipulation of actor messages by role and coordinator actors in the ARC model.

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


a framework for designing benchmarks of investigating digital forensics tools for mobile devices With the continued growth of the mobile device market, the possibility of their use in criminal activity will only continue to increase. While the mobile device market provides a great variety of manufacturers and models causing a strong diversity, it becomes difficult for a professional investigator to choose the proper forensics tools for seizing internal data from mobile devices. Through this paper, we will give a comprehensive perspective of each popular digital forensic tool and initiate discussion towards benchmarking key features and considerations of forensic analysis techniques.

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

digital forensics
mobile devices
benchmarking
forensics tools

xry
handheld devices
paraben csi stick
cell seizure


Integrated handwriting recognition and interpretation using finite-state models The interpretation of handwritten sentences is carried out using a holistic approach in which both text image recognition and the interpretation itself are tightly integrated. Conventional approaches follow a serial, first-recognition then-interpretation scheme which cannot adequately use semantic-pragmatic knowledge to recover from recognition errors. Stochastic finite-sate transducers are shown to be suitable models for this integration, permitting a full exploitation of the final interpretation constraints. Continuous-density hidden Markov models are embedded in the edges of the transducer to account for lexical and morphological constraints. Robustness with respect to stroke vertical variability is achieved by integrating tangent vectors into the emission densities of these models. Experimental results are reported on a syntax-constrained interpretation task which show the effectiveness of the proposed approaches. These results are also shown to be comparatively better than those achieved with other conventional, N-gram-based techniques which do not take advantage of full integration.

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

stochastic finite-state transducers
preprocessing and feature extraction


Observer-based controller design for networked control systems with sensor quantisation and random communication delay This article addresses the study of observer-based controller design for network-based control systems in the presence of output quantisation and random communication delay simultaneously. In the communication channel, the output measurement are quantised before transmission, and two kinds of network-induced delays are taken into account simultaneously: (i) random delay from sensor to controller and (ii) random delay from controller to actuator. These two types of random delays are modelled as two independent Bernoulli distributed white sequences. The observer-based controller is synthesised to stabilise the networked closed-loop system in the sense of stochastic stability. Sufficient conditions for the existence of the controller are provided by stochastic Lyapunov method. An illustrative numerical example is employed to demonstrate the applicability and flexibility of the proposed design strategy.

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

networked control system
random communication delays
observer-based control


An on-line handwritten Japanese text recognition system free from line direction and character orientation constraints This paper describes an on-line handwritten Japanese text recognition system that is liberated from constraints on line direction and character orientation. The recognition system first separates freely written text into text line elements, second estimates the line direction and character orientation using the time sequence information of pen-tip coordinates, third hypothetically segment it into characters using geometric features and apply character recognition. The final step is to select the most plausible interpretation by evaluating the likelihood composed of character segmentation, character recognition, character pattern structure and context. The method can cope with a mixture of vertical, horizontal and skewed text lines with arbitrary character orientations. It is expected useful for tablet PC's, interactive electronic whiteboards and so on.

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

on-line recognition
unconstrained handwriting
character recognition system


QoS-aware roadside base station assisted routing in vehicular networks ? The transmission technology for intelligent transportation systems can be typically classified into two categories, namely, road-to-vehicle communication (RVC) and inter-vehicle communication (IVC). RVCs perform the information communication service offer from road to vehicle whereas the IVCs perform the information communication through vehicles. This work proposes quality of service (QoS)-aware roadside base station assisted routing mechanisms to establish a routing path in IVC with the assistance of roadside base station. A link failure prevention mechanism is employed to effectively construct alternative routing path required by the volatile network topology in vehicular Ad hoc networks. Besides, a bandwidth consumption predictor is presented to avoid dropping packets owing to inadequate bandwidth during handoffs. A neural network with fast learning algorithm is adopted as the core module for estimating the parameters used in the proposed schemes. Simulation results demonstrate the effectiveness and feasibility of the proposed work.

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

quality of service (qos)
inter-vehicle communication
road-to-vehicle communication


Fuzzy logic and its applications in medicine Fuzzy set theory and fuzzy logic are a highly suitable and applicable basis for developing knowledge-based systems in medicine for tasks such as the interpretation of sets of medical findings, syndrome differentiation in Eastern medicine, diagnosis of diseases in Western medicine, mixed diagnosis of integrated Western and Eastern medicine, the optimal selection of medical treatments integrating Western and Eastern medicine, and for real-time monitoring of patient data. This was verified by trials with the following systems that were developed by our group in Vietnam: a fuzzy Expert System for Syndromes Differentiation in Oriental Traditional Medicine, an Expert System for Lung Diseases using fuzzy logic, Case Based Reasoning for Medical Diagnosis using fuzzy set theory, a diagnostic system combining disease diagnosis of Western Medicine with syndrome differentiation of Oriental Traditional Medicine, a fuzzy system for classification of Western and Eastern medicaments and finally, a fuzzy system for diagnosis and treatment of integrated Western and Eastern Medicine.

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

integration of western and eastern medicine


An Optimized High-Throughput Strategy for Constructing Inverted Files Current high-throughput algorithms for constructing inverted files all follow the MapReduce framework, which presents a high-level programming model that hides the complexities of parallel programming. In this paper, we take an alternative approach and develop a novel strategy that exploits the current and emerging architectures of multicore processors. Our algorithm is based on a high-throughput pipelined strategy that produces parallel parsed streams, which are immediately consumed at the same rate by parallel indexers. We have performed extensive tests of our algorithm on a cluster of 32 nodes, and were able to achieve a throughput close to the peak throughput of the I/O system: a throughput of 280 MB/s on a single node and a throughput that ranges between 5.15 GB/s (1 Gb/s Ethernet interconnect) and 6.12 GB/s (10 Gb/s InfiniBand interconnect) on a cluster with 32 nodes for processing the ClueWeb09 data set. Such a performance represents a substantial gain over the best known MapReduce algorithms even when comparing the single node performance of our algorithm to MapReduce algorithms running on large clusters. Our results shed a light on the extent of the performance cost that may be incurred by using the simpler, higher level MapReduce programming model for large scale applications.

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

inverted files
mapreduce
multicore processors
cluster

i/o throughput
parallel algorithms
parallel parsing and indexing
pipeline


The European Logarithmic Microprocessor In 2000 we described a proposal for a logarithmic arithmetic unit, which we suggested would offer a faster, more accurate alternative to floating-point procedures. Would it in fact do so, and could it feasibly be integrated into a microprocessor so that the intended benefits might be realized? Here, we describe the European Logarithmic Microprocessor, a device designed around that unit, and compare its performance with that of a commercial superscalar pipelined floating-point processor. We conclude that the experiment has been successful, and that for 32-bit work, logarithmic arithmetic may now be the technique of choice.

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

high-speed arithmetic
emerging technologies
instruction-set design
simd processors
design studies
logarithmic number system


Contribution of type-2 wind turbines to sub-synchronous resonance damping Type 2 WTs are perceived unable to contribute to power system stability. IEEE FBM for SSR studies is modified with an aggregate Type 2 WPP model for the study. Simple damping control scheme for Type 2 WT based on WAMS as input signal is proposed. Simulation results show promising performance of Type 2 WPP for SSR mitigation.

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

wound rotor induction machine
rotor resistance control
ieee first benchmark model
sub-synchronous resonance
type-2 wind turbine


A bio-inspired multi degree of freedom actuator based on a novel cylindrical ionic polymer-metal composite material In this work, we explore a promising electroactive polymer (EAP), called ionic polymer-metal composite (IPMC) as a material to use as a multi degree of freedom actuator. Configuration of our interest is a cylindrical IPMC with 2-DOF electromechanical actuation capability. The desired functionality was achieved by fabricating unique inter-digitated electrodes. First, a 3D finite element (FE) model was introduced as a design tool to validate if the concept of cylindrical actuators would work. The FE model is based upon the physical transport processes-field induced migration and diffusion of ions. Second, based upon the FE modeling we fabricated a prototype exhibiting desired electromechanical output. The prototype of cylindrical IPMC has a diameter of 1 mm and a 20 mm length. We have successfully demonstrated that the 2-DOF bending of the fabricated cylindrical IPMCs is feasible. Furthermore, the experimental results have given new insight into the physics that is behind the actuation phenomenon of IPMC. (C) 2012 Elsevier B.V. All rights reserved.

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


events not equal to guis The event driven paradigm is ubiquitous in modern software. Many texts introduce events when discussing graphical user interfaces, but the event paradigm extends well beyond that domain. Events also play important roles in operating systems, component based systems, reactive systems, middleware, web services and other fields. Computer science educators have an obligation to see that our students thoroughly understand the event paradigm and have some grounding in tools to develop event driven systems. This paper describes an upper division, computer science elective course in event driven programming. The course gives a comprehensive treatment of event driven systems. It appropriately captures the importance of the event paradigm and serves to integrate concepts from several different computing fields, including Programming Languages, Operating Systems, and Software Engineering. It also introduces students to advanced tools and packages designed for developing event driven systems. The course has been taught four times at our institution, having repeatedly received high marks from the students for both its conceptual and technical content.

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


Diversity of fields in patent citations: synchronic and diachronic changes While there is a large body of research analyzing the overall structure of citation relations for patents, there has been very little research seeking to clarify the characteristics of fields relating to the diffusion of technology through observing the citation network surrounding each patent individually and tracing its growth. This study focused on the classifications assigned to patents and examined the diversity of the fields of patents citing each patent from the following two perspectives: (1) expected values for growth in the number of citing fields, when regarding the observation period as being in a synchronic state and assuming that the strength of connections between each patent and citing fields is constant; and (2) empirical values for growth in the number of citing fields according to the increase in the cumulative number of citations over time. From the results, it was confirmed that the strength of potential connections between each patent and citing fields changes over time. Especially in the fields of chemistry; metallurgy and physics, the following change is considerable: a patent tends to receive citations repeatedly from a limited range of fields for a while, but later comes to be cited by various fields.

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

patent citation
patent classification
time-series variation
japan


LTE mobile network virtualization Exploiting multiplexing and multi-user diversity gain Network virtualization is receiving immense attention in the research community all over the world. There is no doubt that it will play a significant role in shaping the way we do networking in the future. There have been different approaches to virtualize different aspects of the network: some are focusing on resource virtualization like node, server and router virtualization; while others are focusing on building a framework to set up virtual networks on the fly based on different virtual resources. Nevertheless, one very important piece of the puzzle is still missing, that is "Wireless Virtualization". The virtualization of the wireless medium has not yet received the appropriate attention it is entitled to, and there have only been some early attempts in this field. In this paper a general framework for virtualizing the wireless medium is proposed and investigated. This framework focuses on virtualizing mobile communication systems so that multiple operators can share the same physical resources while being able to stay isolated from each other. We mainly focus on the Long Term Evolution (LTE) but the framework can also be generalized to fit any other wireless system. The goal of the paper is to exploit the advantages that can be obtained from virtualizing the LTE system, more specifically virtualizing the air interface (i.e. spectrum sharing). Two different possible gain areas are explored: spectrum multiplexing and multi-user diversity.

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


Semantics and Feature Discovery via Confidence-Based Ensemble Providing accurate and scalable solutions to map low-level perceptual features to high-level semantics is essential for multimedia information organization and retrieval. In this paper, we propose a confidence-based dynamic ensemble (CDE) to overcome the shortcomings of the traditional static classifiers. In contrast to the traditional models, CDE can make dynamic adjustments to accommodate new semantics, to assist the discovery of useful low-level features, and to improve class-prediction accuracy. We depict two key components of CDE: a multi-level function that asserts class-prediction confidence, and the dynamic ensemble method based upon the confidence function. Through theoretical analysis and empirical study, we demonstrate that CDE is effective in annotating large-scale, real-world image datasets.

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

algorithms
performance
classification confidence
image annotation
semantics discovery


VoIP over Wi-Fi Networks: Performance Analysis and Acceleration Algorithms The expected VoIP call capacity in a one hop IEEE 802.11b network with G.711 voice codec is about 85 simultaneous calls, but the actual observed capacity is only 5 calls even at the highest data rate and under zero loss conditions. In this paper we analyze the reasons behind this inferior performance of VoIP traffic. We also present algorithms at the medium access control layer to improve the observed call capacity. Using ns-2 based simulations, we evaluate the algorithms and show that performance improvements of more than 300% can be achieved. Finally, using a testbed implementation of one of the proposed algorithms, we show its feasibilty in real world VoIP implementations.

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

wi-fi networks
ack aggregation
frame aggregation
link adaptation


an l2-miss-driven early register deallocation for smt processors The register file is one of the most critical datapath components limiting the number of threads that can be supported on a Simultaneous Multithreading (SMT) processor. To allow the use of smaller register files without degrading performance, techniques that maximize the efficiency of using registers through aggressive register allocation/deallocation can be considered. In this paper, we propose a novel technique to early deallocate physical registers allocated to threads that experience L2 cache misses. This is accomplished by speculatively committing the load-independent instructions and deallocating the registers corresponding to the previous mappings of their destinations, without waiting for the cache miss request to be serviced. The early deallocated registers are then made immediately available for allocation to instructions within the same thread as well as within other threads, thus improving the overall processor throughput. On the average across the simulated mixes of multiprogrammed SPEC 2000 workloads, our technique results in 33\% improvement in throughput and 25\% improvement in terms of harmonic mean of weighted IPCs over the baseline SMT with the state-of-the-art DCRA policy. This is achieved without creating checkpoints, maintaining per-register counters of pending consumers, performing tag re-broadcasts, register re-mappings and/or additional associative searches.

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

simultaneous multithreading
register files


Decision making based on statistical data, signed distance and compositional rule of inference An assessment of a set of alternatives under certain evaluation criteria has difficulty in dealing with the priority of these alternatives, especially with a lack of precise information in an uncertain environment. Fuzzy numbers are usually applied to represent the imprecise numerical measurements of different alternatives. In this study statistical data are used to derive level (1-alpha,1-beta) interval-valued fuzzy numbers to represent unknown alternative effectiveness scores, after which, by using the compositional rule of inference and signed distance to transform the fuzzy decision making problem into crisp one, one can conveniently obtain the order of these different alternatives and subsequently obtain the best alternative. The approach presented is computationally efficiency, and its underlying concepts are simple and comprehensible. By using this extended generalized method, two cases of an organizational type of rapid-transit-system selection problem are presented as examples to illustrate the applicability of the interval-valued fuzzy numbers and ranking system for decision making. The key contribution of the method is the seamless integration of the statistical data, interval-valued fuzzy number and signed distance to analyze multicriteria decision making problem. The innovation introduced in the model concerns interval-valued fuzzy number which is recognized as a determinant of the effectiveness score in fuzzy relation matrix.

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

signed distance
compositional rule of inference

interval-valued fuzzy number
decision-making
rapid transit system


A positive linear discrete-time model of capacity planning and its controllability properties One of the most important concepts in production planning is that of the establishment of an overall or aggregate production plan. In this paper, the problem of establishing an aggregate production plan for a manufacturing plant is considered. A new dynamic discrete-time model of capacity planning utilizing concepts arising in positive linear systems (PLS) theory is proposed and its controllability property is analyzed. Controllability is a fundamental property of the system with direct implications not only in dynamic optimization problems (such as those arising in inventory and production control) but also in feedback control problems. Some new open problems regarding controllability of stationary and nonstationary PLS with linear constraints are posed in the paper. An optimal control problem for capacity planning is formulated and discussed. (C) 2004 Elsevier Ltd. All rights reserved.

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

positive linear systems
controllability
optimal control

production planning and control
systems theory


A new wireless ad hoc multicast routing protocol An ad hoc network is a multi-hop wireless network of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and mobility require that ad hoc routing protocols be robust, simple, and energy conserving. This paper proposes a new ad hoc multicast routing protocol called neighbor-supporting multicast protocol (NSMP). NSMP adopts a mesh structure to enhance resilience against mobility. And NSMP utilizes node locality to reduce the overhead of route maintenance. NSMP also attempts to improve route efficiency and reduce data transmissions. Our simulation results show that NSMP delivers packets efficiently while substantially reducing control overhead in various environments.

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

ad hoc network
multicast routing
node locality


A Fast Algorithm for Euler's Elastica Model Using Augmented Lagrangian Method Minimization of functionals related to Euler's elastica energy has a wide range of applications in computer vision and image processing. A high order nonlinear partial differential equation (PDE) needs to be solved, and the gradient descent method usually takes high computational cost. In this paper, we propose a fast and efficient numerical algorithm to solve minimization problems related to Euler's elastica energy and show applications to variational image denoising, image inpainting, and image zooming. We reformulate the minimization problem as a constrained minimization problem, followed by an operator splitting method and relaxation. The proposed constrained minimization problem is solved by using an augmented Lagrangian approach. Numerical tests on real and synthetic cases are supplied to demonstrate the efficiency of our method.

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

image inpainting
image denoising
image zooming
constrained minimization
augmented lagrangian method


csp parallel composition of aspect models We present an approach to aspect specification based on the Protocol Modelling paradigm, which uses CSP parallel composition as the mechanism for combining partial behaviour specifications. Using the Protocol Modelling approach enables local reasoning about the behaviour of the whole model based on knowledge of behaviour of the composed aspects, and we present the proof of this key property in this paper. We describe how Protocol Modelling allows the definition of aspect join points and weaving relationships at the model level, and how different aspects may use different abstractions over the same domain. We illustrate this using a small case example.

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

protocol modelling
aspects
models
local reasoning
join points


automatic metadata generation for scanned scientific volumes Large scale digitization projects have been conducted at the Internet Archive digital library to preserve cultural artifacts and to provide permanent access. The increasing amount of digitized resources requires advanced tools and methods that will efficiently analyze and manage digitized resources. In this position paper, we identify several issues related to scanned books projects, present our initial work on automatic metadata generation for scanned scientific journals, and suggest potential future actions.

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


Numerical methods for solving the relativistic Oppenheimer Volkoff equations In this paper, three methods for computing non-rotating neutron star models are discussed. The relativistic Oppenheimer Volkoff (OV) equations of hydrostatic equilibrium are solved using (a) the well-known variable step method, (b) a method based on a modified form of the OV equations, where the thermodynamic enthalpy function is the independent variable, and (c) a new straightforward method, based on the ODEPACK Fortran package for solving systems of differential equations. We present results concerning several equations of state and conclusions concerning the applicability of each method.

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

equations of state
methods
numerical
neutron


Automatic sleep stage recurrent neural classifier using energy features of EEG signals This paper presents a recurrent neural classifier for automatically classifying sleep stages based on energy features from the EEG signal of the Fpz?Cz channel. The energy features were extracted from characteristic waves of EEG signals which were then used to classify different sleep stages. The recurrent neural classifier, utilizing energy features extracted from EEG signals, assigned each 30-s epoch to one of five possible sleep stages: wakefulness, NREM 1, NREM 2, SWS, and REM. Eight sleep recordings obtained from the Sleep-EDF database, which is available from the PhysioBank, were utilized to validate the proposed method. Using the features extracted by our research, classification performance of a feedforward neural network (FNN) and a probabilistic neural network (PNN) were compared to that of the proposed recurrent neural classifier. The classification rate of the recurrent neural classifier was found to be better (87.2%) than those of the two neural classifiers (81.1% for FNN and 81.8% for PNN). The result demonstrates that the proposed recurrent neural classifier using the energy features extracted from characteristic waves of EEG signals can classify sleep stages more efficiently and accurately using only a single EEG channel.

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

sleep stage analysis
recurrent neural classifiers


An evolving surrogate model-based differential evolution algorithm To improve the performance of differential evolution (DE) algorithm. We present an evolving surrogate model-based differential evolution (ESMDE) method. In ESMDE, the surrogate model is constructed using population members of the current generation. Surrogate model assists in producing competitive offspring during the evolution. Surrogate model evolves with population to better represent the search basin.

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

global optimization
parameter adaptation
ensemble


Dynamic multi-cue tracking using particle filter We present a novel particle filter approach in this paper for robust object tracking using multi-cue association. In contrast to conventional particle trackers that are based on the single space, which does not provide enough information of good foreground/background discrimination, mapping the object into multiple spaces can help to seize the most informative properties of distinguishing the target from background. Moreover, the proposed algorithm commands all the spaces and their corresponding judgments in a global boosting view, which is implemented in an incremental manner to strengthen the ability of separating the target and background classes. The implicit appearance model is then used in updating step of the particle filter to measure the target region. Experimental results on several challenging video sequences have verified that the proposed method is compared very robust and effective with the traditional particle filter in many complicated scenes.

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


A formal theory for optimal and information theoretic syntactic pattern recognition In this paper we present a foundational basis for optimal and information theoretic syntactic pattern recognition. We do this by developing a rigorous model, , for channels which permit arbitrarily distributed substitution, deletion and insertion syntactic errors. More explicitly, if A is any finite alphabet and A? the set of words over A, we specify a stochastically consistent scheme by which a string U?A? can be transformed into any Y?A? by means of arbitrarily distributed substitution, deletion and insertion operations. The scheme is shown to be functionally complete and stochastically consistent. Apart from the synthesis aspects, we also deal with the analysis of such a model and derive a technique by which Pr[Y?U], the probability of receiving Y given that U was transmitted, can be computed in cubic time using dynamic programming. One of the salient features of this scheme is that it demonstrates how dynamic programming can be applied to evaluate quantities involving complex combinatorial expressions and which also maintain rigid probability consistency constraints. Experimental results which involve dictionaries with strings of lengths between 7 and 14 with an overall average noise of 39.75% demonstrate the superiority of our system over existing methods. Apart from its straightforward applications in string generation and recognition, we believe that the model also has extensive potential applications in speech, uni-dimensional signal processing, and computational molecular biology.

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

optimal and information theoretic pattern recognition string generation


Buffer Minimization in Earliest-Deadline First Scheduling of Dataflow Graphs Symbolic schedulability analysis of dataflow graphs is the process of synthesizing the timing parameters (i.e. periods, phases, and deadlines) of actors so that the task system is schedulable and achieves a high throughput when using a specific scheduling policy. Furthermore, the resulted schedule must ensure that communication buffers are underflow- and overflow-free. This paper describes a (partitioned) earliest-deadline first symbolic schedulability analysis of dataflow graphs that minimizes the buffering requirements. Our scheduling analysis consists of three major steps. (1) The construction of an abstract affine schedule of the graph that excludes overflow and underflow exceptions and minimizes the buffering requirements assuming some precedences between jobs. (2) Symbolic deadlines adjustment that guarantees precedences without the need for lock-based synchronizations. (3) The concretization of the affine schedule using a symbolic, fast-converging, processor-demand analysis for both uniprocessor and multiprocessor systems. Experimental results show that our technique improves the buffering requirements in many cases.

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

dataflow graphs
symbolic schedulability analysis
buffer minimization

theory
algorithms
design
affine relation
earliest-deadline first scheduling


social software in global software development Social software (SoSo) is defined by Farkas as tools that (1) allow people to communicate, collaborate, and build community online (2) can be syndicated, shared, reused or remixed and (3) let people learn easily from and capitalize on the behavior and knowledge of others. [1]. SoSo include a wide variety of tools such as: instant messaging, internet forums, mailing lists, blogs, wikis, social network sites, social bookmarking, social libraries, virtual worlds. Though normally rather belonging to the private realm, the use of social software in corporate context has been reported, e.g. as a way to share knowledge [2, 3].

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

social software
global software development


A semi-dependent decomposition approach to learn hierarchical classifiers In hierarchical classification, classes are arranged in a hierarchy represented by a tree or a forest, and each example is labeled with a set of classes located on paths from roots to leaves or internal nodes. In other words, both multiple and partial paths are allowed. A straightforward approach to learn a hierarchical classifier, usually used as a baseline method, consists in learning one binary classifier for each node of the hierarchy; the hierarchical classifier is then obtained using a top-down evaluation procedure. The main drawback of this naive approach is that these binary classifiers are constructed independently, when it is clear that there are dependencies between them that are motivated by the hierarchy and the evaluation procedure employed. In this paper, we present a new decomposition method in which each node classifier is built taking into account other classifiers, its descendants, and the loss function used to measure the goodness of hierarchical classifiers. Following a bottom-up learning strategy, the idea is to optimize the loss function at every subtree assuming that all classifiers are known except the one at the root. Experimental results show that the proposed approach has accuracies comparable to state-of-the-art hierarchical algorithms and is better than the naive baseline method described above. Moreover, the benefits of our proposal include the possibility of parallel implementations, as well as the use of all available well-known techniques to tune binary classification SVMs.

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

multi-label learning
structured output classification
cost-sensitive learning
support vector machines


A utility-based fuzzy TOPSIS method for energy efficient network selection in heterogeneous wireless networks ? Mobile terminals in 4G heterogeneous wireless networks continuously undergo horizontal and vertical handovers. In order for a mobile terminal to be connected to a network in the best possible way in terms of QoS performance and energy consumption, access network selection as the main decision within the handover process is obviously crucial. This paper presents a novel method that takes into account user preferences, network conditions, QoS and energy consumption requirements in order to select the optimal network which achieves the best balance between performance and energy consumption. The proposed network selection method incorporates the use of parameterized utility functions in order to model diverse QoS elasticities of different applications, and adopts different energy consumption metrics for real-time and non-real-time applications. User preferences are easily configured for different application and situation contexts through the use of linguistic assessments and their representation as triangular fuzzy numbers. The aggregation of multiple criteria for the calculation of the overall rating of the networks is performed through the use of the Fuzzy Set Representation TOPSIS method that resolves the issue of inconsistency related to conflicting decision criteria and is modified through the use of the employed utility functions for the elimination of the ranking abnormality problem. Finally, simulations are conducted in order to demonstrate how the proposed method would work and confirm its suitability and effectiveness.

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

network selection
topsis
utility functions

vertical handover
energy efficiency
fuzzy multiple criteria decision-making


Semantic and phonetic automatic reconstruction of medical dictations Automatic speech recognition (ASR) has become a valuable tool in large document production environments like medical dictation. While manual post-processing is still needed for correcting speech recognition errors and for creating documents which adhere to various stylistic and formatting conventions, a large part of the document production process is carried out by the ASR system. For improving the quality of the system output, knowledge about the multi-layered relationship between the dictated texts and the final documents is required. Thus, typical speech-recognition errors can be avoided, and proper style and formatting can be anticipated in the ASR part of the document production process. Yet while vast amounts of recognition results and manually edited final reports are constantly being produced the error-free literal transcripts of the actually dictated texts are a scarce and costly resource because they have to be created by manually transcribing the audio files. To obtain large corpora of literal transcripts for medical dictation, we propose a method for automatically reconstructing them from draft speech-recognition transcripts plus the corresponding final medical reports. The main innovative aspect of our method is the combination of two independent knowledge sources: phonetic information for the identification of speech-recognition errors and semantic information for detecting post-editing concerning format and style. Speech recognition results and final reports are first aligned, then properly matched based on semantic and phonetic similarity, and finally categorised and selectively combined into a reconstruction hypothesis. This method can be used for various applications in language technology, e.g., adaptation for ASR, document production, or generally for the development of parallel text corpora of non-literal text resources. In an experimental evaluation, which also includes an assessment of the quality of the reconstructed transcripts compared to manual transcriptions, the described method results in a relative word error rate reduction of 7.74% after retraining the standard language model with reconstructed transcripts.

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

automatic transcription
semantics
phonetics


AbsIDconvert: An absolute approach for converting genetic identifiers at different granularities High-throughput molecular biology techniques yield vast amounts of data, often by detecting small portions of ribonucleotides corresponding to specific identifiers. Existing bioinformatic methodologies categorize and compare these elements using inferred descriptive annotation given this sequence information irrespective of the fact that it may not be representative of the identifier as a whole.

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

gene id conversion
meta-analysis
genomic range
interval trees
comparative analysis
granularity
universal identifier


SPP: An anti-phishing single password protocol ? Most users have multiple accounts on the Internet where each account is protected by a password. To avoid the headache in remembering and managing a long list of different and unrelated passwords, most users simply use the same password for multiple accounts. Unfortunately, the predominant HTTP basic authentication protocol (even over SSL) makes this common practice remarkably dangerous: an attacker can effectively steal users passwords for high-security servers (such as an online banking website) by setting up a malicious server or breaking into a low-security server (such as a high-school alumni website). Furthermore, the HTTP basic authentication protocol is vulnerable to phishing attacks because a client needs to reveal his password to the server that the client wants to login. In this paper, we propose a protocol that allows a client to securely use a single password across multiple servers, and also prevents phishing attacks. Our protocol achieves client authentication without the client revealing his password to the server at any point. Therefore, a compromised server cannot steal a clients password and replay it to another server. Our protocol is simple, secure, efficient and user-friendly. In terms of simplicity, it only involves three messages. In terms of security, the protocol is secure against the attacks that have been discovered so far including the ones that are difficult to defend, such as the malicious server attacks described above and the recent phishing attacks. Essentially our protocol is an anti-phishing password protocol. In terms of efficiency, each run of our protocol only involves a total of four computations of a one-way hash function. In terms of usability, the protocol requires a user to remember only one password consisting of eight (or more) random characters, and this password can be used for all of his accounts.

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

password protocols
network security
protocol design


Ordered semigroups characterized by interval valued (is an element of, is an element of boolean OR q)-fuzzy bi-ideals In this article, we first introduce the concept of quasi-coincidence of an interval valued fuzzy point with an interval valued fuzzy subset. This concept is a generalization of the concept of quasi-coincidence of a fuzzy point within a fuzzy subset. By using this new idea, we introduce the concept of an interval valued (alpha, beta)-fuzzy bi-ideals in ordered semigroups. Which is a generalization of the idea of an (alpha, beta)-fuzzy bi-ideals in ordered semigroups. Some interesting results of the algebraic ordered semigroups in terms of interval valued (alpha, beta)-fuzzy bi-ideals are given. By using interval valued (is an element of, is an element of boolean OR q)-fuzzy bi-ideals some interesting results are obtained.

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

interval valued (is an element of, is an element of boolean or q)-fuzzy bi-ideals


Conflicts of interest statements on biomedical papers This paper examines the varying prevalence of conflict of interest (COI), and no conflict, statements on biomedical research papers, which are increasingly being required by journal editors. They are important as they may detract from the perceived objectivity of the results if the authors are in the pay of commercial companies. However, the frequency of these statements in the web of science (WoS) is only a few percent of the total number of biomedical papers. A survey of journal editors revealed that many COI statements are excluded from the WoS because they are printed separately from the acknowledgement section of the paper. One consequence of the appearance of COI statements on papers is that the WoS mistakenly includes companies who have given money to some of the researchers for unrelated work among the sponsors listed among the funding organizations, and this will distort the analysis of the funding of the research being reported in some of the papers and appears nearly to double companies apparent tally of papers.

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

conflict of interest
funding
no conflict
web of science


aligning learning objectives with service-learning outcomes in a mobile computing application We propose the development of a mobile, location-aware tour of the Bonsai Exhibition Garden of the North Carolina Arboretum. The tour will be a web-based, customizable, multimedia presentation on handheld Personal Digital Assistants. The complete tour, including all presentation materials and system installation, will be developed via a series of three classes at the University of North Carolina at Asheville. These classes, Database Management Systems, Human Computer Interface, and Systems Integration, will occur over a period of two semesters. The objective of this work is to create relevant and effective coursework that empowers students. Students produce state-of-the-art technology that serves their community thereby demonstrating the value of both the technology and their understanding of that technology for the betterment of others.

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

service learning
guided tour
location-aware computing
project-based coursework


low-degree tests at large distances We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between soundness and the number of queries. A central step in our analysis of quadraticity tests is the proof of aninverse theorem for the third Gowers uniformity norm of boolean functions. The last result implies that it ispossible to estimate efficiently the distance from the second-order Reed-Muller code on inputs lying far beyond its list-decoding radius. Our main technical tools are Fourier analysis on Z 2 n and methods from additive number theory. We observe that these methods can be used to give a tight analysis of the Abelian Homomorphism testing problemfor some families of groups, including powers of Z p .

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


high quality queueing information from accelerated active network tomography Monitoring network state can be crucial in Future Internet infrastructures. Passive monitoring of all the routers is expensive and prohibitive. Storing, accessing and sharing the data is a technological challenge among networks with conflicting economic interests. Active monitoring methods can be attractive alternatives as they are free from most of these issues. Here we demonstrate that it is possible to improve the active network tomography methodology to such extent that the quality of the extracted link or router level delay is comparable to the passively measurable information. We show that the temporal precision of the measurements and the performance of the data analysis should be simultaneously improved to achieve this goal. In this paper we not only introduce a new efficient message-passing based algorithm but we also show that it is applicable for data collected by the ETOMIC high precision active measurement infrastructure. The measurements are conducted in the GEANT2 high speed academic network connecting the sites, which is an ideal test ground for such Future Internet applications.

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

queueing delay tomography
oneway delay measurement


HapticFlow: PDE-based mesh editing with haptics This paper presents HapticFlow, a haptics-based direct mesh editing system founded upon the concept of PDE-based geometric surface flow. The proposed flow-based approach for direct geometric manipulation offers a unified design paradigm that can seamlessly integrate implicit, distance-field based shape modeling with dynamic, physics-based shape design. HapticFlow provides an intuitive haptic interface and allows users to directly manipulate 3D polygonal objects with ease. To demonstrate the effectiveness of our new approach, we developed a variety of haptics-based mesh editing operations such as embossing, engraving, sketching as well as force-based shape manipulation operations. Copyright (C) 2004 John Wiley Sons, Ltd.

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

pde
distance field
interaction techniques


Comparison of optical performance monitoring techniques using artificial neural networks In this paper, we make an overview of three techniques that have used artificial neural networks (ANNs) to model impairments in optical fiber. A comparison between a linear partial least squares regression algorithm and ANN is also shown. We demonstrate that nonlinear modeling is required for multi-impairment monitoring in optical fiber when using Parametric Asynchronous Eye Diagram (PAED). Results demonstrating the accuracy of PAED are also shown. A comparison between PAED and Synchronous Eye Diagrams is also demonstrated, for NRZ, RZ and QPSK modulated signals. We show that PAED can provide comprehensible diagrams for QPSK modulated signals, under a certain range of chromatic dispersion.

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

optical performance monitoring
artificial neural networks
partial least squares
parametric asynchronous eye diagram

delay-tap asynchronous sampling
asynchronous amplitude histograms


A graph rewriting system for process platform planning Facilitating production process planning for product families, process platform planning (P3) has been well recognized as an effective means of achieving production efficiency. To support decision making in P3 automation, this study adopts graph rewriting systems to 1) organize large volumes of product and process data and 2) model production process planning reasoning. The model developed represents the structural and behavioral aspects of process platforms as family graphs and related graph transformations, respectively. In view of its modeling advantage, the system is formally defined using PROGRES. It includes meta, generic, and instance models at three different levels of abstraction. Meta models are defined for family graphs to generalize the patterns common to planning production processes for different product families; generic models are defined to describe entities pertaining to production processes of specific product families; instance models represent production processes producing product variants in a family. The graph rewriting system-based P3 model is applied to textile spindles' production process planning. The results obtained have demonstrated its potential and feasibility to support decision making in P3 automation.

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

process platform planning
graph rewriting system
progres


Cluster approach of active sites in an MoS2 catalyst The present paper reports a Density Functional Theory (DFT) study of a Mo12S24 cluster as a model of the active phase in hydrodesulphurisation (HDS). Different types of sulphur vacancies are considered and compared. The interaction of a thiophene molecule with a double vacancy is simulated leading to the determination of a stable configuration which corresponds to a flat adsorption on the edge of the MoS2 sheets. The dissociative adsorption of molecular hydrogen on a double vacancy is also considered.

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

hydrotreatment
molybdenum disulphide
catalytic sites


Non-negative matrix factorization and its application in blind sparse source separation with less sensors than sources Purpose - Proposes a non-negative matrix factorization method. Design/methodology approach - Presents an algorithm for finding a suboptimal basis matrix. This is controlled by data cluster centers which can guarantee that the coefficient is very sparse. This leads to the proposition of an application of non-matrix factorization for blind sparse source separation with less sensors than sources. Findings - Two simulation examples reveal the validity and performance of the algorithm in this paper. Originality/value - Using the approach in this paper, the sparse sources can be recovered even if the sources are overlapped to some degree.

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

matrix algebra
programming and algorithm theory


THE VARIANT OF LATENT DIRICHLET ALLOCATION FOR NATURAL SCENE CLASSIFICATION The paper proposes a novel model based on classic LDA (latent Dirichlet allocation), which is used to learn and recognize natural scene category. Uunlike previous work, the model performs variational Bayesian inference (VB) two times in order to get more precise prior Dirichlet parameters for each scene category. Although the scenes is represented in common topic simplex, the model has retained the diversities of each scene category based on the same topic simplex. Furthermore, two discriminations have been clone to get good performance. We investigated the classification performance with classic 13 scenes image database and the experiments had demonstrated that our method can get better performance with less training time.

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


does it matter if a computer jokes The goal here was to determine whether computer interfaces are capable of social influence via humor. Users interacted with a natural language capable virtual agent that told persuasive information, and they were given the option to use information from the dialogue in order to complete a problem-solving task. Individuals interacting with an ostensibly humorous virtual agent were influenced by it such that those who judged the agent unfunny were less likely to be persuaded and departed from the agent's suggestions. We discuss the implications of these results for HCI involving natural language systems and virtual agents.

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

joy of use
social influence and persuasion


A fully complex-valued radial basis function classifier for real-valued classification problems In this paper, we investigate the decision making ability of a fully complex-valued radial basis function (FC-RBF) network in solving real-valued classification problems. The FC-RBF classifier is a single hidden layer fully complex-valued neural network with a nonlinear input layer, a nonlinear hidden layer, and a linear output layer. The neurons in the input layer of the classifier employ the phase encoded transformation to map the input features from the Real domain to the Complex domain. The neurons in the hidden layer employ a fully complex-valued Gaussian-like activation function of the type of hyperbolic secant (sech). The classification ability of the classifier is first studied analytically and it is shown that the decision boundaries of the FC-RBF classifier are orthogonal to each other. Then, the performance of the FC-RBF classifier is studied experimentally using a set of real-valued benchmark problems and also a real-world problem. The study clearly indicates the superior classification ability of the FC-RBF classifier.

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


An optimization problem arising in the design of multiring systems We address a design problem that arises when a circular architecture is adopted to move resources in a system. In many of such architectures the demand directed from one node to another affects all the intermediate nodes, involving costs which increase both with the number of nodes and with the demand volume. We consider an application to network design and propose a model for designing a minimum cost hierarchical ring network. The problem is formalized as that of partitioning a set of nodes into p parts to be connected by rings, with the aim of minimizing the total capacity costs. We prove that the problem is NP-complete for p?2 and propose a guaranteed approximation algorithm for the case p=2. We then propose a hybrid approach employing the approximation algorithm in combination with {0,1} LP. Experiments indicate the effectiveness of this approach in terms of computational resources and solution quality.

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

hierarchical ring networks
computational complexity
approximation algorithms


Modeling and simulation development of electron beam resist based on cellular automata This paper presents a robust Cellular Automata model which predicts the two dimensional development profile as a function of development time, exposure dose and electron beam resist type. The main advantage of CA model is that they exhibit high efficiency and accuracy when handling arbitrarily complex system. In the CA method, A resist is represented by an array of discrete cells that reside in a crystalline lattice. Development of the resist is represented by removal and of individual cell according to development rules. During development, the decision to remove or retain a particular cell is based on the link status of its lattice neighbors according to cell-removal rules, The link status is categorized by number of neighboring cells and their relative positions. The modeling approach also uses Monte-Carlo simulation of electron scattering and energy dissipation and a simple development rate versus dose model for the resist. An absolute quantitative evaluation of the simulation accuracy is made based on resist exposure-development measurement and comparisons with SEM micrographs of experimental profiles of PMMA, SAL601 and ZEP520.The comparisons show good quantitative agreement and indicate the model based on CA can be used as a quantitative processing aid. Simulation results illustrate the importance of resist, beam and dose.

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


Modelling spray drift from boom sprayers A random-walk model, IDEFICS, is described to compute downwind spray drift from conventional boom sprayers in chemical crop protection. Spray deposits are computed downwind from the sprayed crop field. The model basically is two-dimensional (2D), but close to the spray nozzle the model is 3D, incorporating driving speed and entrained air-currents below the nozzle. Input parameters are related to the geometry of the field, to the boom sprayer settings and to environmental factors. The model was calibrated with a set of field trials using an experimental single-nozzle sprayer in a cross wind. In the trials, tap water containing a fluorescent dye was used as the spraying liquid, and downwind deposits were measured by fluorimetry. Variations of boom height, spray nozzle size, driving speed and liquid pressure were examined, at varying wind speeds. Both experiments and simulations showed that boom height, wind speed and nozzle size were the major factors affecting spray drift. Surprisingly, liquid pressure did not affect downwind spray deposits at all. A comparison between model results and results of a practical field trial showed a good agreement if field trials were averaged over several replications. The variation between individual replications is however too large to use single trials for model verification. Further calibration trials are needed to investigate the effect on drift of multi-nozzle arrangements, crop height and medium- and coarse-sized spray nozzles.

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


Design of a low power and low latency MAC protocol with node grouping and transmission pipelining in wireless sensor networks In wireless sensor networks (WSNs), the strategies of periodical sleep and contention to use the channel for transmission are efficient in terms of power consumption and channel utilization. However, contention and sleep cause other power consumption problems, namely the overhearing Of the control packets and increased transmission latency. In this paper, we propose the use of node grouping and transmission pipelining to reduce power consumption and transmission delay. In the design of node grouping, there are several groups in a WSN, where nodes in different groups wake up at different time. Each sensor node is initially set to belong to one of these groups. In contrast to the situation in which all nodes hear the control packets during the contention period, node grouping reduce the number of nodes that overhears the control packets at the same time to reduce power consumption, To establish communication between nodes belonging to different groups, we assign a group table to each node. The group table recodes the group indices of all the neighbors of that node. With looking up a group table in a sensor node, a sender can wake up at the group time of the receiver. As a result, two nodes belonging to different groups can communicate with other. With regard to transmission delay of a multi-hop path in WSNs, if a sender transmits data to the receiver and the receiver cannot send the data to the next receiver right now, the transmission delay increases. To reduce the transmission delay. we propose the transmission pipelining method. Transmission pipelining makes the group number of the nodes on a path to be continuous. Therefore, the sensor node is thus able to transmit data to the sink node pipelining. From the simulation results, when the number of groups is 2, the power consumed in transmitting a byte (mj/byte) and the transmission delay in our proposed design are better than those of SMAC by about 50%. When the number of groups is 4, although the transmission delay is only a little better than that of SMAC, the power consumed in transmitting a byte in our proposed design is much less than the power consumed in SMAC by 75%. (C) 2008 Elsevier B.V. All rights reserved.

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