• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.115.1-115
• /
• 2001

According as many people use a computer newly, damage of computer virus and hacking is rapidly increasing by the crucial users. A computer virus is one of program on computer and has abilities of self reproduction and destruction like a virus of biology. And hacking is to rob a person´s data in a intruded computer and to delete data in a person´s computer from the outside. To block hacking that is intrusion of a person´s computer and the computer virus that destroys data, a study for intrusion-detection of system and virus detection using a biological immune system is in progress. In this paper, we make a mood of positive selection and negative selection of self-recognition process that is ability of ...

• Spatial Information Research
• /
• v.7 no.1
• /
• pp.81-87
• /
• 1999

This paper describes the development of a data management system which manages the database on World Wide Web(WWW). It is the pa.0 of WISIF(Web-based geographic Information System for Irrigation Facilities) which is a prototype of an information management system for irrigation facilities. This system includes a web serve. and a RDBMS(Relational DataBase Management System). Netscape Enterprise Server 3.0 is used for a web server and for the latter, Oracle DBMS 7.3 for NT is used for a RDBMS. Users can cornet the database through a web browser, such as Netscape Communicator, to insert, update, delete and search data they want

• Spatial Information Research
• /
• v.5 no.1
• /
• pp.1-10
• /
• 1997

In this paper, we classify existing spatial indexing schemes for spatial objects in geographic database systems into seven classes. Also, we propose a new spatial indexing scheme called MAX(Multi-Attribute indeXing scheme). The search, insert, delete algorithms for the proposed indexmg scheme are described in detail. It is expected that the performance of the proposed indexing scheme is better than the existing indexing schemes under the some conditions. The proposed indexing scheme, MAX, can be easily implemented on existing built-in B-trees in most storage managers in the sense tha.t the structure of MAX is like that of B-tree.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.9 no.2
• /
• pp.67-72
• /
• 1989

In nuclear power plants, nondestructive examinations(NDE) plays an important role in ensuring the integrity and reliability operation. As the number of plants and operational time increased, manual handling of voluminous data associated with PSI/ISI(preservice/inservice inspection) could result in many errors or mistakes in writing the examination plan or other reports. Several new approaches to process the data have been attempted and DBMS(Data Base Management System) has been well known concept with a faster and more accurate data processing. This paper proposes an application program, called NDTSYS designed with DBMS in micro computer. The program could be used for a tool to add new records to a data base, change existing records, delete records and request reports with the data base. It would be helpful to the user who manage the PSI/ISI data with minimal time and effort.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.3-5
• /
• 2006

Recent advances in the internet infrastructure have resulted in a large number of huge Web sites and portals worldwide. These Web sites are being visited by various types of users in many different ways. Among all the web page access sequences from different users, some of them occur so frequently that may need an attention from those who are interested. We call them frequent access patterns and access sequences that can be frequent the candidate patterns. Since these candidate patterns play an important role in the incremental Web mining, it is important to efficiently generate, add, delete, and search for them. This thesis presents a novel tree structure that can efficiently store the candidate patterns and a related set of algorithms for generating the tree structure adding new patterns, deleting unnecessary patterns, and searching for the needed ones. The proposed tree structure has a kind of the 3 dimensional link structure and its nodes are layered.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.267-269
• /
• 2006

Recently, flash memories are one of best media to support portable computer's storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional Indexing scheme such as B-Tree due to the relatively slow characteristics of flash operation as compared to RAM memory. In order to achieve this goal, we devise a new indexing scheme called F-Tree. F-Tree improves tree operation performance by compressing pointers and keys in tree nodes and rewriting the nodes without a slow erase operation in node insert/delete processes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.155-164
• /
• 2000

Recently Fiber-optic Micro-cellular Wireless Network is considered to solve frequent handoffs and local traffic unbalance in microcellular systems. In this system, central station which is connected to several microcells by optical fiber manages the channels. We propose an efficient sectorization algorithm which dynamically clusters the microcells to minimize the blocked and handoff calls and to balance the traffic loads in each cell. The problem is formulated as an integer linear programming. The objective is to minimize the blocked and handoff calls. To solve this real time sectorization problem the Tabu Search is considered. In the tabu search intensification by Swap and Delete-then-Add (DTA) moves is implemented by short-term memory embodied by two tabu lists. Diversification is considered to investigate proper microcells to change their sectors. Computational results show that the proposed algorithm is highly effective. The solution is almost near the optimal solution and the computation time of the search is considerably reduced compared to the optimal procedure.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.5
• /
• pp.947-955
• /
• 2013

Most of the enterprise information is stored in the database. Therefore, in order to investigate the company's criminal behavior, forensic analysis is important for the database and delete record is a need to develop recovery techniques. This paper is explained structure of the oracle database tablespace file and analyzed system tables that stored table information. Further, we suggests a method of recovery for deleted record in oracle tablespace.

• Journal of the Korean Society of Costume
• /
• v.20
• /
• pp.49-62
• /
• 1993

The purpose of this research was to utilize of Pattern Design System(P.D.S) by using AM-300 The conclusion were like these : 1. A coat of basic pattern was selected by design sketch. 2. The basic pattern was input into computer by digitizing. 3. The basic pattern was change into designed shape by using various skills. This system were enabled to draw straight lines, curves, delete lines, sections of lines, extend lines, cut pattern into sections, measure line or section reproduce whole pattern shape of section, rotate and mirror pattern and complete patterns. 4. Automatic grading of finished master pattern have been developed by creation and modification of grading rules of basic pattern. 5. Production pattern added seam allowance, not-ches was generated by P.D.S menu option. 6. Finished pattern design was plotted out 100% and 20% size by AM-300 Plotter. This results will be the basic materials to develop the CAD SYSTEM if some problems were improve. Furthermore, the utilization of P.D.S is expected to be developing in pattern making process.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.145-149
• /
• 1991

In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.