The notion of a (closed) double-framed soft ideal (briefly, a (closed) DFS-ideal) in BCK/BCI-algebras is introduced, and related properties are investigated. Several examples are provided. The relation between a DFS-algebra and a DFS-ideal is considered, and characterizations of a (closed) DFS-ideal are established. A new DFS-ideal from old one is constructed, and we show that the int-uni DFS-s...

We transform a propositional Prolog program P into a set of propositional formulas prl(P ) and show that Prolog, using its depth-first left-to-right search, is sound and complete with respect to prl(P ). This means that a goal succeeds in Prolog if and only if it follows from prl(P ) in classical propositional logic. The generalization of prl(P ) to predicate logic leads to a system for which P...

Saliency detection is an active topic in multimedia field. Several algorithms have been proposed in this field. Most previous works on saliency detection focus on 2D images. However, for some complex situations which contain multiple objects or complex background, they are not robust and their performances are not satisfied. Recently, 3D visual information supplies a powerful cue for saliency d...

Foraminifera are single-celled organisms with internal calcerous shells, known as tests. The image above shows a shell with a planispiral chamber arrangement — during growth, chambers are added sequentially to form a coil in a flat spiral. Foraminiferan tests are quite diverse. The image shown here came from a study on the nature of the material in the calcerous test and how the foraminifera de...

Mount points" allow more storage to be grafted into tree-structured hierarchical file systems. Administrative tasks use their 10~ltionS, which are tabulated in a file. In our System V U~IX environment, this file was occasionally removed. Getmnt was written to recover the information. Getmnt has had three significant versions. The original version (getmntl) was a highly optimized naive tree trav...

Rare itemsets are an important sort of patterns that have a wide range of practical applications. Although mining rare patterns poses specific algorithmic problems, it is yet insufficiently studied. In a previous work, we proposed a levelwise approach for rare itemset mining. Here, we examine the benefits of depth-first methods for that task as such methods are known to outperform the levelwise...

The enumeration of pseudo-intents is a long-standing problem in which the order plays a major role. In this paper, we present new algorithms that enumerate pseudo-intents in orders that do not necessarily respect the inclusion relation. We show that, confirming established results, this enumeration is equivalent to computing minimal transversals in hypergraphs a bounded number of times.

On-line balancing of mass and energy in a large-scale plant is a feasible operation given the development state of the current data-acquisition systems. However, not all data are available in real time and the programmed version of the instrumentation flow sheets in form of a graph cannot be used directly. They need to be modified so as to match the available information. Two cases are discusse...

The paper evaluates the power of best-first search over AND/OR search spaces for solving the Most Probable Explanation (MPE) task in Bayesian networks. The main virtue of the AND/OR representation of the search space is its sensitivity to the structure of the problem, which can translate into significant time savings. In recent years depth-first AND/OR Branch-andBound algorithms were shown to b...

ADOPT and BnB-ADOPT are two optimal DCOP search algorithms that are similar except for their search strategies: the former uses best-first search and the latter uses depth-first branch-and-bound search. In this paper, we present a new algorithm, called ADOPT(k), that generalizes them. Its behavior depends on the k parameter. It behaves like ADOPT when k = 1, like BnB-ADOPT when k = ∞ and like a...