Methods and Tools for Visualization of Graphs and Graph Algorithms

Graphs are the most common abstract structure encountered in computer science and are widely used for structural information visualization. In the paper, we consider practical and general graph formalism of so called hierarchical graphs and present the Higres and ALVIS systems aimed at supporting of structural information visualization on the base of hierarchical graph models.

Ferrocement as a Retrofitting Material for Beam Column Joint

Structure safety is of utmost importance in modern days. Now- a- days ferrocement is gaining popularity as a retrofitting material due to ease of its application and availability. The most critical location of failure in any structure is beam column joint. The aim of this paper is to analyse the effect of retrofitting on beam column joint using ferrocement as a retrofitting material. Square wire mesh and triangular wire mesh was used for retrofitting beam column joint. Beam column joint is designed using ductile detailing code IS 13930:2016. Axial and reverse cyclic displacement load is applied on the specimen. Further unstrengthen and strengthened specimen were analysed using ANSYS software. A comparative study was done and it was concluded that after retrofitting, the specimen shows considerable decrease in total deformation. It shows that retrofitted beam column joint was more stable than the unstrengthened beam column joint. So, to increase the serviceability of any structure it is recommended to retrofit the structure. Keywords: BCJ, ferrocement, wire mesh, retrofitting

STRUKTUR DAN NILAI PENDIDIKAN DALAM LEGENDA ASAL MULA NAMA PULANG PISAU (STRUCTURE AND EDUCATIONAL VALUES CONTAINED IN THE LEGEND OF ASAL MULA NAMA PULANG PISAU)

Structure and Educational Values Contained in the legend of Asal Mula Nama Pulang Pisau. The research is aimed to describe (1) The structure of The Legend of Asal Usul Nama Pulang Pisau (The Origin of The Name Pulang Pisau) and (2) The educational values contained in The Legend of Asal Usul Nama Pulang Pisau. This research applied a qualitative approach and descriptive method. The data of The Legend of Asal Usul Nama Pulang Pisau were obtained through interviews with informants. Based on the analysis of the structure of the legend and the educational values, the description of the intrinsic elements is obtained, such as themes, plot, characters, settings, mandates, values of moral education, religion, heroism, history, and customs / traditions which contained in The Legend of Asal Usul Nama Pulang Pisau. The conclusions of this research are: The Legend of Asal Usul Nama Pulang Pisau conveys the theme of the origin of place names, uses chronological plot, does not mentions too many characters and names of characters, the place sets along the rivers and in the forest, the time setting is in the Asang era, and delivers the message of cooperation and mutual respect. The Legend of Asal Usul Nama Pulang Pisau contains several values such as moral education of being careful in making decisions, traditional education of nomadic traditions and mutual cooperation, religious education which takes form in the rituals, the historical education which can be seen in the distribution of the indigenous Dayak Ngaju community, and the value of heroism and perseverance which is reflected in the character’s attitude. Key words: legendary, structure, education values, ngaju Abstrak Struktur dan Nilai Pendidikan dalam Legenda Asal Mula Nama Pulang Pisau. Penelitian bertujuan mendeskripsikan (1) Struktur Legenda Asal Mula Nama Pulang Pisau, dan (2) nilai-nilai pendidikan yang terkandung dalam Legenda Asal Mula Nama Pulang Pisau. Metode penelitian pada penelitian ini, yaitu penelitian kualitatif dan menggunakan metode deskriptif dari sumber data Legenda Asal Mula Nama Pulang Pisau yang diperoleh melalui hasil wawancara dengan informan/narasumber. Berdasarkan analisis struktur cerita dan nilai pendidikan, maka diperoleh deskripsi unsur intrinsik, seperti tema, alur, tokoh, latar, amanat, nilai-nilai pendidikan moral, agama, kepahlawanan, sejarah, dan adat/tradisi yang terkandung dalam Legenda Asal Mula Nama Pulang Pisau. Kesimpulan dalam penelitian ini yaitu: Legenda Asal Mula Nama Pulang Pisau mengusung tema asal usul nama tempat, menggunakan alur maju, tidak terlalu banyak menyebutkan tokoh dan nama tokoh, berlatar tempat di sekitar aliran sungai dan hutan, berlatar waktu di zaman Asang, menyematkan amanat gotong Jurnal Bahasa, Sastra dan Pembelajarannya Vol 11, No 2, Oktober 2021 ISSN 2089-0117 (Print) Page 262 - 274 ISSN 2580-5932 (Online) Rambe, / Jurnal Bahasa, Sastra dan Pembelajarannya 11 (2) 2021, 262-274 Jurnal Bahasa, Sastra dan Pembelajarannya ǀ 263 royong dan hormat-menghormati. Mengandung nilai pendidikan moral tidak gegabah dalam mengambil keputusan, nilai pendidikan adat/tradisi nomaden dan gotong royong, nilai pendidikan agama berupa ritual, nilai pendidikan sejarah persebaran masyarakat adat Dayak Ngaju, dan nilai pendidikan kepahlawanan pantang menyerah yang tercermin dari sikap para tokoh. Kata-kata kunci: legenda, struktur, nilai pendidikan, ngaju

Fixed Points of Proinov E-Contractions

In this paper, we consider a new type of Proinov contraction on the setting of a symmetrical abstract structure, more precisely, the metric space. Our goal is to expand on some results from the literature using admissible mappings and the concept of E-contraction. The considered examples indicate the validity of the obtained results.

Consideration of Docker based network deployment for a data center: GSDC in Korea

For various operational reasons, this study presents a design and testbed environment for applying Docker-based system to a data center in Korea. We describe the design process of Docker based network. First, abstract structure is presented. Second, two conceptual routing models are provided. Third, the network plugin selection is stated. Then, we build Docker based system on a testbed environment as a pre-study for deployment to the entire system. There are plenty of factors to consider for the overall deployment. Representative factors include the routing method inside the server, the number of containers in a server, service arrangement by container, and response to equipment replacement. To evaluate those factors, various study should be performed with key system parameters. The proposed testbed environment can be utilized to obtain key system parameters. Applying Docker system to a data center can be remarkably efficient in terms of operations. The workload of operator will decrease, and scalability and flexibility will increase.

From Data Processing to Knowledge Processing: Working with Operational Schemas by Autopoietic Machines

Knowledge processing is an important feature of intelligence in general and artificial intelligence in particular. To develop computing systems working with knowledge, it is necessary to elaborate the means of working with knowledge representations (as opposed to data), because knowledge is an abstract structure. There are different forms of knowledge representations derived from data. One of the basic forms is called a schema, which can belong to one of three classes: operational, descriptive, and representation schemas. The goal of this paper is the development of theoretical and practical tools for processing operational schemas. To achieve this goal, we use schema representations elaborated in the mathematical theory of schemas and use structural machines as a powerful theoretical tool for modeling parallel and concurrent computational processes. We describe the schema of autopoietic machines as physical realizations of structural machines. An autopoietic machine is a technical system capable of regenerating, reproducing, and maintaining itself by production, transformation, and destruction of its components and the networks of processes downstream contained in them. We present the theory and practice of designing and implementing autopoietic machines as information processing structures integrating both symbolic computing and neural networks. Autopoietic machines use knowledge structures containing the behavioral evolution of the system and its interactions with the environment to maintain stability by counteracting fluctuations.

Computational Abstraction

Representation and abstraction are two of the fundamental concepts of computer science. Together they enable “high-level” programming: without abstraction programming would be tied to machine code; without a machine representation, it would be a pure mathematical exercise. Representation begins with an abstract structure and seeks to find a more concrete one. Abstraction does the reverse: it starts with concrete structures and abstracts away. While formal accounts of representation are easy to find, abstraction is a different matter. In this paper, we provide an analysis of data abstraction based upon some contemporary work in the philosophy of mathematics. The paper contains a mathematical account of how Frege’s approach to abstraction may be interpreted, modified, extended and imported into type theory. We argue that representation and abstraction, while mathematical siblings, are philosophically quite different. A case of special interest concerns the abstract/physical interface which houses both the physical representation of abstract structures and the abstraction of physical systems.

From Data Processing to Knowledge Processing: Operation with Schemas in Autopoietic Machines

Knowledge processing is an important feature of intelligence in general and artificial intelligence in particular. To develop computing systems working with knowledge, it is necessary to elaborate means of working with knowledge representations (as opposed to data) because knowledge is an abstract structure. There are different forms of knowledge representations derived from data. One of the basic forms is called a schema. The goal of this paper is the development of theoretical and practical tools for processing schemas. To achieve this goal, we use schema representations elaborated in the mathematical theory of schemas and use structural machine as a powerful theoretical tool for modeling parallel and concurrent computational processes. We describe the schema of autopoietic machines as physical realizations of structural machines. An autopoietic Machine is a technical system capable of regenerating, reproducing and maintaining itself by production, transformation and destruction of its components and the networks of processes downstream contained in them. We present the theory and practice of designing and implementing autopoietic machines as information processing structures integrating both symbolic computing and neural networks. Autopoietic machines use knowledge structures containing the behavioral evolution of the system and its interactions with the environment to maintain stability by counteracting fluctuations.

Reconstructing linearly embedded graphs: A first step to stratified space learning

<p style='text-indent:20px;'>In this paper, we consider the simplest class of stratified spaces – linearly embedded graphs. We present an algorithm that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled from it. We use tools and inspiration from computational geometry, algebraic topology, and topological data analysis and prove the correctness of the identified abstract structure under assumptions on the embedding. The algorithm is implemented in the Julia package Skyler, which we used for the numerical simulations in this paper.</p>

A one-shot learning signal in monkey prefrontal cortex

Much animal learning is slow, with cumulative changes in behavior driven by reward prediction errors. When the abstract structure of a problem is known, however, both animals and formal learning models can rapidly attach new items to their roles within this structure, sometimes in a single trial. Frontal cortex is likely to play a key role in this process. To examine information seeking and use in a known problem structure, we trained monkeys in a novel explore/exploit task, requiring the animal first to test objects for their association with reward, then, once rewarded objects were found, to re-select them on further trials for further rewards. Many cells in the frontal cortex showed an explore/exploit preference, changing activity in a signal trial to align with one-shot learning in the monkeys’ behaviour. In contrast to this binary switch, these cells showed little evidence of continuous changes linked to expectancy or prediction error. Explore/exploit preferences were independent for two stages of the trial, object selection and receipt of feedback. Within an established task structure, frontal activity may control the separate operations of explore and exploit, switching in one trial between the two.Significance statementMuch animal learning is slow, with cumulative changes in behavior driven by reward prediction errors. When the abstract structure a problem is known, however, both animals and formal learning models can rapidly attach new items to their roles within this structure. To address transitions in neural activity during one-shot learning, we trained monkeys in an explore/exploit task using familiar objects and a highly familiar task structure. In contrast to continuous changes reflecting expectancy or prediction error, frontal neurons showed a binary, one-shot switch between explore and exploit. Within an established task structure, frontal activity may control the separate operations of exploring alternative objects to establish their current role, then exploiting this knowledge for further reward.