• Title/Summary/Keyword: system of computer mathematics

Search Result 329, Processing Time 0.032 seconds

Unsupervised Segmentation of Images Based on Shuffled Frog-Leaping Algorithm

  • Tehami, Amel;Fizazi, Hadria
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.370-384
    • /
    • 2017
  • The image segmentation is the most important operation in an image processing system. It is located at the joint between the processing and analysis of the images. Unsupervised segmentation aims to automatically separate the image into natural clusters. However, because of its complexity several methods have been proposed, specifically methods of optimization. In our work we are interested to the technique SFLA (Shuffled Frog-Leaping Algorithm). It's a memetic meta-heuristic algorithm that is based on frog populations in nature searching for food. This paper proposes a new approach of unsupervised image segmentation based on SFLA method. It is implemented and applied to different types of images. To validate the performances of our approach, we performed experiments which were compared to the method of K-means.

MULTI-ITEM SHELF-SPACE ALLOCATION OF BREAKABLE ITEMS VIA GENETIC ALGORITHM

  • MAITI MANAS KUMAR;MAITI MANORANJAN
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.327-343
    • /
    • 2006
  • A general methodology is suggested to solve shelf-space allocation problem of retailers. A multi-item inventory model of breakable items is developed, where items are either complementary or substitute. Demands of the items depend on the amount of stock on the showroom and unit price of the respective items. Also demand of one item decreases (increases) due to the presence of others in case of substitute (complementary) product. For such a model, a Contractive Mapping Genetic Algorithm (CMGA) has been developed and implemented to find the values of different decision variables. These are evaluated to have maximum possible profit out of the proposed system. The system has been illustrated numerically and results for some particular cases are derived. The results are compared with some other heuristic approaches- Simulated Annealing (SA), simple Genetic Algorithm (GA) and Greedy Search Approach (GSA) developed for the present model.

FINDING THE OPTIMUM DOMAIN OF A NONLINEAR WAVE OPTIMAL CONTROL SYSTEM BY MEASURES

  • J., A.Fakharzadeh
    • Journal of applied mathematics & informatics
    • /
    • v.13 no.1_2
    • /
    • pp.183-194
    • /
    • 2003
  • We will explain a new method for obtaining the nearly optimal domain for optimal shape design problems associated with the solution of a nonlinear wave equation. Taking into account the boundary and terminal conditions of the system, a new approach is applied to determine the optimal domain and its related optimal control function with respect to the integral performance criteria, by use of positive Radon measures. The approach, say shape-measure, consists of two steps; first for a fixed domain, the optimal control will be identified by the use of measures. This function and the optimal value of the objective function depend on the geometrical variables of the domain. In the second step, based on the results of the previous one and by applying some convenient optimization techniques, the optimal domain and its related optimal control function will be identified at the same time. The existence of the optimal solution is considered and a numerical example is also given.

Development of Creative Convergence Talent in the era of the 4th Industrial Revolution through Self-Directed Mathematical Competency

  • Seung-Woo, LEE;Sangwon, LEE
    • International Journal of Advanced Culture Technology
    • /
    • v.10 no.4
    • /
    • pp.86-93
    • /
    • 2022
  • To combine the science and technology creativity necessary in the era of the 4th Industrial Revolution, it is necessary to cultivate talents who can discover new knowledge and create new values by combining various knowledge with self-directed mathematical competencies. This research attempted to lay the foundation for the curriculum for fostering future creative convergence talent by preparing, executing, and reflecting on the learning plan after learners themselves understand their level and status through self-directed learning. Firstly, We would like to present a teaching-learning plan based on the essential capabilities of the future society, where the development of a curriculum based on mathematics curriculum and intelligent informatization are accelerated. Secondly, an educational design model system diagram was presented to strengthen the self-directed learning ability of mathematics subjects in the electronic engineering curriculum. Consequently, through a survey, we would like to propose the establishment of an educational system necessary for the 4th industry by analyzing learning ability through self-directed learning teaching methods of subjects related to mathematics, probability, and statistics.

COMPARISON OF DISCRETE TIME INVENTORY SYSTEMS WITH POSITIVE SERVICE TIME AND LEAD TIME

  • Balagopal, N;Deepthy, CP;Jayaprasad, PN;Varghese, Jacob
    • Korean Journal of Mathematics
    • /
    • v.29 no.2
    • /
    • pp.371-386
    • /
    • 2021
  • This paper investigates two discrete time queueing inventory models with positive service time and lead time. Customers arrive according to a Bernoulli process and service time and lead time follow geometric distributions. The first model under discussion based on replenishment of order upto S policy where as the second model is based on order placement by a fixed quantity Q, where Q = S - s, whenever the inventory level falls to s. We analyse this queueing systems using the matrix geometric method and derive an explicit expression for the stability condition. We obtain the steady-state behaviour of these systems and several system performance measures. The influence of various parameters on the systems performance measures and comparison on the cost analysis are also discussed through numerical example.

ANALYSIS OF THE DISCRETE-TIME GI/G/1/K USING THE REMAINING TIME APPROACH

  • Liu, Qiaohua;Alfa, Attahiru Sule;Xue, Jungong
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.153-162
    • /
    • 2010
  • The finite buffer GI/G/1/K system is set up by using an unconventional arrangement of the state space, in which the remaining interarrival time or service time is chosen as the level. The stationary distributions of resulting Markov chain can be explicitly determined, and the chain is positive recurrent without any restriction. This is an advantage of this method, compared with that using the elapsed time approach [2].

EXISTENCE OF BOUNDARY BLOW-UP SOLUTIONS FOR A CLASS OF QUASILINEAR ELLIPTIC SYSTEMS

  • Wu, Mingzhu;Yang, Zuodong
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1119-1132
    • /
    • 2009
  • In this paper, we consider the quasilinear elliptic system $\\div(|{\nabla}u|^{p-2}{\nabla}u)=u(a_1u^{m1}+b_1(x)u^m+{\delta}_1v^n),\;\\div(|{\nabla}_v|^{q-2}{\nabla}v)=v(a_2v^{r1}+b_2(x)v^r+{\delta}_2u^s)$, in $\Omega$ where m > $m_1$ > p-2, r > $r_1$ > q-, p, q $\geq$ 2, and ${\Omega}{\subset}R^N$ is a smooth bounded domain. By constructing certain super and subsolutions, we show the existence of positive blow-up solutions and give a global estimate.

  • PDF

DATA MINING AND PREDICTION OF SAI TYPE MATRIX PRECONDITIONER

  • Kim, Sang-Bae;Xu, Shuting;Zhang, Jun
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.351-361
    • /
    • 2010
  • The solution of large sparse linear systems is one of the most important problems in large scale scientific computing. Among the many methods developed, the preconditioned Krylov subspace methods are considered the preferred methods. Selecting a suitable preconditioner with appropriate parameters for a specific sparse linear system presents a challenging task for many application scientists and engineers who have little knowledge of preconditioned iterative methods. The prediction of ILU type preconditioners was considered in [27] where support vector machine(SVM), as a data mining technique, is used to classify large sparse linear systems and predict best preconditioners. In this paper, we apply the data mining approach to the sparse approximate inverse(SAI) type preconditioners to find some parameters with which the preconditioned Krylov subspace method on the linear systems shows best performance.

Development of Internet of Things Sensor-based Information System Robust to Security Attack (보안 공격에 강인한 사물인터넷 센서 기반 정보 시스템 개발)

  • Yun, Junhyeok;Kim, Mihui
    • Journal of Internet Computing and Services
    • /
    • v.23 no.4
    • /
    • pp.95-107
    • /
    • 2022
  • With the rapid development of Internet of Things sensor devices and big data processing techniques, Internet of Things sensor-based information systems have been applied in various industries. Depending on the industry in which the information systems are applied, the accuracy of the information derived can affect the industry's efficiency and safety. Therefore, security techniques that protect sensing data from security attacks and enable information systems to derive accurate information are essential. In this paper, we examine security threats targeting each processing step of an Internet of Things sensor-based information system and propose security mechanisms for each security threat. Furthermore, we present an Internet of Things sensor-based information system structure that is robust to security attacks by integrating the proposed security mechanisms. In the proposed system, by applying lightweight security techniques such as a lightweight encryption algorithm and obfuscation-based data validation, security can be secured with minimal processing delay even in low-power and low-performance IoT sensor devices. Finally, we demonstrate the feasibility of the proposed system by implementing and performance evaluating each security mechanism.

A NOTE ON THE NONLOCAL CONTROLLABILITY OF HILFER FRACTIONAL DIFFERENTIAL EQUATIONS VIA MEASURE OF NONCOMPACTNESS

  • C.S.V. BOSE;V. SESUM-CAVIC;R. UDHAYAKUMAR;B.A. NISHA;S. AL-OMARI;M.H. KISHOR
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.2
    • /
    • pp.399-415
    • /
    • 2024
  • We looked at nonlocal controllability for Hilfer fractional differential equations with almost sectorial operator in this manuscript. We show certain necessary criteria for nonlocal controllability using the measure of noncompactness and the Mönch fixed point theorem. Finally, we provided theoretical and practical applications are given to demonstrate how the abstract results might be applied.