Results 161 to 170 of about 634 (212)

A State‐Adaptive Koopman Control Framework for Real‐Time Deformable Tool Manipulation in Robotic Environmental Swabbing

open access: yesAdvanced Robotics Research, EarlyView.
This work presents a state‐adaptive Koopman linear quadratic regulator framework for real‐time manipulation of a deformable swab tool in robotic environmental sampling. By combining Koopman linearization, tactile sensing, and centroid‐based force regulation, the system maintains stable contact forces and high coverage across flat and inclined surfaces.
Siavash Mahmoudi   +2 more
wiley   +1 more source

Multimodal Engagement Assessment in Children During Invented Story Paradigm With a Social Robot

open access: yesAdvanced Robotics Research, EarlyView.
A multimodal framework is proposed to assess children's engagement during storytelling interactions with a social robot. Gaze, physiological, and behavioral data are combined and validated against observer ratings. An automated gaze‐labeling strategy is introduced, and supervised classifiers achieve high accuracy. The study supports scalable engagement
Laura Fiorini   +7 more
wiley   +1 more source

ChicGrasp: Imitation‐Learning‐Based Customized Dual‐Jaw Gripper Control for Manipulation of Delicate, Irregular Bio‐Products

open access: yesAdvanced Robotics Research, EarlyView.
Automated poultry processing lines still rely on humans to lift slippery, easily bruised carcasses onto a shackle conveyor. Deformability, anatomical variance, and hygiene rules make conventional suction and scripted motions unreliable. We present ChicGrasp, an end‐to‐end hardware‐software co‐designed imitation learning framework, to offer a ...
Amirreza Davar   +8 more
wiley   +1 more source

Error Correcting Network Codes

Computer Networks, 2021
Abstract Network coding (NC) is a novel forwarding technique that promise to change many aspects of networking. However, the error propagation problem in NC resulting from the encoding on the Network layer makes the error-correcting process performed classically on the Physical layer very expensive in terms of computational resources, especially when
Mohamed Amine Belhamra, El Mamoun Souidi
openaire   +1 more source

Error-Correcting Codes for Flash Coding

IEEE Transactions on Information Theory, 2011
Flash memory is a non-volatile computer storage device which consists of blocks of cells. While increasing the voltage level of a single cell is fast and simple, reducing the level of a cell requires the erasing of the entire block containing the cell. Since block-erasures are costly, traditional flash coding schemes have been developed to maximize the
Qin Huang 0002   +2 more
openaire   +1 more source

Error-correcting WOM-codes

IEEE Transactions on Information Theory, 1991
A problem raised by R.L. Rivest and A. Shamir (1982), namely, constructing write-once-memory (WOM) codes capable of error correction, is considered. The authors call a (n,m,t)-WOM code a scheme that allows t successive writings of m arbitrary bits (i.e., one message among 2/sup m/) on a WOM of size n.
Gilles Zémor, Gérard D. Cohen
openaire   +1 more source

Error-correcting codes for correcting bursts of errors

Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1960
In data transmission systems that are subject to noise, it is found that errors do not occur randomly but in bursts. Consequently, much interest has centered lately on the problem of constructing suitable error-correcting codes.
openaire   +2 more sources

Error correcting coding for OTN

IEEE Communications Magazine, 2010
Forward error correction codes for 100 Gb/s optical transmission are currently receiving much attention from transport network operators and technology providers. We discuss the performance of hard decision decoding using product type codes that cover a single OTN frame or a small number of such frames.
Jørn Justesen   +2 more
openaire   +1 more source

A Bound for Error-Correcting Codes

IBM Journal of Research and Development, 1960
This paper gives two new bounds for the code word length n which is required to obtain a binary group code of order 2k with mutual distance d between code words. These bounds are compared with previously known bounds, and are shown to improve upon them for certain ranges of k and d. Values of k and d are given for which one of these bounds can actually
openaire   +1 more source

Error Detecting and Error Correcting Codes

Bell System Technical Journal, 1950
The author was led to the study given in this paper from a consideration of large scale computing machines in which a large number of operations must be performed without a single error in the end result. This problem of “doing things right” on a large scale is not essentially new; in a telephone central office, for example, a very large number of ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy