• 제목/요약/키워드: Reduced data

검색결과 6,398건 처리시간 0.033초

Data Supply Voltage Reduction Scheme for Low-Power AMOLED Displays

  • Nam, Hyoungsik;Jeong, Hoon
    • ETRI Journal
    • /
    • 제34권5호
    • /
    • pp.727-733
    • /
    • 2012
  • This paper demonstrates a new driving scheme that allows reducing the supply voltage of data drivers for low-power active matrix organic light-emitting diode (AMOLED) displays. The proposed technique drives down the data voltage range by 50%, which subsequently diminishes in the peak power consumption of data drivers at the full white pattern by 75%. Because the gate voltage of a driving thin film transistor covers the same range as a conventional driving scheme by means of a level-shifting scheme, the low-data supply scheme achieves the equivalent dynamic range of OLED currents. The average power consumption of data drivers is reduced by 60% over 24 test images, and power consumption is kept below 25%.

물류 차량을 위한 효율적인 데이터 전송 방법 (An Efficient Data Transmission Scheme for Logistics Vehicles)

  • 김종효;양정민
    • 대한임베디드공학회논문지
    • /
    • 제13권2호
    • /
    • pp.93-100
    • /
    • 2018
  • In this paper, we present a novel scheme of data transmission for logistics vehicles connected with 3G mobile communication networks. The proposed method enhances the efficiency of data transmission by varying the packet transmission period according to the vehicle speed and by reducing the amount of transmitted data using a reduced packet structure. The main contribution is to present the experimental verification in which the proposed method is applied to commercial logistics vehicles that operate with networked data transmission modules. Being compared with the existing method, the proposed scheme shows superior performance in terms of data reduction and transmission speed.

SAMI Galaxy Survey Data Release 2: Absorption-line Physics

  • 오슬희
    • 천문학회보
    • /
    • 제43권2호
    • /
    • pp.53.1-53.1
    • /
    • 2018
  • We present the second data release from the SAMI Galaxy Survey. The data release contains reduced spectral cubes for 1559 galaxies, about 50% of the full survey, having a redshift range 0.004 < z < 0.113 and a large stellar mass range 7.5 < log($M_*/M_{\odot}$) < 11.6. This release also includes stellar kinematic and stellar population value-added products derived from absorption line measurements, and all emission line value-added products from Data Release One. The data are provided online through Australian Astronomical Optics' Data Central. Our poster presents stellar/gas kinematics on the metallicity-mass plane and highlight several galaxies from the SAMI Galaxy Survey that have interesting stellar and gas kinematics. For more information about data release 2, please see: https://sami-survey.org/abdr.

  • PDF

자율주행을 위한 라이다 기반의 실시간 그라운드 세그멘테이션 알고리즘 (LiDAR based Real-time Ground Segmentation Algorithm for Autonomous Driving)

  • 이아영;이경수
    • 자동차안전학회지
    • /
    • 제14권2호
    • /
    • pp.51-56
    • /
    • 2022
  • This paper presents an Ground Segmentation algorithm to eliminate unnecessary Lidar Point Cloud Data (PCD) in an autonomous driving system. We consider Random Sample Consensus (Ransac) Algorithm to process lidar ground data. Ransac designates inlier and outlier to erase ground point cloud and classified PCD into two parts. Test results show removal of PCD from ground area by distinguishing inlier and outlier. The paper validates ground rejection algorithm in real time calculating the number of objects recognized by ground data compared to lidar raw data and ground segmented data based on the z-axis. Ground Segmentation is simulated by Robot Operating System (ROS) and an analysis of autonomous driving data is constructed by Matlab. The proposed algorithm can enhance performance of autonomous driving as misrecognizing circumstances are reduced.

대화형 연산 후 수렴을 이용한 저장된 비디오의 효율적인 전송 스케줄 작성 방안 (An Efficient Scheme to write a Transmission Schedule using Convergence after Interactive Operations in a Stored Video)

  • 이재홍;김승환
    • 한국정보처리학회논문지
    • /
    • 제7권7호
    • /
    • pp.2050-2059
    • /
    • 2000
  • In a video-on-Demand(VOD) service, a server has to return to he normal playback quickly at a certain new frame position after interactive operations such as jump or last playback. In this paper, we propose an efficient scheme to write a transmission schedule for a playback restart of a video stream at a new frame position after interactive operations. The proposed scheme is based on convergence characteristics, that is transmission schedules with different playback startup frame position in a video stream meet each other at some frame position. The scheme applies a bandwidth smoothing from a new frame position to a convergence position without considering all remaining frames of a video stream. And then the scheme transmits video dta according to the new schedule from the new frame position to the convergence position, and then transmits the remaining video data according to the reference schedule from the convergence position, and then transmits the remaining video data according to the reference schedule from the convergence position to the last frame position. In this paper, we showed that there existed the convergence position corresponding to nay frame position in a video stream through many experiments based on MPEG-1 bit trace data. With the convergence we reduced the computational overhead of a bandwidth smoothing, which was applied to find a new transmission schedule after interactive operations. Also, storage overhead is greatly reduced by storing pre-calculated schedule information up to the convergence position for each I frame position of a video stream with video data off-line. By saving information on a transmission schedule off-line along with the video data and searching the schedule corresponding to the specified restarting frame position, we expect the possibility of normal playback of a video stream with small tolerable playback startup delay.

  • PDF

Cold Boot Attack on Encrypted Containers for Forensic Investigations

  • Twum, Frimpong;Lagoh, Emmanuel Mawuli;Missah, Yaw;Ussiph, Najim;Ahene, Emmanuel
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권9호
    • /
    • pp.3068-3086
    • /
    • 2022
  • Digital Forensics is gaining popularity in adjudication of criminal cases as use of electronic gadgets in committing crime has risen. Traditional approach to collecting digital evidence falls short when the disk is encrypted. Encryption keys are often stored in RAM when computer is running. An approach to acquire forensic data from RAM when the computer is shut down is proposed. The approach requires that the investigator immediately cools the RAM and transplant it into a host computer provisioned with a tool developed based on cold boot concept to acquire the RAM image. Observation of data obtained from the acquired image compared to the data loaded into memory shows the RAM chips exhibit some level of remanence which allows their content to persist after shutdown which is contrary to accepted knowledge that RAM loses its content immediately there is power cut. Results from experimental setups conducted with three different RAM chips labeled System A, B and C showed at a reduced temperature of -25C, the content suffered decay of 2.125% in 240 seconds, 0.975% in 120 seconds and 1.225% in 300 seconds respectively. Whereas at operating temperature of 25℃, there was decay of 82.33% in 60 seconds, 80.31% in 60 seconds and 95.27% in 120 seconds respectively. The content of RAM suffered significant decay within two minutes without power supply at operating temperature while at a reduced temperature less than 5% decay was observed. The findings show data can be recovered for forensic evidence even if the culprit shuts down the computer.

정부의 지능 정보화 혁신 성공을 위한 공무원-AI 협업 플랫폼에 관한 연구 (A Study on the Public Officials-AI Collaboration Platform for the Government's Successful Intelligent Informatization Innovation)

  • 오창익;유기중;안준영;김동호
    • 한국IT서비스학회지
    • /
    • 제22권4호
    • /
    • pp.111-122
    • /
    • 2023
  • Since the organization of civil servants has been divided and stratified according to the characteristics of the bureaucracy, it is inevitable that the organization and personnel will increase when new tasks arise. Even in the process of informatization, only the processing method was brought online while leaving the existing business processing procedures as they were, so there was no reduction in manpower through informatization. In order to maintain or upgrade the current administrative services while reducing the number of civil servants, it is inevitable to use AI technology. By using data and AI to integrate the 'powers and responsibilities assigned to the officials in charge', manpower can be reduced, and the reduced costs can be reinvested in the collection, analysis, and utilization of on-site data to further promote intelligent informatization. In this study, as a way for the government's success in intelligent informatization innovation, we proposed a 'Civil Servants-AI Collaboration Platform'. This Platform based on the civil servant proposal system as a reward system and the characteristics of intelligent informatization that are different from the informatization. By establishing a 'Civil Servants-AI Collaboration Platform', the performance evaluation system of the short-term evaluation method by superiors can be improved to a data-driven always-on evaluation method, thereby alleviating the rigid hierarchy of government organizations. In addition, through the operation of Collaboration Platform, it will become common to define and solve problems using data and AI, and the intelligence informatization of government organizations will be activated.

확률적 reduced K-means 군집분석 (Probabilistic reduced K-means cluster analysis)

  • 이승훈;송주원
    • 응용통계연구
    • /
    • 제34권6호
    • /
    • pp.905-922
    • /
    • 2021
  • 라벨 없이 진행되는 비지도 학습 중 하나인 군집분석은 자료에 어떤 그룹이 내포되어 있는지 사전 지식이 없을 경우에 군집을 발굴하고, 군집 간의 특성 차이와 군집 안에서의 유사성을 분석하고자 할 때 유용한 방법이다. 기본적인 군집분석 중 하나인 K-means 방법은 변수의 개수가 많아질 때 잘 동작하지 않을 수 있으며, 군집에 대한 해석도 쉽지 않은 문제가 있다. 따라서 고차원 자료의 경우 주성분 분석과 같은 차원 축소 방법을 사용하여 변수의 개수를 줄인 후에 K-means 군집분석을 행하는 Tandem 군집분석이 제안되었다. 하지만 차원 축소 방법을 이용해서 찾아낸 축소 차원이 반드시 군집에 대한 구조를 잘 반영할 것이라는 보장은 없다. 특히 군집의 구조와는 상관없는 변수들의 분산 또는 공분산이 클 때, 주성분 분석을 통한 차원 축소는 오히려 군집의 구조를 가릴 수 있다. 이에 따라 군집분석과 차원 축소를 동시에 진행하는 방법들이 제안되어 왔다. 그 중에서도 본 연구에서는 De Soete와 Carroll (1994)이 제안한 방법론을 확률적인 모형으로 바꿔 군집분석을 진행하는 확률적 reduced K-means를 제안한다. 모의실험 결과 차원 축소를 배제한 군집분석과 Tandem 군집분석보다 더 좋은 군집을 형성함을 알 수 있었고 군집 당 표본 크기에 비해 변수의 개수가 많은 자료에서 기존의 비 확률적 reduced K-means 군집분석에 비해 우수한 성능을 확인했다. 보스턴 자료에서는 다른 군집분석 방법론보다 명확한 군집이 형성됨을 확인했다.

이동통신망에서 예측 위치 등록 정책을 통한 위치관리 비용 감소 효과 분석 (An Analysis of Location Management Cost by Predictive Location Update Policy in Mobile Cellular Networks)

  • 고한성;장인갑;홍정식;이창훈
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2007년도 추계학술대회 및 정기총회
    • /
    • pp.388-394
    • /
    • 2007
  • In wireless network, we propose a predictive location update scheme which considers mobile user's(MU's) mobility patterns. MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

  • PDF

측정데이터의 효율적 감소를 위한 De Iaunay 삼각형 분할의 적용 (Delaunay triangulation for efficient reduction of measured point data)

  • 허성민;김호찬;이석희
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2001년도 춘계학술대회 논문집
    • /
    • pp.53-56
    • /
    • 2001
  • Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and it includes some steps such as scanning of a clay or wood model, and generating some manufacturing data in an STL file. A new approach to remove point data with Delaunay triangulation is introduced to deal with the size problems of STL file and the difficulties in the operation of RP process. This approach can be used to reduce a number of measuring data from laser scanner within a specified tolerance, thus it can avoid the time for handing point data during modeling process and the time for verifying and slicing STL model during RP process. Developed software enables the user to specify the criteria for the selection of group of triangles either by the angle between triangles or the percentage of triangles reduced, and thus RP models with accuracy will be helpful to automated process.

  • PDF