Results 71 to 80 of about 311,585 (364)

Tumbling Magnetic Microrobots for Targeted In Vivo Drug Delivery in the GI Tract

open access: yesAdvanced Robotics Research, EarlyView.
We introduce a microrobot design and integrated system for on‐demand targeted drug release in the gastrointestinal tract. The microrobot has an embedded magnet for actuation with external magnetic fields and is visualized in real time using ultrasound. It has two drug release ports sealed with a thermally sensitive wax. Local heating of the wax using a
Aaron C. Davis   +7 more
wiley   +1 more source

The scope of children’s scope: Representation, parsing and learning

open access: yesGlossa, 2018
This paper reviews some developmental psycholinguistic literature on quantifier scope. I demonstrate how scope has been used as a valuable probe into children’s grammatical representations, the nature of children’s on-line understanding mechanisms, and ...
Jeffrey Lidz
doaj   +2 more sources

P Colony Automata with LL(k)-like Conditions [PDF]

open access: yes, 2018
We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages characterized by (generalized) P colony automata.
Csuhaj Varjú, Erzsébet   +2 more
core  

Viable Dependency Parsing as Sequence Labeling [PDF]

open access: yes, 2019
We recast dependency parsing as a sequence labeling problem, exploring several encodings of dependency trees as labels. While dependency parsing by means of sequence labeling had been attempted in existing work, results suggested that the technique was ...
Gómez-Rodríguez, Carlos   +2 more
core   +2 more sources

Graphical Contrastive Losses for Scene Graph Parsing [PDF]

open access: yesComputer Vision and Pattern Recognition, 2019
Most scene graph parsers use a two-stage pipeline to detect visual relationships: the first stage detects entities, and the second predicts the predicate for each entity pair using a softmax distribution.
Ji Zhang   +4 more
semanticscholar   +1 more source

Top-Down Parsing with Parsing Contexts

open access: yes, 2014
The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free. Using standard context-free parsing techniques to parse a context-sensitive programming language poses a considerable challenge ...
Kurš Jan   +2 more
openaire   +4 more sources

Correlating Edge with Parsing for Human Parsing

open access: yesElectronics, 2023
Human parsing has great application prospects in the field of computer vision, but there are still many problems. In the existing algorithms, the problems of small-scale target location and the problem of background occlusion have not been fully resolved, which will lead to wrong segmentation or incomplete segmentation.
Kai Gong, Xiuying Wang, Shoubiao Tan
openaire   +1 more source

Excitation Energy Transfer between Porphyrin Dyes on a Clay Surface: A Study Employing Multifidelity Machine Learning

open access: yesAdvanced Theory and Simulations, EarlyView.
Inspired by natural light‐harvesting systems, this study computationally investigates a synthetic antenna by arranging cationic free‐base porphyrin molecules on an anionic clay surface. Using a multiscale quantum mechanics/molecular mechanics (QM/MM) approach combined with a multifidelity machine learning method, excitation energies are predicted ...
Dongyu Lyu   +7 more
wiley   +1 more source

Digitalization of services to improve the quality of social infrastructure

open access: yesπ-Economy, 2022
The article substantiates the possibility of involving the population to participate in improving the quality of the urban environment in the context of digital transformation.
Kurcheeva Galina, Kopylov Victor
doaj   +1 more source

Unsupervised Dependency Parsing: Let's Use Supervised Parsers

open access: yes, 2015
We present a self-training approach to unsupervised dependency parsing that reuses existing supervised and unsupervised parsing algorithms. Our approach, called `iterated reranking' (IR), starts with dependency trees generated by an unsupervised parser ...
Le, Phong, Zuidema, Willem
core   +1 more source

Home - About - Disclaimer - Privacy