We propose a universal channel coding when each output distribution forms an exponential family even in a continuous output system. We propose two types of universal codes; One has the exponentially decreasing error with explicit a lower bound for the error exponent. The other attains the ǫ-capacity up to the second order. Our encoder is the same as the previous paper [CMP 289, 1087]. For our d...

Let us take a step back and suppose that information is transmitted over a discrete memoryless channel W with input and output alphabet X and output alphabet Y. The channel is defined by a stochastic matrix W . This means that a letter x ∈ X is received as y ∈ Y with probability wx,y = W (y|x) given by the corresponding entry of W . The term “stochastic matrix” means that its entries are betwee...

The objective of this study was to distinguish within a population of patients with known or suspected coronary artery disease groups at high and at low mortality rates. The study was based on Cleveland Clinic Foundation’s dataset of 9454 patients, of whom 312 died during an observation period of 9 years. The Logical Analysis of Data method was adapted to handle the disproportioned size of the ...

We explore the (dynamic) semantics of a simply typed-calculus enriched with parallel composition, dynamic channel generation, and input-output communication primitives. The calculus, called the k-calculus, can be regarded as the kernel of concurrent-functional languages such as LCS, CML and Facile, and it can be taken as a basis for the definition of abstract machines, the transformation of pro...