• Title/Summary/Keyword: Data Packing

Search Result 227, Processing Time 0.021 seconds

Actuator Control based on Interconnected Heterogeneous Networks (이종 통신망에 연결된 네트워크 기반 액추에이터 제어)

  • Kim, Nayeon;Moon, Chanwoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.57-62
    • /
    • 2017
  • Recently, the use of electronic control units in vehicle has increased. The ECUs are connected to in vehicle networks to process a large amount of information. In this paper, for an actuator that is interconnected to CAN and FlexRay, a FlexRay-CAN gateway is presented and a data packing algorithm with a bisection method of a FlexRay slot is proposed. And, a network based actuator control system and packing map is implemented. With the proposed packing method, contact force sensor data are transferred within the maximum allowed delay to ensure the stability. The proposed method is useful for control of distributed system.

Development and evaluation of edge devices for injection molding monitoring (사출성형공정 모니터링용 엣지 디바이스 개발 및 평가)

  • Kim, Jong-Sun;Lee, Jun-Han
    • Design & Manufacturing
    • /
    • v.14 no.4
    • /
    • pp.25-39
    • /
    • 2020
  • In this study, an edge device that monitors the injection molding process by measuring the mold vibration(acceleration) signal and the mold surface temperature was developed and evaluated its performance. During injection molding, signals of the injection start, V/P switchover, and packing end sections were obtained through the measurement of the mold vibration and the injection time and packing time were calculated by using the difference between the times of the sections. Then, the mold closed and mold open signals were obtained using a magnetic hall sensor, and cycle time was calculated by using the time difference between the mold closed time each process. As a result of evaluating the performance by comparing the process data monitored by the edge device with the shot data recorded on the injection molding machine, the cycle time, injection time, and packing time showed very small error of 0.70±0.38%, 1.40±1.17%, and 0.69±0.82%, respectively, and the values close to the actual were monitored and the accuracy and reliability of the edge device were confirmed. In addition, it was confirmed that the mold surface temperature measured by the edge device was similar to the actual mold surface temperature.

Modeling reaction injection molding process of phenol-formaldehyde resin filled with wood dust

  • Lee, Jae-Wook;Kwon, Young-Don;Leonov, A.I.
    • Korea-Australia Rheology Journal
    • /
    • v.20 no.2
    • /
    • pp.59-63
    • /
    • 2008
  • A theoretical model was developed to describe the flow behavior of a filled polymer in the packing stage of reaction injection molding and predict the residual stress distribution of thin injection-molded parts. The model predictions were compared with experiments performed for phenol-formaldehyde resin filled with wood dust and cured by urotropine. The packing stage of reaction injection molding process presents a typical example of complex non-isothermal flow combined with chemical reaction. It is shown that the time evolution of pressure distribution along the mold cavity that determines the residual stress in the final product can be described by a single 1D partial differential equation (PDE) if the rheological behavior of reacting liquid is simplistically described by the power-law approach with some approximations made for describing cure reaction and non-isothermality. In the formulation, the dimensionless time variable is defined in such a way that it includes all necessary information on the cure reaction history. Employing the routine separation of variables made possible to obtain the analytical solution for the nonlinear PDE under specific initial condition. It is shown that direct numerical solution of the PDE exactly coincides with the analytical solution. With the use of the power-law approximation that describes highly shear thinning behavior, the theoretical calculations significantly deviate from the experimental data. Bearing in mind that in the packing stage the flow is extremely slow, we employed in our theory the Newtonian law for flow of reacting liquid and described well enough the experimental data on evolution of pressure.

Permeability of Viscous Flow Through Packed Bed of Bidisperse Hard Spheres (이분산 구형 입자로 구성된 충전층을 흐르는 점성 유체 흐름의 투과도)

  • Sohn, Hyunjin;Koo, Sangkyun
    • Korean Chemical Engineering Research
    • /
    • v.50 no.1
    • /
    • pp.66-71
    • /
    • 2012
  • We deal with a problem to determine experimentally as well as theoretically permeability of incompressible viscous flow through packed bed of bidisperse hard spheres in size. For the size ratios of large to small spheres ${\lambda}$=1.25 and 2, we set up bidisperse packing and measured porosity and permeability at various volumetric ratios of small to large spheres ${\gamma}$. Bidisperse packing shows lower porosity and permeability than monodisperse packing does. Variation of porosity as a function of ${\gamma}$ does not match with that of permeability. A theoretical expression for predicting permeability of a viscous flow for packed bed of bidisperse packing is derived based on calculation of drag force acting on each sphere and its predictions are compared with the experimental data and those from some relations previously suggested. It is found that our theory shows better agreement with experimental results than the previous studies and is proved to be quite simple and accurate in estimating the permeability.

Reliable Dynamic TDMA Scheme with new Packing method for Image Transmission over Link-16 (Link-16에서 이미지 전송을 위한 신뢰성 기반의 동적 TDMA 기법과 새로운 패킹 방법)

  • Baek, Hoki;Lim, Jaesung;Koo, Jayeul;Jin, Jeonghwan;Chun, Philseong;Oh, Ilhyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1045-1053
    • /
    • 2012
  • Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

Implementation of ETI Adapter for Multimedia Service based on T-DMB (지상파 DMB 기반 멀티미디어 서비스용 ETI 어댑터 구현)

  • Lee, Hyung
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.2
    • /
    • pp.60-66
    • /
    • 2009
  • In this paper, implementation of an ensemble transport interface (ETI) adapter for multimedia services based on terrestrial-digital multimedia broadcasting (T-DMB) is introduced. In general, ETI adapter should manipulate three functions: receiving packets packing multimedia data from service providers, configuring an ETI frame (G.703) from these data, and transmitting these frames to T-DMB multiplexer. To achieve these roles, the proposed ETI adapter consists of the network management module for data transmission and flow control between service providers and this adapter, the ETI configuration module for gathering data and then making ETI frames, and the hardware board for pushing ETI frames in real-time. The proposed adapter yielded faithful results without data lose on transmitting ETI frames to T-DMB multiplexer in the range of $64{\sim}1,153kbps$ specified in ETSI EN 300 401 after packing multimedia data received via Internet.

Hop-constrained multicast route packing with bandwidth reservation

  • Gang Jang Ha;Park Seong Su
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.402-408
    • /
    • 2002
  • Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

  • PDF

PDO Packing Mechanism for Reducing CANopen Network Utilization (CANopen 네트워크 이용률 감소를 위한 PDO 패킹 메커니즘)

  • Kang, Min-Koo;Park, Kie-Jin;Kim, Jong-Cheol
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.2
    • /
    • pp.124-133
    • /
    • 2009
  • CANopen which is one of the in-vehicle network (IVN) protocols is adopted to solve the hardware dependency problem of the CAN-based application. CANopen makes different CAN devices interoperable each others. By the advantage of the device profiling concept, it can make the period of developing CAN-based application system shorten. The utilization of CANopen network must be reduced to improve the communication performance (e.g. worst-case response time). For reducing network utilization, messages need to be packed as many as possible so that message frame overhead can be decreased. In this paper, we suggested a PDO packing mechanism using object dictionary (OD) and process data object (PDO) communication service in CANopen. Through experiments, the performance of the mechanism is evaluated with SAE benchmark. As a result, network utilization is decreased about 10% compared to the result of the previous works.

Algorithm for Block Packing of Main Memory Allocation Problem (주기억장치 할당 문제의 블록 채우기 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.6
    • /
    • pp.99-105
    • /
    • 2022
  • This paper deals with the problem of appropriately allocating multiple processors arriving at the ready queue to the block in the user space of the main memory is divided into blocks of variable size at compilation time. The existing allocation methods, first fit(FF), best fit(BF), worst fit(WF), and next fit(NF) methods, had the disadvantage of waiting for a specific processor because they failed to allocate all processors arriving at the ready queue. The proposed algorithm in this paper is a simple block packing algorithm that allocates as many processors as possible to the largest block by sorting the size of the partitioned blocks(holes) and the size of the processor in the ready queue in descending order. The application of the proposed algorithm to nine benchmarking experimental data showed the performance of allocating all processors while having minimal internal fragment(IF) for all eight data except one data in which the weiting processor occurs due to partition errors.

An Empirical Study on Debt Financing of Family Firms : Focused on Packing Order Theory (가족기업의 부채조달에 관한 실증연구 : 자본조달순위이론을 중심으로)

  • Jung, Mingeu;Kim, Dongwook;Kim, Byounggon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.3
    • /
    • pp.337-345
    • /
    • 2018
  • The purpose of this study is to analyze the relationship between the characteristics of Korean family firms and the impact of debt financing. The analysis period was 10 years from 2004 to 2013, and the sample consisted of 4,008 non-financial firms listed on the Korea Exchange. For the analysis, the unbalanced panel data with time - series, cross - section data were formed and analyzed using panel data regression analysis. The results are as follows. First, Korean family firms use relatively less debt than non - family firms. It can be understood that family firms in which the dominant family owns and dominates the corporation are less likely to increase their debt because the agent problem is alleviated and the need for the control effect of Jensen (1986) is lowered. Second, in the verification of the packing order theory using the model proposed by Shyam-Sunder and Myers (1999), family firms have higher compliance with the packing order theory than non-family firms do. When financing is needed, debt is preferred over equity issuance. However, for Korean family firms, 24.38% of the deficit funds are financed through the issuance of net debt, which is relatively low compared to the 75% shown in the analysis of Shyam-Sunder and Myers (1999). These results reveal the limit to the strong claim that the Korean family firms follow the packing order theory.