An integrated solution for lane level irregular driving detection on highways An integrated solution is designed for lane level positioning. A fuzzy inference system is designed for driving pattern classification. Particle Filter model performs better than Extended Kalman Filter model. Correct detection rate increases with output rate decreases.

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

irregular driving
fuzzy inference system


A method for identifying journals in a discipline: An application to information systems It is a perennial interest of the information systems community to identify a set of information systems journals. The primary approaches to achieving this identification are surveys of academics, article-level citation, and senior scholar consensus. An example of the last approach is the basket of eight journals identified by senior scholars of the Association for Information Systems (AIS). A different and efficient approach is afforded by the publication of data from Journal Citation Reports (JCR). This provides aggregate citation data across individual journals. While the findings provide general empirical support for the choice of the AIS basket of eight journals, they also indicate that five additional journals qualify as core information systems journals. Each of these journals has numerous citations of journals within this set and low citations of individual journals outside this set. Furthermore, a network centrality analysis of this set of journals reveals a high correlation between in-degree centrality and the perceived importance of journals. Overall, the study demonstrates the suitability of this method for identifying core journals in a discipline.

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


Development predictive QSAR models for artemisinin analogues by various feature selection methods: A comparative study Quantitative structure-activity relationship (QSAR) models were derived for 179 analogues of artemisinin, a potent antimalarial agent. The activities of these compounds were investigated by means of multiple linear regression (MLR). To select relevant descriptors, several methods including stepwise selection, successive projection algorithm and an ant colony optimization algorithm (called memorized_ACS) were employed. A wide variety of molecular descriptors belonging to various structural properties were calculated for each molecule. Two matrixes (D1 and D2) of molecular properties were built. The D1 matrix included the calculated descriptors and the D2 matrix contained the first to third orders of the calculated descriptors and the logarithm of absolute values of the calculated descriptors. For both data matrixes, significant QSAR models were obtained by the memorized_ACS algorithm. The reactive and PEOE (partial equalization of orbital electronegativity) descriptors represented the highest impact on the antimalarial activity. The PEOE descriptors belong to partial charge descriptors and the reactive descriptor is an indicator of the presence of the reactive groups in the molecule. The best MLR model has a training error of 0.71 logRA units (r(2) = 0.81) and a prediction error of 0.48 logRA units (r(2) = 0.88).

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

successive projection algorithm
ant colony optimization
artemisinin


object-based tag propagation for semi-automatic annotation of images Over the last few years, social network systems have greatly increased users' involvement in online content creation and annotation. Since such systems usually need to deal with a large amount of multimedia data, it becomes desirable to realize an interactive service that minimizes tedious and time-consuming manual annotation. In this paper, we propose an interactive online platform that is capable of performing semi-automatic image annotation and tag recommendation for an extensive online database. First, when the user marks a specific object in an image, the system performs an object duplicate detection and returns the search results with images containing similar objects. Then, the annotation of the object can be performed in two ways: (1) In the tag recommendation process, the system recommends tags associated with the object in images of the search results, among which, the user can accept some tags for the object in the given image. (2) In the tag propagation process, when the user enters his/her tag for the object, it is propagated to images in the search results. Different techniques to speed-up the process of indexing and retrieval are presented in this paper and their effectiveness demonstrated through a set of experiments considering various classes of objects.

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

object duplicate detection
tag recommendation
image annotation
tag propagation


A general (k, n) scalable secret image sharing scheme with the smooth scalability A novel (k, n) scalable secret image sharing (SSIS) scheme was proposed to encrypt a secret image into n shadow images. One can gradually reconstruct a secret image by stacking k or more shadows, but he/she cannot conjecture any information from fewer than k shadows. The advantage of a (k, n)-SSIS scheme is that it provides the threshold property (i.e., k is a threshold value necessary to start in to reveal the secret) as well as the scalability (i.e., the information amount of a reconstructed secret is proportional to the number of shadows used in decryption). All previous (k, n)-SSIS schemes did not have the smooth scalability so that the information amount can be smoothly proportional to the number of shadows. In this paper, we consider the smooth scalability in (k, n)-SSIS scheme.

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

secret sharing
lagrange interpolation
shadow image


Random-order bin packing The average-case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [C. Kenyon, Best-fit bin-packing with random order, in: Proc. of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1996, pp. 359364] Kenyon introduced the random-order ratio, a new average-case performance metric for bin packing heuristics, and gave upper and lower bounds for it for the Best Fit heuristics. We introduce an alternative definition of the random-order ratio and show that the two definitions give the same result for Next Fit. We also show that the random-order ratio of Next Fit equals to its asymptotic worst-case, i.e.,it is 2.

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


Fragments based tracking with adaptive cue integration ? In this paper, we address the issue of part-based tracking by proposing a new fragments-based tracker. The proposed tracker enhances the recently suggested FragTrack algorithm to employ an adaptive cue integration scheme. This is done by embedding the original tracker into a particle filter framework, associating a reliability value to each fragment that describes a different part of the target object and dynamically adjusting these reliabilities at each frame with respect to the current context. Particularly, the vote of each fragment contributes to the joint tracking result according to its reliability, and this allows us to achieve a better accuracy in handling partial occlusions and pose changes while preserving and even improving the efficiency of the original tracker. In order to demonstrate the performance and the effectiveness of the proposed algorithm we present qualitative and quantitative results on a number of challenging video sequences.

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

video sequences
particle filter
adaptive cue integration


Scheduling incompatible tasks on two machines The paper studies the problem of scheduling tasks on two machines to minimize the makespan. The tasks are assigned to the machine in advance. An incompatibility relation is defined over the tasks which forbids any two incompatible tasks to be processed at the same time. The problem can serve as a mathematical model for some batching problems in which the jobs are grouped in pairs on two machines. A linear-time algorithm is presented.

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

two machine scheduling
incompatibility graph
max-batch
polynomial algorithm


Quality of Data Delivery in Peer-to-Peer Video Streaming QoS in a P2P video streaming system is evaluated in three stages: content generation, data delivery and video playback. We use jitter-free probability as the main performance metric to study Quality of Data delivery (QoD). A new model that incorporates both bandwidth and data availability of P2P network is proposed. Our model relies on a sharing factor that models data availability among all peers. We simulate on a minimalistic network to demonstrate how to apply the analytical model to design a P2P video streaming system with a very low jitter rate. Our simulation experimental results reveal that the lower bound on jitter-free probability is indeed effective to reflect the QoD of the entire system. Our model captures the impact of many design choices, including upload bandwidth limit, peer selection strategies, and video stream chunking schemes.

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

theory
peer-to-peer
quality of service
queuing model


Splitting and updating hybrid knowledge bases Over the years, nonmonotonic rules have proven to be a very expressive and useful knowledge representation paradigm. They have recently been used to complement the expressive power of Description Logics (DLs), leading to the study of integrative formal frameworks, generally referred to as hybrid knowledge bases, where both DL axioms and rules can be used to represent knowledge. The need to use these hybrid knowledge bases in dynamic domains has called for the development of update operators, which, given the substantially different way DLs and rules are usually updated, has turned out to be an extremely difficult task. In Slota and Leite (2010b Towards Closed World Reasoning in Dynamic Open Worlds. Theory and Practice of Logic Programming, 26th Int'l. Conference on Logic Programming (ICLP'10) Special Issue 10(4-6) (July), 547-564.), a first step towards addressing this problem was taken, and an update operator for hybrid knowledge bases was proposed. Despite its significance-not only for being the first update operator for hybrid knowledge bases in the literature, but also because it has some applications-this operator was defined for a restricted class of problems where only the ABox was allowed to change, which considerably diminished its applicability. Many applications that use hybrid knowledge bases in dynamic scenarios require both DL axioms and rules to be updated. In this paper, motivated by real world applications, we introduce an update operator for a large class of hybrid knowledge bases where both the DL component as well as the rule component are allowed to dynamically change. We introduce splitting sequences and splitting theorem for hybrid knowledge bases, use them to define a modular update semantics, investigate its basic properties, and illustrate its use on a realistic example about cargo imports.

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

hybrid knowledge base
ontology
logic program


Application of an SVM-based regression model to the air quality study at local scale in the Aviles urban area (Spain) The objective of this study is to build a regression model of air quality by using the support vector machine (SVM) technique in the Aviles urban area (Spain) at local scale. Hazardous air pollutants or toxic air contaminants refer to any substance that may cause or contribute to an increase in mortality or serious illness, or that may pose a present or potential hazard to human health. To accomplish the objective of this study, the experimental data of nitrogen oxides (NOx), carbon monoxide (CO), sulphur dioxide (SO2), ozone (O-3) and dust (PM10) for the years 2006-2008 are used to create a highly nonlinear model of the air quality in the Aviles urban nucleus (Spain) based on SVM techniques. One aim of this model is to obtain a preliminary estimate of the dependence between primary and secondary pollutants in the Aviles urban area at local scale. A second aim is to determine the factors with the greatest bearing on air quality with a view to proposing health and lifestyle improvements. The United States National Ambient Air Quality Standards (NAAQS) establishes the limit values of the main pollutants in the atmosphere in order to ensure the health of healthy people. They are known as criteria pollutants. This support vector regression model captures the main insight of statistical learning theory in order to obtain a good prediction of the dependence among the main pollutants in the Aviles urban area. Finally, on the basis of these numerical calculations, using the support vector regression (SVR) technique, conclusions of this work are drawn. (C) 2011 Elsevier Ltd. All rights reserved.

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


A vector reconstruction based clustering algorithm particularly for large-scale text collection A vector reconstruction based clustering algorithm particularly for large-scale text collection. It contains two iterative sub-processes, namely, partial tuning sub-process and overall tuning sub-process. In the former one, iterative tuning process is utilized to adjust neuron vector. In the latter one, two measures are devised to select features to reconstruct cluster vector.

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

large-scale text clustering
partial tuning sub-process
overall tuning sub-process


Probe minimization by schedule optimization: Supporting top-k queries with expensive predicates This paper addresses the problem of evaluating ranked top-k queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries, we believe such support for ranked queries will be even more important: First, ranked queries often need to model user-specific concepts of preference, relevance, or similarity, which call for dynamic user-defined functions. Second, middleware systems must incorporate external predicates for integrating autonomous sources typically accessible only by per-object queries. Third, ranked queries often accompany Boolean ranking conditions, which may turn predicates into expensive ones, as the index structure on the predicate built on the base table may be no longer effective in retrieving the filtered objects in order. Fourth, fuzzy joins are inherently expensive, as they are essentially user-defined operations that dynamically associate multiple relations. These predicates, being dynamically defined or externally accessed, cannot rely on index mechanisms to provide zero-time sorted output, and must instead require per-object probe to evaluate. To enable probe minimization, we develop the problem as cost-based optimization of searching over potential probe schedules. In particular, we decouple probe scheduling into object and predicate scheduling problems and develop an analytical object scheduling optimization and a dynamic predicate scheduling optimization, which combined together form a cost-effective probe schedule.

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

database query processing
distributed information systems
database systems


managing graph(ical) complexity with raisin and its category explorer Graphs offer a powerful way to view the relationships between objects. Yet, as useful as small graphs are for seeing relationships, large graphs are frustrating because their complexity overwhelms our ability to trace through patterns of relationships. The Raisin system helps manage this complexity by giving the means to layout a graph well; index a graph using categories based on structure and other criteria; highlight and abstract via selection, hiding, and aggregation; and create new categories that distill the user's conclusions for analysis and presentation.

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

directed acyclic graph
categorization
focus+context
graph visualization
simplification
tree control


Stability analysis of linear multistep and Runge-Kutta methods for neutral multidelay-differential-algebraic systems This paper is concerned with the stability analysis of linear multistep and Runge-Kutta methods for neutral multidelay-differential-algebraic systems. We focus on the system with no restrictive assumption on the structure of the coefficient matrices. It is shown that under some conditions, A-stable linear multistep methods and A-stable Runge-Kutta methods can preserve the delay-independent stability of the underlying linear systems. Numerical experiments further confirm the theoretical results. (C) 2011 Elsevier Ltd. All rights reserved.

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


geotemporal querying of multilingual documents This demonstration utilizes a geographic information system interface to display multilingual news documents in time and space by extracting place names from text and matching them to a multilingual multi-script gazetteer which identifies the latitude and longitude of the location.

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

cross language information retrieval
geographic information retrieval
gazetteers


Optimal covering designs: complexity results and new bounds ? In this paper we investigate the problem of computing optimal lottery schemes. From a computational complexity point of view, we prove that the variation of this problem in which the sets to be covered are specified in the input is -approximable (where denotes the collection of sets to be covered) and it cannot be approximated within a factor smaller than , unless . From a combinatorial point of view, we propose new constructions based on the combination of the partitioning technique and of known results regarding the construction of sets of coverings. By means of this combination we will be able to improve several upper bounds on the cardinality of optimal lottery schemes.

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

approximation algorithm
combinatorial design
covering design


A compound OpenMP/MPI program development toolkit for hybrid CPU/GPU clusters In this paper, we propose a program development toolkit called OMPICUDA for hybrid CPU/GPU clusters. With the support of this toolkit, users can make use of a familiar programming model, i.e., compound OpenMP and MPI instead of mixed CUDA and MPI or SDSM to develop their applications on a hybrid CPU/GPU cluster. In addition, they can adapt the types of resources used for executing different parallel regions in the same program by means of an extended device directive according to the property of each parallel region. On the other hand, this programming toolkit supports a set of data-partition interfaces for users to achieve load balance at the application level no matter what type of resources are used for the execution of their programs.

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

hybrid cpu/gpu clusters
compound openmp/mpi


A note on many-to-many matchings and stable allocations In this short note the many-to-many stable matching and stable allocation problems are revisited. A confusion concerning preferences, efficiency, monotonicity and strategy-proofness is clarified without rewriting new proofs.

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


Fraud Detection for Information Reliability from the Internet in Forensic Accounting Internet is a main factor in a flood of information. There is great concerning about reliability of information from the Internet. Financial statements are opened annually and anybody can obtain them from the Internet. A company manipulates its accounting data in order to look like financially stable. An institutional or individual investor considers the company has a good state in finance part or in business activity from its financial reports. That makes investors failed due to faulty information. Therefore, personal, companies or even countries can become a very dangerous state by usage of incorrect information. To modify accounting data as false is an antisocial action. In forensic accounting, an investigation is conducted to find evidence relevant to accounting scandals that involve making money for use in secret, embezzling company funds, or evading taxes on purpose [1]. But most existing techniques are used for evidence discovery rather than fraud prevention Fraud prevention in accounting part means to pre-detect frauds by analyzing financial statements. It helps information reliability from the Internet In this paper, an algorithm is suggested for the detection of financial fraud via financial statements analysis and the test results using this algorithm will be presented.

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


Neville elimination on multi- and many-core systems: OpenMP, MPI and CUDA This paper describes several parallel algorithmic variations of the Neville elimination. This elimination solves a system of linear equations making zeros in a matrix column by adding to each row an adequate multiple of the preceding one. The parallel algorithms are run and compared on different multi- and many-core platforms using parallel programming techniques as MPI, OpenMP and CUDA.

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


Efficient computation for the Poisson binomial distribution Direct construction of the probability distribution function for a Poisson binomial random variable, where success probabilities may vary from trial to trial, requires on the order of \(2^{n}\) calculations, and is computationally infeasible for all but modest sized problems. An approach offered by Thomas and Taub (J Stat Comput Simul 14:125131 1982) reduces this effort to approximately \(n^{2}\), which, while certainly an improvement, can still be significant for large values of \(n\). We offer modifications to the method of Thomas and Taub that greatly reduce the computations while still delivering highly accurate results.

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

bernoulli trials
recursive methods
m out of n


High Efficiency 3D Video Coding Using New Tools Based on View Synthesis We propose a new coding technology for 3D video represented by multiple views and the respective depth maps. The proposed technology is demonstrated as an extension of the recently developed high efficiency video coding (HEVC). One base views are compressed into a standard bitstream (like in HEVC). The remaining views and the depth maps are compressed using new coding tools that mostly rely on view synthesis. In the decoder, those views and the depth maps are derived via synthesis in the 3D space from the decoded baseview and from data corresponding to small disoccluded regions. The shapes and locations of those disoccluded regions can be derived by the decoder without any side information transmitted. To achieve high compression efficiency, we propose several new tools such as depth-based motion prediction, joint high frequency layer coding, consistent depth representation, and nonlinear depth representation. The experiments show high compression efficiency of the proposed technology. The bitrate needed for transmission of two side views with depth maps is mostly less than 50% than that of the bitrate for a single-view video.

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

3d video
coding
compression
hevc
depth maps


Experimental and numerical comparison between the output voltages of two novel switched reluctance generators Purpose - The purpose of this paper is to propose a combination of two novel switched reluctance generators (SRG) as a suitable prototype to produce electrical energy using natural, renewable and variable speed energy resource. The paper focuses on the voltage generation analysis of two special SRGs. Design/methodology/approach - To evaluate the proposed configurations, their structures are introduced firstly, and the output voltages of both two generators are analyzed numerically via three dimensional finite element method. After that the obtained results are validated on laboratory set up. Moreover, the main parameters of each one causing the output voltages are studied. The proposed generators have been manufactured within a common physical framework. This framework consists of two magnetically independent stator and rotor sets (layers), where each stator set includes four salient poles, while the rotor comprises of two salient poles with almost equal arc lengths and no windings. The first generator called Field assisted SRG which has a stationary reel, and so the field coil wrapped around it, and it is placed between the two-stator sets, whereas in the second type named Self excited SRG, there is no field coil. Findings - Via experimental and numerical analysis, it is substantiated that this interesting combination can help users to produce electrical energy from low speeds to high speeds of performance through employing each of these generators in special case of study and application separately. Originality/value - This beneficial characteristic of two proposed SRGs can be noticed as a suitable trait in different industries such as aerospace, automobile and production of electrical energy via windmills.

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

three dimensional finite element method
voltage

field assisted switched reluctance generator

self excited switched reluctance generator


Application of backend database contents and structure to the design of spoken dialog services Current development platforms for designing spoken dialog services feature different kinds of strategies to help designers build, test, and deploy their applications. In general, these platforms are made up of several assistants that handle the different design stages (e.g. definition of the dialog flow, prompt and grammar definition, database connection, or to debug and test the running of the application). In spite of all the advances in this area, in general the process of designing spoken-based dialog services is a time consuming task that needs to be accelerated. In this paper we describe a complete development platform that reduces the design time by using different types of acceleration strategies based on using information from the data model structure and database contents, as well as cumulative information obtained throughout the successive steps in the design. Thanks to these accelerations, the interaction with the platform is simplified and the design is reduced, in most cases, to simple confirmations to the "proposals" that the platform automatically provides at each stage. Different kinds of proposals are available to complete the application flow such as the possibility of selecting which information slots should be requested to the user together, predefined templates for common dialogs, the most probable actions that make up each state defined in the flow, different solutions to solve specific speech-modality problems such as the presentation of the lists of retrieved results after querying the backend database. The platform also includes accelerations for creating speech grammars and prompts, and the SQL queries for accessing the database at runtime. Finally, we will describe the setup and results obtained in a simultaneous summative, subjective and objective evaluations with different designers used to test the usability of the proposed accelerations as well as their contribution to reducing the design time and interaction. (C) 2011 Elsevier Ltd. All rights reserved.

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

development tools
automatic design of dialog systems
data mining
voicexml


Uncertain equilibrium analysis on profits distribution between partner firms in competitive strategic alliances There exist many uncertain factors in profits distribution between partner firms in competitive strategic alliances. On the basis of Rubinstein theorem, a method of Choquet integral is used to analyze the uncertain equilibrium of profits distribution between partner firms in competitive strategic alliances with the introduction of Choquet Expected Utility theory in uncertain analysis. It is found that the result of this method is much closer to reality. The conclusion also shows that partner firms will have weaker bargaining power if they have higher dependence to alliances. And, "first-mover advantage" in Rubinstein theorem does not always exist.

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

competitive strategic alliances
profits distribution
choquet integral


A method for exploring similarities and visual references to brand in the appearance of mature mass-market products Product appearance and in particular its association with branding has been shown to play an increasingly important role in the commercial success of mature mass-market products. This paper presents a novel approach to analyse product appearance and explore similarities between products. The approach is applied to two contemporary industrial examples, smartphones and vehicles, and the outcome used to explore the strategic use of visual references to brand in product appearance. Results from the methods application validate the method in providing insights in terms of specific similarities in appearance. Further interpretation is then used to recommend possible design strategies with respect to the use of visual references to brand.

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

aesthetics
design tools
evaluation
product design
styling


A traffic cellular automata model based on road network grids and its spatial and temporal resolutions influences on simulation Microscopic Traffic Simulation Model based on Cellular Automata (CA) has become more and more popular since it was firstly introduced by Creamer and Ludwig in 1986. Cellular automata are simpler to implement on computers, provide a simple physical picture of the system and can be easily modified to deal with different aspects of traffic. However, in a traditional traffic CA model, the spatial resolution of CA and temporal resolution of simulation are low. Take TRANSIMS for example. The size of cellular automata is 7.5m and the time step equals 1s. In such a case, if a vehicle drives at a speed of 4 cells pers, the speed difference between 95km/h (3.5?7.5m/s) and 121km/h (4.4999?7.5m/s) will not be distinguished by simulation models. And the temporal resolution of 1s makes the system hard to model different drivers reaction time, which plays a very important role in vehicular movement models. In this paper, a microscopic traffic cellular automata model based on road network grids is proposed to overcome the low spatial and temporal resolutions of traditional traffic CA models. In our model, spatial resolution can be changed by setting different grid size for lanes and intersections before or during simulation and temporal resolution can be defined according to simulation needs to model different drivers reaction time, whereas the vehicular movement models are still traditional CA models. By doing so, the low spatial and temporal resolution of CA model can be overcome and the advantages of using CA to simulate traffic are preserved. The paper also presents analyses of the influences on simulation of different 1D lane grid size, 2D intersection grid size and different combinations of temporal resolution and mean drivers reaction time. The analysis results prove the existence of spatial and temporal resolution thresholds in traffic CA models. They also reveal that the size of grids, the combinations of different temporal resolutions and mean drivers reaction time do pose influences on the speed of vehicles and lane/intersection occupancy, but do not affect the volume of traffic greatly.

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

microscopic traffic simulation
cellular automata
road network grids
spatial resolution
temporal resolution
influences on simulation


META-TACS: A TRUST MODEL DEMONSTRATION OF ROBUSTNESS THROUGH A GENETIC ALGORITHM Ensuring trust and confidence in virtual communities' transactions is a critical issue nowadays. But even more important can become the use of robust and accurate trust models allowing an entity to decide which other entity to interact with. This paper aims to study the robustness of TACS (Trust Ant Colony System), a previously proposed bio-inspired P2P trust model, when applying a genetic algorithm in order to find the range of values of its working parameters that provides the best TACS performance. The optimization of those parameters has been carried out using the CHC genetic algorithm. Experiments seems to demonstrate that TACS can achieve high performance ratios due to the enhancement provided by META-TACS, and to achieve them for a wide range of working parameters, hence showing a remarkable robustness.

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

chc genetic algorithm
tacs
trust ant colony system

robust trust model
trust management
p2p networks
meta-heuristics


A unified probabilistic framework for web page scoring systems The definition of efficient page ranking algorithms is becoming an important issue in the design of the query interface of Web search engines. Information flooding is a common experience especially when broad topic queries are issued. Queries containing only one or two keywords usually match a huge number of documents, while users can only afford to visit the first positions of the returned list, which do not necessarily refer to the most appropriate answers. Some successful approaches to page ranking in a hyperlinked environment, like the Web, are based on link analysis. In this paper, we propose a general probabilistic framework for Web Page Scoring Systems (WPSS), which incorporates and extends many of the relevant models proposed in the literature. In particular, we introduce scoring systems for both generic (horizontal) and focused (vertical) search engines. Whereas horizontal scoring algorithms are only based on the topology of the Web graph, vertical ranking also takes the page contents into account and are the base for focused and user adapted search interfaces. Experimental results are reported to show the properties of some of the proposed scoring systems with special emphasis on vertical search.

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

random walks
hits
pagerank
focused pagerank


The ALICE DAQ: current status and future challenges The ALICE data acquisition system has been designed to support an aggregate event-building bandwidth of up to 2.5 GByte/s and a storage capability of up to 1.25 GByte/s to mass storage. A general framework called the ALICE Data Acquisition Test Environment (DATE) system has been developed as a basis for prototyping the components of the DAQ. DATE supports a wide spectrum of configurations from simple systems to more complex systems with multiple detectors and multiple event builders. Prototypes of several key components of the ALICE DAQ have been developed and integrated with the DATE system such as the ALICE Detector Data Link, the online data monitoring from ROOT and the interface to the mass storage systems. Combined tests of several of these components are being pursued during the ALICE Data Challenges. The architecture of the A-LICE DAQ system will be presented together with the current status of the different prototypes. The recent addition of a Transition Radiation Detector (TRD) to ALICE has required a revision of the requirements and the architecture of the DAQ This will allow for a higher level of data selection. These new opportunities and implementation challenges will also be presented. (C) 2001 Elsevier Science B.V. All rights reserved.

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

optical links
event building
filtering
data storage
triggering


Affective Level Video Segmentation by Utilizing the Pleasure-Arousal-Dominance Information In this paper, we offer an entirely new view to the problem of high level video parsing. We developed a novel computation method for affective level video segmentation. Its function was to extract emotional segments from videos. Its design was based on the pleasure-arousal-dominance (P-A-D) model of affect representation [1], which in principle can represent a large number of emotions. Our method had two stages. The first P-A-D estimation stage was defined within framework of the dynamic bayesian networks (DBNs). A spectral clustering algorithm was applied in the final stage to determine the emotional segments of the video. The performance of our method was compared with the time adaptive clustering (TAC) algorithm and an accelerated version of it which we had developed. According to Vendrig et al. [2], the TAC algorithm was the best segmentation method. Experiment results will show the feasibility of our method.

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

affective video content analysis
emotion recognition


Multisoliton complexes in fiber lasers We investigate stationary and nonstationary pulse groups formation in the mode-locked fiber laser. The bound pulse states formation is determined by pulse interactions through the joint dispersive waves field. We propose an expand model describing pulses propagation and interaction in fiber laser. We investigate the stability of bound states in fiber laser.

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

mode-locked fiber laser
temporal solitons
soliton dynamics
nonlinear optics
bound soliton pair


Proxy re-encryption with keyword search We introduce a new cryptographic primitive, called proxy re-encryption with keyword search, which is motivated by the following scenario in email systems: Charlie sends an encrypted email, which contains some keywords, such as urgent, to Alice under Alices public key, and Alice delegates her decryption rights to Bob via her mail server. The desired situations are: (1) Bob can decrypt mails delegated from Alice by using only his private key, (2) Bobs mail gateway, with a trapdoor from Bob, can test whether the email delegated from Alice contains some keywords, such as urgent, (3) Alice and Bob do not wish to give the mail server or mail gateway the access to the content of emails. The function of proxy re-encryption with keyword search (PRES) is the combination of proxy re-encryption (PRE) and public key encryption with keyword search (PEKS). However, a PRES scheme cannot be obtained by directly combining those two schemes, since the resulting scheme is no longer proven secure in our security model. In this paper, a concrete construction is proposed, which is proven secure in the random oracle model, based on the modified Decisional Bilinear DiffieHellman assumption.

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

proxy re-encryption with keyword search
proxy re-encryption
mdbdh


Small area estimation of poverty proportions under area-level time models The unit-level small area estimation approach has no standard procedure and each case needs separate modeling when the domain parameters are not linear or the target variable is not normally distributed. Area-level linear mixed models can be generally applied to produce EBLUP estimates of linear and non linear parameters because direct estimates are weighted sums, so that the assumption of normality may be acceptable. The problem of estimating small area non linear parameters is treated, with special emphasis on the estimation of poverty proportions. Borrowing strength from time by using area-level linear time models is proposed. Four time-dependent area-level models are considered and the behavior of the two basic ones is empirically investigated. The developed model-based methodology for estimating poverty proportions is applied in the Spanish Living Conditions Survey.

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

linear mixed models
small area estimation
poverty proportions


semantics and evaluation techniques for window aggregates in data streams A windowed query operator breaks a data stream into possibly overlapping subsets of data and computes a result over each. Many stream systems can evaluate window aggregate queries. However, current stream systems suffer from a lack of an explicit definition of window semantics. As a result, their implementations unnecessarily confuse window definition with physical stream properties. This confusion complicates the stream system, and even worse, can hurt performance both in terms of memory usage and execution time. To address this problem, we propose a framework for defining window semantics, which can be used to express almost all types of windows of which we are aware, and which is easily extensible to other types of windows that may occur in the future. Based on this definition, we explore a one-pass query evaluation strategy, the Window-ID (WID) approach, for various types of window aggregate queries. WID significantly reduces both required memory space and execution time for a large class of window definitions. In addition, WID can leverage punctuations to gracefully handle disorder. Our experimental study shows that WID has better execution-time performance than existing window aggregate query evaluation options that retain and reprocess tuples, and has better latency-accuracy tradeoffs for disordered input streams compared to using a fixed delay for handling disorder.

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

framework streams input definition performance delay evaluation systems space aggregate types data queries physical windows future class query

data streaming
addressing
extensibility
timing
exploration
strategies
accuracy
latency
experimentation
semantic
implementation
operability
memorialized
query evaluation


Approximate Gauss-Newton methods for optimal state estimation using reduced-order models The Gauss-Newton (GN) method is a well-known iterative technique for solving nonlinear least-squares problems subject to dynamical system constraints. Such problems arise commonly in optimal state estimation where the systems may be stochastic. Variational data assimilation techniques for state estimation in weather, ocean and climate systems currently use approximate GN methods. The GN method solves a sequence of linear least-squares problems subject to linearized system constraints. For very large systems, low-resolution linear approximations to the model dynamics are used to improve the efficiency of the algorithm. We propose a new method for deriving low-order system approximations based on model reduction techniques from control theory. We show how this technique can be combined with the GN method to retain the response of the dynamical system more accurately and improve the performance of the approximate GN method. Copyright (C) 2007 John Wiley & Sons, Ltd.

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

large-scale nonlinear least-squares problems subject to dynamical system constraints


Vector transfer by self-tested self-synchronization for parallel systems Communications between processing elements (PEs) in very large scale parallel systems become more challenging as the function and speed of the PEs improve continuously. Clocked I/O ports may malfunction if data read failure occurs due to clock skew. There are many drawbacks in global clock distribution utilized to reduce the clock skew. This paper addresses a self-tested self-synchronization (STSS) method for vector transfer between PEs. A test signal is added to remove the data read failure. The advantages of this method are: very high data throughout, less power consumption in clock distribution, no constraints on clock skew and system scale, easy in design, less latency. A failure zone concept is used to characterize the behavior of storage elements. By using a jitter injected test signal, a robust vector transfer between PEs with arbitrary clock phases is achieved and the headache problem of the global synchronization is avoided.

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

vlsi
high speed interconnect
retiming
metastability


Cross domain recommendation based on multi-type media fusion Due to the scarcity of user interest information in the target domain, recommender systems generally suffer from the sparsity problem. To alleviate this limitation, one natural way is to transfer user interests in other domains to the target domain. However, objects in different domains may be in different media types, which make it very difficult to find the correlations between them. In this paper, we propose a Bayesian hierarchical approach based on Latent Dirichlet Allocation (LDA) to transfer user interests cross domains or media. We model documents (corresponding to media objects) from different domains and user interests in a common topic space, and learn topic distributions for documents and user interests together. Specifically, to learn the model, we combine multi-type media information: media descriptions, user-generated text data and ratings. With this model, recommendation can be done in multiple ways, via predicting ratings, comparing topic distributions of documents and user interests directly and so on. Experiments on two real world datasets demonstrate that our proposed method is effective in addressing the sparsity problem by transferring user interests cross domains.

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

recommender systems
cross domain
latent dirichlet allocation


on business activity modeling using grammars Web based applications offer a mainstream channel for businesses to manage their activities. We model such business activity in a grammar-based framework. The Backus Naur form notation is used to represent the syntax of a regular grammar corresponding to Web log patterns of interest. Then, a deterministic finite state machine is used to parse Web logs against the grammar. Detected tasks are associated with metadata such as time taken to perform the activity, and aggregated along relevant corporate dimensions.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 the firing pattern of bullfrog vestibular neurons responding to naturalistic stimuli We have developed a neural system identification method for fitting models to stimulusresponse data, where the response is a spike train. The method involves using a general nonlinear optimisation procedure to fit models in the time domain. We have applied the method to model bullfrog semicircular canal afferent neuron responses during naturalistic, broad-band head rotations. These neurons respond in diverse ways, but a simple four parameter class of models elegantly accounts for the various types of responses observed.

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

vestibular
spike train
system identification


On Gnutella topology dynamics by studying leaf and ultra connection jointly in phase space In this paper, the topology dynamics of Gnutella are studied in phase space. The dynamic progress of peer degree is studied as a time series in two dimensional phase space, which is consisted of numbers of connected leaves and ultras. The reported degrees concentrate on three special software related regions which we name as ultra stable region, leaf stable region and transition belt. A method is proposed on how to classify degree traces in phase space into different categories. Then the connection churn and the degree churn are studied. It shows that the topological structure of Gnutella is more stable in its connection degree than in the topology itself. The connection drop rate is estimated and the lifetime of connections is deduced afterwards. M/M/m/m loss queue system is introduced to model the degree keeping process in Gnutella. This model reveals that the degree stability is ensured by mass new connection efforts. In other words, the stability in topological structure of Gnutella is the results of many essential unstable factors in its topology. We think it raises a challenge to the basic design philosophy for such networks. (c) 2007 Elsevier B.V. All rights reserved.

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


The evaluation and design methodology for real time systems Petri net variants are widely used as a real time systems modeling technique. Recently, UML activity diagrams have been used for the same purpose, even though the syntax and semantics of activity diagrams has not been yet fully worked out. Nevertheless, activity diagrams seem very similar to Petri net semantics. UML, being the industry standard as a common object oriented modeling language needs a well-defined semantic base for its notation. Formalization of the graphical notation enables automated processing and analysis tasks. Petri nets can provide a formal semantic framework for the UML notations plus the behavioral modeling/analysis strength needed to system designers. This paper describes the methodology for creating the model of the RT application that would allow testing the correctness of the algorithm and the fulfillment of the time constraints at the design stage using UML and Petri Nets.

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

real time system
unified modelling language
petri net behaviour
verification


Does offline political segregation affect the filter bubble? An empirical analysis of information diversity for Dutch and Turkish Twitter users We show different dimensions of the value information diversity. We present old and new metrics to operationalize this value for different dimensions. We show that information bubbles can be observed depending on the used metric. The political culture can determine the occurrence of bubbles.

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

polarization politics turkey netherlands


3D reconstruction of cultural heritages: Challenges and advances on precise mesh integration ? Several methods perform the integration of multiple range scans of an object aiming the generation of a reconstructed triangle mesh; however, achieving high fidelity digital reconstructions is still a challenge. That is mostly due to the existence of outliers in the acquired range data, and their harmful effects on the integration algorithms. In this work, we first discuss artifacts usually found on real range data captured with 3D scanners based on laser triangulation. Following that there is the assessment of two widely used volumetric integration techniques (VRIP and Consensus Surface) and our suggested improvements. We also present a novel, hybrid approach that combines strengths from both VRIP and Consensus Surface, named IMAGO Volumetric Integration Algorithm (IVIA). Our novel algorithm adds new ideas while improving the detection and elimination of artifacts. Further, IVIA works in close cooperation with the subsequent hole filling process, which greatly improves the overall quality of the generated 3D models. Our technique leads to better results when assessed in different situations, when compared to VRIP, Consensus Surface, and also to a well known state-of-the-art surface-based method, Poisson Surface Reconstruction.

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


Network Connectivity with a Family of Group Mobility Models We investigate the communication range of the nodes necessary for network connectivity, which we call bidirectional connectivity, in a simple setting. Unlike in most of existing studies, however, the locations or mobilities of the nodes may be correlated through group mobility: nodes are broken into groups, with each group comprising the same number of nodes, and lie on a unit circle. The locations of the nodes in the same group are not mutually independent, but are instead conditionally independent given the location of the group. We examine the distribution of the smallest communication range needed for bidirectional connectivity, called the critical transmission range (CTR), when both the number of groups and the number of nodes in a group are large. We first demonstrate that the CTR exhibits a parametric sensitivity with respect to the space each group occupies on the unit circle. Then, we offer an explanation for the observed sensitivity by identifying what is known as a very strong threshold and asymptotic bounds for CTR.

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

mobile communication systems
wireless communication networks


Vertical drain consolidation analysis in one, two and three dimensions A new method, the ? or eta method, for modeling consolidation by vertical and horizontal drains is presented. The approach is applicable in one, two and three dimensional as well as axisymmetric cases. Material and geometry properties are familiar from unit cell vertical drain analysis and are consistent across dimensions. An uncoupled finite element method (FEM) program is used to test the efficacy of the new approach. Because drains are not explicitly modeled in the finite element mesh, mesh complexity and computational time are greatly reduced. Unlike existing plane strain matching methods there is no special transformation of permeability or drain properties. The analyses conducted indicate that the ? method provides an efficient and consistent means of modeling drains in any dimension.

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


Understanding the retrieval effectiveness of collaborative tags and author keywords in different retrieval environments: An experimental study on medical collections This study investigates the retrieval effectiveness of collaborative tags and author keywords in different environments through controlled experiments. Three test collections were built. The first collection tests the impact of tags on retrieval performance when only the title and abstract are available (the abstract environment). The second tests the impact of tags when the full text is available (the full-text environment). The third compares the retrieval effectiveness of tags and author keywords in the abstract environment. In addition, both single-word queries and phrase queries are tested to understand the impact of different query types. Our findings suggest that including tags and author keywords in indexes can enhance recall but may improve or worsen average precision depending on retrieval environments and query types. Indexing tags and author keywords for searching using phrase queries in the abstract environment showed improved average precision, whereas indexing tags for searching using single-word queries in the full-text environment led to a significant drop in average precision. The comparison between tags and author keywords in the abstract environment indicates that they have comparable impact on average precision, but author keywords are more advantageous in enhancing recall. The findings from this study provide useful implications for designing retrieval systems that incorporate tags and author keywords.

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


Interpreting maps of science using citation context sentiments: a preliminary investigation It is proposed that citation contexts, the text surrounding references in scientific papers, be analyzed in terms of an expanded notion of sentiment, defined to include attitudes and dispositions toward the cited work. Maps of science at both the specialty and global levels are used as the basis of this analysis. Citation context samples are taken at these levels and contrasted for the appearance of cue word sets, analyzed with the aid of methods from corpus linguistics. Sentiments are shown to vary within a specialty and can be understood in terms of cognitive and social factors. Within-specialty and between-specialty co-citations are contrasted and in some cases suggest a correlation of sentiment with structural location. For example, the sentiment of uncertainty is important in interdisciplinary co-citation links, while utility is more prevalent within the specialty. Suggestions are made for linking sentiments to technical terms, and for developing sentiment baselines for all of science.

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

citation contexts
maps of science
corpus linguistics


Detection and concealment of transmission errors in MPEG-4 images For entropy-coded MPEG-4 images, a transmission error in a codeword may cause the underlying codeword and its subsequent codewords within a video packet to be misinterpreted, resulting in great degradation of the received MPEG-4 images. Here a transmission error may be a single-bit error or a burst error. In this study, a postprocessing approach to detection and concealment of transmission errors in MPEG-4 images is proposed. In this study, transmission errors within a video packet of an MPEG-4 image bitstream are detected by means of two successive procedures: (1) whether the video packet is corrupted or not is determined by checking a set of error-checking conditions, and then (2) the precise location (block-based) of the first transmission error (the first corrupted block) within the corrupted video packet is verified by using a backtracking procedure. To recover the corrupted shape data, the error concealment approach to the shape data of intra-coded IVOPs proposed in [4] is adopted, and an error concealment approach to the shape data of inter-coded P- and BVOPs is proposed in this study. To recover the corrupted texture data, several existing and proposed concealment techniques are employed together to generate a set of possible concealment candidates for a corrupted texture block. Then, an objective cost function is proposed here to determine the "best" texture error concealment candidate among the set of generated candidates as the concealed texture block for the corrupted texture block. Based on the simulation results obtained in this study, the proposed approach can recover high-quality MPEG-4 images from the corresponding corrupted MPEG-4 images. This shows the feasibility of the proposed approach.

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

transmission error
error concealment
shape data
texture data


Study of differences in the VEGFR2 inhibitory activities between semaxanib and SU5205 using 3D-QSAR, docking, and molecular dynamics simulations Semaxanib (SU5416) and 3-[4?-fluorobenzylidene]indolin-2-one (SU5205) are structurally similar drugs that are able to inhibit vascular endothelial growth factor receptor-2 (VEGFR2), but the former is 87 times more effective than the latter. Previously, SU5205 was used as a radiolabelled inhibitor (as surrogate for SU5416) and a radiotracer for positron emission tomography (PET) imaging, but the compound exhibited poor stability and only a moderate IC50 toward VEGFR2. In the current work, the relationship between the structure and activity of these drugs as VEGFR2 inhibitors was studied using 3D-QSAR, docking and molecular dynamics (MD) simulations. First, comparative molecular field analysis (CoMFA) was performed using 48 2-indolinone derivatives and their VEGFR2 inhibitory activities. The best CoMFA model was carried out over a training set including 40 compounds, and it included steric and electrostatic fields. In addition, this model gave satisfactory cross-validation results and adequately predicted 8 compounds contained in the test set. The plots of the CoMFA fields could explain the structural differences between semaxanib and SU5205. Docking and molecular dynamics simulations showed that both molecules have the same orientation and dynamics inside the VEGFR2 active site. However, the hydrophobic pocket of VEGFR2 was more exposed to the solvent media when it was complexed with SU5205. An energetic analysis, including Embrace and MM-GBSA calculations, revealed that the potency of ligand binding is governed by van der Waals contacts.

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

vegfr2
semaxanib
comfa
docking
molecular dynamics


Preserving global features of fluid animation from a single image using video examples We synthesize animations from a single image by transferring fluid motion of a video example globally. Given a target image of a fluid scene, an alpha matte is required to extract the fluid region. Our method needs to adjust a user-specified video example for producing the fluid motion suitable for the extracted fluid region. Employing the fluid video database, the flow field of the target image is obtained by warping the optical flow of a video frame that has a visually similar scene to the target image according to their scene correspondences, which assigns fluid orientation and speed automatically. Results show that our method is successful in preserving large fluid features in the synthesized animations. In comparison to existing approaches, it is both possible and useful to utilize our method to create flow animations with higher quality.

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


Biomechanical implications of excessive endograft protrusion into the aortic arch after thoracic endovascular repair Endografts placed in the aorta for thoracic endovascular aortic repair (TEVAR) may determine malappositioning to the lesser curvature of the aortic wall, thus resulting in a devastating complication known as endograft collapse. This premature device failure commonly occurs in young individuals after TEVAR for traumatic aortic injuries as a result of applications outside the physical conditions for which the endograft was designed. In this study, an experimentally-calibrated fluidstructure interaction (FSI) model was developed to assess the hemodynamic and stress/strain distributions acting on the excessive protrusion extension (PE) of endografts deployed in four young patients underwent TEVAR. Endograft infolding was experimentally measured for different hemodynamic scenarios by perfusion testing and then used to numerically calibrate the mechanical behavior of endograft PE. Results evinced that the extent of endograft can severely alter the hemodynamic and structural loads exerted on the endograft PE. Specifically, PE determined a physiological aortic coarctation into the aortic arch characterized by a helical flow in the distal descending aorta. High device displacement and transmural pressure across the stent-graft wall were found for a PE longer than 21mm. Finally, marked intramural stress and principal strain distributions on the protruded segment of the endograft wall may suggest failure due to material fatigue. These critical parameters may contribute to the endograft collapse observed clinically and can be used to design new devices more suitable for young individuals to be treated with an endoprosthesis for TEVAR of blunt traumatic aortic injuries.

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

thoracic endovascular aortic repair (tevar)


Detecting the most unusual part of two- and three-dimensional digital images The purpose of this paper is to introduce an algorithm that can detect the most unusual part of a digital image in probabilistic setting. The most unusual part of a given shape is defined as a part of the image that has the maximal distance to all non-intersecting shapes with the same form. The method is tested on two- and three-dimensional images and has shown very good results without any predefined model. A version of the method independent of the contrast of the image is considered and is found to be useful for finding the most unusual part (and the most similar part) of the image conditioned on given image. The results can be used to scan large image databases, as for example medical databases.

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

image processing
image statistics
image recognition


Automated tagging of environmental data using a novel SKOS formatted environmental thesaurus There is increasing need to use the widest range of data to address issues of environmental management and change, which is reflected in increasing emphasis from government funding agencies for better management and access to environmental data. Bringing together different environmental datasets to confidently enable integrated analysis requires reference to common standards and definitions, which are frequently lacking in environmental data, due to the broad subject area and lack of metadata. Automatic inclusion within datasets of controlled vocabulary concepts from publicly available standard vocabularies facilitates accurate annotation and promotes efficiency of metadata creation. To this end, we have developed a thesaurus capable of describing environmental chemistry datasets. We demonstrate a novel method for tagging datasets, via insertion of this thesaurus into a Laboratory Information Management System, enabling automated tagging of data, thus promoting semantic interoperability between tagged data resources. Being web available, and formatted using the Simple Knowledge Organisation System (SKOS) semantic standard, this thesaurus is capable of providing links both to and from other relevant thesauri, thus facilitating a linked data approach. Future developments will see extension of the thesaurus by the user community, in terms of both concepts included and links to externally hosted vocabularies. By employing a Linked Open Data approach, we anticipate that Web-based tools will be able to use concepts from the thesaurus to discover and link data to other information sources, including use in national assessment of the extent and condition of environmental resources.

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

thesaurus
vocabularies
metadata
annotation
standards
skos
environmental chemistry


Conservation and uniform normalization in lambda calculi with erasing reductions For a notion of reduction in a lambda-calculus one can ask whether a term satisfies conservation and uniform normalization. Conservation means that single-step reductions of the term preserve infinite reduction paths from the term. Uniform normalization means that either the term will have no reduction paths leading to a normal form or all reduction paths will lead to a normal form. In the classical conservation theorem for Lambda(I) the distinction between the two notions is not clear: uniform normalization implies conservation, and conservation also implies uniform normalization. The reason for this is that Lambda(I) is closed under reduction, due to the fact that reductions never erase terms in Lambda(I). More generally for nonerasing reductions, the two notions are equivalent on a set closed under reduction. However, when turning to erasing reductions the distinction becomes important as conservation no longer implies uniform normalization. This paper presents a new technique for finding uniformly normalizing subsets of a lambda-calculus. This is done by combining a syntactic and a semantic criterion. The technique is demonstrated by several applications. The technique is used to present a new uniformly normalizing subset of the pure lambda-calculus; this subset is a superset of Lambda(I) and thus contains erasing K-redexes. The technique is also used to prove strong normalization from weak normalization of the simply typed lambda-calculus extended with pairs; this is an extension of techniques developed recently by Sorensen and Xi. Before presenting the technique the paper presents a simple proof of a slightly weaker form of the characterization of perpetual redexes by Bergstra and Klop; this is a step for the later applications of the technique. (C) 2002 Elsevier Science (USA).

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

inferring strong normalization from weak


AMOLED pixel driver circuits based on poly-Si TFTs: A comparison In this paper, four different driver circuits for an active matrix organic light-emitting diode (AMOLED) pixel based on thin film transistor (TFT) technology are analyzed and compared. In particular, the comparison analyzed accuracy, driving speed, power consumption and area occupied. Moreover, in order to allow array simulations, the RC equivalent models of the pixel were also derived. The results were achieved considering a QVGA display (320240), a line frequency of 60Hz, and were verified by simulations with AIM-SPICE.

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


A phenomenon like stochastic resonance in the process of spike-timing dependent synaptic plasticity Recent physiological studies on synaptic plasticity have shown that synaptic weights change depending on fine timing of presynaptic and postsynaptic spikes. Here, we show that a phenomenon similar to stochastic resonance with respect to background noise is observed on spike-timing dependent synaptic plasticity (STDP) that can contribute to stable propagation of precisely timed spikes in a multi-layered feed-forward neural network.

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


integrating user preferences with particle swarms for multi-objective optimization This paper proposes a method to use reference points as preferences to guide a particle swarm algorithm to search towards preferred regions of the Pareto front. A decision maker can provide several reference points, specify the extent of the spread of solutions on the Pareto front as desired, or include any bias between the objectives as preferences within a single execution. We incorporate the reference point method into two multi-objective particle swarm algorithms, the non-dominated sorting PSO, and the maximinPSO. This paper first demonstrates the usefulness of the proposed reference point based particle swarm algorithms, then compare the two algorithms using a hyper-volume metric. Both particle swarm algorithms are able to converge to the preferred regions of the Pareto front using several feasible or infeasible reference points.

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

non-dominated sorting
particle swarm optimization
user-preference methods
maximin strategy
multi-objective problems


Code-based cryptography on reconfigurable hardware: tweaking Niederreiter encryption for performance Todays public-key schemes that are either based on the factorization or the discrete logarithm problem. Since both problems are closely related, a major breakthrough in cryptanalysis (e.g., with the advent of quantum computing will render nearly all currently employed security system useless. Code-based public-key schemes rely on the alternative security assumption that decoding generic linear binary codes is NP-complete. Two code-based schemes for public-key encryption are available due to McEliece and Niederreiter. Although most researchers analyzed and implemented McElieces cryptosystem, we show in this work that the scheme by Niederreiter has some important advantages, such as smaller keys, more practical plain and ciphertext sizes and less computation complexity. In particular, we propose an efficient FPGA implementation of Niederreiters scheme that can encrypt more than 1.5 million plaintexts per seconds on a Xilinx Virtex-6 FPGAoutperforming all known implementations of other popular public-key cryptosystems so far.

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


Multiproperty-Preserving Domain Extension Using Polynomial-Based Modes of Operation In this paper, we propose a new double-piped mode of operation for multiproperty-preserving domain extension of message authentication codes (MACs), pseudorandom functions (PRFs), and pseudorandom oracles (PROs). Our mode of operation performs twice as fast as the original double-piped mode of operation of Lucks while providing comparable security. Our construction, which uses a class of polynomial-based compression functions proposed by Stam, makes a single call to a 3n-bit to n-bit primitive f(1) at each iteration and uses a finalization function f(2) at the last iteration, producing an n-bit hash function H [f(1), f(2)] satisfying the following properties. 1) H [f(1), f(2)] is unforgeable up to O(2(n)/n) query complexity as long as f(1) and f(2) are unforgeable. 2) H [f(1), f(2)] is pseudorandom up to O(2(n)/n) query complexity as long as f(1) is unforgeable and f(2) is pseudorandom. 3) H [f(1), f(2)] is indifferentiable from a random oracle up to O(2(n)/3) query complexity as long as and f(1) are f(2) public random functions. To our knowledge, our result constitutes the first time O(2(n)/n) unforgeability that has been achieved using only an unforgeable primitive of n-bit output length. (Yasuda showed unforgeability of O(2(5n)/(6)) for Lucks' construction assuming an unforgeable primitive, but the analysis is suboptimal, as noticed by us and others; in this paper, we also show how Yasuda's bound can be improved to O(2(n)).) In related work, we strengthen Stam's collision resistance analysis of polynomial-based compression functions (showing unforgeability of the primitive suffices) and discuss how to implement our mode by replacing f(1) with a 2n-bit key blockcipher in Davies-Meyer mode or by replacing f(1) with the cascade of two 2n-bit to n-bit compression functions.

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

adaptive preimage resistance
double-piped mode of operation
indifferentiability
message authentication code (mac)


Using Raman-lidar-based regularized microphysical retrievals and Aerosol Mass Spectrometer measurements for the characterization of biomass burning aerosols In this work we extract the microphysical properties of aerosols for a collection of measurement cases with low volume depolarization ratio originating from fire sources captured by the Raman lidar located at the National Institute of Optoelectronics (INOE) in Bucharest. Our algorithm was tested not only for pure smoke but also for mixed smoke and urban aerosols of variable age and growth. Applying a sensitivity analysis on initial parameter settings of our retrieval code was proved vital for producing semi-automatized retrievals with a hybrid regularization method developed at the Institute of Mathematics of Potsdam University. A direct quantitative comparison of the retrieved microphysical properties with measurements from a Compact Time of Flight Aerosol Mass Spectrometer (CToF-AMS) is used to validate our algorithm. Microphysical retrievals performed with sun photometer data are also used to explore our results. Focusing on the fine mode we observed remarkable similarities between the retrieved size distribution and the one measured by the AMS. More complicated atmospheric structures and the factor of absorption appear to depend more on particle radius being subject to variation. A good correlation was found between the aerosol effective radius and particle age, using the ratio of lidar ratios (LR: aerosol extinction to backscatter ratios) as an indicator for the latter. Finally, the dependence on relative humidity of aerosol effective radii measured on the ground and within the layers aloft show similar patterns.

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

aerosols
microphysical properties
lidar
ams


Numerical simulation of two-dimensional sine-Gordon solitons by differential quadrature method During the past few decades, the idea of using differential quadrature methods for numerical solutions of partial differential equations (PDEs) has received much attention throughout the scientific community. In this article, we proposed a numerical technique based on polynomial differential quadrature method (PDQM) to find the numerical solutions of two-dimensional sine-Gordon equation with Neumann boundary conditions. The PDQM reduced the problem into a system of second-order linear differential equations. Then, the obtained system is changed into a system of ordinary differential equations and lastly, RK4 method is used to solve the obtained system. Numerical results are obtained for various cases involving line and ring solitons. The numerical results are found to be in good agreement with the exact solutions and the numerical solutions that exist in literature. It is shown that the technique is easy to apply for multidimensional problems.

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

two-dimensional sine-gordon equation
gausslobattochebyshev grid points
rungekutta method


Jug measuring: Algorithms and complexity We study the hardness of the optimal jug measuring problem. By proving tight lower and upper bounds on the minimum number of measuring steps required, we reduce an inapproximable NP-hard problem (i.e., the shortest GCD multiplier problem [G. Havas, J.-P. Seifert, The Complexity of the Extended GCD Problem, in: LNCS, vol. 1672, Springer, 1999]) to it. It follows that the optimal jug measuring problem is NP-hard and so is the problem of approximating the minimum number of measuring steps within a constant factor. Along the way, we give a polynomial-time approximation algorithm with an exponential error based on the well-known LLL basis reduction algorithm. (C) 2008 Elsevier B.V. All rights reserved.

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

inapproximability
lll algorithm
lattice problem


Star Place: A new analytic method for FPGA placement To date, the best algorithms for performing placement on Field-Programmable Gate Arrays (FPGAs) are based on Simulated Annealing (SA). Unfortunately, these algorithms are not scalable due to the long convergence time of the latter. With an aim towards developing a scalable FPGA placer we present an analytic placement method based on a near-linear net model, called star+. The star+ model is a variant of the well-known star model and is continuously differentiable - a requirement of analytic methods that rely on the existence of first- and second-order derivatives. Most importantly, with the star+ model incremental changes in cost resulting from block movement can be computed in O(1) time, regardless of the size of the net. This makes it possible to construct time-efficient solution methods based on conjugate gradient and successive over-relaxation for solving the resulting non-linear equation system. When compared to VPR, the current state-of-the-art placer based on SA, our analytic method is able to obtain an 8-9% reduction in critical-path delay while achieving a speedup of nearly 5x when VPR is run in its fast mode. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 layout
electronic design automation


A parametric study of wall deflections in deep excavations with the installation of cross walls Several case studies have revealed that the installation of cross walls in excavations can effectively reduce the amount of wall deflection and ground settlement. However, the behaviour of the diaphragm wall due to the installation of the cross walls is still unclear. This study performed a series of 3D numerical studies of wall deflections for deep excavations with cross walls and studied the effects on the wall deflection of several parameters, including the number of cross walls, the distance to the cross wall, the cross wall interval, the cross wall height and the cross wall embedment. The results presented in this study can be used as a first approximation for cases in which cross walls are designed to reduce the wall deflection induced by deep excavation.

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

parametric studies
lateral wall deflection


Zwitterion L-cysteine adsorbed on the Au-20 cluster: enhancement of infrared active normal modes The study reported herein addressed the structure, adsorption energy and normal modes of zwitterion l-cysteine (Z-cys) adsorbed on the Au-20 cluster by using density functional theory (DFT). It was found that four Z-cys are bound to the Au-20 apexes preferentially through S atoms. Regarding normal modes, after adsorption of four Z-cys molecules, a more intense infrared (IR) peak is maintained around 1,631.4 cm(-1) corresponding with a C=O stretching mode, but its intensity is enhanced approximately six times. The enhancement in the intensity of modes between 0 to 300 cm(-1) is around 4.5 to 5.0 times for normal modes that involve O-C=O and C-S bending modes. Other two normal modes in the range from 300 to 3,500 cm(-1) show enhancements of 6.0 and 7.4 times. In general, four peaks show major intensities and they are related with normal modes of carboxyl and NH3 groups of Z-cys.

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

gold 20
normal mode
amino acid
zwitterion l-cysteine