Search results for "Graph theory"

showing 10 items of 784 documents

Evaluation of the flavor-changing vertexb→s+Husing the Breitenlohner-Maison-'t Hooft-Veltmanγ5scheme

1990

We reevaluate the one-loop-induced flavor-changing vertex {ital b}(bottom){r arrow}{ital s}(strange)+{ital H}(Higgs boson) using the Breitenlohner--Maison--'t Hooft--Veltman {gamma}{sub 5} scheme. Our result agrees with the result of previous calculations that employed a naive anticommuting {gamma}{sub 5} if one consistently employs left-chiral fermion fields in the perturbation expansion.

Vertex (graph theory)PhysicsParticle physicsComputer Science::Information RetrievalHigh Energy Physics::LatticeHigh Energy Physics::PhenomenologyQuark modelHiggs bosonB mesonElementary particleFermionQuantum field theoryBosonPhysical Review D
researchProduct

Probing nucleons with photons at the quark level

2014

The description of electromagnetic interactions with hadrons from the quark level requires knowledge of the underlying quark-gluon ingredients. I discuss some properties of the quark-photon vertex and quark Compton vertex, along with the role of electromagnetic gauge invariance and vector-meson dominance. A simple parametrization for the quark-photon vertex is given.

Vertex (graph theory)PhysicsQuarkParticle physicsPhotonNuclear Theory010308 nuclear & particles physicsHigh Energy Physics::LatticeHadronNuclear TheoryHigh Energy Physics::PhenomenologyGeneral Physics and AstronomyFOS: Physical sciences01 natural sciencesNuclear Theory (nucl-th)High Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)0103 physical sciencesHigh Energy Physics::ExperimentVector mesonGauge theory010306 general physicsNucleonNuclear ExperimentParametrization
researchProduct

QSPR/QSAR Studies of 2-Furylethylenes Using Bond-Level Quadratic Indices and Comparison with Other Computational Approaches

2017

The recently introduced, non-stochastic and stochastic quadratic indices (Marrero-Ponce <em>et al. J. Comp. Aided Mol. Des.</em> 2006, 20, 685-701) were applied to QSAR/QSPR studies of heteroatomic molecules. These novel bond-based molecular descriptors (MDs) were used for the prediction of the partition coefficient (log P), and the antibacterial activity of 34 derivatives of 2-furylethylenes. Two statistically significant QSPR models using non-stochastic and stochastic bond-based quadratic indices were obtained (R<sup>2</sup> = 0.971, s = 0.137 and R<sup>2</sup> = 0.986, s = 0.096). These models showed good stability to data variation in leave-one-out (L…

Vertex (graph theory)Quantitative structure–activity relationshipQuadratic equationDiscriminantMolecular descriptorStochastic matrixMoleculeGeneral ChemistryBiological systemStability (probability)MathematicsJournal of the Mexican Chemical Society
researchProduct

Prediction of Molecular Volume and Surface of Alkanes by Molecular Topology.

2003

Molecular volume and molecular surface are expressed as a function of topological degree in alkane graphs. This allows not only a straightforward approach to calculate such physicochemical magnitudes but also an interpretation of the role of the local vertex invariant (LOVI) or valence degree, delta, as well as the connectivity indices in the prediction of physicochemical properties. The interpretation is based on the concept of molecular accessibility (as introduced by Estrada, J. Phys. Chem. A 2002, 106, 9085) for which precise mathematical definitions are provided.

Vertex (graph theory)Surface (mathematics)Alkanechemistry.chemical_classificationValence (chemistry)Degree (graph theory)ChemistryGeometryGeneral ChemistryGeneral MedicineFunction (mathematics)Computer Science ApplicationsInterpretation (model theory)Computational Theory and MathematicsStatistical physicsMolecular topologyInvariant (mathematics)Information SystemsMathematicsChemInform
researchProduct

Multi-domain Feature of Event-Related Potential Extracted by Nonnegative Tensor Factorization: 5 vs. 14 Electrodes EEG Data

2012

As nonnegative tensor factorization (NTF) is particularly useful for the problem of underdetermined linear transform model, we performed NTF on the EEG data recorded from 14 electrodes to extract the multi-domain feature of N170 which is a visual event-related potential (ERP), as well as 5 typical electrodes in occipital-temporal sites for N170 and in frontal-central sites for vertex positive potential (VPP) which is the counterpart of N170, respectively. We found that the multi-domain feature of N170 from 5 electrodes was very similar to that from 14 electrodes and more discriminative for different groups of participants than that of VPP from 5 electrodes. Hence, we conclude that when the …

Vertex (graph theory)Underdetermined systemDiscriminative modelFeature (computer vision)business.industryEvent-related potentialElectrodeFeature extractionPattern recognitionArtificial intelligenceNonnegative tensor factorizationbusinessMathematics
researchProduct

QSPR Modeling of Hydrocarbon Dipole Moments by Means of Correlation Weighting of Local Graph Invariants

2003

Hydrocarbon dipole moments are calculated by means of correlation weighting of local graph invariants within the context of QSPR theory. This sort of flexible topological descriptor is used for several parameters: local invariants of k th vertex in the labeled hydrogen filled graph extended connectivity of zero-, first- and second-orders, number of paths of length 2 at k th vertex and valence shell of the k th vertex. The models predict hydrocarbon dipole moments in a quite sensible way. The best model is that one based upon numbers of path length 2 correlation weighting.

Vertex (graph theory)chemistry.chemical_classificationMathematical analysisComputer Science ApplicationsWeightingCorrelationDipoleHydrocarbonComputational Theory and MathematicsPath lengthchemistryComputational chemistrysortPhysical and Theoretical ChemistryValence electronMathematicsJournal of Theoretical and Computational Chemistry
researchProduct

Fillets:Cues for connections in Focus+Context views of graph-like diagrams

2003

We apply fillets-smoothing of sharp angles at the joints-between the connections and nodes of graph-like diagrams. In situations where the graph layout is constrained, e.g. Focus+Context views or views where the coordinates of the nodes are informative, fillets can clarify the relationships considerably without altering the layout. A visual search experiment supports our hypothesis that with fillets it is considerably easier to perceive node-connection structures. We discuss algorithms with different tradeoffs for flexibility and performance for rendering these connections in a single pass using OpenGL.

Visual searchTheoretical computer scienceComputer scienceBooksOpenGLGraph LayoutGraph theoryInformation technologyComputer scienceMechanical engineeringSmoothing methodsRendering (computer graphics)Computer graphicsTree graphsGraph (abstract data type)HumansInformation systemsInkConnectorsSmoothing
researchProduct

CN2-R: Faster CN2 with randomly generated complexes

2011

Among the rule induction algorithms, the classic CN2 is still one of the most popular ones; a great amount of enhancements and improvements to it is to witness this. Despite the growing computing capacities since the algorithm was proposed, one of the main issues is resource demand. The proposed modification, CN2-R, substitutes the star concept of the original algorithm with a technique of randomly generated complexes in order to substantially improve on running times without significant loss in accuracy.

Weighted Majority AlgorithmTheoretical computer scienceRule inductionComputer sciencePopulation-based incremental learningStability (learning theory)Online machine learningProbabilistic analysis of algorithmsAlgorithm designStar (graph theory)Algorithm2011 16th International Conference on Methods & Models in Automation & Robotics
researchProduct

Making WiFi work in multi-hop topologies: Automatic negotiation and allocation of airtime

2015

We propose a solution for mitigating the performance impairments of CSMA/CA protocols in multi-hop topologies based on the dynamic adaptation of the contention process experienced by nodes in a wireless network. A distributed protocol is used to negotiate the channel airtime for a node as a function of the traffic requirements of its neighbourhood, taking into account bandwidth reserved for the control operations. A mechanism is provided for a node to tune its contention window depending on its allocated airtime. Different from previous schemes, a node's contention window is fixed in size unless the traffic requirements of its neighbourhood change. The scheme is implemented on legacy commer…

Wireless networkbusiness.industryComputer scienceSettore ING-INF/03 - TelecomunicazioniDistributed computingmedia_common.quotation_subjectComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSTestbedCrewNeighbourhood (graph theory)TestbedNegotiation protocolNetwork topologyHop (networking)NegotiationMulti-hop WIFIComputer Networks and CommunicationControl and Systems EngineeringbusinessComputer networkmedia_common
researchProduct

Towards Stable Radial Basis Function Methods for Linear Advection Problems

2021

In this work, we investigate (energy) stability of global radial basis function (RBF) methods for linear advection problems. Classically, boundary conditions (BC) are enforced strongly in RBF methods. By now it is well-known that this can lead to stability problems, however. Here, we follow a different path and propose two novel RBF approaches which are based on a weak enforcement of BCs. By using the concept of flux reconstruction and simultaneous approximation terms (SATs), respectively, we are able to prove that both new RBF schemes are strongly (energy) stable. Numerical results in one and two spatial dimensions for both scalar equations and systems are presented, supporting our theoret…

Work (thermodynamics)AdvectionScalar (physics)Numerical Analysis (math.NA)35L65 41A05 41A30 65D05 65M12Stability (probability)Computational Mathematics10123 Institute of Mathematics510 MathematicsComputational Theory and MathematicsModeling and SimulationPath (graph theory)FOS: MathematicsApplied mathematicsRadial basis functionBoundary value problemMathematics - Numerical Analysis2605 Computational MathematicsEnergy (signal processing)Mathematics2611 Modeling and Simulation1703 Computational Theory and Mathematics
researchProduct