A neural net based development of multi-adjoint logic programming is presented. Transformation rules carry programs into neural networks, where truth-values of rules relate to output of neurons, truth-values of facts represent input, and network functions are determined by a set of general operators; the output of the net being the values of propositional variables under its minimal model. Some...

The procedural semantics of multi-adjoint logic programming is used for providing a model-theoretic semantics for a data model. A translation method for deductive logic databases is presented for obtaining a relational algebra with classical projection and enriched parametric join operator with aggregations. The use of non-commutative conjunctors allows for a model of different degrees of granu...

The structure of the paper is as follows. In Section 2, we introduce the preliminary concepts necessary for the definition of the syntax and semantics of sorted multi-adjoint logic programs, presented in Section 3. In Section 4, we state the basic results regarding the termination properties of our semantics, which are extended later in Section 5. The paper finishes with some conclusions and po...

Common velocity analysis is based on the invariance of migrated images with respect to the experiment index (shot number, plane-wave take-off angle, etc.) or extension parameters (reflection angle, correlation lags in extended images, etc.). All the information available, i.e. the entire survey, is used for assessing the quality of the model used for imaging. This approach is effective but forc...

Let AA A A be a triangle with vertices at A1, A2 and A3. The process of "bisecting AA A A is defined as follows. We first locate the longest edge, A'Ai+i of AA 1A2A3 where A'+3 = Al, set D = (A' + Ai+l)/2, and then define two new triangles, AA'DAi+2 and ADAi+1Ai+2. Let Aqq be a given triangle, with smallest interior angle a > 0. Bisect AQ0 into two new triangles, Aj., í = 1, 2. Next, bisect eac...

We show that every K4-free planar graph with at most ν edge-disjoint triangles contains a set of at most 32ν edges whose removal makes the graph triangle-free. Moreover, equality is attained only when G is the edge-disjoint union of 5-wheels plus possibly some edges that are not in triangles. We also show that the same statement is true if instead of planar graphs we consider the class of graph...

This paper deals with the application of the adjoint transport theory in order to optimize Monte Carlo based radiotherapy treatment planning. The technique is applied to Boron Neutron Capture Therapy where most often mixed beams of neutrons and gammas are involved. In normal forward Monte Carlo simulations the particles start at a source and lose energy as they travel towards the region of inte...

We have shown previously that the precision of angle judgments depends strongly on the global stimulus configuration: discrimination thresholds for angles that form part of isosceles triangles are up to 3 times lower than for those that form part of scalene triangles [Kennedy, G. J., Orbach, H. S., & Loffler, G. (2006). Effects of global shape on angle discrimination. VisionResearch, 46(8-9), 1...

In this note we introduce a new randomized algorithm for counting triangles in graphs. We show that under mild conditions, the estimate of our algorithm is strongly concentrated around the true number of triangles. Specifically, if p ≥ max ( log n t , log n √ t ), where n, t, ∆ denote the number of vertices in G, the number of triangles in G, the maximum number of triangles an edge of G is cont...

Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as positive integer entries. For a fixed triple product of weights, these generalised Berenstein-Zelevinsky triangles span a lattice in which one may move by adding integer linear combinations of so-called virtual...