Finger braille is one of the communication methods for the deaf blind. The fingers of the deaf blind are regarded as keys of a brailler. Finger braille seems to be the most suited medium for real-time communication and for expressing the feelings of a speaker. We are trying to develop a finger braille receiver for teletext broadcasting system which will help the deaf blind to use current mass m...

Landmark-based navigation of autonomous mobile robots require the integration of observations from sensors over time. This paper shows that Dempster's rule of combination is not appropriate for this domain. An alternative rule of combination for Shafer belief functions is derived, which adapts the belief updating process based on a contextual weighting parameter, n. n is a function of the expec...

{ Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. A major problem impeding the use of rule-based expert systems in real-time environments is the diiculty in predicting the response time of these rule-based systems. In this paper, we tackle this problem with a fast, partially parallelizable response tim...

We estimate a monetary policy rule for the US allowing for possible frequency dependence i.e., allowing the central bank to respond differently to persistent innovations than to transitory innovations, in both the real-time unemployment rate and the real-time inflation rate. The method is flexible, and requires no strong a priori assumptions on the pattern of frequency dependence or on the natu...

Rule-Based Forecasting (RBF) is an expert system that uses judgment to develop and apply rules for combining extrapolations. The judgment comes from two sources, forecasting expertise and domain knowledge. Forecasting expertise is based on more than a half century of research. Domain knowledge is obtained in a structured way; one example of domain knowledge is managers= expectations about trend...

We present a framework for the automated verification of time and communication requirements in systems of distributed rule-based reasoning agents which allows us to determine how many rule-firing cycles are required to solve the problem, how many messages must be exchanged, and the trade-offs between the time and communication resources. We extend CTL∗ with belief and communication modalities ...

We consider the Pm||Cmax scheduling problem where the goal is to schedule n jobs on m identical parallel machines to minimize makespan. We revisit the famous Longest Processing Time (LPT ) rule proposed by Graham in 1969. LPT requires to sort jobs in non-ascending order of processing times and then to assign one job at a time to the machine whose load is smallest so far. We provide new insights...