Dynamic arrays, also referred to as vectors, are fundamental data structures used in many programs. Modeling their semantics efficiently is crucial when reasoning about such programs. The theory of arrays is widely supported but is not ideal, ...

The concept of fractal propagation, through the deployment of computer numerical controlled devices, has been discussed in this paper. For experimentation purposes, four of the most well known fractal patterns namely, Sierpinski gasket, Barnsley ...

This paper examines the application of intelligent agents to guide and adapt instruction in a class of learning technologies known as adaptive instructional systems (AISs). AISs are artificially-intelligent, computer-based systems that guide ...

Relaxed Radix Balanced Trees (RRB-Trees) is one of the latest members in a family of persistent tree based data-structures that combine wide branching factors with simple and relatively flat structures. Like the battle-tested immutable sequences of ...

State-of-the-art immutable collections have wildly differing performance characteristics across their operations, often forcing programmers to choose different collection implementations for each task. Thus, changes to the program can invalidate the ...

This work describes a new approach to the mobile robot orientation in space and its obstacle determination. The method uses color beacons placed on the environmental objects for position determination. For obstacle detection the computer vision ...

The paper describes applying NLP algorithms to the ontology-based e-learning system. The main goal of the project is to develop a tool creating additional relations between entities based on internal analysis of object property values in the e-learning ...

This article concerns the algorithms of stereovision and visual odometry, which can be applied to solve a three-dimensional reconstruction problem through monocular vision and describes the basic stages of the system, advantages and disadvantages of the ...

Recommendation systems have become ubiquitous recently as they help to mitigate information overflow of the nowadays life. The vast majority of current recommendation system approaches are centralized. Although centralized recommendations have several ...

In this paper we address the problem of matching sets of vectors embedded in the same input space. We propose an approach which is motivated by canonical correlation analysis (CCA), a statistical technique which has proven successful in a wide variety ...

Evaluation metric is an essential and integral part of a ranking system. In the past, several evaluation metrics have been proposed in information retrieval and web search, among them Discounted Cumulative Gain (DCG) has emerged as one that is widely ...

The problem of learning conditional preference networks (CP-nets) from a set of examples has received great attention recently. However, because of the randomicity of the users' behaviors and the observation errors, there is always some noise making the ...

In data warehousing and OLAP applications, scalar-level predicates in SQL become increasingly inadequate to support a class of operations that require set-level comparison semantics, i.e., comparing a group of tuples with multiple values. Currently, ...

Energy efficiency has taken center stage in all aspects of computing, regardless of whether it is performed on a portable battery-powered device, a desktop PC, on servers in a data center, or on a supercomputer. It is expressed as performance-per-watt (...

In this paper, we investigate a market equilibrium in multichannel sharing cognitive radio networks (CRNs): it is assumed that every subchannel is orthogonally licensed to a single primary user (PU), and can be shared with multiple secondary users (SUs)...

Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. Yet, connectivity can be achieved over time and space, leading to evaluate a given route both in terms of topological length or ...

Some new classes of Hamming metric Gray codes over $(Z_p^n)$, where $(p)$ is a prime and $(n)$ is an integer power of 2, are described; then, how these Gray codes can be used to generate the maximum number of edge-disjoint Hamiltonian cycles in an $(n)$-...

Feature matching is a challenging problem at the heart of numerous computer graphics and computer vision applications. We present the SuperMatching algorithm for finding correspondences between two sets of features. It does so by considering triples or ...

File consistency maintenance in P2P systems is a technique for maintaining consistency between files and their replicas. Most previous consistency maintenance methods depend on either message spreading or structure-based pushing. Message spreading ...

Content distribution in vehicular networks, such as multimedia file sharing and software updates, poses a great challenge due to network dynamics and high-speed mobility. In recent years, network coding has been shown to efficiently support distribution ...