The hyperset approach to WEB-like or semistructured databases is outlined. WDB is presented either (i) as a finite edge-labelled graph or, equivalently, (ii) as system of (hyper)set equations or (iii) in a special XML-WDB format convenient both for distributed WDB and for including arbitrary XML elements in this framework. The current state of affairs on experimental implementation of a query l...

We present an analog VLSI cellular architecture implementing a simplified version of the Boundary Contour System (BCS) for real-time image processing. Inspired by neuromorphic models across several layers of visual cortex, the design integrates in each pixel the functions of simple cells, complex cells, hyper-complex cells, and bipole cells, in three orientations interconnected on a hexagonal g...

Order-Preserving DAG Grammars (OPDGs) is a subclass of Hyper-Edge Replacement Grammars that can be parsed in polynomial time. Their associated class of languages is known as Ordered DAG Languages, and the graphs they generate are characterised by being acyclic, rooted, and having a natural order on their nodes. OPDGs are useful in natural-language processing to model abstract meaning representa...

The Web can be seen as a graph in which every page is a node, and every hyper-link between two pages is an edge. This Web graph forms a scale-free network: a graph in which the distribution of the degree of the nodes is very skewed. This graph is also self-similar, in terms that a small part of the graph shares most properties with the entire graph. This paper compares the characteristics of se...

The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyper edge set of a hypergraph H , by defining a vertex-hyperedge correspondence. This allows us to recover the...

The talk deals with combinatorial problems concerning colorings of non-uniform hyper-graphs. Let H = (V, E) be a hypergraph with minimum edge-cardinality n. We show that if H is a simple hypergraph (i.e. every two distinct edges have at most one common vertex) and e∈E r 1−|e| c √ n, for some absolute constant c > 0, then H is r-colorable. We also obtain a stronger result for triangle-free simpl...

In this paper rst we dene the notions of positive implicativehyper MV -ideals of types 1,2,3 and 4 in hyper MV -algebras and we investigatethe relationship between of them . Then by some examples we show that thesenotions are not equivalent. Finally we give some relations between these notionsand the notions of (weak) hyper MV -ideals and (weak) hyper MV -deductivesystems of hyper MV -algebras.

In this paper, hyper-Fibonacci and hyper-Lucas polynomials are defined some of their algebraic combinatorial properties such as the recurrence relations, summation formulas, generating functions presented. addition, relationships between given.

Abstract. In this communication the problem of transforming equilibrium equations from Eulerian to Lagrangian form is discussed with reference materials governed by second-gradient energy densities. particular, novel theoretical achievements are outlined, which represent intermediate steps attain purpose: transformation edge vectors and complementary orthogonal projectors over boundary surface;...

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...