This document presents an improved tabular technique for showing the algorithms to find initial basic feasible solutions to transportation problems using the Northwest Corner method, Least Cost method, and Vogel Approximation method. The technique uses a single comprehensive table with additional rows and columns ("stages") to sequentially display each step of the algorithms. The document illustrates the technique using a sample transportation problem, presenting the solution processes through stages in multiple tables. It aims to provide a clearer presentation method than previous techniques using multiple separate tables.
The document discusses an automatic process to extract contour lines from topographical maps by:
1) Extracting contour lines from maps based on color and thinning the lines.
2) Reconnecting any broken contour lines.
3) Tracing the contours using an algorithm and extracting altitude data.
4) Storing the extracted contour lines and their attribute data in a database.
Contour Line Tracing Algorithm for Digital Topographic MapsCSCJournals
Topographic maps contain information related to roads, contours, landmarks land covers and rivers etc. For any Remote sensing and GIS based project, creating a database using digitization techniques is a tedious and time consuming process especially for contour tracing. Contour line is very important information that these maps provide. They are mainly used for determining slope of the landforms or rivers. These contour lines are also used for generating Digital Elevation Model (DEM) for 3D surface generation from any satellite imagery or aerial photographs. This paper suggests an algorithm that can be used for tracing contour lines automatically from contour maps extracted from the topographical sheets and creating a database. In our approach, we have proposed a modified Moore's Neighbor contour tracing algorithm to trace all contours in the given topographic maps. The proposed approach is tested on several topographic maps and provides satisfactory results and takes less time to trace the contour lines compared with other existing algorithms.
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...CSCJournals
This paper proposes an efficient method for the design of two-channel, quadrature mirror filter (QMF) bank for subband image coding. The choice of filter bank is important as it affects image quality as well as system design complexity. The design problem is formulated as weighted sum of reconstruction error in time domain and passband and stop-band energy of the low-pass analysis filter of the filter bank .The objective function is minimized directly, using nonlinear unconstrained method. Experimental results of the method on images show that the performance of the proposed method is better than that of the already existing methods. The impact of some filter characteristics, such as stopband attenuation, stopband edge, and filter length on the performance of the reconstructed images is also investigated.
The document summarizes and compares three recent face alignment algorithms: supervised descent method (SDM), local binary features regression (LBF), and face alignment under poses and occlusion (HPO). SDM formulates alignment as regression of local image features to landmark movements. LBF learns local binary features from regions around landmarks and uses global regression. HPO predicts landmark visibility and learns descent directions considering occlusion. The document evaluates the methods on standard datasets, finding SDM and LBF perform well except under extreme conditions, while HPO better handles poses and occlusion.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared.
A lossless color image compression using an improved reversible color transfo...eSAT Journals
Abstract In case of the conventional lossless color image compression methods, the pixels are interleaved from each color component, and they are predicted and finally encoded. In this paper, we propose a lossless color image compression method using hierarchical prediction of chrominance channel pixels and encoded with modified Huffman coding. An input image is chosen and the R, G and B color channel is transform into YCuCv color space using an improved reversible color transform. After that a conventional lossless image coder like CALIC is used to compress the luminance channel Y. The chrominance channel Cu and Cv are encoded with hierarchical decomposition and directional prediction. The effective context modeling for prediction residual is adopted finally. It is seen from the experimental result the proposed method improves the compression performance than the existing method. Keywords: Lossless color image compression, hierarchical prediction, reversible color transform, modified Huffman coding.
This document summarizes several proposed optimized color transforms for improving the performance of image demosaicing algorithms. It begins with describing a basic sequential demosaicing algorithm that first interpolates the green color component and then reconstructs the red and blue components based on differences from green. The document then proposes alternative color transforms based on optimizing for: 1) energy compactness and non-singularity of the color components, 2) smoothness of the color components by minimizing their high-frequency energy in both the wavelet and Fourier domains, and 3) relative energy in the Fourier domain. Equations for calculating the optimal coefficients for these proposed color transforms are provided.
The document discusses an automatic process to extract contour lines from topographical maps by:
1) Extracting contour lines from maps based on color and thinning the lines.
2) Reconnecting any broken contour lines.
3) Tracing the contours using an algorithm and extracting altitude data.
4) Storing the extracted contour lines and their attribute data in a database.
Contour Line Tracing Algorithm for Digital Topographic MapsCSCJournals
Topographic maps contain information related to roads, contours, landmarks land covers and rivers etc. For any Remote sensing and GIS based project, creating a database using digitization techniques is a tedious and time consuming process especially for contour tracing. Contour line is very important information that these maps provide. They are mainly used for determining slope of the landforms or rivers. These contour lines are also used for generating Digital Elevation Model (DEM) for 3D surface generation from any satellite imagery or aerial photographs. This paper suggests an algorithm that can be used for tracing contour lines automatically from contour maps extracted from the topographical sheets and creating a database. In our approach, we have proposed a modified Moore's Neighbor contour tracing algorithm to trace all contours in the given topographic maps. The proposed approach is tested on several topographic maps and provides satisfactory results and takes less time to trace the contour lines compared with other existing algorithms.
Unconstrained Optimization Method to Design Two Channel Quadrature Mirror Fil...CSCJournals
This paper proposes an efficient method for the design of two-channel, quadrature mirror filter (QMF) bank for subband image coding. The choice of filter bank is important as it affects image quality as well as system design complexity. The design problem is formulated as weighted sum of reconstruction error in time domain and passband and stop-band energy of the low-pass analysis filter of the filter bank .The objective function is minimized directly, using nonlinear unconstrained method. Experimental results of the method on images show that the performance of the proposed method is better than that of the already existing methods. The impact of some filter characteristics, such as stopband attenuation, stopband edge, and filter length on the performance of the reconstructed images is also investigated.
The document summarizes and compares three recent face alignment algorithms: supervised descent method (SDM), local binary features regression (LBF), and face alignment under poses and occlusion (HPO). SDM formulates alignment as regression of local image features to landmark movements. LBF learns local binary features from regions around landmarks and uses global regression. HPO predicts landmark visibility and learns descent directions considering occlusion. The document evaluates the methods on standard datasets, finding SDM and LBF perform well except under extreme conditions, while HPO better handles poses and occlusion.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared.
A lossless color image compression using an improved reversible color transfo...eSAT Journals
Abstract In case of the conventional lossless color image compression methods, the pixels are interleaved from each color component, and they are predicted and finally encoded. In this paper, we propose a lossless color image compression method using hierarchical prediction of chrominance channel pixels and encoded with modified Huffman coding. An input image is chosen and the R, G and B color channel is transform into YCuCv color space using an improved reversible color transform. After that a conventional lossless image coder like CALIC is used to compress the luminance channel Y. The chrominance channel Cu and Cv are encoded with hierarchical decomposition and directional prediction. The effective context modeling for prediction residual is adopted finally. It is seen from the experimental result the proposed method improves the compression performance than the existing method. Keywords: Lossless color image compression, hierarchical prediction, reversible color transform, modified Huffman coding.
This document summarizes several proposed optimized color transforms for improving the performance of image demosaicing algorithms. It begins with describing a basic sequential demosaicing algorithm that first interpolates the green color component and then reconstructs the red and blue components based on differences from green. The document then proposes alternative color transforms based on optimizing for: 1) energy compactness and non-singularity of the color components, 2) smoothness of the color components by minimizing their high-frequency energy in both the wavelet and Fourier domains, and 3) relative energy in the Fourier domain. Equations for calculating the optimal coefficients for these proposed color transforms are provided.
Maximum likelihood estimation-assisted ASVSF through state covariance-based 2...TELKOMNIKA JOURNAL
The smooth variable structure filter (ASVSF) has been relatively considered as a new robust predictor-corrector method for estimating the state. In order to effectively utilize it, an SVSF requires the accurate system model, and exact prior knowledge includes both the process and measurement noise statistic. Unfortunately, the system model is always inaccurate because of some considerations avoided at the beginning. Moreover, the small addictive noises are partially known or even unknown. Of course, this limitation can degrade the performance of SVSF or also lead to divergence condition. For this reason, it is proposed through this paper an adaptive smooth variable structure filter (ASVSF) by conditioning the probability density function of a measurement
to the unknown parameters at one iteration. This proposed method is assumed to accomplish the localization and direct point-based observation task of a wheeled mobile robot, TurtleBot2. Finally, by realistically simulating it and comparing to a conventional method, the proposed method has been showing a better accuracy and stability in term of root mean square error (RMSE) of the estimated map coordinate (EMC) and estimated path coordinate (EPC).
Face Alignment Using Active Shape Model And Support Vector MachineCSCJournals
The document proposes improvements to the classical Active Shape Model (ASM) algorithm for face alignment. The improvements include: 1) Combining Sobel filtering and 2D profiles to build texture models, 2) Applying Canny edge detection for enhancement, 3) Using Support Vector Machines (SVM) to classify landmarks for more accurate localization, and 4) Automatically adjusting 2D profile lengths based on image size. Experimental results on two face databases show the proposed ASM-SVM method achieves better alignment accuracy than the classical ASM and other methods.
Evolution of 3D Surface Parameters: A Comprehensive Surveytheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Choice of Numerical Integration Method for Wind Time History Analysis of Tall...inventy
Wind tunnel tests are being performed routinely around the world for designing tall buildings but the advent of powerful computational tools will make time-history analysis for wind more common in near future. As the duration of wind storms ranges from tens of minutes to hours while earthquake durations are typically less than a three to four minutes, the choice of a time step size (Δt) for wind studies needs to be much larger both to reduce the computational time and to save disk space. As the error in any numerical solution of the equation of motion is dependent on step size (Δt), careful investigations on the choice of numerical integration methods for wind analyses are necessary. From a wide variety of integration methods available, it was decided to investigate three methods that seem appropriate for 3D-time history analysis of tall buildings for wind. These are modal time history analysis, the Hilber-Hughes-Taylor (HHT) method or α-method with α=- 0.1, and the Newmark method with β=0.25 and γ=0.5 ( i.e., trapezoidal rule). SAP2000, a common structural analysis software tool, and a 64-story structure are used to conduct all the analyses in this paper. A boundary layer wind tunnel (BLWT) pressure time history measured at 120 locations around the building envelope of a similar structure is used for the analyses. Analyses performed with both the HHT and Newmark-method considering P-delta effects show that second order effects have a considerable impact on both displacement and acceleration response. This result shows that it is necessary to account P-delta effect for wind analysis of tall buildings. As the direct integration time history analysis required very large computation times and very large computer physical memory for a wind duration of hours, a modal analysis with reduced stiffness is considered as a good alternative. For that purpose, a non-linear static analysis of the structure with a load combination of 1.0D + 1.0L is performed in SAP2000 and the reduced stiffness of the structure after the analysis is used to conduct an eigenvalue analysis to extract the mode shapes and frequencies of this structure. Then the first 20- modes are used to perform a modal time history analysis for wind load. The result shows that the responses from modal analysis with “20-mode (reduced stiffness)” are comparable with that from the P-Δ analyses of Newmark-method
This document is an exam for the International General Certificate of Secondary Education in mathematics. It consists of 12 printed pages and contains 19 multiple choice and written response questions testing a variety of math skills. Students have 1 hour and 30 minutes to complete the exam, which is out of a total of 70 marks. They must show their work and write their answers on the exam pages provided.
Concurrent Ternary Galois-based Computation using Nano-apex Multiplexing Nibs...VLSICS Design
Novel realizations of concurrent computations utilizing three-dimensional lattice networks and their corresponding carbon-based field emission controlled switching is introduced in this article. The formalistic ternary nano-based implementation utilizes recent findings in field emission and nano applications which include carbon-based nanotubes and nanotips for three-valued lattice computing via field-emission methods. The presented work implements multi-valued Galois functions by utilizing concurrent nano-based lattice systems, which use two-to-one controlled switching via carbon-based field emission devices by using nano-apex carbon fibers and carbon nanotubes that were presented in the first part of the article. The introduced computational extension utilizing many-to-one carbon field-emission devices will be further utilized in implementing congestion-free architectures within the third part of the article. The emerging nano-based technologies form important directions in low-power compact-size regular lattice realizations, in which carbon-based devices switch less-costly and more-reliably using much less power than silicon-based devices. Applications include low-power design of VLSI circuits for signal processing and control of autonomous robots.
Realistic road path reconstruction from GIS datahanguyenhoang
We introduce a new approach to construct smooth piecewise curves representing realistic road paths. Given a GIS database of road networks in which sampled points are organized in 3D polylines, our method creates horizontal, then vertical curves, and finally combines them to produce 3D road paths. We first estimate the possibility of each point of being a junction between two separate primitive curve segments. Next, we design a tree-traversal
algorithm to expand sequences of local best fit primitives which are then merged together with respect to the G1 continuity constraint and civil engineering rules. We apply the Levenberg-Marquardt method to minimize the error
between the resulting curve and the sampled points while preserving the G1continuity
A New Method to Solving Generalized Fuzzy Transportation Problem-Harmonic Mea...AI Publications
Transportation Problem is one of the models in the Linear Programming problem. The objective of this paper is to transport the item from the origin to the destination such that the transport cost should be minimized, and we should minimize the time of transportation. To achieve this, a new approach using harmonic mean method is proposed in this paper. In this proposed method transportation costs are represented by generalized trapezoidal fuzzy numbers. Further comparative studies of the new technique with other existing algorithms are established by means of sample problems.
Diseño rapido de amplificadores con valoresFélix Chávez
This document describes a tool called GPCAD that optimizes and automates component and transistor sizing for CMOS operational amplifiers. The tool formulates amplifier design problems as geometric programs, a type of convex optimization problem that can be solved very efficiently to determine a globally optimal design. The document discusses how GPCAD applies the geometric programming method to six common op-amp architectures and provides example designs. It also reviews previous approaches to op-amp synthesis and describes the transistor modeling and performance specifications that can be formulated within the geometric programming framework.
The Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm
(GA) is one of the most useful algorithms for solving this problem. In this paper a conventional GA is
compared with an improved hybrid GA in solving TSP. The improved or hybrid GA consist of
conventional GA and two local optimization strategies. The first strategy is extracting all sequential
groups including four cities of samples and changing the two central cities with each other. The second
local optimization strategy is similar to an extra mutation process. In this step with a low probability a
sample is selected. In this sample two random cities are defined and the path between these cities is
reversed. The computation results show that the proposed method also finds better paths than the
conventional GA within an acceptable computation time.
The document provides information about variants of question papers used for Cambridge International Examinations (CIE) assessments. It states that CIE uses different but closely related variants of question papers for popular exams with large numbers of candidates. This is to maintain best practice in assessment.
It explains that while the content and question types remain the same, for some components there are now two variant question papers, mark schemes, and principal examiners' reports, rather than just one previously. For each country, only one variant will be used.
A diagram shows the relationship between the question papers, mark schemes, and principal examiners' reports for the two variants. The document provides contact details for any questions and instructions for correctly labeling
A hybrid image similarity measure based on a new combination of different sim...IJECEIAES
Image similarity is the degree of how two images are similar or dissimilar. It computes the similarity degree between the intensity patterns in images. A new image similarity measure named (HFEMM) is proposed in this paper. The HFEMM is composed of two phases. Phase 1, a modified histogram similarity measure (HSSIM) is merged with feature similarity measure (FSIM) to get a new measure called (HFM). In phase 2, the resulted (HFM) is merged with error measure (EMM) in order to get a new similarity measure, which is named (HFEMM). Different kindes of noises for example Gaussian, Uniform, and salt & ppepper noiser are used with the proposed methods. One of the human face databases (AT&T) is used in the experiments and random images are used as well. For the evaluation, the similarity percentage under peakk signal to noise ratio (PSNR) is used. To show the effectiveness of the proposed measure, a comparision anong different similar technique such as SSIM, HFM, EMM and HFEMM are considered. The proposed HFEMM achieved higher similarity result when PSNR was low compared to the other methods.
“An Alternate Approach to Find an Optimal Solution of a Transportation Problem.”IOSRJM
The Transportation Problem is the special class of Linear Programming Problem. It arises when the situation in which a commodity is shipped from sources to destinations. The main object is to determine the amounts shipped from each sources to each destinations which minimize the total shipping cost while satisfying both supply criteria and demand requirements. In this paper, we are giving the idea about to finding the Initial Basic Feasible solution as well as the optimal solution or near to the optimal solution of a Transportation problem using the method known as “An Alternate Approach to find an optimal Solution of a Transportation Problem”. An Algorithm provided here, concentrate at unoccupied cells and proceeds further. Also, the numerical examples are provided to explain the proposed algorithm. However, the above method gives a step by step development of the solution procedure for finding an optimal solution.
Comparison of MOC and Lax FDE for simulating transients in Pipe FlowsIRJET Journal
This document compares the method of characteristics (MOC) and Lax finite difference explicit (Lax FDE) methods for simulating transients in pipe flows. It develops numerical models using both MOC and Lax FDE to discretize the governing equations of fluid flow through a pipe. The models are implemented using data from a previous study to simulate pressure and discharge changes after rapid valve closure. The results show that Lax FDE provides more damping of pressure and discharge fluctuations compared to MOC. Therefore, the document concludes that Lax FDE is a better numerical method for calculating hydraulic transients in pipes.
Numerical disperison analysis of sympletic and adi schemexingangahu
This document discusses numerical dispersion analysis of symplectic and alternating direction implicit (ADI) schemes for computational electromagnetic simulation. It presents Maxwell's equations as a Hamiltonian system that can be written as symplectic or ADI schemes by approximating the time evolution operator. Three high order spatial difference approximations - high order staggered difference, compact finite difference, and scaling function approximations - are analyzed to reduce numerical dispersion when combined with the symplectic and ADI schemes. The document derives unified dispersion relationships for the symplectic and ADI schemes with different spatial difference approximations, which can be used as a reference for simulating large scale electromagnetic problems.
ADAPTIVE MAP FOR SIMPLIFYING BOOLEAN EXPRESSIONSijcses
The complexity of implementing the Boolean functions by digital logic gates is directly related to the
complexity of the Boolean algebraic expression. Although the truth table is used to represent a function,
when it is expressed algebraically it appeared in many different, but equivalent, forms. Boolean expressions
may be simplified by Boolean algebra. However, this procedure of minimization is awkward because it
lacks specific rules to predict each succeeding step in the manipulative process. Other methods like Map
methods (Karnaugh map (K-map), and map Entered Variables) are useful to implement the Boolean
expression with minimal prime implicants. Or the Boolean function can be represents and design by used
type N’s Multiplexers by partitioned variable(s) from the function. An adaptive map is a combined method
of Boolean algebra and K-map to reduce and minimize Boolean functions involving more than three
Boolean variables
This document summarizes a computational fluid dynamics (CFD) simulation of airflow around a simplified pickup van model. The study used a commercial CFD software to perform a 3D, steady-state simulation using the Reynolds-averaged Navier-Stokes equations and a k-ε turbulence model. The simulation was run at Reynolds numbers of 3x105 and results were validated against experimental wind tunnel data. Key findings included pressure and velocity distributions that matched experimental data well, indicating CFD can be an effective alternative to wind tunnel testing for pickup van aerodynamic analysis.
A New Method for Solving Transportation Problems Considering Average PenaltyIOSRJM
Vogel’s Approximation Method (VAM) is one of the conventional methods that gives better Initial Basic Feasible Solution (IBFS) of a Transportation Problem (TP). This method considers the row penalty and column penalty of a Transportation Table (TT) which are the differences between the lowest and next lowest cost of each row and each column of the TT respectively. In a little bit different way, the current method consider the Average Row Penalty (ARP) and Average Column Penalty (ACP) which are the averages of the differences of cell values of each row and each column respectively from the lowest cell value of the corresponding row and column of the TT. Allocations of costs are started in the cell along the row or column which has the highest ARP or ACP. These cells are called basic cells. The details of the developed algorithm with some numerical illustrations are discussed in this article to show that it gives better solution than VAM and some other familiar methods in some cases.
MODIFIED VOGEL APPROXIMATION METHOD FOR BALANCED TRANSPORTATION MODELS TOWARD...IAEME Publication
This paper is built on a study in relation to transportation problem as it affects most organisational decision in a decomposed setting. The case study used in this work is Dangote cement factory (in Ibese, Nigeria) with three sources and four destinationscentres. The factory is supported by increasing number of cement delivery trucks. Some models for solving balanced transportation problems (TPs) are considered in order to determine the optimal and initial basic feasible solutions (IBFS). From the analysis, it is observed that Modified Vogel Approximation Method (MVAM) is a better method. This is partly because MVAM considers each unit cost in its solution algorithm and minimises total cost comparatively with Vogel Approximation Method (VAM). The results arefurther justified and validated using windows version 2.00 Tora package.
Iaetsd ones method for finding an optimalIaetsd Iaetsd
The document proposes a new method called Ones Method for finding an optimal solution to transportation problems directly. The method involves constructing a transportation table and allocating units to cells starting with the minimum demand/supply. Units are allocated to cells with the maximum number of ones until all demands are satisfied and supplies exhausted. The method is illustrated on sample problems and shown to find the same optimal solutions as existing methods but in a simpler way. It provides a systematic procedure that is easy to apply to transportation problems.
This document presents a two-stage method for solving fuzzy transportation problems where the costs, supplies, and demands are represented by symmetric trapezoidal fuzzy numbers. In the first stage, the problem is solved to satisfy minimum demand requirements. Remaining supplies are then distributed in the second stage to further minimize costs. A numerical example demonstrates using robust ranking techniques to convert the fuzzy problem into a crisp one, which is then solved using a zero suffix method. The total optimal costs from both stages provide the solution to the original fuzzy transportation problem.
This document provides an overview of transportation and assignment problems in operations research. It discusses the key characteristics and formulations of transportation models, including how to obtain initial basic feasible solutions using different methods like the Northwest Corner Rule and Vogel's Approximation Method. It also covers testing for optimality using the Modified Distribution method and how to handle unbalanced transportation problems. For assignment problems, the document outlines the Hungarian method for obtaining optimal solutions to assignment problems and how to deal with constrained variants like unbalanced or prohibitive assignment problems.
Maximum likelihood estimation-assisted ASVSF through state covariance-based 2...TELKOMNIKA JOURNAL
The smooth variable structure filter (ASVSF) has been relatively considered as a new robust predictor-corrector method for estimating the state. In order to effectively utilize it, an SVSF requires the accurate system model, and exact prior knowledge includes both the process and measurement noise statistic. Unfortunately, the system model is always inaccurate because of some considerations avoided at the beginning. Moreover, the small addictive noises are partially known or even unknown. Of course, this limitation can degrade the performance of SVSF or also lead to divergence condition. For this reason, it is proposed through this paper an adaptive smooth variable structure filter (ASVSF) by conditioning the probability density function of a measurement
to the unknown parameters at one iteration. This proposed method is assumed to accomplish the localization and direct point-based observation task of a wheeled mobile robot, TurtleBot2. Finally, by realistically simulating it and comparing to a conventional method, the proposed method has been showing a better accuracy and stability in term of root mean square error (RMSE) of the estimated map coordinate (EMC) and estimated path coordinate (EPC).
Face Alignment Using Active Shape Model And Support Vector MachineCSCJournals
The document proposes improvements to the classical Active Shape Model (ASM) algorithm for face alignment. The improvements include: 1) Combining Sobel filtering and 2D profiles to build texture models, 2) Applying Canny edge detection for enhancement, 3) Using Support Vector Machines (SVM) to classify landmarks for more accurate localization, and 4) Automatically adjusting 2D profile lengths based on image size. Experimental results on two face databases show the proposed ASM-SVM method achieves better alignment accuracy than the classical ASM and other methods.
Evolution of 3D Surface Parameters: A Comprehensive Surveytheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Choice of Numerical Integration Method for Wind Time History Analysis of Tall...inventy
Wind tunnel tests are being performed routinely around the world for designing tall buildings but the advent of powerful computational tools will make time-history analysis for wind more common in near future. As the duration of wind storms ranges from tens of minutes to hours while earthquake durations are typically less than a three to four minutes, the choice of a time step size (Δt) for wind studies needs to be much larger both to reduce the computational time and to save disk space. As the error in any numerical solution of the equation of motion is dependent on step size (Δt), careful investigations on the choice of numerical integration methods for wind analyses are necessary. From a wide variety of integration methods available, it was decided to investigate three methods that seem appropriate for 3D-time history analysis of tall buildings for wind. These are modal time history analysis, the Hilber-Hughes-Taylor (HHT) method or α-method with α=- 0.1, and the Newmark method with β=0.25 and γ=0.5 ( i.e., trapezoidal rule). SAP2000, a common structural analysis software tool, and a 64-story structure are used to conduct all the analyses in this paper. A boundary layer wind tunnel (BLWT) pressure time history measured at 120 locations around the building envelope of a similar structure is used for the analyses. Analyses performed with both the HHT and Newmark-method considering P-delta effects show that second order effects have a considerable impact on both displacement and acceleration response. This result shows that it is necessary to account P-delta effect for wind analysis of tall buildings. As the direct integration time history analysis required very large computation times and very large computer physical memory for a wind duration of hours, a modal analysis with reduced stiffness is considered as a good alternative. For that purpose, a non-linear static analysis of the structure with a load combination of 1.0D + 1.0L is performed in SAP2000 and the reduced stiffness of the structure after the analysis is used to conduct an eigenvalue analysis to extract the mode shapes and frequencies of this structure. Then the first 20- modes are used to perform a modal time history analysis for wind load. The result shows that the responses from modal analysis with “20-mode (reduced stiffness)” are comparable with that from the P-Δ analyses of Newmark-method
This document is an exam for the International General Certificate of Secondary Education in mathematics. It consists of 12 printed pages and contains 19 multiple choice and written response questions testing a variety of math skills. Students have 1 hour and 30 minutes to complete the exam, which is out of a total of 70 marks. They must show their work and write their answers on the exam pages provided.
Concurrent Ternary Galois-based Computation using Nano-apex Multiplexing Nibs...VLSICS Design
Novel realizations of concurrent computations utilizing three-dimensional lattice networks and their corresponding carbon-based field emission controlled switching is introduced in this article. The formalistic ternary nano-based implementation utilizes recent findings in field emission and nano applications which include carbon-based nanotubes and nanotips for three-valued lattice computing via field-emission methods. The presented work implements multi-valued Galois functions by utilizing concurrent nano-based lattice systems, which use two-to-one controlled switching via carbon-based field emission devices by using nano-apex carbon fibers and carbon nanotubes that were presented in the first part of the article. The introduced computational extension utilizing many-to-one carbon field-emission devices will be further utilized in implementing congestion-free architectures within the third part of the article. The emerging nano-based technologies form important directions in low-power compact-size regular lattice realizations, in which carbon-based devices switch less-costly and more-reliably using much less power than silicon-based devices. Applications include low-power design of VLSI circuits for signal processing and control of autonomous robots.
Realistic road path reconstruction from GIS datahanguyenhoang
We introduce a new approach to construct smooth piecewise curves representing realistic road paths. Given a GIS database of road networks in which sampled points are organized in 3D polylines, our method creates horizontal, then vertical curves, and finally combines them to produce 3D road paths. We first estimate the possibility of each point of being a junction between two separate primitive curve segments. Next, we design a tree-traversal
algorithm to expand sequences of local best fit primitives which are then merged together with respect to the G1 continuity constraint and civil engineering rules. We apply the Levenberg-Marquardt method to minimize the error
between the resulting curve and the sampled points while preserving the G1continuity
A New Method to Solving Generalized Fuzzy Transportation Problem-Harmonic Mea...AI Publications
Transportation Problem is one of the models in the Linear Programming problem. The objective of this paper is to transport the item from the origin to the destination such that the transport cost should be minimized, and we should minimize the time of transportation. To achieve this, a new approach using harmonic mean method is proposed in this paper. In this proposed method transportation costs are represented by generalized trapezoidal fuzzy numbers. Further comparative studies of the new technique with other existing algorithms are established by means of sample problems.
Diseño rapido de amplificadores con valoresFélix Chávez
This document describes a tool called GPCAD that optimizes and automates component and transistor sizing for CMOS operational amplifiers. The tool formulates amplifier design problems as geometric programs, a type of convex optimization problem that can be solved very efficiently to determine a globally optimal design. The document discusses how GPCAD applies the geometric programming method to six common op-amp architectures and provides example designs. It also reviews previous approaches to op-amp synthesis and describes the transistor modeling and performance specifications that can be formulated within the geometric programming framework.
The Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm
(GA) is one of the most useful algorithms for solving this problem. In this paper a conventional GA is
compared with an improved hybrid GA in solving TSP. The improved or hybrid GA consist of
conventional GA and two local optimization strategies. The first strategy is extracting all sequential
groups including four cities of samples and changing the two central cities with each other. The second
local optimization strategy is similar to an extra mutation process. In this step with a low probability a
sample is selected. In this sample two random cities are defined and the path between these cities is
reversed. The computation results show that the proposed method also finds better paths than the
conventional GA within an acceptable computation time.
The document provides information about variants of question papers used for Cambridge International Examinations (CIE) assessments. It states that CIE uses different but closely related variants of question papers for popular exams with large numbers of candidates. This is to maintain best practice in assessment.
It explains that while the content and question types remain the same, for some components there are now two variant question papers, mark schemes, and principal examiners' reports, rather than just one previously. For each country, only one variant will be used.
A diagram shows the relationship between the question papers, mark schemes, and principal examiners' reports for the two variants. The document provides contact details for any questions and instructions for correctly labeling
A hybrid image similarity measure based on a new combination of different sim...IJECEIAES
Image similarity is the degree of how two images are similar or dissimilar. It computes the similarity degree between the intensity patterns in images. A new image similarity measure named (HFEMM) is proposed in this paper. The HFEMM is composed of two phases. Phase 1, a modified histogram similarity measure (HSSIM) is merged with feature similarity measure (FSIM) to get a new measure called (HFM). In phase 2, the resulted (HFM) is merged with error measure (EMM) in order to get a new similarity measure, which is named (HFEMM). Different kindes of noises for example Gaussian, Uniform, and salt & ppepper noiser are used with the proposed methods. One of the human face databases (AT&T) is used in the experiments and random images are used as well. For the evaluation, the similarity percentage under peakk signal to noise ratio (PSNR) is used. To show the effectiveness of the proposed measure, a comparision anong different similar technique such as SSIM, HFM, EMM and HFEMM are considered. The proposed HFEMM achieved higher similarity result when PSNR was low compared to the other methods.
“An Alternate Approach to Find an Optimal Solution of a Transportation Problem.”IOSRJM
The Transportation Problem is the special class of Linear Programming Problem. It arises when the situation in which a commodity is shipped from sources to destinations. The main object is to determine the amounts shipped from each sources to each destinations which minimize the total shipping cost while satisfying both supply criteria and demand requirements. In this paper, we are giving the idea about to finding the Initial Basic Feasible solution as well as the optimal solution or near to the optimal solution of a Transportation problem using the method known as “An Alternate Approach to find an optimal Solution of a Transportation Problem”. An Algorithm provided here, concentrate at unoccupied cells and proceeds further. Also, the numerical examples are provided to explain the proposed algorithm. However, the above method gives a step by step development of the solution procedure for finding an optimal solution.
Comparison of MOC and Lax FDE for simulating transients in Pipe FlowsIRJET Journal
This document compares the method of characteristics (MOC) and Lax finite difference explicit (Lax FDE) methods for simulating transients in pipe flows. It develops numerical models using both MOC and Lax FDE to discretize the governing equations of fluid flow through a pipe. The models are implemented using data from a previous study to simulate pressure and discharge changes after rapid valve closure. The results show that Lax FDE provides more damping of pressure and discharge fluctuations compared to MOC. Therefore, the document concludes that Lax FDE is a better numerical method for calculating hydraulic transients in pipes.
Numerical disperison analysis of sympletic and adi schemexingangahu
This document discusses numerical dispersion analysis of symplectic and alternating direction implicit (ADI) schemes for computational electromagnetic simulation. It presents Maxwell's equations as a Hamiltonian system that can be written as symplectic or ADI schemes by approximating the time evolution operator. Three high order spatial difference approximations - high order staggered difference, compact finite difference, and scaling function approximations - are analyzed to reduce numerical dispersion when combined with the symplectic and ADI schemes. The document derives unified dispersion relationships for the symplectic and ADI schemes with different spatial difference approximations, which can be used as a reference for simulating large scale electromagnetic problems.
ADAPTIVE MAP FOR SIMPLIFYING BOOLEAN EXPRESSIONSijcses
The complexity of implementing the Boolean functions by digital logic gates is directly related to the
complexity of the Boolean algebraic expression. Although the truth table is used to represent a function,
when it is expressed algebraically it appeared in many different, but equivalent, forms. Boolean expressions
may be simplified by Boolean algebra. However, this procedure of minimization is awkward because it
lacks specific rules to predict each succeeding step in the manipulative process. Other methods like Map
methods (Karnaugh map (K-map), and map Entered Variables) are useful to implement the Boolean
expression with minimal prime implicants. Or the Boolean function can be represents and design by used
type N’s Multiplexers by partitioned variable(s) from the function. An adaptive map is a combined method
of Boolean algebra and K-map to reduce and minimize Boolean functions involving more than three
Boolean variables
This document summarizes a computational fluid dynamics (CFD) simulation of airflow around a simplified pickup van model. The study used a commercial CFD software to perform a 3D, steady-state simulation using the Reynolds-averaged Navier-Stokes equations and a k-ε turbulence model. The simulation was run at Reynolds numbers of 3x105 and results were validated against experimental wind tunnel data. Key findings included pressure and velocity distributions that matched experimental data well, indicating CFD can be an effective alternative to wind tunnel testing for pickup van aerodynamic analysis.
A New Method for Solving Transportation Problems Considering Average PenaltyIOSRJM
Vogel’s Approximation Method (VAM) is one of the conventional methods that gives better Initial Basic Feasible Solution (IBFS) of a Transportation Problem (TP). This method considers the row penalty and column penalty of a Transportation Table (TT) which are the differences between the lowest and next lowest cost of each row and each column of the TT respectively. In a little bit different way, the current method consider the Average Row Penalty (ARP) and Average Column Penalty (ACP) which are the averages of the differences of cell values of each row and each column respectively from the lowest cell value of the corresponding row and column of the TT. Allocations of costs are started in the cell along the row or column which has the highest ARP or ACP. These cells are called basic cells. The details of the developed algorithm with some numerical illustrations are discussed in this article to show that it gives better solution than VAM and some other familiar methods in some cases.
MODIFIED VOGEL APPROXIMATION METHOD FOR BALANCED TRANSPORTATION MODELS TOWARD...IAEME Publication
This paper is built on a study in relation to transportation problem as it affects most organisational decision in a decomposed setting. The case study used in this work is Dangote cement factory (in Ibese, Nigeria) with three sources and four destinationscentres. The factory is supported by increasing number of cement delivery trucks. Some models for solving balanced transportation problems (TPs) are considered in order to determine the optimal and initial basic feasible solutions (IBFS). From the analysis, it is observed that Modified Vogel Approximation Method (MVAM) is a better method. This is partly because MVAM considers each unit cost in its solution algorithm and minimises total cost comparatively with Vogel Approximation Method (VAM). The results arefurther justified and validated using windows version 2.00 Tora package.
Iaetsd ones method for finding an optimalIaetsd Iaetsd
The document proposes a new method called Ones Method for finding an optimal solution to transportation problems directly. The method involves constructing a transportation table and allocating units to cells starting with the minimum demand/supply. Units are allocated to cells with the maximum number of ones until all demands are satisfied and supplies exhausted. The method is illustrated on sample problems and shown to find the same optimal solutions as existing methods but in a simpler way. It provides a systematic procedure that is easy to apply to transportation problems.
This document presents a two-stage method for solving fuzzy transportation problems where the costs, supplies, and demands are represented by symmetric trapezoidal fuzzy numbers. In the first stage, the problem is solved to satisfy minimum demand requirements. Remaining supplies are then distributed in the second stage to further minimize costs. A numerical example demonstrates using robust ranking techniques to convert the fuzzy problem into a crisp one, which is then solved using a zero suffix method. The total optimal costs from both stages provide the solution to the original fuzzy transportation problem.
This document provides an overview of transportation and assignment problems in operations research. It discusses the key characteristics and formulations of transportation models, including how to obtain initial basic feasible solutions using different methods like the Northwest Corner Rule and Vogel's Approximation Method. It also covers testing for optimality using the Modified Distribution method and how to handle unbalanced transportation problems. For assignment problems, the document outlines the Hungarian method for obtaining optimal solutions to assignment problems and how to deal with constrained variants like unbalanced or prohibitive assignment problems.
MFBLP Method Forecast for Regional Load Demand SystemCSCJournals
Load forecast plays an important role in planning and operation of a power system. The accuracy of the forecast value is necessary for economically efficient operation and also for effective control. This paper describes a method of modified forward backward linear predictor (MFBLP) for solving the regional load demand of New South Wales (NSW), Australia. The method is designed and simulated based on the actual load data of New South Wales, Australia. The accuracy of discussed method is obtained and comparison with previous methods is also reported.
IRJET- Developed Method for Optimal Solution of Transportation ProblemIRJET Journal
1. The document proposes a new method for finding an optimal solution to transportation problems in less iterations compared to existing methods like the Vogel's Approximation Method.
2. The key steps of the proposed method include finding the second minimum value from each row and column, selecting the row or column with the maximum second minimum value and allocating supplies or demands accordingly until a 2x2 matrix is reached.
3. The method is demonstrated on two examples and is shown to find the optimal solution in less iterations than other common methods for transportation problems.
The document discusses transportation and assignment problems in operations research and their solutions. It introduces transportation models and how they can be formulated as linear programs. Solution methods for finding initial feasible and optimal solutions in transportation problems are described, including the northwest corner method, least cost method, Vogel's approximation method, stepping stone method, and modified distribution method. Special cases like unbalanced problems and degeneracy are also covered. The document then shifts to discussing assignment problems as a special case of transportation problems and describes the Hungarian method for solving assignment problems.
The document discusses transportation problems and their solutions. It begins by outlining the typical issues in operations research, such as formulating the problem, building a mathematical model with decision variables, objective functions and constraints, and optimizing the model. It then discusses how transportation problems can be formulated as linear programs and provides an example manufacturer situation. The document outlines the solution procedure for transportation problems, including finding an initial feasible solution using methods like the Northwest Corner, Least Cost and Vogel's Approximation methods. It also discusses finding the optimal solution using methods like the Stepping Stone and Modified Distribution methods. It concludes by mentioning some special cases in transportation problems.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Differential evolution (DE) algorithm has been applied as a powerful tool to find optimum switching angles for selective harmonic elimination pulse width modulation (SHEPWM) inverters. However, the DE’s performace is very dependent on its control parameters. Conventional DE generally uses either trial and error mechanism or tuning technique to determine appropriate values of the control paramaters. The disadvantage of this process is that it is very time comsuming. In this paper, an adaptive control parameter is proposed in order to speed up the DE algorithm in optimizing SHEPWM switching angles precisely. The proposed adaptive control parameter is proven to enhance the convergence process of the DE algorithm without requiring initial guesses. The results for both negative and positive modulation index (M) also indicate that the proposed adaptive DE is superior to the conventional DE in generating SHEPWM switching patterns.
This document summarizes a study that applied a bi-objective optimization approach called the corridor observations method to solve the environmental and economic dispatch (EED) problem in power systems. The EED problem involves minimizing both fuel costs and gas emissions from power plants, subject to operational constraints. The proposed method uses an evolutionary algorithm to find the optimal Pareto front of non-dominated solutions by segmenting the objective space into corridors. It then identifies the best solutions in each corridor to build an archive of non-dominated solutions. Testing on sample power systems with 3, 6, 10 and 15 generating units showed the corridor observations method obtained higher quality Pareto fronts in less time compared to other evolutionary algorithms.
Fast Stereo Images Compression Method based on Wavelet Transform and Two dime...BRNSSPublicationHubI
This document proposes a fast stereo image compression method using discrete wavelet transform and two dimensional logarithmic (TDL) algorithm for motion estimation. It first applies discrete wavelet transform to the stereo images to reduce computation time. It then estimates the disparity between the images using TDL algorithm to find the motion vectors. It encodes the motion vectors with Huffman encoding while compressing the remaining image as a still image. Experimental results on test stereo image pairs show that the proposed method produces good results in terms of PSNR, compression ratio, and computation time compared to other motion estimation algorithms.
This presentation is made to represent the basic transportation model. The aim of this presentation is to implement the transportation model in solving transportation problem.
ANALYTICAL FORMULATIONS FOR THE LEVEL BASED WEIGHTED AVERAGE VALUE OF DISCRET...ijsc
In fuzzy decision-making processes based on linguistic information, operations on discrete fuzzy numbers are commonly performed. Aggregation and defuzzification operations are some of these often used operations. Many aggregation and defuzzification operators produce results independent to the decisionmaker’s strategy. On the other hand, the Weighted Average Based on Levels (WABL) approach can take into account the level weights and the decision maker's "optimism" strategy. This gives flexibility to the WABL operator and, through machine learning, can be trained in the direction of the decision maker's strategy, producing more satisfactory results for the decision maker. However, in order to determine the WABL value, it is necessary to calculate some integrals. In this study, the concept of WABL for discrete trapezoidal fuzzy numbers is investigated, and analytical formulas have been proven to facilitate the calculation of WABL value for these fuzzy numbers. Trapezoidal and their special form, triangular fuzzy numbers, are the most commonly used fuzzy number types in fuzzy modeling, so in this study, such numbers have been studied. Computational examples explaining the theoretical results have been performed.
A comparative study of initial basic feasible solution methodsAlexander Decker
This document compares three methods for obtaining an initial basic feasible solution for transportation problems: Vogel's Approximation Method (VAM), a Proposed Approximation Method (PAM), and a new Minimum Transportation Cost Method (MTCM). It applies all three methods to solve a sample transportation problem with 4 sources and 6 destinations. All three methods produce the same optimal solution and total transportation cost of 450. The document concludes VAM, PAM, and the new MTCM all provide viable options for obtaining the initial basic feasible solution for this transportation problem.
A comparative study of initial basic feasible solution methodsAlexander Decker
This document compares three methods for finding an initial basic feasible solution for transportation problems: Vogel's Approximation Method (VAM), a Proposed Approximation Method (PAM), and a new Minimum Transportation Cost Method (MTCM). It presents the algorithms for each method and applies them to a sample transportation problem. The MTCM provides not only the minimum transportation cost but also an optimal solution, unlike VAM and PAM which sometimes only find a close to optimal solution. The document aims to evaluate which initial basic feasible solution method works best.
- The document outlines the concept of robust design and tools like Taguchi method to achieve it. Robust design aims to reduce variability and optimize performance even under extreme conditions.
- Taguchi method is described as a tool for robust design involving orthogonal arrays to perform experiments efficiently and analyze results using signal-to-noise ratios to find optimal settings.
- An example applies Taguchi method to optimize a CVD process for silicon wafer production by selecting factor levels for temperature, pressure, time and cleaning method that minimize surface defects based on experiment results.
This document summarizes the transportation problem and methods for solving it. It defines the transportation problem as finding the optimal way to ship goods from supply points to demand points while considering shipping costs. Three methods for finding an initial basic feasible solution are described: Northwest Corner method, Minimum Cost method, and Vogel's method. The document provides examples of applying each method and formulates the transportation problem as a linear program that can be solved using optimization software. Exercises are included to solve a sample transportation problem using the different methods.
A new three-term conjugate gradient method with application to regression an...IJECEIAES
Conjugate gradient (CG) method is well-known for its ability to solve unconstrained optimization (UO.) problems. This article presenting a new CG method with sufficient descent conditions which improves the former method developed by Rvaie, Mustafa, Ismail and Leong (RMIL). The efficacy of the proposed method has been demonstrated through simulations on the Kijang Emas pricing regression problem. The daily data between January 2021 to May 2021 were obtained from Malaysian Ministry of Health and Bank Negara Malaysia. The dependent variable for this study was the Kijang Emas price, and the independent variables were the coronavirus disease (COVID-19) measures (i.e., new cases, R-naught, death cases, new recovered). Data collected were analyzed on its correlation and coefficient determinant, and the influences of COVID-19 on Kijang Emas price was examined through multiple linear regression model. Findings revealed that the suggested technique outperformed the existing CG algorithms in terms of computing efficiency.
Similar to An improved tabular technique for presenting the various (20)
Abnormalities of hormones and inflammatory cytokines in women affected with p...Alexander Decker
Women with polycystic ovary syndrome (PCOS) have elevated levels of hormones like luteinizing hormone and testosterone, as well as higher levels of insulin and insulin resistance compared to healthy women. They also have increased levels of inflammatory markers like C-reactive protein, interleukin-6, and leptin. This study found these abnormalities in the hormones and inflammatory cytokines of women with PCOS ages 23-40, indicating that hormone imbalances associated with insulin resistance and elevated inflammatory markers may worsen infertility in women with PCOS.
A usability evaluation framework for b2 c e commerce websitesAlexander Decker
This document presents a framework for evaluating the usability of B2C e-commerce websites. It involves user testing methods like usability testing and interviews to identify usability problems in areas like navigation, design, purchasing processes, and customer service. The framework specifies goals for the evaluation, determines which website aspects to evaluate, and identifies target users. It then describes collecting data through user testing and analyzing the results to identify usability problems and suggest improvements.
A universal model for managing the marketing executives in nigerian banksAlexander Decker
This document discusses a study that aimed to synthesize motivation theories into a universal model for managing marketing executives in Nigerian banks. The study was guided by Maslow and McGregor's theories. A sample of 303 marketing executives was used. The results showed that managers will be most effective at motivating marketing executives if they consider individual needs and create challenging but attainable goals. The emerged model suggests managers should provide job satisfaction by tailoring assignments to abilities and monitoring performance with feedback. This addresses confusion faced by Nigerian bank managers in determining effective motivation strategies.
A unique common fixed point theorems in generalized dAlexander Decker
This document presents definitions and properties related to generalized D*-metric spaces and establishes some common fixed point theorems for contractive type mappings in these spaces. It begins by introducing D*-metric spaces and generalized D*-metric spaces, defines concepts like convergence and Cauchy sequences. It presents lemmas showing the uniqueness of limits in these spaces and the equivalence of different definitions of convergence. The goal of the paper is then stated as obtaining a unique common fixed point theorem for generalized D*-metric spaces.
A trends of salmonella and antibiotic resistanceAlexander Decker
This document provides a review of trends in Salmonella and antibiotic resistance. It begins with an introduction to Salmonella as a facultative anaerobe that causes nontyphoidal salmonellosis. The emergence of antimicrobial-resistant Salmonella is then discussed. The document proceeds to cover the historical perspective and classification of Salmonella, definitions of antimicrobials and antibiotic resistance, and mechanisms of antibiotic resistance in Salmonella including modification or destruction of antimicrobial agents, efflux pumps, modification of antibiotic targets, and decreased membrane permeability. Specific resistance mechanisms are discussed for several classes of antimicrobials.
A transformational generative approach towards understanding al-istifhamAlexander Decker
This document discusses a transformational-generative approach to understanding Al-Istifham, which refers to interrogative sentences in Arabic. It begins with an introduction to the origin and development of Arabic grammar. The paper then explains the theoretical framework of transformational-generative grammar that is used. Basic linguistic concepts and terms related to Arabic grammar are defined. The document analyzes how interrogative sentences in Arabic can be derived and transformed via tools from transformational-generative grammar, categorizing Al-Istifham into linguistic and literary questions.
A time series analysis of the determinants of savings in namibiaAlexander Decker
This document summarizes a study on the determinants of savings in Namibia from 1991 to 2012. It reviews previous literature on savings determinants in developing countries. The study uses time series analysis including unit root tests, cointegration, and error correction models to analyze the relationship between savings and variables like income, inflation, population growth, deposit rates, and financial deepening in Namibia. The results found inflation and income have a positive impact on savings, while population growth negatively impacts savings. Deposit rates and financial deepening were found to have no significant impact. The study reinforces previous work and emphasizes the importance of improving income levels to achieve higher savings rates in Namibia.
A therapy for physical and mental fitness of school childrenAlexander Decker
This document summarizes a study on the importance of exercise in maintaining physical and mental fitness for school children. It discusses how physical and mental fitness are developed through participation in regular physical exercises and cannot be achieved solely through classroom learning. The document outlines different types and components of fitness and argues that developing fitness should be a key objective of education systems. It recommends that schools ensure pupils engage in graded physical activities and exercises to support their overall development.
A theory of efficiency for managing the marketing executives in nigerian banksAlexander Decker
This document summarizes a study examining efficiency in managing marketing executives in Nigerian banks. The study was examined through the lenses of Kaizen theory (continuous improvement) and efficiency theory. A survey of 303 marketing executives from Nigerian banks found that management plays a key role in identifying and implementing efficiency improvements. The document recommends adopting a "3H grand strategy" to improve the heads, hearts, and hands of management and marketing executives by enhancing their knowledge, attitudes, and tools.
This document discusses evaluating the link budget for effective 900MHz GSM communication. It describes the basic parameters needed for a high-level link budget calculation, including transmitter power, antenna gains, path loss, and propagation models. Common propagation models for 900MHz that are described include Okumura model for urban areas and Hata model for urban, suburban, and open areas. Rain attenuation is also incorporated using the updated ITU model to improve communication during rainfall.
A synthetic review of contraceptive supplies in punjabAlexander Decker
This document discusses contraceptive use in Punjab, Pakistan. It begins by providing background on the benefits of family planning and contraceptive use for maternal and child health. It then analyzes contraceptive commodity data from Punjab, finding that use is still low despite efforts to improve access. The document concludes by emphasizing the need for strategies to bridge gaps and meet the unmet need for effective and affordable contraceptive methods and supplies in Punjab in order to improve health outcomes.
A synthesis of taylor’s and fayol’s management approaches for managing market...Alexander Decker
1) The document discusses synthesizing Taylor's scientific management approach and Fayol's process management approach to identify an effective way to manage marketing executives in Nigerian banks.
2) It reviews Taylor's emphasis on efficiency and breaking tasks into small parts, and Fayol's focus on developing general management principles.
3) The study administered a survey to 303 marketing executives in Nigerian banks to test if combining elements of Taylor and Fayol's approaches would help manage their performance through clear roles, accountability, and motivation. Statistical analysis supported combining the two approaches.
A survey paper on sequence pattern mining with incrementalAlexander Decker
This document summarizes four algorithms for sequential pattern mining: GSP, ISM, FreeSpan, and PrefixSpan. GSP is an Apriori-based algorithm that incorporates time constraints. ISM extends SPADE to incrementally update patterns after database changes. FreeSpan uses frequent items to recursively project databases and grow subsequences. PrefixSpan also uses projection but claims to not require candidate generation. It recursively projects databases based on short prefix patterns. The document concludes by stating the goal was to find an efficient scheme for extracting sequential patterns from transactional datasets.
A survey on live virtual machine migrations and its techniquesAlexander Decker
This document summarizes several techniques for live virtual machine migration in cloud computing. It discusses works that have proposed affinity-aware migration models to improve resource utilization, energy efficient migration approaches using storage migration and live VM migration, and a dynamic consolidation technique using migration control to avoid unnecessary migrations. The document also summarizes works that have designed methods to minimize migration downtime and network traffic, proposed a resource reservation framework for efficient migration of multiple VMs, and addressed real-time issues in live migration. Finally, it provides a table summarizing the techniques, tools used, and potential future work or gaps identified for each discussed work.
A survey on data mining and analysis in hadoop and mongo dbAlexander Decker
This document discusses data mining of big data using Hadoop and MongoDB. It provides an overview of Hadoop and MongoDB and their uses in big data analysis. Specifically, it proposes using Hadoop for distributed processing and MongoDB for data storage and input. The document reviews several related works that discuss big data analysis using these tools, as well as their capabilities for scalable data storage and mining. It aims to improve computational time and fault tolerance for big data analysis by mining data stored in Hadoop using MongoDB and MapReduce.
1. The document discusses several challenges for integrating media with cloud computing including media content convergence, scalability and expandability, finding appropriate applications, and reliability.
2. Media content convergence challenges include dealing with the heterogeneity of media types, services, networks, devices, and quality of service requirements as well as integrating technologies used by media providers and consumers.
3. Scalability and expandability challenges involve adapting to the increasing volume of media content and being able to support new media formats and outlets over time.
This document surveys trust architectures that leverage provenance in wireless sensor networks. It begins with background on provenance, which refers to the documented history or derivation of data. Provenance can be used to assess trust by providing metadata about how data was processed. The document then discusses challenges for using provenance to establish trust in wireless sensor networks, which have constraints on energy and computation. Finally, it provides background on trust, which is the subjective probability that a node will behave dependably. Trust architectures need to be lightweight to account for the constraints of wireless sensor networks.
This document discusses private equity investments in Kenya. It provides background on private equity and discusses trends in various regions. The objectives of the study discussed are to establish the extent of private equity adoption in Kenya, identify common forms of private equity utilized, and determine typical exit strategies. Private equity can involve venture capital, leveraged buyouts, or mezzanine financing. Exits allow recycling of capital into new opportunities. The document provides context on private equity globally and in developing markets like Africa to frame the goals of the study.
This document discusses a study that analyzes the financial health of the Indian logistics industry from 2005-2012 using Altman's Z-score model. The study finds that the average Z-score for selected logistics firms was in the healthy to very healthy range during the study period. The average Z-score increased from 2006 to 2010 when the Indian economy was hit by the global recession, indicating the overall performance of the Indian logistics industry was good. The document reviews previous literature on measuring financial performance and distress using ratios and Z-scores, and outlines the objectives and methodology used in the current study.
An improved tabular technique for presenting the various
1. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
163
An Improved Tabular Technique for Presenting the Various
Algorithms for Finding Initial Basic Feasible Solutions to
Transportation Problems
John Usen Effiong1*
Ikpang Ikpang Nkereuwem 1,2
1. Department of Statistics, University of Calabar, Calabar, Cross-River State, Nigeria
2. Department of Maths/Statistics, Cross River University of Technology, Calabar, Cross-River State,
Nigeria
*E-mail of corresponding author: johnusen2002@yahoo.com
Abstract
The special structure of the transportation problem allows securing a non-artificial starting basic solution using
one of the three methods: Northwest-corner Method, Least-cost Method and Vogel Approximation Method. The
difference among the three methods is the “quality” of the starting basic solution they produce, in the sense that a
good starting solution yields an optimal solution in a fewer number of iterations. In general, the Vogel
Approximation Method yields the best starting basic solution, and the Northwest-corner Method yields the worst.
However, the Northwest-corner Method involves the least computations. Extensive and critical examination
regarding the usage and improvement of these methods abound in several publications with trivial consideration
given to the development of a near-ideal technique for presenting these algorithms. This paper develops and
implements an all-encompassing tabular technique for presenting the algorithms for these three methods.
Keywords: Transportation problem, Improved Tabular Technique, Initial Basic Feasible Solution
1. Introduction
The transportation model is a special class of the linear programming problem. It deals with situations in which a
commodity is shipped from “sources” to “destinations” [Taha, 1997; Reeb & Leavengood, 2002; Bijulal, 2013].
The objective is to determine the amounts shipped from each source to each destination that minimize the total
shipping cost, while satisfying both the supply limits and the demand requirements [Taha, 1997; Sharma, 2009;
Bijulal, 2013]. The model assumes that the shipping cost on a given route is directly proportional to the number
of units shipped on that route [Taha, 1997; Reeb & Leavengood, 2002]. In general, the transportation model can
be extended to areas other than the direct transportation of a commodity, including, among others, inventory
control, employment scheduling, and personnel assignment [Taha, 1997; Reeb & Leavengood, 2002; Sharma,
2009].
The general problem is represented by the network below. In the network, there are m sources and n
destinations, each represented by a “node”. There are also “arcs” linking the sources and destinations. These arcs
represent the routes between the sources and the destinations. Arcs ji, joining source i to destination j
carry two pieces of information: [1] the transportation cost per unit ijc , and [2] the amount shipped ijx . The
amount of supply at source i is ia and the amount of demand at destination j is jb [Taha, 1997; Wang,
2008, Effanga, 2011].
Figure. Network for a General Transportation Problem
2b
nb
1b
ma
2a
1a
2
2
1 1
m n
1111 : xc
mnmn xc :
2. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
164
The objective of a transportation model is to determine the unknowns ijx that will minimize the total
transportation cost while satisfying all the supply and demand restrictions [Taha, 1997; Sharma, 2009; Effanga,
2011]. Mathematically, the problem, in general, may be stated as follows:
jix
njDx
miSxts
xcCMin
ij
j
m
i
ij
i
n
j
ij
m
i
n
j
ijij
,,0
,,3,2,1
,,3,2,1:.
1
1
1 1
where iS is the supply at origin i , jD is the demand at destination j , ijx is the number of units shipped
from origin i to destination j ,
m
i
n
j
ijij xcC
1 1
is the total shipping cost, and
n
j
j
m
i
i DS
11
.
The transportation algorithm follows the exact steps of the simplex. However, instead of using the regular
simplex tableau, advantage is taken of the special structure of the transportation model to present the algorithm
in a more convenient form [Taha, 1997; Reeb & Leavengood, 2002; Sharma, 2009].
There are several methods available to obtain an initial basic feasible solution. But the three major methods for a
transportation problem are the Northwest-corner Method, Least-cost Method and Vogel Approximation Method
[Taha, 1997; Sharma, 2009]. Each of these methods has variously been previously presented using a continuum
of tables for any given transportation problem as can be seen in the publications of Taha [1997], Reeb &
Leavengood [2002], Wang [2008], Sharma, [2009], Effanga [2011] and Bijulal [2013]. It is in this vain that this
paper presents an improvement of the presentation technique for the three major methods which utilizes just one
table for the routine with better detail and clarity than previous techniques; and a case study from Effanga [2011]
has been used for the implementation.
2. Methodology
The proposed presentation technique utilizes a “well-designed grid” which extends the tabular presentation of
the given problem beyond the supply rows and demand columns to as many more columns and rows that would
be needed in the course of the solution process. In this work, we call the new columns and rows are called
“stages”. Variations of the well-designed grid for each method have been considered for the purpose of flexibility
as explained below, and illustrated in the next section.
2.1 Northwest Corner Rule
For the presentation of the Northwest Corner Rule, its laid down algorithm is applied, as we iteratively extend
the columns and the rows [from stage to stage] until the supplies are exhausted and demands satisfied.
2.2 Least Cost Rows Method
The presentation, using this method, adheres to the laid-down algorithm of the method. It also proceeds
horizontally along and vertically down the well-designed grid in stages just like the case of the North-west
corner rule except for the introduction of a set of well-defined “keys” [based on the presenter’s discretion];
which are used in an ordered progression from the beginning of the solution process to the end. The keys [in
their order] are used in the solution steps of the algorithms and in the tabular presentation to ensure clarity when
deleting rows and columns in accordance with the laid down algorithms.
2.3 Vogel Approximation Method
In the case of the presentation technique for Vogel Approximation Method we acknowledge that the algorithm
for this technique includes rows and columns differences. Hence, as a variation of the presentation technique for
the Least-cost method, we have incorporated additional columns and rows just after each stage to cater for the
column and row differences respectively.
3. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
165
3. Illustrating The Proposed Tabular Presentation
Table 1. Case study
Destination
Origin 1 2 3 4 Si
1 8 6 10 9 35
2 9 12 13 7 50
3 14 9 16 5 40
Di 45 20 30 30
In order to illustrate the use of the proposed tabular technique, we have employed the use of a case study from
Effanga [2011]. This case study is a balanced transportation problem, and is presented in table 1. The problem
requires one to find the initial basic feasible solution using the Northwest-corner Method, Least-cost Method and
Vogel Approximation Method. We have used the proposed improved presentation technique for the three
algorithms in finding the initial basic feasible solution to this problem and have obtained table 2 below. However,
the illustrations of the solution process are shown in the tables 3 through 7.
Table 2. Initial basic feasible [IBF] solutions
S/N Method IBF Solution
1 Northwest-corner 1180
2 Least-cost 1080
3 Vogel Approximation 1020
Table 3. Northwest-corner method
Destination
Origin 1 2 3 4 Si Stag1 Stag2 Stag3 Stag4 Stag5 Stag6
1 8 6 10 9 35 35/35=0 0 0 0 0 0
2 9 12 13 7 50 50 50/10=40 40/20=20 20/20=0 0 0
3 14 9 16 5 40 40 40 40 40 40/10=30 30/30=0
Di 45 20 30 30 125
Stag1 45/35=10 20 30 30 90
Stag2 10/10=0 20 30 30 80
Stag3 0 20/20=0 30 30 60
Stag4 0 0 30/20=10 30 40
Stag5 0 0 10/10=0 30 30
Stag6 0 0 0 30/30=0 0
5. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
167
Cd6 - - 10 -
6 0 0 25/25=0 0
St6
Rd6 6
10 25/25=0
- 0
- 0
0
Table 7. Key for Vogel approximation method
Order of Deletion Name of Colour Colour Description
First – Fourth column Red
Second – Second row Yellow
Third – Second column Green
Fourth – Cells (1, 1) & (2, 1) Deep Blue
Fifth – Cell (2, 3) Sky Blue
Sixth – Cell (3, 3) White
6. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.4, No.11, 2014
168
4. Conclusion
The proposed tabular presentation technique for presenting the three major algorithms for finding initial basic
feasible solutions to transportation problems is explicit and gives better clarity to the solution process. It
simplifies all previous presentation patterns used for this same purpose in an all-encompassing manner. Hence,
tendencies are that it could extend its implementation to variants of these three major algorithms that may be
developed by researchers in research directions based on improving the existing algorithms. We therefore
recommend that this proposed presentation technique should be incorporated into the available tool-kits for
doing this routine.
References
Bijulal, D. (2013), “Transportation Problem”, MBA 202 – Operations Research, College of Engineering,
Trivaddium.
Effanga, E. O. (2011), “Transportation Problem”, Lecture Notes on STA 6022 – Mathematical Programming.
Department of Statistics, University of Calabar, Nigeria
Sharma, J. K.. (2009), “Transportation Problem”, Operations Research – Theory and Applications, Delhi:
Macmillan Publishers India Limited, 259 – 312.
Reeb, J. & Leavengood, S. (2002), “Transportation Problem – A Special Case for Linear Programming
Problems”, Operations Research: Performance Excellence in the Wood Products Industry.
Taha, H. A. (1997), “Transportation Problem”, Operations Research – Theory and Applications, Prentice-Hall
International, Inc, USA, 165 – 185.
Wang, J. Y. (2008), “Chapter 8 – The Transportation and Assignment Problems”, Operations Research, College
of Management, NCTU.s
7. Business, Economics, Finance and Management Journals PAPER SUBMISSION EMAIL
European Journal of Business and Management EJBM@iiste.org
Research Journal of Finance and Accounting RJFA@iiste.org
Journal of Economics and Sustainable Development JESD@iiste.org
Information and Knowledge Management IKM@iiste.org
Journal of Developing Country Studies DCS@iiste.org
Industrial Engineering Letters IEL@iiste.org
Physical Sciences, Mathematics and Chemistry Journals PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research JNSR@iiste.org
Journal of Chemistry and Materials Research CMR@iiste.org
Journal of Mathematical Theory and Modeling MTM@iiste.org
Advances in Physics Theories and Applications APTA@iiste.org
Chemical and Process Engineering Research CPER@iiste.org
Engineering, Technology and Systems Journals PAPER SUBMISSION EMAIL
Computer Engineering and Intelligent Systems CEIS@iiste.org
Innovative Systems Design and Engineering ISDE@iiste.org
Journal of Energy Technologies and Policy JETP@iiste.org
Information and Knowledge Management IKM@iiste.org
Journal of Control Theory and Informatics CTI@iiste.org
Journal of Information Engineering and Applications JIEA@iiste.org
Industrial Engineering Letters IEL@iiste.org
Journal of Network and Complex Systems NCS@iiste.org
Environment, Civil, Materials Sciences Journals PAPER SUBMISSION EMAIL
Journal of Environment and Earth Science JEES@iiste.org
Journal of Civil and Environmental Research CER@iiste.org
Journal of Natural Sciences Research JNSR@iiste.org
Life Science, Food and Medical Sciences PAPER SUBMISSION EMAIL
Advances in Life Science and Technology ALST@iiste.org
Journal of Natural Sciences Research JNSR@iiste.org
Journal of Biology, Agriculture and Healthcare JBAH@iiste.org
Journal of Food Science and Quality Management FSQM@iiste.org
Journal of Chemistry and Materials Research CMR@iiste.org
Education, and other Social Sciences PAPER SUBMISSION EMAIL
Journal of Education and Practice JEP@iiste.org
Journal of Law, Policy and Globalization JLPG@iiste.org
Journal of New Media and Mass Communication NMMC@iiste.org
Journal of Energy Technologies and Policy JETP@iiste.org
Historical Research Letter HRL@iiste.org
Public Policy and Administration Research PPAR@iiste.org
International Affairs and Global Strategy IAGS@iiste.org
Research on Humanities and Social Sciences RHSS@iiste.org
Journal of Developing Country Studies DCS@iiste.org
Journal of Arts and Design Studies ADS@iiste.org
8. The IISTE is a pioneer in the Open-Access hosting service and academic event management.
The aim of the firm is Accelerating Global Knowledge Sharing.
More information about the firm can be found on the homepage:
http://www.iiste.org
CALL FOR JOURNAL PAPERS
There are more than 30 peer-reviewed academic journals hosted under the hosting platform.
Prospective authors of journals can find the submission instruction on the following
page: http://www.iiste.org/journals/ All the journals articles are available online to the
readers all over the world without financial, legal, or technical barriers other than those
inseparable from gaining access to the internet itself. Paper version of the journals is also
available upon request of readers and authors.
MORE RESOURCES
Book publication information: http://www.iiste.org/book/
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische Zeitschriftenbibliothek
EZB, Open J-Gate, OCLC WorldCat, Universe Digtial Library , NewJour, Google Scholar