The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for real assignment – Laptop selection problem using MATLAB coding.
An Application of Assignment Problem in Laptop Selection Problem Using MATLAB mathsjournal
The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for real assignment – Laptop selection problem using MATLAB coding.
An Application of Assignment Problem in Laptop Selection Problem Using MATLAB mathsjournal
The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for real assignment – Laptop selection problem using MATLAB coding.
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.
Solving ONE’S interval linear assignment problemIJERA Editor
In this paper to introduce a matrix ones interval linear assignment method or MOILA -method for solving wide range of problem. An example using matrix ones interval linear assignment methods and the existing Hungarian method have been solved and compared. Also some of the variations and some special cases in assignment problem and its applications have been discussed ,the proposed method is a systematic procedure, easy to apply and can be utilized for all types of assignment problem with maximize or minimize objective functions
IMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHESVikash Kumar
IMAGE CLASSIFICATION USING KNN, RANDOM FOREST AND SVM ALGORITHM ON GLAUCOMA DATASETS AND EXPLAIN THE ACCURACY, SENSITIVITY, AND SPECIFICITY OF EACH AND EVERY ALGORITHMS
A brief study on linear programming solving methodsMayurjyotiNeog
This small presentation includes a brief study on various linear programming solving methods. These methods (graphical & simplex) are used to solve industrial engineering related problems in practical use.
Teaching Mathematics Concepts via Computer Algebra Systemsinventionjournals
Most articles examine computer algebra systems (CAS) as they relate to the teaching and
learning of mathematics from advantages to disadvantages. This paper will explore junior undergraduate
students’ ability to solve distinguish tricky examples using various CAS technologies. Additionally, an
understanding for how CAS technologies are adopted and applied in professional environments is valuable,
both in guiding improvements to these tools and identifying new tools which can aid mathematician
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...gerogepatton
A support vector machine (SVM) learns the decision surface from two different classes of the input points, there are misclassifications in some of the input points in several applications. In this paper a bi-objective quadratic programming model is utilized and different feature quality measures are optimized simultaneously using the weighting method for solving our bi-objective quadratic programming problem. An important contribution will be added for the proposed bi-objective quadratic programming model by getting different efficient support vectors due to changing the weighting values. The numerical examples, give evidence of the effectiveness of the weighting parameters on reducing the misclassification between two classes of the input points. An interactive procedure will be added to identify the best compromise solution from the generated efficient solutions.
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...ijaia
A support vector machine (SVM) learns the decision surface from two different classes of the input points, there are misclassifications in some of the input points in several applications. In this paper a bi-objective quadratic programming model is utilized and different feature quality measures are optimized simultaneously using the weighting method for solving our bi-objective quadratic programming problem. An important contribution will be added for the proposed bi-objective quadratic programming model by getting different efficient support vectors due to changing the weighting values. The numerical examples, give evidence of the effectiveness of the weighting parameters on reducing the misclassification between two classes of the input points. An interactive procedure will be added to identify the best compromise solution from the generated efficient solutions.
Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...ijtsrd
Assignment problem is one of the most important in the theory of optimization in operation research, in which a group of workers has to perform a set of task. The problem is to assign each worker to a distinct task so as to minimize the total cost. In this paper we discussed about an application of an unbalanced assignment problem by using revised ones assignment method with Ghadle and Muley rule in Matlab coding. Mobile phones are assigning one - to -one assignment for the required users at minimum cost. Gowri. C | Manikandan. K. M "Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by using ROA-Method with Ghadle & Muley Rule in Mat Lab" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-6 , October 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29324.pdf Paper URL: https://www.ijtsrd.com/mathemetics/other/29324/mobile-phone-selection-problem-solved-by-an-unbalanced-assignment-model-by-using-roa-method-with-ghadle-and-muley-rule-in-mat-lab/gowri-c
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
Speaker diarization is a critical task in speech processing that aims to identify "who spoke when?" in an
audio or video recording that contains unknown amounts of speech from unknown speakers and unknown
number of speakers. Diarization has numerous applications in speech recognition, speaker identification,
and automatic captioning. Supervised and unsupervised algorithms are used to address speaker diarization
problems, but providing exhaustive labeling for the training dataset can become costly in supervised
learning, while accuracy can be compromised when using unsupervised approaches. This paper presents a
novel approach to speaker diarization, which defines loosely labeled data and employs x-vector embedding
and a formalized approach for threshold searching with a given abstract similarity metric to cluster
temporal segments into unique user segments. The proposed algorithm uses concepts of graph theory,
matrix algebra, and genetic algorithm to formulate and solve the optimization problem. Additionally, the
algorithm is applied to English, Spanish, and Chinese audios, and the performance is evaluated using wellknown similarity metrics. The results demonstrate that the robustness of the proposed approach. The
findings of this research have significant implications for speech processing, speaker identification
including those with tonal differences. The proposed method offers a practical and efficient solution for
speaker diarization in real-world scenarios where there are labeling time and cost constraints.
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
We present herein a new approach to the Continuum hypothesis CH. We will employ a string conditioning,
a technique that limits the range of a string over some of its sub-domains for forming subsets K of R. We
will prove that these are well defined and in fact proper subsets of R by making use of Cantor’s Diagonal
argument in its original form to establish the cardinality of K between that of (N,R) respectively
More Related Content
Similar to An Application of Assignment Problem in Laptop Selection Problem Using MATLAB
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.
Solving ONE’S interval linear assignment problemIJERA Editor
In this paper to introduce a matrix ones interval linear assignment method or MOILA -method for solving wide range of problem. An example using matrix ones interval linear assignment methods and the existing Hungarian method have been solved and compared. Also some of the variations and some special cases in assignment problem and its applications have been discussed ,the proposed method is a systematic procedure, easy to apply and can be utilized for all types of assignment problem with maximize or minimize objective functions
IMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHESVikash Kumar
IMAGE CLASSIFICATION USING KNN, RANDOM FOREST AND SVM ALGORITHM ON GLAUCOMA DATASETS AND EXPLAIN THE ACCURACY, SENSITIVITY, AND SPECIFICITY OF EACH AND EVERY ALGORITHMS
A brief study on linear programming solving methodsMayurjyotiNeog
This small presentation includes a brief study on various linear programming solving methods. These methods (graphical & simplex) are used to solve industrial engineering related problems in practical use.
Teaching Mathematics Concepts via Computer Algebra Systemsinventionjournals
Most articles examine computer algebra systems (CAS) as they relate to the teaching and
learning of mathematics from advantages to disadvantages. This paper will explore junior undergraduate
students’ ability to solve distinguish tricky examples using various CAS technologies. Additionally, an
understanding for how CAS technologies are adopted and applied in professional environments is valuable,
both in guiding improvements to these tools and identifying new tools which can aid mathematician
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...gerogepatton
A support vector machine (SVM) learns the decision surface from two different classes of the input points, there are misclassifications in some of the input points in several applications. In this paper a bi-objective quadratic programming model is utilized and different feature quality measures are optimized simultaneously using the weighting method for solving our bi-objective quadratic programming problem. An important contribution will be added for the proposed bi-objective quadratic programming model by getting different efficient support vectors due to changing the weighting values. The numerical examples, give evidence of the effectiveness of the weighting parameters on reducing the misclassification between two classes of the input points. An interactive procedure will be added to identify the best compromise solution from the generated efficient solutions.
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...ijaia
A support vector machine (SVM) learns the decision surface from two different classes of the input points, there are misclassifications in some of the input points in several applications. In this paper a bi-objective quadratic programming model is utilized and different feature quality measures are optimized simultaneously using the weighting method for solving our bi-objective quadratic programming problem. An important contribution will be added for the proposed bi-objective quadratic programming model by getting different efficient support vectors due to changing the weighting values. The numerical examples, give evidence of the effectiveness of the weighting parameters on reducing the misclassification between two classes of the input points. An interactive procedure will be added to identify the best compromise solution from the generated efficient solutions.
Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...ijtsrd
Assignment problem is one of the most important in the theory of optimization in operation research, in which a group of workers has to perform a set of task. The problem is to assign each worker to a distinct task so as to minimize the total cost. In this paper we discussed about an application of an unbalanced assignment problem by using revised ones assignment method with Ghadle and Muley rule in Matlab coding. Mobile phones are assigning one - to -one assignment for the required users at minimum cost. Gowri. C | Manikandan. K. M "Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by using ROA-Method with Ghadle & Muley Rule in Mat Lab" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-6 , October 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29324.pdf Paper URL: https://www.ijtsrd.com/mathemetics/other/29324/mobile-phone-selection-problem-solved-by-an-unbalanced-assignment-model-by-using-roa-method-with-ghadle-and-muley-rule-in-mat-lab/gowri-c
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
Speaker diarization is a critical task in speech processing that aims to identify "who spoke when?" in an
audio or video recording that contains unknown amounts of speech from unknown speakers and unknown
number of speakers. Diarization has numerous applications in speech recognition, speaker identification,
and automatic captioning. Supervised and unsupervised algorithms are used to address speaker diarization
problems, but providing exhaustive labeling for the training dataset can become costly in supervised
learning, while accuracy can be compromised when using unsupervised approaches. This paper presents a
novel approach to speaker diarization, which defines loosely labeled data and employs x-vector embedding
and a formalized approach for threshold searching with a given abstract similarity metric to cluster
temporal segments into unique user segments. The proposed algorithm uses concepts of graph theory,
matrix algebra, and genetic algorithm to formulate and solve the optimization problem. Additionally, the
algorithm is applied to English, Spanish, and Chinese audios, and the performance is evaluated using wellknown similarity metrics. The results demonstrate that the robustness of the proposed approach. The
findings of this research have significant implications for speech processing, speaker identification
including those with tonal differences. The proposed method offers a practical and efficient solution for
speaker diarization in real-world scenarios where there are labeling time and cost constraints.
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
We present herein a new approach to the Continuum hypothesis CH. We will employ a string conditioning,
a technique that limits the range of a string over some of its sub-domains for forming subsets K of R. We
will prove that these are well defined and in fact proper subsets of R by making use of Cantor’s Diagonal
argument in its original form to establish the cardinality of K between that of (N,R) respectively
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵mathsjournal
According to Bertrand's postulate, we have 𝑝𝑛 + 𝑝𝑛 ≥ 𝑝𝑛+1. Is it true that for all 𝑛 > 1 then 𝑝𝑛−1 + 𝑝𝑛 ≥𝑝𝑛+1? Then 𝑝𝑛 + 𝑝𝑛+3 > 𝑝𝑛+1 + 𝑝𝑛+2where 𝑛 ≥ 𝑁, 𝑁 is a large enough value?
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
We present herein a new approach to the Continuum hypothesis CH. We will employ a string conditioning,
a technique that limits the range of a string over some of its sub-domains for forming subsets K of R. We
will prove that these are well defined and in fact proper subsets of R by making use of Cantor’s Diagonal
argument in its original form to establish the cardinality of K between that of (N,R) respectively.
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...mathsjournal
systems in complex situations. A fundamental problem in radar systems is to automatically detect targets while maintaining a
desired constant false alarm probability. This work studies two detection approaches, the first with a fixed threshold and the
other with an adaptive one. In the latter, we have learned the three types of detectors CA, SO, and GO-CFAR. This research
aims to apply intelligent techniques to improve detection performance in a nonhomogeneous environment using standard
CFAR detectors. The objective is to maintain the false alarm probability and enhance target detection by combining
intelligent techniques. With these objectives in mind, implementing standard CFAR detectors is applied to nonhomogeneous
environment data. The primary focus is understanding the reason for the false detection when applying standard CFAR
detectors in a nonhomogeneous environment and how to avoid it using intelligent approaches.
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
Speaker diarization is a critical task in speech processing that aims to identify "who spoke when?" in an
audio or video recording that contains unknown amounts of speech from unknown speakers and unknown
number of speakers. Diarization has numerous applications in speech recognition, speaker identification,
and automatic captioning. Supervised and unsupervised algorithms are used to address speaker diarization
problems, but providing exhaustive labeling for the training dataset can become costly in supervised
learning, while accuracy can be compromised when using unsupervised approaches. This paper presents a
novel approach to speaker diarization, which defines loosely labeled data and employs x-vector embedding
and a formalized approach for threshold searching with a given abstract similarity metric to cluster
temporal segments into unique user segments. The proposed algorithm uses concepts of graph theory,
matrix algebra, and genetic algorithm to formulate and solve the optimization problem. Additionally, the
algorithm is applied to English, Spanish, and Chinese audios, and the performance is evaluated using wellknown similarity metrics. The results demonstrate that the robustness of the proposed approach. The
findings of this research have significant implications for speech processing, speaker identification
including those with tonal differences. The proposed method offers a practical and efficient solution for
speaker diarization in real-world scenarios where there are labeling time and cost constraints.
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...mathsjournal
There is currently much interest in predator–prey models across a variety of bioscientific disciplines. The focus is on quantifying predator–prey interactions, and this quantification is being formulated especially as regards climate change. In this article, a stability analysis is used to analyse the behaviour of a general two-species model with respect to the Allee effect (on the growth rate and nutrient limitation level of the prey population). We present a description of the local and non-local interaction stability of the model and detail the types of bifurcation which arise, proving that there is a Hopf bifurcation in the Allee effect module. A stable periodic oscillation was encountered which was due to the Allee effect on the
prey species. As a result of this, the positive equilibrium of the model could change from stable to unstable and then back to stable, as the strength of the Allee effect (or the ‘handling’ time taken by predators when predating) increased continuously from zero. Hopf bifurcation has arose yield some complex patterns that have not been observed previously in predator-prey models, and these, at the same time, reflect long term behaviours. These findings have significant implications for ecological studies, not least with respect to examining the mobility of the two species involved in the non-local domain using Turing instability. A spiral generated by local interaction (reflecting the instability that forms even when an infinitely large
carrying capacity is assumed) is used in the model.
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
We present herein a new approach to the Continuum hypothesis CH. We will employ a string conditioning,a technique that limits the range of a string over some of its sub-domains for forming subsets K of R. We will prove that these are well defined and in fact proper subsets of R by making use of Cantor’s Diagonal argument in its original form to establish the cardinality of K between that of (N,R) respectively.
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...mathsjournal
Modernization of radar technology and improved signal processing techniques are necessary to improve detection systems in complex situations. A fundamental problem in radar systems is to automatically detect targets while maintaining a
desired constant false alarm probability. This work studies two detection approaches, the first with a fixed threshold and the
other with an adaptive one. In the latter, we have learned the three types of detectors CA, SO, and GO-CFAR. This research
aims to apply intelligent techniques to improve detection performance in a nonhomogeneous environment using standard
CFAR detectors. The objective is to maintain the false alarm probability and enhance target detection by combining
intelligent techniques. With these objectives in mind, implementing standard CFAR detectors is applied to nonhomogeneous
environment data. The primary focus is understanding the reason for the false detection when applying standard CFAR
detectors in a nonhomogeneous environment and how to avoid it using intelligent approaches
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
Speaker diarization is a critical task in speech processing that aims to identify "who spoke when?" in an
audio or video recording that contains unknown amounts of speech from unknown speakers and unknown
number of speakers. Diarization has numerous applications in speech recognition, speaker identification,
and automatic captioning. Supervised and unsupervised algorithms are used to address speaker diarization
problems, but providing exhaustive labeling for the training dataset can become costly in supervised
learning, while accuracy can be compromised when using unsupervised approaches. This paper presents a
novel approach to speaker diarization, which defines loosely labeled data and employs x-vector embedding
and a formalized approach for threshold searching with a given abstract similarity metric to cluster
temporal segments into unique user segments. The proposed algorithm uses concepts of graph theory,
matrix algebra, and genetic algorithm to formulate and solve the optimization problem. Additionally, the
algorithm is applied to English, Spanish, and Chinese audios, and the performance is evaluated using wellknown similarity metrics. The results demonstrate that the robustness of the proposed approach. The
findings of this research have significant implications for speech processing, speaker identification
including those with tonal differences. The proposed method offers a practical and efficient solution for
speaker diarization in real-world scenarios where there are labeling time and cost constraints
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...mathsjournal
Color in an image is resolved to 3 or 4 color components and 2-Dimages of these components are stored in separate channels. Most of the color image enhancement algorithms are applied channel-by-channel on each image. But such a system of color image processing is not processing the original color. When a color image is represented as a quaternion image, processing is done in original colors. This paper proposes an implementation of the quaternion approach of enhancement algorithm for enhancing color images and is referred as the modified alpha-rooting by the two-dimensional quaternion discrete Fourier transform (2-D QDFT). Enhancement results of this proposed method are compared with the channel-by-channel image enhancement by the 2-D DFT. Enhancements in color images are quantitatively measured by the color enhancement measure estimation (CEME), which allows for selecting optimum parameters for processing by thegenetic algorithm. Enhancement of color images by the quaternion based method allows for obtaining images which are closer to the genuine representation of the real original color.
The aim of this paper is to study the class of β-normal spaces. The relationships among s-normal spaces, pnormal spaces and β-normal spaces are investigated. Moreover, we study the forms of generalized β-closed
functions. We obtain characterizations of β-normal spaces, properties of the forms of generalized β-closed
functions and preservation theorems.
Cubic Response Surface Designs Using Bibd in Four Dimensionsmathsjournal
Response Surface Methodology (RSM) has applications in Chemical, Physical, Meteorological, Industrial and Biological fields. The estimation of slope response surface occurs frequently in practical situations for the experimenter. The rates of change of the response surface, like rates of change in the yield of crop to various fertilizers, to estimate the rates of change in chemical experiments etc. are of
interest. If the fit of second order response is inadequate for the design points, we continue the
experiment so as to fit a third order response surface. Higher order response surface designs are sometimes needed in Industrial and Meteorological applications. Gardiner et al (1959) introduced third order rotatable designs for exploring response surface. Anjaneyulu et al (1994-1995) constructed third order slope rotatable designs using doubly balanced incomplete block designs. Anjaneyulu et al (2001)
introduced third order slope rotatable designs using central composite type design points. Seshu babu et al (2011) studied modified construction of third order slope rotatable designs using central composite
designs. Seshu babu et al (2014) constructed TOSRD using BIBD. In view of wide applicability of third
order models in RSM and importance of slope rotatability, we introduce A Cubic Slope Rotatable Designs Using BIBD in four dimensions.
The caustic that occur in geodesics in space-times which are solutions to the gravitational field equations with the energy-momentum tensor satisfying the dominant energy condition can be circumvented if quantum variations are allowed. An action is developed such that the variation yields the field equations
and the geodesic condition, and its quantization provides a method for determining the extent of the wave packet around the classical path.
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...mathsjournal
For one dimensional homogeneous, isotropic aquifer, without accretion the governing Boussinesq equation under Dupuit assumptions is a nonlinear partial differential equation. In the present paper approximate analytical solution of nonlinear Boussinesq equation is obtained using Homotopy perturbation transform method(HPTM). The solution is compared with the exact solution. The comparison shows that the HPTM is efficient, accurate and reliable. The analysis of two important aquifer
parameters namely viz. specific yield and hydraulic conductivity is studied to see the effects on the height of water table. The results resemble well with the physical phenomena.
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...mathsjournal
In this paper, we give some new definition of Compatible mappings of type (P), type (P-1) and type (P-2) in intuitionistic generalized fuzzy metric spaces and prove Common fixed point theorems for six mappings
under the conditions of compatible mappings of type (P-1) and type (P-2) in complete intuitionistic fuzzy
metric spaces. Our results intuitionistically fuzzify the result of Muthuraj and Pandiselvi [15]
Mathematics subject classifications: 45H10, 54H25
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...mathsjournal
In the earlier work, Knuth present an algorithm to decrease the coefficient growth in the Euclidean algorithm of polynomials called subresultant algorithm. However, the output polynomials may have a small factor which can be removed. Then later, Brown of Bell Telephone Laboratories showed the subresultant in another way by adding a variant called 𝜏 and gave a way to compute the variant. Nevertheless, the way failed to determine every 𝜏 correctly.
In this paper, we will give a probabilistic algorithm to determine the variant 𝜏 correctly in most cases by adding a few steps instead of computing 𝑡(𝑥) when given 𝑓(𝑥) and𝑔(𝑥) ∈ ℤ[𝑥], where 𝑡(𝑥) satisfies that 𝑠(𝑥)𝑓(𝑥) + 𝑡(𝑥)𝑔(𝑥) = 𝑟(𝑥), here 𝑡(𝑥), 𝑠(𝑥) ∈ ℤ[𝑥]
Table of Contents - September 2022, Volume 9, Number 2/3mathsjournal
Applied Mathematics and Sciences: An International Journal (MathSJ ) aims to publish original research papers and survey articles on all areas of pure mathematics, theoretical applied mathematics, mathematical physics, theoretical mechanics, probability and mathematical statistics, and theoretical biology. All articles are fully refereed and are judged by their contribution to advancing the state of the science of mathematics.
Code of the multidimensional fractional pseudo-Newton method using recursive ...mathsjournal
The following paper presents one way to define and classify the fractional pseudo-Newton method through a group of fractional matrix operators, as well as a code written in recursive programming to implement this
method, which through minor modifications, can be implemented in any fractional fixed-point method that allows
solving nonlinear algebraic equation systems.
Seminar of U.V. Spectroscopy by SAMIR PANDASAMIR PANDA
Spectroscopy is a branch of science dealing the study of interaction of electromagnetic radiation with matter.
Ultraviolet-visible spectroscopy refers to absorption spectroscopy or reflect spectroscopy in the UV-VIS spectral region.
Ultraviolet-visible spectroscopy is an analytical method that can measure the amount of light received by the analyte.
THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.Sérgio Sacani
The return of a sample of near-surface atmosphere from Mars would facilitate answers to several first-order science questions surrounding the formation and evolution of the planet. One of the important aspects of terrestrial planet formation in general is the role that primary atmospheres played in influencing the chemistry and structure of the planets and their antecedents. Studies of the martian atmosphere can be used to investigate the role of a primary atmosphere in its history. Atmosphere samples would also inform our understanding of the near-surface chemistry of the planet, and ultimately the prospects for life. High-precision isotopic analyses of constituent gases are needed to address these questions, requiring that the analyses are made on returned samples rather than in situ.
This presentation explores a brief idea about the structural and functional attributes of nucleotides, the structure and function of genetic materials along with the impact of UV rays and pH upon them.
Professional air quality monitoring systems provide immediate, on-site data for analysis, compliance, and decision-making.
Monitor common gases, weather parameters, particulates.
Nutraceutical market, scope and growth: Herbal drug technologyLokesh Patil
As consumer awareness of health and wellness rises, the nutraceutical market—which includes goods like functional meals, drinks, and dietary supplements that provide health advantages beyond basic nutrition—is growing significantly. As healthcare expenses rise, the population ages, and people want natural and preventative health solutions more and more, this industry is increasing quickly. Further driving market expansion are product formulation innovations and the use of cutting-edge technology for customized nutrition. With its worldwide reach, the nutraceutical industry is expected to keep growing and provide significant chances for research and investment in a number of categories, including vitamins, minerals, probiotics, and herbal supplements.
Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...Sérgio Sacani
We characterize the earliest galaxy population in the JADES Origins Field (JOF), the deepest
imaging field observed with JWST. We make use of the ancillary Hubble optical images (5 filters
spanning 0.4−0.9µm) and novel JWST images with 14 filters spanning 0.8−5µm, including 7 mediumband filters, and reaching total exposure times of up to 46 hours per filter. We combine all our data
at > 2.3µm to construct an ultradeep image, reaching as deep as ≈ 31.4 AB mag in the stack and
30.3-31.0 AB mag (5σ, r = 0.1” circular aperture) in individual filters. We measure photometric
redshifts and use robust selection criteria to identify a sample of eight galaxy candidates at redshifts
z = 11.5 − 15. These objects show compact half-light radii of R1/2 ∼ 50 − 200pc, stellar masses of
M⋆ ∼ 107−108M⊙, and star-formation rates of SFR ∼ 0.1−1 M⊙ yr−1
. Our search finds no candidates
at 15 < z < 20, placing upper limits at these redshifts. We develop a forward modeling approach to
infer the properties of the evolving luminosity function without binning in redshift or luminosity that
marginalizes over the photometric redshift uncertainty of our candidate galaxies and incorporates the
impact of non-detections. We find a z = 12 luminosity function in good agreement with prior results,
and that the luminosity function normalization and UV luminosity density decline by a factor of ∼ 2.5
from z = 12 to z = 14. We discuss the possible implications of our results in the context of theoretical
models for evolution of the dark matter halo mass function.
An Application of Assignment Problem in Laptop Selection Problem Using MATLAB
1. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
41
An Application of Assignment Problem in Laptop
Selection Problem Using MATLAB
Ghadle Kirtiwant P, Muley Yogesh M
ABSTRACT
The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the
main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for
real assignment – Laptop selection problem using MATLAB coding.
KEYWORD
Assignment problem, linear integer programming, Revised Ones Assignment Method (ROA), MATLAB
programming
2010 Mathematics Subject Classification: 90-02, 90-08, 90B06, 90B10, 90C05, 90C08, 90C90.
1 INTRODUCTION
Now a day’s laptop is very essential equipment for college, university students as well as
faculties. It is also common to observe that at each home having either laptop or PC. Consider
that an individual want to purchase laptop, but in market various types of product & companies
available, where anyone can be confused. If we want to purchase laptop seller gives us latest high
configured system, which cost approximately between Rs. 45,000 to Rs 90,000. So problem
arises here, if owner is general user and his purpose and requirement are basic then whether he
should purchase given amount laptop? To overcome this problem we defined four categories of
users, and also recommended which laptop he should purchase as per his category and basic
requirement. To solve this laptop selection problem an Assignment Model used.
Assignment Problem (AP) is known as degenerate form of a transportation problem, in AP total
number of assign element is ‘n’. It appears in some decision-making situations. The typical
problems are to assign activities to resources, ‘n’ workers to ‘n’ jobs etc.
Laptop selection problem is in unbalanced form, where four types of users have to choose four
laptops from 21 described laptops (see table 3). To solve this problem ROA method is used
which gives some ones in Assignment matrix and using “Ghadle and Muley rule” will find out
optimal solution. To verify the result MATLAB Program is used which will save calculating time
of problem and give accurate optimal solution within sec.
MATLAB is specially used for matrix, using MATLAB software various matrix operations can
be performed for e.g. matrix addition, subtraction, multiplication, element to element
multiplication, inverse etc and various functions available for solving matrix. In unbalanced
laptop selection problem ROA algorithm is used as program. The time complexity for this
algorithm is less than O (n2
log n). MATLAB programming is stronger and sophisticated than
2. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
42
1
1
1
Required
1
1
1
nn
C
n2
C
n1
C
2n
C
22
C
21
C
1n
C
12
C
11
C
n
R
2
R
1
R
Resource
Available
n
A
2
A
1
A
Activity
L
M
L
M
O
M
M
L
L
M
L
conventional computer languages (e.g. C, FORTRAN) for solving technical problems. MATLAB
is an interactive system whose basic data element is an array that does not require dimensioning.
2 MATHEMATICAL MODELS FOR ASSIGNMENT PROBLEM
To minimize the overall cost or time, let consider Assignment Problem of ‘n’ resources to ‘n’
activities in such a way that one and only one job should assign to each resources. Where ܥ is
cost matrix given as,
In Assignment Model, the availability at each of the resources and the requirement at each of the
destinations is unity.
Let x୧୨ – Assign ݅௧
resources to ݆௧
activity such that,
x୧୨ = ൜
1; if assignment of i୲୦
resources to j୲୦
activity.
0 ; otherwise
Then the mathematical model for assignment problem is,
݁ݖ݅݉݊݅݊݅ܯ ݖ = ܿݔ
ୀଵ
ୀଵ
(1)
Subject to,
ݔ = 1 ܽ݊݀ ݔ = 1 ∶ ݔ
ୀଵ
= 0 ݎ 1
ୀଵ
(2)
For all i=1, 2, …, n and j= 1,2,…,n.
Preliminaries:
Balance Assignment Problem: In balanced model activities equal resources.
Unbalance Assignment Problem: In an unbalanced model activity does not equal resource.
3. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
43
nn
C
n2
C
n1
C
2n
C
22
C
21
C
1n
C
12
C
11
C
n
2
1
n
2
1
L
M
O
M
M
L
L
M
L
n
a
2
a
1
a
nn
C
n2
C
n1
C
2n
C
22
C
21
C
1n
C
12
C
11
C
n
2
1
M
L
M
O
M
M
L
L
L
n
b
2
b
1
b
n
a
nn
C
n
a
n2
C
n
a
n1
C
2
a
2n
C
2
a
22
C
2
a
21
C
1
a
1n
C
1
a
12
C
1
a
11
C
n
2
1
n
2
1
L
L
M
O
M
M
L
L
M
L
3 Revised Ones Assignment Method (ROA) for Assignment Problem. [1, 3]
In ROA method, by dividing minimum element from each row and column to corresponding
rows and column we get at least one value in each rows and columns. Then find complete
assignment in terms of ones.
Now, in assignment matrix ܥ is the cost or effectiveness of assigning ݅௧
machine.
The new algorithm is as follows.
Let (1-2) be an assignment problem in which the objective function can be minimized or
maximized.
Step 1
In a minimization case, find the minimum element of each row (say ai) and write it on the right
hand side of the matrix.
After dividing each element of ith
row of the matrix by ai. We get at least one ones in each rows.
In term of one for each row and one for each column, do assignment. Otherwise go to step 2.
Step 2
Find the minimum element of each column (say bj), and write it below jth
column, by dividing
each element of jth
column of the matrix by bj. We get at least one ones in each columns. This
gives assignment matrix in terms of ones. If no feasible assignment can be achieved from step (1)
and (2) then go to step 3.
4. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
44
Note: In a maximization case, the end of step 2 we have a fuzzy matrix. Which all elements are
belong to [0, 1], and the greatest is one [2].
Step 3
To find optimality test draw the minimum number of lines which cover all the ones in the
Assignment matrix. If the numbers of drawn lines are less than ‘n’, then optimality condition fails
i.e. complete assignment is not possible. While optimality condition satisfied, if the number of
lines is exactly equal to ‘n’, then the complete assignment is possible.
Step 4
If optimality condition fails in step 3, then select the smallest element (say dij) out of those which
do not lie on any of the lines in the above matrix. By dividing smallest element dij to each element
of the uncovered rows or columns. This gives some new ones to this row or column.
If still optimality condition fails in this new matrix, then use step 4 and 3 iteratively. By repeating
the same procedure the optimal assignment will be obtained.
(To assign one Ghadle and Muley Rule is used, which is mentioned below.)
Step 5 (Ghadle and Muley Rule to assign one in Assignment Matrix)
i) For minimization problem select max value from calculated matrix and write it on right
hand side as well as bottom side.
• To assign one, start from min value of columns (mentioned at bottom side) and select
ones.
• If there are more than one ones in any column then ignore temporarily, and give last
priority to that column.
• If still there are identical ones in column then give the priority to max value of rows
(mentioned at right hand side).
Or Vice – Versa.
Remarks: In Unbalanced Assignment Problem, if there are more than one ones in any row then
give priority to first element.
Priority rule
To solve Unbalanced Assignment Problem (non square matrix), we convert it into Balanced
Assignment Matrix form by adding artificial row or column, which having all elements one.
Hence we can solve the problem using ROA method. After performing the steps reduces to a
matrix which has ones in each rows and columns. So, the optimal assignment has been reached.
5. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
45
4 APPLICATIONS:
Now a day various techniques have been used to attract candidates in colleges and universities for
admission. Let consider that a college management decide to give the laptops to admitted students
as per their requirements and courses. To reduce laptop purchase cost we have select laptop as per
courses and there requirement, for laptop configuration we divide users into four categories, like
General users, Professionals, Programmers, Engineers.
Requirements of Users:
As per our observations we conclude following
1. General Users:
• Like science, commerce, and arts student, used laptop for preparing notes, presentation
and also using some software like Ms-office, Tally, DTP etc. for that sufficient
configuration is : asus/ dual core processor, 1 or 2 GB RAM, 500 GB HDD, 512 GD (for
high graphics, like games).
2. Professional Users:
• Like MBA (all courses), ICWA, CA, used laptop for accounting, presentation and also
using some software like Ms-office, Tally, SAP and some online software which required
high configuration than General users. For that sufficient configuration is: dual core
processor, 1 or 2 GB RAM, 500 GB HDD.
3. Programmers:
• Like MCA, MCS, M.E / B.E (Computer) used laptop for programming, making
software’s. Generally they used software like C- programming, VB, VB.net, Oracle, Java,
SAP etc. which required high configuration than Professional users. For that sufficient
configuration is: core i3 processor, 2 or 4 GB RAM, 500 GB HDD, 1GB GD (for high
graphics).
4. Engineers:
• Like Mechanical, Electrical, Civil etc. used laptop for graphics design. Generally they
used software like Auto Cad, UG, PRO –E, CATIA which required higher graphics
resolution. For that sufficient configuration is: Core i5 or i7 processor, 4 or 8 GB RAM,
500 GB HDD, 1 or 2 GB GD (for high graphics).
To overcome this situation there are several credit points under consideration, firstly consider the
competencies necessary to develop the users. Obviously some competencies like processor, RAM
having more importance and some competencies like HDD, Screen size, Graphics Card having
less important compare to first one. Moreover, usually the users are not independent; therefore a
relationship among them could appear. Finally, all particular with credit points are shown in table
1 as per their necessary requirements.
6. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
46
Particulars Credit Points
Essential 5
Fairly High 4
High 3
Moderate 2
Low 1
Fairly Low 0
Table 1
Processor
Particulars Users General Professionals Programmers Engineers
Dual Core 5 5 0 0
Core i3 0 4 5 0
Core i5 0 0 4 5
Core i7 0 0 0 4
Asus Brazo 5 0 0 0
Asus Intel Dual Core 4 5 0 0
Asus Core i3 0 4 5 0
Asus Core i5 0 0 4 5
RAM
2 GB 3 3 3 0
4 GB 0 2 2 3
8 GB 0 0 0 2
HDD
500 GB 3 3 3 3
1 TB 0 0 2 2
Screen 15.6 3 3 3 3
Graphics
Card
512 MB 3 2 3 0
1 GB 0 0 2 3
2 GB 0 0 0 2
Once the users involved in the selection procedure have been determined, the laptops must next to be
considered. Let it be imagined that there are 21 laptops (see table 3) that might be able to select for
different Users.
Laptops Name
Laptop1 L1
Laptop2 L2
..
7. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
47
Laptop21 L21
For each one it is necessary to find out by some appropriate, means the levels in each of the particular
required for the users. Finally as there are links between the users and laptops (using table1 credit
points in table 3) must be looked at in order to find out the relationships that there would be among
them, as shown in table 2.
Table 2
Unbalanced Assignment Problem is solved by using ROA method and MATLAB Programming
(See Appendix 1). This gives final optimal solution as:
Users Laptop
General L1
Professionals L2
Programmers L9
Engineers L15
5 CONCLUSIONS:
To select appropriate laptops as per user’s requirement and basic needs. The given problem
converted into Assignment Model. The given information in table 3 is converted into numerical
by using credit points given in table 1, to solve this realistic problem ROA method is used and at
last it verified by MATLAB program which gives optimal solution within 0.005256 sec.
6 REFERENCES
[1] Hadi Basirzadeh. “Ones Assignment Method for solving Assignment Problems”, Applied
Mathematical Sciences, Vol 6 (2012), No. 47, pp. 2345-2355.
[2] Francisco Herrera, Enrique López, Cristina Mendaña, Miguel A. Rodríguez. “Solving an assignment
– selection problem with verbal information and using genetic algorithms”, European Journal of
Operation Research, 119 (1999), pp. 326-337.
[3] Ghadle Kirtiwant P, Muley Yogesh M (2013), “Revised Ones Assignment Method for Solving
Assignment Problem”, Journal of Statistics and Mathematics, Volume 4, Issue 1 (2013), pp. 147-150.
8. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
48
Table 3: (shows various types of laptops with specifications and cost)
Appendix 1:
% MATLAB PROGRAM FOR ASSIGNMENT - LAPTOP SELECTION PROBLEM.
% DEVELOPED BY : Dr. Kirtiwant Ghadle , Mr. Yogesh Muley
clc
tic;
x= [17 14 14 9 9 3 6 9 9 6 6 9 6 6 6 6 6 6 3 3 3
11 14 14 13 13 10 12 9 13 12 12 13 12 8 8 12 8 8 5 5 6
12 9 9 14 14 13 13 13 16 15 15 14 13 12 14 15 12 14 13 11 5
6 6 6 6 6 5 9 11 9 12 12 6 11 14 17 12 16 17 16 15 13 ]
% matrix x is copied in xnv and x1 variable
xnv=x;
x1=x;
% calculating each row minimum no.
maxr= nnmaxr(x)
% find row and column no
[r c]=size(x)
% dividing each element of row
9. 49
for i=1:r
for j=1:c
x(i,j)=x(i,j)/maxr(i);
end
end
x
y=x;
for i=1:r
for j=1:c
if x(i,j)1
x(i,j)=0;
end
end
end
x
l=1;
for i=1:r
for j=1:c
[xr xc]= find(x==l,'1');
k1=length(xr);
for m=1:k1
x(xr(m),xc(m))=1;
if x(xr(m),j)~= x(xr(m),xc(m))
x(xr(m),j)=0;
end
end
end
end
x;
z=xnv.*x
toc;
Dr. Kirtiwant P Ghadle
Department of Mathematics,
Dr. Babasaheb Ambedkar Marathwada University,
Aurangabad -431004.
drkp.ghadle@gmail.com
Mr. Yogesh M Muley
Department of Mathematics,
Dr. Babasaheb Ambedkar Marathwada University,
Aurangabad -431004.
yogesh.m.muley@gmail.com