• Title/Summary/Keyword: system of computer mathematics

Search Result 327, Processing Time 0.035 seconds

SOME LIMIT PROPERTIES OF RANDOM TRANSITION PROBABILITY FOR SECOND-ORDER NONHOMOGENEOUS MARKOV CHAINS ON GENERALIZED GAMBLING SYSTEM INDEXED BY A DOUBLE ROOTED TREE

  • Wang, Kangkang;Zong, Decai
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.3_4
    • /
    • pp.541-553
    • /
    • 2012
  • In this paper, we study some limit properties of the harmonic mean of random transition probability for a second-order nonhomogeneous Markov chain on the generalized gambling system indexed by a tree by constructing a nonnegative martingale. As corollary, we obtain the property of the harmonic mean and the arithmetic mean of random transition probability for a second-order nonhomogeneous Markov chain indexed by a double root tree.

MAGNETIC RESONANCE ELECTRICAL IMPEDANCE TOMOGRAPHY

  • Kwon, Oh-In;Seo, Jin-Keun;Woo, Eung-Je;Yoon, Jeong-Rock
    • Communications of the Korean Mathematical Society
    • /
    • v.16 no.3
    • /
    • pp.519-541
    • /
    • 2001
  • Magnetic Resonance Electrical Impedance Tomography(MREIT) is a new medical imaging technique for the cross-sectional conductivity distribution of a human body using both EIT(Electrical Impedance Tomography) and MRI(Magnetic Resonance Imaging) system. MREIT system was designed to enhance EIT imaging system which has inherent low sensitivity of boundary measurements to any changes of internal tissue conductivity values. MREIT utilizes a recent CDI (Current Density Imaging) technique of measuring the internal current density by means of MRI technique. In this paper, a mathematical modeling for MREIT and image reconstruction method called the alternating J-substitution algorithm are presented. Computer simulations show that the alternating J-substitution algorithm provides accurate high-resolution conductivity images.

  • PDF

NONSELECTIVE HARVESTING OF A PREY-PREDATOR COMMUNITY WITH INFECTED PREY

  • Chattopadhyay, J.;Ghosal, G.;Chaudhuri, K.S.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.3
    • /
    • pp.835-850
    • /
    • 1999
  • The present paper deals with the problem of nonselective harvesting in a partly infected prey and predator system in which both the susceptible prey and the predator follow the law of logistic growth and some preys avoid predation by hiding. The dynamical behaviour of the system has been studied in both the local and global sense. The optimal policy of exploitation has been derived by using Pontraygin's maximal principle. Numerical analysis and computer simulation of the results have been performed to investigate the golbal properties of the system.

Solving the Travelling Salesman Problem Using an Ant Colony System Algorithm

  • Zakir Hussain Ahmed;Majid Yousefikhoshbakht;Abdul Khader Jilani Saudagar;Shakir Khan
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.2
    • /
    • pp.55-64
    • /
    • 2023
  • The travelling salesman problem (TSP) is an important combinatorial optimization problem that is used in several engineering science branches and has drawn interest to several researchers and scientists. In this problem, a salesman from an arbitrary node, called the warehouse, starts moving and returns to the warehouse after visiting n clients, given that each client is visited only once. The objective in this problem is to find the route with the least cost to the salesman. In this study, a meta-based ant colony system algorithm (ACSA) is suggested to find solution to the TSP that does not use local pheromone update. This algorithm uses the global pheromone update and new heuristic information. Further, pheromone evaporation coefficients are used in search space of the problem as diversification. This modification allows the algorithm to escape local optimization points as much as possible. In addition, 3-opt local search is used as an intensification mechanism for more quality. The effectiveness of the suggested algorithm is assessed on a several standard problem instances. The results show the power of the suggested algorithm which could find quality solutions with a small gap, between obtained solution and optimal solution, of 1%. Additionally, the results in contrast with other algorithms show the appropriate quality of competitiveness of our proposed ACSA.

Hilbert's Program as Research Program (연구 프로그램으로서의 힐버트 계획)

  • Cheong, Kye-Seop
    • Journal for History of Mathematics
    • /
    • v.24 no.3
    • /
    • pp.37-58
    • /
    • 2011
  • The development of recent Mathematical Logic is mostly originated in Hilbert's Proof Theory. The purpose of the plan so called Hilbert's Program lies in the formalization of mathematics by formal axiomatic method, rescuing classical mathematics by means of verifying completeness and consistency of the formal system and solidifying the foundations of mathematics. In 1931, the completeness encounters crisis by the existence of undecidable proposition through the 1st Theorem of G?del, and the establishment of consistency faces a risk of invalidation by the 2nd Theorem. However, relative of partial realization of Hilbert's Program still exists as a fruitful research program. We have tried to bring into relief through Curry-Howard Correspondence the fact that Hilbert's program serves as source of power for the growth of mathematical constructivism today. That proof in natural deduction is in truth equivalent to computer program has allowed the formalization of mathematics to be seen in new light. In other words, Hilbert's program conforms best to the concept of algorithm, the central idea in computer science.

On the Feasibility of Interference Alignment in the Cellular Network

  • Chen, Hua;Wu, Shan;Hu, Ping;Xu, Zhudi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5324-5337
    • /
    • 2017
  • In this paper, we investigate the feasibility of interference alignment(IA) in signal space in the scenario of multiple cell and multiple user cellular networks, as the feasibility issue is closely related to the solvability of a multivariate polynomial system, we give the mathematical analysis to support the constraint condition obtained from the polynomial equations with the tools of algebraic geometry, and a new distribute IA algorithm is also provided to verify the accessibility of the constraint condition for symmetric system in this paper. Simulation results illustrate that the accessibility of the constraint condition is hold if and only if the degree of freedom(DoF) of each user can be divided by both the transmit and receive antenna numbers.

THE $L_2$ NORM OF B$\acute{E}$ZIER CURVES

  • BYUNG-GOOK LEE
    • Journal of applied mathematics & informatics
    • /
    • v.3 no.2
    • /
    • pp.245-252
    • /
    • 1996
  • We described a relationship of the $L_2$ norm of the $L_2$norm of a Bzier curve and l2 norm of its confrol points. The use of Bezier curves finds much application in the general description of curves and surfaces and provided the mathematical basis for many computer graphics system. We define the $L_2$ norm for Bezier curves and find a upper and lower bound for many computer graphics system. We define the $L_2$ norm for Bezier curves and find a upper and lower bound for the $L_2$ norm with respect to the $L_2$ norm for its control points for easy computation.

The TOR Data Communication System

  • Haraty, Ramzi A.;Zantout, Bassam
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.415-420
    • /
    • 2014
  • Since the day the Internet became a common and reliable mechanism for communication and data transfer, security officers and enthusiasts rallied to enforce security standards on data transported over the globe. Whenever a user tries communicating with another recipient on the Internet, vital information is sent over different networks until the information is dropped, intercepted, or normally reaches the recipient. Critical information traversing networks is usually encrypted. In order to conceal the sender's identity, different implementations have proven successful - one of which is the invention of anonymous networks. This paper thoroughly investigates one of the most common and existing techniques used during data communication for avoiding traffic analysis as well as assuring data integrity - the onion router (TOR). The paper also scrupulously presents the benefits and drawbacks of TOR.

MOBILE LEARNING SYSTEM FOR NUMERICAL ANALYSIS BY USING PHP

  • KIM, SANG-BAE
    • Journal of applied mathematics & informatics
    • /
    • v.37 no.1_2
    • /
    • pp.157-162
    • /
    • 2019
  • Programming tools are essential for students learning numerical analysis. It is troublesome to go to a laboratory where a computer is located after taking a lecture. Nowadays most students have mobile phones which can be used for programming practice through the Internet. PHP is a server-side scripting language designed for web development but also used as a general-purpose programming language. However, PHP has many inconveniences, such as adding a dollar symbol ($) to every varable. This paper introduces a slightly modified language, NAPHP, and a system which is designed for students to use their own mobile phone to write down the language NAPHP and run it on the web page. The system NAPHP-SYS is an educational tool that turns NAPHP into PHP, run PHP code and show the results on the web.

Diagramming for Individualized Learning Process Based on Assessment in Mathematics Education (수학교육에서 평가결과에 기초한 개별화 학습과정의 위계도)

  • 변두원;정인철;박달원;노영순;김승동
    • The Mathematical Education
    • /
    • v.43 no.1
    • /
    • pp.70-85
    • /
    • 2004
  • Comparing to the other subject, hierarchy among mathematical contents is strong from the perspective of knowledge order as grades go up. That is, the knowledge that students already have learned, are learning and will learn are closed related from grade to grade. We expect students to be proactive and creative in studying mathematics, which is the goal of 21th century, analyzing their. knowledge structure based on the hierarchy of knowledge through assessment. Especially, using computer system we provide students with substantial feedback for the assessment as well as objective validity is increased along with speedy and exact process in a bid to help students' mathematical understanding grow. This paper seeks to analyze the assessment data by applying knowledge spaces to computer system and develops efficient methods based on the analyzed results, to diagram each student's knowledge structure.

  • PDF