Search results for "Computation"

showing 10 items of 7362 documents

Multi-label Classification Using Stacked Hierarchical Dirichlet Processes with Reduced Sampling Complexity

2018

Nonparametric topic models based on hierarchical Dirichlet processes (HDPs) allow for the number of topics to be automatically discovered from the data. The computational complexity of standard Gibbs sampling techniques for model training is linear in the number of topics. Recently, it was reduced to be linear in the number of topics per word using a technique called alias sampling combined with Metropolis Hastings (MH) sampling. We propose a different proposal distribution for the MH step based on the observation that distributions on the upper hierarchy level change slower than the document-specific distributions at the lower level. This reduces the sampling complexity, making it linear i…

Topic modelComputational complexity theoryComputer science02 engineering and technologyLatent Dirichlet allocationDirichlet distributionsymbols.namesakeArtificial Intelligence020204 information systems0202 electrical engineering electronic engineering information engineeringMathematicsMulti-label classificationbusiness.industrySampling (statistics)Pattern recognitionHuman-Computer InteractionDirichlet processMetropolis–Hastings algorithmHardware and ArchitectureTest setsymbols020201 artificial intelligence & image processingArtificial intelligencebusinessAlgorithmSoftwareInformation SystemsGibbs sampling2017 IEEE International Conference on Big Knowledge (ICBK)
researchProduct

The Effect of Calcium on the Cohesive Strength and Flexural Properties of Low-Methoxyl Pectin Biopolymers.

2019

Abstract: Pectin binds the mesothelial glycocalyx of visceral organs, suggesting its potential role as a mesothelial sealant. To assess the mechanical properties of pectin films, we compared pectin films with a less than 50% degree of methyl esterification (low-methoxyl pectin, LMP) to films with greater than 50% methyl esterification (high-methoxyl pectin, HMP). LMP and HMP polymers were prepared by step-wise dissolution and high-shear mixing. Both LMP and HMP films demonstrated a comparable clear appearance. Fracture mechanics demonstrated that the LMP films had a lower burst strength than HMP films at a variety of calcium concentrations and hydration states. The water content also influe…

Toughnessfood.ingredientanimal structuresPectin0206 medical engineeringpolysaccharidesPharmaceutical Sciencechemistry.chemical_element02 engineering and technologyCalciumPolysaccharideArticleAnalytical Chemistrylcsh:QD241-441Medicinal and Biomolecular Chemistryfoodlcsh:Organic chemistryFlexural strengthTheoretical and Computational ChemistryDrug DiscoveryFlexural Strengthotorhinolaryngologic diseasesPhysical and Theoretical ChemistryDissolutionchemistry.chemical_classificationOrganic ChemistryWaterPolymer021001 nanoscience & nanotechnology020601 biomedical engineeringstomatognathic diseasesChemical engineeringchemistryfracture mechanicsChemistry (miscellaneous)Molecular MedicinePectinsTitrationCalcium0210 nano-technologymaterial propertiesmethoxylationhydrationMolecules (Basel, Switzerland)
researchProduct

Elucidating the aryl hydrocarbon receptor antagonism from a chemical-structural perspective.

2020

The aryl hydrocarbon receptor (AhR) plays an important role in several biological processes such as reproduction, immunity and homoeostasis. However, little is known on the chemical-structural and physicochemical features that influence the activity of AhR antagonistic modulators. In the present report, in vitro AhR antagonistic activity evaluations, based on a chemical-activated luciferase gene expression (AhR-CALUX) bioassay, and an extensive literature review were performed with the aim of constructing a structurally diverse database of contaminants and potentially toxic chemicals. Subsequently, QSAR models based on Linear Discriminant Analysis and Logistic Regression, as well as two tox…

ToxicophoreModels MolecularQuantitative structure–activity relationshipCell SurvivalRecombinant Fusion ProteinsQuantitative Structure-Activity RelationshipBioengineeringComputational biology01 natural sciencesSmall Molecule LibrariesCell Line TumorDrug DiscoveryCALUXBioassayAnimalsToxicologiaLuciferase GeneLuciferasesbiology010405 organic chemistryChemistryRobustness (evolution)Reproducibility of ResultsGeneral Medicinerespiratory systemAryl hydrocarbon receptor0104 chemical sciences010404 medicinal & biomolecular chemistryEstructura químicaReceptors Aryl Hydrocarbonbiology.proteinMolecular MedicineEnvironmental PollutantsAntagonismProteïnesSAR and QSAR in environmental research
researchProduct

Clarkson-McCarthy inequalities with unitary and isometry orbits

2020

Abstract A refinement of a trace inequality of McCarthy establishing the uniform convexity of the Schatten p-classes for p > 2 is proved: if A , B are two n-by-n matrices, then there exists some pair of n-by-n unitary matrices U , V such that U | A + B 2 | p U ⁎ + V | A − B 2 | p V ⁎ ≤ | A | p + | B | p 2 . A similar statement holds for compact Hilbert space operators. Another improvement of McCarthy's inequality is given via the new operator parallelogramm law, | A + B | 2 ⊕ | A − B | 2 = U 0 ( | A | 2 + | B | 2 ) U 0 ⁎ + V 0 ( | A | 2 + | B | 2 ) V 0 ⁎ for some pair of 2n-by-n isometry matrices U 0 , V 0 .

Trace (linear algebra)010103 numerical & computational mathematics01 natural sciencesUnitary stateConvexityCombinatoricssymbols.namesakeOperator (computer programming)FOS: MathematicsDiscrete Mathematics and Combinatorics0101 mathematicsMathematicsMathematics::Functional AnalysisNumerical AnalysisAlgebra and Number TheoryMathematics::Operator Algebras010102 general mathematicsHilbert spaceUnitary matrixMathematics::Spectral TheoryFunctional Analysis (math.FA)Mathematics - Functional AnalysisIsometrysymbolsComputer Science::Programming LanguagesGeometry and TopologyLinear Algebra and its Applications
researchProduct

TWO-LANE TRAFFIC WITH PLACES OF OBSTRUCTION TO TRAFFIC

2004

As the Nagel–Schreckenberg model (NaSch model) became known as a realistic approach to describe traffic flow on single-lane streets, this model was extended to two-lane traffic by several groups. On the base of our two-lane model, we will now investigate the impact of a place of obstruction, e.g., because of road works, on partial fractions, densities and mean velocities.

Traffic congestion reconstruction with Kerner's three-phase theoryComputer scienceGeneral Physics and AstronomyStatistical and Nonlinear PhysicsTraffic flowBase (topology)Nagel–Schreckenberg modelCellular automatonComputer Science ApplicationsComputational Theory and MathematicsThree-phase traffic theoryTraffic bottleneckAlgorithmMathematical PhysicsSimulationTraffic waveInternational Journal of Modern Physics C
researchProduct

Computer-Aided Diagnosis System with Backpropagation Artificial Neural Network—Improving Human Readers Performance

2016

This article presents the results of a study into possibility of artificial neural networks (ANNs) to classify cancer changes in mammographic images. Today’s Computer-Aided Detection (CAD) systems cannot detect 100 % of pathological changes. One of the properties of an ANN is generalized information —it can identify not only learned data but also data that is similar to training set. The combination of CAD and ANN could give better result and help radiologists to take the right decision.

Training setArtificial neural networkComputer sciencebusiness.industryComputer Science::Neural and Evolutionary ComputationPhysics::Medical PhysicsCADMachine learningcomputer.software_genreComputer aided detectionComputingMethodologies_PATTERNRECOGNITIONComputer-aided diagnosisArtificial intelligencebusinessartificial neural networks�mammographic imagescomputercomputer-aided detectionBackpropagation artificial neural network
researchProduct

Multilayer neural networks: an experimental evaluation of on-line training methods

2004

Artificial neural networks (ANN) are inspired by the structure of biological neural networks and their ability to integrate knowledge and learning. In ANN training, the objective is to minimize the error over the training set. The most popular method for training these networks is back propagation, a gradient descent technique. Other non-linear optimization methods such as conjugate directions set or conjugate gradient have also been used for this purpose. Recently, metaheuristics such as simulated annealing, genetic algorithms or tabu search have been also adapted to this context.There are situations in which the necessary training data are being generated in real time and, an extensive tr…

Training setGeneral Computer ScienceArtificial neural networkbusiness.industryComputer scienceComputer Science::Neural and Evolutionary ComputationMathematicsofComputing_NUMERICALANALYSISContext (language use)Management Science and Operations ResearchMachine learningcomputer.software_genreBackpropagationTabu searchModeling and SimulationConjugate gradient methodGenetic algorithmSimulated annealingArtificial intelligencebusinessGradient descentcomputerMetaheuristicComputers & Operations Research
researchProduct

Null Space Based Image Recognition Using Incremental Eigendecomposition

2011

An incremental approach to the discriminative common vector (DCV) method for image recognition is considered. Discriminative projections are tackled in the particular context in which new training data becomes available and learned subspaces may need continuous updating. Starting from incremental eigendecomposition of scatter matrices, an efficient updating rule based on projections and orthogonalization is given. The corresponding algorithm has been empirically assessed and compared to its batch counterpart. The same good properties and performance results of the original method are kept but with a dramatic decrease in the computation needed.

Training setbusiness.industryComputationContext (language use)Pattern recognitionRule-based systemLinear subspaceDiscriminative modelComputer visionArtificial intelligencebusinessOrthogonalizationEigendecomposition of a matrixMathematics
researchProduct

Learning the structure of HMM's through grammatical inference techniques

2002

A technique is described in which all the components of a hidden Markov model are learnt from training speech data. The structure or topology of the model (i.e. the number of states and the actual transitions) is obtained by means of an error-correcting grammatical inference algorithm (ECGI). This structure is then reduced by using an appropriate state pruning criterion. The statistical parameters that are associated with the obtained topology are estimated from the same training data by means of the standard Baum-Welch algorithm. Experimental results showing the applicability of this technique to speech recognition are presented. >

Training setbusiness.industryComputer scienceEstimation theorySpeech recognitionMarkov processComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Pattern recognitionGrammar inductionsymbols.namesakeRule-based machine translationsymbolsArtificial intelligencePruning (decision trees)businessBaum–Welch algorithmHidden Markov modelError detection and correctionInternational Conference on Acoustics, Speech, and Signal Processing
researchProduct

Measuring RNA polymerase activity genome-wide with high-resolution run-on-based methods

2019

The biogenesis of RNAs is a multi-layered and highly regulated process that involves a diverse set of players acting in an orchestrated manner throughout the transcription cycle. Transcription initiation, elongation and termination factors act on RNA polymerases to modulate their movement along the DNA template in a very precise manner, more complex than previously anticipated. Genome-scale run-on-based methodologies have been developed to study in detail the position of transcriptionally-engaged RNA polymerases. Genomic run-on (GRO), and its many variants and refinements made over the years, are helping the community to address an increasing amount of scientific questions, spanning an incr…

Transcription GeneticComputational biologyGenomeGeneral Biochemistry Genetics and Molecular BiologyDNA sequencing03 medical and health scienceschemistry.chemical_compoundTranscription (biology)RNA polymeraseAnimalsHumansMolecular BiologyPolymerase030304 developmental biology0303 health sciencesbiologySequence Analysis RNA030302 biochemistry & molecular biologyEukaryotaHigh-Throughput Nucleotide SequencingRNADNA-Directed RNA PolymerasesChromatinchemistrybiology.proteinRNABiogenesisMethods
researchProduct