• Title/Summary/Keyword: Free Server

Search Result 114, Processing Time 0.027 seconds

A Human Error-Free Wiring Guide System (휴먼 에러 방지용 배선 안내 시스템 개발)

  • Lee, Hyun Chan;Kim, Joo Han;Kim, Jinsung;Jeong, YeonUk
    • Korean Journal of Computational Design and Engineering
    • /
    • v.22 no.2
    • /
    • pp.181-189
    • /
    • 2017
  • In this paper, we develop a human error-free wire connection guide system. The only related work is Japanese patent by Hitachi. The patent is guiding the wire connection using PC server. And no implementation details have been reported publicly. We propose a new method based on smart mobile devices. The proposed methods are registered as two Korean patents. We implement a prototype wire connection guide system to verify the patents. Through human experiments, we verify the system can reduce the human error more than 90% and speed up the connection process more than twice faster than working without the system. To be used in the industrial fields, the prototype system needs more product packaging works.

Design of P2P Server System to execute Dynamic Distribution Policy (동적 분배정책을 수행하는 P2P 서버 시스템의 설계)

  • 박정민;김홍일
    • Journal of Internet Computing and Services
    • /
    • v.3 no.6
    • /
    • pp.25-33
    • /
    • 2002
  • The efficiency of the data share service of P2P method is decided by the maintaining guard method of a sharing list, This paper suggests the data sharing system of the P2P base that it should retain a shared data list at a client, The Server at a proposed system guards inclusively client. divided into several groups and at each individual group, a client appointed the TopHost uses the method guarding a free share list of a applicating group, The TopHost designs to execute it relating with server in case of the mergence and the division of a group as well as a maintaining management of a data share list, The efficiency of the suggested system regard the maintaining guard of groups formed of a client of the appropriate level of a kernel and exams examination to measure it through a really executed data share service.

  • PDF

A 3D Modeling System Using Multiple Stereo Cameras (다중 스테레오 카메라를 이용한 3차원 모델링 시스템)

  • Kim, Han-Sung;Sohn, Kwang-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.1
    • /
    • pp.1-9
    • /
    • 2007
  • In this paper, we propose a new 3D modeling and rendering system using multiple stereo cameras. When target objects are captured by cameras, each capturing PC segments the objects and estimates disparity fields, then they transmit the segmented masks, disparity fields, and color textures of objects to a 3D modeling server. The modeling server generates 3D models of the objects from the gathered masks and disparity fields. Finally, the server generates a video at the designated point of view with the 3D model and texture information from cameras.

Thin Film Deposition of Antimony Tellurides for Ge-Sb-Te Compounds

  • Han, Byeol;Kim, Yu-Jin;Park, Jae-Min;Mayangsari, Tirta R.;Lee, Won-Jun
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2014.02a
    • /
    • pp.330.1-330.1
    • /
    • 2014
  • 개인용 노트북, 태블릿 PC, 핸드폰 기술 발전에 의해 언제 어디서나 데이터를 작성하고 기록하는 일들이 가능해졌다. 특히 cloud 시스템을 이용하여 데이터를 휴대기기에 직접 저장하지 않고 server에 기록하는 일들이 가능해짐에 따라 server 기기의 성능, server-room power 및 space 에 대한 관심이 증가하였다. Storage class memory (SCM) 이란 memory device와 storage device의 장점을 결합한 memory를 일컫는 기술로 현재 소형 디바이스 부분부터 점차 그 영역을 넓히고 있다. 그중 phase change material을 이용한 phase change memory (PCM) 기술이 가장 각광받고 있다. PCM의 경우 scaling됨에 의해 cell간의 열 간섭으로 인한 data 손실의 우려가 있어 cell의 면적을 최소화 하여 소자를 제작하여야 한다. 기존의 sputtering등의 PVD 방법으로는 한계가 있어 ALD 공정을 이용한 PCM에 대한 연구가 활발히 진행중이다. 특히 tellurium 원료기체로 silyl 화합물 [1]을 사용하여 주로 $Ge_2Sb_2Te_5$의 조성에 초점을 맞춰 진행되고 있으나, 세부 공정에 대한 기본적인 연구는 미비하다. 본 연구에서는 Ge-Sb-Te 3원계 박막을 형성하기 위한 Sb-Te 화합물의 증착 공정에 대한 연구를 수행하였다. 특히 원료기체로 Si이 없는 새로운 Te 원료기체를 이용하여 조성 조절을 하였고, 박막의 물성을 분석하였다. 또한 공정온도에 따른 박막의 물성 변화를 분석하였다.

  • PDF

Fair Peer Assignment Scheme for Peer-to-Peer File Sharing

  • Hu, Chih-Lin;Chen, Da-You;Chang, Yi-Hsun;Chen, Yu-Wen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.709-735
    • /
    • 2010
  • The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

A MULTI-SERVER RETRIAL QUEUEING MODEL WITH POISSON SIGNALS

  • CHAKRAVARTHY, SRINIVAS R.
    • Journal of applied mathematics & informatics
    • /
    • v.39 no.5_6
    • /
    • pp.601-616
    • /
    • 2021
  • Retrial queueing models have been studied extensively in the literature. These have many practical applications, especially in service sectors. However, retrial queueing models have their own limitations. Typically, analyzing such models involve level-dependent quasi-birth-and-death processes, and hence some form of a truncation or an approximate method or simulation approach is needed to study in steady-state. Secondly, in general, the customers are not served on a first-come-first-served basis. The latter is the case when a new arrival may find a free server while prior arrivals are waiting in the retrial orbit due to the servers being busy during their arrivals. In this paper, we take a different approach to the study of multi-server retrial queues in which the signals are generated in such a way to provide a reasonably fair treatment to all the customers seeking service. Further, this approach makes the study to be level-independent quasi-birth-and-death process. This approach is different from any considered in the literature. Using matrix-analytic methods we analyze MAP/M/c-type retrial queueing models along with Poisson signals in steady-state. Illustrative numerical examples including a comparison with previously published retrial queues are presented and they show marked improvements in providing a quality of service to the customers.

Record keeping system of bugs for software quality assurance

  • Mateen, Ahmed;Zhu, Qingsheng;Afsar, Salman
    • International journal of advanced smart convergence
    • /
    • v.8 no.4
    • /
    • pp.207-213
    • /
    • 2019
  • Assistance for the quality assurance management and developers to provide high quality software products. Using a bug record keeping system is exceptionally important in software progress, and it is followed vastly by majority of software producing companies in modern era. Regular application of a bug record keeping system is very helpful in developing software systems. We developed this system which helps the software testing team to keep a complete record of their testing activities during the software testing, also increases your confidence in the software quality, class and worth. Our proposed system offers trouble-free and effortless approaches to acquire desired information about bug, also produces different kinds of reports like summary reports, detailed reports etc. It gives facility to create, delete and update any project. Our developed application system is designed by using visual c# at front end and sql server 2008 management studio express at back end.

Design and Implementation of Uniview Java Debugging System (유니뷰 자바 디버깅 시스템의 설계 및 구현)

  • 옥재호;정연정;이공선;윤기송
    • The Journal of Information Technology and Database
    • /
    • v.7 no.2
    • /
    • pp.33-45
    • /
    • 2000
  • Uniview system is a client-server system that runs on heterogeneous distributed systems and supports the debugging of various kinds of programs. Its client system provides a unified debugging concept and interface on various debuggers of heterogeneous hosts. Its server system provides debugging services and features openness and scalability by interoperating with one or more debugger processes existing on the same host. Based on FSF(Free Software Foundation)'s gdb and Sun Microsystems's dbx. Uniview system supports C/C++ programming language in various UNIX environments as well as Windows environments. The proposed system was designed and implemented to support the JAVA language, which is prevalently used in recent heterogeneous distributed systems and was partly extended to make a clear analysis of JAVA class file structure. Sun Microsystems's Jdb supplied as a JAVA debugger has very limited functions compared to other programming language debugger. In this paper, Uniview as a JAVA debugging system was implemented to provide debugging technologies which are necessary to debug Java applications but missing in current JAVA language as well as to provide its users with various information.

  • PDF

Development of Computer-based Visual Perception Test Program for Korean Patients with Brain Injury

  • Ahn, Seong-Hye
    • International Journal of Contents
    • /
    • v.3 no.3
    • /
    • pp.32-37
    • /
    • 2007
  • Up to now, several tools to evaluate visual perception tests have been introduced for different purposes. However, they were mostly manual tools, paper books in which the therapists would turn the pages while working together with patients. This paper discusses a potential plan to develop motor-free visual perception test software for Korean patients with brain injury, and to construct a centralized database for their evaluated data in a client/server environment. Through its development, we eventually hope to achieve effective management of the data for better understanding of patients' visual perceptual skills and the standardization of the evaluation for Korean patients. With the help of the computerized environment, we also expect some advantages such as acquisition of reliable results from patients with brain injury, automation for storing and accessing patients' data, construction of the patients' database and the management of a vast amount of the data within it and the provision of a foundation to promote further development of various perceptual-cognitive rehabilitation programs.

An Efficient Video Management Technique using Forward Timeline on Multimedia Local Server (전방향 시간 경계선을 활용한 멀티미디어 지역 서버에서의 효율적인 동영상 관리 기법)

  • Lee, Jun-Pyo;Woo, Soon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.147-153
    • /
    • 2011
  • In this paper, we present a new video management technique using forward timeline to efficiently store and delete the videos on a local server. The proposed method is based on capturing the changing preference of the videos according to recentness, frequency, and playback length of the requested videos. For this purpose, we utilize the forward timeline which represents the time area within a number of predefined intervals. The local server periodically measures time popularity and request segment of all videos. Based on the measured data, time popularity and request segment, the local server calculates the mean time popularity and mean request segment of a video using forward timeline. Using mean time popularity and mean request segment of video, we estimate the ranking and allocated storage space of a video. The ranking represents the priority of deletion when the storage area of local server is running out of space and the allocated storage space means the maximum size of storage space to be allocated to a video. In addition, we propose an efficient storage space partitioning technique in order to stably store videos and present a time based free-up storage space technique using the expected variation of video data in order for avoiding the overflow on a local server in advance. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, our video management technique for local server provides the lowest user start-up latency and the highest bandwidth saving significantly.