Lindex: a lattice-based index for graph databases

Subgraph querying has wide applications in various fields such as cheminformatics and bioinformatics. Given a query graph, q, a subgraph-querying algorithm retrieves all graphs, D(q), which have q as a subgraph, from a graph database, D. Subgraph querying is costly because it uses subgraph isomorphism tests, which are NP-complete. Graph indices are commonly used to improve the performance of subgraph querying in graph databases. Subgraph-querying algorithms first construct a candidate answer set by filtering out a set of false answers and then verify each candidate graph using subgraph isomorphism tests. To build graph indices, various kinds of substructure (subgraph, subtree, or path) features have been proposed with the goal of maximizing the filtering rate. Each of them works with a specifically designed index structure, for example, discriminative and frequent subgraph features work with gIndex, δ-TCFG features work with FG-index, etc. We propose Lindex, a graph index, which indexes subgraphs contained in database graphs. Nodes in Lindex represent key-value pairs where the key is a subgraph in a database and the value is a list of database graphs containing the key. We propose two heuristics that are used in the construction of Lindex that allows us to determine answers to subgraph queries conducting less subgraph isomorphism tests. Consequently, Lindex improves subgraph-querying efficiency. In addition, Lindex is compatible with any choice of features. Empirically, we demonstrate that Lindex used in conjunction with subgraph indexing features proposed in previous works outperforms other specifically designed index structures. As a novel index structure, Lindex (1) is effective in filtering false graphs (2) provides fast index lookups, (3) is fast with respect to index construction and maintenance, and (4) can be constructed using any set of substructure index features. These four properties result in a fast and scalable subgraph-querying infrastructure. We substantiate the benefits of Lindex and its disk-resident variation Lindex+ theoretically and empirically.     

Automated analysis of images in documents for intelligent document search

Authors use images to present a wide variety of important information in documents. For example, two-dimensional (2-D) plots display important data in scientific publications. Often, end-users seek to extract this data and convert it into a machine-processible form so that the data can be analyzed automatically or compared with other existing data. Existing document data extraction tools are semi-automatic and require users to provide metadata and interactively extract the data. In this paper, we describe a system that extracts data from documents fully automatically, completely eliminating the need for human intervention. The system uses a supervised learning-based algorithm to classify figures in digital documents into five classes: photographs, 2-D plots, 3-D plots, diagrams, and others. Then, an integrated algorithm is used to extract numerical data from data points and lines in the 2-D plot images along with the axes and their labels, the data symbols in the figure’s legend and their associated labels. We demonstrate that the proposed system and its component algorithms are effective via an empirical evaluation. Our data extraction system has the potential to be a vital component in high volume digital libraries.     

A comprehensive survey of industry practice in real-time systems

Real-Time Systems - This paper presents results and observations from a survey of 120 industry practitioners in the field of real-time embedded systems. The survey provides insights into the...     

Microblogs recommendations based on implicit similarity in content social networks

With the development of online social networking applications, microblogs have become a necessary online communication network in daily life. Users are interested in obtaining personalized recommendations related to their tastes and needs. In some microblog systems, tags are not available, or the use of tags is rare. In addition, user-specified social relations are extremely rare. Hence, sparsity is a problem in microblog systems. To address this problem, we propose a new framework called Pblog to alleviate sparsity. Pblog identifies users’ interests via their microblogs and social relations and computes implicit similarity among users using a new algorithm. The experimental results indicated that the use of this algorithm can improve the results. In online social networks, such as Twitter, the number of microblogs in the system is high, and it is constantly increasing. Therefore, providing personalized recommendations to target users requires considerable time. To address this problem, the Pblog framework groups similar users using the analytic hierarchy process (AHP) method. Then, Pblog prunes microblogs of the target user group and recommends microblogs with higher ratings to the target user. In the experimental results section, the Pblog framework was compared with several other frameworks. All of these frameworks were run on two datasets: Twitter and Tumblr. Based on the results of these comparisons, the Pblog framework provides more appropriate recommendations to the target user than previous frameworks.

     

Numerical investigation of the configuration of the pools on the flow pattern passing over pooled stepped spillway in skimming flow regime

Spillways are hydraulic structures which transfer water to the downstream. Stepped spillways areseriously attended to, since they are highly efficient regarding energy dissipation. In this study, the flow pattern over stepped spillways was simulated with five different pool configurations. The VOF method was used to simulate the flow free surface, and K??(RNG) was employed to model turbulence. The results obtained fromthe numerical model were fairly consistent with the experimental results. The results demonstrated that theflow velocity and the residual head showed significant differences in the spillway width with regard to different pool configurations. The pool configuration in which the pools were installed as staggered configuration of flat and pooled steps showed the least residual head at the downstream and as a result the greatest energy dissipation.     

Design by framework completion

An object-oriented framework in essence defines an architecture for a family of applications or subsystems in a given domain. Every application in the family obeys these architectural restrictions. Such frameworks are typically delivered as collections of inter-dependent abstract classes, together with their concrete subclasses. The abstract classes and their interdependencies implicitly realize the architecture. Developing a new application reusing classes of a framework requires a thorough understanding of the framework architecture.We introduce an approach called Design by Framework Completion, in which an exemplar (an executable visual model for a minimal instantiation of the architecture) is used for documenting frameworks. We propose exploration of exemplars as a means for learning the architecture, following which new applications can be built by replacing selected pieces of the exemplar. For the piece to be replaced, the inheritance lattice around its class provides the space of alternatives, one of these classes may be suitably adapted (say, by sub-classing) to create the new replacement.Design by Framework Completion proposes a paradigm shift when designing in presence of reusable components: It enables a much simpler top-down approach for creating applications, as opposed to the prevalent search for components and assemble them bottom-up strategy. We believe that this paradigm shift is essential because components can only be fitted together if they all obey the same architectural rules that govern the framework.     

Genetic algorithms based robust frequency estimation of sinusoidal signals with stationary errors

In this paper, we consider the fundamental problem of frequency estimation of multiple sinusoidal signals with stationary errors. We propose genetic algorithm and outlier-insensitive criterion function based technique for the frequency estimation problem. In the simulation studies and real life data analysis, it is observed that the proposed genetic algorithm based robust frequency estimators are able to resolve frequencies of the sinusoidal model with high degree of accuracy. Among the proposed methods, the genetic algorithm based least squares estimator, in the no-outlier scenario, provides efficient estimates, in the sense that their mean square errors attain the corresponding Cramér-Rao lower bounds. In the presence of outliers, the proposed robust methods perform quite well and seem to have a fairly high breakdown point with respect to level of outlier contamination. The proposed methods significantly do not depend on the initial guess values required for other iterative frequency estimation methods.     

SmartCanvas: Context‐inferred Interpretation of Sketches for Preparatory Design Studies

In early or preparatory design stages, an architect or designer sketches out rough ideas, not only about the object or structure being considered, but its relation to its spatial context. This is an iterative process, where the sketches are not only the primary means for testing and refining ideas, but also for communicating among a design team and to clients. Hence, sketching is the preferred media for artists and designers during the early stages of design, albeit with a major drawback: sketches are 2D and effects such as view perturbations or object movement are not supported, thereby inhibiting the design process. We present an interactive system that allows for the creation of a 3D abstraction of a designed space, built primarily by sketching in 2D within the context of an anchoring design or photograph. The system is progressive in the sense that the interpretations are refined as the user continues sketching. As a key technical enabler, we reformulate the sketch interpretation process as a selection optimization from a set of context‐generated canvas planes in order to retrieve a regular arrangement of planes. We demonstrate our system (available at http:/geometry.cs.ucl.ac.uk/projects/2016/smartcanvas/ ) with a wide range of sketches and design studies.