LIVIVO - Search results -

Search results

Result 1 - 10 of total 1350

Search options

Article ; Online: Development and preliminary validation of Nayak Autism Screening Instrument (NASI).

Nayak, Asmita / Khuntia, Rooplekha

2023 Volume 89, Page(s) 103777

Abstract: The study aims to develop and validate a video-based screening instrument for autism spectrum disorder that parents may use. Purposive sampling was used in all stages of this study to select distinct groups of participants in various stages such as ... ...

Abstract	The study aims to develop and validate a video-based screening instrument for autism spectrum disorder that parents may use. Purposive sampling was used in all stages of this study to select distinct groups of participants in various stages such as development, judgement quantifying, pretest with sentences, and pretest with videos. Parents in India can use the Nayak Autism Screening Instrument which consists of 24 2-dimensional animated videos on a scale of 1-4 and one descriptive item to identify behavioural indications of ASD in children between the ages of 3 and 10.
MeSH term(s)	Child ; Humans ; Child, Preschool ; Autistic Disorder/diagnosis ; Autism Spectrum Disorder/diagnosis ; Parents ; India
Language	English
Publishing date	2023-09-23
Publishing country	Netherlands
Document type	Journal Article
ZDB-ID	2456678-0
ISSN	1876-2026 ; 1876-2018
ISSN (online)	1876-2026
ISSN	1876-2018
DOI	10.1016/j.ajp.2023.103777
Database	MEDical Literature Analysis and Retrieval System OnLINE

Order via subito

This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

Article ; Online: Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem.

Nayak, Abhishek / Rathinam, Sivakumar

Sensors (Basel, Switzerland)

2023 Volume 23, Issue 14

Abstract: This paper addresses a MinMax variant of the Dubins multiple traveling salesman problem (mTSP). This routing problem arises naturally in mission planning applications involving fixed-wing unmanned vehicles and ground robots. We first formulate the ... ...

Abstract	This paper addresses a MinMax variant of the Dubins multiple traveling salesman problem (mTSP). This routing problem arises naturally in mission planning applications involving fixed-wing unmanned vehicles and ground robots. We first formulate the routing problem, referred to as the one-in-a-set Dubins mTSP problem (MD-GmTSP), as a mixed-integer linear program (MILP). We then develop heuristic-based search methods for the MD-GmTSP using tour construction algorithms to generate initial feasible solutions relatively fast and then improve on these solutions using variants of the variable neighborhood search (VNS) metaheuristic. Finally, we also explore a graph neural network to implicitly learn policies for the MD-GmTSP using a learning-based approach; specifically, we employ an S-sample batch reinforcement learning method on a shared graph neural network architecture and distributed policy networks to solve the MD-GMTSP. All the proposed algorithms are implemented on modified TSPLIB instances, and the performance of all the proposed algorithms is corroborated. The results show that learning based approaches work well for smaller sized instances, while the VNS based heuristics find the best solutions for larger instances.
Language	English
Publishing date	2023-07-15
Publishing country	Switzerland
Document type	Journal Article
ZDB-ID	2052857-7
ISSN	1424-8220 ; 1424-8220
ISSN (online)	1424-8220
ISSN	1424-8220
DOI	10.3390/s23146432
Database	MEDical Literature Analysis and Retrieval System OnLINE

Order via subito

Article: Development and Content Validation of a Measure to Assess the Parent-Child Social-emotional Reciprocity of Children with ASD.

Nayak, Asmita / Khuntia, Rooplekha

Indian journal of psychological medicine

2023 Volume 46, Issue 1, Page(s) 66–71

Abstract: Background: As no scales are currently available to assess the social-emotional reciprocity (SER) between children with autism spectrum disorder (ASD) and their parents, we aimed to develop a questionnaire for this.: Methods: Both quantitative and ... ...

Abstract	Background: As no scales are currently available to assess the social-emotional reciprocity (SER) between children with autism spectrum disorder (ASD) and their parents, we aimed to develop a questionnaire for this. Methods: Both quantitative and qualitative techniques were used for content validation. All stages of this study used purposive sampling to choose various groups of experts, mental health professionals, and parents of children with ASD to participate in the development, judgment-quantifying, and pretest stages. Data from 30 parents of children with ASD were gathered for the field test. Results: Thirty items were retained after content validation. The proportion of consensus regarding the comprehensiveness of the entire questionnaire was 1.00. The scale-level content validity index (CVI) by averaging calculation method and universal agreement calculation method were 0.95 and 0.50, respectively. Following the pretest, a total of 23 questions, on a five-point scale, were retained. Conclusion: Given the significance of SER between children with ASD and their parents, mental health practitioners should use this questionnaire to understand it to maximize the efficacy of any intervention.
Language	English
Publishing date	2023-12-08
Publishing country	United States
Document type	Journal Article
ZDB-ID	2622378-8
ISSN	0975-1564 ; 0253-7176
ISSN (online)	0975-1564
ISSN	0253-7176
DOI	10.1177/02537176231207763
Database	MEDical Literature Analysis and Retrieval System OnLINE

Order via subito

Article ; Online: Exploring the potential of jujube seed powder in polysaccharide based functional film: Characterization, properties and application in fruit preservation.

Nayak, Anamika / Mukherjee, Avik / Kumar, Santosh / Dutta, Debjani

International journal of biological macromolecules

2024 Volume 260, Issue Pt 1, Page(s) 129450

Abstract: In this study, we fabricated a novel biodegradable functional film using natural polysaccharides by adding jujube seed powder as an active ingredient. Scanning electron microscopy analysis showed agglomerate formation in the film with increasing ... ...

Abstract	In this study, we fabricated a novel biodegradable functional film using natural polysaccharides by adding jujube seed powder as an active ingredient. Scanning electron microscopy analysis showed agglomerate formation in the film with increasing concentration of seed powder. Fourier transform-infrared spectroscopy study demonstrated an electrostatic interaction between pectin and chitosan. The water solubility and swelling degree significantly decreased from 55.5 to 47.7 % and 66.0 to 41.9 %, respectively, depicting the film's water resistance properties. Higher opacity and lower transmittance value of the film indicated its protective effect towards light-induced oxidation of food. It was observed that the fabricated active film biodegraded to 82.33 % in 6 days. The DPPH radical scavenging activity of 98.02 % was observed for the functional film. The film showed antifungal activity against B. cinerea and P. chrysogenum. The highest zone of inhibition was obtained against food spoiling bacteria B. subtilis followed by S. aureus, P. aeruginosa and E. coli. Genotoxicity studies with the fabricated film showed a mitotic index of 8 % compared to 3 % in the control film. We used the fabricated film to preserve grapefruits, and the result showed that it could preserve grapes for ten days with an increase in antioxidant activity and polyphenolic content.
MeSH term(s)	Fruit ; Powders/pharmacology ; Food Packaging ; Staphylococcus aureus ; Escherichia coli ; Chitosan/chemistry ; Polysaccharides/pharmacology ; Water/pharmacology ; Pectins/pharmacology ; Plant Extracts ; Ziziphus
Chemical Substances	jujube extract ; Powders ; Chitosan (9012-76-4) ; Polysaccharides ; Water (059QF0KO0R) ; Pectins (89NA02M4RX) ; Plant Extracts
Language	English
Publishing date	2024-01-15
Publishing country	Netherlands
Document type	Journal Article
ZDB-ID	282732-3
ISSN	1879-0003 ; 0141-8130
ISSN (online)	1879-0003
ISSN	0141-8130
DOI	10.1016/j.ijbiomac.2024.129450
Database	MEDical Literature Analysis and Retrieval System OnLINE

In stock of ZB MED Cologne/Königswinter

Zs.B 2374: Show issues

Location:
Je nach Verfügbarkeit (siehe Angabe bei Bestand)
bis Jg. 2021: Bestellungen von Artikeln über das Online-Bestellformular
ab Jg. 2022: Lesesaal (EG)

Order via subito

Details ▾
- See ZB MED holdings
- Order with fees

Article ; Online: Recurrent disease after pediatric renal transplantation.

Nayak, Anjali / Ettenger, Robert / Wesseling-Perry, Katherine

Pediatric transplantation

2024 Volume 28, Issue 3, Page(s) e14676

Abstract: Background: Recurrent disease after kidney transplant remains an important cause of allograft failure, accounting for 7-8% of graft loss and ranking as the fifth most common cause of allograft loss in the pediatric population. Although the ... ...

Abstract	Background: Recurrent disease after kidney transplant remains an important cause of allograft failure, accounting for 7-8% of graft loss and ranking as the fifth most common cause of allograft loss in the pediatric population. Although the pathophysiology of many recurrent diseases is incompletely understood, recent advances in basic science and therapeutics are improving outcomes and changing the course of several of these conditions. Methods: Review of the literature. Results: We discuss the diagnosis and management of recurrent disease. Conclusion: We highlight new insights into the pathophysiology and treatment of post-transplant primary hyperoxaluria, focal segmental glomerulosclerosis, immune complex glomerulonephritis, C3 glomerulopathy, lupus nephritis, atypical hemolytic uremic syndrome, and IgA nephropathy.
MeSH term(s)	Humans ; Kidney Transplantation/adverse effects ; Recurrence ; Child ; Postoperative Complications/etiology ; Postoperative Complications/diagnosis ; Kidney Diseases/etiology ; Kidney Diseases/surgery
Language	English
Publishing date	2024-04-22
Publishing country	Denmark
Document type	Journal Article ; Review
ZDB-ID	1390284-2
ISSN	1399-3046 ; 1397-3142
ISSN (online)	1399-3046
ISSN	1397-3142
DOI	10.1111/petr.14676
Database	MEDical Literature Analysis and Retrieval System OnLINE

In stock of ZB MED Cologne/Königswinter

Zs.A 4947: Show issues

Location:
Je nach Verfügbarkeit (siehe Angabe bei Bestand)
bis Jg. 1994: Bestellungen von Artikeln über das Online-Bestellformular
Jg. 1995 - 2021: Lesesall (2.OG)
ab Jg. 2022: Lesesaal (EG)

Order via subito

Details ▾
- See ZB MED holdings
- Order with fees

Article ; Online: Awareness regarding oral cancer amongst the dental, medical, and nursing students: Is something lacking?

Das, Rupsa / Misra, Satya Ranjan / Nayak, Ananya

Oral oncology

2024 Volume 152, Page(s) 106790

MeSH term(s)	Humans ; Mouth Neoplasms ; Students, Nursing/psychology ; Students, Medical/psychology ; Students, Dental/statistics & numerical data ; Students, Dental/psychology ; Health Knowledge, Attitudes, Practice ; Female ; Male
Language	English
Publishing date	2024-04-03
Publishing country	England
Document type	Letter
ZDB-ID	1120465-5
ISSN	1879-0593 ; 0964-1955 ; 1368-8375
ISSN (online)	1879-0593
ISSN	0964-1955 ; 1368-8375
DOI	10.1016/j.oraloncology.2024.106790
Database	MEDical Literature Analysis and Retrieval System OnLINE

In stock of ZB MED Cologne/Königswinter

Zs.A 4869: Show issues			Location: Je nach Verfügbarkeit (siehe Angabe bei Bestand) bis Jg. 1994: Bestellungen von Artikeln über das Online-Bestellformular Jg. 1995 - 2021: Lesesall (2.OG) ab Jg. 2022: Lesesaal (EG)
Zs.A 456: Show issues			Location: Je nach Verfügbarkeit (siehe Angabe bei Bestand) bis Jg. 1994: Bestellungen von Artikeln über das Online-Bestellformular Jg. 1995 - 2021: Lesesall (1.OG) ab Jg. 2022: Lesesaal (EG)

Order via subito

Details ▾
- See ZB MED holdings
- Order with fees

Book ; Online: Deterministic Algorithms for the Hidden Subgroup Problem

Nayak, Ashwin

2021

Abstract: We present deterministic algorithms for the Hidden Subgroup Problem. The first algorithm, for abelian groups, achieves the same asymptotic worst-case query complexity as the optimal randomized algorithm, namely O($\sqrt{ n}\,$), where $n$ is the order of ...

Abstract	We present deterministic algorithms for the Hidden Subgroup Problem. The first algorithm, for abelian groups, achieves the same asymptotic worst-case query complexity as the optimal randomized algorithm, namely O($\sqrt{ n}\,$), where $n$ is the order of the group. The analogous algorithm for non-abelian groups comes within a $\sqrt{ \log n}$ factor of the optimal randomized query complexity. The best known randomized algorithm for the Hidden Subgroup Problem has expected query complexity that is sensitive to the input, namely O($\sqrt{ n/m}\,$), where $m$ is the order of the hidden subgroup. In the first version of this article (arXiv:2104.14436v1 [cs.DS]), we asked if there is a deterministic algorithm whose query complexity has a similar dependence on the order of the hidden subgroup. Prompted by this question, Ye and Li (arXiv:2110.00827v1 [cs.DS]) present deterministic algorithms for abelian groups which solve the problem with O($\sqrt{ n/m }\,$ ) queries, and find the hidden subgroup with O($\sqrt{ n (\log m) / m} + \log m$) queries. Moreover, they exhibit instances which show that in general, the deterministic query complexity of the problem may be o($\sqrt{ n/m } \,$), and that of finding the entire subgroup may also be o($\sqrt{ n/m } \,$) or even $\omega(\sqrt{ n/m } \,)$. We present a different deterministic algorithm for the Hidden Subgroup Problem that also has query complexity O($\sqrt{ n/m }\,$) for abelian groups. The algorithm is arguably simpler. Moreover, it works for non-abelian groups, and has query complexity O($\sqrt{ (n/m) \log (n/m) }\,$) for a large class of instances, such as those over supersolvable groups. We build on this to design deterministic algorithms to find the hidden subgroup for all abelian and some non-abelian instances, at the cost of a $\log m$ multiplicative factor increase in the query complexity. Comment: v3: 14 pages. Added some details. Minor edits for clarity. Close to published version. v2: 14 pages. Added references to past and recent related work, added new ...
Keywords	Computer Science - Data Structures and Algorithms ; Computer Science - Computational Complexity ; Mathematics - Group Theory ; Quantum Physics ; 68Q25 ; 68Q12 (Primary) 20D99 (Secondary) ; F.2.2
Subject code	005
Publishing date	2021-04-29
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Regularizing (Stabilizing) Deep Learning Based Reconstruction Algorithms

Nayak, Abinash

2021

Abstract: It's well-known that inverse problems are ill-posed and to solve them meaningfully one has to employ regularization methods. Traditionally, popular regularization methods have been the penalized Variational approaches. In recent years, the classical ... ...

Abstract	It's well-known that inverse problems are ill-posed and to solve them meaningfully one has to employ regularization methods. Traditionally, popular regularization methods have been the penalized Variational approaches. In recent years, the classical regularized-reconstruction approaches have been outclassed by the (deep-learning-based) learned reconstruction algorithms. However, unlike the traditional regularization methods, the theoretical underpinnings, such as stability and regularization, have been insufficient for such learned reconstruction algorithms. Hence, the results obtained from such algorithms, though empirically outstanding, can't always be completely trusted, as they may contain certain instabilities or (hallucinated) features arising from the learned process. In fact, it has been shown that such learning algorithms are very susceptible to small (adversarial) noises in the data and can lead to severe instabilities in the recovered solution, which can be quite different than the inherent instabilities of the ill-posed (inverse) problem. Whereas, the classical regularization methods can handle such (adversarial) noises very well and can produce stable recovery. Here, we try to present certain regularization methods to stabilize such (unstable) learned reconstruction methods and recover a regularized solution, even in the presence of adversarial noises. For this, we need to extend the classical notion of regularization and incorporate it in the learned reconstruction algorithms. We also present some regularization techniques to regularize two of the most popular learning reconstruction algorithms, the Learned Post-Processing Reconstruction and the Learned Unrolling Reconstruction.
Keywords	Computer Science - Machine Learning ; Electrical Engineering and Systems Science - Image and Video Processing ; Primary 65K05 ; 65K10 ; Secondary 65R30 ; 65R32
Subject code	006
Publishing date	2021-08-21
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Instabilities in Plug-and-Play (PnP) algorithms from a learned denoiser

Nayak, Abinash

2021

Abstract: It's well-known that inverse problems are ill-posed and to solve them meaningfully, one has to employ regularization methods. Traditionally, popular regularization methods are the penalized Variational approaches. In recent years, the classical ... ...

Abstract	It's well-known that inverse problems are ill-posed and to solve them meaningfully, one has to employ regularization methods. Traditionally, popular regularization methods are the penalized Variational approaches. In recent years, the classical regularization approaches have been outclassed by the so-called plug-and-play (PnP) algorithms, which copy the proximal gradient minimization processes, such as ADMM or FISTA, but with any general denoiser. However, unlike the traditional proximal gradient methods, the theoretical underpinnings, convergence, and stability results have been insufficient for these PnP-algorithms. Hence, the results obtained from these algorithms, though empirically outstanding, can't always be completely trusted, as they may contain certain instabilities or (hallucinated) features arising from the denoiser, especially when using a pre-trained learned denoiser. In fact, in this paper, we show that a PnP-algorithm can induce hallucinated features, when using a pre-trained deep-learning-based (DnCNN) denoiser. We show that such instabilities are quite different than the instabilities inherent to an ill-posed problem. We also present methods to subdue these instabilities and significantly improve the recoveries. We compare the advantages and disadvantages of a learned denoiser over a classical denoiser (here, BM3D), as well as, the effectiveness of the FISTA-PnP algorithm vs. the ADMM-PnP algorithm. In addition, we also provide an algorithm to combine these two denoisers, the learned and the classical, in a weighted fashion to produce even better results. We conclude with numerical results which validate the developed theories. Comment: arXiv admin note: text overlap with arXiv:2106.07795
Keywords	Computer Science - Computer Vision and Pattern Recognition ; Electrical Engineering and Systems Science - Image and Video Processing ; Mathematics - Numerical Analysis ; Primary 65K05 ; 65K10 ; Secondary 65R30 ; 65R32
Subject code	006
Publishing date	2021-08-17
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: Commentary on letter to editor titled "The clinical value of the RGB value of an image of the interarytenoid area for diagnosis of laryngopharyngeal reflux".

Nayak, Anindya

American journal of otolaryngology

2018 Volume 39, Issue 3, Page(s) 364

MeSH term(s)	Humans ; Laryngopharyngeal Reflux ; Laryngoscopy
Language	English
Publishing date	2018-03-04
Publishing country	United States
Document type	Letter ; Comment
ZDB-ID	604541-8
ISSN	1532-818X ; 0196-0709
ISSN (online)	1532-818X
ISSN	0196-0709
DOI	10.1016/j.amjoto.2018.03.015
Database	MEDical Literature Analysis and Retrieval System OnLINE

In stock of ZB MED Cologne/Königswinter

Zs.A 1637: Show issues

Location:
Je nach Verfügbarkeit (siehe Angabe bei Bestand)
bis Jg. 1994: Bestellungen von Artikeln über das Online-Bestellformular
Jg. 1995 - 2021: Lesesall (1.OG)
ab Jg. 2022: Lesesaal (EG)

Order via subito

Details ▾
- See ZB MED holdings
- Order with fees

To top

More links

Kategorien

Order via subito

More links

Kategorien

Order via subito

More links

Kategorien

Order via subito

More links

Kategorien

In stock of ZB MED Cologne/Königswinter

Order via subito

More links

Kategorien

In stock of ZB MED Cologne/Königswinter

Order via subito

More links

Kategorien

In stock of ZB MED Cologne/Königswinter

Order via subito

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

More links

Kategorien

In stock of ZB MED Cologne/Königswinter

Order via subito