• Title/Summary/Keyword: Address Systems

Search Result 1,526, Processing Time 0.028 seconds

A Study on the Informatization Planning of Postal Address (우편주소 정보화 방안 수립에 관한 연구)

  • Chang, Tai-Woo;Jeong, Han-Il;Park, Chank-Won
    • IE interfaces
    • /
    • v.18 no.1
    • /
    • pp.104-116
    • /
    • 2005
  • In this paperm we provide a plan of construction, employment and management of the Korean postal address database and discuss the design of to-be models for it. For the purpose, we adopt and modify the information strategy planning methodology to fit it into our study. We examine the managerial environments and limitations of the postal services and define the requirements as a result. The U.S. Postal Service (USPS) was chosen as the best practice for a benchmarking and gap analysis with its advanced management of address information. After analyzing the current status of the postal business processes and information systems used, we classify the products and the services of USPS by the process to which they are applied and propose a deployment plan. In order to design a to-be model, we define the operating and managing functions for the address database and specify the scenario according to the functions. By managing the address database and supporting the postal services, it could be possible to make the business competitive and satisfy the customer demands.

Quantized DCT Coefficient Category Address Encryption for JPEG Image

  • Li, Shanshan;Zhang, Yuanyuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1790-1806
    • /
    • 2016
  • Digital image encryption is widely used for image data security. JPEG standard compresses image with great performance on reducing file size. Thus, to encrypt an image in JPEG format we should keep the quality of original image and reduced size. This paper proposes a JPEG image encryption scheme based on quantized DC and non-zero AC coefficients inner category scrambling. Instead of coefficient value encryption, the address of coefficient is encrypted to get the address of cipher text. Then 8*8 blocks are shuffled. Chaotic iteration is employed to generate chaotic sequences for address scrambling and block shuffling. Analysis of simulation shows the proposed scheme is resistant to common attacks. Moreover, the proposed method keeps the file size of the encrypted image in an acceptable range compared with the plain text. To enlarge the cipher text possible space and improve the resistance to sophisticated attacks, several additional procedures are further developed. Contrast experiments verify these procedures can refine the proposed scheme and achieve significant improvements.

IP Address Lookup using Segment Trees (세그먼트 트리를 이용한 IP 주소 검색)

  • Lee, In-Bok;Park, Geun-Su;Choe, Yang-Hui;Jeong, Seong-Gwon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.11
    • /
    • pp.613-619
    • /
    • 2001
  • The IP address lookup problem is to find the longest matching IP prefix for a given IP address from the routing table and has been a central bottleneck in speeding up the Internet. In this paper, we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm can do IP address in Ο(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the total data structure.

  • PDF

A Study on the Natural Energy Effect about the Address No.0 of Eco-friendly Architecture (생태건축 0번지의 자연에너지 효과에 관한 연구)

  • Lee, Si-Woong;Kang, Byung-Ho;Lim, Sang-Hoon;Choi, Seung-Hee
    • KIEAE Journal
    • /
    • v.3 no.3
    • /
    • pp.19-25
    • /
    • 2003
  • The Address No.0 of Eco-friendly Architecture offers unique experience for those who visit the place to envisage the future architecture where nature, human and building exist in harmony. It is open to the general public including the students of elementary and secondary schools. This house has been built to provide opportunities for the general public to experience eco-friendly architecture. It's floor area is 42 pyung($140m^2$) and the overall site has the area of 180 pyung($600m^2$). The following illustrates some of its prominent features : ${\bullet}$ Remodeling of a traditional Korean residence ${\bullet}$ Application of passive solar systems ${\bullet}$ Use of clerestory windows and daylighting systems(washroom and machine room) ${\bullet}$ Operation of solar water heaters with flat plate collectors ${\bullet}$ Construction of Biotop(small ecological world) ${\bullet}$ Water circulation for Biotop by photovoltaic(150W) and wind power(400W) generation ${\bullet}$ Outdoor hot water supplied by all-glass evacuated solar tubes. Through this Address No.0 of Eco-friendly Architeture conclusions are as followings. 1. The array of tubes in collector has the best nice in that the number of tube is nine and the tilt angle is the latitude $+20^{\circ}$. 2. The thermal performance of the all-glass solar vacuum collector was excellent than of the flate-plate solar collector. 3. The adaption of new small wind power systems to buildings were proved to produce a profit if it is considered the expense of environment improvement and the wind speed increasing according to rise of building hight.

The QCE:A Binding Environment for Distributed Memory Multiprocessors (분산메모리 멀티프로세서 시스템을 위한 바인딩 환경(QCE))

  • Lee, Yong-Du;Kim, Hui-Cheol;Chae, Su-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1719-1726
    • /
    • 1996
  • In the OR-parallel execution of logic programs, binding environments have a critical impact on the performance. Particularly, this is true for distributed execution on parallel systems with a non-single address space. The reason is that in such systems, the remote accesses across processing elements deteriorate the performance. To solve this problem, some binding methods were previously proposed specifically for a non-single address space. However, compared with the binding methods for a single address space, they are far less efficient due to the overhead of newly introduced operations such as environment closing and back-unification, In this paper, we propose a new binding environment is a hybrid that combines both the binding methods for a single address space and those for anon-single address space. It acomplishes high efficiency by making closing operations unnecessary both at unification and at back-unification, while mainthing the restricted accesses.

  • PDF

Survey of Evolutionary Algorithms in Advanced Planning and Scheduling

  • Gen, Mitsuo;Zhang, Wenqiang;Lin, Lin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.1
    • /
    • pp.15-39
    • /
    • 2009
  • Advanced planning and scheduling (APS) refers to a manufacturing management process by which raw materials and production capacity are optimally allocated to meet demand. APS is especially well-suited to environments where simpler planning methods cannot adequately address complex trade-offs between competing priorities. However, most scheduling problems of APS in the real world face both inevitable constraints such as due date, capability, transportation cost, set up cost and available resources. In this survey paper, we address three crucial issues in APS, including basic scheduling model, job-shop scheduling (JSP), assembly line balancing (ALB) model, and integrated scheduling models for manufacturing and logistics. Several evolutionary algorithms which adapt to the problems are surveyed and proposed; some test instances based on the practical problems demonstrate the effectiveness and efficiency of evolutionary approaches.

Development and Application of the Parcel-address Based Water Information System (지번을 기초로 한 상수도정보체계 구축 및 활용)

  • 유재용;이규석
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.12 no.1
    • /
    • pp.25-34
    • /
    • 1994
  • Water Information Systems requires efficient management, fast and highly advanced data processing. To respond these requirements promptly, it is essential to operate proper information systems. In the future, the system should be extended to comprehensive urban information systems. To implement these tasks, the user needs assessment were done using the study site data, Nonhyun-dong, Kangnam-ku, Seoul. Based on these analyses, the parcel-address based water information system was developed using the Arc Macro Language(AML) in Arc/Info, a vector-based GIS. The system was tested at the study site, then, the technological and institutional problems to be solved were discussed for the successful water information system.

  • PDF

Analysis of Threat Model and Requirements in Network-based Moving Target Defense

  • Kang, Koo-Hong;Park, Tae-Keun;Moon, Dae-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.10
    • /
    • pp.83-92
    • /
    • 2017
  • Reconnaissance is performed gathering information from a series of scanning probes where the objective is to identify attributes of target hosts. Network reconnaissance of IP addresses and ports is prerequisite to various cyber attacks. In order to increase the attacker's workload and to break the attack kill chain, a few proactive techniques based on the network-based moving target defense (NMTD) paradigm, referred to as IP address mutation/randomization, have been presented. However, there are no commercial or trial systems deployed in real networks. In this paper, we propose a threat model and the request for requirements for developing NMTD techniques. For this purpose, we first examine the challenging problems in the NMTD mechanisms that were proposed for the legacy TCP/IP network. Secondly, we present a threat model in terms of attacker's intelligence, the intended information scope, and the attacker's location. Lastly, we provide seven basic requirements to develop an NMTD mechanism for the legacy TCP/IP network: 1) end-host address mutation, 2) post tracking, 3) address mutation unit, 4) service transparency, 5) name and address access, 6) adaptive defense, and 7) controller operation. We believe that this paper gives some insight into how to design and implement a new NMTD mechanism that would be deployable in real network.

Building Access Control System Using MAC Address of Smart Device (Smart Device의 MAC Address를 이용한 건물 출입통제 시스템)

  • Jung, Yong-jin;Lee, Jong-sung;Oh, Chang-heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.873-875
    • /
    • 2014
  • In this paper, we propose the access control system based bluetooth using the MAC address of the smart device. Access control system that propose compares the smart device MAC address entry and exit and MAC address that is registered with the server. Depending on whether the match was compared, access control is performed. Result of the experiment, control of door is possible only by bluetooth pairing of the bluetooth module and smart device. Therefore, it does not require access to another tool.In addition, Action for access approval is omitted. Therefore, the access authorization procedure is simplified compared to existing access control systems, it is possible to improve the convenience.

  • PDF

A Hierarchical Server Structure for Parallel Location Information Search of Mobile Hosts (이동 호스트의 병렬적 위치 정보 탐색을 위한 서버의 계층 구조)

  • Jeong, Gwang-Sik;Yu, Heon-Chang;Hwang, Jong-Seon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.1_2
    • /
    • pp.80-89
    • /
    • 2001
  • The development in the mobile computing systems have arisen new and previously unforeseen problems, such as problems in information management of mobile host, disconnection of mobile host and low bandwidths of wireless communications. Especially, location information management strategy of mobile host results in an increased overhead in mobile computing systems. Due to the mobility of the mobiles host, the changes in the mobile host's address depends on the mobile host's location, and is maintained by mapping physical address on virtual address, Since previously suggested several strategies for mapping method between physical address and virtual address did not tackle the increase of mobile host and distribution of location information, it was not able to support the scalability in mobile computing systems. Thus, to distribute the location inrormation, we propose an advanced n-depth LiST (Location information Search Tree) and the parallel location search and update strategy based on the advanced n-depth LiST. The advanced n-depth LiST is logically a hierarchical structure that clusters the location information server by ring structure and reduces the location information search and update cost by parallel seatch and updated method. The experiment shows that even though the distance of two MHs that communicate with each other is large, due to the strnctural distribution of location information, advanced n-depth LiST results in good performance. Moreover, despite the reduction in the location information search cost, there was no increase in the location information update cost.

  • PDF