{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:15Z","timestamp":1759847235377,"version":"3.37.3"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NWO","award":["613.001.208"],"award-info":[{"award-number":["613.001.208"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10287-017-0290-9","type":"journal-article","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T02:49:23Z","timestamp":1507258163000},"page":"585-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Centered solutions for uncertain linear equations"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9826-2209","authenticated-orcid":false,"given":"Jianzhe","family":"Zhen","sequence":"first","affiliation":[]},{"given":"Dick","family":"den Hertog","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,6]]},"reference":[{"key":"290_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/mana.19981920103","volume":"192","author":"G Alefeld","year":"1998","unstructured":"Alefeld G, Kreinovich V, Mayer G (1998) The shape of the solution set for systems of interval linear equations with dependent coefficients. Math Nachr 192:23\u201336","journal-title":"Math Nachr"},{"key":"290_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas E (1998) Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl Math 89:3\u201344","journal-title":"Discrete Appl Math"},{"issue":"3","key":"290_CR3","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1137\/050644471","volume":"17","author":"A Beck","year":"2006","unstructured":"Beck A, Eldar Y (2006) Strong duality in nonconvex quadratic optimization with two quadratic constrains. SIAM J Optim 17(3):844\u2013860","journal-title":"SIAM J Optim"},{"key":"290_CR4","unstructured":"Ben-Ameur W, Wang G, Ouorou A, \u0179otkiewicz M (2016) Multipolar robust optimization. http:\/\/arxiv.org\/pdf\/1604.01813.pdf"},{"issue":"2","key":"290_CR5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Program 99(2):351\u2013376","journal-title":"Math Program"},{"key":"290_CR6","series-title":"Princeton series in applied mathematics","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization. Princeton series in applied mathematics. Princeton University Press, Princeton"},{"issue":"1","key":"290_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10107-014-0750-8","volume":"149","author":"A Ben-Tal","year":"2015","unstructured":"Ben-Tal A, den Hertog D, Vial J-Ph (2015) Deriving robust counterparts of nonlinear uncertain inequalities. Math Program 149(1):265\u2013299","journal-title":"Math Program"},{"issue":"45","key":"290_CR8","doi-asserted-by":"crossref","first-page":"11433","DOI":"10.1523\/JNEUROSCI.0003-08.2008","volume":"28","author":"C Bergstrom","year":"2008","unstructured":"Bergstrom C, West J, Wiseman M (2008) The eigenfactor metrics. J Neurosci 28(45):11433\u201311434","journal-title":"J Neurosci"},{"key":"290_CR9","doi-asserted-by":"crossref","unstructured":"Blanc H, den Hertog D (2008) On Markov chains with uncertain data. CentER Discussion Paper Series No. 2008-50","DOI":"10.2139\/ssrn.1138144"},{"key":"290_CR10","unstructured":"Brin S, Page L (1999) The pagerank citation ranking: bringing order to the web. Technical report 1999-0120, vol 21. Stanford University, pp 37\u201347"},{"issue":"2","key":"290_CR11","first-page":"1","volume":"8","author":"S Burer","year":"2012","unstructured":"Burer S (2012) Robust rankings for college football. J Quant Anal Sports 8(2):1\u201322","journal-title":"J Quant Anal Sports"},{"key":"290_CR12","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.automatica.2004.01.001","volume":"40","author":"G Calafiore","year":"2004","unstructured":"Calafiore G, El Ghaoui L (2004) Ellipsoidal bounds for uncertain linear equations and dynamical systems. Automatica 40:773\u2013787","journal-title":"Automatica"},{"key":"290_CR13","unstructured":"Colley W (2001) Colley\u2019s bias free college football ranking method: the colley matrix explained. http:\/\/www.colleyrankings.com"},{"issue":"2","key":"290_CR14","first-page":"271","volume":"15","author":"B Dacorogna","year":"2008","unstructured":"Dacorogna B, Mar\u00e9chal P (2008) The role of perspective functions in convexity, polyconvexity, rank-one convexity and separate convexity. J Convex Anal 15(2):271\u2013284","journal-title":"J Convex Anal"},{"key":"290_CR15","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884179","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig G (1963) Linear programming and extensions. Princeton University Press, Princeton"},{"key":"290_CR16","unstructured":"Deloitte (2014) Mathematical sciences and their value for the Dutch economy. http:\/\/www.euro-math-soc.eu\/system\/files\/uploads\/DeloitteNL.pdf"},{"key":"290_CR17","doi-asserted-by":"crossref","unstructured":"Dreyer A (2005) Interval analysis of analog circuits with component tolerances. Ph.D. thesis, Shaker Verlag, Aachen, Germany, TU Kaiserslautern","DOI":"10.1109\/SCAN.2006.24"},{"issue":"1","key":"290_CR18","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.eswa.2012.07.019","volume":"40","author":"L Dymova","year":"2013","unstructured":"Dymova L, Sevastjanov P, Pilarek M (2013) A method for solving systems of linear interval equations applied to the leontief input\u2013output model of economics. Expert Syst Appl 40(1):222\u2013230","journal-title":"Expert Syst Appl"},{"issue":"4","key":"290_CR19","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L Ghaoui El","year":"1997","unstructured":"El Ghaoui L, Lebret H (1997) Robust solutions to least-squares problems with uncertain data. SIAM J Matrix Anal Appl 18(4):1035\u20131064","journal-title":"SIAM J Matrix Anal Appl"},{"key":"290_CR20","volume-title":"Linear optimization problems with inexact data","author":"M Fiedler","year":"2006","unstructured":"Fiedler M, Ramik J, Rohn J, Zimmermann K (2006) Linear optimization problems with inexact data. Springer, New York"},{"key":"290_CR21","unstructured":"Fourier J (1824) Reported in: analyse des travaux de l\u2019Acad\u00e9mie royale des sciences, pendant l\u2019ann\u00e9e 1824, Partie math\u00e9matique (1827). Histoire de l\u2019Academie Royale des Sciences de l\u2019Institut de France, 7: 47\u201355"},{"key":"290_CR22","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/S0098-1354(02)00005-4","volume":"26","author":"C Gau","year":"2002","unstructured":"Gau C, Stadtherr M (2002) New interval methodologies for reliable chemical process modeling. Comput Chem Eng 26:827\u2013840","journal-title":"Comput Chem Eng"},{"issue":"3","key":"290_CR23","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1287\/opre.2014.1265","volume":"62","author":"BL Gorissen","year":"2014","unstructured":"Gorissen BL, Ben-Tal A, Blanc H, den Hertog D (2014) Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets. Oper Res 62(3):672\u2013679","journal-title":"Oper Res"},{"key":"290_CR24","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1025154322278","volume":"26","author":"I Grossmann","year":"2003","unstructured":"Grossmann I, Lee S (2003) Generalized convex disjunctive programming: nonlinear convex hull relaxation. Comput Optim Appl 26:83\u2013100","journal-title":"Comput Optim Appl"},{"key":"290_CR25","doi-asserted-by":"crossref","unstructured":"Hadjiyiannis M, Goulart P, Kuhn D (2011) A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. In: Proceedings IEEE conference on decision and control and European control conference (CDC-ECC), pp 7386\u20137391","DOI":"10.1109\/CDC.2011.6161342"},{"key":"290_CR26","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1137\/0729086","volume":"29","author":"E Hansen","year":"1992","unstructured":"Hansen E (1992) Bounding the solution of interval linear equations. SIAM J Numer Anal 29:1493\u20131503","journal-title":"SIAM J Numer Anal"},{"issue":"3","key":"290_CR27","doi-asserted-by":"crossref","first-page":"561","DOI":"10.2478\/v10006-012-0043-4","volume":"22","author":"M Hlad\u00edk","year":"2012","unstructured":"Hlad\u00edk M (2012) Enclosures for the solution set of parametric interval linear systems. Int J Appl Math Comput Sci 22(3):561\u2013574","journal-title":"Int J Appl Math Comput Sci"},{"issue":"1","key":"290_CR28","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/130914358","volume":"52","author":"M Hlad\u00edk","year":"2014","unstructured":"Hlad\u00edk M (2014) New operator and method for solving real preconditioned interval linear equations. SIAM J Numer Anal 52(1):194\u2013206","journal-title":"SIAM J Numer Anal"},{"key":"290_CR29","first-page":"606","volume":"270","author":"M Hlad\u00edk","year":"2015","unstructured":"Hlad\u00edk M, Popova E (2015) Maximal inner boxes in parametric ae-solution sets with linear shape. SIAM J Numer Anal 270:606\u2013619","journal-title":"SIAM J Numer Anal"},{"key":"290_CR30","unstructured":"Inc ILOG (2016) ILOG CPLEX 12.7, User Manual"},{"key":"290_CR31","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0024-3795(96)00681-7","volume":"251","author":"C Jansson","year":"1997","unstructured":"Jansson C (1997) Calculation of exact bounds for the solution set of linear interval systems. Linear Algebra Appl 251:321\u2013340","journal-title":"Linear Algebra Appl"},{"key":"290_CR32","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10107-013-0716-2","volume":"147","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar V, Li G (2014) Trust-region problems with linear inequality constrains: exact sdp relaxation, global optimality and robust optimization. Math Program Ser A 147:171\u2013206","journal-title":"Math Program Ser A"},{"key":"290_CR33","doi-asserted-by":"crossref","unstructured":"Juditsky A, Polyak B (2012) Robust eigenvector of a stochastic matrix with application to PageRank. In: Proceedings of 51th IEEE conference on decision and control, pp 3171\u20133176","DOI":"10.1109\/CDC.2012.6426431"},{"key":"290_CR34","doi-asserted-by":"crossref","DOI":"10.1142\/2039","volume-title":"Interval methods for circuit analysis","author":"L Kolev","year":"1993","unstructured":"Kolev L (1993) Interval methods for circuit analysis. World Scientific, Singapore"},{"key":"290_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2793-7","volume-title":"Computational complexity and feasibility of data processing and interval computations","author":"V Kreinovich","year":"1998","unstructured":"Kreinovich V, Lakeyev A, Rohn J, Kahl P (1998) Computational complexity and feasibility of data processing and interval computations. Kluwer Academic Publishers, Dordrecht"},{"key":"290_CR36","volume-title":"Input\u2013output economics","author":"W Leontief","year":"1986","unstructured":"Leontief W (1986) Input\u2013output economics, 2nd edn. Oxford University Press, New York","edition":"2"},{"key":"290_CR37","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to interval analysis","author":"R Moore","year":"2009","unstructured":"Moore R, Kearfott R, Cloud M (2009) Introduction to interval analysis. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"290_CR38","unstructured":"MOSEK ApS (2017) The MOSEK optimization toolbox for MATLAB manual. Version 8. http:\/\/docs.mosek.com\/8.0\/toolbox.pdf"},{"key":"290_CR39","unstructured":"Motzkin T (1936) Beitr\u00e4ge zur Theorie der linearen Ungleichungen. University Basel Dissertation, Jerusalem, Israel"},{"key":"290_CR40","unstructured":"Muhanna L, Erdolen A (2006) Geometric uncertainty in truss systems: an interval approach. In: Muhanna RL (ed) Proceedings of the NSF workshop on reliable engineering computing: modeling errors and uncertainty in engineering computations, Savannah, Georgia USA, 22\u201324 Feb, pp 239\u2013247"},{"key":"290_CR41","volume-title":"Interval methods for systems of equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier A (1990) Interval methods for systems of equations. Cambridge University Press, Cambridge"},{"issue":"4","key":"290_CR42","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1137\/S0036142994270995","volume":"34","author":"S Ning","year":"1997","unstructured":"Ning S, Kearfott R (1997) A comparison of some methods for solving linear interval equations. SIAM J Numer Anal 34(4):1298\u20131305","journal-title":"SIAM J Numer Anal"},{"key":"290_CR43","first-page":"115","volume":"2","author":"W Oettli","year":"1965","unstructured":"Oettli W (1965) On the solution set of a linear system with inaccurate coefficients. SIAM J Numer Anal 2:115\u2013118","journal-title":"SIAM J Numer Anal"},{"key":"290_CR44","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/BF01386090","volume":"6","author":"W Oettli","year":"1964","unstructured":"Oettli W, Prager W (1964) Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numer Math 6:402\u2013409","journal-title":"Numer Math"},{"key":"290_CR45","doi-asserted-by":"crossref","unstructured":"Polyak B, Timonina A (2011) Pagerank: new regularizations and simulation models. Preprints of the 18th IFAC World Congress, Milano, Italy","DOI":"10.3182\/20110828-6-IT-1002.01870"},{"issue":"1\u20134","key":"290_CR46","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/B:NUMA.0000049480.57066.fa","volume":"37","author":"E Popova","year":"2004","unstructured":"Popova E (2004) Parametric interval linear solver. Numer Algorithms 37(1\u20134):345\u2013356","journal-title":"Numer Algorithms"},{"issue":"4","key":"290_CR47","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1137\/120870359","volume":"33","author":"E Popova","year":"2012","unstructured":"Popova E (2012) Explicit description of ae solution sets for parametric linear systems. SIAM J Matrix Anal Appl 33(4):1172\u20131189","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"9","key":"290_CR48","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1016\/j.camwa.2014.04.005","volume":"68","author":"E Popova","year":"2014","unstructured":"Popova E (2014) Improved enclosure for some parametric solution sets with linear shape. J Comput Appl Math 68(9):994\u20131005","journal-title":"J Comput Appl Math"},{"issue":"2","key":"290_CR49","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/140966459","volume":"36","author":"E Popova","year":"2015","unstructured":"Popova E (2015) Solvability of parametric interval linear systems of equations and inequalities. SIAM J Matrix Anal Appl 36(2):615\u2013633","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"2","key":"290_CR50","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.cam.2005.08.048","volume":"199","author":"E Popova","year":"2007","unstructured":"Popova E, Kr\u00e4mer W (2007) Inner and outer bounds for the solution set of parametric linear systems. J Comput Appl Math 199(2):310\u2013316","journal-title":"J Comput Appl Math"},{"key":"290_CR51","volume-title":"Input\u2013output planning with inexact data. Freiburger Intervall-Berichte 78\/9","author":"J Rohn","year":"1978","unstructured":"Rohn J (1978) Input\u2013output planning with inexact data. Freiburger Intervall-Berichte 78\/9. Albert-Ludwigs-Universit\u00e4t, Freiburg"},{"key":"290_CR52","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(81)90298-6","volume":"39","author":"J Rohn","year":"1981","unstructured":"Rohn J (1981) Interval linear systems with prescribed column sums. Linear Algebra Appl 39:143\u2013148","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"290_CR53","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1137\/S0895479893251198","volume":"16","author":"J Rohn","year":"1995","unstructured":"Rohn J, Kreinovich V (1995) Computing exact componentwise bounds on solutions of lineary systems with interval data is NP-hard. SIAM J Matrix Anal Appl 16(2):415\u2013420","journal-title":"SIAM J Matrix Anal Appl"},{"key":"290_CR54","unstructured":"R\u00f6mer M (2010) Von der Komplexmethode zur robusten Optimierung und zur\u00fcck. In: Beitr\u00e4ge Zum Festkolloquium \u201cAngewandte Optimierung\u201d Anl\u00e4sslich Des 65. Geburtstags von Prof. Rolf Rogge. Diskussionsbeitr\u00e4ge Zu Wirtschaftsinformatik Und Operations Research, Nr 23, Halle (Saale), pp 38\u201361"},{"key":"290_CR55","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S096249291000005X","volume":"19","author":"S Rump","year":"2010","unstructured":"Rump S (2010) Verification methods: Rigorous results using floating-point arithmetic. Acta Numer 19:287\u2013449","journal-title":"Acta Numer"},{"key":"290_CR56","unstructured":"Shary S (2011) Konechnomernyi interval\u2019nyi analiz (finite-dimensional interval analysis). Novosibirsk. http:\/\/www.nsc.ru\/interval\/Library\/InteBooks\/"},{"key":"290_CR57","doi-asserted-by":"crossref","unstructured":"Smith R (1984) Efficient monte carlo procedures for generating points uniformly distributed over bounded regions. Oper Res 32:1296\u20131308","DOI":"10.1287\/opre.32.6.1296"},{"issue":"11","key":"290_CR58","first-page":"1","volume":"4","author":"A Smith","year":"2012","unstructured":"Smith A, Garloff J, Werkle H (2012) Verified solution for a statically determinate truss structure with uncertain node locations. J Civ Eng Archit 4(11):1\u201310","journal-title":"J Civ Eng Archit"},{"issue":"5","key":"290_CR59","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A Soyster","year":"1973","unstructured":"Soyster A (1973) Convex programming with set-inclusive constraints. Oper Res 21(5):1154\u20131157","journal-title":"Oper Res"},{"key":"290_CR60","unstructured":"Thomson-Reuters Corp (2014) Journal citation reports. Web of Science, Accessed 23 March 2015"},{"key":"290_CR61","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01415936","volume":"6","author":"R Tichatschke","year":"1989","unstructured":"Tichatschke R, Hettich R, Still G (1989) Connections between generalized, inexact and semi-infinite linear programming. Methods Models Oper Res 6:367\u2013382","journal-title":"Methods Models Oper Res"},{"key":"290_CR62","unstructured":"Tiwary H (2008) On computing the shadows and slices of polytopes. CoRR, abs\/0804.4150. http:\/\/arxiv.org\/abs\/0804.4150"},{"key":"290_CR63","unstructured":"Wolfe P (2017) Peter Wolfe\u2019s college football website. http:\/\/prwolfe.bol.ucla.edu\/cfootball\/ . Accessed 10 July 2017"},{"key":"290_CR64","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.automatica.2016.09.016","volume":"75","author":"X Zhang","year":"2017","unstructured":"Zhang X, Kamgarpour M, Georghiou A, Goulart P, Lygeros J (2017) Robust optimal control with adjustable uncertainty sets. Automatica 75:249\u2013259","journal-title":"Automatica"},{"key":"290_CR65","doi-asserted-by":"crossref","unstructured":"Zhen J, den Hertog D (2017) Computing the maximum volume inscribed ellipsoid of a polytopic projection. INFORMS J Comput. http:\/\/www.optimization-online.org\/DB_HTML\/2015\/01\/4749.html (to appear)","DOI":"10.2139\/ssrn.2553293"},{"key":"290_CR66","unstructured":"Zhen J, den Hertog D, Sim M (2016) Adjustable robust optimization via fourier\u2013motzkin elimination. http:\/\/www.optimization-online.org\/DB_FILE\/2016\/07\/5564.pdf"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-017-0290-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-017-0290-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-017-0290-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:23:25Z","timestamp":1570166605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-017-0290-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":66,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["290"],"URL":"https:\/\/doi.org\/10.1007\/s10287-017-0290-9","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}