scholarly journals Optimization of Layout and Pipe Sizes for Irrigation Pipe Distribution Network Using Steiner Point Concept

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Preeti Walmik Gajghate ◽  
Ashwini Mirajkar ◽  
Uzma Shaikh ◽  
Neeraj Dhanraj Bokde ◽  
Zaher Mundher Yaseen
Keyword(s):  
Steiner Tree ◽  
Minimum Spanning Tree ◽  
Minimum Length ◽  
Irrigation Network ◽  
Analysis And Design ◽  
Two Phases ◽  
Large Irrigation ◽  
The Cost ◽  
Total Project Cost ◽  
Looped Network

In tropical countries like India, irrigation is necessary to grow crops in the nonmonsoon period. The conventional methodology for conveying irrigation water from the source to the field is through open canals. However, considering huge losses due to evaporation and percolation, a modern system of irrigation like pipe irrigation network (PIN) is desired. Advancement in technology has led to the progress in the PIN as they are compatible with modern irrigation facilities such as sprinkler and drip irrigation systems. In the present study, the layout of the PIN is designed and optimized in two phases. Initially, the looped network is traced out for the Bakhari distributary of the Kanhan Branch Canal, India. Minimum spanning tree (MST) network is obtained from the looped network using Prim's algorithm to calculate the nodal demands. The layout optimization of the MST is carried out using the Steiner concept to obtain the initial Steiner tree (IST). The steady-state hydraulic analysis and design are carried out for the looped and IST network. The results show that the percentage of length decreasing from the looped network to the MST network is 51.58%. The IST network is the optimized network having the minimum length showing a 12.21% length reduction compared to the MST network. The total reduction in the cost of the Steiner tree is found to be 4.25% compared to the looped network. Steiner concept application to large irrigation networks can reduce the length of the network thereby minimizing the total project cost.

scholarly journals A Constant-Factor Approximation for the Generalized Cable-Trench Problem

2019 ◽  
Author(s):  
Marcelo Benedito ◽  
Lehilton Pedrosa ◽  
Hugo Rosado
Keyword(s):  
Shortest Path ◽  
Steiner Tree ◽  
Spanning Tree ◽  
Optimization Problem ◽  
Minimum Spanning Tree ◽  
Weighted Graph ◽  
Constant Factor ◽  
Steiner Tree Problem ◽  
Negative Factor ◽  
Path Lengths

In the Cable-Trench Problem (CTP), the objective is to find a rooted spanning tree of a weighted graph that minimizes the length of the tree, scaled by a non-negative factor , plus the sum of all shortest-path lengths from the root, scaled by another non-negative factor. This is an intermediate optimization problem between the Single-Destination Shortest Path Problem and the Minimum Spanning Tree Problem. In this extended abstract, we consider the Generalized CTP (GCTP), in which some vertices need not be connected to the root, but may serve as cost-saving merging points; this variant also generalizes the Steiner Tree Problem. We present an 8.599-approximation algorithm for GCTP. Before this paper, no constant approximation for the standard CTP was known.

scholarly journals FUZZY SHORTEST ROUTE ALGORITHM FOR TELEPHONE LINE CONNECTION USING THE LC-MST ALGORITHM

2015 ◽  
Vol 2 (2) ◽  
pp. 37-39
Author(s):  
Vijayalakshmi D ◽  
Kalaivani R
Keyword(s):  
Transmission Lines ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Minimum Cost ◽  
Distribution Networks ◽  
Minimum Length ◽  
Fuzzy Graph ◽  
Telephone Line ◽  
Water Pipelines ◽  
Communication Links

In computer science, there are many algorithms that finds a minimum spanning tree for a connected weighted undirected fuzzy graph. The minimum length (or cost) spanning tree problem is one of the nicest and simplest problems in network optimization, and it has a wide variety of applications. The problem is tofind a minimum cost (or length) spanning tree in G. Applications include the design of various types of distribution networks in which the nodes represent cities, centers etc.; and edges represent communication links (fiber glass phone lines, data transmission lines, cable TV lines, etc.), high voltage power transmissionlines, natural gas or crude oil pipelines, water pipelines, highways, etc. The objective is to design a network that connects all the nodes using the minimum length of cable or pipe or other resource in this paper we find the solution to the problem is to minimize the amount of new telephone line connection using matrixalgorithm with fuzzy graph.

scholarly journals The Correlation Analysis of Maintenance Costs to Sei Siulak Deras Irrigation Network Infrastructure Performance

2019 ◽  
Vol 3 (2) ◽  
pp. 71-74
Author(s):  
Frans Dhana ◽  
Dinar Dwi Anugerah Putranto ◽  
Betty Susanti
Keyword(s):  
Correlation Analysis ◽  
Strong Relationship ◽  
Network Infrastructure ◽  
Irrigation Network ◽  
Maintenance Costs ◽  
Irrigation Area ◽  
The Government ◽  
Infrastructure Performance ◽  
The Cost ◽  
The Relationship

Sei Siulak Deras Irrigation Area is one of the Irrigation Areas located in Kerinci Regency based on the decision of Dinas Pekerjaan Umum dan Perumahan Rakyat (PUPR) regulations No.12/PRT/M/2015 concerning criteria and estabishment of Irrigation Area status with an area of 5,801 Ha. The authority for operational and maintenance implementation is handled by the Dinas PUPR of Jambi Province ( RTRW of Jambi Province, 2013). The performance of the Sei Siulak Deras irrigation network infrastructure is inseparable from the available maintenance budget, for this reason, it is necessary to conduct a study that analyzes the relationship between routine maintenance costs for the performance of irrigation network infrastructure in the Sei Siulak Deras irrrigation area of Kerinci District, Jambi Province.  In this study an examination of the existing conditions of irrigation networks involving 1 observer and 6 irrigation workers, the irrigation network inspection using the standards issued by the Operation and Maintenance Agency of the Dinas PUPR of Jambi Province. From the results of the correlation analysis the cost of routine maintenance on the performance of irrigation network infrastructure is 0.9, this indicates a strong relationship between the two variables. While the maintenance budget allocated by the government to the maintenance of irrigation network infrastructure is very lacking, amounting to IDR 806,081,000 from the budget for the maintenance of irrigation network infrastructure of IDR 3,580,984,372.57.

scholarly journals Variety Discrimination Power: An Appraisal Index for Loci Combination Screening Applied to Plant Variety Discrimination

2021 ◽  
Vol 12 ◽  
Author(s):  
Yang Yang ◽  
Hongli Tian ◽  
Rui Wang ◽  
Lu Wang ◽  
Hongmei Yi ◽  
...  
Keyword(s):  
Molecular Marker ◽  
Simulated Data ◽  
Real Data ◽  
Total Probability ◽  
Discrimination Power ◽  
Plant Variety ◽  
Appraisal Index ◽  
Two Phases ◽  
Threshold Setting ◽  
The Cost

Molecular marker technology is used widely in plant variety discrimination, molecular breeding, and other fields. To lower the cost of testing and improve the efficiency of data analysis, molecular marker screening is very important. Screening usually involves two phases: the first to control loci quality and the second to reduce loci quantity. To reduce loci quantity, an appraisal index that is very sensitive to a specific scenario is necessary to select loci combinations. In this study, we focused on loci combination screening for plant variety discrimination. A loci combination appraisal index, variety discrimination power (VDP), is proposed, and three statistical methods, probability-based VDP (P-VDP), comparison-based VDP (C-VDP), and ratio-based VDP (R-VDP), are described and compared. The results using the simulated data showed that VDP was sensitive to statistical populations with convergence toward the same variety, and the total probability of discrimination power (TDP) method was effective only for partial populations. R-VDP was more sensitive to statistical populations with convergence toward various varieties than P-VDP and C-VDP, which both had the same sensitivity; TDP was not sensitive at all. With the real data, R-VDP values for sorghum, wheat, maize and rice data begin to show downward tendency when the number of loci is 20, 7, 100, 100 respectively, while in the case of P-VDP and C-VDP (which have the same results), the number is 6, 4, 9, 19 respectively and in the case of TDP, the number is 6, 4, 4, 11 respectively. For the variety threshold setting, R-VDP values of loci combinations with different numbers of loci responded evenly to different thresholds. C-VDP values responded unevenly to different thresholds, and the extent of the response increased as the number of loci decreased. All the methods gave underestimations when data were missing, with systematic errors for TDP, C-VDP, and R-VDP going from smallest to biggest. We concluded that VDP was a better loci combination appraisal index than TDP for plant variety discrimination and the three VDP methods have different applications. We developed the software called VDPtools, which can calculate the values of TDP, P-VDP, C-VDP, and R-VDP. VDPtools is publicly available athttps://github.com/caurwx1/VDPtools.git.

scholarly journals Analysis and design of wastewater treatment

2018 ◽  
Vol 2 (3) ◽  
pp. 121-135
Author(s):  
Jordan Andres P. Pinoargote ◽  
Jennifer Tatiana R. Alcivar ◽  
Carlos G. Villacreses Viteri
Keyword(s):  
Wastewater Treatment ◽  
Structural Design ◽  
Treatment System ◽  
Residual Water ◽  
Analysis And Design ◽  
Agricultural Engineering ◽  
Physical Chemical ◽  
Technical University ◽  
The Cost ◽  
The City

The work proposes the reuse of wastewater from the Faculty of Agronomic Engineering of the Technical University of Manabí, located in the Lodana parish in the city of Portoviejo, to irrigate the diversity of plantations that exist in the institution as a banana, cocoa and lemon. In the work, the results of the physical-chemical and bacteriological analysis carried out on the residual water generated in the institution are offered, being able to verify that it does not meet the parameters required to be used in the irrigation of crops. The technical scheme of the proposed treatment system is shown, specifying the structure of the zeolite filter. The calculations made for the technical and structural design of each of the devices that make up the proposed treatment system are provided. The analysis of the performance of the system that is illustrated with a series of data reflected in tables is exposed and where an efficiency between 84% and 88% can be verified. A review of compliance with environmental regulations is carried out and an economic analysis is provided on the cost of the investment for the introduction of the system in the Faculty of Agricultural Engineering of the Technical University of Manabí.

scholarly journals Algorithms for the power-p Steiner tree problem in the Euclidean plane

2018 ◽  
Vol 25 (4) ◽  
pp. 28
Author(s):  
Christina Burt ◽  
Alysson Costa ◽  
Charl Ras
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Valid Inequalities ◽  
Minimum Cost ◽  
Performance Ratio ◽  
Mixed Integer ◽  
Steiner Tree Problem ◽  
Steiner Points ◽  
Tree Construction ◽  
The Cost

We study the problem of constructing minimum power-$p$ Euclidean $k$-Steiner trees in the plane. The problem is to find a tree of minimum cost spanning a set of given terminals where, as opposed to the minimum spanning tree problem, at most $k$ additional nodes (Steiner points) may be introduced anywhere in the plane. The cost of an edge is its length to the power of $p$ (where $p\geq 1$), and the cost of a network is the sum of all edge costs. We propose two heuristics: a ``beaded" minimum spanning tree heuristic; and a heuristic which alternates between minimum spanning tree construction and a local fixed topology minimisation procedure for locating the Steiner points. We show that the performance ratio $\kappa$ of the beaded-MST heuristic satisfies $\sqrt{3}^{p-1}(1+2^{1-p})\leq \kappa\leq 3(2^{p-1})$. We then provide two mixed-integer nonlinear programming formulations for the problem, and extend several important geometric properties into valid inequalities. Finally, we combine the valid inequalities with warm-starting and preprocessing to obtain computational improvements for the $p=2$ case.

scholarly journals Reproductive and cost assessment of a seasonal breeding program with Bos indicus in tropical Mexico

2021 ◽  
Vol 26 (2) ◽  
pp. e2130
Author(s):  
José Francisco Martínez-Albarrán ◽  
Carlos Salvador Galina-Hidalgo ◽  
Ivette Rubio-Gutiérrez ◽  
Wendy Leticia Balam-Villarreal ◽  
Manuel D. Corro-Morales
Keyword(s):  
Pregnancy Rate ◽  
Breeding Season ◽  
Phase 1 ◽  
Bos Indicus ◽  
Fixed Time ◽  
Breeding Program ◽  
Tropical Region ◽  
Two Phases ◽  
One Year ◽  
The Cost

Objective. To compare the reproductive performance of postpartum and open Bos indicus cows and to study the cost effectiveness of retaining non-pregnant animals after a short breeding season in tropical region of Mexico. Material and Methods. A total of 128 Bos indicus were included, 87 postpartum cows (PP) with ≤90 days after calving and 41 open cows (OC) with >90 days open. The study was divided into three phases: 1) Estrus synchronization followed by FTAI (day 0-10), 2) Estrus detection and AI (day 11-45) and 3) Natural mating (day 46-90). For the first phase, all animals were synchronized and AI at fixed time (day 10). Cows displaying overt signs of estrus (day 11-45) were AI. Open cows during the previous two phases were exposed to the bull. Results. Pregnancy in phase 1 was different (p<0.01) for PP and OC groups, 58.6% and 34.1%, respectively. Overall pregnancy percentage over the second service was 42.5% (p>0.05). No differences (p>0.05) were observed at phase 3, average 44.2%. By the end of the breeding season, the cost of OC, was 3 times more than PP cows. Conclusions. Pregnancy rate at first phase was higher in PP cows than OC cows. At the end of breeding season, a pregnancy rate of 80% was found. Incorporation of open cows from previous breeding season was more expensive than PP cows in all phases of the breeding program. Retaining an open cow for rebreeding one year or more could not be economically feasible.

A Low Cost MST-FSM Obfuscation Method for Hardware IP Protection

2020 ◽  
Vol 29 (13) ◽  
pp. 2050208
Author(s):  
Yuejun Zhang ◽  
Zhao Pan ◽  
Pengjun Wang ◽  
Xiaowei Zhang
Keyword(s):  
Integrated Circuit ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Hamming Distance ◽  
Low Cost ◽  
The Arts ◽  
Finite State ◽  
Ip Cores ◽  
Building Program ◽  
The Cost

Effective resistance to intellectual property (IP) piracy, overproduction and reverse engineering are becoming more and more necessary in the integrated circuit (IC) supply chain. To protect the hardware, the obfuscation methodology hides the original function by adding a large number of redundant states. However, existing hardware obfuscation approaches have hardware overhead and efficiency of obfuscation limitations. This paper proposed a novel methodology for IP security using the minimum spanning tree finite state machine (MST-FSM) obfuscation. In the minimum spanning tree (MST) algorithm, the Hamming distance defines the cost of obfuscated states. The Kruskal algorithm optimizes the connection relationship of obfuscated states by computing the Hamming distance of the MST-FSM. The proposed MST-FSM is automatically generated and embedded in the hardware IP with the self-building program. Finally, the MST-FSM is applied on the itc99 benchmark circuits and encryption standard IP cores. Compared with other state-of-the-arts, the obfuscation potency is improved by 3.57%, and the average hardware cost is decreased by about 6.01%.

ON THE STEINER RATIO IN $\mathcal{R}_{n}$

2011 ◽  
Vol 03 (04) ◽  
pp. 473-489
Author(s):  
HAI DU ◽  
WEILI WU ◽  
ZAIXIN LU ◽  
YINFENG XU
Keyword(s):  
Euclidean Space ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dimensional Euclidean Space ◽  
Minimum Length ◽  
Steiner Ratio ◽  
Line Segments ◽  
Finite Set ◽  
Steiner Minimum Tree ◽  
Set Of Points

The Steiner minimum tree and the minimum spanning tree are two important problems in combinatorial optimization. Let P denote a finite set of points, called terminals, in the Euclidean space. A Steiner minimum tree of P, denoted by SMT(P), is a network with minimum length to interconnect all terminals, and a minimum spanning tree of P, denoted by MST(P), is also a minimum network interconnecting all the points in P, however, subject to the constraint that all the line segments in it have to terminate at terminals. Therefore, SMT(P) may contain points not in P, but MST(P) cannot contain such kind of points. Let [Formula: see text] denote the n-dimensional Euclidean space. The Steiner ratio in [Formula: see text] is defined to be [Formula: see text], where Ls(P) and Lm(P), respectively, denote lengths of a Steiner minimum tree and a minimum spanning tree of P. The best previously known lower bound for [Formula: see text] in the literature is 0.615. In this paper, we show that [Formula: see text] for any n ≥ 2.

Sign in / Sign up

Export Citation Format

Share Document