Philippine Computing Journal
- Philippines : Computing Society of the Philippines, c2014.
- 36 pages : illustrations ; 29 cm.
- Philippine Computing Journal, Volume 9, Issue 2, December 2014 .
Includes bibliographical references.
An Algorithm for Propagating Graceful Trees Using the Adjacency Matrix of Given Graceful Trees -- System of Automata Recognizing Languages -- On Communication Complexity of Some Hard Problems in ECPe Systems with Priority -- Some Heuristics for the 2-Poset Cover Problem -- Solving the Optimal Three-stage Periodic Inventory Policy Using an Algorithm Coded in C#.
[Article Title: An Algorithm for Propagating Graceful Trees Using the Adjacency Matrix of Given Graceful Trees/ Marjo-Anne B. Acob and Jean O. Loyola, p. 1-5]
Abstract: A treeTonn+1 vertices is said to be graceful if its vertices can be labeled using all of the integers 0,1, . . . , n such that the edge weights will run from 1 through n, and where the weight of an edge equals the absolute value of the difference of the numbers assigned to its vertices. In this paper, we develop an algorithm that uses the adjacency matrices of known graceful trees to propagate new graceful trees through duplication of arbitrary graceful trees and joining them by additional edges. The algorithm developed facilitates faster generation of families of graceful trees, the study of which is one of the current directions in establishing the graceful tree conjecture. https://pcj.csp.org.ph/index.php/pcj/issue/view/19/PCJ%20V9%20N2%20pp1-5%202014 [Article Title: System of Automata Recognizing Languages/ Kelvin Cui Buño, p. 6-13]
Abstract : This paper looks into on the results of ̆Cermák on the Multi accepting Automata Systems[1, 2]. This automata system was inspired and is an automata counterpart of the Multi-generative Grammar Systems introduced by Meduna and Lukas[6]. The results show that the Multi accepting Automata System and Multi generative Grammar System is equivalent. In this paper, we show an alternate proof for showing equivalence between the two formal systems from the one given in. https://pcj.csp.org.ph/index.php/pcj/issue/view/19/PCJ%20V9%20N2%20pp6-13%202014 [Article Title: On Communication Complexity of Some Hard Problems in ECPe Systems with Priority/ Sherlyne L. Francia, Denise Alyssa A. Francisco, Richelle Ann B. Juayong, and Henry N. Adorna, p. 14-25]
Abstract: In this paper, the Vertex Cover Problem and 3-Satisfiability Problem are non-confluently decided using Evolution Communication P systems with Energy (ECPe) that impose priority on either evolution or communication. Additionally, the communication resources, i.e. number of communication steps, communication rules and energy objects, used in each system is analyzed. It is then shown through comparison that the ECPe systems that put priority on evolution utilize the greatest amount of resources. Those that put priority on communication, however, not only use the least amount of resources but also employ the least amount of membranes. https://pcj.csp.org.ph/index.php/pcj/issue/view/19/PCJ%20V9%20N2%20pp14-25%202014 [Article Title: Some Heuristics for the 2-Poset Cover Problem/ Gabriel Alberto A. Sanchez, Proceso L. Fernandez, and John Paul C. Vergara, p. 26-32]
Abstract: Posets are abstract models that may be considered as generating a set of linear orders, which are permutations on some base set. The problem of determining a minimum set of posets that can exactly generate a specified input set of linear orders is referred to as the Poset Cover Problem, and this problem is NP-Hard in the general case. In this study, we investigate a constrained version of the problem, the 2-Poset Cover Problem, where there are exactly 2 posets that can generate a given input. We develop some heuristics for this and examine some properties related to the problem. Our heuristics are able to provide the correct solutions for a significant majority of the tested random instances. From the instances where the heuristics have failed, some insights were derived which may be helpful in determining the correct complexity class to which the 2-Poset Cover Problem belongs. https://pcj.csp.org.ph/index.php/pcj/issue/view/19/PCJ%20V9%20N2%20pp26-32%202014 [Article Title: Solving the Optimal Three-stage Periodic Inventory PolicyUsing an Algorithm Coded inC!/ Baltazar P. Villacrusis and Marrick C. Neri, p. 33-37]
Abstract :In this paper we study a three-stage inventory system to come up with an optimal periodic inventory policy. We formulate a general and specific model on a three-stage serial inventory system for a single-item considering stochastic demand. To solve the model, we come up with an algorithm that can be easily implemented using C!as a programming language. With this algorithm, we create a user-friendly software so that even layman people can use it in their business. We observe validity of the formulated model and the effectiveness of the algorithm by generating and analyzing numerical results. https://pcj.csp.org.ph/index.php/pcj/issue/view/19/PCJ%20V9%20N2%20pp33-37%202014