The performance evaluation tool for automated prototyping of concurrent cyclic processes This paper is addressing an issue of distributed systems designing aimed at automated prototyping of Cyclic Concurrent Processes Systems. In such systems concurrent processes compete for access to shared system resources. In order to ensure that a system is deadlock and starvation-free, certain conditions must be satisfied. In this paper, these conditions guarantee that for a given pair (an initial state, a set of dispatching rules) the system - belonging to a specific class - has a steady cyclic state. However, system designers are interested in values of performance indices, such as a rate of resources or processes utilization or the period of the system cycle. Nowadays, the values of performance indices are provided mainly as a result of a simulation process, which requires much more processor power than in case of an analytical method. Thus, in this paper the authors focus on providing a procedure that enables building analytical models of Cyclic Concurrent Processes Systems belonging to a system class considered in the paper. To reach this aim the max-plus algebra formalism is employed. Both the conditions ensuring a cyclic process flow and steps of the procedure are the basis of a software tool, which can be used by designers to prototype systems of desired values of the performance indices. Thanks to the computer program the designers receive a useful tool that helps to validate and allocate distributed control procedures, even in a complex system, which is a composition of simpler systems. The procedure together with the software tool is the main outcome of this paper.

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


Evolutionary design of nearest prototype classifiers In pattern classification problems, many works have been carried out with the aim of designing good classifiers from different perspectives. These works achieve very good results in many domains. However, in general they are very dependent on some crucial parameters involved in the design. These parameters have to be found by a trial and error process or by some automatic methods, like heuristic search and genetic algorithms, that strongly decrease the performance of the method. For instance, in nearest prototype approaches, main parameters are the number of prototypes to use, the initial set, and a smoothing parameter. In this work, an evolutionary approach based on Nearest Prototype Classifier (ENPC) is introduced where no parameters are involved, thus overcoming all the problems that classical methods have in tuning and searching for the appropiate values. The algorithm is based on the evolution of a set of prototypes that can execute several operators in order to increase their quality in a local sense, and with a high classification accuracy emerging for the whole classifier. This new approach has been tested using four different classical domains, including such artificial distributions as spiral and uniform distibuted data sets, the Iris Data Set and an application domain about diabetes. In all the cases, the experiments show successfull results, not only in the classification accuracy, but also in the number and distribution of the prototypes achieved.

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


Collaborative detection and filtering of shrew DDoS attacks using spectral analysis This paper presents a new spectral template-matching approach to countering shrew distributed denial-of-service (DDoS) attacks. These attacks are stealthy, periodic, pulsing, and low-rate in attack volume, very different from the flooding type of attacks. They are launched with high narrow spikes in very low frequency, periodically. Thus, shrew attacks may endanger the victim systems for a long time without being detected. In other words, such attacks may reduce the quality of services unnoticeably. Our defense method calls for collaborative detection and filtering (CDF) of shrew DDoS attacks. We detect shrew attack flows hidden in legitimate TCP/UDP streams by spectral analysis against pre-stored template of average attack spectral characteristics. This novel scheme is suitable for either software or hardware implementation. The CDF scheme is implemented with the NS-2 network simulator using real-life Internet background traffic mixed with attack datasets used by established research! groups. Our simulated results show high detection accuracy by merging alerts from cooperative routers. Both theoretical modeling and simulation experimental results are reported here. The experiments achieved up to 95% successful detection of network anomalies along with a low 10% false positive alarms. The scheme cuts off malicious flows containing shrew attacks using a newly developed packet-filtering scheme. Our filtering scheme retained 99% of legitimate TCP flows, compared with only 20% TCP flows retained by using the Drop Tail algorithm. The paper also considers DSP, FPGA, and network processor implementation issues and discusses limitations and further research challenges. (C) 2006 Elsevier Inc. All rights reserved.

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

network security
internet infrastructure
packet filtering
reduction of quality
hypothesis test
digital signal processing (dsp)
distributed computing
grid systems
statistical spectral analysis


A provisioning problem with stochastic payments We consider the problem of determining the minimal requirement one must establish in order to meet a series of future random payments. It is shown in a very general setting that this problem can be recast as a chance constrained model and how the technique of Sample Average Approximation can be employed to find solutions. We also use comonotonic theory to analyze analytical approximations in a restricted Gaussian setting. Our numerical illustrations demonstrate that the Sample Average Approximation is a viable and efficient way to solve the stated problem generally and outperforms the analytical approximations. In passing we present a result that is related to Steins famous lemma (Stein, 1981) and is of interest in itself.

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


Research on the inventory scheduling model based on agent-oriented Petri net in supply chain Purpose - The purpose of this paper is to create the inventory scheduling model for supply chain system. Design/methodology/approach - Aiming at the problems of analysis and modeling of multi-agent system, an agent-oriented Petri net (AOPN) model is proposed by introducing the characteristics of agent based on Petri net, and formalization definition of AOPN is presented. Combined with the inventory scheduling in supply chain system, inventory scheduling model based on AOPN is constructed. On the basis of the inventory scheduling model, its program model is designed. Then the reachability of the inventory scheduling model is analyzed and its soundness is verified. Findings - The AOPN model and inventory scheduling model based on AOPN in supply chain system are found. Research limitations/implications - The reasonable basic function design of various agents are main limitations. Practical implications - A very useful tool of analysis for the modeling of inventory scheduling in supply chain system. Originality/value - The paper presents a new modeling method of inventory scheduling in supply chain system. This paper is aimed at researchers and engineers.

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

inventory management
supply chain management
production scheduling
modelling
cybernetics


THE DESIGN OF COMPLEX WAVELET PACKET TRANSFORMS BASED ON PERFECT TRANSLATION INVARIANCE THEOREMS The useful theorems for achieving perfect translation invariance have already been proved, and based on these theorems, dual-tree complex discrete wavelet transforms with perfect translation invariance have been proposed. However, due to the complication of frequency divisions with wavelet packets, it is difficult to design complex wavelet packet transforms with perfect translation invariance. In this paper, based on the aforementioned theorems, novel complex wavelet packet transforms are designed to achieve perfect translation invariance. These complex wavelet packet transforms are based on the Meyer wavelet, which has the important characteristic of possessing a wide range of shapes. In this paper, two types of complex wavelet packet transforms are designed with the optimized Meyer wavelet. One of them is based on a single Meyer wavelet and the other is based on a number of different shapes of the Meyer wavelets to create good localization of wavelet packets.

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

dual-tree complex wavelet packet transform


Restricted vertex multicut on permutation graphs Given an undirected graph and pairs of terminals the Restricted Vertex Multicut problem asks for a minimum set of nonterminal vertices whose removal disconnects each pair of terminals. The problem is known to be NP-complete for trees and polynomial-time solvable for interval graphs. In this paper we give a polynomial-time algorithm for the problem on permutation graphs. Furthermore we show that the problem remains NP-complete on split graphs whereas it becomes polynomial-time solvable for the class of co-bipartite graphs.

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

multicut problem
permutation graphs
split graphs


Automatic tag saliency ranking for stereo images With the rapid advances in 3D capture and display technology, tag ranking for stereo images will be a potential application on web image retrieval. Directly extending the existing approaches to stereo images is problematic as it may neglect the representative 3D elements. In this paper, a novel automatic tag saliency ranking algorithm for stereo images is presented. Specifically, a novel method of interacting with stereo images is proposed to segment the two images into regions simultaneously. Then tags annotated on the image-level are propagated to the region-level via an improved multi-instance learning algorithm. In the next, a new 3D saliency detection algorithm is proposed using occlusion cues along with the contrast in color and disparity. And finally, tags are re-ranked according to the saliency values of the corresponding regions. Moreover, to evaluate the performance of our approach, an annotated stereo image dataset is set up. The experimental results on this dataset demonstrate the effectiveness of our approach.

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

tag ranking
3d saliency detection
stereo image


A study on controlling transmission power of carriers of OFDM signal combined with data symbol spreading in frequency domain We have already proposed a carrier power control scheme of OFDM that makes it possible to improve the bit error rate characteristic [4]. However, the data on the lost carriers by the severe fading or large additive noise can't be recovered by only this power control scheme. In this paper, a method of transmission power control of OFDM carriers combined with data spreading scheme in the frequency domain is proposed. In the proposed system, transmission power of each carrier is controlled so as to maximize the average signal to noise ratio of the data symbols after de-spreading the signals from DFT. As the results of computer simulations, it is confirmed that the proposed system can improve the bit error rate characteristics under multi-path channel.

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

ofdm
transmission power control
data spreading


A variable parameter Shewhart control scheme for joint monitoring of process mean and variance This paper presents a new Statistical Process Control model for the economic optimization of a variable-parameter control chart monitoring a process operation where two assignable causes may occur, one affecting the mean and the other the variance of the process. Therefore, it is possible for the process to operate in statistical control, when none of the two assignable causes has occurred, or under the effect of one or both the assignable causes. By making the assumption that the occurrence rate of each assignable cause is exponential, a Markov chain approach is utilized to determine the probabilities that the process operates at any of the above possible states. The model uses an economic (or an economic/statistical) optimization criterion for the time to the next sampling instance, the size of the next sample, as well as the control limits of the inspection. That is, all design parameters of the control scheme are selected so as to minimize the total expected quality-related costs. The superiority of the proposed model is estimated by comparing its expected quality control cost vs. the outcome of the Fp (Fixed-parameter) Shewhart control chart, the Variable Sample Size (VSS) control chart, the Variable Sampling Interval (VSI) and the Variable Sample Size and Sampling Interval (VSSI) control chart, for a benchmark of examples. The numerical investigation indicates that the economic improvement of the proposed model may be significant. (C) 2012 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

quality control
markov chain
economic optimization


Least-cost design of water distribution systems under demand uncertainty: the robust counterpart approach In this study, a non-probabilistic robust counterpart (RC) approach is demonstrated and applied to the least-cost design/rehabilitation problem of water distribution systems (WDSs). The uncertainty of the information is described by a deterministic user-defined ellipsoidal uncertainty set that implies the level of risk. The advantages of the RC approach on previous modelling attempts to include uncertainty are in making no assumptions about the probability density functions of the uncertain parameters and their interdependencies, having no requirements on the construction of a representative sample of scenarios, and the deterministic equivalent problem preserves the same size (i.e. computational complexity) as the original problem. The RC is coupled with the cross-entropy heuristic optimization technique for seeking robust solutions. The methodology is demonstrated on an illustrative example and on the Hanoi network. The results show considerable promise of the proposed approach to incorporate uncertainty in the least-cost design problem of WDSs. Further research is warranted to extend the model for more complex WDSs, incorporate extended period simulations, and develop RC schemes for other WDSs related management problems.

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


Finding falls in ambulatory care clinical documents using statistical text mining Objective To determine how well statistical text mining (STM) models can identify falls within clinical text associated with an ambulatory encounter. Materials and Methods 2241 patients were selected with a fall-related ICD-9-CM E-code or matched injury diagnosis code while being treated as an outpatient at one of four sites within the Veterans Health Administration. All clinical documents within a 48-h window of the recorded E-code or injury diagnosis code for each patient were obtained (n=26010; 611 distinct document titles) and annotated for falls. Logistic regression, support vector machine, and cost-sensitive support vector machine (SVM-cost) models were trained on a stratified sample of 70% of documents from one location (dataset A(train)) and then applied to the remaining unseen documents (datasets A(test)-D). Results All three STM models obtained area under the receiver operating characteristic curve (AUC) scores above 0.950 on the four test datasets (A(test)-D). The SVM-cost model obtained the highest AUC scores, ranging from 0.953 to 0.978. The SVM-cost model also achieved F-measure values ranging from 0.745 to 0.853, sensitivity from 0.890 to 0.931, and specificity from 0.877 to 0.944. Discussion The STM models performed well across a large heterogeneous collection of document titles. In addition, the models also generalized across other sites, including a traditionally bilingual site that had distinctly different grammatical patterns. Conclusions The results of this study suggest STM-based models have the potential to improve surveillance of falls. Furthermore, the encouraging evidence shown here that STM is a robust technique for mining clinical documents bodes well for other surveillance-related topics.

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

accidental falls
electronic health records


Network Energy Efficiency Gains Through Coordinated Cross-Layer Aggregation and Bypass With the continuous growth of traffic in Internet Protocol (IP) networks, the issue of energy consumption in these networks has been growing in importance. "Next-generation networks" have been predicted as having a potential to reduce energy consumption of packet switched IP networks; however, these predictions have generally not been quantified. This paper provides a demonstration of how these energy savings could be achieved, through architectures including the appropriate application of both circuit switching and packet switching network layers. In this paper, we show that energy savings of around 70% could be achieved through a coordinated cross-layer aggregation and bypass process which can be conveniently implemented by network technologies such as automatically switched optical networks, and generalized multi-protocol label switching, compared to a network using full IP routing at each node.

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

multi-layer switching
and energy/power consumption
next-generation networks
traffic grooming


On the fine spectrum of the operator B(r,s,t) B ( r , s , t ) over the sequence spaces ?p ? p and bvp,(1<p<?) b v p , ( 1 < p < ? ) The main purpose of this paper is to determine the fine spectrum with respect to the Goldbergs classification of the operator B(r,s,t) B ( r , s , t ) defined by a triple band matrix over the sequence spaces ?p ? p and bvp b v p with 1<p<? 1 < p < ? . These results are more general than the spectrum of the second order difference operator ?2 ? 2 and include some other special cases such as the spectrum of the generalized difference operator B(r,s) B ( r , s ) over ?p ? p and bvp b v p of Bilgi and Furkan [H. Bilgi, H. Furkan, On the fine spectrum of the generalized difference operator B(r,s) B ( r , s ) over the sequence spaces ?p ? p and b v p ( 1 < p < ? ) , Nonlinear Anal. 68 (3) (2008) 499506], the spectrum of the difference operator ? ? over ?p ? p of Akhmedov and Ba?ar [A.M. Akhmedov, F. Ba?ar, On the spectra of the difference operator ? ? over the sequence space ?p ? p , Demonstratio Math. 39 (3) (2006) 585595], the spectrum of the same operator over bvp b v p of Akhmedov and Ba?ar [A.M. Akhmedov, F. Ba?ar, On the fine spectra of the difference operator ? ? over the sequence space bvp,1?p<? b v p , 1 ? p < ? , Acta Math. Sin. Eng. Ser. 23 (10) (2007) 17571768], the right shift and Zweier matrices.

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

the sequence spaces ?p ? p and bvp b v p ?p ? p ?p ? p ? p bvp b v p bvp b v p b v p


automated mapping for reconfigurable single-electron transistor arrays Reducing power consumption has become one of the primary challenges in chip design, and therefore significant efforts are being devoted to find holistic solutions on power reduction from the device level up to the system level. Among a plethora of low power devices that are being explored, single-electron transistors (SETs) at room temperature are particularly attractive. Although prior work has proposed a binary decision diagram-based reconfigurable logic architecture using SETs, it lacks an automated synthesis tool for the device. Consequently, in this work, we develop a product-term-based approach that synthesizes a logic circuit by mapping all its product terms into the SET architecture. The experimental results show the effectiveness and efficiency of the proposed approach on a set of MCNC benchmarks.

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

single-electron transistor
automatic synthesis
binary decision diagram


on quantifying changes in temporally evolving dataset In this paper, we present a general framework to quantify changes in temporally evolving data. We focus on changes that materialize due to evolution and interactions of features extracted from the data. The changes are captured by the following key transformations: create, merge, split, continue, and cease . First, we identify various factors which influence the importance of each transformation. These factors are then combined using a weight vector. The weight vector encapsulates domain knowledge. We evaluate our algorithm using the following datasets: DBLP, IMDB, Text and Scientific Dataset .

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

knowledge discovery
temporal data analysis


A bounding-based solution approach for the continuous arc covering problem Road segments, telecommunication wiring, water and sewer pipelines, canals and the like are important features of the urban environment. They are often conceived of and represented as network-based arcs. As a result of the usefulness and significance of arc-based features, there is a need to site facilities along arcs to serve demand. Examples of such facilities include surveillance equipment, cellular towers, refueling centers and emergency response stations, with the intent of being economically efficient as well as providing good service along the arcs. While this amounts to a continuous location problem by nature, various discretizations are generally relied upon to solve such problems. The result is potential for representation errors that negatively impact analysis and decision making. This paper develops a solution approach for the continuous arc covering problem that theoretically eliminates representation errors. The developed approach is applied to optimally place acoustic sensors and cellular base stations along a road network. The results demonstrate the effectiveness of this approach for ameliorating any error and uncertainty in the modeling process.

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


Optimum power control for CDMA with deterministic sequences in fading channels We specify the capacity region for a power-controlled, fading code-division multiple-access (CDMA) channel. We investigate the properties of the optimum power allocation policy that maximizes the information-theoretic ergodic sum capacity of a CDMA system where the users are assigned arbitrary signature sequences in a frequency flat-fading environment. We provide an iterative waterfilling algorithm to obtain the powers of all users at all channel fade levels, and prove its convergence. Under certain mild conditions on the signature sequences, the optimum power allocation dictates that more than one user transmit simultaneously in some nonzero probability region of the space of all channel states. We identify these conditions, and provide an upper bound on the maximum number of users that can transmit simultaneously at any given time. Using these properties of the sum capacity maximizing power control policy, we also show that the capacity region of the fading CDMA channel is not in general strictly convex.

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

capacity region
fading channels
iterative waterfilling
power control
sum capacity


On testing hypotheses with doubly censored data Methods of testing simple hypotheses about lifetime parameters from doubly censored data are given on the basis of the maximum likelihood principle. It is shown that under the assumptions of standard type, the asymptotic distribution of proposed statistics is chi-square or linear combination of chi-square distributions. The choice of statistics optimal from the point of view of power is discussed and illustrated by several examples.

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


on the genetic programming of time-series predictors for supply chain management Single and multi-step time-series predictors were evolved for forecasting minimum bidding prices in a simulated supply chain management scenario. Evolved programs were allowed to use primitives that facilitate the statistical analysis of historical data. An investigation of the relationships between the use of such primitives and the induction of both accurate and predictive solutions was made, with the statistics calculated based on three input data transformation methods: integral, differential, and rational. Results are presented showing which features work best for both single-step and multi-step predictions.

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

iterated single-step prediction
statistical time-series features
single-step prediction
prediction/forecasting


INTRINSIC CURVATURE: A MARKER OF MILLIMETER-SCALE TANGENTIAL CORTICO-CORTICAL CONNECTIVITY? In this paper, we draw a link between cortical intrinsic curvature and the distributions of tangential connection lengths. We suggest that differential rates of surface expansion not only lead to intrinsic curvature of the cortical sheet, but also to differential inter-neuronal spacing. We propose that there follows a consequential change in the profile of neuronal connections: specifically an enhancement of the tendency towards proportionately more short connections. Thus, the degree of cortical intrinsic curvature may have implications for short-range connectivity.

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

cortical connectivity
surface morphology


A new approach to link transport emissions and air quality: An intelligent transport system based on the control of traffic air pollution Road transport has become by far the major source of environmental pollution and traffic congestion in urban areas. Though a lot of research has been done to investigate the functional relationship linking air quality and air pollution from transport, a further improvement in the knowing of this relationship is needed. The aim of this study was to analyze this relationship and to develop a more flexible framework to allow communication between transport emissions and air quality concentrations. This paper describes the development of this framework, suggests methodological tools to mitigate its problems and shows its application to the mega-city of Beijing, in P.R. China. The result of implementing this methodology would be a system providing high time/space resolution measurements of both air pollutant concentrations and traffic emissions data, as well as real-time transportation and dispersion modelling of those data. The key advantage of the system proposed would be the runtime integration of modelling, to interpret the data measured, with measurements, to validate the data modelled. The findings from the case-study of Beijing show that the integrated system can link traffic air pollution measurements through various modelling modules in order to automate transport-related air pollution assessment.

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

air pollution
traffic
emissions
concentrations
modelling
measurements


Towards building a data-intensive index for big data computing A case study of Remote Sensing data processing With the recent advances in Remote Sensing (RS) techniques, continuous Earth Observation is generating tremendous volume of RS data. The proliferation of RS data is revolutionizing the way in which RS data are processed and understood. Data with higher dimensionality, as well as the increasing requirement for real-time processing capabilities, have also given rise to the challenging issue of Data-Intensive (DI) Computing. However, how to properly identify and qualify the DI issue remains a significant problem that is worth exploring. DI computing is a complex issue. While the huge data volume may be one of the reasons for this, some other factors could also be important. In this paper, we propose an empirical model (DIRS DI RS ) of DI index to estimate RS applications. DIRS DI RS here is a novel empirical model (DIRS DI RS ) that could quantify the DI issues in RS data processing with a normalized DI index. Through experimental analysis of the typical algorithms across the whole RS data processing flow, we identify the key factors that affect the DI issues mostly. Finally, combined with the empirical knowledge of domain experts, we formulate DIRS DI RS model to describe the correlations between the key factors and DI index. By virtue of experimental validation on more selected RS applications, we have found that DIRS DI RS model is an easy but promising approach.

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

parallel computing
data-intensive computing


Rough fuzzy set based scale space transforms and their use in image analysis In this paper we present a multi-scale method based on the hybrid notion of rough fuzzy sets, coming from the combination of two models of uncertainty like vagueness by handling rough sets and coarseness by handling fuzzy sets. Marrying both notions lead to consider, as instance, approximation of sets by means of similarity relations or fuzzy partitions. The most important features are extracted front the scale spaces by unsupervised cluster analysis, to successfully tackle image processing tasks. Here, we report sonic results achieved by applying the method to multi-class image segmentation and edge detection, but it can be shown to be successfully applied to texture discrimination problem too. (C) 2005 Elsevier Inc. All rights reserved.

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

fuzzy rough sets
clustering
region segmentation


The value of rolling-horizon policies for risk-averse hydro-thermal planning We consider the optimal management of a hydro-thermal power system in the mid and long terms. From the optimization point of view, this amounts to a large-scale multistage stochastic linear program, often solved by combining sampling with decomposition algorithms, like stochastic dual dynamic programming. Such methodologies, however, may entail prohibitive computational time, especially when applied to a risk-averse formulation of the problem. We propose instead a risk-averse rolling-horizon policy that is nonanticipative, feasible, and time consistent. The policy is obtained by solving a sequence of risk-averse problems with deterministic constraints for the current time step and future chance and CVaR constraints. The considered hydro-thermal model takes into account losses resulting from run-of-river plants efficiencies as well as uncertain demand and streamflows. Constraints aim at satisfying demand while keeping reservoir levels above minzones almost surely. We show that if the problem uncertainty is represented by a periodic autoregressive stochastic process with lag one, then the probabilistic constraints can be computed explicitly. As a result, each one of the aforementioned risk-averse problems is a medium-size linear program, easy to solve. For a real-life power system we compare our approach with three alternative policies. Namely, a robust nonrolling-horizon policy and two risk-neutral policies obtained by stochastic dual dynamic programming, implemented in nonrolling- and rolling-horizon modes, respectively. Our numerical assessment confirms the superiority of the risk-averse rolling-horizon policy that yields comparable average indicators, but with reduced volatility and with substantially less computational effort.

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

stochastic programming
chance constraints
interstage dependence
rolling horizon
hydro-thermal planning


The BORM methodology: a third-generation fully object-oriented methodology Business object relationship modelling (BORM) is a development methodology developed to capture Knowledge of typical business systems. It has been in development since 1993 and has proved an increasingly effective method which is popular with both users and developers. The effectiveness gained is largely as a result of a unified and simple method for presenting all aspects of the relevant model. This paper outlines BORM, its tools, methods and its differences from other similar development methodologies.

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


Automatic Generation of Persistent Formations for Multi-agent Networks Under Range Constraints In this paper we present a collection of graph-based methods for determining if a team of mobile robots, subjected to sensor and communication range constraints, can persistently achieve a specified formation. What we mean by this is that the formation, once achieved, will be preserved by the direct maintenance of the smallest subset of all possible pairwise inter-agent distances. In this context, formations are defined by sets of points separated by distances corresponding to desired inter-agent distances. Further, we provide graph operations to describe agent interactions that implement a given formation, as well as an algorithm that, given a persistent formation, automatically generates a sequence of such operations. Experimental results are presented that illustrate the operation of the proposed methods on real robot platforms.

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

multi-agent network
formation control
graph-based control
decentralized control
persistent graphs
rigid graphs


Formal DEVS modelling and simulation of a flow-shop relocation method without interrupting the production This paper presents an organizational method of transfer of a flow-shop to a new site without interrupting the production. This method, which can be used even in case of requirements during the removal period, consists in segmenting the flow-shop removal into successive removals of groups of machines. This method can be successfully applied provided a prime condition is met: there must be sufficient stock upstream of the different groups of machines. The role of these stocks is to ensure continuity of production operations between the old and the new site, while a non-operational group of machines is being removed. The removal of groups of machines goes on until the whole production line is transferred to the new site and operational on this site. To validate this approach, we used a simulation and developed a flow-shop model according to the DEVS formalism. Our model makes it possible to segment a production line. We can therefore simulate a sequential transfer of groups of machines to the new site. The most effective solutions among those proposed suggest starting with the final group of machines (finished products) to finish with the first group. In this paper, we present and discuss some simulation results for an industrial case study. These results demonstrate the compared effectiveness of different removal strategies, and help decide for the appropriate estimated project management.

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

flow-shop relocation project management
facilities relocation


An enhanced feature extraction model using lifting-based wavelet packet transform scheme and sampling-importance-resampling analysis The efficiency of data processing is critical for the on-line monitoring applications of industrial components and systems, both from the viewpoints of the rapid adaptation to the non-stationary signals and the cost of information storage and transmission. In this paper, we propose an enhanced feature extraction model for machinery performance assessment, which is based on the lifting-based wavelet packet transform (WPT) and sampling-importance-resampling methods. The lifting-based WPT decomposes the signals. Then the sampling-importance-resampling procedure is applied in the wavelet domain to extract the distribution information and compose the feature vectors. Finally, a support vector machine is used to assess the normal or abnormal condition based on these extracted features. To validate the proposed new model, an endurance test of pressure regulators has been carried out. Compared to the traditional wavelet packet method, the new model can not only keep the precision level but also improve the efficiency by over 60%.

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

feature extraction
wavelet packet
support vector machine


an efficient link management algorithm for high mobility mesh networks Mobility causes frequent link failures in ad-hoc networks. This results in a severe degradation of performance specially in case of high mobility of nodes. This is because the routing protocols for ad-hoc networks are not equipped to handle high mobility. In this paper, we have presented a new link management algorithm to locally manage links. This new mechanism is based on signal strength measurements. We develop the hysteresis mechanism provided by OLSR based on hello packets to include signal strength measurements. The mechanism in OLSR uses Hello packets received/lost to decide to establish link or not. The problem with this approach arises when there is high mobility in which case the time to break the link and use a new path becomes significant. To overcome this, we propose to use signal strength to determine if the link-quality is improving or deteriorating. This combination of the two mechanisms, makes the link management more robust and also helps in anticipating link breakages thereby greatly improving performance.

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


parallel mixing Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our reencryption mixnet allows servers to mix inputs in parallel. The result is a dramatic reduction in overall mixing time for moderate-to-large numbers of servers. As measured in the model we describe, for n inputs and $M$ servers our parallel re encryption mixnet produces output in time at most 2n -- and only around n assuming a majority of honest servers. In contrast, a traditional, sequential, synchronous re-encryption mixnet requires time Mn. Parallel re-encryption mixnets offer security guarantees comparable to those of synchronous mixnets, and in many cases only a slightly weaker guarantee of privacy. Our proposed construction is applicable to many recently proposed re-encryption mixnets, such as those of Furukawa and Sako, Neff, Jakobsson et al., and Golle and Boneh. In practice, parallel mixnets promise a potentially substantial time saving in applications such as anonymous electronic elections.

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

applications encryption parallel design reduction privacy model cost server mixnet

parallel execution
network
synchronization
computation
timing
anonymity
secure
practical
permutation


Interaction of TCP flows as billiards The aim of this paper is to analyze the performance of a large number of long-lived TCP controlled flows sharing many routers (or links), from the knowledge of the network parameters (capacity, buffer size, topology) and of the characteristics of each TCP flow (RTT, route etc.) when taking synchronization into account. It is shown that in the small buffer case, the dynamics of such a network can be described in terms of iterate of random piecewise affine maps, or geometrically as a billiards in the Euclidean space with as many dimensions as the number of flow classes and as many reflection facets as there are routers. This class of billiards exhibits both periodic and nonperiodic asymptotic oscillations, the characteristics of which are extremely sensitive to the parameters of the network. It is also shown that for large populations and in the presence of synchronization, aggregated throughputs exhibit fluctuations that are due to the network as a whole, that follow some complex fractal patterns, and that come on top of other and more classical flow or packet level fluctuations. The consequences on TCP's fairness are exemplified on a few typical cases of small dimension.

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

bandwidth sharing
dynamical system
flow level modeling
ip traffic
product of random matrices
tcp fairness


comparing user performance with single-finger, whole-hand, and hybrid pointing devices Researchers have explored pointing devices operated by a single finger, but their advantage was not clear compared to conventional mice controlled by the whole hand. To incorporate the benefits of both, we prototyped hybrid pointing devices that combined both finger and hand movement to control the cursor, and experimentally compared their performance with single-finger and whole-hand devices. Results showed that such hybrid devices have the potential to improve pointing performance in terms of time, error, and bandwidth, especially for precise pointing.

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


fast compiler optimisation evaluation using code-feature based performance prediction Performance tuning is an important and time consuming task which may have to be repeated for each new application and platform. Although iterative optimisation can automate this process, it still requires many executions of different versions of the program. As execution time is frequently the limiting factor in the number of versions or transformed programs that can be considered, what is needed is a mechanism that can automatically predict the performance of a modified program without actually having to run it. This paper presents a new machine learning based technique to automatically predict the speedup of a modified program using a performance model based on the code features of the tuned programs. Unlike previous approaches it does not require any prior learning over a benchmark suite. Furthermore, it can be used to predict the performance of any tuning and is not restricted to a prior seen trans-formation space. We show that it can deliver predictions with a high correlation coefficient and can be used to dramatically reduce the cost of search.

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

performance modelling
artificial neural networks
architecture


Haptic Palpation for Medical Simulation in Virtual Environments Palpation is a physical examination technique where objects, e. g., organs or body parts, are touched with fingers to determine their size, shape, consistency and location. Many medical procedures utilize palpation as a supplementary interaction technique and it can be therefore considered as an essential basic method. However, palpation is mostly neglected in medical training simulators, with the exception of very specialized simulators that solely focus on palpation, e. g., for manual cancer detection. In this article we propose a novel approach to enable haptic palpation interaction for virtual reality-based medical simulators. The main contribution is an extensive user study conducted with a large group of medical experts. To provide a plausible simulation framework for this user study, we contribute a novel and detailed interaction algorithm for palpation with tissue dragging, which utilizes a multi-object force algorithm to support multiple layers of anatomy and a pulse force algorithm for simulation of an arterial pulse. Furthermore, we propose a modification for an off-the-shelf haptic device by adding a lightweight palpation pad to support a more realistic finger grip configuration for palpation tasks. The user study itself has been conducted on a medical training simulator prototype with a specific procedure from regional anesthesia, which strongly depends on palpation. The prototype utilizes a co-rotational finite-element approach for soft tissue simulation and provides bimanual interaction by combining the aforementioned techniques with needle insertion for the other hand. The results of the user study suggest reasonable face validity of the simulator prototype and in particular validate medical plausibility of the proposed palpation interaction algorithm.

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

medicine
physically-based simulation
haptics
user studies


Online variational learning of generalized Dirichlet mixture models with feature selection Three frequently recurring themes in machine learning, data mining and related disciplines are clustering, feature selection and online learning. Motivated by the importance of these themes which are generally interrelated, we propose a statistical framework for simultaneous online clustering and feature selection using finite generalized Dirichlet mixture model. The proposed framework allows to control overfitting by, dynamically and simultaneously, adjusting the mixture model's parameters, number of components and the features weights. We describe a principled variational approach for learning the parameters of the proposed statistical model. Results on both synthetic data and real applications involving online documents and images clustering show the merits of the proposed approach.

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

online learning
mixture models
feature selection
generalized dirichlet

variational inference
documents clustering


A queuing model on supply chain with the form postponement strategy The form postponement (FP) strategy is an important strategy for manufacturing firms to utilize to achieve a quick response to customer needs while keeping low inventory levels of finished products. It is an important and difficult task to design a supply chain that uses FP strategy to mitigate the conflict between inventory level and service level. To this end, we develop a two-stage tandem queuing network to model the supply chain. The first stage is the manufacturing process of the undifferentiated semi-finished product, which is produced on a Make-To-Stock basis: the inventory is controlled by base-stock policy. The second stage is the customization process based on customers' specified requirements. There are two types of order: ordinary order and special order. The former can be met by customizing from semi-finished product, while the latter must be entirely customized beginning from the first stage. The customer orders arrive according to a Poisson process. We first derive the inventory level and fill rate, and then present a total cost model. It turns out that the model is intractable due to the Poisson distribution in the objective function. To analytically solve the problem, we use normal distribution as an approximation of the Poisson distribution, which works well when the parameter of the Poisson distribution is quite large. Finally, some numerical experiments are conducted and managerial insights are offered based on the numerical results. (C) 2013 Elsevier Ltd. All rights reserved.

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

customer order decoupling point
mass customization


Anonymous addressing servers: a solution of failures in wireless mobile location service In this paper, a new Adaptive Centralised Location-Service (ACLS) routing protocol is presented, which tracks mobile node locations and recover the side effects of nodes mobility. In ACLS, some nodes consider themselves as servers serve other nodes according to their location and status in the network. The transmission is achieved by 'anonymous addressing' technique where the receivers decide on their own, whether they are the intended destination. Results indicate very good and impressive performance of the ACLS in terms of scalability with the number of nodes, speed and location update success rate.

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


US patents in 1856 A scenario for the US patent system, patent office and granted patents 150years ago is outlined, based on the annual report of the Commissioner of Patents for 1856. Particular topics covered include input and workload; some comparisons of US, English, and French patent offices in 1856; annual fees; repeal of invalid patents; and the provision of patent copies. A tabulation of granted patents by subject matter, and comments and drawings from some typical and some interesting patents, complete the article.

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

us patents
input
workload
annual fees
patent copies

historical
patent commissioner report
us patent office
english patent office
french patent office
repeal invalid patents


Control of stationary and transportation fuel cell systems: Progress and opportunities Fuel cell power systems have witnessed intense development in the recent years as they offer a clean and efficient alternative for power generation in stationary and transportation applications. In this paper, we present an overview of recent work on dynamic modeling and control design for stationary and transportation fuel cell systems including the research at United Technologies Corporation. The use of equation oriented modeling framework for system level dynamic modeling enabled by tools, such as Dymola and gPROMS is described. It is demonstrated that the non-linear system level models readily allow linear model derivation and the application of advanced control analysis and design techniques that provide more insight into the system level dynamic and control issues in fuel cell systems. The dynamic modeling and advanced control design research performed at UTC for a hydrogen fed PEMFC power plant for a bus and a natural gas fed PEMFC power plant for stationary power generation is described. We also identify, for future research, the challenges and opportunities in several areas relating to fuel cell systems ranging from power management and freeze startup to system level modeling, control, diagnostics and hardware-in-the-loop validation of the control system. The emphasis is on polymer electrolyte membrane fuel cell (PEMFC) systems but phosphoric acid fuel cell (PAFC) systems are also briefly discussed. (c) 2006 Elsevier Ltd. All rights reserved.

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

fuel cell
control
stationary power generation
diagnostics


Low-Latency Time-Portable Real-Time Programming with Exotasks Exotasks are a novel Java programming construct that achieve three important goals. They achieve low latency while allowing the fullest use of Java language features, compared to previous attempts to restrict the Java language for use in the submillisecond domain. They support pluggable schedulers, allowing easy implementation of new scheduling paradigms in a real-time Java system. They can achieve deterministic timing, even in the presence of other Java threads, and across changes of hardware and software platform. To achieve these goals, the program is divided into tasks with private heaps. Tasks may be strongly isolated, communicating only with each other and guaranteeing determinism, or weakly isolated, allowing some communication with the rest of the Java application. Scheduling of the tasks' execution, garbage collection, and value passing is accomplished by the pluggable scheduler. Schedulers that we have written employ logical execution time ( LET) in association with strong isolation to achieve time portability. We have also built a quad-rotor model helicopter, the JAviator, which we use to evaluate our implementation of Exotasks in an experimental embedded version of IBM's J9 real-time virtual machine. Our experiments show that we are able to maintain very low scheduling jitter and deterministic behavior in the face of variations in both software load and hardware platform. We also show that Exotasks perform nearly as well as Eventrons on a benchmark audio application.

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

algorithms
languages
measurement
performance
real-time scheduling
uavs


Auto ID systems and intelligent manufacturing control Automated identification systems which involve the automated retrieval of the identity of objects are becoming a reality for monitoring items moving through the manufacturing supply chain. Automated identification enables accurate, timely information about a specific item to be stored, retrieved and communicated. This information can be used to assist in automated decision making and control functions relevant to that item. This paper specifically explores the impact of such developments on manufacturing shop floor control, examining the way in which both conventional control methods and so-called distributed, intelligent control methods can be enhanced by the availability of accurate, timely information about an item. In the case of distributed, intelligent manufacturing control we begin to build a specification for the concept of an intelligent producta product whose information content is permanently bound to its material content and which is able to influence decisions made about it.

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

intelligent manufacturing systems
automatic identification
distributed systems
holonic manufacturing
multi-agent systems


Models and algorithms for bounds on leakage in CMOS circuits Subthreshold leakage current in deep submicron MOS transistors is becoming a significant contributor to power dissipation in CMOS circuits as threshold voltages and channel lengths are reduced, Consequently, estimation of leakage current and identification of minimum and maximum leakage conditions are becoming important, especially in low power applications. In this paper we outline methods for estimating leakage at the circuit level and then propose heuristic and exact algorithms to accomplish the same task for random combinational logic. In most cases the heuristic is found to obtain bounds on leakage that are close and often identical to bounds determined by a complete branch and bound search. Methods are also demonstrated to show how estimation accuracy can be traded off against execution time. The proposed algorithms have potential application in power management applications or quiescent current (I(D)DQ) testing if one wished to control leakage by application of appropriate input vectors. For a variety of benchmark circuits, leakage was found to vary by as much as a factor of six over the space of possible input vectors.

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

circuit analysis
circuit modeling
cmos digital integrated circuits
integrated circuit modeling
integrated circuit testing
leakage currents
low-power integrated circuits
mos leakage control
mos short channel effects
very large scale integration


Simulation-based performance measurement and analysis: an industrial application This paper deals with discrete-continuous problems of planning and scheduling jobs that cannot be pre-empted The need for reusability and modularity leads us to build a generic simulation and optimization framework, which is described in this contribution. The validation of our platform is presented in terms of an application to an actual highly constrained discrete-continuous problem.

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


theoretical principles of quantum information science Paper presents main principles of quantum informatics together with the basic approach to quantum information measures. Quantum informatics is very promising way for future development of information technologies and computers. Paper summarizes the current author's results achieved in theoretical area of quantum informatics.

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

quantum computing
wave probabilistic functions


truthful fair division We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanisms. In the case of a general measure space ("cake") and non-atomic, additive individual preference measures - or utilities - we show that there exists a truthful "mechanism" which ensures that each of the k players gets at least 1/ k of the cake. This mechanism also minimizes risk for truthful players. Furthermore, in the case where there exist at least two different measures we present a different truthful mechanism which ensures that each of the players gets more than 1/ k of the cake. We then turn our attention to partitions of indivisible goods with bounded utilities and a large number of goods. Here we provide similar mechanisms, but with slightly weaker guarantees. These guarantees converge to those obtained in the non-atomic case as the number of goods goes to infinity.

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

fair division
cake cutting
truthful mechanisms


Combining Computational Analyses and Interactive Visualization for Document Exploration and Sensemaking in Jigsaw Investigators across many disciplines and organizations must sift through large collections of text documents to understand and piece together information. Whether they are fighting crime, curing diseases, deciding what car to buy, or researching a new field, inevitably investigators will encounter text documents. Taking a visual analytics approach, we integrate multiple text analysis algorithms with a suite of interactive visualizations to provide a flexible and powerful environment that allows analysts to explore collections of documents while sensemaking. Our particular focus is on the process of integrating automated analyses with interactive visualizations in a smooth and fluid manner. We illustrate this integration through two example scenarios: An academic researcher examining InfoVis and VAST conference papers and a consumer exploring car reviews while pondering a purchase decision. Finally, we provide lessons learned toward the design and implementation of visual analytics systems for document exploration and understanding.

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

information visualization
exploratory search
information seeking
document analysis


A robust and fast approach to simulating the behavior of guidewire in vascular interventional radiology An approach to simulating the behavior of guidewire in vascular interventional radiology is proposed. Our approach works robustly and realistically under different vascular circumstances. Our approach is faster by proposing a force correction strategy which avoids endlessly repetitive collision detections.

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

surgical simulation and training
guidewire model
vasculature


a linkage tool for analyzing earthquake traffic impact in micro level based on seismic risk assessment and traffic simulation This paper developed a new software tool, RD-Linker, for analysis and simulation of earthquake traffic impact in micro level by the means of linking seismic risk assessment and traffic simulation based on Federal Highway Administration (FHWA)'s two software programs. Building a linker between them will be able to take advantages of their functionalities of these two software tools and avoid duplicating research and development work. REDARS (Risks from Earthquake Damage to Roadway Systems) is utilized for seismic risk assessment. DYNASMART-P (DYnamic Network Assignment-Simulation Model for Advanced Road Telematics) is employed for traffic simulation. REDRAS provides seismic risk analysis of highway systems to estimate the economic impact of earthquakes on transportation networks by evaluating damage to bridges and modeling the subsequent impacts on traffic flow. However, the analysis of the traffic impacts is limited in macro level only. Through RD-Linker, DYNASMART-P is able to do dynamic traffic network simulation in micro level with the damage affection on post-earthquake travel times and traffic flows as well as in comparison to pre-earthquake traffic status. Furthermore, the feedback information can improve the accuracy of the REDARS loss estimation based on the traffic congestions. These will be useful to emergency management officials and emergency responders.

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

transportation networks
traffic impact
earthquake
traffic simulation


Inbreeding and outbreeding depressions in the Penna model as a result of crossover frequency The population in the sexual Penna aging model is first separated into several reproductively isolated groups. Then, after equilibration, sexual mixing between the groups is allowed. We study the changes in the population size due to this mixing and interpret them through a counterplay of purifying selection and of haplotype complementarity.

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

monte carlo simulation
sexual reproduction
penna ageing model.


Intrusion Detection by Ellipsoid Boundary This paper presents a novel approach to describe the normal behavior of computer networks (as used in IDS) based on Support Vector Data Description (SVDD). In the proposed method we find a minimal hyper-ellipse around the normal objects in the input space. Hyper-ellipse can be expanded in high dimensional space (ESVDD) or to be used as a preprocessing in SVDD method (PESVDD) to obtain better results for IDS. KDD-cup99 has been used as data set for test of the proposed method. The overall experiments show prominence of our work in comparison with similar previous works.

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

intrusion detection system (ids)
support vector data description (svdd)


A new approach for the numerical solution of diffusion equations with variable and degenerate mobility We propose a novel approach for the numerical integration of diffusion-type equations with variable and degenerate mobility or diffusion coefficient. Our focus is the CahnHilliard equation which plays a prominent role in phase field models of fluids and soft materials but the methodology has a more general applicability. The central idea is a split method with a linearly implicit component and an analytic step to integrate out the variable mobility. The proposed method is robust, free of high order stability constraints, and its cost is comparable to that of solving the linear Heat Equation with the backward Euler Method. Moreover, by design, the numerical solution is guaranteed to be strictly bounded by the stable, constant states.

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

cahnhilliard equation
degenerate mobility


Getting virtual 3D landscapes out of the lab A theoretical discussion on the capabilities of differing types of landscape presentation methods Proposed and implemented landscape visualisation on-demand and on-site from existing virtual 3D landscape models Use of smartphones and standard web browsing technologies to access the landscape visualisations.

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

on-site on-demand smartphone mobile tablet


Provably secure and efficient certificateless authenticated tripartite key agreement protocol Authenticated key agreement (AKA) protocols are multi-party protocols in which entities exchange public information allowing them to create a common secret key that is known only to those entities over an open network. Recently, in order to circumvent the key escrow problem inherent to ID-based cryptography and the certificate management burden in traditional public key infrastructure, the notion of certificateless public key cryptography (CL-PKC) was introduced. In this paper, we first present a security model for certificateless AKA protocols for three parties, and then propose an efficient construction based on bilinear pairings. The security of the proposed scheme can be proved to be equivalent to the computational Diffie-Hellman problem in the random oracle model. (C) 2011 Elsevier Ltd. All rights reserved.

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

key agreement
tripartite
random oracle model

authentication
bilinear pairing
certificateless cryptosystem


Connection tableaux with lazy paramodulation It is well known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tableau calculus for logic with equality. This calculus is based on a lazy form of paramodulation where parts of the unification step become auxiliary subgoals in a tableau and may be subjected to subsequent paramodulations. Our calculus uses ordering constraints and a certain form of the basicness restriction.

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

basic ordered paramodulation
first-order logic with equality


Highly configurable platforms for embedded computing systems Platform chips, which are pre-designed chips possessing numerous processors, memories, coprocessors, and field-programmable gates arrays, are becoming increasingly popular. Platforms eliminate the costs and risks associated with creating customized chips, but with the drawbacks of poorer performance and energy consumption. Making platforms highly configurable, so they can be tuned to the particular applications that will execute on those platforms, can help reduce those drawbacks. We discuss the trends leading embedded system designers towards the use of platforms instead of customized chips. We discuss UCR research in designing highly configurable platforms, highlighting some of our work in highly configurable caches, and in hardware/software partitioning.

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

system-on-a-chip
field-programmable gate array
cores
embedded systems
low energy
cache
hardware/software partitioning
architecture tuning


on tracker attacks in health grids The utilisation of grid computing to support healthcare research is becoming increasingly widespread, as is the use of IT to support healthcare delivery. Furthermore, it seems that the two areas are on an inevitable convergence path as clinical communities in several countries start to investigate how real data stored in electronic patient records can be utilised to facilitate research. The use of IT within healthcare gives rise to unique social and ethical challenges; the area of grid computing has given rise to significant novel security challenges; and the anticipated convergence of these two fields will inevitably give a new lease of life to established challenges. In this paper we consider the phenomenon of tracker attacks in this emerging context, and outline a potential approach to addressing the problem.

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


The Impact of Information Overload and Contribution Overload on Continued Usage of Electronic Knowledge Repositories In the modern competitive organizational environment, more and more organizations are implementing knowledge management initiatives to achieve strategic advantages. One such initiative involves the implementation of electronic knowledge repositories (EKR). EKR implementation frequently results in a rapid increase in the quantity of information that must be processed daily by employees. This raises concerns about information overload (IO), and this is particularly true in relation to modern EKRs that use distributive technology. Furthermore, employees can also suffer from contribution overload (CO) because they can fulfill the functions of both knowledge seekers and knowledge contributors. This study employs the cognitive dissonance theory to determine whether IO and CO affect employees' willingness to use EKRs. The results from 144 survey respondents provide the first empirical evidence that contribution overload exerts a direct and significant negative effect on the intention to continue using EKR, whereas information overload exerts an indirect and significant negative effect on the intention to continue using EKR by altering perceived usefulness and satisfaction with the system.

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

cognitive dissonance theory
contribution overload
information overload

electronic knowledge repository
is continuance


Information Maximization in a Linear Manifold Topographic Map This article addresses the problem of unsupervised learning of multiple linear manifolds in a topology preserving neural map. The model finds simple linear estimations of the regions of the unknown data manifold. Each neuron of the map corresponds to a linear manifold whose basis and mean vectors and on- and off-manifold standard deviations must be learnt. The learning rules are derived based on competition between neurons and maximizing an approximation of the mutual information between the input and the output of each neuron. Neighborhood functions are also considered in the learning rules in order to develop the topology preserving property for the map. Considering two special density models for the input data, the optimal nonlinear input/output mappings of the neurons are found. Experimental results show a good performance for the proposed method on synthesized and practical problems compared with other relevant techniques.

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

unsupervised learning
linear manifold topographic map
information maximization

neural networks
adaptive subspace self-organizing map
principal component analysis
entropy


NMSDECAY:

A

Fortran

code

for

supersymmetric

particle

decays

in

the

Next-to-Minimal

Supersymmetric

Standard

Model

The

code

NMSDECAY

allows

to

compute

widths

and

branching

ratios

of

sparticle

decays

in

the

Next-to-Minimal

Supersymmetric

Standard

Model.

It

is

based

on

a

generalization

of

SDECAY,

to

include

the

extended

Higgs

and

neutralino

sectors

of

the

NMSSM.

Slepton

decays,

possibly

relevant

in

the

case

of

a

singlino-like

lightest

supersymmetric

particle,

have

been

added.

NMSDECAY

will

be

part

of

the

NMSSMTools

package,

which

computes

Higgs,

sparticle

masses

and

Higgs

decays

in

the

NMSSM.

Program

summary

Program

title:

NMSDECAY

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Computer:

All

supporting

gfortran,

ifort

Operating

system:

All

supporting

gfortran,

ifort

Classification:

External

routines:

Routines

in

the

NMSSMTools

package:

At

least

one

of

the

routines

in

the

directory

main

(e.g.

nmhdecay.f),

all

routines

in

the

directory

sources.

(All

software

is

included

in

the

distribution

package.)

Nature

of

problem:

Calculation

of

all

decay

widths

and

decay

branching

fractions

of

all

particles

in

the

Next-to-Minimal

Supersymmetric

Standard

Model.

Solution

method:

Suitable

generalization

of

the

code

SDECAY

including

the

extended

Higgs

and

neutralino

sector

of

the

Next-to-Minimal

Supersymmetric

Standard

Model,

and

slepton

decays.

Additional

comments:

NMSDECAY

is

interfaced

with

NMSSMTools,

available

on

the

web

page

Running

time:

On

an

Intel

Core

with

GHZ:

about

seconds

per

point

in

parameter

space,

if

all

flags

flagqcd,

flagmulti

and

flagloop

are

switched

on.

References:

M.

Muhlleitner,

A.

Djouadi,

Y.

Mambrini,

Comput.

Phys.

Commun.

(C)

Elsevier

B.V.

All

rights

reserved.

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

next-to-minimal supersymmetric standard model


Communication and team situation awareness in the OR: Implications for augmentative information display Team Situation Awareness (TSA) is one of the critical factors in effective Operating Room (OR) teamwork and can impact patient safety and quality of care. While previous research showed a relationship between situation awareness, as measured by communication events, and team performance, the implications for developing technology to augment and facilitate TSA were not examined. This research aims to further study situation-related communications in the cardiac OR in order to uncover potential degradation in TSA which may lead to adverse events. The communication loop constructthe full cycle of information flow between the participants in the sequencewas used to assess susceptibility to breakdown. Previous research and the findings here suggest that communication loops that are open, non-directed, or with delayed closure, can be susceptible to information loss. These were quantitatively related to communication indicators of TSA such as questions, replies, and announcements. Taken together, both qualitative and quantitative analyses suggest that a high proportion of TSA-related communication (63%) can be characterized as susceptible to information loss. The findings were then used to derive requirements and design a TSA augmentative display. The design principles and potential benefits of such a display are outlined and discussed.

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


Reliable communication for highly mobile agents The provision of a reliable communication infrastructure for mobile agents is still an open research issue. The challenge to reliability we address in this work does not come from the possibility of faults, but rather from the mere presence of mobility, which complicates the problem of ensuring the delivery of information even in a fault-free network. For instance, the asynchronous nature of message passing and agent migration may cause situations where messages forever chase a mobile agent that moves frequently from one host to another. Current solutions rely on conventional technologies that either do not provide a solution for the aforementioned problem, because they were not designed with mobility in mind, or enforce continuous connectivity with the message source, which in many cases defeats the very purpose of using mobile agents. In this paper, we propose an algorithm that guarantees delivery to highly mobile agents using a technique similar to a distributed snapshot. A number of enhancements to this basic idea are discussed, which limit the scope of message delivery by allowing dynamic creation of the connectivity graph. Notably, the very structure of our algorithm makes it amenable not only to guarantee message delivery to a specific mobile agent, but also to provide multicast communication to a group of agents, which constitutes another open problem in research on mobile agents. After presenting our algorithm and its properties, we discuss its implementability by analyzing the requirements on the underlying mobile agent platform, and argue about its applicability.

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


Simultaneous authentication and secrecy in identity-based data upload to cloud Most existing works to secure cloud devote to remote integrity check, search and computing on encrypted data. In this paper, we deal with simultaneous authentication and secrecy when data are uploaded to cloud. Observing that cloud is most interesting to companies in which multiple authorized employees are allowed to upload data, we propose a general framework for secure data upload in an identity-based setting. We present and employ identity-based signcryption (IBSC) to meet this goal. As it is shown that it is challenging to construct IBSC scheme in the standard model and most IBSC schemes are realized in the random oracle model which is regarded weak to capture the realistic adversaries, we propose a new IBSC scheme simultaneously performing encryption and signature with cost less than the signature-then-encryption approach. The identity based feature eliminates the complicated certificates management in signcryption schemes in the traditional public-key infrastructure (PKI) setting. Our IBSC scheme exploits Boneh et al.s strongly unforgeable signature and Paterson et al.s identity-based signature. The scheme is shown to satisfy semantic security and strong unforgeability. The security relies on the well-defined bilinear decision Diffie-Hellman (BDDH) assumption and the proof is given in the standard model. With our IBSC proposal, a secure data upload scheme is instantiated with simultaneous authentication and secrecy in a multi-user setting.

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


UFO - The Universal FEYNRULES Output We present a new model format for automatized matrix-element generators, the so-called Universal FEYNRULES Output (UFO). The format is universal in the sense that it features compatibility with more than one single generator and is designed to be flexible, modular and agnostic of any assumption such as the number of particles or the color and Lorentz structures appearing in the interaction vertices. Unlike other model formats where text files need to be parsed, the information on the model is encoded into a PYTHON module that can easily be linked to other computer codes. We then describe an interface for the MATHEMATICA package FEYNRULES that allows for an automatic output of models in the UFO format. (C) 2012 Elsevier B.V. All rights reserved.

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

model building
model implementation
feynman rules
feynman diagram calculators
monte carlo programs


Improvements of some Ostrowski type inequalities A connection between generalized Montgomery identity, Bernoulli polynomials and Euler identity is established. Using this connection, certain strict improvements of some Ostrowski type inequalities are obtained.

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

montgomery identity
bernoulli polynomials


Data approximation using biarcs An algorithm for data approximation with biarcs is presented. The method uses a specific formulation of biarcs appropriate for parametric curves in Bezier or NURBS,formulation. A base curve is applied to obtain tangents and anchor points for the individual arcs joining in G(1) continuity. Data sampled from circular arcs or straight line segments is represented precisely by one biarc. The method is most useful in numerical control to drive the cutter along straight line or circular paths.

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


Modelling and updating of large surface-to-surface joints in the AWE-MACE structure Model updating of joints in the AWE-MACE system is carried out using a sensitivity method. The joints are characterised by large surface-to-surface contact regions and are excited in vibration tests within the linear range. The joints are modelled using a layer of special interface elements having material properties that may be adjusted to improve the prediction of the complete model. A series of three updating exercises are described and it is shown that by using only six parameters based upon the circumferential-wave and bending modes that the prediction of the axial and torsional modes is improved sufficiently to be of practical usefulness for many applications. Fewer numbers of updating parameters are found to be sufficient to correct different subsets of vibration modes. Linear equivalent models identified by this approach are found to be valid within the usual range of vibration tests.

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

finite element model updating
validation


an arm wrestling robot system for human upper extremity wear In this study, we develop a prototype of arm wrestling robot system called AssistRobot for human upper extremity wear. Further, we introduce a force display response model based on the impact absorption of human hand, proposed earlier by the authors, into the system. The effectiveness of the system for arm wrestling is demonstrated by sensory evaluation from viewpoints of operability and enjoyment.

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


"How much cybernetics can you handle?" Humanity is innately a composition of primitive cybernetic translations/transmissions to begin with, from atoms through organizations of civilization. The last 75 years has seen us recognize and then extend those relations into sentience and sociological practicalities. It is the author's intention with this paper to shed some new light and introduce new concepts into the field and understandings.

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