Transformer-type inductive conductivity sensors (TICS) are the industry standard for long-term measurement in fluids. This paper analyzes potential of TICS as a low-cost alternative to cost-effective type cells by an implementation with reduced complexity. Sensor characteristics and performance comparison high precision sensor described study. Linearity hysteresis error measurement, reproducibi...

Capacitive and inductive crosstalk noises are expected to be more serious in advanced technologies. However, capacitive and inductive crosstalk noises in the future have not been concurrently and sufficiently discussed quantitatively, though capacitive crosstalk noise has been intensively studied solely as a primary factor of interconnect delay variation. This paper quantitatively predicts the ...

Geographic information fusion is the process of integrating geographic information from diverse sources to produce new information with added value, reliability, or usefulness (cf. [14,67]). Geographic information fusion is an important function of interoperable and web-based GIS. Increased reliance on distributed web-based access to geographic information is correspondingly increasing the need...

Today’s advanced Reinforcement Learning algorithms produce black-box policies, that are often difficult to interpret and trust for a person. We introduce policy distilling algorithm, building on the CN2 rule mining distills into rule-based decision system. At core of our approach is fact an RL process does not just learn policy, mapping from states actions, but also produces extra meta-informat...

Local Constructive Set Theory (LCST) is intended to be a local version of constructive set theory (CST). Constructive Set Theory is an open-ended set theoretical setting for constructive mathematics that is not committed to any particular brand of constructive mathematics and, by avoiding any built-in choice principles, is also acceptable in topos mathematics, the mathematics that can be carrie...

In an earlier paper, Kinber and Stephan posed an open problem about whether every class of languages, which can be identified strong monotonically, can also be identified by a setdriven machine. We solve this question in this paper. The answer to the question depends on whether the machines are required to be total or not! The solution of this result uncovers a finer gradation of the notion of ...