Search results for "Abstract"

showing 10 items of 1959 documents

A Coclustering Approach for Mining Large Protein-Protein Interaction Networks

2012

Several approaches have been presented in the literature to cluster Protein-Protein Interaction (PPI) networks. They can be grouped in two main categories: those allowing a protein to participate in different clusters and those generating only nonoverlapping clusters. In both cases, a challenging task is to find a suitable compromise between the biological relevance of the results and a comprehensive coverage of the analyzed networks. Indeed, methods returning high accurate results are often able to cover only small parts of the input PPI network, especially when low-characterized networks are considered. We present a coclustering-based technique able to generate both overlapping and nonove…

Biologycomputer.software_genreBioinformatics network analysis co-clusteringTask (project management)Set (abstract data type)Protein Interaction MappingGeneticsCluster (physics)Cluster AnalysisHumansRelevance (information retrieval)Protein Interaction MapsCluster analysisStructure (mathematical logic)Applied MathematicsProteinsprotein-protein interaction networksbiological networksComputingMethodologies_PATTERNRECOGNITIONCover (topology)Co-clusteringData miningcomputerAlgorithmsBiological networkBiotechnologyIEEE/ACM Transactions on Computational Biology and Bioinformatics
researchProduct

Hybrid Quantum Mechanics/Molecular Mechanics Simulations with Two-Dimensional Interpolated Corrections:  Application to Enzymatic Processes

2006

Hybrid quantum mechanics/molecular mechanics (QM/MM) techniques are widely used to study chemical reactions in large systems. Because of the computational cost associated with the high dimensionality of these systems, the quantum description is usually restricted to low-level methods, such as semiempirical Hamiltonians. In some cases, the description obtained at this computational level is quite poor and corrections must be considered. We here propose a simple but efficient way to include higher-level corrections to be used in potential energy surface explorations and in the calculation of potentials of mean force. We evaluate a correction energy term as the difference between a high-level …

BiophysicsCatechol O-MethyltransferaseMethylationCatalysisSimple (abstract algebra)Quantum mechanicsMaterials ChemistryComputer SimulationPhysical and Theoretical ChemistryWave functionQuantumChemistry PhysicalChemistryFunction (mathematics)Models TheoreticalEnzymesSurfaces Coatings and FilmsClassical mechanicsModels ChemicalPotential energy surfaceChorismate mutaseQuantum TheoryThermodynamicsBicubic interpolationEnergy (signal processing)Bacillus subtilisChorismate MutaseThe Journal of Physical Chemistry B
researchProduct

A Robust Generic Method for Grid Detection in White Light Microscopy Malassez Blade Images in the Context of Cell Counting

2015

AbstractIn biology, cell counting is a primary measurement and it is usually performed manually using hemocytometers such as Malassez blades. This work is tedious and can be automated using image processing. An algorithm based on Fourier transform filtering and the Hough transform was developed for Malassez blade grid extraction. This facilitates cell segmentation and counting within the grid. For the present work, a set of 137 images with high variability was processed. Grids were accurately detected in 98% of these images.

Blade (geometry)Computer scienceMalassezImage processingContext (language use)Saccharomyces cerevisiaeHough transformlaw.inventionSet (abstract data type)symbols.namesakeOpticslawimage analysisMicroscopy[ INFO.INFO-TI ] Computer Science [cs]/Image ProcessingImage Processing Computer-AssistedComputer visionInstrumentationcell segmentationMicroscopybusiness.industrymorphological mathematicsGridFourier transformHough transform[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]symbolsFourier transformArtificial intelligencebusinessAlgorithms
researchProduct

Research of Complex Forms in Cellular Automata by Evolutionary Algorithms

2004

This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.

Block cellular automatonTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESComputer sciencebusiness.industryBoolean circuitComputationGrowCut algorithmContinuous automatonTimed automatonNonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonAutomatonMobile automatonStochastic cellular automatonElementary cellular automatonDeterministic automatonContinuous spatial automatonAutomata theoryArtificial intelligencebusinessComputer Science::Formal Languages and Automata TheoryAsynchronous cellular automatonQuantum cellular automaton
researchProduct

A New Universal Cellular Automaton Discovered by Evolutionary Algorithms

2004

In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).

Block cellular automatonTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer sciencebusiness.industryContinuous automatonNonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonReversible cellular automatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESStochastic cellular automatonElementary cellular automatonWolfram codeLife-like cellular automatonArtificial intelligencebusinessComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

The diabetic ketoacidosis

2014

The Diabetic Ketoacidosis (DKA) is still today a medical emergency in pediatrics. Despite the latest great sensibilization of the population and the doctors, the risk of DKA has not yet been eliminated and this pathology is still occurring in 25 to 40% of diabetes onset cases, in already diagnosed patients with poor compliance (10%), in patients undergoing acute medical or surgical events or in patients in Continuous Subcoutaneous Insulin Therapy (CSII). In toddlers (0-3 years) it is twice more frequent than in the following ages and is characterized by the presence of more serious clinical dehydratation (>10%) and neurological signs (obnubilation 40%). The other category at risk is represe…

Body surface areaeducation.field_of_studyPediatricsmedicine.medical_specialtyDiabetic ketoacidosisbusiness.industryInsulinmedicine.medical_treatmentPopulationMetabolic acidosismedicine.diseaseDiabetes mellitusMeeting AbstractmedicineRegular insulineducationComplicationbusinessItalian Journal of Pediatrics
researchProduct

Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm

2019

Abstract In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. First, we prove that under special conditions the problem can be solved as an Asymmetric Traveling Salesman Problem with Time Windows, with suitable-defined time windows and (constant) travel times. Second, we show that, if the special conditions do not hold, the time-independent optimal solution provides both a lower bound and (eventually) an upper bound with a worst-case guarantee for the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. Finally, a branch-and-bound algorithm is presented and tested on a set of 4800 instances. The results have been compared…

Branch-and-boundApplied MathematicsTime dependenceUpper and lower boundsTravelling salesman problemSet (abstract data type)Traveling salesman problemExact algorithmTime windowsLower and upper boundTime windowDiscrete Mathematics and CombinatoricsApplied mathematicsConstant (mathematics)Discrete Mathematics and CombinatoricMathematics
researchProduct

A simple synthesis of γ-aminoacids

2007

The addition of dianions of carboxylic acids to bromoacetonitrile, leads, in good yields, to the corresponding γ-cyanoacids that give γ-aminoacids on hydrogenation. This two-step methodology improves the results previously described.

BromoacetonitrileChemistrySimple (abstract algebra)Organic ChemistryDrug DiscoveryOrganic chemistryRegioselectivityBiochemistryTetrahedron Letters
researchProduct

Multi-channel search for squarks and gluinos in root s=7 TeV pp collisions with the ATLAS detector at the LHC

2013

A search for supersymmetric particles in final states with zero, one, and two leptons, with and without jets identified as originating from b-quarks, in 4.7 fb[superscript −1] of √s = 7 TeV pp collisions produced by the Large Hadron Collider and recorded by the ATLAS detector is presented. The search uses a set of variables carrying information on the event kinematics transverse and parallel to the beam line that are sensitive to several topologies expected in supersymmetry. Mutually exclusive final states are defined, allowing a combination of all channels to increase the search sensitivity. No deviation from the Standard Model expectation is observed. Upper limits at 95 % confidence level…

Brookhaven National LaboratoryParticle physicsPhysics and Astronomy (miscellaneous)Supergauge TransformationsContext (language use)ddc:500.253001 natural sciencesStandard ModelSet (abstract data type)CurrentsPions0103 physical sciencesddc:530Sensitivity (control systems)WeakHigh Energy Physics010306 general physicsEngineering (miscellaneous)QCCiencias ExactasPhysicsproton–proton collisionsHadron-Hadron ScatteringLarge Hadron ColliderATLAS detector010308 nuclear & particles physicsSettore FIS/01 - Fisica SperimentaleHigh Energy Physics::PhenomenologyFísicaSupersymmetryATLASgluinosHADRON-HADRON COLLISIONSExperimental High Energy PhysicsComputingMethodologies_DOCUMENTANDTEXTPROCESSINGsquarksHigh Energy Physics::ExperimentSupersymmetryLHCEvent (particle physics)LeptonModel
researchProduct

A Fuzzy Logic C-Means Clustering Algorithm to Enhance Microcalcifications Clusters in Digital Mammograms

2011

The detection of microcalcifications is a hard task, since they are quite small and often poorly contrasted against the background of images. The Computer Aided Detection (CAD) systems could be very useful for breast cancer control. In this paper, we report a method to enhance microcalcifications cluster in digital mammograms. A Fuzzy Logic clustering algorithm with a set of features is used for clustering microcalcifications. The method described was tested on simulated clusters of microcalcifications, so that the location of the cluster within the breast and the exact number of microcalcifications is known.

C-meanCOMPUTER-AIDED DETECTIONComputer scienceCADFuzzy logicSet (abstract data type)Cluster (physics)medicineMammographycancerComputer visionCLASSIFICATION.Cluster analysisbreastmedicine.diagnostic_testbusiness.industryPattern recognitionImage enhancementComputer aided detectionSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)microcalcificationComputingMethodologies_PATTERNRECOGNITIONbreast; cancer; microcalcifications; clustering; fuzzy logic; C-means; COMPUTER-AIDED DETECTION; CLASSIFICATION.Artificial intelligencefuzzy logicbusinessclustering
researchProduct