✦ LIBER ✦

Real-time optical line detection

✍ Scribed by George Eichmann; Yao Li

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 285 KB
Volume: 63
Category: Article
ISSN: 0030-4018
DOI: 10.1016/0030-4018(87)90345-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Real-Time Quantized Optical Flow

✍ Ted Camus 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 749 KB

Real time optical logic processing

✍ Xiangyang Yang; Kuo-fan Chin; Minxian Wu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 255 KB

On-line real-time detection method for t

On-line real-time detection method for trace Cl− in aqueous solution

✍ Akyhiro Iwata; Chiyoe Yamanaka; Nobuaki Nakashima; Yasukazu Izawa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 372 KB

An on-line real-time detection method for Clin aqueous solution was developed in which the concentration of Clwas determined by measuring the absorbances of Cl -, eand Cl 2which were formed by ArF laser irradiation . A linear relationship between absorbance and concentration was confirmed . The cal

An algorithm for on-line, real-time comp

An algorithm for on-line, real-time computer detection of ECG changes

✍ C.E. Burton; W.M. Portnoy; H. Dirilten 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 531 KB

Real-Time Optical Arithmetic/Logical Pro

Real-Time Optical Arithmetic/Logical Processing

✍ M.S. Alam; M.A. Karim 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 621 KB

An efficient technique for performing arithmetic operations using a joint transform correlator is presented. This technique produces significantly better results than those from the previously reported techniques. 1993 Academic Press. Inc.

On-Line Routing of Real-Time Messages

✍ Joseph Y-T. Leung; Tommy W. Tam; Gilbert H. Young 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The problem of routing unit-length, real-time messages in a distributed system is considered. An on-line routing algorithm is one that routes messages without any knowledge of future arrivals of messages. An on-line algorithm is said to be optimal if it produces a feasible route whenever one exists.