Creation and Spatial Analysis of 3D City Modeling based on GIS Data

The 3D city model is one of the crucial topics that are still under analysis by many engineers and programmers because of the great advancements in data acquisition technologies and 3D computer graphics programming. It is one of the best visualization methods for representing reality. This paper presents different techniques for the creation and spatial analysis of 3D city modeling based on Geographical Information System (GIS) technology using free data sources. To achieve that goal, the Mansoura University campus, located in Mansoura city, Egypt, was chosen as a case study. The minimum data requirements to generate a 3D city model are the terrain, 2D spatial features such as buildings, landscape area and street networks. Moreover, building height is an important attribute in the 3D extrusion process. The main challenge during the creation process is the dearth of accurate free datasets, and the time-consuming editing. Therefore, different data sources are used in this study to evaluate their accuracy and find suitable applications which can use the generated 3D model. Meanwhile, an accurate data source obtained using the traditional survey methods is used for the validation purpose. First, the terrain was obtained from a digital elevation model (DEM) and compared with grid leveling measurements. Second, 2D data were obtained from: the manual digitization from (30 cm) high-resolution imagery, and deep learning structure algorithms to detect the 2D features automatically using an object instance segmentation model and compared the results with the total station survey observations. Different techniques are used to investigate and evaluate the accuracy of these data sources. The procedural modeling technique is applied to generate the 3D city model. TensorFlow & Keras frameworks (Python APIs) were used in this paper; moreover, global mapper, ArcGIS Pro, QGIS and CityEngine software were used. The precision metrics from the trained deep learning model were 0.78 for buildings, 0.62 for streets and 0.89 for landscape areas. Despite, the manual digitizing results are better than the results from deep learning, but the extracted features accuracy is accepted and can be used in the creation process in the cases not require a highly accurate 3D model. The flood impact scenario is simulated as an application of spatial analysis on the generated 3D city model. Doi: 10.28991/CEJ-2022-08-01-08 Full Text: PD

Immunohistochemical Assessment of TNFAIP3/A20 Expression Correlates With Early Tumorigenesis in Breast Cancer

BACKGROUND/AIM: Limited data exist on the expression pattern of TNFAIP3/A20, as assayed by immunohistochemistry (IHC), in breast cancer tissues. This study aimed to assess A20 expression pattern in breast cancer. Materials and Methods: The expression of A20 was analysed using IHC in 50 breast cancer cases retrieved from the Sharjah Breast Cancer Center at the University Hospital Sharjah, United Arab Emirates. Omics survival data were also used to analyse its association with survival in endocrine-treated subgroups. Results: A20 expression in breast cancer tissues was 'tumor-specific', and as compared to normal tissue areas, its expression was associated with both intensity and extent in early grade 1 (p<0.0001) in all molecular subtypes. In addition, using omics survival data from a cohort of 3,520 breast cancer patients, we showed that A20 overexpression associated with lower overall survival rate in the endocrine treated subgroups [hazard ratio (HR)=2.14, 95%CI=1.61-2.82, p<0.0001]. Conclusion: A20 can serve as a biomarker for early diagnosis of breast cancers

A parametric integer programming algorithm for bilevel mixed integer programs

We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader's variables are continuous, our algorithm also detects whether the infimum cost fails to be attained, a difficulty that has been identified but not directly addressed in the literature. In this case it yields a ``better than fully polynomial time'' approximation scheme with running time polynomial in the logarithm of the relative precision. For the pure integer case where the leader's variables are integer, and hence optimal solutions are guaranteed to exist, we present two algorithms which run in polynomial time when the total number of variables is fixed.Comment: 11 page

Nonlinear Integer Programming

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of a simple version of general nonlinear integer problems, where all constraints are still linear. Our focus is on the computational complexity of the problem, which varies significantly with the type of nonlinear objective function in combination with the underlying combinatorial structure. Numerous boundary cases of complexity emerge, which sometimes surprisingly lead even to polynomial time algorithms. We also cover recent successful approaches for more general classes of problems. Though no positive theoretical efficiency results are available, nor are they likely to ever be available, these seem to be the currently most successful and interesting approaches for solving practical problems. It is our belief that the study of algorithms motivated by theoretical considerations and those motivated by our desire to solve practical instances should and do inform one another. So it is with this viewpoint that we present the subject, and it is in this direction that we hope to spark further research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50 Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2009, ISBN 354068274

An FPTAS for optimizing a class of low-rank functions over a polytope

We present a fully polynomial time approximation scheme (FPTAS) for optimizing a very general class of non-linear functions of low rank over a polytope. Our approximation scheme relies on constructing an approximate Pareto-optimal front of the linear functions which constitute the given low-rank function. In contrast to existing results in the literature, our approximation scheme does not require the assumption of quasi-concavity on the objective function. For the special case of quasi-concave function minimization, we give an alternative FPTAS, which always returns a solution which is an extreme point of the polytope. Our technique can also be used to obtain an FPTAS for combinatorial optimization problems with non-linear objective functions, for example when the objective is a product of a fixed number of linear functions. We also show that it is not possible to approximate the minimum of a general concave function over the unit hypercube to within any factor, unless P = NP. We prove this by showing a similar hardness of approximation result for supermodular function minimization, a result that may be of independent interest

Compact relaxations for polynomial programming problems

Reduced RLT constraints are a special class of Reformulation- Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-integer) quadratic programming problems subject to systems of linear equality constraints. We present an extension to the general case of polynomial programming problems and discuss the derived convex relaxation. We then show how to perform rRLT constraint generation so as to reduce the number of inequality constraints in the relaxation, thereby making it more compact and faster to solve. We present some computational results validating our approach

On the composition of convex envelopes for quadrilinear terms

International audienceWithin the framework of the spatial Branch-and-Bound algorithm for solving Mixed-Integer Nonlinear Programs, different convex relaxations can be obtained for multilinear terms by applying associativity in different ways. The two groupings ((x1x2)x3)x4 and (x1x2x3)x4 of a quadrilinear term, for example, give rise to two different convex relaxations. In [6] we prove that having fewer groupings of longer terms yields tighter convex relaxations. In this paper we give an alternative proof of the same fact and perform a computational study to assess the impact of the tightened convex relaxation in a spatial Branch-and-Bound setting

Serum Calprotectin as a Non-invasive Diagnostic Marker for Spontaneous Bacterial Peritonitis in Egyptian Cirrhotic Patients

ABSTRACT BACKGROUND and AIM: Delayed diagnosis of spontaneous bacterial peritonitis (SBP) is associated wit

Error bounds for monomial convexification in polynomial optimization

Convex hulls of monomials have been widely studied in the literature, and monomial convexifications are implemented in global optimization software for relaxing polynomials. However, there has been no study of the error in the global optimum from such approaches. We give bounds on the worst-case error for convexifying a monomial over subsets of $[0,1]^n$. This implies additive error bounds for relaxing a polynomial optimization problem by convexifying each monomial separately. Our main error bounds depend primarily on the degree of the monomial, making them easy to compute. Since monomial convexification studies depend on the bounds on the associated variables, in the second part, we conduct an error analysis for a multilinear monomial over two different types of box constraints. As part of this analysis, we also derive the convex hull of a multilinear monomial over $[-1,1]^n$.Comment: 33 pages, 2 figures, to appear in journa