• Title/Summary/Keyword: Computer Workstation

Search Result 133, Processing Time 0.028 seconds

Integrated Power Optimization with Battery Friendly Algorithm in Wireless Capsule Endoscopy

  • Mehmood, Tariq;Naeem, Nadeem;Parveen, Sajida
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.11
    • /
    • pp.338-344
    • /
    • 2021
  • The recently continuous enhancement and development in the biomedical side for the betterment of human life. The Wireless Body Area Networks is a significant tool for the current researcher to design and transfer data with greater data rates among the sensors and sensor nodes for biomedical applications. The core area for research in WBANs is power efficiency, battery-driven devices for health and medical, the Charging limitation is a major and serious problem for the WBANs.this research work is proposed to find out the optimal solution for battery-friendly technology. In this research we have addressed the solution to increasing the battery lifetime with variable data transmission rates from medical equipment as Wireless Endoscopy Capsules, this device will analyze a patient's inner body gastrointestinal tract by capturing images and visualization at the workstation. The second major issue is that the Wireless Endoscopy Capsule based systems are currently not used for clinical applications due to their low data rate as well as low resolution and limited battery lifetime, in case of these devices are more enhanced in these cases it will be the best solution for the medical applications. The main objective of this research is to power optimization by reducing the power consumption of the battery in the Wireless Endoscopy Capsule to make it battery-friendly. To overcome the problem we have proposed the algorithm for "Battery Friendly Algorithm" and we have compared the different frame rates of buffer sizes for Transmissions. The proposed Battery Friendly Algorithm is to send the images on average frame rate instead of transmitting the images on maximum or minimum frame rates. The proposed algorithm extends the battery lifetime in comparison with the previous baseline proposed algorithm as well as increased the battery lifetime of the capsule.

Performance Comparison and Analysis of Container-based Host Operating Systems for sending and receiving High-capacity data on Server Systems

  • Kim, Sungho;Kwon, Oeon;Kim, Jung Han;Byeon, JiHyeon;Hwang, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.7
    • /
    • pp.65-73
    • /
    • 2022
  • Recently, as the Windows system supports the Windows subsystem for Linux (WSL), various researchers have studied to apply a docker container on various systems such as server systems, workstation system and so on. However, in various existing researchers, there is a lack of performance-related indicators to apply the system to each operating system (linux system and windows system). In this paper, we compared a performance comparison and analysis of container-based host operating systems. We configured experimental environments of operating systems for microsoft windows systems and linux systems based on a docker container support. In experimental results, the containers of linux systems reduced the average data latency of dataset 1-6 by 3.9%, 62.16%, 1552.38%, 7.27%, 60.83%, and 1567.2%, compared to the containers on microsoft windows systems.

Class-based Proxy Server for Mobile Computers (이동 컴퓨터를 위한 클래스 기반 프락시 서버)

  • Lee, Jong-Kuk;Kim, Myung-Chul;Lee, Kyung-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.463-476
    • /
    • 2001
  • To support the mobility, mobile computers are generally equipped with lower capability than desktop PCs or workstations in terms of the size of a display, the processing power of CPU and so on. This may give a rise to limitation in mobile computers of supporting multimedia services such as World Wide Web which users would otherwise fully enjoy in desktop PCs. Approaches to reducing the limitations are distillating original multimedia data or converting them to text. Conventional proxy servers for mobile computer simply send distillated image files with the fixed size regardless of the display size of a target mobile computer. Since the cached data is kept separately for each user, they cannot be shared among users with the same display configuration and thus the proxy server could be overloaded. In this paper, we first classify various mobile computers based on their display capability in terms of display sizes and colors. We propose an enhanced proxy server called Class-based proxy that provides a mobile computer with distillated image files in proportion to its class display capacity. The proposed proxy server allows a mobile computer user to have a homepage view similar to that in PC or Workstation. Mobile computers with the same class share the cached image files, which are distillated appropriately for that class. This helps the proxy server to get higher cache hit ratio with improved efficiency and scalability.

  • PDF

Virtual Dissection System of Cadaver Heart Using 3-Dimensional Image

  • Chung, Min-Suk;Lee, Je-Man;Kim, Min-Koo;Park, Seung-Kyu
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.11
    • /
    • pp.357-360
    • /
    • 1997
  • For medical students and doctors, knowledge of the 3-dimensional (3D) structure of the heart is very important in diagnosis and treatment of the heart diseases. 2-dimensional (2D) tools (e.g. anatomy book) or classical 3D tools (e.g. plastic model) are not sufficient or understanding the complex structures of the heart. Moreover, it is not always guaranteed to dissect the heart of cadaver when it is necessary. To overcome this problem, virtual dissection systems of the heart have been developed. But these systems are not satisfactory since they are made of radiographs; they are not true 3D images; they can not be used to dissect freely; or they can only be operated on the workstation. It is also necessary to make the dissection systems incorporating the various races and tribes because of the organ's difference according to race and tribe. This study was intended to make the 3D image of the heart from a Korean cadaver, and to establish a virtual dissection system of the heart with a personal computer. The procedures or manufacturing this system were as follows. 1. The heart from a Korean adult cadaver was embedded with gelatin solution, and serially cross-sectioned at 1mm-thickness on a meat slicer. Pictures or 153 cross-sectioned specimens were inputted into the computer using a digital camera ($756{\times}504$ resolution, true color). 2. The alignment system was established by means of the language of IDL, and applied to align 2D images of the heart. In each of 2D images, closed curves lining clean and dirty blood pathways were drawn manually on the CorelDRAW program. 3. Using the language of IDL, the 3D image and the virtual dissection system of the heart were constructed. The virtual dissection system of the heart allowed or ree rotation, any-directional sectioning, and selected visualization of the heart's structure. This system is expected to become more advanced, and to be used widely through Internet or CD-title as an educational tool for medical students and doctors.

  • PDF

Distributed Structural Analysis Algorithms for Large-Scale Structures based on PCG Algorithms (대형구조물의 분산구조해석을 위한 PCG 알고리즘)

  • 권윤한;박효선
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.12 no.3
    • /
    • pp.385-396
    • /
    • 1999
  • In the process of structural design for large-scale structures with several thousands of degrees of freedom, a plethora of structural calculations with large amount of data storage are required to obtain the forces and displacements of the members. However, current computational environment with single microprocessor such as a personal computer or a workstation is not capable of generating a high-level of efficiency in structural analysis and design process for large-scale structures. In this paper, a high-performance parallel computing system interconnected by a network of personal computers is proposed for an efficient structural analysis. Two distributed structural analysis algorithms are developed in the form of distributed or parallel preconditioned conjugate gradient (DPCG) method. To enhance the performance of the developed distributed structural analysis algorithms, the number of communications and the size of data to be communicated are minimized. These algorithms are applied to the structural analyses of three large space structures as well as a 144-story tube-in-tube framed structure.

  • PDF

A Neighboring Area Search Algorithm for Terrain Following (Terrain Following을 위한 인접지역 탐색 알고리즘)

  • Kim, Jong-Hyuk;Choy, Yoon-Chul;Koh, Kyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.10
    • /
    • pp.499-506
    • /
    • 2001
  • Terrain Following means that a mobile object, such a user's avatar, must follow terrain, remaining in contact with the ground at all times in virtual environments. This makes a virtual environment have the effects of gravity. Terrain Following is often done using collision detection: however this is inefficient, because general collision detection solves a problem that is inherently more complex than merely determining terrain contact points. Many virtual environments avoid the expense by utilizing a flat terrain with a constant altitude everywhere. This makes a terrain following trivial, but lacks realism. This paper provides as algorithm and a data structure for a terrain following using a neighboring area search as a way to search neighboring polygons. Because this algorithm uses a pre-processing step that stores the terrain polygons for calculating, it results in reducing overheads to workstations that is used to construct and maintain a virtual environment. Consequently, workstation can be used to apply not only a terrain following but also other things.

  • PDF

A Study on the Construction Method of Collaboration Environment for Web (Web에서의 협력 환경 구축 방안 연구)

  • Lee, Jae-Ho
    • Journal of The Korean Association of Information Education
    • /
    • v.1 no.1
    • /
    • pp.74-81
    • /
    • 1997
  • The World Wide Web (Web) is one of the most popular internet tool on now, In this reason most of common user, they understand the Web is internet and Web content is also important issues on this side. However, commonly Web content created by one of Web content creator and sometime they refer the another document and link. In these kinds of environments cause tile delivery of incorrect information or linking to another Web user. There are lots of way to protect the incorrect information deliveries to Web user and the most famous one is Computer Supported Cooperation Work (CSCW). This supports the multi-user environment on single system environment, but this needs more additional things in the current internet environment Current internet defined as distributed information network not tile traditional client-server environment. Specially, Intranet environments need to support the heterogeneous system environment like several Rinds of database, systems like PC, Mac and UNIX workstation, and etc. In this reason, we need collaboration and this would serve the common user interface to all of Web user. In these paper, we review the current concept of CSCW and grouoware that are major concept of collaboration and definition, classification and problem analysis of the collaboration. Finally, we suggest the construction method of collaboration environment for Web.

  • PDF

A Parallel I/O System on Workstation Clustering Environment for Irregular Applications (비정형 응용을 위한 워크스테이션 클러스터링 환경에서의 병렬 입출력 시스템)

  • No, Jae-Chun;Park, Sung-Soon;Choudhary, Alok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.496-505
    • /
    • 2000
  • Clusters of workstations (COW) are becoming an attractive option for parallel scientific computing, a field formerly reserved to the MPPs, because their cost-performance ratio is usuallybetter than that of comparable MPPS, and their hardware and software can be easily enhanced to thelatest generations. In this paper we present the design and implementation of our runtime library forclusters of workstations, called "Collective I/O Clustering". The library provides a friendlyprogramming model for the I/O of irregular applications on clusters of workstations, being completelyintegrated with the underlying communication and I/O system. In the collective I/O clustering, two I/Oconfigurations are possible. In the first I/O configuration, all processors allocated can act as I/Oservers as well as compute nodes. In the second I/O configuration, only a subset of processors canact as I/O servers, The compression and software caching facilities have been incorporated into thecollective 1/0 clustering to optimize the communication and I/O costs. All the performance results wereobtained on the IBM-SP machine, located at Argonne National Labs.

  • PDF

A Methodology of the Information Retrieval System Using Fuzzy Connection Matrix and Document Connectivity Order (색인어 퍼지 관계와 서열기법을 이용한 정보 검색 방법론)

  • Kim, Chul;Lee, Seung-Chai;Kim, Byung-Ki
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1160-1169
    • /
    • 1996
  • In this study, an experiment of information retrieval using fuzzy connection matrix of keywords was conducted. A query for retrieval was constructed from each keyword and Boolean operator such as AND, OR, NOT. In a workstation environment, the performance of the fuzzy retrieval system was proved to be considerably effective than that of the system using the crisp set theory. And both recall ratio and precision ratio showed that the proposed technique would be a possible alternative in future information retrieval. Some special features of this experimental system were ; ranking the results in the order of connectivity, making the retrieval results correspond flexibly by changing the threshold value, trying to accord the retrieval process with the retrieval semantics by treating the averse-connectivity (fuzzy value) as a semantic approximation between kewords.

  • PDF

Design and Implementation of Interface between the Database and the Application Program (데이터베이스와 응용프로그램 사이의 인터페이스 설계 및 구현)

  • Jung, In-Sook;Lee, Chang-Sup;Cho, Chung-Ho
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.34 no.4
    • /
    • pp.139-147
    • /
    • 1997
  • Most of the existing applications developed undter the DOS environment exchange information with the exterior world through reading and writing files in ASCII format. A package program consisting of numerous modules has to exchange data not only between module program and the input/output files but also between module themselves, and hence information exchange via ASCII file is increasingly inefficient and less accurate as the number of modules increases. The present paper describes the design and the implementation of the interface between the module program and the database which stores all the information necessary for the execution of the application. The interface program is then applied to the existing Propeller Design and Analysis System to show that the interface functions smoothly. The development is performed on the personal computer operating under Windows 95 rather than the workstation under Unix operating system to prove that the design and analysis work can be carried out without limit in time and space.

  • PDF