There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

The organization of behavior: A neuropsychological theory

The Personal Interview

What is modal logic

IEEE transactions on computer-aided design of integrated circuits and systems : a publication of the IEEE Circuits and Systems Society

Future social robot and robot actor should have natural, interesting and unique motions and facial gestures. Creating such motions is very difficult and time consuming for the animator. The concept of expressing social robot motions and behaviors using algebraic expressions is discussed. We present representation of behaviors at the lowest levels e.g. vectors of joint angles. Mathematical formalism of the framework is outlined and the role of probabilistic behaviors is stressed. Several examples illustrate these ideas using our language REBeL and a humanoid robot Mr. Jeeves created by us.

Behavior Expressions for Social and Entertainment Robots

A new concept in visual simulation, the systolic arrays graphical simulator (SAGS), is presented. It allows for the visualization of the data and control flow in various systolic arrays on the monitor screen. The systolic architecture is constructed interactively from various basic cells and arrays. The simulator has successfully been used to simulate several well-known and new architectures and has even proven itself to be useful in finding and correcting an error in a well-publicized algorithm for general-purpose matrix computations that is currently being realized in hardware and can have potential applications that require extreme reliability. >

Real time graphical simulation of systolic arrays

https://www.techscience.com/cmc/v70n3/44966/pdf

Novel Quantum Algorithms to Minimize Switching Functions Based on Graph Partitions

Two methods of decomposition of probabilistic relations are presented in this paper. They consist of splitting relations (blocks) into pairs of smaller blocks related to each other by new variables generated in such a way so as to minimize a cost function which depends on the size and structure of the result. The decomposition is repeated iteratively until a stopping criterion is met. Topology and contents of the resulting structure develop dynamically in the decomposition process and reflect relationships hidden in the data.

/pdf/multi-level-decomposition-of-probabilistic-relations-1fwb7ie83m.pdf

Multi‐level decomposition of probabilistic relations

This paper presents a novel machine learning algorithm with an improved accuracy and a faster learning curve, for very large datasets. Previously, an algorithm using lr-partitions was designed to improve upon C4.5. However, this algorithm has a relatively high percentage of undefined combinations of attribute values in its final results, increasing the learning error. In this paper, a new type of clustering algorithm was proposed to generate output values for those undefined combinations, thus accelerating the learning curve and reducing the prediction error by several percentage points on various popular datasets from the UCI Machine Learning Database.

Marek Perkowski

Papers

Behavior Expressions for Social and Entertainment Robots

Real time graphical simulation of systolic arrays

Novel Quantum Algorithms to Minimize Switching Functions Based on Graph Partitions

Multi‐level decomposition of probabilistic relations

A Novel Machine Learning Algorithm to Reduce Prediction Error and Accelerate Learning Curve for Very Large Datasets