• 제목/요약/키워드: Set time

검색결과 7,861건 처리시간 0.03초

형재 절단금형 개발에 관한 연구 (Development of a Channel Cutting Die Set)

  • 박귀선;이춘만
    • 한국정밀공학회지
    • /
    • 제18권1호
    • /
    • pp.117-122
    • /
    • 2001
  • Many kinds of channels are used in industrial equipment and production machinery. Although mechanical saw has been used to cut many sorts of channels, there is cost rise problem because of low productivity. Shearing of channel has a special place because it helps to cut expected shape and size easily. A channel cutting die set which can be mounted and used on a hydraulic press is developed to improve the productivity of channel cutting process. Mode for the channel cutting is divided into single cut and double cut method. This study use double cut method, and the developed channel cutting die set is composed of upper and lower die set. Shearing time can be reduced from 40 minutes to 20 seconds using the developed channel cutting die set. The productivity of channel cutting process can be increased with shearing time reduction as well as cost reduction.

  • PDF

실시간 공격 탐지를 위한 Pearson 상관계수 기반 특징 집합 선택 방법 (A Feature Set Selection Approach Based on Pearson Correlation Coefficient for Real Time Attack Detection)

  • 강승호;정인선;임형석
    • 융합보안논문지
    • /
    • 제18권5_1호
    • /
    • pp.59-66
    • /
    • 2018
  • 기계학습을 이용하는 침입 탐지 시스템의 성능은 특징 집합의 구성과 크기에 크게 좌우된다. 탐지율과 같은 시스템의 탐지 정확도는 특징 집합의 구성에, 학습 및 탐지 시간은 특징 집합의 크기에 의존한다. 따라서 즉각적인 대응이 필수인 침입 탐지 시스템의 실시간 탐지가 가능하도록 하려면, 특징 집합은 크기가 작으면서도 적절한 특징들로 구성하여야 한다. 본 논문은 실시간 탐지를 위한 특징 집합 선택 문제를 해결하기 위해 사용했던 기존의 다목적 유전자 알고리즘에 특징 간의 Pearson 상관계수를 함께 사용하면 탐지율을 거의 낮추지 않으면서도 특징 집합의 크기를 줄일 수 있음을 보인다. 제안한 방법의 성능평가를 위해 NSL_KDD 데이터를 사용하여 10가지 공격 유형과 정상적인 트래픽을 구별하도록 인공신경망을 설계, 구현하여 실험한다.

  • PDF

An Integer Programming-based Local Search for the Set Partitioning Problem

  • Hwang, Junha
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권9호
    • /
    • pp.21-29
    • /
    • 2015
  • The set partitioning problem is a well-known NP-hard combinatorial optimization problem, and it is formulated as an integer programming model. This paper proposes an Integer Programming-based Local Search for solving the set partitioning problem. The key point is to solve the set partitioning problem as the set covering problem. First, an initial solution is generated by a simple heuristic for the set covering problem, and then the solution is set as the current solution. Next, the following process is repeated. The original set covering problem is reduced based on the current solution, and the reduced problem is solved by Integer Programming which includes a specific element in the objective function to derive the solution for the set partitioning problem. Experimental results on a set of OR-Library instances show that the proposed algorithm outperforms pure integer programming as well as the existing heuristic algorithms both in solution quality and time.

네트워크 시간 동기화를 활용한 효과적 셋톱박스 시스템 복구 방안에 관한 연구 (A study on the Set-top Box System Recovery using Network Time Synchronization)

  • 한경식;김인기;민태훈;손승일
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2013년도 춘계학술대회
    • /
    • pp.647-649
    • /
    • 2013
  • 본 논문은 안드로이드 기반의 고정된 네트워크 하드웨어를 가진 셋톱박스에서 Network Time Protocol(NTP)을 활용한 효과적 시스템 복구 방안에 관한 연구이다. 셋톱박스의 경우 제품의 특성상 사용자의 요구에 대한 대응이 여타 전자제품에 비해 빠르게 반응해야 하기 때문에 항시 전원이 공급되어 동작하는 특징을 가진다. 하지만, 안드로이드와 같은 범용 OS기반의 셋톱박스의 경우 주기적인 시스템 리셋을 통한 캐쉬 및 메모리 초기화가 불가피한 단점이 있다. 본 논문은 이러한 문제점을 개선하기 위해 시스템의 시간을 가져오는 NTP 클라이언트 프로그램을 활용하여 시스템 리셋하고, 복구하도록 하였다.

  • PDF

차세대 CPU를 위한 캐시 메모리 시스템 설계 (Design of Cache Memory System for Next Generation CPU)

  • 조옥래;이정훈
    • 대한임베디드공학회논문지
    • /
    • 제11권6호
    • /
    • pp.353-359
    • /
    • 2016
  • In this paper, we propose a high performance L1 cache structure for the high clock CPU. The proposed cache memory consists of three parts, i.e., a direct-mapped cache to support fast access time, a two-way set associative buffer to reduce miss ratio, and a way-select table. The most recently accessed data is stored in the direct-mapped cache. If a data has a high probability of a repeated reference, when the data is replaced from the direct-mapped cache, the data is stored into the two-way set associative buffer. For the high performance and fast access time, we propose an one way among two ways set associative buffer is selectively accessed based on the way-select table (WST). According to simulation results, access time can be reduced by about 7% and 40% comparing with a direct cache and Intel i7-6700 with two times more space respectively.

구미시내 긴급차량의 도달시간 산정을 위한 Network해석 (Network Analysis for Estimating Reach Time of Emergency Vehicles in Gumi City)

  • 이진덕;박민철;박희영;강소희
    • 한국측량학회:학술대회논문집
    • /
    • 한국측량학회 2010년 춘계학술발표회 논문집
    • /
    • pp.363-365
    • /
    • 2010
  • In this study, based on numerical map GIS-T Dataset build and by using ArcGIS Network Analysis emergency vehicle's reach time were analyzed. AutoCad using 1: 50,000 based on roads and hospitals of numerical map were creating a Polyline and Point and Network Dataset made using ArcCatalog. ArcGIS Analysis setting the interval for the period reached 3 minutes, 5 minutes, 15 minutes was set and then U-Turn was set to not allow because U-turn takes a long time to calculate and does not happen often on the real road. Intersection of the passage of time, considering that the emergency vehicles were set to 3 seconds. To expand by taking advantage of this facility on Vulnerable area will be used as base material. If we focus on analyzing the emergency activity to convert little data, To prepare for disaster and disaster will be able to use the materials.

  • PDF

Airline In-flight Meal Demand Forecasting with Neural Networks and Time Series Models

  • Lee, Young-Chan
    • 한국정보시스템학회:학술대회논문집
    • /
    • 한국정보시스템학회 2000년도 추계학술대회
    • /
    • pp.36-44
    • /
    • 2000
  • The purpose of this study is to introduce a more efficient forecasting technique, which could help result the reduction of cost in removing the waste of airline in-flight meals. We will use a neural network approach known to many researchers as the “Outstanding Forecasting Technique”. We employed a multi-layer perceptron neural network using a backpropagation algorithm. We also suggested using other related information to improve the forecasting performances of neural networks. We divided the data into three sets, which are training data set, cross validation data set, and test data set. Time lag variables are still employed in our model according to the general view of time series forecasting. We measured the accuracy of our model by “Mean Square Error”(MSE). The suggested model proved most excellent in serving economy class in-flight meals. Forecasting the exact amount of meals needed for each airline could reduce the waste of meals and therefore, lead to the reduction of cost. Better yet, it could enhance the cost competition of each airline, keep the schedules on time, and lead to better service.

  • PDF

A preparatory study on fish behavioral properties in a set-net

  • KANG, Myounghee;LIU, Jenming;HASSAN, Raja Bidin bin Raja;FAJARYANTI, Rina;HWANG, Bokyu
    • 수산해양기술연구
    • /
    • 제56권2호
    • /
    • pp.105-113
    • /
    • 2020
  • The fish influx and behavioral properties at a set-net off Goseong, South Korea were investigated using an imaging sonar. As a result, the average influx of fish was 33.9% at day time and 66.1% at night time, respectively, which indicated that a majority of fish entered into a playground in the set-net at night. The fish behavioral properties such as target (fish) length, range, orientation and major-axis angle were examined and compared among survey dates (4, 5, and 6 June 2019) using the statistical analysis tool (analysis of variance, ANOVA). The behavioral properties presented differently sometime of survey dates. This is preparatory study to support fish behavior properties in a set-net. It is expected that more elaborated behavioral information of fishes in the set-net is beneficial for designing and deploying a set-net fishing gear as well as general fish behavior research in the future.

Adaptive Standby Mode Scheduling Method Based on Analysis of Activation Pattern for Improving User Experience of Low-Power Set-Top Boxes

  • Park, Hyunho;Kim, Junghak;Jung, Eui-Suk;Lee, Hyunwoo;Lee, Yong-Tae
    • ETRI Journal
    • /
    • 제38권5호
    • /
    • pp.885-895
    • /
    • 2016
  • The lowest power mode (passive-standby mode) was proposed for reducing the power consumption of set-top boxes in a standby state when not receiving content. However, low-power set-top boxes equipped with the lowest power mode have been rarely commercialized because of their low-quality user experience. In the lowest power mode, they deactivates almost all of operational modules and processes, and thus require dozens of seconds for activation latency (that is, the latency for activating all modules of the set-top boxes in a standby state). They are not even updated in a standby state because they deactivate their network interfaces in a standby state. This paper proposes an adaptive standby mode scheduling method for improving the user experience of such boxes. Set-top boxes using the proposed method can analyze the activation pattern and find the frequently used time period (that is, when the set-top boxes are frequently activated). They prepare for their activation during this frequently used time period, thereby reducing the activation latency and enabling their update in a standby state.

OBTAINING WEAKER FORM OF CLOSED SETS IN TOPOLOGICAL SPACE USING PYTHON PROGRAM

  • Prabu, M. Vivek;Rahini, M.
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제29권1호
    • /
    • pp.93-102
    • /
    • 2022
  • The impact of programming languages in the research sector has helped lot of researchers to broaden their view and extend their work without any limitation. More importantly, even the complex problems can be solved in no matter of time while converting them into a programming language. This convenience provides upper hand for the researchers as it places them in a comfort zone where they can work without much stress. With this context, we have converted the research problems in Topology into programming language with the help of Python. In this paper, we have developed a Python program to find the weaker form of closed sets namely alpha closed set, semi closed set, pre closed set, beta closed set and regular closed set.