Visible Corrosion Damage in Carbonated Reinforced Concrete

This study discusses visible corrosion damage due to carbonation in concrete balconies and facades. The focus of the study was to find out how the age of the structure, cover depth of concrete, carbonation coefficient, capillarity of concrete and the climate affect visible corrosion damage. The research data consist of condition investigation reports of existing concrete balconies and facades built between 1948 and 1996. Balcony slabs and brushed painted facades were the most prone to visible corrosion damage. None of the researched panels met the required minimum cover depth of reinforcement even at the time of construction. However, most of the visible damage on the database was localized damage and there was not much visible corrosion damage. The carbonation coefficient of balconies was higher than the carbonation coefficient of facades. Brushed painted facade panels had clearly higher carbonation coefficient than other facade panels. The carbonation coefficient was considerably lower on white concrete panels compared to other panel types. When capillarity of concrete raises, the carbonation rate of concrete increases slightly. However, no correlation can be seen. The capillarity of concrete and the carbonation rate of concrete had a major range.

A Method of Optimizing a Set of Programs for Mitigating Threats Related to the Undertaking of a Contract for the Execution of Construction Works

This article deals with the problem of limiting the risk of taking up a construction contract for the execution of construction works. The authors have developed an advisory system that will support the analysis of threats on the basis of existing experiences for a specific activity without having to construct an individualized organizational model of an investment. In order to identify a relatively complete set of threats that occur in investment and construction processes in road construction investments, as well as to identify possible programs of their reduction, a model and a method of optimizing programs for reducing risks related to contracts was developed. Threats are considered to be possible events that take place during the preparation, implementation and settlement of any contract. The programs concern specific actions that can be taken in relation to specific threats. Every program contains a set of threats that will be limited as a result of its execution and also has a specific implementation cost. The aim of the proposed optimization is to determine, with regard to costs, a combination of risk reduction programs that is appropriate for the risk states that are accepted by a decision maker. The problem is solved using graph theory and a minimum cover determination algorithm with the use of the minimum alternative formula (mfa) of the Boolean function. A method of actively responding to identified threats during the implementation of a construction contract should take the form of an advisory system that will provide an answer as to what risks should be taken into account when undertaking a contract, as well as what actions can be taken to reduce these risks.

The method of increasing the efficiency of the man-machine system functioning by improving the quality of decision support system software

The article addresses improving the performance of man-machine systems (MMS) by improving the quality of decision support system software (DSSS). The proposed solutions are based on existing models and methods, which have been analysed in detail in a scientific study, in particular the application of methodical static application debugging in certain solutions obtained. It is proposed to use the methods for solving the problem of MMS control according to the vector criterion as the basis for solving this problem. A mechanism for synthesizing a comprehensive plan of operations to improve the quality of the DSS software is proposed, and the possibility of analysing the step-by-step implementation of a plan to obtain an analytical assessment is shown. For this purpose, a comprehensive plan is presented in the form of a relevance tree, built in accordance with the provisions of graph theory and the rank approach. The time complexity of the algorithms implementing the relevance tree tasks was evaluated. Based on the formalized solutions obtained, it was found that the maximum number of edges for a graph that implements the relevance tree does not exceed , the number of views of edges does not exceed , that is, the total number of operations that implements the scanning of edges and adding them to the weighted minimum cover (WMC) does not exceeds . It is established that during the implementation of the operation of adding ribs in the WMC, at each step, after the fixation of the previous result, the number of ribs to be examined decreases, so the total complexity of the algorithms will not exceed . The solutions obtained meet the requirements of DSTU ISO/IEC 9126, ISO DSTU / IEC 14598, and take into account the requirements of the Software Quality Requirements and Evaluation series of standards as the value of the vertices of the event tree graph. In the process of solving the problem, the specificity of the functioning of the MMS was taken into account, the possibility of formalizing various aspects of knowledge (aesthetic, disizional, causal, diontic) and ensuring a given level of efficiency in finding solutions.

A HYBRID GLOBAL IMAGE ORIENTATION METHOD FOR SIMULTANEOUSLY ESTIMATING GLOBAL ROTATIONS AND GLOBAL TRANSLATIONS

In recent years, the determination of global image orientation, i.e. global SfM, has gained a lot of attentions from researchers, mainly due to its time efficiency. Most of the global methods take relative rotations and translations as input for a two-step strategy comprised of global rotation averaging and global translation averaging. This paper by contrast presents a hybrid approach that aims to solve global rotations and translations simultaneously, but hierarchically. We first extract an optimal minimum cover connected image triplet set (OMCTS) which includes all available images with a minimum number of triplets, all of them with the three related relative orientations being compatible to each other. For non-collinear triplets in the OMCTS, we introduce some basic characterizations of the corresponding essential matrices and solve for the image pose parameters by averaging the constrained essential matrices. For the collinear triplets, on the other hand, the image pose parameters are estimated by relative orientation using the depth of object points from individual local spatial intersection. Finally, all image orientations are estimated in a common coordinate frame by traversing every solved triplet using a similarity transformation. We show results of our method on different benchmarks and demonstrate the performance and capability of the proposed approach by comparing with other global SfM methods.

Impact of Synthetic Arctic Argo-Type Floats in a Coupled Ocean–Sea Ice State Estimation Framework

The lack of continuous spatial and temporal sampling of hydrographic measurements in large parts of the Arctic Ocean remains a major obstacle for quantifying mean state and variability of the Arctic Ocean circulation. This shortcoming motivates an assessment of the utility of Argo-type floats, the challenges of deploying such floats due to the presence of sea ice, and the implications of extended times of no surfacing on hydrographic inferences. Within the framework of an Arctic coupled ocean–sea ice state estimate that is constrained to available satellite and in situ observations, we establish metrics for quantifying the usefulness of such floats. The likelihood of float surfacing strongly correlates with the annual sea ice minimum cover. Within the float lifetime of 4–5 years, surfacing frequency ranges from 10–100 days in seasonally sea ice–covered regions to 1–3 years in multiyear sea ice–covered regions. The longer the float drifts under ice without surfacing, the larger the uncertainty in its position, which translates into larger uncertainties in hydrographic measurements. Below the mixed layer, especially in the western Arctic, normalized errors remain below 1, suggesting that measurements along a path whose only known positions are the beginning and end points can help constrain numerical models and reduce hydrographic uncertainties. The error assessment presented is a first step in the development of quantitative methods for guiding the design of observing networks. These results can and should be used to inform a float network design with suggested locations of float deployment and associated expected hydrographic uncertainties.

OPTIMASI PERENCANAAN PRODUKSI DENGAN MENGGUNAKAN METODE LINEAR PROGRAMMING PADA CV. ACEH BAKERY

One purpose is to review company get advantages The Maximum and minimum cover charge thing. Many HAL should be made for a review of A Company Posted achieve these objectives, ie only prayer is how to determine Products Should TYPE WITH generated utilizing existing resources thus able to contribute Maximum AGRO. Company Must Develop CAN BE Meticulously Term Planning Production will be produced for review optimize profits WITH take into account factors such as the production of raw materials. When Paid Products produced too big Namely State exceeds the demand limit, then HAL husband will result in inaccuracies allocate factors of production is owned, thereby increasing the cost of production includes. Here Writers Wanted Looking for an alternative solution to a review AS WITH planned increase profits Production WITH progamming optimal linear method.The findings of The TIN using software TORA BY TYPE findings For green bread, CV. Aceh Bakery Must be producing as much as 152 packs / day. For TYPE bread Skinless, CV. Aceh Bakery Must be producing as much as 149 packs / day. For TYPE crusted bread, CV. Aceh Bakery Must be producing 150 packs / day. Article Search Google so, then CV. Aceh Bakery will get a profit of Rp.1.973.100, - / day.Keyword : Roti, Optimization, Linier Proggramming, TORA.

Estimation of Rearrangement Break Rates Across the Genome

Genomic rearrangements provide an important source of novel functions by recombining genes and motifs throughout and between genomes. However, understanding how rearrangement functions to shape genomes is hard because reconstructing rearrangements is a combinatoric problem which often has many solutions. In lieu of reconstructing the history of rearrangements, we answer the question of where rearrangements are occurring in the genome by remaining agnostic to the types of rearrangement and solving the simpler problem of estimating the rate at which double-strand breaks occur at every site in a genome. We phrase this problem in graph theoretic terms and find that it is a special case of the minimum cover problem for an interval graph. We employ and modify existing algorithms for efficiently solving this problem. We implement this method as a Python program, named BRAG, and use it to estimate the break rates in the genome of the model Ascomycete mold,Neurospora crassa. We find evidence that rearrangements are more common in the subtelomeric regions of the chromosomes, which facilitates the evolution of novel genes.