• Title/Summary/Keyword: Free Access to Information

Search Result 246, Processing Time 0.03 seconds

Development of a Mouse for Alternative Computer Access Using Smart Device (스마트기기를 이용한 컴퓨터 대체접근 마우스 개발)

  • Jang, U.H.;Hong, W.K.;Kim, C.G.;Song, B.S.
    • Journal of rehabilitation welfare engineering & assistive technology
    • /
    • v.8 no.1
    • /
    • pp.47-55
    • /
    • 2014
  • Almost of alternate computer access devices which assist people with disabilities to utilize the computer connected to computer by some cables or installed in as a S/W program. These devices have some spatial limitations to the people with disabilities, it can't guarantee the free and diverse access to the computer. For these reasons, in this paper, an Android-based mouse program for alternative computer access was developed. A people with physical disabilities who has some limitation of hand movements can use it in anywhere and anytime using only the fine motor skill of the upper limbs. The developed device recognizes the user's point touch and transforms it into the location of mouse cursor. The location information transferred to the computer via Bluetooth communication module equipped in smart devices. Also the group scanning method which can reduce the user's fatigue degree was employed and click, double click, drag & drop functions by hand's movements were equipped. The developed device will help the people with disabilities to use computer with brief touch and convenient operation without spatial limitation.

  • PDF

Power Re-Allocation for Low-Performance User in Cell-free MIMO Network (셀프리 다중안테나 네트워크에서 하위 성능 사용자를 위한 전력 재할당 기법)

  • Ryu, Jong Yeol;Ban, Tae-Won;Lee, Woongsup
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.9
    • /
    • pp.1367-1373
    • /
    • 2022
  • In this paper, we consider a power re-allocation technique in order to enhance the frequency efficiency of the low performance user in a cell-free multiple input multiple output (MIMO) network. The AP first allocates transmit power to the user to be proportional to the large-scale fading coefficients of the connected users. Then, the AP reduces the power of the users who were allocated power greater than the threshold ratio of total allocated power to be equal to the threshold ratio of the allocated power. Finally, the AP re-allocates the reduced power from the strong channel user to the user who has the worst channel condition, and thus, the frequency efficiency of the low performance user can be enhanced. In the simulation results, we verify the performance of the power re-allocation technique in terms of the spectral efficiency of the low performance user.

Modeling of Crowd Source for Big Data (빅데이터를 위한 집단자료 설계)

  • Lee, Sangwon;Park, Sungbum
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2015.01a
    • /
    • pp.283-284
    • /
    • 2015
  • We can picture a workforce that extends beyond your employees: one that consists of any user connected to the Internet. Cloud, social, and collaboration technologies now allow organizations to tap into vast pools of resources across the world, many of whom are motivated to help. Channeling these efforts to drive business goals is a challenge, but the opportunity is enormous: it can give every business access to an immense, agile workforce that is not only better suited to solving some of the problems that organizations struggle with today but in many cases will do it for free. In this paper, we research on factors to design an organizational crowd source for Big Data.

  • PDF

An Improved Vehicle Tracking Scheme Combining Range-based and Range-free Localization in Intersection Environment (교차로 환경에서 Range-based와 Range-free 위치측정기법을 혼합한 개선된 차량위치추적기법)

  • Park, Jae-Bok;Koh, Kwang-Shin;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.2
    • /
    • pp.106-116
    • /
    • 2011
  • USN(Ubiquitous Sensor Network) environment permits us to access whatever information we want, whenever we want. The technologies to provide a basement to these environments premise an accurate location establishment. Especially, ITS(Intelligent Transportation Systems) is easily constructed by applying USN technology. Localization can be categorized as either Range-based or Range-free. Range-based is known to be not suitable for the localization based on sensor network, because of the irregularity of radio propagation and the additional device requirement. The other side, Range-free is much appropriated for the resource constrained sensor network because it can actively locate by means of the communication radio. But, generally the location accuracy of Range-free is low. Especially, it is very low in a low-density environment. So, these two methods have both merits and demerits. Therefore, it requires a new method to be able to improve tracking accuracy by combining the two methods. This paper proposes the tracking scheme based on range-hybrid, which can markedly enhance tracking accuracy by effectively using the information of surrounding nodes and the RSSI(Received Signal Strength Indication) that does not require additional hardware. Additionally, we present a method, which can improve the accuracy of vehicle tracking by adopting the prediction mechanism. Simulation results show that our method outperforms other methods in the transportation simulation environment.

PD-DESYNC: Practical and Deterministic Desynchronization in Wireless Sensor Networks

  • Hyun, Sang-Hyun;Kim, Geon;Yang, Dongmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.3880-3899
    • /
    • 2019
  • Distributive desynchronization algorithms based on pulse-coupled oscillator (PCO) models have been proposed for achieving collision-free wireless transmissions. These algorithms do not depend on a global clock or infrastructure overheads. Moreover, they gradually converge to fair time-division multiple access (TDMA) scheduling by broadcasting a periodic pulse signal (called a 'firing') and adjusting the next firing time based on firings from other nodes. The time required to achieve constant spacing between phase neighbors is estimated in a closed form or via stochastic modeling. However, because these algorithms cannot guarantee the completion of desynchronization in a short and bounded timeframe, they are not practical. Motivated by the limitations of these methods, we propose a practical solution called PD-DESYNC that provides a short and deterministic convergence time using a flag firing to indicate the beginning of a cycle. We demonstrate that the proposed method guarantees the completion of desynchronization within three cycles, regardless of the number of nodes. Through extensive simulations and experiments, we confirm that PD-DESYNC not only outperforms other algorithms in terms of convergence time but also is a practical solution.

SAF: A Scheme of Swap Space Allocation in File Systems to Reduce Disk Seek Time (SAF: 디스크 탐색 시간 향상을 위한 파일 시스템 내 스왑 공간 할당 기법)

  • Ahn, Woo-Hyun;Kim, Bo-Gon;Kim, Byung-Gyu;Oh, Jae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.6
    • /
    • pp.1289-1300
    • /
    • 2011
  • In recent computer systems with high-performance, users execute programs needing large memory and programs intensively accessing files simultaneously. Such a large memory requirement makes virtual memory systems access swap spaces in disk, and intensive file accesses require file systems to access file system partitions in disk. Executing the two kinds of programs at once incurs large disk seeks between swap spaces and file system partitions frequently. To solve the problem, this paper proposes a new scheme called SAF to create several swap spaces in a file system partition, where pages to be paged out are stored. When a page is paged out, the scheme stores the page to one of the swap spaces close to a disk location where the most recently accessed file is located. The chosen swap space in the file system partition is closer to the disk location than the traditional swap space, so that our scheme can reduce the large disk seek time spent to move to the traditional swap space in paging out a page. The experiment of our scheme implemented in FreeBSD 6.2 shows that SAF reduces the execution time of several benchmarks over FreeBSD ranging from 14% to 42%.

The Design and Implementation of a Reusable Viewer Component

  • Kim, Hong-Gab;Lim, Young-Jae;Kim, Kyung-Ok
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.66-69
    • /
    • 2002
  • This article outlines the capabilities of a viewer component called GridViewer, and proves its reusability. GridViewer was designed for the construction of the image display part of GIS or remote sensing application software, and consequently it is particularly straightforward to closely couple GridViewer with access to very large images. Displaying is performed through pyramid structure, which enables to treat very large dataset up to several gigabytes in size under the limited capability of PC. GridViewer is free from responsibility to handle various formats of raster data files by taking grid coverage, which is designed by OGC to promote interoperability between implementations done by data vendors and software vendors providing analysis and grid processing implementations. GridViewer differs from other such viewer by allowing for clients to extend its function and capability by using small set of methods originally implemented in it. We show its reusability and expandability by applying it in developing application programs performing various functions not supported originally by the GridViewer COM component.

  • PDF

An Analysis on the Web Usage Pattern Graph Using Web Users' Access Information (웹 이용자의 접속 정보 분석을 통한 웹 활용 그래프의 구성 및 분석)

  • Kim, Hu-Gon;Kim, Jae-Gyo
    • Korean Management Science Review
    • /
    • v.23 no.3
    • /
    • pp.63-75
    • /
    • 2006
  • There are many kinds of research on web graph, most of them are focus on the hyperlinked structure of the web graph. Well known results on the web graph are rich-get-richer phenomenon, small-world phenomenon, scale-free network, etc. In this paper, we define 3 new directed web graph, so called the Web Usage Pattern Graph (WUPG), that nodes represent web sites arid arcs between nodes represent a movement between two sites by users' browsing behavior. The data to constructing the WUPG, approximately 56,000 records, are gathered from some users' PCs. The results analysing the data summarized as follows : (i) extremely rich-get-richer phenomenon (ii) average path length between sites is significantly less than the previous one (iii) less external hyperlinks, more internal hyperlinks.

An efficient channel assignment meghod for real-time service in the IEEE 802.11 wireless LAN system (IEEE 802.11 무선 LAN 환경에서 실시간 서비스를 제공하기 위한 채널 구간 할당 방안)

  • 박중신;류시훈;강태원;이준호;이재용;이상배
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.5
    • /
    • pp.1249-1259
    • /
    • 1998
  • This paper proposes an efficient channel assignment method for real-time service in the IEEE 802.11 Wireless LAN system, and analyzes the supportability to real-time service and the channel utilzation of that through computer simulations. The improved MAC(Medium Access Control) protocol employing the proposed channel assignment method achieved good throughput over contention period as well as contention-free period by making real-time terminals transmit the information about their desiring value before starts of data transmissions. For performance evaluation of the proposed method, a simulation analyzing the variation of allocated bandwidths to terminals using real-time service and their buffer sizes wasexecuted. Real-time data traffics was modeled s 7-stae transition VBR sources, and asynchronous data traffics modeled as Poisson processes. In the simulation, the proposed method showed smaller variation of the bandwidth of each terminal and samller buffer size than the existing method, and also recorded good throughput over contention period.

  • PDF

Adaptive GTS allocation scheme with applications for real-time Wireless Body Area Sensor Networks

  • Zhang, Xiaoli;Jin, Yongnu;Kwak, Kyung Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1733-1751
    • /
    • 2015
  • The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.