Ontology-based semantic similarity: A new feature-based approach

Estimation of the semantic likeness between words is of great importance in many applications dealing with textual data such as natural language processing, knowledge acquisition and information retrieval. Semantic similarity measures exploit knowledge sources as the base to perform the estimations. In recent years, ontologies have grown in interest thanks to global initiatives such as the Semantic Web, offering an structured knowledge representation. Thanks to the possibilities that ontologies enable regarding semantic interpretation of terms many ontology-based similarity measures have been developed. According to the principle in which those measures base the similarity assessment and the way in which ontologies are exploited or complemented with other sources several families of measures can be identified. In this paper, we survey and classify most of the ontology-based approaches developed in order to evaluate their advantages and limitations and compare their expected performance both from theoretical and practical points of view. We also present a new ontology-based measure relying on the exploitation of taxonomical features. The evaluation and comparison of our approach’s results against those reported by related works under a common framework suggest that our measure provides a high accuracy without some of the limitations observed in other works.     

Analytical formulation to compute QFT bounds: The envelope method

This paper describes an analytical formulation to compute quantitative feedback theory (QFT) bounds in one‐degree‐of‐freedom feedback control problems. The new approach is based on envelope curves and shows that a QFT control specification can be expressed as a family of circumferences. Then, the controller bound is defined by the envelope curve of this family and can be obtained as an analytical function. This offers the possibility of studying the QFT bounds in an analytical way with several useful properties. Gridding methods are avoided, resulting in a lower computational effort procedure. The new formulation improves the accuracy of previous methods and allows the designer to calculate multivalued bounds. Copyright © 2009 John Wiley & Sons, Ltd.     

A quantitative feedback solution to the multivariable tracking error problem

This paper introduces a novel solution for the multi‐input multi‐output (MIMO) quantitative feedback theory control design problem with tracking error specifications. Looking for a minimum controller overdesign, the technique finds new controller quantitative feedback theory bounds based on necessary and sufficient conditions for the existence of suitable associated prefilter matrix elements. It improves previous approaches to the subject and includes (i) the possibility of a free selection of the nominal plant, (ii) a less conservative application of the Schwartz inequality to decisively reduce the potential controller overdesign, (iii) a methodology to design independently the elements of the prefilter matrix, and (iv) a scope of application to both sequential and nonsequential MIMO controller design methods. The benefits of the new control design technique are illustrated by means of two examples. The first one, a standard 2 × 2 MIMO problem, is provided for comparison purposes with previous approaches. The second example, included as a major control challenge, deals with a well‐known demanding distillation column benchmark problem. Copyright © 2013 John Wiley & Sons, Ltd.     

Ontology-driven web-based semantic similarity

Estimation of the degree of semantic similarity/distance between concepts is a very common problem in research areas such as natural language processing, knowledge acquisition, information retrieval or data mining. In the past, many similarity measures have been proposed, exploiting explicit knowledge—such as the structure of a taxonomy—or implicit knowledge—such as information distribution. In the former case, taxonomies and/or ontologies are used to introduce additional semantics; in the latter case, frequencies of term appearances in a corpus are considered. Classical measures based on those premises suffer from some problems: in the first case, their excessive dependency of the taxonomical/ontological structure; in the second case, the lack of semantics of a pure statistical analysis of occurrences and/or the ambiguity of estimating concept statistical distribution from term appearances. Measures based on Information Content (IC) of taxonomical concepts combine both approaches. However, they heavily depend on a properly pre-tagged and disambiguated corpus according to the ontological entities in order to compute accurate concept appearance probabilities. This limits the applicability of those measures to other ontologies –like specific domain ontologies- and massive corpus –like the Web-. In this paper, several of the presented issues are analyzed. Modifications of classical similarity measures are also proposed. They are based on a contextualized and scalable version of IC computation in the Web by exploiting taxonomical knowledge. The goal is to avoid the measures’ dependency on the corpus pre-processing to achieve reliable results and minimize language ambiguity. Our proposals are able to outperform classical approaches when using the Web for estimating concept probabilities.     

Two proposals for the inclusion of directory information in the last-level private caches of glueless shared-memory multiprocessors

In glueless shared-memory multiprocessors where cache coherence is usually maintained using a directory-based protocol, the fast access to the on-chip components (caches and network router, among others) contrasts with the much slower main memory. Unfortunately, directory-based protocols need to obtain the sharing status of every memory block before coherence actions can be performed. This information has traditionally been stored in main memory, and therefore these cache coherence protocols are far from being optimal. In this work, we propose two alternative designs for the last-level private cache of glueless shared-memory multiprocessors: the lightweight directory and the SGluM cache. Our proposals completely remove directory information from main memory and store it in the home node’s L2 cache, thus reducing both the number of accesses to main memory and the directory memory overhead. The main characteristics of the lightweight directory are its simplicity and the significant improvement in the execution time for most applications. Its drawback, however, is that the performance of some particular applications could be degraded. On the other hand, the SGluM cache offers more modest improvements in execution time for all the applications by adding some extra structures that cope with the cases in which the lightweight directory fails.     

Structure of nylon 7 solution grown crystals

Single crystals of nylon 7 prepared by crystallization from glycerine were studied by both X-rays and electron microscopy. Electron diffraction proved that they consist of a twinned layered-structure with hydrogen bonds running parallel to their long dimension. Polyethylene decoration of such crystals showed that they are subdivided in folding domains so that both chain folding and hydrogen bonding take place along the same crystallographical planes.     

Superpipelined high-performance optical-flow computation architecture

Optical-flow computation is a well-known technique and there are important fields in which the application of this visual modality commands high interest. Nevertheless, most real-world applications require real-time processing, an issue which has only recently been addressed. Most real-time systems described to date use basic models which limit their applicability to generic tasks, especially when fast motion is presented or when subpixel motion resolution is required. Therefore, instead of implementing a complex optical-flow approach, we describe here a very high-frame-rate optical-flow processing system. Recent advances in image sensor technology make it possible nowadays to use high-frame-rate sensors to properly sample fast motion (i.e. as a low-motion scene), which makes a gradient-based approach one of the best options in terms of accuracy and consumption of resources for any real-time implementation. Taking advantage of the regular data flow of this kind of algorithm, our approach implements a novel superpipelined, fully parallelized architecture for optical-flow processing. The system is fully working and is organized into more than 70 pipeline stages, which achieve a data throughput of one pixel per clock cycle. This computing scheme is well suited to FPGA technology and VLSI implementation. The developed customized DSP architecture is capable of processing up to 170 frames per second at a resolution of 800 × 600 pixels. We discuss the advantages of high-frame-rate processing and justify the optical-flow model chosen for the implementation. We analyze this architecture, measure the system resource requirements using FPGA devices and finally evaluate the system’s performance and compare it with other approaches described in the literature.     

Low-cost sensor to detect overtaking based on optical flow

The automotive industry invests substantial amounts of money in driver-security and driver-assistance systems. We propose an overtaking detection system based on visual motion cues that combines feature extraction, optical flow, solid-objects segmentation and geometry filtering, working with a low-cost compact architecture based on one focal plane and an on-chip embedded processor. The processing is divided into two stages: firstly analog processing on the focal plane processor dedicated to image conditioning and relevant image-structure selection, and secondly, vehicle tracking and warning-signal generation by optical flow, using a simple digital microcontroller. Our model can detect an approaching vehicle (multiple-lane overtaking scenarios) and warn the driver about the risk of changing lanes. Thanks to the use of tightly coupled analog and digital processors, the system is able to perform this complex task in real time with very constrained computing resources. The proposed method has been validated with a sequence of more than 15,000 frames (90 overtaking maneuvers) and is effective under different traffic situations, as well as weather and illumination conditions.     

Cloud-based architecture for web applications with load forecasting mechanism: a use case on the e-learning services of a distant university

In cloud systems, a clear necessity emerges related to the use of efficient and scalable computing resources. For this, accurate predictions on the load of computing resources are a key. Thanks to these accurate predictions, reduced power consumption and enhanced revenue of the system can be achieved, since resources can be ready when users need them and shutdown when they are no longer needed. This work presents an architecture to manage web applications based on cloud computing, which combines both local and public cloud resources. This work also presents the algorithms needed to efficiently manage such architecture. Among them, a load forecasting algorithm has been developed based on Exponential Smoothing. An use case of the e-learning services of our University presenting the behaviour of our architecture has been evaluated through a series of simulations. Among the most remarkable results, power consumption is reduced by 32 % at the cost of 367.31 US$ a month compared with the current architecture.     

Analysis of the HLA class I associated peptide repertoire in a hepatocellular carcinoma cell line reveals tumor-specific peptides as putative targets for immunotherapy

HLA class I molecules present peptides on the cell surface to CD8(+) T cells. The repertoire of peptides that associate to class I molecules represents the cellular proteome. Therefore, cells expressing different proteomes could generate different class I-associated peptide repertoires. A large number of peptides have been sequenced from HLA class I alleles, mostly from lymphoid cells. On the other hand, T cell immunotherapy is a goal in the fight against cancer, but the identification of T cell epitopes is a laborious task. Proteomic techniques allow the definition of putative T cell epitopes by the identification of HLA natural ligands in tumor cells. In this study, we have compared the HLA class I-associated peptide repertoire from the hepatocellular carcinoma (HCC) cell line SK-Hep-1 with that previously described from lymphoid cells. The analysis of the peptide pool confirmed that, as expected, the peptides from SK-Hep-1 derive from proteins localized in the same compartments as in lymphoid cells. Within this pool, we have identified 12 HLA class I peptides derived from HCC-related proteins. This confirms that tumor cell lines could be a good source of tumor associated antigens to be used, together with MS, to define putative epitopes for cytotoxic T cells from cancer patients.