The information geometric descriptions of denormalized thermodynamic manifolds.
The irrelevant information principle for collective probabilistic reasoning
Within the framework of discrete probabilistic uncertain reasoning a large literature exists justifying the maximum entropy inference process, , as being optimal in the context of a single agent whose subjective probabilistic knowledge base is consistent. In particular Paris and Vencovská completely characterised the inference process by means of an attractive set of axioms which an inference process should satisfy. More recently the second author extended the Paris-Vencovská axiomatic approach...
The logic of neural networks.
This paper establishes the equivalence between multilayer feedforward networks and linear combinations of Lukasiewicz propositions. In this sense, multilayer forward networks have a logic interpretation, which should permit to apply logical techniques in the neural networks framework.
The Logogryph of Euler.
The Mathieu group and its pseudogroup extension .
The multidimensional -transform and its use in solution of partial difference equations
The mutual information estimation in the sampling with replacement
The mutual information. Estimation in the sampling without replacement
The noncommutative Hilbert transform approach to free entropy
The Nonexistence of [132, 6, 86]3 Codes and [135, 6, 88]3 Codes
We prove the nonexistence of [g3(6, d), 6, d]3 codes for d = 86, 87, 88, where g3(k, d) = ∑⌈d/3i⌉ and i=0 ... k−1. This determines n3(6, d) for d = 86, 87, 88, where nq(k, d) is the minimum length n for which an [n, k, d]q code exists.
The Nonexistence of some Griesmer Arcs in PG(4, 5)
In this paper, we prove the nonexistence of arcs with parameters (232, 48) and (233, 48) in PG(4,5). This rules out the existence of linear codes with parameters [232,5,184] and [233,5,185] over the field with five elements and improves two instances in the recent tables by Maruta, Shinohara and Kikui of optimal codes of dimension 5 over F5.
The number of inequivalent optimal covering codes.
The Number of Non-Isomorphic Hamiltonian Circuits in an -Dimensional Cube
The Number of Steps in a Finite Jacobi Algorithm.
The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
A concept of an Orderly Colored Longest Path (OCLP) refers to the problem of finding the longest path in a graph whose edges are colored with a given number of colors, under the constraint that the path follows a predefined order of colors. The problem has not been widely studied in the previous literature, especially for more than two colors in the color arrangement sequence. The recent and relevant application of OCLP is related to the interpretation of Nuclear Magnetic Resonance experiments for...
The Paley-Wiener-Levinson theorem revisited.
The partial inner product space method: a quick overview.
The performance analysis of the adaptive two-stage DFB narrowband interference suppression filter in DSSS receiver
The Placement of Electronic Circuits Problem: A Neural Network Approach
The goal of this paper is to apply the Continuous Hopfield Networks (CHN) to the Placement of Electronic Circuit Problem (PECP). This assignment problem has been expressed as Quadratic Knapsack Problem (QKP). To solve the PECP via the CHN, we choose an energy function which ensures an appropriate balance between minimization of the cost function and simultaneous satisfaction of the PECP constraints. In addition, the parameters of this function must...
The present and future of signal processing