Results 31 to 40 of about 1,746,055 (248)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]

open access: yesLogical Methods in Computer Science
A characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
doaj   +1 more source

Graph Operations and Neighborhood Polynomials

open access: yesDiscussiones Mathematicae Graph Theory, 2021
The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G.
Alipour Maryam, Tittmann Peter
doaj   +1 more source

Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry

open access: yesFEBS Letters, EarlyView.
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri   +5 more
wiley   +1 more source

A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi   +17 more
wiley   +1 more source

Representing Small Ordinals by Finite Automata [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than omega^omega. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to ...
Zoltan Ésik
doaj   +1 more source

CSF Cytokine Network Organization Predicts Progression Independent of Relapse and MRI Activity in Multiple Sclerosis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Progression independent of relapse activity is a major determinant of long‐term disability in multiple sclerosis, but its immunopathologic basis remains incompletely understood. We investigated whether relapse‐independent progression in radiologically stable relapsing–remitting multiple sclerosis is associated with distinct ...
Antonio Bruno   +19 more
wiley   +1 more source

Polynomial Time Algorithm for Shortest Paths in Interval Temporal Graphs

open access: yesAlgorithms
We develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such ...
Anuj Jain, Sartaj Sahni
doaj   +1 more source

Data‐Driven SuStaIn Model of Disability Progression in Amyotrophic Lateral Sclerosis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To determine whether ordinal Subtype and Stage Inference (SuStaIn) applied to routine ALSFRS‐R item scores can identify reproducible disability progression patterns in amyotrophic lateral sclerosis (ALS) and provide clinically meaningful staging.
Giammarco Milella   +5 more
wiley   +1 more source

Impact of decreasing polynomial degree in time needed to factor a 100 digits integer by General Number field sieve algorithm [PDF]

open access: yesEngineering and Technology Journal, 2012
Factoring is very important in the field of cryptography, specifically in the Rivest, Shamir, Adleman(RSA) public-key cryptosystem, one of the most prevalent methods for transmitting and receiving secret data which its security relies on the fact that ...
Jamal A. Othman
doaj   +1 more source

dynoGP: Deep Gaussian Processes for Dynamic System Identification

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy