• Title/Summary/Keyword: Database server

Search Result 842, Processing Time 0.032 seconds

A Seminar Assistant System using IOCP Server Model (IOCP 서버 모델을 이용한 세미나 보조시스템)

  • Ahn, Hyun-Ju;Heo, Da-Jeong;Park, Dong-Gyu;Uh, Yoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.4
    • /
    • pp.821-827
    • /
    • 2009
  • Currently, with the development of web 2.0 knowledge sharing system became more and more important. In this paper, we proposed and implemented seminar assistant system using database system and knowledge sharing system on public seminar. We recorded speaker's voice and presentation files on our system and user can review past talks on our seminar review systems. Our database system is implemented using MS SQL, and Input/Output Completion Port(IOCP) socket model as our server side network module. Also we used presentation software using Direct Show with MFC and Windows Presentation Foundation(WPF). and our review system is based on WFP programmed with C# language.

An Implementation of Remote Examination System on Internet using lava/SWING (Java를 이용한 인터넷기반 원격시 험시스템의 구현)

  • 김윤호;박운영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.6
    • /
    • pp.915-922
    • /
    • 2002
  • This paper presents an implementation of an Remote Examination System on Internet using Java and SWING GUI API. The system is consisted of three parts: generating examination part that is Java application, answering questions part that is Java Applet, reviewing results part that is Java Applet. The first part is implemented with the 2-tier client/server architecture and the last two parts is implemented the 3-tier client/server architecture. Database programming is done using Java JDBC API for database independence and portability. This system can be used the evaluation of lectures, and substituted for pen-and-pencil examinations or adopted to survey applications based on Internet.

Design and Implementation of the Massive Underwater Acoustic Database System (대용량 해상시험자료 데이터베이스 시스템 설계 및 구현)

  • Jeong, Gi-Hyeon;Choe, Jae-Yong;Do, Gyeong-Cheol;Kim, Eung-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2020-2030
    • /
    • 1999
  • Data acquired about 53 gigabyte per a naval vessel is massive, expensive and impossible to be retested in a underwater acoustic measurement. So, it is required to manage systematically. In this paper, we mention MUADS (Massive Underwater Acoustic Database System) that was developed to store a long time, manage systematically and supply raw data and analyzed data. we analyze client/server performance based on 6003 input data individually in our MUADS that Unix server having a massive DC-jukebox and Windows clients.

  • PDF

A Study on the Design of Hypertext-Based Linear Displays for an Online Thesaurus (하이퍼텍스트를 이용한 온라인 시소러스의 선형배열 설계에 관한 연구)

  • Choi Jae-Hwang
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.33 no.3
    • /
    • pp.109-126
    • /
    • 1999
  • The purpose of this study is to design hypertext-based linear displays for an online thesaurus in librarianship and information science with the aid of ISO and ANSI/NISO thesaurus standards. This study starts with the assumptions that hypertext-based online thesauri would provide a convenient and useful subject retrieval tool to both indexers and searchers of information and become starting point for the study of thesauri searching patterns, which were difficult with printed thesauri. For this study, thesaurus of librarianship and information science was stored in MS ACCESS 97 as a relational database and, for the conjunction of a relational database with World Wide Web, technics of ASP(Active Server Pages) were applied under Windows NT operation.

  • PDF

A Design of Intelligent Home Network Service using Wireless Sensor Network (무선 센서 네트워크를 이용한 지능형 홈 네트워크 서비스 설계)

  • Na, Sun-Wung;Lee, Sang-Jeong;Kim, Dong-Kyun;Choi, Young-Kil
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.183-193
    • /
    • 2006
  • This paper suggests a service model which uses a wireless sensor network in home network environment. The sensor network consists of fixed sensor nodes and user identification nodes which is attached to each user. With the input information of the user preference profile and the collected data from the sensor nodes, the database is constructed as a context information and analyzed by a home server to provide a service that establishes and controls automatically home appliances according to each user's preference. The proposed service model is implemented and tested on a Linux server with MySQL database and sensor nodes on TinyOS.

  • PDF

NutriSyn: Knowledge Based Synonym Retrieval Service for Food and Dishes on the Web (NutriSyn(식품어휘지능망): 웹 기반 식품.음식 유의어 지식 구축 및 검색 서비스 구현)

  • Hong, Soon-Myung;Cho, Jee-Ye;Park, Yu-Jeong;Kim, Min-Chan;Kim, Gon
    • Journal of the Korean Dietetic Association
    • /
    • v.15 no.3
    • /
    • pp.286-297
    • /
    • 2009
  • Studies based on food analysis or food databases use the national standard food database. Although Internet information services are increasing gradually, users are only able to get definitive and profitable information using standard food terms. Until now, it has been uncommon to find food retrieval services that include users' regional or historical characteristics. Thus, this study introduces a prototype for Food and Dish Synonym Retrieval (NutriSyn) that includes synonyms and related words. The environments which NutriSyn was implemented were Linux for the server operating system, the Microsoft Windows series for the users' operating system and Apache for a web server. The development languages used are PHP, JavaScript and HTLM with a MySQL database. Users can access NutriSyn using Internet browsers. The main menu items are (1) Food Synonym DB, (2) Dish Synonym DB, (3) Food Information DB, (4) Dish Information DB, and (5) Food and Menu Synonym Retrieval. This system is expected to be a useful tool for food experts and interdisciplinary research.

  • PDF

The privacy protection algorithm of ciphertext nearest neighbor query based on the single Hilbert curve

  • Tan, Delin;Wang, Huajun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3087-3103
    • /
    • 2022
  • Nearest neighbor query in location-based services has become a popular application. Aiming at the shortcomings of the privacy protection algorithms of traditional ciphertext nearest neighbor query having the high system overhead because of the usage of the double Hilbert curves and having the inaccurate query results in some special circumstances, a privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve has been proposed. This algorithm uses a single Hilbert curve to transform the two-dimensional coordinates of the points of interest into Hilbert values, and then encrypts them by the order preserving encryption scheme to obtain the one-dimensional ciphertext data which can be compared in numerical size. Then stores the points of interest as elements composed of index value and the ciphertext of the other information about the points of interest on the server-side database. When the user needs to use the nearest neighbor query, firstly calls the approximate nearest neighbor query algorithm proposed in this paper to query on the server-side database, and then obtains the approximate nearest neighbor query results. After that, the accurate nearest neighbor query result can be obtained by calling the precision processing algorithm proposed in this paper. The experimental results show that this privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve is not only feasible, but also optimizes the system overhead and the accuracy of ciphertext nearest neighbor query result.

Research of organized data extraction method for digital investigation in relational database system (데이터베이스 시스템에서 디지털 포렌식 조사를 위한 체계적인 데이터 추출 기법 연구)

  • Lee, Dong-Chan;Lee, Sang-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.3
    • /
    • pp.565-573
    • /
    • 2012
  • To investigate the business corruption, the obtainments of the business data such as personnel, manufacture, accounting and distribution etc., is absolutely necessary. Futhermore, the investigator should have the systematic extraction solution from the business data of the enterprise database, because most company manage each business data through the distributed database system, In the general business environment, the database exists in the system with upper layer application and big size file server. Besides, original resource data which input by user are distributed and stored in one or more table following the normalized rule. The earlier researches of the database structure analysis mainly handled the table relation for database's optimization and visualization. But, in the point of the digital forensic, the data, itself analysis is more important than the table relation. This paper suggests the extraction technique from the table relation which already defined in the database. Moreover, by the systematic analysis process based on the domain knowledge, analyzes the original business data structure stored in the database and proposes the solution to extract table which is related incident.

Conjunctive 키워드 검색 스킴에서의 취약점 분석

  • Lee, Hyeon-Suk;Jeong, Ik-Rae;Byeon, Jin-Uk;Im, Jong-In;Lee, Dong-Hun
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2007.02a
    • /
    • pp.116-119
    • /
    • 2007
  • In a keyword search scheme a user stores encrypted data on an untrusted server and gives a database manager a capability for a keyword which enables a database manager to find encrypted data containing the keyword without revealing the keyword to the database manager. Conjunctive keyword search scheme enables a user to obtain data containing all of several keywords through only one query. One of the security requirements of conjunctive keyword search schemes is that a malicious adversary should not be able to generate new valid capabilities from the observed capabilities. In U:5 paper we show that conjunctive keyword search schemes are not secure. In particular, given two capabilities corresponding two sets of keywords, an adversary is able to generate a new capability corresponding to the dierence set of two keywords sets.

  • PDF

Development of Web Based Mold Discrimination System using the Matching Process for Vision Information and CAD DB (비전정보와 캐드DB 매칭을 통한 웹 기반 금형 판별 시스템 개발)

  • Choi, Jin-Hwa;Jeon, Byung-Cheol;Cho, Myeong-Woo
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.15 no.5
    • /
    • pp.37-43
    • /
    • 2006
  • The target of this study is development of web based mold discrimination system by matching vision information with CAD database. The use of 2D vision image makes possible speedy mold discrimination from many databases. The image processing such as preprocessing, cleaning is done for obtaining vivid image with object information. The web-based system is a program which runs to exchange messages between a server and a client by making of ActiveX control and the result of mold discrimination is shown on web-browser. For effective feature classification and extraction, signature method is used to make sensible information from 2D data. As a result, the possibility of proposed system is shown as matching feature information from vision image with CAD database samples.