SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy SATCHMORE was introduced as a mechanism to integrate relevancy testing with the model-generation theorem prover SATCHMO. This made it possible to avoid invoking some clauses that appear in no refutation, which was a major drawback of the SATCHMO approach. SATCHMORE relevancy, however, is driven by the entire set of negative clauses and no distinction is accorded to the query negation. Under unfavorable circumstances, such as in the presence of large amounts of negative data, this can reduce the efficiency of SATCHMORE. In this paper we introduce a further refinement of SATCHMO called SATCHMOREBID: SATCHMORE with BIDirectional relevancy. SATCHMOREBID uses only the negation of the query for relevancy determination at the start. Other negative clauses are introduced on demand and only if a refutation is not possible using the current set of negative clauses. The search for the relevant negative clauses is performed in a forward chaining mode as opposed to relevancy propagation in SATCHMORE which is based on backward chaining. SATCHMOREBID is shown to be refutationally sound and complete. Experiments on a prototype SATCHMOREBID implementation point to its potential to enhance the efficiency of the query answering process in disjunctive databases.

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

disjunctive deductive databases
bidirectional search
model generation theorem proving


An Optimizing Compiler for Parallel Chemistry Simulations Well designed domain specific languages have three important benefits: (1) the easy expression of problems, (2) the application of domain specific optimizations (including parallelization), and (3) dramatic improvements in productivity for their users. In this paper we describe a compiler and parallel runtime system for modeling the complex kinetics of rubber vulcanization and olefin polymerization that achieves all of these goals. The compiler allows the development of a system of ordinary differential equations describing a complex vulcanization reaction or single-site olefin polymerization reaction-a task that used to require months-to be done in hours. A specialized common sub-expression elimination and other algebraic optimizations sufficiently simplify the complex machine generated code to allow it to be compiled-eliminating all but 8.0% of the operations in our largest program and enabling over 60 times faster execution on our largest benchmark codes. The parallel runtime and dynamic load balancing scheme enables fast simulations of the model.

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

domain specific languages
domain specific optimizations

compilers
parallelism
common elimination subexpression
chemistry modeling


A new three-level tree data structure for representing TSP tours in the Lin-Kernighan heuristic Lin-Kernighan (LK) is the most powerful local search for the Traveling Salesman Problem (TSP). The choice of data structure for tour representation plays a vital role in LK's performance. Binary trees are asymptotically the best tour representation but they perform empirically best only for TSPs with one million or more cities due to a large overhead. Arrays and two-level trees are used for smaller TSPs. This paper proposes a new three-level tree data structure for tour representation. Although this structure is asymptotically not better than the binary tree structure, it performs empirically better than the conventional structures for TSPs having from a thousand to three million cities.

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

traveling salesman problem
data structure

lin-kernighan heuristic
three-level trees


An adaptive mixed formulation for 3D magnetostatics An enhanced version gi a mixed field-based formulation for magnetostatics previously developed by the authors is presented and its features are discussed. The formulation minimises the residual of the constitutive equation, an exactly imposes Maxwell's equations with Lagrange multipliers. Finite elements satisfying the physical continuity properties for both the magnetic and the magnetic induction fields are used in the numerical approximations. The possibility of decoupling the formulation in two separate sets of equations is discussed. A preconditioned iterative method to solve the final algebraic linear system is presented. Finally, a very natural refinement indicator is defined to guide nn adaptive mesh refinement procedure.

O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 decomposition based algorithm for maximal contractions This paper proposes a decomposition based algorithm for revision problems in classical propositional logic. A set of decomposing rules are presented to analyze the satisfiability of formulas. The satisfiability of a formula is equivalent to the satisfiability of a set of literal sets. A decomposing function is constructed to calculate all satisfiable literal sets of a given formula. When expressing the satisfiability of a formula, these literal sets are equivalent to all satisfied models of such formula. A revision algorithm based on this decomposing function is proposed, which can calculate maximal contractions of a given problem. In order to reduce the memory requirement, a filter function is introduced. The improved algorithm has a good performance in both time and space perspectives.

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


Evolutionary design of Sugeno-type fuzzy systems for modelling humanoid robots An evolutionary design of Sugeno-type fuzzy systems for modelling humanoid robots is presented in this article, and issues related to the determination of the antecedent and consequent structures of the fuzzy model are addressed. In the design of the fuzzy model, determination of the type, the number of membership functions assigned to the input variables, the types of consequent equations for the fuzzy rules, the optimal number of input variables, and the dominant input variables among the input candidates are carried out using evolutionary algorithms. Using these algorithms, proper structures are evolved for the antecedent and the consequent of the Sugeno-type fuzzy model. Simulations are performed to show the effectiveness of the developed method when applied to a humanoid robot system with strong nonlinearities that have 10 input candidates.

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


Simulation of intermediation using rich cognitive agents In trading networks many elements determine the success of the network. They can be economic, social, personal, structural, environmental, etc. In many simulation frameworks only one of these elements is considered. However we argue that it is exactly the interaction between the different types of elements that is interesting when considering the mediation of business processes. Whether a mediator has a right of existence does not just depend on the quality of his service, but also on the social structure between suppliers and users, the communication infrastructure, etc. In this paper we propose an agent-based simulation framework in which this type of situations can be studied and we show an example of its use in a simulation of the house market.

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


Engaging with scholarly digital libraries (publisher platforms): The extent to which 'added-value' functions are used The third paper to emanate from Ciber's Virtual Scholar research programme, which looks at the information seeking behaviour of academics and researchers in regard to digital journal libraries (publisher platforms). This paper concentrates on the users and usage of Blackwell Synergy's 'added-value' functionality. Nearly a million users, making 10 million item requests were investigated employing deep log methods, developed by the authors to provide robust and big picture analyses of digital information consumers and their behaviour. Through such methods usage data has been embellished with user data (for 500,000 people), so enabling comparisons to be made between the information seeking behaviour, for instance, of students and staff, academics and practitioners. We believe this is the first time this type of analysis has been attempted with logs. In this paper we concentrate on those things that users do in a digital library that goes beyond simple use and browsing (constructing interest profiles, employing pop-ups, requesting articles by email and using the search engine). This tells us something about how strongly the users engage or interact with the digital library by benefiting from or exploiting all its functions and whether it is cost effective for publishers to provide, what appears to be a never-ending number of facilities. (c) 2005 Published by Elsevier Ltd.

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


Political Expression and Action on Social Media: Exploring the Relationship Between Lower- and Higher-Threshold Political Activities Among Twitter Users in Italy Scholars and commentators have debated whether lower-threshold forms of political engagement on social media should be treated as being conducive to higher-threshold modes of political participation or a diversion from them. Drawing on an original survey of a representative sample of Italians who discussed the 2013 election on Twitter, we demonstrate that the more respondents acquire political information via social media and express themselves politically on these platforms, the more they are likely to contact politicians via e-mail, campaign for parties and candidates using social media, and attend offline events to which they were invited online. These results suggest that lower-threshold forms of political engagement on social media do not distract from higher-threshold activities, but are strongly associated with them.

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

political expression
political participation
social media
twitter
italy


Connection provisioning with guaranteed recovery time in survivable WDM optical networks Optical networks employing wavelength- division multiplexing (WDM) are prone to failures. In case of a failure, the time to recovery is an important metric, since the amount of lost information and the performance of carried application strongly depends on the time of service interruption. Moreover, as the current trend in network development is moving toward a unified solution providing support for voice, data and various multimedia services, different application and users may tolerate different time of service interruption. Therefore, it is imperative to provide recovery-time guaranteed connections in WDM optical networks. In this paper, we propose a new shared-segment protection algorithm, called AGBSP-QoP, to provision connection requests according to their differentiated recovery-time requirements. Given a working path, AGBSP-QoP first computes all possible recovery-time guaranteed working-backup segment pairs, and then dynamically selects a least-cost eligible subset based on a dexterously constructed auxiliary graph. We conduct simulations under single class of service and multiple classes of service, and compare AGBSP-QoP with other protection algorithms. The results show that AGBSP-QoP yields the best performance and can properly provision connection requests according to their differentiated recovery-time requirements.

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


the lightspeed automatic interactive lighting preview system We present an automated approach for high-quality preview of feature-film rendering during lighting design. Similar to previous work, we use a deep-framebuffer shaded on the GPU to achieve interactive performance. Our first contribution is to generate the deep-framebuffer and corresponding shaders automatically through data-flow analysis and compilation of the original scene. Cache compression reduces automatically-generated deep-framebuffers to reasonable size for complex production scenes and shaders. We also propose a new structure, the indirect framebuffer , that decouples shading samples from final pixels and allows a deep-framebuffer to handle antialiasing, motion blur and transparency efficiently. Progressive refinement enables fast feedback at coarser resolution. We demonstrate our approach in real-world production.

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

data-flow analysis
renderman
programmable shading
interactive rendering
gpus


User-level satisfaction aware end-to-end rate control in communication networks ? In this paper, we study an end-to-end rate control problem in communication networks with the network utility maximization (NUM) framework. In many cases, a communication of a user consists of two sessions: transmitting and receiving sessions, and its overall satisfaction to the communication service depends on the satisfaction to both sessions. However, in most previous approaches with the NUM framework, the utility function of a user, which represents its satisfaction to the service, is modeled considering only the satisfaction to its transmitting session through its transmitting rate. The receiving session of a user is treated independently and indirectly through the utility function of its correspondent. Hence, it is not possible to jointly consider the satisfaction of transmitting and receiving sessions of one user. To resolve this issue, in this paper, we first propose a new concept of the utility function, which is called a user-level utility function. The user-level utility function is modeled considering both transmitting and receiving sessions of a user. We then formulate an optimization problem for end-to-end rate control with user-level utility functions. Even though two users in a communication are coupled with each other through their utility functions, we developed a distributed algorithm with appropriate message exchanges. The numerical results show that our user-level utility function and algorithm can control the transmitting rate of each user more appropriately according to the type of its communication service.

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

utility function
network utility maximization

end-to-end rate control
user-level satisfaction


The influence of parameters and structure of PI-type fuzzy-logic controller on DC drive system dynamics The paper presents an analysis of the dynamical properties of the DC drive system with a fuzzy-logic speed controller in the presence of a wide-range changes of the drive system inertia. The influence of PI-type fuzzy controller parameters (scaling factors) and structure (membership functions location and shape) on the dynamics of speed control loop was tested in the presence of disturbances caused by the inertia load torque changes. The possibilities of this disturbance compensation using the on-line tuning of a chosen controller scaling factor or the modification of its membership function's shape were analysed. Drive system responses for both proposed strategies were illustrated by simulation results. These approaches have ensured the desired dynamics of the drive system operation for the wide range of disturbances caused by the drive system inertia changes. (C) 2002 Elsevier Science B.V. All rights reserved.

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

dc drive system
speed controller
scaling factor
membership functions


Solving the 3D MHD equilibrium equations in toroidal geometry by Newton's method We describe a novel form of Newton's method for computing 3D MHD equilibria. The method has been implemented as an extension to the hybrid spectral/finite-difference Princeton Iterative Equilibrium Solver (PIES) which normally uses Picard iteration on the full nonlinear MHD equilibrium equations. Computing the Newton functional derivative numerically is not feasible in a code of this type but we are able to do the calculation analytically in magnetic coordinates by considering the response of the plasma's Pfirsch-Schluter currents to small changes in the magnetic field. Results demonstrate a significant advantage over Picard iteration in many cases, including simple finite-beta stellarator equilibria. The method shows promise in cases that are difficult for Picard iteration, although it is sensitive to resolution and imperfections in the magnetic coordinates, and further work is required to adapt it to the presence of magnetic islands and stochastic regions. (c) 2005 Elsevier Inc. All rights reserved.

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

mhd equilibrium
princeton iterative equilibrium solver
pies


horizontal fragmentation as a technique to improve the performance of drill-down and roll-up queries In this paper, we focus on the horizontal fragmentation of data warehouses. Our main contribution is the proposal of the MHF-DHA algorithm, which is aimed at improving the performance of drill-down and roll-up queries by horizontally fragmenting data warehouses organized in different levels of aggregation. Besides allowing that multiple dimensions be used as a basis for the fragmentation, the algorithm also explores the hierarchical structure of these dimensions. The performance tests carried out using the TPC-H benchmark showed that the proposed fragmentation provides a huge improvement on the query performance, with a reduction in elapsed time and disk accesses between 71\% and 99\%.

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


Sense of virtual reality: Effectiveness of replacing 3D imagery with 2D/3D hybrid imagery This paper proposed the advantages of using a 2D/3D hybrid imagery system over the use of 3D by itself. A hybrid imagery system was created by projecting a 3D (stereo) image in between and overlapping onto two adjacent 2D images. The negative effect where 2D and 3D images overlap was studied and resolved. Then sensations subject experienced from the visual cues under the different conditions were attained. Participant's sensations while looking at the different forms of imagery on both a flat screen and a flat/inclined screen combination were then attained. The data for the 2D/3D hybrid system were compared with that attained for a 3D image system on its own (without 2D images). Results indicate that there are benefits to using a 2D/3D hybrid system over 3D by itself.

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

2d/3d hybrid imagery system
vr sensations
3 screen systems


Wireless local loop radio systems Wireless local loop radio is expected to become a widely accepted technology for rapid access to network infrastructure by remote locations. Characteristics of a wireless local loop system are partially different from those in the mobile cellular system and therefore their design and planning require different considerations. This paper provides first an overview of the wireless local loop systems and then discusses the important design aspects such as the necessary fade margin to achieve a given availability, level crossing rate and average fade duration.

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

broadband
internet access
pcs
pcn
pwt
dect
pacs
fading
high-tier mobility
low-tier mobility
wll


On the design and implementation of an effective prefetch strategy for DSM systems Distributed Shared Memory systems provide the abstraction of a shared address space among computing hosts interconnected via a private network, in a convenient and easy way to achieve high performance. However, there are several drawbacks to these systems, such as communication overhead, network latency, false sharing, coherence and page faults. By prefetching, one can overlap communication and computation though the Accumulated Waiting Phenomenon and the Waiting Synchronization Phenomenon affect overall performance. In this paper, an Effective Prefetch Strategy (EPS) is proposed, to improve the shortcomings of previous prefetching approaches and increases the prefetch page hit rate. In addition, our EPS strategy reduces the waiting time for each computing host upon barrier synchronizations and misprefetches. Experimental comparisons show that our proposed EPS strategy offers the best performance among existinrefetching strategies.

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

dsm systems
shared address space
page hit


Precise null-pointer analysis In Java, C or C++, attempts to dereference the null value result in an exception or a segmentation fault. Hence, it is important to identify those program points where this undesired behaviour might occur or prove the other program points (and possibly the entire program) safe. To that purpose, null-pointer analysis of computer programs checks or infers non-null annotations for variables and object fields. With few notable exceptions, null-pointer analyses currently use run-time checks or are incorrect or only verify manually provided annotations. In this paper, we use abstract interpretation to build and prove correct a first, flow and context-sensitive static null-pointer analysis for Java bytecode (and hence Java) which infers non-null annotations. It is based on Boolean formulas, implemented with binary decision diagrams. For better precision, it identifies instance or static fields that remain always non-null after being initialised. Our experiments show this analysis faster and more precise than the correct null-pointer analysis by Hubert, Jensen and Pichardie. Moreover, our analysis deals with exceptions, which is not the case of most others; its formulation is theoretically clean and its implementation strong and scalable. We subsequently improve that analysis by using local reasoning about fields that are not always non-null, but happen to hold a non-null value when they are accessed. This is a frequent situation, since programmers typically check a field for non-nullness before its access. We conclude with an example of use of our analyses to infer null-pointer annotations which are more precise than those that other inference tools can achieve.

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

null-pointer analysis
static analysis
automatic software verification


a hybrid approach for multiresolution modeling of large-scale scientific data Simulations of complex scientific phenomena involve the execution of massively parallel computer programs. These simulation programs generate large-scale multidimensional data sets over the spatio-temporal region. Analyzing such massive data sets is an essential step in helping scientists glean new information. To this end, efficient and effective data models are needed. In this paper, we present a hybrid approach for constructing data models from large-scale multidimensional scientific data sets. Our models not only provide descriptive information about the data but also allow users to subsequently examine the data by querying the data models. Our approach combines a multiresolution-topological model of the data with a multivariate-physical model of the data to generate one hierarchical data model that efficiently captures both the spatio-temporal and the physical aspects of the data. In particular, this hybrid approach consists of three phases. In the first phase, we build a multiresolution model that encapsulates the data set's spatial information (i.e., topology and spatial connectivity). In the second phase, we build a multivariate model from the physical dimensions of the data set. Physical dimensions refer to those dimensions that are neither spatial ( x, y, z ) nor temporal ( time ). The exclusion of the spatial-temporal dimensions from the clustering phase is important since "similar" characteristics could be located (spatially) far from each other. Finally, in the third phase, we connect the multivariate-physical model to the multiresolution-topological model by utilizing ideas from information retrieval. The third phase is essential since the multivariate-physical model does not contain any topological information (without which the model does not have accurate spatial context information). Experimental evaluations on two large-scale multidimensional scientific data sets illustrate the value of our hybrid approach.

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

large-scale scientific data sets
topological models
multivariate clusters
multiresolution indices


Performance models of a proxy cache server: The impact of multimedia traffic We propose a multi-class queuing network model to study the impact of multimedia traffic on the overall response times to Web requests for cases with and without a proxy cache server (PCS). We find that an increase of multimedia traffic percentage will significantly impact the response times for both cases with and without a PCS. The PCS hit rate is identified as one of the factors that impact the performance of a PCS for multimedia traffic. Further, we find that it may not pay to choose an overly-powerful PCS, as the marginal reduction in the overall response time cannot be justified. We show that the required time to travel through the client network represents the dominant factor of overall response time. Although the firms network bandwidth does not impact the decision of whether to install a PCS, improving it has a significant benefit of shortening the overall response time to users Web requests.

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

queuing
multimedia traffic
proxy cache server


Quick Search for Rare Events Rare events can potentially occur in many applications. When manifested as opportunities to be exploited, risks to be ameliorated, or certain features to be extracted, such events become of paramount significance. Due to their sporadic nature, the information-bearing signals associated with rare events often lie in a large set of irrelevant signals and are not easily accessible. This paper provides a statistical framework for detecting such events so that an optimal balance between detection reliability and agility, as two opposing performance measures, is established. The core component of this framework is a sampling procedure that adaptively and quickly focuses the information-gathering resources on the segments of the dataset that bear the information pertinent to the rare events. Particular focus is placed on Gaussian signals with the aim of detecting signals with rare mean and variance values.

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


Robust beamforming with inter-atom-interference mitigation approach for uniform circular arrays In this paper, we propose two beamforming methods with inter atom interference (IAI) mitigation approach for uniform circular array (UCA). The optimal weight vectors corresponding to all possible signal incidence azimuths are first constructed by convex optimization and suppression of IAI processing. Then, denoting all the weight vectors as reference weight vectors, we can obtain the desired beamforming by weighting the array received signal using the reference weight vectors respectively. Simulation results demonstrate that the proposed beamforming methods can achieve significantly improved robustness with low computation complexity.

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

beamforming
uniform circular array
convex optimization


Ten good reasons to use the Eigenfactor (TM) metrics The Eigenfactor score is a journal influence metric developed at the Department of Biology of the University of Washington and recently introduced in the Science and Social Science Journal Citation Reports maintained by Thomson Reuters. It provides a compelling measure of journal status with solid mathematical background, sound axiomatic foundation, intriguing stochastic interpretation, and many interesting relationships to other ranking measures. In this short contribution, we give 10 reasons to motivate the use of the Eigenfactor method. (C) 2010 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

journal influence measures
eigenfactor metrics
impact factor


Meetings scheduling solver enhancement with local consistency reinforcement Meeting scheduling (MS) represents an important real-world group decision application that denotes one of the actual combinatorial problems. Solving this problem consists of scheduling all the meetings while satisfying all the constraints related to both the users and the meetings. However, given human nature, the solution is usually delineated by the encountering of conflicting preferences. Most of existing research efforts allow the relaxation of the users' preferences in order to reach an agreement between all the participants, which is not always possible. In addition, they do not deal with the achievement of any level of local consistency to enhance the efficiency of the solving process, and finally, they do not address the real difficulty of distributed systems, which is the complexity of message passing operations. Here we propose a new approach to facilitate and streamline the scheduling meetings process in any organization. This approach is based on the distributed reinforcement of arc consistency model, which takes into account the difficulties mentioned above. The present work focuses mainly on satisfying meetings hosts' preferences as much as possible, while taking into consideration all users' availability. The underlying selfish protocol is able to efficiently reach the best solution for the host of the meeting (according to the predefined criteria) whenever possible. This process is achieved with the minimal number of exchanged messages and while retaining as much of the privacy of the involved users as possible. An experimental comparative analysis divulges that our approach is scalable and worthwhile especially for strong constraints.

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

valued distributed constraint satisfaction problems


Slotted Optical Burst Switching (SOBS) networks In the paper, we study Optical Burst Switching (OBS) networks. Since OBS still suffers high loss ratio due to the lack of buffer at the OBS core routers, we study methods to reduce the loss without using optical buffers. We consider time-slotted OBS called Slotted OBS (SOBS), where routers are synchronized and only send fixed length bursts at the beginning of time slots. Our simulation results show that SOBS reduces the packet loss probability significantly. Moreover, we show that SOBS can be implemented with little or no additional cost and has other advantages such as providing better support for Quality of Service (QoS). (c) 2007 Elsevier B.V. All rights reserved.

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

time slotted
optical burst switching (obs)
load balancing


High-Quality Image Deblurring with Panchromatic Pixels Image deblurring has been a very challenging problem in recent decades. In this article, we propose a high-quality image deblurring method with a novel image prior based on a new imaging system. The imaging system has a newly designed sensor pattern achieved by adding panchromatic (pan) pixels to the conventional Bayer pattern. Since these pan pixels are sensitive to all wavelengths of visible light, they collect a significantly higher proportion of the light striking the sensor. A new demosaicing algorithm is also proposed to restore full-resolution images from pixels on the sensor. The shutter speed of pan pixels is controllable to users. Therefore, we can produce multiple images with different exposures. When long exposure is needed under dim light, we read pan pixels twice in one shot: one with short exposure and the other with long exposure. The long-exposure image is often blurred, while the short-exposure image can be sharp and noisy. The short-exposure image plays an important role in deblurring, since it is sharp and there is no alignment problem for the one-shot image pair. For the algorithmic aspect, our method runs in a two-step maximum-a-posteriori (MAP) fashion under a joint minimization of the blur kernel and the deblurred image. The algorithm exploits a combined image prior with a statistical part and a spatial part, which is powerful in ringing controls. Extensive experiments under various conditions and settings are conducted to demonstrate the performance of our method.

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

algorithms
design
experimentation
theory
reliability
smart image sensor
panchromatic pixel
image deconvolution
motion deblurring
ringing control


Daily living activity recognition based on statistical feature quality group selection The benefits arising from proactive conduct and subject-specialized healthcare have driven e-health and e-monitoring into the forefront of research, in which the recognition of motion, postures and physical exercise is one of the main subjects. We propose here a multidisciplinary method for the recognition of physical activity with the emphasis on feature extraction and selection processes, which are considered to be the most critical stages in identifying the main unknown activity discriminant elements. Efficient feature selection processes are particularly necessary when dealing with huge training datasets in a multidimensional space, where conventional feature selection procedures based on wrapper methods or branch and bound are highly expensive in computational terms. We propose an alternative filter method using a feature quality group ranking via a couple of two statistical criteria. Satisfactory results are achieved in both laboratory and semi-naturalistic activity living datasets for real problems using several classification models, thus proving that any body sensor location can be suitable to define a simple one-feature-based recognition system, with particularly remarkable accuracy and applicability in the case of the wrist.

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

ambulatory monitoring
e-health
e-monitoring
knowledge extraction


The Role of Cyclic AMP and Its Effect on Protein Kinase A in the Mitogenic Action of Thyrotropin on the Thyroid Cell Cyclic AMP has been shown to inhibit cell proliferation in many cell types and to activate it in some. The latter has been recognized only lately, thanks in large part to studies on the regulation of thyroid cell proliferation in dog thyroid cells. The steps that led to this conclusion are outlined. Thyrotropin activates cyclic accumulation in thyroid cells of all the studied species and also phospholipase C in human cells. It activates directly cell proliferation in rat cell lines, dog, and human thyroid cells but not in bovine or pig cells. The action of cyclic AMP is responsible for the proliferative effect of TSH. It accounts for several human diseases

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

cyclic amp
thyroid
thyrotropin
protein kinase a
mitogenic
cell proliferation
human


A finite element approach for the immersed boundary method We consider a modification of the immersed boundary method which makes use of a finite element spatial discretization. We describe the method for a two-dimensional model problem and justify its variational formulation. We provide a preliminary analysis of the continuous problem in a one-dimensional setting using a fixed point theorem and a compactness argument. Finally, we report on some numerical tests which demonstrate the stability and robustness of the algorithm.

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


TIMED PRIVACY-AWARE BUSINESS PROTOCOLS Web services privacy issues have been attracting more and more attention in the past years. Since the number of Web services-based business applications is increasing, the demands for privacy enhancing technologies for Web services will also be increasing in the future. In this paper, we investigate an extension of business protocols, i.e. the specification of which message exchange sequences are supported by the web service, in order to accommodate privacy aspects and time-related properties. For this purpose we introduce the notion of Timed Privacy-aware Business Protocols (TPBPs). We also discuss TPBP properties can be checked and we describe their verification process.

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


A hybrid architecture for bioinformatics We present a hybrid parallel system based on commodity components to gain supercomputer power at low cost. The architecture is built around a coarse-grained PC-cluster linked by a high-speed network and fine-grained parallel processor arrays connected to each node. Identifying applications that profit from this kind of processing power is critical to justify the use of such a system. In this paper, we present a new approach to high performance protein database scanning with hybrid computing. To derive an efficient mapping onto this architecture, we designed an instruction systolic sequence comparison algorithm. This results in a database scanning implementation with significant runtime savings.

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

high performance biosequence database searching


The nature of adolescent learner interaction in a virtual high school setting This study used survey data to measure the effect of learners' reported interactions with content, peers, and instructors on several course outcomes in two virtual high school courses that emphasized interactive learning. Surveys found that the large majority of students viewed all investigated types of interaction as educational and motivational. Students perceived learnerinstructor and learnercontent interactions to have significantly higher educational value (?<0.01) than learnerlearner interactions, and viewed learnerinstructor interaction to be significantly more motivational (?<0.01) than learnercontent interaction. Furthermore, nine significant correlations were found involving the time students reported spending on human interaction and course outcomes. Seven of the significant correlations were related to the time students reported spending in human interaction and the more affective outcomes, such as course satisfaction and disposition towards the subject area. Outcomes also indicate that learnerlearner interaction had higher correlations with course outcomes than learners' interactions with the content or their instructor. Students' perceived learning was not significantly correlated with any type of interaction, and only students' total reported time spent on learnerlearner interaction and students' social learnerlearner interaction were significantly correlated with their grade.

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

computer-mediated communication
k-12 online learning
online teaching
virtual schooling


efficient compression and handling of current source model library waveforms This paper describes a waveform compression technique suitable for the efficient utilization, storage and interchange of the emerging current source model (CSM) based cell libraries. The technique is based on pre-processing of a collection of voltage/current waveforms for the cells in the library and then, constructing an orthogonal time-voltage/time-current waveform basis using singular-value decomposition. Compression is achieved by representing all waveforms as linear combination coefficients of adaptive subset of the basis waveforms. Experimental results indicate that adaptive waveform representation results in higher compression ratios than the waveform representation as a function of fixed set of basis functions. Interpolation and further compression are obtained by representing the coefficients as simple functions of various parameters, e.g., input slew, load capacitance, supply voltage, and temperature. The methods introduced in this paper are tested and validated on several industrial strength libraries, with spectacular compression results.

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

parameterization
principal component
pre-processing
adaptive data compression


Transaction-centric reconciliation in disconnected client-server databases As mobile computing devices become more and more common, mobile databases are becoming popular. An important feature of these database systems is their ability to allow optimistic replication of data by providing disconnected mobile devices the ability to perform local updates. The key problem to this approach is the reconciliation problem, i.e. the problem of serializing potentially conflicting updates from disconnected clients on all replicas of the database. Reconciliation of conflicting updates is especially critical for disconnected databases where disconnected updates are allowed. We examine some choices for providing solutions to the reconciliation problem. We then present an algorithm that combines multiversion concurrency control schemes on a server with reconciliation of updates from disconnected clients. We also describe a simple but illustrative sample application. Finally we present our conclusions.

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

disconnected operation
reconcilation
serializability testing


An adaptive neuro-fuzzy inference system (ANFIS) model for wire-EDM A wire electrical discharge machined (WEDM) surface is characterized by its roughness and metallographic properties. Surface roughness and white layer thickness (WLT) are the main indicators of quality of a component for WEDM. In this paper an adaptive neuro-fuzzy inference system (ANFIS) model has been developed for the prediction of the white layer thickness (WLT) and the average surface roughness achieved as a function of the process parameters. Pulse duration, open circuit voltage, dielectric flushing pressure and wire feed rate were taken as models input features. The model combined modeling function of fuzzy inference with the learning ability of artificial neural network; and a set of rules has been generated directly from the experimental data. The models predictions were compared with experimental results for verifying the approach.

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

fuzzy inference
artificial neural network

wire-edm
artificial intelligence techniques


Automated Bidding for Media Services at the Edge of a Content Delivery Network We investigate the problem of providing media services to multiple autonomous wireless users at the edge of a content delivery network (CDN) in a setting where wireless resources are priced based on real-time market demands. Our focus is on the multimedia service resource negotiation process, which is performed prior to the actual media transmission. We adopt the progressive second price (PSP) auction mechanism, which is used to determine the network resource allocation to the users and a corresponding tax for the consumed resources. Our interest in this negotiation mechanism lies in understanding a single user's (or agent's) ability to learn to improve its bids over time in order to increase its own utility in the face of time-varying resource valuations and contention for resources with other users. We pay particular attention to the implementation complexity and the information requirements of the agent's deployed learning rule, and we quantify the impact of these factors on the rule's ultimate performance (i.e., the cumulative utility achieved over time) and efficiency (i.e., the utility gained per unit of computation). These factors are especially important in the mobile video streaming context, where limited resources must be efficiently utilized, and where communication and computation overheads can significantly impact the quality of service experienced by the user.

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

content delivery networks
multiagent learning
multimedia service middleware
session negotiation


Architectures and FPGA implementations of the 64-bit MISTY1 block cipher In this paper, we present two alternative architectures and FPGA implementations of the 64-bit NESSIE proposal, MISTY1 block cipher. The first architecture is suitable for applications with high-performance requirements. A throughput of up to 12.6 Gbps can be achieved at a clock frequency of 168 MHz. The main characteristic of this architecture is that uses RAM blocks embedded in modern FPGA devices in order to implement the S-boxes defined in the block cipher algorithm. The second architecture can be used in implementing applications on area-constrained systems. It utilizes feedback logic and inner pipeline with negative edge-triggered register. This technique shortens the critical path, without increasing the latency of the MISTY1 algorithm execution. Compared with an implementation without inner pipeline, performance improvement of 97% is achieved. The measured throughput of the second architecture implementation is 561 Mbps at 79 MHz.

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

misty1
block cipher
nessie
inner pipeline
fpga

cryptography
negative edge-triggered register


Simple learning algorithms for decision trees and multivariate polynomials In this paper we develop a new approach for learning decision trees and multivariate polynomials via interpolation of multivariate polynomials. This new approach yields simple learning algorithms for multivariate polynomials and decision trees over finite fields under any constant bounded product distribution. The output hypothesis is a (single) multivariate polynomial that is an epsilon-approximation of the target under any constant bounded product distribution. The new approach demonstrates the learnability of many classes under any constant bounded product distribution and using membership queries, such as j-disjoint disjunctive normal forms (DNFs) and multivariate polynomials with bounded degree over any field. The technique shows how to interpolate multivariate polynomials with bounded term size from membership queries only. This, in particular, gives a learning algorithm for an O(log n)-depth decision tree from membership queries only and a new learning algorithm of any multivariate polynomial over sufficiently large fields from membership queries only. We show that our results for learning from membership queries only are the best possible.

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

learning interpolation
decision tree learning


A diversity-driven structure learning algorithm for building hierarchical neuro-fuzzy classifiers In this article, an efficient structure learning algorithm is proposed for the development of self-organizing neuro-fuzzy multilayered classifiers (SONeFMUC). These classifiers are hierarchical structures comprising small-scale fuzzy-neuron classifiers (FNCs), interconnected along multiple layers. At each layer, parent FNCs are combined to construct a descendant FNC at the next layer with enhanced classification qualities. The SONeFMUC structure is progressively expanded by generating new layers based on the principles of the Group Method of Data Handling (GMDH) algorithm, which is appropriately adapted to handle classification tasks. Traditional GMDH proceeds blindly to the construction of all possible parent FNC pairs from the previous layer to obtain the individuals in the next layer without paying due attention to the diversity of the FNC combinations. However, previous experimentation shows that a large number of descendant FNCs exhibit similar or slightly better classification capabilities than their parent FNCs. This causes an increase of the computational cost required for structure learning, without a direct impact on the accuracy of the obtained models. In this paper, a modified version of GMDH is devised for effective identification of the SONeFMUC structure. We incorporate the Proportion of Specific Agreement (Ps) as a means to evaluate the diversity of the FNC pairs. In the devised method, only complementary FNCs are combined, i.e., FNCs which commit errors at different pattern subspaces, to construct a descendant FNC at the next layer. Accordingly, a computational reduction is achieved while high classification accuracy is maintained. The efficiency of the proposed structure learning is tested on a diverse set of benchmark datasets using land cover classification from multispectral images as a real-world application.

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

neuro-fuzzy classifiers
classifiers combination
decision fusion
hierarchical classification
diversity measure


Buckling, flutter and vibration analyses of beams by integral equation formulations This paper presents a model for the investigation of buckling, flutter and vibration analyses of beams using the integral equation formulation. A mathematical formulation based on EulerBernoulli beam theory is presented for beams with variable sections on elastic foundations and subjected to lateral excitation, conservative and non-conservative loads. Using the boundary element method and radial basis functions, the equation of motion is reduced to an algebraic system related to internal and boundary unknowns. Eigenvalue problems related to buckling and vibrations are formulated and numerically solved. Buckling loads, natural frequencies and associated eigenmodes are computed. The corresponding slope, bending and shear forces can be directly obtained. The load-frequency dependence is investigated for various elastic foundations and the divergence critical loads are evidenced. Under non-conservative loads, a dynamic stability analysis is illustrated numerically based on the coalescence of eigenfrequencies. The flutter load and instability regions with respect to the elastic concentrated and distributed foundations are identified. Using the eigenmodes, numerically computed, non-linear vibrations of beams are investigated based on one mode analysis. The presented model is quite general and the obtained numerical results are in agreement with available data.

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

beam
buckling
flutter
vibration
integral equation
radial basis functions


The computational complexity of N-K fitness functions N-K fitness landscapes have been used widely as examples and test functions in the field of evolutionary computation. Thus, the computational complexity of these landscapes as optimization problems is of interest. We investigate the computational complexity of the problem of optimizing the N-K fitness functions and related fitness functions. We give an algorithm to optimize adjacent-model N-K fitness functions, which is polynomial in N. We show that the decision problem corresponding to optimizing random-model N-K fitness functions is NP-complete for K > 1, and is polynomial for K = 1. If the restriction that the ith component function depends on the ith bit is removed, then the problem is NP-complete, even for K = 1. We also give a polynomial-time approximation algorithm for the arbitrary-model N-K optimization problem.

O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem One of the most significant problems of supply chain management is the distribution of products between locations. The delivery of goods from a warehouse to local customers is a critical aspect of material logistics. The Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) is a variant of the Vehicle Routing Problem (VRP) that aims to provide service to a specific customer group with minimum cost using a limited number of vehicles. We assume that the number of vehicles is fixed. We must decide how to make the best use of the fixed fleet of vehicles. In this paper we describe a Tabu Search algorithm embedded in the Adaptive Memory (TSAM) procedure to solve the HFFVRP. Computational experiments indicating the performance of the algorithm concerning quality of solution and processing time are reported.

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

fixed fleet
vehicle routing problem
tabu search
adaptive memory


Dissimilarity criteria and their comparison for quantitative evaluation of image segmentation: application to human retina vessels The quantitative evaluation of image segmentation is an important and difficult task that is required for making a decision on the choice of a segmentation method and for the optimal tuning of its parameter values. To perform this quantitative evaluation, dissimilarity criteria are relevant with respect to the human visual perception, contrary to metrics that have been shown to be visually not adapted. This article proposes to compare eleven dissimilarity criteria together. The field of retina vessels image segmentation is taken as an application issue to emphasize the comparison of five specific image segmentation methods, with regard to their degrees of consistency and discriminancy. The DRIVE and STARE databases of retina images are employed and the manual/visual segmentations are used as a reference and as a control method. The so-called \(\epsilon \) criterion gives results in agreement with perceptually based criterions for achieving the quantitative comparison.

B I O O O O B I O B I O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 segmentation
quantitative evaluation
dissimilarity criteria

segmentation evaluation
retinal blood vessels


Theoretical study on the interactions between methanol and imidazolium-based ionic liquids To better understand the property of the binary systems composing of imidazolium salt, [emim](+)A(-) (A=Cl(-), Br(-) BF(4)(-), and PF(6)(-)) and methanol, we have investigated in detail the interactions of methanol molecule with anions A(-) cation [emim](+), and ion pair [emim](+)A(-)of several ionic liquids (ILs) based on 1-ethyl-3-methylimidazolium cation by performing density functional theory calculations. It is found that H-bonds are universally involved in these systems, which may play an important role for the miscibility of methanol with imidazolium-based ILs. The interaction mechanisms of methanol molecule with anion and cation are found to be different in nature: the former mainly involves LP(X)-sigma*(o-H) interaction, while the latter relates with the decisive orbital overlap of the type of LP(O)-sigma*(C-H). Based on the present calculations, we have provided some reasonable interpretations for properties of the binary mixtures of ILs and alcohol and revealed valuable information for the interaction details between ILs and alcohols, which is expected to be useful for the design of more efficient ILs to form superior solvent system with alcohol.

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


Educational Simulator for Multicomponent Distillation Research and Teaching in Chemical Engineering in this article we described the use of an educational simulator for a multicomponent distillation process with process control. This tool was shown to be flexible, allowing students to study the dynamic behavior of the tower and its control, and to explore the possibility for the design of this kind of equipment on their courses. (C) 2009 Wiley Periodicals. Inc. Comput Appl Eng Educ 18: 175-182, 2010: Published online in Wiley InterScience (www.interscience.wiley.com): DOI 10.1002/cae.20134

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

engineering education distillation
interactive learning environments
simulations


Source authenticity in the UMLS - A case study of the Minimal Standard Terminology As the UMLS integrates multiple source vocabularies, the integration process requires that certain adaptation be applied to the source Our interest is in examining the relationship between the UMLS representation of a source vocabulary and the source vocabulary itself We investigated the integration of the Minimal Standard Terminology (MST) into the UMLS in order to examine how close its UMLS representation is to the source MST The MST was conceived as a "minimal" list of terms and structure intended for use within computer systems to facilitate standardized reporting of gastrointestinal endoscopic examinations Although the MST has an overall schema and implied relationship structure, many of the UMLS integrated MST terms were found to be hierarchically orphaned, and with lateral relationships that do not closely adhere to the source MST Thus, the MST representation within the UMLS significantly differs front that of the source MST These representation discrepancies may affect the usability of the MST representation in the UMLS for knowledge acquisition Furthermore, they pose a problem from the perspective of application developers While these findings may not necessarily apply to other source terminologies, they highlight the conflict between preservation of authentic concept orientation and the UMLS overall desire to provide fully specified names for all source terms (C) 2010 Elsevier Inc All rights reserved

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

umls mst terminology gastrointestinal integration


Full orientability of graphs with at most one dependent arc Suppose that D D is an acyclic orientation of a graph G G . An arc of D D is dependent if its reversal creates a directed cycle. Let d min ( G ) ( d max ( G ) ) denote the minimum (maximum) of the number of dependent arcs over all acyclic orientations of G G . We call G G fully orientable if G G has an acyclic orientation with exactly d d dependent arcs for every d d satisfying d min ( G ) ? d ? d max ( G ) . We show that a connected graph G G is fully orientable if d min ( G ) ? 1 . This generalizes the main result in Fisher etal.[D.C. Fisher, K. Fraughnaugh, L. Langley, D.B. West, The number of dependent arcs in an acyclic orientation, J. Combin. Theory Ser. B 71 (1997) 7378].

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

acyclic orientation
dependent arc
full orientability


Influence of co-authorship networks in the research impact: Ego network analyses from Microsoft Academic Search Microsoft Academic Search is introduced to test its suitability for bibliometric analyses. Sparse networks achieved more citations per document than dense and compact ones. Mathematics and Social Sciences disciplines describe more disconnected networks. Authors that have a high control on their collaborators favours their research impact.

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

bibliometrics
academic search engines
ego networks
co-authorship


on the value of learning from defect dense components for software defect prediction BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusing on the defect-rich portions of the training sets. METHOD: Defect data CM1, KC1, MC1, PC1, PC3 was separated into components. A subset of the projects (selected at random) were set aside for testing. Training sets were generated for a NaiveBayes classifier in two ways. In sample the dense treatment, the components with higher than the median number of defective modules were used for training. In the standard treatment, modules from any component were used for training. Both samples were run against the test set and evaluated using recall, probability of false alarm, and precision. In addition, under sampling and over sampling was performed on the defect data. Each method was repeated in a 10-by-10 cross-validation experiment. RESULTS: Prediction models learned from defect dense components out-performed standard method, under sampling, as well as over sampling. In statistical rankings based on recall, probability of false alarm, and precision, models learned from dense components won 4--5 times more often than any other method, and also lost the least amount of times. CONCLUSIONS: Given training data where most of the defects exist in small numbers of components, better defect predictors can be trained from the defect dense components.

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

defect dense components
defect prediction
sampling


A Fast Nonparametric Noncausal MRF-Based Texture Synthesis Scheme Using a Novel FKDE Algorithm In this paper, a new algorithm is proposed for fast kernel density estimation (FKDE), based on principal direction divisive partitioning (PDDP) of the data space. A new framework is also developed to apply FKDE algorithms (both proposed and existing), within nonparametric noncausal Markov random field (NNMRF) based texture synthesis algorithm. The goal of the proposed FKDE algorithm is to use the finite support property of kernels for fast estimation of density. It has been shown that hyperplane boundaries for partitioning the data space and principal component vectors of the data space are two requirements for efficient FKDE. The proposed algorithm is compared with the earlier algorithms, with a number of high-dimensional data sets. The error and time complexity analysis, proves the efficiency of the proposed FKDE algorithm compared to the earlier algorithms. Due to the local simulated annealing, direct incorporation of the FKDE algorithms within the NNMRF-based texture synthesis algorithm, is not possible. This work proposes a new methodology to incorporate the effect of local simulated annealing within the FKDE framework. Afterward, the developed texture synthesis algorithms have been tested with a number of different natural textures, taken from a standard database. The comparison in terms of visual similarity and time complexity, between the proposed FKDE based texture synthesis algorithm with the earlier algorithms, show the efficiency.

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

kernel density estimation (kde)
markov random field (mrf)
nonparametric density estimation
principal component analysis
vector quantization


Attacks on the (enhanced) Yang-Shieh authentication The Yang-Shieh authentication is a time-stamp based password authentication scheme that uses smart cards [1]. In [2and3], various attacks on this scheme are described. However, an enhancement of the scheme is proposed in [3] and enables the scheme to resist these existing attacks. In this paper, we show two new attack that can break the enhanced scheme. We further point out that the fundamental computational assumption of the Yang-Shieh authentication scheme is incorrect.

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


Picasso: Flexible RF and Spectrum Slicing This paper presents the design, implementation and evaluation of Picasso, a novel radio design that allows simultaneous transmission and reception on separate and arbitrary spectrum fragments using a single RF front end and antenna. Picasso leverages this capability to flexibly partition fragmented spectrum into multiple slices that share the RF front end and antenna, yet operate concurrent and independent PHY/MAC protocols. We show how this capability provides a general and clean abstraction to exploit fragmented spectrum in WiFi networks and handle coexistence in dense deployments. We prototype Picasso, and demonstrate experimentally that a Picasso radio partitioned into four slices, each concurrently operating four standard WiFi OFDM PHY and CSMA MAC stacks, can achieve the same sum throughput as four physically separate radios individually configured to operate on the spectrum fragments. We also demonstrate experimentally how Picasso's slicing abstraction provides a clean mechanism to enable multiple diverse networks to coexist and achieve higher throughput, better video quality and latency than the best known state of the art approaches.

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

algorithms
performance
radio virtualization
interference cancellation


Effiective non-deterministic semantics for first-order LFIs A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa's approach, which has led to the family of Logics of Formal Inconsistency (LFIs), where the notion of inconsistency is expressed at the object level. In this paper we use non-deterministic matrices, a generalization of standard multi-valued matrices, to provide simple and modular finite-valued semantics for a large family of first-order LFIs. We demonstrate that the modular approach of Nmatrices provides new insights into the semantic role of the studied axioms and the dependencies between them. Furthermore, we study the issue of effectiveness in Nmatrices, a property which is crucial for the usefulness of semantics. We show that all of the non-deterministic semantics provided in this paper are effective.

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

many-valued logic
non-deterministic matrices


A comparative study of binding affinities for 6,7-dimethoxy-4-pyrrolidylquinazolines as phosphodiesterase 10A inhibitors using the linear interaction energy method Binding affinity models based on the linear interaction energy (LIE) scheme were built for PDE10 inhibitors. The best model was obtained based on the 4HEU structure with an RMSE of 0.52 kcal/mol (R2=0.86) for the test set. The applicability domain was investigated. Use of the best models guided a similarity search resulting in interesting new hits for further lead optimization.

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

phosphodiesterase 10a
binding affinity
linear interaction energy

virtual screening and applicability domain


Analysis of effectiveness and benefits of collaboration modes with information- and knowledge-sharing This study addresses an empirical analysis of information- and knowledge-sharing among collaborative decision makers. In this research, each decision maker represents one of three distributed centers in ERP systems: Sales, Production, and Procurement Centers. Their respective objectives and decision policies are defined to design collaborative decision-making environments. MICSS-LAN, an ERP simulation tool, was applied for the experiments, generating explicit numerical results that enable the measurement of the effectiveness and benefits by collaborative decision making. The experimental results indicate that total profit and due date performance have been improved by information- and knowledge-sharing. It implies that better design and utilization of ERP structures can be achieved by a certain level of information- and knowledge-sharing.

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

collaboration mode
e-work
information sharing
knowledge sharing
erp design
e-learning


SELF-ORGANIZED CRITICALITY IN A WEIGHTED EARTHQUAKE MODEL A weighted scale-free OFC model improving the redistribution rule of the original model has been introduced. Our model displays self-organized criticality behaviors with different network parameters, and the average earthquake size has been introduced to show the different effects of these parameters. Transient and oscillatory activity have been detected based on our weighted network, and the transient time increases with decreasing dissipative parameter.

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

transient and oscillatory activity
weighted earthquake model


P not equal NP for the reals with various analytic functions We show that non-deterministic machines in the sense of L. Blum, hi. Shub, and S. Smale (1989. Bull. Amer. Math. Soc. 21) defined over wide classes of real analytic structures are more powerful than the corresponding deterministic machines. (C) 2001 Academic Press.

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


When long memory meets the Kalman filter: A comparative study The finite sample properties of the state space methods applied to long memory time series are analyzed through Monte Carlo simulations. The state space setup allows to introduce a novel modeling approach in the long memory framework, which directly tackles measurement errors and random level shifts. Missing values and several alternative sources of misspecification are also considered. It emerges that the state space methodology provides a valuable alternative for the estimation of the long memory models, under different data generating processes, which are common in financial and economic series. Two empirical applications highlight the practical usefulness of the proposed state space methods.

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

arfima models
missing observations
measurement error


Interaction of robot swarms using the honeybee-inspired control algorithm BEECLUST In this work we investigated how robust a robot swarm acts against disturbances caused by another robot swarm, both using the BEECLUST algorithm, which is inspired by honeybee behaviour. For our investigation we simulated an environment with an ambient illuminance, a light spot and a shadow spot. In such an environment we tested two different castes of Jasmine III robots whereas each caste had to perform a different task. One swarm aggregates at places of high illuminance (light spot) and the other one at places of low illuminance (shadow spot). We show that small swarm populations can benefit from the presence of another robot swarm. Medium populated swarms are affected neither positively nor negatively. Large swarm populations act robust against disturbances caused by other robot swarms as long as no jamming effects occur. In this article we show that the BEECLUST algorithm provides all features for making collective decisions. Furthermore we show that the robustness of the BEECLUST algorithm allows us to control a heterogeneous robot swarm in environments which demand differing controller strategies and swarm intelligent behaviour.

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


A decision support system for optimizing dynamic courier routing operations Propose a dynamic courier routing model with new orders and order cancellation. Integrate fuzzy time windows to formulate and evaluate courier service level. Develop a Hybrid Neighboring Search algorithm to tackle the dynamic problem. Enhance service level without increasing transportation and manpower cost.

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

dynamic vehicle routing
variable neighborhood search
fuzzy logic


See-Through Walls: Motion Tracking Using Variance-Based Radio Tomography Networks This paper presents a new method for imaging, localizing, and tracking motion behind walls in real time. The method takes advantage of the motion-induced variance of received signal strength measurements made in a wireless peer-to-peer network. Using a multipath channel model, we show that the signal strength on a wireless link is largely dependent on the power contained in multipath components that travel through space containing moving objects. A statistical model relating variance to spatial locations of movement is presented and used as a framework for the estimation of a motion image. From the motion image, the Kalman filter is applied to recursively track the coordinates of a moving target. Experimental results for a 34-node through-wall imaging and tracking system over a 780 square foot area are presented.

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

wireless networks
sensors
through-wall surveillance


Preserving step edges in low bit rate progressive image compression With the growing importance of low-bandwidth applications such as wireless access to the Internet, images are often sent or received at low bit rates. At these bit rates they suffer from significant distortion and artifacts, making it difficult for those viewing the images to understand them. In this paper we present two progressive compression algorithms that focus on preserving the clarity of important image features, such as edges, at compression ratios of 80:1 and more. Both algorithms capture and encode the locations of important edges in the images. The first algorithm then transmits a standard SPIHT bit stream, and at the decoder applies a nonlinear edge-enhancement procedure to improve the clarity of the encoded edges. The second approach uses a modified wavelet transform to "remove" the edges, and encodes the remaining texture information using SPIHT. With both approaches, features in the images that may be important for recognition are well preserved, even at low bit rates.

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

edge preservation
edge-based wavelet transform


On an approach to the modelling of problems connected with conflicting economic interests The aim of the present paper is to show a possible way to use the recent results obtained in linear and linear-fractional programming in applications connected with the coordination of conflicting economic interests. We consider the relationship between linear and linear-fractional programming problems with the same feasible set and show how it is possible to reorientate objective functions such that all objective functions considered lead to the same optimal solution. We show also that in certain cases the dual estimates of linear and linear-fractional programming are closely connected. The economic interpretation of the results obtained is outlined and a numerical example is presented.

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

linear programming
linear-fractional programming
duality
unemployment


An Improved Multiobjective Search Method Applied to Single Frequency Networks Planning This paper proposes a simpler and efficient approach to optimize digital television coverage and costs planning using a modified version of the well-known local search algorithm Hill Climbing. The results, taken from a real scenario in central Brazil, show the efficiency and applicability of the method by comparing results with other memetic strategies based on hybridation.

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

planning
digital television
hill climbing


Multimedia event detection with multimodal feature fusion and temporal concept localization We present a system for multimedia event detection. The developed system characterizes complex multimedia events based on a large array of multimodal features, and classifies unseen videos by effectively fusing diverse responses. We present three major technical innovations. First, we explore novel visual and audio features across multiple semantic granularities, including building, often in an unsupervised manner, mid-level and high-level features upon low-level features to enable semantic understanding. Second, we show a novel Latent SVM model which learns and localizes discriminative high-level concepts in cluttered video sequences. In addition to improving detection accuracy beyond existing approaches, it enables a unique summary for every retrieval by its use of high-level concepts and temporal evidence localization. The resulting summary provides some transparency into why the system classified the video as it did. Finally, we present novel fusion learning algorithms and our methodology to improve fusion learning under limited training data condition. Thorough evaluation on a large TRECVID MED 2011 dataset showcases the benefits of the presented system.

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


Determination of amino acid pairs in human p53 protein sensitive to mutations/variants by means of a random approach This is the continuation of our studies using random approaches to analyse the p53 protein family. In this data-based theoretical analysis, we use the random approach to analyse the amino acid pairs in human p53 protein in order to determine which amino acid pairs are more sensitive to 190 human p53 mutations/variants. The rationale of this study is based on our hypothesis and findings that a harmful mutation is more likely to occur at randomly unpredictable amino acid pairs, and a harmless mutation is more likely to occur at randomly predictable amino acid pairs. This is because we argue that the randomly predictable amino acid pairs should not be deliberately evolved, whereas the randomly unpredictable amino acid pairs should be deliberately evolved with a connection to protein function. The results show, for example, that 93.16% of 190 mutations/variants occur at randomly unpredictable amino acid pairs. Thus, the randomly unpredictable amino acid pairs are more sensitive to mutations/variants in human p53 protein. The results also suggest that the human p53 protein has a tendency for the occurrence of mutation/variants.

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

mutations
probability randomness
randomness


Towards security in nano-communication: Challenges and opportunities Incredible improvements in the field of nano-technologies have enabled nano-scale machines that promise new solutions for several applications in biomedical, industry and military fields. Some of these applications require or might exploit the potential advantages of communication and hence cooperative behavior of these nano-scale machines to achieve a common and challenging objective that exceeds the capabilities of a single device. Extensions to known wireless communication mechanisms as well as completely novel approaches have been investigated. Examples include RF radio communication in the terahertz band or molecular communication based on transmitter molecules. Yet, one question has not been considered so far and that is nano-communication security, i.e., how we can protect such systems from manipulation by malicious parties? Our objective in this paper is to provide some first insights into this new field and to highlight some of the open research challenges. We start from a discussion of classical security objectives and their relevance in nano-networking. Looking at the well-understood field of sensor networks, we derive requirements and investigate if and how available solutions can be applied to nano-communication. Our main observation is that, especially for molecular communication, existing security and cryptographic solutions might not be applicable. In this context, we coin the new term biochemical cryptography that might open a completely new research direction and lead to significant improvements in the field of molecular communication. We point out similarities with typical network architectures where they exist but also highlight completely new challenges where existing solutions do not apply.

O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O 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 probabilistic approach to quantum Bayesian games of incomplete information A Bayesian game is a game of incomplete information in which the rules of the game are not fully known to all players. We consider the Bayesian game of Battle of Sexes that has several Bayesian Nash equilibria and investigate its outcome when the underlying probability set is obtained from generalized EinsteinPodolskyRosen experiments. We find that this probability set, which may become non-factorizable, results in a unique Bayesian Nash equilibrium of the game.

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

quantum games
epr experiments
quantum probability


The slave model of autobiographical memory In this paper the nature of the relationship between psychological mechanisms that process semantic information and those that process autobiographical memory is considered. On the basis of theoretical work by Endel Tulving, and empirical research into the construction of false memories, a novel model of autobiographical memory construction is proposed. This model is referred to as the slave model of autobiographical memory and has that the mechanisms responsible for the production of autobiographical memories are enslaved to those that support semantic information, in the sense that beliefs determine the content of autobiographical memory. Implications of the model for the potential double dissociation of semantic and episodic memory are considered; as are recent accounts of autobiographical memory construction.

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

autobiographical episodic semantic false memory tulving slave


the bbn byblos pashto ocr system The BBN Byblos OCR system implements a script-independent methodology for OCR using Hidden Markov Models (HMMs). We have successfully tested the system with Arabic, English, and Chinese documents. In this paper, we describe our recent effort in training the system to perform recognition of documents in Pashto, one of the national languages of Afghanistan. We discuss the availability and characteristics of suitable experimental data and the methods we used to assemble Pashto training and test corpora. We modeled each form of each Pashto character with an HMM and tested the models on several varieties of document images. On a fair test set consisting of synthetic images alone we measured a character error rate of 1.6\%. The character error rate on a fair test set consisting of scanned pages was 2.1\%, and the character error rate on a fair test set of faxed pages was 3.1\%. On other types of document images, character error rates increased in rough proportion to the level of degradation of the image.

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