• Journal of Information Technology Services
• /
• v.13 no.4
• /
• pp.189-203
• /
• 2014

With the evolution of Internet technologies and the increasing variety of Internet devices, advertisements in various web services have also expanded. Interactive web services often go hand in hand with effective advertisements for a business model. We estimated statistical parameters of the interactive web server for service monitoring and advertisement-effect. In the web pages, we integrated the plugins of social networking services (SNSs) (e.g. Facebook, Twitter) and an advertisement scheme (e.g. Google AdSense) that regards social name-directory contents. Empirical data analysis and statistical results are presented with the implementation of estimations of parameters (e.g. utilization-level and serviceability) and advertisements in a social networking name-directory service (http://ktrip.net or http://한국.net). We found that estimated parameters were applicable to service monitoring of web-server as well as to synthesis of advertisement-effect in our social-web name-directory service.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.1
• /
• pp.39-42
• /
• 2009

In this paper an attempt for realizing a storage system which works as a part of human brain has been discussed. The system is expected to be able to coordinate with human brain. And current storage may have inherent problem due to an intrinsic attribute of storage, exclusiveness. Directory structure in it must be a source of confusion, if it used out side of the range of limitation. Adapting multidimensional annotation of file name extension and directory-less file system, a new storage system able to associate and coordinate with human brain may be available near future. This paper showed that the limitation of current storage system clearly exists, because of human brain limitation to memorize directory name.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.146-153
• /
• 2001

A new password authentication method Is proposed in this paper for the purpose of providing web page authors the convenience in deploying password-protected Web realms at a web server. According to this method. a web realm is mapped to a secret directory at the web server. in which access-controlled web pages are stored. A password is used to construct the name of the secret directory. A javaScript code is embedded in a sign-in web pageoutside the secret directory, which converts the user-entered password into the directory name and forms a complete URL pointing to an access-controlled web page inside the secret directory. Thus, only users knowing the password can compose a valid URL and retrieve the access-controlled web page. Using this method, web page authors can deploy password-protected web realms in a server-independent manner.

• Journal of Korean Library and Information Science Society
• /
• v.37 no.2
• /
• pp.255-272
• /
• 2006

This study was investigated to the geography services and geographical directories through Internet in order to develop a geographical directory. Research method was the examination of different type of geography services through internet and geographical directories on the Internet search engines. The results show principles for a geographical directory construction: use both geographical names and subject names on the initial directory screen, repeated use the names through directory hierarchy, locality use on bottom directory as a geographical name, and fit use of the number of directories.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.902-908
• /
• 2006

We propose a scheme for more efficient navigation in a hierarchical file system. In the proposed scheme, a program running in the background computes the degree of relationship between a current file and others, and builds a list of the most related files. The current relationship metric being used by the program is a linear combination of five parameters: the name, the directory path, the type, the created time, and the last accessed time of a file. A simulated annealing algorithm is used in order to determine the weighting factors of the parameters. A set of experiments were conducted in order to access the effectiveness of the proposed scheme.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.4
• /
• pp.69-79
• /
• 2015

This research proposes a modified data hiding method to hide data in a slack space of an NTFS index record. The existing data hiding method is for anti-forensics, which uses traces of file names of an index entry in an index record when files are deleted in a direcotry. The proposed method in this paper modifies the existing method to make non-admittable ASCII characters for a file name applicable. By improving the existing method, problems of a file creation error due to non-admittable characters are remedied; including the non-admittable 9 characters (i. e. slash /, colon :, greater than >, less than <, question mark ?, back slash ${\backslash}$, vertical bar |, semi-colon ;, esterisk * ), reserved file names(i. e. CON, PRN, AUX, NUL, COM1~COM9, LPT1~LPT9) and two non-admittable characters for an ending character of the file name(i. e. space and dot). Two results of the two message with non-admittable ASCII characters by keyboard inputs show the applicability of the proposed method.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.4
• /
• pp.327-337
• /
• 2015

This work provides new forensic techinque to a hide message on a directory index in Windows NTFS file system. Behavior characteristics of B-tree, which is apoted to manage an index entry, is utilized for hiding message in slack space of an index record. For hidden message not to be exposured, we use a disguised file in order not to be left in a file name attribute of a MFT entry. To understand of key idea of the proposed technique, we describe B-tree indexing method and the proposed of this work. We show the proposed technique is practical for anti-forensic usage with a real message hiding case using a developed software tool.

• Convergence Security Journal
• /
• v.15 no.7
• /
• pp.75-84
• /
• 2015

In an "NTFS Index Record Data Hiding" method messages are hidden by using file names. Windows NTFS file naming convention has some forbidden ASCII characters for a file name. When inputting Hangul with the Roman alphabet, if the forbidden characters for the file name and binary data are used, the codes are convert to a designated unicode point to avoid a file creation error due to unsuitable characters. In this paper, the problem of a file creation error due to non-admittable characters for the file name is fixed, which is used in the index record data hiding method. Using Hangul with Roman alphabet the characters cause a file creation error are converted to an arbitrary unicode point except Hangul and Roman alphabet area. When it comes to binary data, all 256 codes are converted to designated unicode area except an extended unicode(surrogate pairs) and ASCII code area. The results of the two cases, i.e. the Hangul with Roman alphabet case and the binary case, show the applicability of the proposed method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1169-1172
• /
• 2000

본 논문에서는 X.509와 DNS를 연관하여 Kerberos를 기반으로 분산 인증 알고리즘을 제안한다. Kerberos 에서는 영역간의 서비스에 대하여 언급을 하지 않았기 때문에 영역간 인증은 X.509와 Domain Name System(DNS)를 사용하여 얻을 수 있는 체인에 의해서 수행하는 PKINIT를 통하여 이루어진다. 두 개의 프로토콜은 상이한 키 관리 방식을 갖고 있는데 Kerberos는 공통키에 기반을 두고 있는 반면에 X,509는 공개키 방식에 기반을 두고 있으므로 이들을 상호 연동시키기 위해 연결 세션은 Directory Service(DS)를 이용하였고, 실제적인 인증을 위해서는 Kerberos를 적용하였다. 새로운 알고리즘은 통신복잡도의 관점에서 고찰하면 IETF CAT 그룹에서 제안한 알고리즘을 개선하였다.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.559-571
• /
• 2003

ENUM(tElephon NUmbering Mapping) is protocol that brings convergence between PSTN Networks and IP Networks using a unique worldwide E.164 telephone number as an identifier between different communication infrastructure. The mechanism provides a bridge between two completely different environments with E.164 number; IP based application services used in PSTN networks, and PSTN based application services used in IP networks. We propose a new way to organize and handle ENUM Tier 2 name servers to improve performance at the name resolution process in ENUM based application service. We build an ENUM based network model when NAPTR(Naming Authority PoinTeR) resource record is registered and managed by area code at the initial registration step. ENUM promises convenience and flexibility to both PSTN and IP users, yet there is no evidence how much patience is required when users decide to use ENUM instead of non-ENUM based applications. We have estimated ENUM response time, and proved how to improve performance up to 3 times when resources are managed by the proposed mechanism. The proposition of this thesis favorably influences users and helps to establish the policy for Tier 2 name server management.