load balancing via random local search in closed and open systems In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch servers independently at random instants of time in an attempt to improve their service rate. This approach to load balancing contrasts with traditional approaches where clients make smart server selections upon arrival (e.g., Join-the-Shortest-Queue policy and variants thereof). Load resampling is particularly relevant in scenarios where clients cannot predict the load of a server before being actually attached to it. An important example is in wireless spectrum sharing where clients try to share a set of frequency bands in a distributed manner. We first analyze the natural Random Local Search (RLS) strategy. Under this strategy, after sampling a new server randomly, clients only switch to it if their service rate is improved. In closed systems, where the client population is fixed, we derive tight estimates of the time it takes under RLS strategy to balance the load across servers. We then study open systems where clients arrive according to a random process and leave the system upon service completion. In this scenario, we analyze how client migrations within the system interact with the system dynamics induced by client arrivals and departures. We compare the load-aware RLS strategy to a load-oblivious strategy in which clients just randomly switch server without accounting for the server loads. Surprisingly, we show that both load-oblivious and load-aware strategies stabilize the system whenever this is at all possible. We further demonstrate, using large-system asymptotics, that the average client sojourn time under the load-oblivious strategy is not considerably reduced when clients apply smarter load-aware strategies.

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

mean field asymptotics
stability analysis


a business driven cloud optimization architecture In this paper, we discuss several facets of optimization in cloud computing, the corresponding challenges and propose an architecture for addressing those challenges. We consider a layered cloud where various cloud layers virtualize parts of the cloud infrastructure. The architecture takes into account different stakeholders in the cloud (infrastructure providers, platform providers, application providers and end users). The architecture supports self-management by automating most of the activities pertaining to optimization: monitoring, analysis and prediction, planning and execution.

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

performance engineering
performance modeling
software as a service


a wrapper generation system for pdf documents The widespread use of the PDF format for exchanging print-oriented documents raises new challenges in the research field of information extraction. In this paper we present a novel wrapper generation system for extracting information from PDF documents. Objects in a PDF document are accessible by their position, thus we exploit spatial constraints for driving the extraction of relevant information according to a set of group type definitions. Moreover, using fuzzy logic based conditions enables effectively handling uncertainty on the comprehension of the layout structure of PDF documents. The experimental results shown in the paper state a good accuracy of our PDF wrapping system.

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

generation
uncertainty
use
layout
group
paper
spatial
research
structure
accuracy
extraction
exploit
wrapper
fuzzy logic
comprehension

challenge
drive
definition
object
relevance
access
constraint
informal
posit
printing
experimentation
systems
information extraction
documentation


Network fair bandwidth share using hash rate estimation In this paper, we evaluate the effectiveness of the current active queue management (AQM) schemes, such as Random Early Detection (RED) and match-based CHOKe, over traffic with different packet-size flows and over traffic with mixed adaptive and nonadaptive flows. We find that these schemes allow unfair bandwidth sharing when flows with different packet sizes share a link or when numerous adaptive and nonadaptive flows coexist in a link. In particular, the match-based schemes present greater unfairness, especially when more nonadaptive flows exist in a shared link. We propose a novel AQM scheme, called Hash Rate Estimation (HRE). The proposed scheme, which works with a FIFO queue, uses per-active-flow rate estimation to impose a fair share on each flow. We show that HRE provides better protection than does Fair Random Early Drop (FRED), which uses per-flow accounting to allocate each flow its fair share by a fixed dropping probability that depends on the flow's buffer use. HRE can support a large number of flows using hash function sorting. In addition, the queue length under HRE is bounded and the characteristics of traffic regulated by HRE are similar to those achieved by the per-flow fair queuing schemes. (C) 2002 Wiley Periodicals, Inc.

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

hash rate estimation
active queue management
fair random early drop


Estimation of primary production in the ocean using a physical-biological coupled ocean carbon cycle model A lower-trophic marine ecosystem model that takes into account both the grazing food web and the microbial food web has been developed to investigate the ocean carbon cycle. The ecosystem model was coupled to an oceanic general circulation model and a simulation was performed to examine the temporal and spatial distribution of primary production in the world ocean. Numerical results revealed that the total amount of annual net primary production reaches nearly 61.2 GtC, showing fair agreement with the recent estimates based on the satellite image analysis. The annual flux of particulate organic carbon toward the subsurface layer, viz., the export flux, was evaluated as 5.5 GtC. The model results reproduced the general tendency that the regions of low latitude are characterized by high primary productivity as well as low export flux, and suggested a dominant role for the microbial food web in the oceanic carbon cycle. (C) 2004 Elsevier Ltd. All rights reserved.

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

microbial food web
net primary production
export flux

global ocean carbon cycle
coupled physical and biological model


Implementation of THD-reduction stereo audio amplifier using compensators and sigma-delta modulators This paper presents an integrated stereo audio amplifier that employs sigma-delta (I I") pound modulation techniques with compensators. Traditional closed-loop audio amplifiers adopt pulse-width modulation or I I" pound modulation techniques. The design method proposed in this study uses a negative feedback closed-loop system with compensator and I I" pound modulator. This combination of compensator and I I" pound modulator significantly reduces the noise and total harmonic distortion (THD) compared with a traditional closed-loop system. The proposed negative feedback loop can automatically compensate for external perturbations, improving the precision of the eventual output. The compensator increases the audio-frequency loop gain, and leads to better rejection of audio-frequency disturbances. At a sample rate of 10 MHz, the proposed audio amplifier achieves 0.04% THD and a signal to noise ratio of 87 dB with efficiency above 92%. The proposed audio amplifier was implemented in a TSMC 3.3 V 0.35 mu m 2P4M CMOS process.

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

audio amplifier
total harmonic distortion
signal to noise ratio


Optimal water use and treatment allocation Water consumption and emission can be decreased by optimal allocation of water re-use, regeneration and re-use. regeneration and recycle in water consuming mass exchange networks and by applying optimally distributed effluent treatment processes in case of several emission sources of different contamination levels. Several example problems taken from the literature have been reproduced and solved by GAMS/MINOS/CONOPT package. In most cases our optimal solution is identical to those of others; in some other cases, however, we found better solutions. We also found our method more flexible than those based on targeting and conceptual design. Some example problems involve constraints and/or specifications of those kinds the referred methods cannot deal with. Namely, the constant mass load specification is substituted by either mass load proportional to the;water flow rate (involving constant concentration shift) or some other, even more realistic, non-linear functions. The optimal systems have different structures according to the applied mass load relations.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 water allocation
mathematical programming
wastewater minimisation


New t-gap insertion-deletion-like metrics for DNA hybridization thermodynamic modeling We discuss the concept of t-gap block isomorphic subsequences and use it to describe new abstract string metrics that are similar to the Levenshtein insertion-deletion metric. Some of the metrics that we define can be used to model a thermodynamic distance function on single-stranded DNA sequences. Our model captures a key aspect of the nearest neighbor thermodynamic model for hybridized DNA duplexes. One version of our metric gives the maximum number of stacked pairs of hydrogen bonded nucleotide base pairs that can be present in any secondary structure in a hybridized DNA duplex without pseudoknots. Thermodynamic distance functions are important components in the construction of DNA codes, and DNA codes are important components in biomolecular computing, nanotechnology, and other biotechnical applications that employ DNA hybridization assays. We show how our new distances can be calculated by using a dynamic programming method, and we derive a Varshamov-Gilbert-like lower bound on the size of some of codes using these distance functions as constraints. We also discuss software implementation of our DNA code design methods.

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

dna hybridization
dna code
stacked pairs

insertion-deletion
common subsequence
nearest neighbor thermodynamics
weighted sequences
t-gap block isomorphic subsequences


Anytime heuristic search in temporal HTN planning for developing incident action plans Extreme events challenge emergency managers' decision making capabilities of developing unified action plans to ensure effective coordination for multiple responding agencies. In this paper, we present a novel HTN planner, called XEPlanner, aimed at working in dynamic emergency response environment with critical time constraints. By understanding incident action plans developing process and characteristics of flood controlling, this paper proposes a set of planning requirements as the guidance for designing a domain specific HTN planner, which challenge the current known HTN planners. Based on the classical AI planning technologies, our planner is designed and implemented for adapting to the application domain. It follows the anytime principles: the first feasible plan can be quickly produced and the quality of the plans is improved as more time is available. Additionally, a set of heuristics for selecting search nodes is proposed for taking into account preferences of emergency managers during the planning process. Moreover, the priorities of incident objectives can be handled effectively. Our experimental results demonstrate that our planner satisfies all the proposed planning requirements and has advantages when it's applied in flood evacuation domain.

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

extreme events
emergency response
htn planning
anytime heuristic search


A new exact method for the two-dimensional orthogonal packing problem ? The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles (items) can be packed into one rectangle of fixed size (bin). In this paper we propose two exact algorithms for solving this problem. The first algorithm is an improvement on a classical branch&bound method, whereas the second algorithm is based on a new relaxation of the problem. We also describe reduction procedures and lower bounds which can be used within enumerative methods. We report computational experiments for randomly generated benchmarks which demonstrate the efficiency of both methods: the second method is competitive compared to the best previous methods. It can be seen that our new relaxation allows an efficient detection of non-feasible instances.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 application of uplink common channel to packet relay in CDMA radio access networks Multihop techniques in CDMA radio access networks, enable dead-spot mobile stations, which cannot communicate with base stations directly, to send data to them via other mobile stations. In this paper, we propose a mechanism for establishing connections and relaying packets between mobile stations. In this mechanism, the mobile stations are connected to one another and relay packets through a random access channel, which is an uplink common channel. In addition, our mechanism satisfies the requirements for applying multihop techniques to third generation radio access networks. Moreover, we also discuss our evaluation of the performance of the mechanism through computer simulations. The results we obtained reveal that it is capable of reducing dead-spot mobile stations and improving throughput with only limited modifications to conventional systems. Furthermore, we propose an adaptive transmission power control to enhance our mechanism and also evaluate this method through computer 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 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

3g radio access networks
two-hop relaying
dead spot


A qualitative simulation model for cotton growth and development Qualitative simulation models use variables that take on categorical rather than continuous values. Qualitative models for crop growth may serve as useful alternatives or complements to traditional crop growth models. The objective of this study was to demonstrate the development and use of a methodology for constructing qualitative crop models. We developed and tested a qualitative simulation model for the growth and development of Acala cotton in the San Joaquin Valley, California. The model is based on a logical description of cause and effect, and on the comparison of input data with projected solutions. The simulation contains eight time stages, ranging from crop emergence to late-season production of fruiting structures. Implementation of the model requires that it be calibrated, verified, and validated. Procedures for carrying out these operations are described. The model is tested by comparison with field data from soils at different salinity levels, and it provides reasonable predictions of the observed data. Thus, the development of qualitative simulation models for crop production appears feasible. These models may be useful as components of crop management decision support systems.

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


Localized structures in nonequilibrium systems We study numerically a prototype equation which arises generically as an envelope equation for a weakly inverted bifurcation associated to traveling waves: The complex quintic Ginzburg-Landau equation. We show six different stable localized structures including stationary pulses, moving pulses, stationary holes and moving holes, starting from localized initial conditions with periodic and Neumann boundary conditions.

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

oscillatory instability
ginzburg-landau equation
localized solutions


Fachlich-konzeptionelle Integration von Business Impact Analysen Business Impact Analysen (BIA) sind Bestandteil des Business Continuity Managements und dienen der Ermittlung von Auswirkungen auf Geschftsfunktionen durch Strungen. Sie sind eine wichtige Grundlage fr die Festlegung von Anforderungen an die Ausfallsicherheit und Wiederherstellung des Geschftsbetriebs. Die Integration der BIA in das Fachkonzept von neuen Geschftslsungen untersttzt das Alignment zwischen dem Business und der IT. Die BIA hilft die geschftlichen Anforderungen gegenber der IT transparent machen, und ermglicht somit ein effektives Zusammenwirken zwischen dem Business und der IT, wodurch die Profitabilitt des Unternehmens positiv beeinflusst wird. Dieser Artikel beschreibt die Rahmenbedingungen fr ein standardisiertes Vorgehen, das Ttigkeiten der Business Impact Analyse als Bestandteil der fachlichen Konzeption vorsieht, und damit ein hohes Alignment zwischen dem Business und der IT gewhrleistet. Unter anderem knnen Signifikanz, Wiederherstellungszeiten, Datenverlust, Standorte und Abhngigkeiten mithilfe der integrierten BIA verdeutlicht werden.

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

business impact analyse
ausfallsicherheit
wiederherstellung
fachkonzept


an artwork design verification system Manual and semi-automatic methods of Integrated circuit layout are prone to errors which are often detected only after a sample chip has been fabricated. This paper describes two design verification programs that detect and identify such errors earlier in the design cycle through comparing a designer's logic description with the finished mask artwork. These programs are part of an integrated CAD system developed at RCA laboratories.

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

layout verification logic paper errors design

program method systems laboratory sampling integrability circuits


Flood flow forecasting using ANN, ANFIS and regression models Flood prediction is an important for the design, planning and management of water resources systems. This study presents the use of artificial neural networks (ANN), adaptive neuro-fuzzy inference systems (ANFIS), multiple linear regression (MLR) and multiple nonlinear regression (MNLR) for forecasting maximum daily flow at the outlet of the Khosrow Shirin watershed, located in the Fars Province of Iran. Precipitation data from four meteorological stations were used to develop a multilayer perceptron topology model. Input vectors for simulations included the original precipitation data, an area-weighted average precipitation and antecedent flows with one- and two-day time lags. Performances of the models were evaluated with the RMSE and the R 2. The results showed that the area-weighted precipitation as an input to ANNs and MNLR and the spatially distributed precipitation input to ANFIS and MLR lead to more accurate predictions (e.g., in ANNs up to 2.0m3s?1 reduction in RMSE). Overall, the MNLR was shown to be superior (R 2=0.81 and RMSE=0.145m3s?1) to ANNs, ANFIS and MLR for prediction of maximum daily flow. Furthermore, models including antecedent flow with one- and two-day time lags significantly improve flow prediction. We conclude that nonlinear regression can be applied as a simple method for predicting the maximum daily flow.

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

mlp
neuro-fuzzy
regression analysis
area-weighted precipitation


Toward the accurate prediction of placement wire length distributions in VLSI circuits Since its introduction, Donath's technique for predicting placement wire length distributions has become one of the most popular techniques for a priori wire length estimation. However, in its original form, it was heavily constrained by the underlying circuit and architecture models. In this paper, we show how a careful relaxation of those constraints results in very high correlations between predicted and experimentally measured average wire lengths as well as, a much improved accuracy in predicting wire length distributions. Because the availability of the Rent characteristic is crucial for the quality of our model, we investigate how the prediction quality degrades when only an estimated characteristic is available. Such an estimation can be required to save computation time or when the complete netlist is not yet available (partial use of typical values). It turns out that a fitted beta-model, based on only a few partitioning levels, can still result in a relatively high-prediction quality. In particular, with respect to the wire length distribution, the results are considerably better than when Rent's Rule is used.

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

donath's wire length estimation technique


Inclusiveness measurement of random events using rough set theory In some probabilistic problems, complete information about the probability model may not exist. In this article, we obtain a lower and upper probability for an arbitrary event by using rough set theory and then a measurement for inclusiveness of events is introduced.

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


Anisotropic constitutive model of plasticity capable of accounting for details of meso-structure of two-phase composite material In this work, we discuss a novel anisotropic constitutive model of plasticity, which can be used to replace the classical phenomenological models for composite materials, like concrete, with marked difference of behavior in tension and compression. The model is constructed from fine scales by making use of the corresponding meso-scale representation of concrete distinguishing aggregate from cement paste. The elastic response and failure mechanisms at this scale are represented by the corresponding unstructured mesh of truss elements, which is shown to be capable of representing a number of fine features of inelastic response, such as the statistical isotropy of elastic response placed in-between the stringent HashinShtrikman bounds, the pronounced difference of behavior in tension and compression, the sensitivity of bi-axial compression strength to the volume fraction of aggregate and the bi-axial fracture energy corresponding to each particular mode of failure. The results of this kind obtained with meso-model are then packed within a new meso-scale model with these enhanced features, which can be used to successfully replace the standard phenomenological models of concrete in ultimate state computations of complex structures providing increased predictive capabilities.

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

heterogeneous materials
meso-scale model
multi-surface plasticity
biaxial compression failure


Fuzzy classification by fuzzy labeled neural gas We extend the neural gas for supervised fuzzy classification. In this way we are able to learn crisp as well as fuzzy clustering, given labeled data. Based on the neural gas cost function, we propose three different ways to incorporate the additional class information into the learning algorithm. We demonstrate the effect on the location of the prototypes and the classification accuracy. Further, we show that relevance learning can be easily included.

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

learning vector quantization
metric adaptation


a unified non-rectangular device and circuit simulation model for timing and power For 65nm and below devices, even after optical proximity correction (OPC), the gate may still be non-rectangular. There are several limited works on the device and circuit characterizations for the post-OPC non-ideal-shape wafer images, with significant impacts on timing and power. Most of them, however, are based on the equivalent gate length models, which are different for timing and leakage, and thus hard to use for coherent circuit simulations. In this paper, we propose a unified post-litho device characterization model and circuit simulation for timing and power. To our best knowledge, this is the most accurate methodology for post-litho analysis, including timing, leakage and transient simulation. Based on this method, the parameter extraction is also included in the model which was omitted by previous works. A post-litho model card is proposed for circuit simulation to combine these two techniques. Our experimental results validate the new model.

device modeling
vlsi cad
physical design


Evaluation of the integrated application of intelligent transportation system technologies using stochastic incident generation and resolution modeling This paper presents the use of the microscopic vehicle traffic simulation software PARAMICS to evaluate different incident management implementation alternatives in South Carolina. This study customized the simulation model for random spatial and temporal traffic incident generation, and modeled different incident alternatives through an application programming interface. This incident management system integrated incident reporting hotlines, traffic cameras, traffic sensors, and freeway service patrols (FSPs), finding that this approach to incident management outperformed the application of traffic cameras or FSPs alone. The integrated application of intelligent transportation system technologies significantly reduced incident duration and total vehicle hours of travel during an incident. In addition, FSP response policy and headway affected the incident management performance.

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

freeway service patrol
intelligent transportation systems
traffic incident management


the nsfnet backbone network The NSFNET Backbone Network interconnects six supercomputer sites, several regional networks and ARPANET. It supports the DARPA Internet protocol suite and DCN subnet protocols, which provide delay-based routing and very accurate time-synchronization services. This paper describes the design and implementation of this network, with special emphasis on robustness issues and congestion-control mechanisms.

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

network design supercomputer implementation routing internet paper

time-synchronization
region
delay
interconnect
service
congestion control
robust


multicore-enabling the mpj express messaging library With the transition to multicore processors almost complete, the parallel processing community is seeking efficient ways to port legacy message passing applications on shared memory and multicore processors. MPJ Express is our reference implementation of Message Passing Interface (MPI)-like bindings for the Java language. Starting with the current release, the MPJ Express software can be configured in two modes: the multicore and the cluster mode. In the multicore mode, parallel Java applications execute on shared memory or multicore processors. In the cluster mode, Java applications parallelized using MPJ Express can be executed on distributed memory platforms like compute clusters and clouds. The multicore device has been implemented using Java threads in order to satisfy two main design goals of portability and performance. We also discuss the challenges of integrating the multicore device in the MPJ Express software. This turned out to be a challenging task because the parallel application executes in a single JVM in the multicore mode. On the contrary in the cluster mode, the parallel user application executes in multiple JVMs. Due to these inherent architectural differences between the two modes, the MPJ Express runtime is modified to ensure correct semantics of the parallel program. Towards the end, we compare performance of MPJ Express (multicore mode) with other C and Java message passing libraries---including mpiJava, MPJ/Ibis, MPICH2, MPJ Express (cluster mode)---on shared memory and multicore processors. We found out that MPJ Express performs signicantly better in the multicore mode than in the cluster mode. Not only this but the MPJ Express software also performs better in comparison to other Java messaging libraries including mpiJava and MPJ/Ibis when used in the multicore mode on shared memory or multicore processors. We also demonstrate effectiveness of the MPJ Express multicore device in Gadget-2, which is a massively parallel astrophysics N-body siimulation code.

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

java multicore programming
mpi java
java hpc
java mpi


Mutatis mutandis: Safe and predictable dynamic software updating Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynamic updating has been used for many years. Perhaps surprisingly, there is little high-level understanding or language support to help programmers write dynamic updates effectively. To bridge this gap, we present Proteus, a core calculus for dynamic software updating in C-like languages that is flexible, safe, and predictable. Proteus supports dynamic updates to functions (even active ones), to named types and to data, allowing on-line evolution to match source-code evolution as we have observed it in practice. We ensure updates are type-safe by checking for a property we call "con-freeness" for updated types t at the point of update. This means that non-updated code will not use t concretely beyond that point (concrete usages are via explicit coercions) and thus Vs representation can safely change. We show how con-freeness can be enforced dynamically for a particular program state. We additionally define a novel and efficient static updateability analysis to establish con-freeness statically, and can thus automatically infer program points at which all future (well-formed) updates will be type-safe. We have implemented our analysis for C and tested it on several well-known programs.

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

languages
dynamic software updating
updateability analysis
proteus

design
reliability
theory
verification
type inference
capability


The effect of calciums on molecular motions of proteinase K The native serine protease proteinase K binds two calcium cations. It has been reported that Ca(2+) removal decreased the enzyme's thermal stability and to some extent the substrate affinity, but has discrepant effects on catalytic activity of the enzyme. Molecular dynamics simulations were performed on the Ca(2+)-bound and Ca(2+)-free proteases to investigate the mechanism by which the calciums affect the structural stability, molecular motions, and catalytic activity of proteinase K. Very similar structural properties were observed between these two forms of proteinase K during simulations; and several long-lived hydrogen bonds and salt bridges common to both forms of proteinase K were found to be crucial in maintaining the local conformations around these two Ca(2+) sites. Although Ca(2+) removal enhanced the overall flexibility of proteinase K, the flexibility in a limited number of segments surrounding the substrate-binding pockets decreased. The largest differences in the equilibrium structures of the two simulations indicate that, upon the removal of Ca(2+), the large concerted motion originating from the Ca1 site can transmit to the substrate-binding regions but not to the catalytic triad residues. In conjunction with the large overlap of the essential subspaces between the two simulations, these results not only provide insight into the dynamics of the underlying molecular mechanism responsible for the unchanged enzymatic activity as well as the decreased thermal stability and substrate affinity of proteinase K upon Ca(2+) removal, but also complement the experimentally determined structural and biochemical data.

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

calcium
catalytic activity
molecular dynamics
proteinase k
structural stability

essential dynamics
large concerted motions


Using the World Wide Web to assist software project course work Project work is an important element in a software engineering curriculum. Administering student projects, however, can require lots of effort. With the introduction of Web-based course administration, we sought to improve both course management and dissemination of the results. This paper describes the utilization of Internet technologies on our Software Project course, and reports our experiences from over two year's time.

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

software engineering education
computer-assisted education


Hidden in plain sight: low-literacy adults in a developed country overcoming social and educational challenges through mobile learning support tools Illiteracy is often associated with people in developing countries. However, an estimated 50% of adults in a developed country such as Canada lack the literacy skills required to cope with the challenges of todays society; for them, tasks such as reading, understanding, basic arithmetic, and using everyday items are a challenge. Many community-based organizations offer resources and support for these adults, yet overall functional literacy rates are not improving. This is due to a wide range of factors, such as poor retention of adult learners in literacy programs, obstacles in transferring the acquired skills from the classroom to the real life, personal attitudes toward learning, and the stigma of functional illiteracy. In our research we examined the opportunities afforded by personal mobile devices in providing learning and functional support to low-literacy adults. We present the findings of an exploratory study aimed at investigating the reception and adoption of a technological solution for adult learners. ALEX is a mobile application designed for use both in the classroom and in daily life in order to help low-literacy adults become increasingly literate and independent. Such a solution complements literacy programs by increasing users motivation and interest in learning, and raising their confidence levels both in their education pursuits and in facing the challenges of their daily lives. We also reflect on the challenges we faced in designing and conducting our research with two user groups (adults enrolled in literacy classes and in an essential skills program) and contrast the educational impact and attitudes toward such technology between these. Our conclusions present the lessons learned from our evaluations and the impact of the studies specific challenges on the outcome and uptake of such mobile assistive technologies in providing practical support to low-literacy adults in conjunction with literacy and essential skills training.

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

mobile computing
educational interfaces
assistive technology
evaluation methodology


Chunks and Tasks: A programming model for parallelization of dynamic algorithms We present a new parallel programming model named Chunks and Tasks. Designed to work well for dynamic algorithms. Programmer does not need to provide data distribution. Possible to achieve fault resilience at the library level. Expands the applicability of high performance parallel computing.

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

distributed memory parallelization
dynamic data distribution
dynamic load balancing
fault tolerance
determinism


detecting camera movements & production effects in digital videos Numerous algorithms have been proposed in the last decade, for detecting low level features and camera motion in video sequences. Along with different camera movements such as pan, tilt, and zoom, there may be some jitter movements due to hand shaking. Differentiating these jitter movements from actual camera motions is a very challenging task and is the main cause of false detections in most of the processes. Comparison of the work of different research groups working in this area can be seen from TRECVID 2005 & 2006 results. Low Precision and Recall of different methods is a clear evident that no method is suitable for all types of video to detect different camera movements. Further many methods are either computation intensive or too much false detection reduces their efficiency. A method based on region matching using area correlation is proposed to differentiate the different camera movements. Different regions are classified based on their statistical similarity in each frame of video. For each region in two consecutive frames, area correlation function is calculated. This area correlation energy function is used to detect the similarity among the regions. Weighted sum of correlation function in all the mismatched regions and location of these are used to classify the camera movements in video into different types such as pan, tilt, zoom etc. This method is tested on different videos and reasonable performance is achieved. It can also be used as pre-classifier in prior to video transition detection methods to reduce their false detections.

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

production effects
correlation
camera movements

video analysis
scene analysis
shot detection


A meshless local natural neighbour interpolation method for analysis of two-dimensional piezoelectric structures A novel meshless method applied to solve two-dimensional piezoelectric structures is presented and discussed in this paper. It is called meshless local natural neighbour interpolation (MLNNI) method, which is derived from the generalized meshless local PetrovGalerkin (MLPG) method as a special case. In the present method, nodal points are spread on the analysed domain and each node is surrounded by a polygonal sub-domain, which can be conveniently constructed with Delaunay tessellations. The spatial variation of the displacements and the electric potential are interpolated by the natural neighbour interpolation. As the shape functions so constructed possess the delta function property, the essential boundary conditions can be imposed by directly substituting the corresponding terms in the system of equations. Furthermore, the usage of three-node triangular FEM shape functions as test functions reduces the order of integrands involved in domain integrals. Numerical examples are presented at the end to demonstrate the applicability and accuracy of the present approach in analysing two-dimensional piezoelectric structures.

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

meshless method
mlpg
natural neighbour interpolation
piezoelectric structures


a methodical approach to evaluating the use of audio-interfaces for mobile and wearable computing Audio interfaces for mobile and wearable computing are in an early state of development. User studies concentrate on the usability of audio interfaces as means of interacting with a device but leave out the question of how an audio interface can aid at performing a main task. Studying the impact of audio interfaces in computer aided tasks for wearable and mobile computing will provide guidelines for hands-free interface design and information presentation. To be able to measure the performance a simulated main task is used where varying mental loads can be setup. Providing an index of difficulty for the simulated task, users studies will reveal how effective an audio interface can be used to convey information to aid at a task.

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

steering law
audio displays
hotwire
user centered design


A simple signal processing architecture for instantaneous radar polarimetry This paper describes a new radar primitive that enables instantaneous radar polarimetry at essentially no increase in signal processing complexity. This primitive coordinates transmission of distinct waveforms on orthogonal polarizations and applies a unitary matched filter bank on receive. This avoids the information loss inherent in single-channel matched filters. A further advantage of this scheme is the elimination of range sidelobes.

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

multiple-input multiple-output (mimo) radar


A rule-based system for programming self-organized sensor and actor networks We describe a programming scheme for massively distributed systems that are assumed to self-organize according to a given set of simple rules. The focus of this investigation is operation and control in sensor and actor networks (SANETs). The main issues addressed by self-organization techniques are scalability, network lifetime, and real-time support. In the literature, biological principles are often cited as inspirations for technical solutions, especially in the domain of self-organization. We developed a system named rule-based sensor network (RSN) according to the observed communication and control behavior in cellular communication. Cellular signaling cascades allow the event-specific reaction initiated by individual cells in collaboration with their direct neighbors. Information between cells are transmitted via proteins and result in the cascade of proteinprotein or proteinDNA interactions to produce a specific cellular answer, e.g. the activation of cells or the transmission of mediators. These processes are programmed in every individual cell and lead to a coordinated reaction on a higher organization platform. We transferred these mechanisms to operation and control in SANETs. In particular, a rule-based processing scheme relying on the main concepts of cellular signaling cascades has been developed. It relies on simple local rules and provides problem specific reaction such as local actuation control and data manipulation. We describe this RSN technology and demonstrate comparative simulation results that show the feasibility of our approach.

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

sensor and actor networks
cellular signaling cascades

self-organization
network-centric operation
rule-based sensor network


The finite element approximation of variational inequalities related to ergodic control problems In this paper, we study the numerical approximation of variational inequalities (VI) where the ''discount factor'' (i.e., the zero order term) is set to 0. Optimal error estimates are proved in the Lm-norm using the concept of subsolutions.

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

variational inequalities
ergodic control
finite element


Eigenspace method for spatiotemporal hotspot detection Hotspot detection aims at identifying sub-groups in the observations that are unexpected, with respect to some baseline information. For instance, in disease surveillance, the purpose is to detect sub-regions in spatiotemporal space, where the count of reported diseases (e.g. cancer) is higher than expected, with respect to the population. The state-of-the-art method for this kind of problem is the spacetime scan statistics, which exhaustively search the whole space through a sliding window looking for significant spatiotemporal clusters. Spacetime scan statistics makes some restrictive assumptions about the distribution of data, the shape of the hotspots and the quality of data, which can be unrealistic for some non-traditional data sources. A novel methodology called EigenSpot is proposed where instead of an exhaustive search over the space, it tracks the changes in a spacetime occurrences structure. The new approach does not only present much more computational efficiency but also makes no assumption about the data distribution, hotspot shape or the data quality. The principal idea is that with the joint combination of abnormal elements in the principal spatial and the temporal singular vectors, the location of hotspots in the spatiotemporal space can be approximated. The experimental evaluation, both on simulated and real data sets, reveals the effectiveness of the proposed method.

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

spatiotemporal data
svd
outbreak detection


Establishing Evidence for Enterovirus Infection in Chronic Disease Viruses have long been considered among potential environmental triggers of type 1 diabetes mellitus. Epidemiologic and seroprevalence studies have associated enterovirus infection with development of prediabetic autoimmunity and with the onset of clinical diabetes. Enterovirus infection has also been temporally correlated with disease onset by virus isolation or by detection of viral genome by reverse transcription-polymerase chain reaction (RT-PCR). For the large-scale prospective studies that are required to firmly establish a causal relationship between enterovirus infection and development of prediabetic autoimmunity or progression from autoimmunity to clinical diabetes, sensitive RT-PCR methods must be used to detect virus prior to the onset of diabetic symptoms. We have developed an RT-seminested PCR protocol to detect enteroviruses in clinical specimens. This method is approximately 10,000-fold more sensitive than conventional, single-amplification PCR. Further, we have developed molecular methods to rapidly and reliably identify enterovirus serotype, bypassing the cumbersome and often problematic neutralization test. The molecular serotyping approach will be valuable in examining the relationships between particular virus serotypes or genotypes and specific diseases.

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


USIM-based EAP-TLS authentication protocol for wireless local area networks ? Due to the rapid growth in popularity of Wireless Local Area Network (WLAN), wireless security has become one of many important research issues. For the WLAN security, the IEEE 802.1X standard provides an authentication framework that is based on the Extensible Authentication Protocols (EAP). In the EAP framework, there are many authentication protocols that have been proposed, in which each authentication protocol has some strengths and weaknesses, respectively. Most EAP authentication protocols lack two features: identity protection and withstanding man-in-the-middle attacks. In this paper, we first propose a novel symmetric-key based certificate distribution scheme based on Universal Subscriber Identity Module (USIM) cards in a cellular network. The symmetric-key based certificate distribution scheme allows mobile subscribers to obtain temporary certificates from the corresponding cellular network. Combining the proposed certificate distribution scheme with the EAP-TLS (Transport Layer Security) protocol, we present a new EAP authentication protocol called USIM-based EAP authentication protocol. The new EAP authentication protocol combining with USIM cards is an extension of the EAP-TLS protocol and also follows the EAP framework in the IEEE 802.1X standard. Compared to other EAP authentication protocols, the proposed protocol provides mutual authentication, strong identity protection and roaming capability between the cellular network and the WLAN networks.

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

cellular network
authentication
eap
usim


A new time-space domain high-order finite-difference method for the acoustic wave equation A new unified methodology was proposed in Finkelstein and Kastner (2007) [391 to derive spatial finite-difference (FD) coefficients in the joint time-space domain to reduce numerical dispersion. The key idea of this method is that the dispersion relation is completely satisfied at several designated frequencies. We develop this new time-space domain FD method further for I D, 2D and 3D acoustic wave modeling using a plane wave theory and the Taylor series expansion. New spatial FD coefficients are frequency independent though they lead to a frequency dependent numerical solution. We prove that the modeling accuracy is 2nd-order when the conventional (2M)th-order space domain FD and the 2nd-order time domain FD stencils are directly used to solve the acoustic wave equation. However, under the same discretization, the new ID method can reach (2M)th-order accuracy and is always stable. The 2D method can reach (2M)th-order accuracy along eight directions and has better stability. Similarly, the 3D method can reach (2M)th-order accuracy along 48 directions and also has better stability than the conventional FD method. The advantages of the new method are also demonstrated by the results of dispersion analysis and numerical modeling of acoustic wave equation for homogeneous and inhomogeneous acoustic models. In addition, we study the influence of the FD stencil length on numerical modeling for I D inhomogeneous media, and derive an optimal FD stencil length required to balance the accuracy and efficiency of modeling. A new time-space domain high-order staggered-grid FD method for the 1D acoustic wave equation with variable densities is also developed, which has similar advantages demonstrated by dispersion analysis, stability analysis and modeling experiments. The methodology presented in this paper can be easily extended to solve similar partial difference equations arising in other fields of science and engineering. (C) 2009 Elsevier Inc. All rights reserved.

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

plane wave theory
acoustic wave equation
dispersion analysis
numerical modeling

optimal finite-difference stencil length


trap architectures for lisp systems Recent measurements of Lisp systems show a dramatic skewing of operation frequency. For example, small integer (fix-num) arithmetic dominates most programs, but other number types can occur on almost any operation. Likewise, few memory references trigger special handling for garbage collection, but nearly all memory operations could trigger such special handling. Systems like SPARC and SPUR have shown that small amounts of special hardware can significantly reduce the need for inline software checks by trapping when an unusual condition is detected. A system's trapping architecture now becomes key to performance. In most systems, the trap architecture is intended to handle errors (e.g., address faults) or conditions requiring large amounts of processing (e.g., page faults). The requirements for Lisp traps are quite different. In particular, the trap frequency is higher, processing time per trap is shorter, and most need to be handled in the user's address space and context. This paper looks at these requirements, evaluates current trap architectures, and proposes enhancements for meeting those requirements. These enhancements increase performance for Lisp 11\%-35\% at a cost of about 1.6\% more CPU logic. They also aid debugging in general and speed floating point exception handling.

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

requirements
lisp
performance
context
floating point
general
paper
errors
software
meeting
systems
exception handling
space
architecture
types
logic
hardware
cost
debugging

measurement paging examples collect addressing timing user program operability memorialized process fault


An AGENDA for testing relational database applications Database systems play an important role in nearly every modern organization, yet relatively little research effort has focused on how to test them. This paper discusses issues arising in testing database systems, presents an approach to testing database applications, and describes AGENDA, a set of tools to facilitate the use of this approach. In testing such applications, the state of the database before and after the user's operation plays an important role, along with the user's input and the system output. A framework for testing database applications is introduced. A complete tool set, based on this framework, has been prototyped. The components of this system are a parsing tool that gathers relevant information from the database schema and application, a tool that populates the database with meaningful data that satisfy database constraints, a tool that generates test cases for the application, a tool that checks the resulting database state after operations are performed by a database application, and a tool that assists the tester in checking the database application's output. The design and implementation of each component of the system are discussed. The prototype described here is limited to applications consisting of a single SQL query. Copyright (C) 2004 John Wiley Sons, Ltd.

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


Copula density estimation by total variation penalized likelihood with linear equality constraints A copula density is the joint probability density function (PDF) of a random vector with uniform marginals. An approach to bivariate copula density estimation is introduced that is based on maximum penalized likelihood estimation (MPLE) with a total variation (TV) penalty term. The marginal unity and symmetry constraints for copula density are enforced by linear equality constraints. The TV-MPLE subject to linear equality constraints is solved by an augmented Lagrangian and operator-splitting algorithm. It offers an order of magnitude improvement in computational efficiency over another TV-MPLE method without constraints solved by the log-barrier method for the second order cone program. A data-driven selection of the regularization parameter is through K-fold cross-validation (CV). Simulation and real data application show the effectiveness of the proposed approach. The MATLAB code implementing the methodology is available online.

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

copula density estimation
total variation
maximum penalized likelihood estimation


using word similarity to eradicate junk emails Emails are one of the most commonly used modern communication media these days; however, unsolicited emails obstruct this otherwise fast and convenient technology for information exchange and jeopardize the continuity of this popular communication tool. Waste of valuable resources and time and exposure to offensive content are only a few of the problems that arise as a result of junk emails. In addition, the monetary cost of processing junk emails reaches billions of dollars per year and is absorbed by public users and Internet service providers. Even though there has been extensive work in the past dedicated to eradicate junk emails, none of the existing junk email detection approaches has been highly successful in solving these problems, since spammers have been able to infiltrate existing detection techniques. In this paper, we present a new tool, JunEX, which relies on the content similarity of emails to eradicate junk emails. JunEX compares each incoming email to a core of emails marked as junk by each individual user to identify unwanted emails while reducing the number of legitimate emails treated as junk, which is critical. Conducted experiments on JunEX verify its high accuracy.

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


Reliability analysis of the complex mode indicator function and Hilbert Transform techniques for operational modal analysis This study presents application of the CMIF and the Hilbert Transform techniques onto simulated response data obtained using a numerical model of a typical school building from Turkey. White noise is added to the data in order to achieve a noise to signal ratio of 5%. 100 Monte Carlo analysis sequences are carried out and the modal parameters (the frequencies, the mode shapes and the damping ratios) are identified at each Monte Carlo run for both techniques. The results are compared with the identifications obtained from the simulated data using stochastic subspace based system identification technique. The overall results of the study show that the mode shapes are clearly identified the best by using the CMIF technique. The damping ratios are estimated better by using the stochastic subspace based system identification technique whereas the frequencies are best determined by the CMIF. The results also show that both the CMIF and the Hilbert Transform techniques are sensitive to the type of window used as well as the averaging and the decimation process. It is apparent that the CMIF technique is as robust as the frequently used stochastic subspace based system identification technique and can be confidently used for modal parameter estimation of stiff low to mid rise reinforced concrete structures.

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

hilbert transform
reinforced concrete structures

frequency domain system identification techniques


An agent-oriented decision support system combining fuzzy clustering and the AHP Decision making is a complex process, particularly when it is carried out by multidisciplinary team. Methods based on the analytical hierarchy process have been widely employed because they provide solid mathematical background. Nevertheless, solutions such as the Aggregation of Individual Judgements (AIJ) and the Aggregation of Individual Priorities (AIP) do not offer sufficient explanatory data in regards with the final decision. We developed an agent-based decision support system (DSS) that employs fuzzy clustering to group individual evaluations and the AHP to reach a final decision. Fuzzy clustering is adequate to determine important pieces of data such as the largest group of evaluations that exist around a centroid value. On the other hand, the MAS paradigm offers capabilities for achieving distributed and asynchronous processing of data. The AHP is used after the individual evaluations are clustered, as if the group were a single evaluator. Altogether, the proposed solution enhances the quality of multi-criteria group decision making.

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

fuzzy clustering
analytical hierarchy process

distributed group decision making
multi-agent systems


Developing a computer shop floor control model for a CIM system - using object modeling technique In this paper, an analyzing process for building a shop floor controller model is addressed by using Object Model Technique (OMT). The major objective of the proposed shop floor controller model is to bridge the gaps between the production planning level and manufacturing level in a CIM environment such that production orders can be properly carried out by the shop floor equipment. In addition, shop floor dynamic conditions also can be fed back to the planning level. There are three modules in this model. (1) Planning and Scheduling Module takes charge of transferring production orders into detailed manufacturing tasks. (2) Dispatching and Coordination Module issues production commands to the controllers of proper production equipment. (3) Data Monitoring and Analysis Module collects and analyzes shop floor data in order to identify the shop floor dynamic conditions. An implementation environment about the proposed model is also presented in the final part of this paper. (C) 2000 Elsevier Science B.V. All rights reserved.

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

object modeling technique
shop floor controller model
cim


Bounded commutative residuated l-monoids with general comparability and states Bounded commutative Rl-monoids are a generalization of MV-algebras as well as of BL-algebras. For such monoids the authors in [DvRa] introduced states, analogues of probability measures. We study Boolean elements and introduce the general comparability property. It entails that the monoids with the property are BL-algebras, and extremal states on Boolean elements can be uniquely extended to extremal states on the monoids. Moreover, the hull-kernel topology of maximal filters is totally disconnected.

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

bounded commutative rl-monoid
boolean element
state
state-morphism
extremal state
filter
maximal filter
mv-algebra
bl-algebra


a spatio-temporal approach to collaborative filtering In this paper, we propose a novel spatio-temporal model for collaborative filtering applications. Our model is based on low-rank matrix factorization that uses a spatio-temporal filtering approach to estimate user and item factors. The spatial component regularizes the factors by exploiting correlation across users and/or items, modeled as a function of some implicit feedback (e.g., who rated what) and/or some side information (e.g., user demographics, browsing history). In particular, we incorporate correlation in factors through a Markov random field prior in a probabilistic framework, whereby the neighborhood weights are functions of user and item covariates. The temporal component ensures that the user/item factors adapt to process changes that occur through time and is implemented in a state space framework with fast estimation through Kalman filtering. Our spatio-temporal filtering (ST-KF hereafter) approach provides a single joint model to simultaneously incorporate both spatial and temporal structure in ratings and therefore provides an accurate method to predict future ratings. To ensure scalability of ST-KF, we employ a mean-field approximation for inference. Incorporating user/item covariates in estimating neighborhood weights also helps in dealing with both cold-start and warm-start problems seamlessly in a single unified modeling framework; covariates predict factors for new users and items through the neighborhood. We illustrate our method on simulated data, benchmark data and data obtained from a relatively new recommender system application arising in the context of Yahoo! Front Page.

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

kalman filtering
matrix factorization
collaborative filtering


Transcriptional Control of Dopamine Neuron Development Recent studies have identified several factors that influence the development of midbrain dopamine (DA) neurons. The identity of early proliferating DA progenitor cells are specified by the secreted factors sonic hedgehog and fibroblast growth factor 8, derived from the floor plate of the ventral midline and the mid/hindbrain border, respectively. While transcription factors specifically expressed in the proliferating DA progenitor cells remain to be identified, several transcription factors important for postmitotic DA cell development have been characterized. These include Nurr1, Lmx1b, Pitx3, and En1/En2. The studies of these transcription factors have not only increased the understanding of how DA neurons are generated in vivo, but also allowed the development of new strategies using stem cells for engineering DA neurons in vitro, results that may have significance in future therapies of patients with Parkinson's disease.

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

progenitor cell
stem cell
parkinson's disease
transcription factor
nuclear receptor
engrailed


Evaluating the performance of a distributed database of repetitive elements in complete genomes The original version of the Repeat Sequence Database (RSDB1) [2] was created based on centralized database systems (CDBSs). RSDB presently includes an enormous amount of data, with the amount of biological data is increasing rapidly. Distributed RSDB (DRSDB) is developed to yield better performance. This study proposed many approaches to data distribution and experimentally determine the best approach to obtain good performance of our database. Experimental results indicate that DRSDB performs well for particular types of queries.

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

databases
query processing
distributed databases


2D and 3D similarity landscape analysis identifies PARP as a novel off-target for the drug Vatalanib Searching for two-dimensional (2D) structural similarities is a useful tool to identify new active compounds in drug-discovery programs. However, as 2D similarity measures neglect important structural and functional features, similarity by 2D might be underestimated. In the present study, we used combined 2D and three-dimensional (3D) similarity comparisons to reveal possible new functions and/or side-effects of known bioactive compounds.

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

vascular endothelial growth factor (vegf)


Synthesis of non-isothermal heat integrated water networks in chemical processes This paper presents a new approach for the simultaneous synthesis and optimization of heat integrated water networks. A new superstructure for heat exchanger network (HEN) synthesis is proposed. The procedure is based on mixed integer non-linear mathematical programming (MINLP). Four relevant examples are presented to illustrate various aspects of the proposed approach. (C) 2008 Elsevier Ltd. All rights reserved.

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

waste water minimization
heat integration
process synthesis


VISIBLE SPEECH IMPROVES HUMAN LANGUAGE UNDERSTANDING - IMPLICATIONS FOR SPEECH PROCESSING SYSTEMS Evidence from the study of human language understanding is presented suggesting that our ability to perceive visible speech can greatly influence our ability to understand and remember spoken language. A view of the speaker's face can greatly aid in the perception of ambiguous or noisy speech and can aid cognitive processing of speech leading to better understanding and recall. Some of these effects have been replicated using computer synthesized visual and auditory speech. Thus, it appears that when giving an interface a voice, it may be best to give it a face too.

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

human-computer interaction
natural language understanding


Simplified map representation and map learning system for autonomous navigation of mobile robots Autonomous mobile robots need environmental maps to navigate to specific destinations, but there are difficulties in generating and acquiring efficient maps for them. Map learning systems and map representation for autonomous robot navigation are highly interrelated and need a total system design that combines these two factors. This study considers a combined simple map representation and map learning system. The proposed map representation includes geometrical relationships between important places and grid maps for these places, but not a total grid map of the environment. In particular, the study focuses on the ability to recognize places based on image features. Successful experiments on autonomous navigation with the proposed map representation using an actual mobile robot are described.

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


Robust object recognition with cortex-like mechanisms We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the organization of visual cortex and builds an increasingly complex and invariant feature representation by alternating between a template matching and a maximum pooling operation. We demonstrate the strength of the approach on a range of recognition tasks: From invariant single object recognition in clutter to multiclass categorization problems and complex scene understanding tasks that rely on the recognition of both shape-based as well as texture-based objects. Given the biological constraints that the system had to satisfy, the approach performs surprisingly well: It has the capability of learning from only a few training examples and competes with state-of-the-art systems. We also discuss the existence of a universal, redundant dictionary of features that could handle the recognition of most object categories. In addition to its relevance for computer vision, the success of this approach suggests a plausibility proof for a class of feedforward models of object recognition in cortex.

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

object recognition
visual cortex
scene understanding


A coupled symmetric BEFE method for acoustic fluidstructure interaction A coupled symmetric BEFE method for the calculation of linear acoustic fluidstructure interaction in time and frequency domain is presented. In the coupling formulation a newly developed hybrid boundary element method (HBEM) will be used to describe the behaviour of the compressible fluid. The HBEM is based on Hamilton's principle formulated with the velocity potential. The state variables are separated into boundary variables which are approximated by piecewise polynomial functions and domain variables which are approximated by a superposition of static fundamental solutions. The domain integrals are eliminated, respectively, replaced by boundary integrals and a boundary element formulation with a symmetric mass and stiffness matrix is obtained as result. The structure is discretized by FEM. The coupling conditions fulfil C1-continuity on the interface. The coupled formulation can also be used for eigenfrequency analyses by transforming it from time domain into frequency domain.

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

hybrid boundary element method
fluidstructure interaction
time domain


A Fully Consistent Hidden Semi-Markov Model-Based Speech Recognition System In a hidden Markov model (HMM), state duration probabilities decrease exponentially with time, which fails to adequately represent the temporal structure of speech. One of the solutions to this problem is integrating state duration probability distributions explicitly into the HMM. This form is known as a hidden semi-Markov model (HSMM). However, though a number of attempts to use HSMMs in speech recognition systems have been proposed, they are not consistent because various approximations were used in both training and decoding. By avoiding these approximations using a generalized forward-back ward algorithm, a context-dependent duration modeling technique and weighted finite-state transducers (WFSTs), we construct a fully consistent HSMM-based speech recognition system. In a speaker-dependent continuous speech recognition experiment, our system achieved about 9.1 % relative error reduction over the corresponding HMM-based system.

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

hidden semi-markov model
weighted finite-state transducer


evaluating an ambient display for the home We present our experiences with evaluating an ambient display for the home using two different evaluation techniques: the recently proposed 'Heuristic Evaluation of Ambient Displays' and an in situ , 3-week long, Wizard of Oz evaluation. We compare the list of usability violations found in the heuristic evaluation to the set of problems that were discovered in the in situ evaluation. Overall, the 'Heuristic Evaluation of Ambient Displays' was effective - 75\% of known usability problems were found by eight evaluators (39-55\% were found by 3-5 evaluators). However, the most severe usability problem found in the in situ evaluation was not identified in the heuristic evaluation. Because the problem directly violated one of the heuristics, we believe that the problem is not with the heuristics, but rather that evaluators have minimal experience with ambient displays for the home.

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

peripheral displays
discount usability method
ubiquitous computing


An integer programming approach and visual analysis for detecting hierarchical community structures in social networks ? Detecting community structures in social networks is a very important task in social network analysis as these community structures explain relationships among individuals and can be used to predict social behavior. The relationship among subcommunities in each community can further be identified as hierarchical community structures, in which each super node at each hierarchical level represents a nested structure of communities or nodes. Most previous studies attempting to detect hierarchical community structures focused on new metaheuristics that are computationally efficient but do not guarantee the optimal community partition. As a result, this work applies a novel integer programming (IP) approach to detect hierarchical community structures in social networks. This approach has flexible community capacity limits, does not limit the community numbers at different levels, and maximizes a quality measure for hierarchical community partition. The proposed IP approach can use existing software solvers to detect hierarchical community structures without implementing an algorithm. Visual analysis of experimental results shows that the proposed model with different settings for level numbers can analyze reasonable and sophisticated hierarchical community structures, such that the relationships between communities at different levels can be elucidated clearly.

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

social network
integer programming
visual analysis

community detection
hierarchical community structure


Large eddy simulation of turbulent flows via domain decomposition techniques. Part 2: applications The present paper discusses the application of large eddy simulation to incompressible turbulent flows in complex geometries. Algorithmic developments concerning the flow solver were provided in the companion paper (Int. J Numer. Meth. Fluids, 2003; submitted), which addressed the development and validation of a multi-domain kernel suitable for the integration of the elliptic partial differential equations arising from the fractional step procedure applied to the incompressible Navier-Stokes equations. Numerical results for several test problems are compared to reference experimental and numerical data to demonstrate the potential of the method. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

les
dns
boundary layer
backward-facing step
square cylinder flow


About priority encoding transmission Recently, (PET) for sending hierarchically organized messages over lossy packet-based computer networks [1], In a PET system, each symbol in the message is assigned a priority which determines the minimal number of codeword symbols that is required to recover that symbol. This note revisits the PET approach using tools from network information theory. We first outline that priority encoding transmission is intimately related with the broadcast erasure channel with degraded message set, Using the information spectrum approach, we provide an informational characterization of the capacity region of general broadcast channels with degraded message set, We show that the PET inequality has an information-theoretical counterpart. The inequality defining the capacity region of the broadcast erasure channel with degraded message sets. Hence the PET approach which consists in time-sharing and interleaving classical erasure-resilient codes achieves the capacity region of this channel. Moreover, we show that the PET approach may achieve the sphere packing exponents. Finally, we observe that on some simple nonstationary broadcast channels, time-sharing may be outperformed. The impact of memory on the optimality of the PET approach remains elusive.

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

broadcast channels
information spectrum
priority encoding transmission

coding exponents
erasure-resilient codes


Solving the advection-dispersion equation with discontinuous Galerkin and multipoint flux approximation methods on unstructured meshes In this work, we develop a new model to solve the advection-dispersion transport equation on unstructured triangular meshes. The model combines numerical methods that are specifically suited to achieve high accuracy for each type of equation without using the time splitting procedure. It is based on a combination of the upwind discontinuous Galerkin (DG) method for advection and the multipoint flux approximation (MPFA) method for dispersion. In contrast to mixed finite elements, MPFA methods provide fluxes at element interfaces explicitly by weighted sums of discrete element concentrations. Therefore, the combination of DG and MPFA methods allows taking into account total flux boundary conditions while using different numerical techniques. A theta-scheme time discretization is developed for advection and an implicit scheme for dispersion. Accuracy of the numerical model is shown by simulating (i) the transport of a tracer in a simplified bidimensional problem with highly unstructured mesh and (ii) a laboratory-scale experiment with high viscosity contrasts. Copyright (c) 2008 John Wiley & Sons, Ltd.

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

multipoint flux approximation methods
time splitting
unstructured meshes

discontinuous galerkin methods
advection-dispersion equation


Sliding mode control for polytopic differential inclusion systems The stabilization problem of polytopic differential inclusion (PDI) systems is investigated by using sliding mode control. Sliding surface is designed and sufficient conditions for asymptotic stability of sliding mode dynamics are derived. A novel feedback law is established to make the state of system reach the sliding surface in a finite time. Finally, an example is given to illustrate the validity of the proposed design. (C) 2009 IMACS. Published by Elsevier B.V. All rights reserved.

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


Performance of Cooperative Diversity with Constellation Rearrangement in Multi-hop Wireless Networks The purpose of this paper is to evaluate the performance of cooperative diversity in distributed grouped two-hop and multi-hop relaying networks consisting of single-antenna terminals with constellation rearrangement. Simulation results, for phase shift keyed and quadrature amplitude modulation signals in the single carrier Rayleigh channel, show that the use of the cooperative diversity with a constellation rearrangement scheme improve the error probability performance in a power constrained, grouped multi-hop relaying network operating in a multi-path fading environment. The performance of the system will be improved without reduction of Transmission rate by using constellation rearrangement. Finally, the proposed scheme is evaluated through NS2 simulation from the view of throughput in order to investigate the interaction between physical layer and MAC layer.

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

decode-and-forward (dcf)
constellation rearrangement (core)
medium access control (mac)


Learning classifier systems: then and now Broadly conceived as computational models of cognition and tools for modeling complex adaptive systems, later extended for use in adaptive robotics, and today also applied to effective classification and data-miningwhat has happened to learning classifier systems in the last decade? This paper addresses this question by examining the current state of learning classifier system research.

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

learning classifier systems
classification

genetics-based machine learning
reinforcement learning


the use of declarative and procedural knowledge in intelligent navigation displays One theory of environmental cognition suggests that both declarative landmark knowledge and procedural route knowledge are essential in structuring internal representations of the environment; such representations facilitate effective navigation in that environment [5, 7]. The proposed study will provide data to test this theory. The application that will be studied is an Advanced Traveler Information System (ATIS), which provides route guidance information to automobile drivers. Current route guidance systems incorporate only procedural route information in their route guidance displays (i. e., they give directions for getting to your destination without supplying landmarks to identify the route [e.g., 3]). This study will evaluate how the inclusion of landmark icons in ATIS displays affects users' navigation performance. The results will be important to ATIS developers, who need to know what informational elements to include in ATIS route guidance displays to most effectively support navigation tasks. The results will also be important in a theoretical sense, by testing a theory of environmental cognition with real-world navigation tasks.

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

atis
procedural knowledge
landmarks
navigation

intelligent systems
declarative knowledge
its


the performance advantage of applying compression to the memory system The memory system stores information comprising primarily instructions and data and secondarily address information, such as cache tag fields. It interacts with the processor by supporting related traffic (again comprising addresses, instructions, and data). Continuing exponential growth in processor performance, combined with technology, architecture, and application trends, place enormous demands on the memory system to permit this information storage and exchange at a high-enough performance (i.e., to provide low latency and high bandwidth access to large amounts of information). This paper comprehensively analyzes the redundancy in the information (addresses, instructions, and data) stored and exchanged between the processor and the memory system and evaluates the potential of compression in improving performance of the memory system. Analysis of traces obtained with Sun Microsystems' Shade simulator simulating SPARC executables of nine integer and six floating-point programs in the SPEC CPU2000 benchmark suite yield impressive results. Well-designed compression schemes may provide benefits in performance that far outweigh the extra time and logic for compression and decompression. This will be more so in the future since the speed and size of logic (which will be used to perform compression/decompression) are improving and are projected to improve at a much higher rate compared to those of interconnect (which will be used to communicate the information), both on-chip and off-chip.

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

cache bandwidth latency traffic memory storage

data compression
address compression
markov models
lossless compression
instruction compression
register file
entropy