Showing posts with label computational mathematics pdf. Show all posts
Showing posts with label computational mathematics pdf. Show all posts

Thursday, 22 June 2017

Statistical Process Capability Design to Improve Process Stability of a Molding Machine


Justification of production and manufacturing processes overtime, process capability in the concept of statistical control has been of great importance because it has promoted the production of products that satisfy the expectation of consumers. This paper aimed at promoting the adoption of quality process capability design in a bid to improve the process stability of a process and improve the process performance in the long run of production.

computational mathematics journal
In ensuring this, the technique of design of experiment is adopted using factorial design after which the capability analysis was carried out on the data on plastic containers produced by molding machines as deduced from the control Xbar and Range charts, it was established that the process was observed to be stable and in a state of statistical quality control and the plastic containers produced were observed to differ from one another as a result of variation on the part of the operators of the molding machines.

Wednesday, 14 June 2017

An Application of SLA in Small Business Sectors with Multi Item Inventory Management


All type of retailers face an uncertainty of consumer demands. The retailer who having long replenishment lead time from the original supplier and located close to each other are coordinated to prevent stock out and increase service level of their customer. This coordination is simply called lateral transshipment which defines the redistribution of stock from retailer with stock on hand to the retailer who is expecting significant loss due to high risk.

computational mathematics journal
If transportation cost is increased, lateral transshipment is known as a better approach than a policy of no transshipment. The execution of lateral transshipment was done by Young Hae Lee at airport to inspect the airplane. However this is difficult in the companies or in department due to the information extinction and insufficient understanding between companies.

Tuesday, 6 June 2017

Fixed Point Theory for Three φ–Weak Contraction Functions

Alber and Guerre-Delabriere demonstrated the “concept of weak contraction” in 1997. Actually in concept of weak contraction, the authors defined such mappings for single-valued maps on Hilbert spaces and proved the existence of fixed points. Rhoades showed that most results of concept of weak contraction are still true for any Banach space along with that he has proved the following very interesting fixed point theorem which is one of generalizations of the Banach contraction principle because it contains contractions as special cases (ϕ(t)=(1–k)t).

Wednesday, 31 May 2017

A New Method on Measure of Similarity between Interval-Valued Intuitionistic Fuzzy Sets for Pattern Recognition

The theory of fuzzy sets, proposed by Zadeh, has gained successful applications in various fields. Measures of similarity between fuzzy sets have gained attention from researchers for their wide applications in real world. Similarity measures are very useful in some areas, such as pattern recognition, machine learning, decision making and market prediction etc. Many measures of similarity between fuzzy sets have been proposed.

computational mathematics journal
Atanassov presented intuitionistic fuzzy sets which are very effective to deal with vagueness. Gau and Buehere researched vague sets. Bustince and Burillo pointed out that the notion of vague sets is same as that of interval-valued intuitionistic fuzzy sets. Chen and Tan proposed two similarity measures for measuring the degree of similarity between vague sets. De et al. defined some operations on intuitionistic fuzzy sets. Szmidt and Kacprzyk introduced the Hamming distance between intuitionistic fuzzy sets and proposed a similarity measure between intuitionistic fuzzy sets based on the distance.

Tuesday, 18 April 2017

More Comprehensive Computational Number Theory

computational mathematics journal
Computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. The best known problem in the field is the integer factorization, the great common divisor or the least common multiple.The largest known primes, which are usually Mersenne primes, and they were usually found by GIMPS, the Great Internet Mersenne Prime Search.

But in my opinion, the concepts of computational number theory could be more comprehensive, covering a wide range,including all the study of number theory by computers. For me, computers are so important for number theorists, just like telescopes for astronomers.

Friday, 18 November 2016

Control of Road Traffic Using Learning Classifier System

controlling Road Traffic
Road traffic control through proper control of junction signals is one of the complicated control issues. A conventionally used system is the rule-based system which is often employed in designing systems with deterministic states. In this paper, we have tried to study the control issue with the idea of distributed control through using Learning Classifier Systems (LCS). It means, controlling signal of any junction is done separately from other junctions through an independent Learning Classifier System and with the purpose of decreasing the lines of automobiles queue in the conduced streets to the junction. Furthermore, learning classifier systems have been used in order to control junction traffic within distributed control system.

Monday, 24 October 2016

Simulations of Three-dimensional Second Grade Fluid Flow Analysis in Converging-Diverging Nozzle

An analysing flow pattern in a converging-diverging nozzle has been one of interesting topic in computational fluid dynamics. There are numerous applications of this flow phenomenon in aerospace and engineering sciences. Such processes are difficult to handle analytically due to complex mathematical model associated to the flow and ensuing instabilities carried by flow parameters. Looking back to the history Jaffery and Hamel, in their studies considered the converging diverging channel steady two dimensional Newtonian fluid flow. 

Converging-Diverging Nozzle
They observed quiet interesting results by treating Navier-Stokes equations with similarity transforms. Further developments were presented in Schlichtinh and Batchelor based on the boundary layer approximations. Makinde examined the in compressible Newtonian fluid flow by incorporation of linearly diverging symmetrical channel. Recently, Zarqa et al. performed approximate analytical analysis using Adomian decomposition method for a channel with variable diverging ratio. 

Wednesday, 24 August 2016

On Duality of Multiobjective Rough Convex Programming Problems

Duality assertions are very important in optimization from the theoretical as well as from the numerical point of view. So this paperpresents duality of multiobjective rough convex programming problems in roughenvironment when the multiobjective function is deterministic and roughness is in feasible region. 

Rough set
Also it discussed the duality when roughness in multiobjective function and the feasible region is deterministic. The conceptsand some theorems of duality in the rough environment are discussed. Also, the procedure of solution of these kind of problems described.

The mathematical programming in rough environment was introduced. The multiobjective rough convex programming problem (MRCPP) can be classified according to existence of roughness is in multiobjective function or constraints. The mathematical problems can be classified into three classes. First class: MRCPP with rough feasible set and deterministic multiobjective function. Second class: problems with deterministic feasible set and rough multiobjective function.