scholarly journals A Fast Procedure for Outlier Diagnostics in Large Regression Problems

1999 ◽  
Vol 94 (446) ◽  
pp. 434 ◽  
Author(s):  
Daniel Pena ◽  
Victor Yohai
2020 ◽  
Vol 16 (5) ◽  
pp. 793-804
Author(s):  
Naimeh Mahheidari ◽  
Jamal Rashidiani ◽  
Hamid Kooshki ◽  
Khadijeh Eskandari

Background: Today, nanoparticles hold great promise in biomedical researches and applications including bacteria detection. The rapid and sensitive outcomes of bacteria detection strategies using nanoparticle conjugates become determinative, especially in bacterial outbreaks. In the current research, we focused on detecting V. cholera bacteria and its toxin using a thiocyanate/Au nanoparticle. Thiocyanate adsorbed strongly on the surface of gold nanoparticles and changed the surface by enhancing surface plasmon resonance of gold nanoparticles. Objective: This method is tried to introduce a simple and fast procedure to assay vibrio cholera. So, it is observed by the naked eyes as well. Methods: We used two antibodies (Ab) for V. cholera detection: a) a primary antibody conjugated to magnetic nanoparticles (MNPs) for trapping V. cholera bacterial cells, and b) a secondary Abconjugated thiocyanate-GNPs as a colorimetric detector. Then, an immuno-magnetic separation system connected to a colorimetric assay was designed based on the GNPs. The results were measured by ultraviolet-visible (UV-Vis) spectroscopy. Results: The results showed that gold nanoparticles are an appropriate optical assay for detecting biological samples in a minimum concentration and also it can be easily seen by the naked eyes. The linear range of this biosensor is 3.2×104 to 28×104 cells per ml. Conclusion: In this research, a colorimetric immune assay based on gold nanoparticles was designed to improve the sensitivity of V. cholera detection. Also, this method can be used for the detection of other biological agents.


2009 ◽  
Vol 18 (05) ◽  
pp. 757-781 ◽  
Author(s):  
CÉSAR L. ALONSO ◽  
JOSÉ LUIS MONTAÑA ◽  
JORGE PUENTE ◽  
CRUZ ENRIQUE BORGES

Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.


Sign in / Sign up

Export Citation Format

Share Document