Filters








381,868 Hits in 5.8 sec

A weighted min-max relation for intervals

Anna Lubiw
1991 Journal of combinatorial theory. Series B (Print)  
ACKNOWLEDGMENT I thank an anonymous referee for some important corrections.  ...  In spite of the fact that the min-max equality fails for general weights Section 6 contains a polynomial time algorithm to find, for a general weight function, a maximum weight independent set in a interval  ...  This is the rectangle cover min-max relation. Equality holds iff the Boolean basis min-max equality holds for M. Further details and some properties of swath matrices can be found in [L2, Ll] .  ... 
doi:10.1016/0095-8956(91)90073-s fatcat:ymfvmwciejafvo7lcaiozsgqbm

The method of grey related analysis to multiple attribute decision making problems with interval numbers

Jijun Zhang, Desheng Wu, D.L. Olson
2005 Mathematical and computer modelling  
Interval valued indexes are used to apply multiplicative operations over interval numbers. The method is demonstrated on a practical problem.  ...  This paper presents the method of grey related analysis to this problem, using interval fuzzy numbers. The method standardizes inputs through norms of interval number vectors.  ...  The for- mula of ξ i (k) is, ξ i (k) = min i min k u − 0 (k) , u + 0 (k) − c − ik , c + ik + ρ max i max k u − 0 (k) , u + 0 (k) − c − ik , c + ik u − 0 (k) , u + 0 (k) − c − ik , c + ik + ρ max i max  ... 
doi:10.1016/j.mcm.2005.03.003 fatcat:woiijegpxrfjxms3cpof5lequy

Eight years' experience of an extended-interval dosing protocol for gentamicin in neonates

E. J. Begg, J. W. A. Vella-Brincat, B. Robertshawe, M. J. McMurtrie, C. M. J. Kirkpatrick, B. Darlow
2009 Journal of Antimicrobial Chemotherapy  
Conclusions: Extending the dose interval improved the success in achieving target C max and C min , while revision of the dosing equation did not.  ...  Aims: The aims of this study were to analyse the database to determine what percentage of neonates achieved target values for C max , C min and AUC, and to use the pharmacokinetic values of gentamicin  ...  Prolonging the dose intervals, for revised weight ranges, to achieve at least five half-lives between doses, resulted in a substantial improvement in achieving target C max (to 99% to 100%) and C min (  ... 
doi:10.1093/jac/dkp073 pmid:19299469 fatcat:eudhcn6ymjbrrpklmv25pfnbw4

Solving Over-Constrained Temporal Reasoning Problems Using Local Search [chapter]

Matthew Beaumont, John Thornton, Abdul Sattar, Michael Maher
2004 Lecture Notes in Computer Science  
performance to constraint weighting for the over-constrained problems.  ...  Given a knowledge-base consisting of temporal relations, the main reasoning problem is to determine whether the knowledge-base is satisfiable, i.e., is there a scenario which is consistent with the information  ...  Allen defined a set B of 13 basic interval relations such that any pair of time intervals satisfy exactly one basic relation.  ... 
doi:10.1007/978-3-540-28633-2_16 fatcat:yr5g2n6uffbs3fyqlr3w4vwin4

Solving Overconstrained Temporal Reasoning Problems [chapter]

Matthew Beaumont, Abdul Sattar, Michael Maher, John Thornton
2001 Lecture Notes in Computer Science  
performance to constraint weighting for the over-constrained problems.  ...  Given a knowledge-base consisting of temporal relations, the main reasoning problem is to determine whether the knowledge-base is satisfiable, i.e., is there a scenario which is consistent with the information  ...  Allen defined a set B of 13 basic interval relations such that any pair of time intervals satisfy exactly one basic relation.  ... 
doi:10.1007/3-540-45656-2_4 fatcat:gswghry2lba4pdz3gdo3pnd6za

Synchronous composition of interval weighted automata

Jan Komenda, Sébastien Lahaye, Jean-Louis Boimond
2010 IFAC Proceedings Volumes  
Interval weighted automata are introduced as automata with weights in a product dioid (idempotent semiring).  ...  They constitute an extension of (max,+) automata since they enable us to model temporal constraints (instead of exact durations) for transitions.  ...  CONCLUSION We have shown how techniques based on semirings of interval and tensor linear algebra enable modeling of an  ... 
doi:10.3182/20100830-3-de-4013.00053 fatcat:f2p5tgbprfdrvomhpljfihcbga

Scale free properties in a network-based integrated approach to earthquake pattern analysis

M. Suteanu
2014 Nonlinear Processes in Geophysics  
It is shown that networks with high values for the minimum edge weight <i>W</i><sub>min</sub> enjoy strong scaling properties, as opposed to networks with low values for <i>W</i><sub>min</sub>, which exhibit  ...  </strong> This paper proposes a network-based method for the assessment of earthquake relationships in space–time–magnitude patterns.  ...  Suteanu for useful discussions and support. Edited by: J. Kurths Reviewed by: S. Lennartz-Sassinek and one anonymous referee  ... 
doi:10.5194/npg-21-427-2014 fatcat:4p7ym4ie65bvrbs4cxh5zvt75q

Research on Interval Multiple Attribute Decision-Making Method Based on Gray Correlation Degree and TOPSIS

HAO ZHANG, XUEJUAN ZHU
2017 DEStech Transactions on Social Science Education and Human Science  
So we propose a new decision making method based on grey correlation degree and TOPSIS. It accurately evaluates interval numbers multi-attribute index scheme.  ...  Finally, an example of a multiple attribute decision making problem with intervals is given to illustrate the feasibility and validity of the proposed method.  ...  ij r ij i r ij l ij i r ij i r ij r ij i l ij T j , N i , x min x max x x max y , x min x max x x max y         Definition 3 If the weighted standardized vector is     n ... 2 , 1 i , x ..  ... 
doi:10.12783/dtssehs/hsmet2017/16510 fatcat:52rzlwaxszghhbv7vmc4r3mtyy

Page 1574 of Journal of Spacecraft and Rockets Vol. 3, Issue 11 [page]

1966 Journal of Spacecraft and Rockets  
There are three possibilities, as shown in Fig. 10, where A = max[—Voamax, min(Vi, V2), Va Ti] B = min[Vamax, Max(Vi, V2), Va T2] First, for an interval to exist, B must be greater than A; second, if there  ...  are no roots V3; and V,, the interval is from A to B; otherwise, let C = min [V3, V4] and D = max [Vs3, V;], and then the interval is from A to C if A << C < Band/or from D to Bif A < D< B.  ... 

Adapting Fuzzy Rough Sets for Classification with Missing Values [chapter]

Oliver Urs Lenz, Daniel Peralta, Chris Cornelis
2021 Lecture Notes in Computer Science  
Each of these interval-valued fuzzy sets is delineated by a pair of optimistic and pessimistic approximations.  ...  In a small experiment with real-world data, our proposal outperforms simple imputation with the mean and mode on datasets with a low missing value rate.  ...  Peralta is a Postdoctoral Fellow of the Research Foundation -Flanders (FWO, 170303/12X1619N).  ... 
doi:10.1007/978-3-030-87334-9_16 fatcat:wzqu7h5nsvgdpeyw4hxjhmtndy

Centrality Measures in Interval-Weighted Networks [article]

Hélder Alves, Paula Brito, Pedro Campos
2021 arXiv   pre-print
This paper proposes a methodology to generalize degree, closeness and betweenness centralities taking into account the variability of edge weights in the form of closed intervals (Interval-Weighted Networks  ...  However, the generalizations of the most well-known centrality measures for weighted networks, degree centrality, closeness centrality, and betweenness centrality have solely assumed the edge weights to  ...  Acknowledgements: This work was financed by the Portuguese funding agency, FCT -Fundação para a Ciência e a Tecnologia, within project UIDB/50014/2020.  ... 
arXiv:2106.10016v1 fatcat:nf7olvm52rcp3nsvpqmx45z5aa

A new fuzzy weighted average (FWA) method based on left and right scores: An application for determining a suitable location for a gas oil station

M.N. Mokhtarian
2011 Computers and Mathematics with Applications  
In this paper, we propose a new fuzzy weighted average (FWA) method based on left and right scores for fuzzy MCDM problems. Moreover, we apply the proposed method to a real application.  ...  As a result, we found that the proposed method is practical for facility location selection problems.  ...  j = Min a ij , i = 1, . . . , n ∆ Max Min = c Max j − a Min j , ∆ Min Max = a Min j − c Max j .  ... 
doi:10.1016/j.camwa.2011.03.104 fatcat:pdkmbzc3prdilna4v5kqdlmlt4

Complexity of the min–max (regret) versions of min cut problems

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
2008 Discrete Optimization  
However, for a non-constant number of scenarios, these versions become strongly NP-hard for both problems. In the interval scenario case, min-max versions are trivially polynomial.  ...  Even if the underlying problems are closely related and both polynomial, the complexities of their min-max and min-max regret versions, for a constant number of scenarios, are quite contrasted since they  ...  Acknowledgements We would like to thank the anonymous referees for their remarks that allowed us to improve the presentation of our paper.  ... 
doi:10.1016/j.disopt.2007.11.008 fatcat:w57mag7yxrd55ml4uscdkxegsq

Residuation of tropical series: Rationality issues

Eric Badouel, Anne Bouillard, Philippe Darondeau, Jan Komenda
2011 IEEE Conference on Decision and Control and European Control Conference  
Decidability of existence, rationality of delay controllers and robust delay controllers are investigated for systems with time weights in the tropical and interval semirings.  ...  Selon la (min,plus) ou (max,plus)-rationalité des séries spécifiant le système à contrôler et l'objectif du contrôle, on identifie des cas où le contrôleur défini par résiduation de séries est rationel  ...  Note that coincides in R max with the usual order relation ≤ whereas it coincides in R min with the reverse order relation ≥.  ... 
doi:10.1109/cdc.2011.6160228 dblp:conf/cdc/BadouelBDK11 fatcat:v4demwacavbzzmnzpnnavriodq

Optimal Geometric Partitions, Covers and K-Centers

Mugurel Ionut Andreica, Eliana-Dina Tirsa, Cristina Teodora Andreica, Romulus Andreica, Mihai Aristotel Ungureanu
2009 arXiv   pre-print
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and  ...  We can use the same algorithm for a max-min objective function (just remove the intervals with a weight smaller than W).  ...  Min-Max and Max-Min Weighted Covers If we are interested in covering all the points with a subset S of intervals in which the maximum weight of an interval in S is minimized, we will perform a binary search  ... 
arXiv:0908.3652v1 fatcat:k3jl6ucowrekhot4yd2gds2f7m
« Previous Showing results 1 — 15 out of 381,868 results