Search results for "Mathematica"

showing 10 items of 7971 documents

PINCoC: a Co-Clustering based Method to Analyze Protein-Protein Interaction Networks

2007

Anovel technique to search for functionalmodules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the undirected graph modelling it. The algorithm introduces the concept of quality of a sub-matrix of the adjacency matrix, and applies a greedy search technique for finding local optimal solutions made of dense submatrices containing the maximum number of ones. An initial random solution, constituted by a single protein, is evolved to search for a locally optimal solution by adding/removing connected proteins that best contribute to improve the quality function. Experimental evaluations carried out on Saccaromyces Cerevis…

BiclusteringMathematical optimizationBioinformatics network analysisCompact spaceInteraction networkBlock matrixFunction (mathematics)Adjacency matrixGreedy algorithmAlgorithmProtein protein interaction networkMathematics
researchProduct

Computation of the area in the discrete plane: Green’s theorem revisited

2017

International audience; The detection of the contour of a binary object is a common problem; however, the area of a region, and its moments, can be a significant parameter. In several metrology applications, the area of planar objects must be measured. The area is obtained by counting the pixels inside the contour or using a discrete version of Green's formula. Unfortunately, we obtain the area enclosed by the polygonal line passing through the centers of the pixels along the contour. We present a modified version of Green's theorem in the discrete plane, which allows for the computation of the exact area of a two-dimensional region in the class of polyominoes. Penalties are introduced and …

Binary Objectcontour detectionPolyominoComputationGeometry0102 computer and information sciences02 engineering and technology01 natural sciencesconnectednessPick's theoremsymbols.namesake0202 electrical engineering electronic engineering information engineeringPick's theoremElectrical and Electronic EngineeringGreen's theoremMathematicsDigital picturesPixelMathematical analysisImage segmentationAtomic and Molecular Physics and OpticsComputer Science Applications[SPI.TRON]Engineering Sciences [physics]/Electronics010201 computation theory & mathematics[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]Binary datasymbols[SPI.OPTI]Engineering Sciences [physics]/Optics / Photonic020201 artificial intelligence & image processingpolyominoesGreen's theorem
researchProduct

A new compact formulation for the discrete p-dispersion problem

2017

Abstract This paper addresses the discrete p -dispersion problem (PDP) which is about selecting  p facilities from a given set of candidates in such a way that the minimum distance between selected facilities is maximized. We propose a new compact formulation for this problem. In addition, we discuss two simple enhancements of the new formulation: Simple bounds on the optimal distance can be exploited to reduce the size and to increase the tightness of the model at a relatively low cost of additional computation time. Moreover, the new formulation can be further strengthened by adding valid inequalities. We present a computational study carried out over a set of large-scale test instances i…

Binary search algorithmMathematical optimization021103 operations researchInformation Systems and ManagementLine searchGeneral Computer Science0211 other engineering and technologies0102 computer and information sciences02 engineering and technologyManagement Science and Operations ResearchSolver01 natural sciencesIndustrial and Manufacturing EngineeringFacility location problemSet (abstract data type)010201 computation theory & mathematicsModeling and SimulationProgramming paradigmInteger programmingAlgorithmStandard model (cryptography)MathematicsEuropean Journal of Operational Research
researchProduct

Optimal standalone data center renewable power supply using an offline optimization approach

2022

Abstract Because of the increasing energy consumption of data centers and their C O 2 emissions, the ANR DATAZERO2 project aims to design autonomous data centers running solely on local renewable energy coupled with storage devices to overcome the intermittency issue. In order to optimize the use of renewable energy and storage devices, a MILP solver is usually in charge of assigning the power to be supplied to the data center. However, in order to reduce the computation time and make the approach scalable, it would be more appropriate to use a polynomial time algorithm. This paper aims at showing and proving that it is possible to provide an optimal power profile via a deterministic algori…

Binary search algorithmMathematical optimizationGeneral Computer Sciencebusiness.industryDeterministic algorithmComputer scienceEnergy consumptionSolverRenewable energyScalabilityData centerElectrical and Electronic EngineeringbusinessTime complexitySustainable Computing: Informatics and Systems
researchProduct

Phase separation of symmetrical polymer mixtures in thin-film geometry

1995

Monte Carlo simulations of the bond fluctuation model of symmetrical polymer blends confined between two “neutral” repulsive walls are presented for chain lengthNA=NB=32 and a wide range of film thicknessD (fromD=8 toD=48 in units of the lattice spacing). The critical temperaturesTc(D) of unmixing are located by finite-size scaling methods, and it is shown that\(T_c (\infty ) - T_c (D) \propto D^{ - {1 \mathord{\left/ {\vphantom {1 {v_3 }}} \right. \kern-\nulldelimiterspace} {v_3 }}} \), wherev3≈0.63 is the correlation length exponent of the three-dimensional Ising model universality class. Contrary to this result, it is argued that the critical behavior of the films is ruled by two-dimensi…

BinodalLattice constantCondensed matter physicsExponentStatistical and Nonlinear PhysicsObservableIsing modelRenormalization groupCritical exponentMathematical PhysicsFlatteningMathematicsJournal of Statistical Physics
researchProduct

Exponential Relaxation out of Nonequilibrium

1989

Simulation results are presented for a quench from a disordered state to a state below the coexistence curve. The model which we consider is the Ising model but with the dynamics governed by the Swendsen-Wang transition probabilities. We show that the resulting domain growth has an exponential instead of a power law behaviour and that the system is non-self-averaging while in nonequilibrium. The simulations were carried out on a parallel computer with up to 128 processors.

BinodalPhysicsCondensed Matter::Statistical MechanicsGeneral Physics and AstronomyRelaxation (physics)Non-equilibrium thermodynamicsIsing modelStatistical physicsState (functional analysis)Power lawDomain (mathematical analysis)Exponential functionEurophysics Letters (EPL)
researchProduct

Splittings of Toric Ideals

2019

Let $I \subseteq R = \mathbb{K}[x_1,\ldots,x_n]$ be a toric ideal, i.e., a binomial prime ideal. We investigate when the ideal $I$ can be "split" into the sum of two smaller toric ideals. For a general toric ideal $I$, we give a sufficient condition for this splitting in terms of the integer matrix that defines $I$. When $I = I_G$ is the toric ideal of a finite simple graph $G$, we give additional splittings of $I_G$ related to subgraphs of $G$. When there exists a splitting $I = I_1+I_2$ of the toric ideal, we show that in some cases we can describe the (multi-)graded Betti numbers of $I$ in terms of the (multi-)graded Betti numbers of $I_1$ and $I_2$.

Binomial (polynomial)Betti numberPrime idealExistential quantificationCommutative Algebra (math.AC)01 natural sciencesCombinatoricsInteger matrixMathematics::Algebraic Geometry0103 physical sciencesFOS: MathematicsGraded Betti numbers; Graphs; Toric idealsMathematics - Combinatorics0101 mathematicsMathematics::Symplectic GeometryMathematicsAlgebra and Number TheorySimple graphIdeal (set theory)Mathematics::Commutative AlgebraGraded Betti numbers Graphs Toric ideals010102 general mathematicsMathematics::Rings and Algebras16. Peace & justiceMathematics - Commutative AlgebraSettore MAT/02 - AlgebraToric ideals13D02 13P10 14M25 05E40Settore MAT/03 - Geometria010307 mathematical physicsCombinatorics (math.CO)Graded Betti numbersGraphs
researchProduct

Profesors Jurijs Klokovs: biobibliogrāfiskais rādītājs

1990

Saturs: Priekšvārds. Fizikas un matemātikas zinātņu doktors profesors Jurijs Kolokovs / N. Vasiļjevs, P. Sadirbajevs. Profesora J. Kolokova publicētie darbi (1958.-1989.) J. Kolokova rediģētie un recenzētie darbi. J. Kolokova vadītās disertācijas. Literatūra par profesoru J. Kolokovu. Profesora J. Kolokova darbu alfabētiskais rādītājs. Personu rādītājs.

Biobibliogrāfiskie rādītājiDiferenciālvienādojumi - bibliogrāfiskais rādītājsMatemātiskā fizika - bibliogrāfiskais rādītājsProfessors of the Latvian UniversityHistory of the University of LatviaMatemātika - bibliogrāfiskais rādītājsМатематический анализ - библиографический указательMatemātiskā analīze - bibliogrāfiskais rādītājs:MATHEMATICS::Algebra geometry and mathematical analysis::Mathematical analysis [Research Subject Categories]Fizikas un matemātikas profesori Latvijas UnivesitātēLatvijas Universitātes vēstureLatvijas Universitātes profesoriP. Stučkas Latvijas Valsts universitātes profesori
researchProduct

A hydrodynamic water quality model for propagation of pollutants in rivers.

2010

Numerical modelling can be a useful tool to assess a receiving water body's quality state. Indeed, the use of mathematical models in river water quality management has become a common practice to show the cause-effect relationship between emissions and water body quality and to design as well as assess the effectiveness of mitigation measures. In the present study, a hydrodynamic river water quality model is presented. The model consists of a quantity and a quality sub-model. The quantity sub-model is based on the Saint Venant equations. The solution of the Saint Venant equations is obtained by means of an explicit scheme based on space-time conservation. The method considers the unificatio…

Biochemical oxygen demandState variableEnvironmental EngineeringQuality managementpollution propagationSettore ICAR/03 - Ingegneria Sanitaria-AmbientaleMathematical modelAdvectionadvectionSettore ICAR/02 - Costruzioni Idrauliche E Marittime E IdrologiaEnvironmental engineeringModels TheoreticalItalyRiversData qualityEnvironmental sciencedispersionWater qualityunsteady flowShallow water equationsMonte Carlo MethodWater Pollutants Chemicalreceiving streamWater Science and TechnologyEnvironmental MonitoringWater science and technology : a journal of the International Association on Water Pollution Research
researchProduct

Natural Language Parsing

2009

Automatic natural language processing captures a lion’s share of the attention in open information management. In one way or another, many applications have to deal with natural language input. In this chapter the authors investigate the problem of natural language parsing from the perspective of biolinguistics. They argue that the human mind succeeds in the parsing task without the help of languagespecific rules of parsing and language-specific rules of grammar. Instead, there is a universal parser incorporating a universal grammar. The main argument comes from language acquisition: Children cannot learn language specific parsing rules by rule induction due to the complexity of unconstrain…

BiolinguisticsComputer science05 social sciencesMinimalism (technical communication)Natural language parsingcomputer.software_genre050105 experimental psychologyLinguistics03 medical and health sciencesTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES0302 clinical medicine0501 psychology and cognitive sciencesMinimalist programcomputer030217 neurology & neurosurgeryNatural language
researchProduct