Object-oriented description of graph data structures

2007 ◽  
Vol 33 (5) ◽  
pp. 261-271 ◽  
Author(s):  
A. V. Demakov
Keyword(s):  
Data Structures ◽  
Object Oriented ◽  
Graph Data

Type-based confinement

2005 ◽  
Vol 16 (1) ◽  
pp. 83-128 ◽  
Author(s):  
TIAN ZHAO ◽  
JENS PALSBERG ◽  
JAN VITEK
Keyword(s):  
Data Structures ◽  
Type System ◽  
Object Oriented ◽  
Point Of View ◽  
Generic Extension ◽  
Practical Point ◽  
Related Research ◽  
Language Based Security ◽  
Object Graphs ◽  
Object Oriented Systems

Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for building secure object-oriented systems as security requires that the interface between trusted and untrusted components of a system be clearly delineated and restricted to the smallest possible set of operations and data structures. This paper investigates the notion of package-level confinement and proposes a type system that enforces this notion for a call-by-value object calculus as well as a generic extension thereof. We give a proof of soundness of this type system, and establish links between this work and related research in language-based security.

Description Mirror Features and Data Structures in an Optical CAD System

2014 ◽  
Vol 513-517 ◽  
pp. 796-799
Author(s):  
Jun Hai Jiang ◽  
Xiao Hui Yang
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Optical System ◽  
Simple Structure ◽  
Optical Design ◽  
Object Oriented ◽  
Optical Lens ◽  
Cad System ◽  
System Components ◽  
Object Oriented Methods

CAD is presented in optical design, the use of object-oriented methods, optical lens structure described. Using object-oriented techniques to describe the object lens, and with VC++ language features to build such systems, construct a data structure of the optical system components. This method has a simple structure, portability, reusability of characteristics.

scholarly journals Identifying Influential Spreaders in a Social Network (While Preserving Privacy)

2020 ◽  
Vol 2020 (2) ◽  
pp. 537-557 ◽  
Author(s):  
Varsha Bhat Kukkala ◽  
S.R.S Iyengar
Keyword(s):  
Social Network ◽  
Data Structures ◽  
Private Information ◽  
Traditional Approach ◽  
Ranking Methods ◽  
Graph Data ◽  
Oblivious Ram ◽  
Underlying Graph ◽  
Efficient Data ◽  
Pagerank Centrality

AbstractIn order to disseminate information in a social network, it is important to first identify the influential spreaders in the network. Using them as the seed spreaders, the aim is to ensure that the information is cascaded throughout the network. The traditional approach to identifying influential nodes is to determine the top-r ranked nodes in accordance with various ranking methods such as PageRank, k-Shell decomposition, ClusterRank and VoteRank. In the current work, we study the problem of ranking the nodes when the underlying graph is distributedly held by a set of individuals, who consider their share of the data as private information. In particular, we design efficient secure multiparty computation (MPC) protocols for k-Shell decomposition, PageRank and VoteRank. For improved efficiency, we employ the oblivious RAM construct in conjunction with efficient data-oblivious graph data structures. We are the first to propose a secure variant of the VoteRank algorithm. We prove that the proposed protocols are asymptotically more efficient and have lower runtime in practice than the previous best known MPC protocols for computing k-Shell decomposition and PageRank centrality scores.

scholarly journals A Modal Proof Theory for Polynomial Coalgebras

2021 ◽  
Author(s):  
◽  
David Friggens
Keyword(s):  
Modal Logic ◽  
Computer Science ◽  
Programming Languages ◽  
Data Structures ◽  
Proof Theory ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Algebraic Methods ◽  
Mathematical Structures ◽  
Finite Constant

<p>The abstract mathematical structures known as coalgebras are of increasing interest in computer science for their use in modelling certain types of data structures and programs. Traditional algebraic methods describe objects in terms of their construction, whilst coalgebraic methods describe objects in terms of their decomposition, or observational behaviour. The latter techniques are particularly useful for modelling infinite data structures and providing semantics for object-oriented programming languages, such as Java. There have been many different logics developed for reasoning about coalgebras of particular functors, most involving modal logic. We define a modal logic for coalgebras of polynomial functors, extending Rößiger’s logic [33], whose proof theory was limited to using finite constant sets, by adding an operator from Goldblatt [11]. From the semantics we define a canonical coalgebra that provides a natural construction of a final coalgebra for the relevant functor. We then give an infinitary axiomatization and syntactic proof relation that is sound and complete for functors constructed from countable constant sets.</p>

scholarly journals Rekayasa Pembalikan Kode Berorientasi Objek ke Desain Kelas Menggunakan Struktur Data Graf

2010 ◽  
Vol 1 (2) ◽  
Author(s):  
Paulus Mudjihartono ◽  
Findra Kartika Sari Dewi
Keyword(s):  
Reverse Engineering ◽  
System Analysis ◽  
System Development ◽  
Object Oriented ◽  
Input File ◽  
Graph Data ◽  
Code Converter ◽  
Class Diagrams ◽  
Software Code ◽  
Analysis System

 Abstract. Reverse Engineering of Object Oriented Code to Class Design Using Graph Data Structure. This time the software engineering methodology still follows the process of standard system development consisting of four phases of the system initialization, system analysis, system design, and system implementation. The phases occur sequentially so that the implementation is always done after the design is complete. This research is developing software Code Converter (COCON) to automate the conversion of object-oriented code to class design using graph data structures. COCON only requires an object-oriented code file as input and produce results in the form of a file containing a list of classes and relations between classes that read from input file. COCON help users to find out the class design of object-oriented code and becomes the basis for drawing class diagrams of object-oriented code. Keywords: reverse engineering, class design, relation, OOP, graph Abstrak. Pada saat ini metodologi rekayasa perangkat lunak masih mengikuti proses pengembangan sistem yang standar yang terdiri dari empat fase yakni inisialisasi sistem, analisis sistem, desain sistem dan implementasi sistem. Keempat fase tersebut terjadi secara berurutan sehingga fase implementasi selalu dilakukan setelah fase desain selesai. Penelitian ini membangun perangkat lunak Code Converter (COCON) yang berfungsi untuk mengotomasi konversi kode program berorientasi objek ke desain kelas dengan struktur data graf. COCON hanya membutuhkan sebuah berkas kode program berorientasi objek sebagai masukan dan memberikan hasil berupa sebuah berkas yang berisi daftar kelas dan relasi antar kelas yang dibaca dari berkas masukan. COCON membantu pengguna untuk mengetahui desain kelas dari kode program berorientasi objek dan menjadi dasar dalam  penggambaran diagram kelas dari kode berorientasi objek. Kata Kunci: rekayasa pembalikan, desain kelas, relasi, PBO, graf

Sign in / Sign up

Export Citation Format

Share Document