• Journal of Practical Engineering Education
• /
• v.15 no.2
• /
• pp.331-339
• /
• 2023

In programming classes, there is always a need to efficiently manage programming assignments. This is especially important as class sizes and assignment complexity grows. GitHub and GitHub Classroom makes the management of student assignments much simpler than uploading files and folders to a LMS or shared online drive. Additionally, git and GitHub are industry standard tools, so introducing students these tools in class provides them a good opportunity to start learning about how software is developed in the real-world. This study describes a workflow that uses both GitHub Pages and GitHub Classroom for more efficient classroom and assignment management. The workflow outlined in this study was used in two practical web programming classes in Spring 2023 with 46 third and fourth-year university students. GitHub Pages was used as a classroom website to distribute class announcements, assignments, lecture slides, study guides, and exams. GitHub Classroom was used as a class roster and assignment management platform. The workflow presented in this study is expected to assist other lecturers with the formidable tasks of distributing, collecting, grading, and leaving feedback on multiple students' multi-file programming assignments in practical programming classes.

• Asia pacific journal of information systems
• /
• v.1 no.1
• /
• pp.49-62
• /
• 1991

This paper examines the problems of database partitioning and file allocation in a fixed topology distributed computer network. The design objective is to make files as collections of attributes and to allocate these files to network nodes so that a minimum total transmission cost is achieved subject to storage capacity constraints. A mathematical model for solving the problem is formulated and, the resulting optimization problem is shown to fall in a class of NP-complete problems. A new heuristic algorithm is developed which uses the idea of allocating attributes according to the transaction requirements at each computer node and then making files using the allocated attributes. Numerical results indicate that the heuristic algorithm yields practicable low cost solutions in comparison with the existing methods which deal with the file allocation problems and database partitioning problems independently.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2020.06a
• /
• pp.21-22
• /
• 2020

In this study, the pile filling materials of the pile in drilled piling was studied. cement milk is mostly used as the filling materials of bored pile. The use of filling material based on cement milk is inefficient at field construction because it needs a lot of the charging mass. thickening agent was added to the cement milk to perform settlement estimation experiment on a circular cylinder, and as a result of examining the compressive strength of the day, it was found that the settlement estimation was significantly reduced. However, the strength was relatively low, it was confirmed that there was no problem with the regulation because the main surface fixative required relatively low strength.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2298-2309
• /
• 2000

This paper proposes the multidimensioa! nested attribute indexing techniques (MD- NAI) in object-oriented databases using a multidimensional index structure. Since most conventional indexing techniques for object oriented databases use a one-dimensional index stnlcture such as the B-tree, they do not often handle complex qUlTies involving both nested attributes and class hierarchies. We extend a tunable two dimensional class hierachy indexing technique(2D-CHI) for nested attributes. The 2D-CHI is an indexing scheme that deals with the problem of clustering ohjects in a two dimensional domain space that consists of a kev attribute dOI11'lin and a class idmtifier domain for a simple attribute in a class hierachy. In our extended scheme, we construct indexes using multidimensional file organizations that include one class identifier domain per class hierarchy on a path expression that defines the indexed nested attribute. This scheme efficiently suppoI1s queries that involve search conditions on the nested attribute represcnted by an extcnded path expression. An extended path expression is a one in which a class hierarchy can be substituted by an indivisual class or a subclass hierarchy in the class hierarchy.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.4 s.304
• /
• pp.11-16
• /
• 2005

Class area is a portion of memory where the constants, fields, and codes of the classes loaded into the Java virtual machine are kept. Knowing the size of the class area is very important especially for embedded Java system with limited memory resources. This paper induces a formula which makes it possible estimate the size of the area. The formula needs some constant values specific to target JVM implementation. We also show that these values can be found using some simple probe classes. An experimental result is included in this paper to confirm the correctness of our approach.

• Journal of Software Assessment and Valuation
• /
• v.10 no.1
• /
• pp.19-26
• /
• 2014

In this paper, we propose a method for protecting Android applications against reverse engineering attacks. In this method, the server encrypts the original executable code (DEX) included in an APK file, inserts into the APK file a stub code that decrypts the encrypted DEX later at run-time, and distributes the modified APK file. The stub code includes an integrity validation code to detect attacks on itself. When a user installs and executes the APK file, the stub code verifies the integrity of itself, decrypts the encrypted DEX, and loads it dynamically to execute. Since the original DEX is distributed as an encrypted one, we can effectively protect the intellectual property. Further, by verifying the integrity of the stub code, we can prevent malicious users from bypassing our method. We applied the method to 15 Android apps, and evaluated its effectiveness. We confirmed that 13 out of them operates normally.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.153-154
• /
• 2010

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.262-264
• /
• 2003

자바 언어에 대한 클래스 파일은 소스 프로그램의 의미를 자바 가상 기계에서 실행가능한 형식으로 변환된 형태이다. 이러한 클래스 파일의 구조 및 실질적인 실행 과정에 대한 분석은 디컴파일러 구성, 소스프로그램의 디버깅 등에 편리성을 지원할 수 있다. 본 논문에서는 이러한 클래스 파일에 대한 분석 및 실제로 실행 과정을 보다 시각적으로 표현하기 위한 실행 과정 분석기에 관한 연구이다. 이를 위해 클래스파일을 내용을 GUI 환경에서와 같이 접근 및 표현이 용이하도록 구현하였으며 이러한 클래스 파일의 실행 과정에서 핵심 정보를 저장하고 있는 메소드 영역 정보, 오퍼란드 스택 정보, 지역 변수의 정보를 시각적으로 표현하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.467-470
• /
• 2003

한 개의 자바 프로그램은 다수 개의 클래스 파일로 구성된다. 자바 프로그램이 실행되기 위해서는 클래스 파일이 메모리에 적재되어져야 하는데, 본 논문에서는 개별 클래스들이 어느 정도의 메모리를 사용할지를 정적으로 예측할 수 있게 하는 방법에 대해 알아보았다. 본 논문의 관심은 클래스 영역의 메모리, 즉 정적 메모리에 맞추어져 있으며, 힙 영역의 메모리 등 동적 메모리에 대한 예측은 향후 연구로 남겨 두었다. 클래스를 이루는 필드와 메소드 등의 값들이 메모리 사용량에 미치는 영향을 수식으로 유도하였으며, 이 수식의 유효성을 실제 실험을 통해 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.332-334
• /
• 2000

본 논문에서는 자바 컴파일러에 의해 컴파일된 결과인 클래스파일을 효과적으로 분석할 수 있기 위한 비주얼 분석기의 구현에 대해 기술한다. 이 비주얼 분석기는 클래스파일의 모든 세부사항들을 시각적으로 표현하며 원하는 분석 결과를 저장할 수 있게 되어 프로그램의 이해 및 개발을 도와준다. 이 분석기의 구현에서 JDK1.3을 이용하였으며 화면구성은 JBuilder3.0을 사용한다.