A Curve Intersection Algorithm with Processing of Singular Cases: Introduction of a Clipping Technique

Author(s):  
Marc Daniel
Author(s):  
Mahmoud Zaki Iskandarani

A new approach to detection of the existence of unwanted odors after spraying the smart home and vehicular environment with perfumes is considered in the work. The approach is based on registering the response curve of an array of sensors to perfumes and to odors such as herbs, then using the proposed intersection algorithm to uncover the ability of the perfume to mask specific odors. Three odors (herbs) and three perfumes are tried and resulted in the ability of perfumes to mask two of the herbs, one deeper than the other. The response curve intersection technique (RCIT) provides the ability to unmask unwanted odor existence, thus forms the heart of the unmasking odor algorithms (UOA). Mathematical equations are used to prove the concept with digital logic is further used to support the presented algorithm. The research found that using the proposed technique, an odor masked by spraying of perfumes can be unmasked using the RCIT as the case in herb 3 presented in the work. The work also showed the unique curve shape for both perfumes and herbs and the fact that some herbs can be easily masked and hidden within the response of perfumes. In addition, it is shown that the perfumes response is much more complex compared to herbs


2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Arun Kumar ◽  
Hemant Rathore

AbstractIn this research study, different Peak Average Power Ratio (PAPR) based reduction techniques, namely, A-Law companding, µ-Law companding, Clipping & Filtering and Clipping are analyzed for Filter Band Multi-Carrier (FBMC) with different transmission systems such as Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), 64-QPSK and 64-Quadrature Amplitude Modulation. It is estimated that the PAPR reduction can benefit by using clipping technique in FBMC.


2019 ◽  
Vol 17 (4) ◽  
pp. 382-388
Author(s):  
Eui Hyun Kim ◽  
Ju Hyung Moon ◽  
Sun Ho Kim

Abstract BACKGROUND During transsphenoidal surgery (TSS) for a pituitary adenoma with a large suprasellar extension, cerebrospinal fluid (CSF) leakage commonly develops from a defect in the arachnoid recess or the arachnoid membrane. OBJECTIVE To evaluate the usefulness of a newly developed clipping technique for the repair of intraoperative CSF leakage. METHODS Between September 2012 and November 2016, 698 patients with pituitary adenoma were operated on with TSS. Intraoperative CSF leakage was encountered in 301 patients (43.1%). The clipping technique was used to repair CSF leakage in 144 patients: from the arachnoid recess in 100 patients and from the arachnoid membrane in 44 patients. The clipping technique used titanium clips and a newly designed clip applier. We evaluated anterior pituitary function of the patients whose CSF leakage was closed by clipping, and compared this with function in another patient group treated with different repair techniques. RESULTS We successfully applied clip technique in 140 out of 144 patients. This clipping technique was faster and easier for repairing CSF leakage than our previously published suture technique. In our early series, 4 patients developed unexpected CSF rhinorrhea after TSS. We found no difference in anterior pituitary function between a clipping group and others. Although titanium clip was identified on postoperative MRI, its metallic scattered artifact was very minimal and did not hinder the detection of possible remnant and recurrent tumors. CONCLUSION This clipping technique is a very simple and reliable method for repairing intraoperative CSF leakage when properly applied with caution.


Author(s):  
Robert L. Williams ◽  
Noah Needler

A novel simplified analytical three-spheres intersection algorithm is presented for use with forward pose kinematics solutions of a four-cable-suspended robot (the method is applicable to various other cable-suspended robots with equal pole heights and three cables intersecting in one point). It is required that the vertical center heights of all three spheres are equal (otherwise one can use the existing more-complicated algorithm). We derive this new algorithm and show that the multiple solutions, algorithmic singularity, and imaginary solutions do not cause any trouble in practical implementation. The algorithmic singularity of the original three-spheres intersection algorithm regarding equal Z heights is eliminated with the new algorithm. The new algorithm requires significantly less computation compared with the original algorithm. Examples are presented to demonstrate the new three-spheres intersection algorithm for a 4-cable robot.


2016 ◽  
Vol 48 ◽  
pp. 1-16 ◽  
Author(s):  
Jingjing Shen ◽  
Laurent Busé ◽  
Pierre Alliez ◽  
Neil Dodgson

2006 ◽  
Vol 43 (2) ◽  
pp. 151-175 ◽  
Author(s):  
Dario A. Bini ◽  
Ana Marco

Sign in / Sign up

Export Citation Format

Share Document