Advertisement

Topics

PubMed Journals Articles About "BERNARD KRIEF SEARCH" - Page: 3 RSS

06:27 EDT 26th September 2018 | BioPortfolio

BERNARD KRIEF SEARCH PubMed articles on BioPortfolio. Our PubMed references draw on over 21 million records from the medical literature. Here you can see the latest BERNARD KRIEF SEARCH articles that have been published worldwide.

More Information about "BERNARD KRIEF SEARCH" on BioPortfolio

We have published hundreds of BERNARD KRIEF SEARCH news stories on BioPortfolio along with dozens of BERNARD KRIEF SEARCH Clinical Trials and PubMed Articles about BERNARD KRIEF SEARCH for you to read. In addition to the medical data, news and clinical trials, BioPortfolio also has a large collection of BERNARD KRIEF SEARCH Companies in our database. You can also find out about relevant BERNARD KRIEF SEARCH Drugs and Medications on this site too.

Showing "BERNARD KRIEF SEARCH" PubMed Articles 51–75 of 1,800+

Chaos synchronization and Nelder-Mead search for parameter estimation in nonlinear pharmacological systems: Estimating tumor antigenicity in a model of immunotherapy.

In mathematical pharmacology, models are constructed to confer a robust method for optimizing treatment. The predictive capability of pharmacological models depends heavily on the ability to track the system and to accurately determine parameters with reference to the sensitivity in projected outcomes. To closely track chaotic systems, one may choose to apply chaos synchronization. An advantageous byproduct of this methodology is the ability to quantify model parameters. In this paper, we illustrate the use...


Search for Heavy Neutral Leptons in Events with Three Charged Leptons in Proton-Proton Collisions at sqrts=13  TeV.

A search for a heavy neutral lepton N of Majorana nature decaying into a W boson and a charged lepton is performed using the CMS detector at the LHC. The targeted signature consists of three prompt charged leptons in any flavor combination of electrons and muons. The data were collected in proton-proton collisions at a center-of-mass energy of 13 TeV, with an integrated luminosity of 35.9  fb^{-1}. The search is performed in the N mass range between 1 GeV and 1.2 TeV. The data are found to be consist...

Cophenetic Median Trees.

Median tree inference under path-difference metrics has shown great promise for large-scale phylogeny estimation. Similar to these metrics is the family of cophenetic metrics that originates from a classic dendrogram comparison method introduced more than 50 years ago. Despite the appeal of this family of metrics, the problem of computing median trees under cophenetic metrics has not been analyzed. Like other standard median tree problems relevant in practice, as we show here, this problem is also NP-hard. ...


Economic Recession and Obesity-Related Internet Search Behavior in Taiwan: Analysis of Google Trends Data.

Obesity is highly correlated with the development of chronic diseases and has become a critical public health issue that must be countered by aggressive action. This study determined whether data from Google Trends could provide insight into trends in obesity-related search behaviors in Taiwan.

Searching the stable segregation configuration at the grain boundary by a Monte Carlo tree search.

Non-stoichiometric structure localized at the grain boundary, namely, segregations of impurities, dopants, and vacancies, has an important effect on a broad variety of material properties. An understanding of this behavior is therefore indispensable for further material development. Although molecular dynamics simulation and a simulation combined with randomly swapping atoms and vacancies have usually been used to investigate the segregation structures, they require more than ten thousand structures and ene...

KIR Donor Selection: Feasibility in Identifying Better Donors.

We previously reported that AML transplants using KIR B haplotype Better or Best (≥2 B activating gene loci ± Cen B/B) unrelated donors (URD) yield less relapse and better survival. In this prospective trial we evaluated 535 AML searches from 14 participating centers with centralized donor KIR genotyping for donor selection. This represented 3-48% of all AML searches (median 20%) per center totaling 3 to 172 patients (median 22) per center. Donor KIR genotype was reported at a median of 14 days after req...

Lack of free choice reveals the cost of multiple-target search within and across feature dimensions.

Having to look for multiple targets typically results in switch costs. However, using a gaze-contingent eyetracking paradigm with multiple color-defined targets, we have recently shown that the emergence of switch costs depends on whether observers can choose a target or a target is being imposed upon them. Here, using a similar paradigm, we tested whether these findings generalize to the situation in which targets are specified across different feature dimensions. We instructed participants to simultaneous...

Measuring the time course of selection during visual search.

In visual search tasks, observers can guide their attention towards items in the visual field that share features with the target item. In this series of studies, we examined the time course of guidance toward a subset of items that have the same color as the target item. Landolt Cs were placed on 16 colored disks. Fifteen distractor Cs had gaps facing up or down while one target C had a gap facing left or right. Observers searched for the target C and reported which side contained the gap as quickly as pos...

A machine learning method to monitor China's AIDS epidemics with data from Baidu trends.

AIDS is a worrying public health issue in China and lacks timely and effective surveillance. With the diffusion and adoption of the Internet, the 'big data' aggregated from Internet search engines, which contain users' information on the concern or reality of their health status, provide a new opportunity for AIDS surveillance. This paper uses search engine data to monitor and forecast AIDS in China.

Visual mental imagery influences attentional guidance in a visual-search task.

Visual mental imagery resembles visual working memory (VWM). Because both visual mental imagery and VWM involve the representation and manipulation of visual information, it was hypothesized that they would exert similar effects on visual attention. Several previous studies have demonstrated that working-memory representations guide attention toward a memory-matching task-irrelevant stimulus during visual-search tasks. Therefore, mental imagery may also guide attention toward imagery-matching stimuli. In th...

A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles.

In this paper, we mainly study a cooperative search and coverage algorithm for a given bounded rectangle region, which contains several unknown stationary targets, by a team of unmanned aerial vehicles (UAVs) with non-ideal sensors and limited communication ranges. Our goal is to minimize the search time, while gathering more information about the environment and finding more targets. For this purpose, a novel cooperative search and coverage algorithm with controllable revisit mechanism is presented. Firstl...

Search for Low-Mass Dijet Resonances Using Trigger-Level Jets with the ATLAS Detector in pp Collisions at sqrts=13  TeV.

Searches for dijet resonances with sub-TeV masses using the ATLAS detector at the Large Hadron Collider can be statistically limited by the bandwidth available to inclusive single-jet triggers, whose data-collection rates at low transverse momentum are much lower than the rate from standard model multijet production. This Letter describes a new search for dijet resonances where this limitation is overcome by recording only the event information calculated by the jet trigger algorithms, thereby allowing much...

Fast and exact search for the partition with minimal information loss.

In analysis of multi-component complex systems, such as neural systems, identifying groups of units that share similar functionality will aid understanding of the underlying structures of the system. To find such a grouping, it is useful to evaluate to what extent the units of the system are separable. Separability or inseparability can be evaluated by quantifying how much information would be lost if the system were partitioned into subsystems, and the interactions between the subsystems were hypotheticall...

Intrinsically disordered domain of tumor suppressor p53 facilitates target search by ultrafast transfer between different DNA strands.

Intersegmental transfer (IST) is an important strategy in the target search used by sequence-specific DNA-binding proteins (DBPs), enabling DBPs to search for targets between multiple DNA strands without dissociation. We examined the IST of the tumor suppressor p53 using ensemble stopped-flow and single-molecule fluorescence measurements. The ensemble measurements demonstrated that p53 exhibits very fast IST, whose rate constant was ∼108 M-1 s-1. To determine the domains of p53 responsible for IST, two m...

Investigation of Different Ways in Which the CODIS 7.0 May be Used in Mass Disaster Identification.

DNA analysis is a key method for the identification of human remains in mass disasters. Reference samples from relatives may be used to identify missing persons by kinship analysis. Different methods of applying the CODIS in disaster victim identification (DVI) were investigated. Two searches were evaluated: (i) relating family relatives to a pedigree tree (FPT) and (ii) relating unidentified human remains to a pedigree tree (UPT). A joint pedigree likelihood ratio (JPLR) and rank were calculated for each s...

The Terabase Search Engine: a large-scale relational database of short-read sequences.

DNA sequencing archives have grown to enormous scales in recent years, and thousands of human genomes have already been sequenced. The size of these data sets has made searching the raw read data infeasible without high-performance data-query technology. Additionally, it is challenging to search a repository of short-read data using relational logic and to apply that logic across samples from multiple whole-genome sequencing samples.

Fourteen-month-olds selectively search for and use information depending on the familiarity of the informant in both laboratory and home contexts.

Infants are selective in their learning from others. However, there is only very limited research on the possible factors that shape this selectivity, especially when it comes to the impact of infants' familiarity with the informant and the context. The current study investigated whether 14-month-olds preferred to receive and use information provided by an unfamiliar informant (experimenter) compared with a familiar informant (parent) and whether this pattern depended on the context (home vs. laboratory). W...

Optimal search strategies for identifying moderators and predictors of treatment effects in PubMed.

Treatment effects differ across patients. To guide selection of treatments for patients, it is essential to acknowledge these differences and identify moderators or predictors. Our aim was to generate optimal search strategies (commonly known as filters) for PubMed to retrieve papers identifying moderators and predictors of treatment effects.

Training radial basis function networks for wind speed prediction using PSO enhanced differential search optimizer.

This paper presents an integrated hybrid optimization algorithm for training the radial basis function neural network (RBF NN). Training of neural networks is still a challenging exercise in machine learning domain. Traditional training algorithms in general suffer and trap in local optima and lead to premature convergence, which makes them ineffective when applied for datasets with diverse features. Training algorithms based on evolutionary computations are becoming popular due to their robust nature in ov...

First Results from CUORE: A Search for Lepton Number Violation via 0νββ Decay of ^{130}Te.

The CUORE experiment, a ton-scale cryogenic bolometer array, recently began operation at the Laboratori Nazionali del Gran Sasso in Italy. The array represents a significant advancement in this technology, and in this work we apply it for the first time to a high-sensitivity search for a lepton-number-violating process: ^{130}Te neutrinoless double-beta decay. Examining a total TeO_{2} exposure of 86.3 kg yr, characterized by an effective energy resolution of (7.7±0.5)  keV FWHM and a background in ...

Does Central Vision Loss Impair Visual Search Performance of Adults More than Children?

In general, young adults with normal vision show the best visual search performance when compared with children and older adults. Through our study, we show that this trend is not observed in individuals with vision impairment. An interaction effect of vision impairment with visual development and aging is observed.

Robust Quantization for General Similarity Search.

The recent years have witnessed the emerging of vector quantization (VQ) techniques for efficient similarity search. VQ partitions the feature space into a set of codewords and encodes data points as integer indices using the codewords. Then the distance between data points can be efficiently approximated by simple memory lookup operations. By the compact quantization, the storage cost, and searching complexity are significantly reduced, thereby facilitating efficient large-scale similarity search. However,...

In search of a needle.

Fast open modification spectral library searching through approximate nearest neighbor indexing.

Open modification searching (OMS) is a powerful search strategy that identifies peptides carrying any type of modification by allowing a modified spectrum to match against its unmodified variant by using a very wide precursor mass window. A drawback of this strategy, however, is that it leads to a large increase in search time. Although performing an open search can be done using existing spectral library search engines by simply setting a wide precursor mass window, none of these tools have been optimized ...

Tight-binding approximation enhanced global optimization.

Solving and predicting atomic structures from first-principles is limited by the computational cost of exploring the search space, even when relatively inexpensive density functionals are used. Here, we present an efficient approach where the search is performed using density functional tight-binding, with an automatic adaptive parametrization scheme for the repulsive pair potentials. We successfully apply the method to the genetic algorithm optimization of bulk carbon, titanium dioxide, palladium oxide and...


Advertisement
Quick Search
Advertisement
Advertisement