• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1995.04a
• /
• pp.153-158
• /
• 1995

보 및 평판의 진동에 대해서 에너지의 손실은 재료감쇠를 이용한 표면감쇠처리나 지지부에서의 감쇠처리에 의하여 증가될 수 있다. 감쇠재료를 이용한 표면감쇠처리의 예로서 보/평판 표면에 접착되는 감쇠 테이프나 코팅등은 아주 효과적임이 입증되었다. 마찬가지로 지지부 감쇠처리는 점탄성재료의 삽입에 의해서 설명될수 있다[1]. 보/평판의 감쇠에 대한 최근의 많은 연구들은 진동하고 있는 보/평판의 표면에 적용하는 감쇠 테이프 혹은 적층형태의 감쇠 처리방법에 대해서 주로 수행되었다. 일반적으로 표면감쇠처리방법은 진동감소에 아주 효과적이지만 실제 적용상에서 항상 가능한 것은 아니며, 이와 같은 경웨는 지지부 감쇠 처리방법에 의존하게 된다[2]. 감쇠특성을 갖는 점탄성재료를 실제로 적용할 때 보/평판의 유한한 길이가 점탄성재료로 지지되며 점탄성재료의 물성치와 치수에 따라서 계의 모우드 매개변수(고유진동수, 계의 손실계수 그리고 모우드형상)가 크게 달라진다. 그리고 이와 같은 계에 대해서는 지지부의 거동보다는 전체 시스템의 고유진동수와 손실계수 그리고 보 영역에서의 모우드 형상에 더 관심이 있으므로 지지부 영역을 집중매개변수(lumped parameter)로 나타내어 계를 해석할 수 있다. 일반적으로 보와 평판의 경계에서는 병진 및 회전방향의 강성 뿐만 아니라 두 강성사이에 연성효과도 동시에 발생하게 되므로 이 항을 고려하여 계를 모델링해야 한다. 본 연구에서는 우선 점탄성 재료에 의한 지지부영역의 등가 강성계수들을 구하고 경계에 강성행렬을 갖는 보의 등가시스템을 얻는다. 그리고 등가시스템의 주파수방정식으로부터 모우드 매개변수에 대한 지지부의 영향을 살펴본다. 또한 시스템이 비교적 복잡한 사각 평판의 진동에 대해서도 동강성행렬법(dynamic stiffness matrix method)을 이용하여 해석하고자 한다. 수준임이 입증되었다. 본 연구의 결과를 토대로우리나라 젊고 건강한 남성에게 적합한 무게상수는 작업자군에 대하여 25.05kg, 학생군에 대하여 20.24kg 으로 나타나 이는 미국 NIOSH 안전기준과 대체로 일치함을 발견하였다.ive structures utilized in Client/server architecture for distribution and cooperative processing of application between server and client this study presents two different data management methods under the Client/server environment; one is "Remote Data Management Method" which uses file server or database server and. the other is "Distributed Data Management Method" using distributed database management system. The result of this study leads to the conclusion that in the client/server environment although distributed application is assumed, the data could become centralized (in the case of file server or database server) or decentralized (in the case of distributed database system) and the data management method through a distributed database system where complete responsi

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.54-62
• /
• 2015

Although NAND flash-based SSD (Solid-State Drive) provides superior performance in comparison to HDD (Hard Disk Drive), it has a major drawback in write endurance. As a result, the lifetime of SSD is determined by the workload and thus it becomes a big challenge in current technology trend of such as the shifting from SLC (Single Level Cell) to MLC (Multi Level cell) and even TLC (Triple Level Cell). Most previous studies have dealt with wear-leveling or improving SSD lifetime regarding hardware architecture. In this paper, we propose the optimal configuration of host I/O stack focusing on file system, I/O scheduler, and link power management using JEDEC enterprise workloads in terms of WAF (Write Amplification Factor) which represents the efficiency perspective of SSD life time especially for host write processing into flash memory. Experimental analysis shows that the optimum configuration of I/O stack for the perspective of SSD lifetime is MinPower-Dead-XFS which prolongs the lifetime of SSD approximately 2.6 times in comparison with MaxPower-Cfq-Ext4, the best performance combination. Though the performance was reduced by 13%, this contributions demonstrates a considerable aspect of SSD lifetime in relation to I/O stack optimization.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.12
• /
• pp.29-40
• /
• 2008

The efficient hardware design of finite field multiplication is an very important research topic for and efficient $f(x)=x^n+x^k+1$ implementation of cryptosystem based on arithmetic in finite field GF($2^n$). We used special generating trinomial to construct a bit-parallel multiplier over finite field with low space complexity. To reduce processing time, The hardware architecture of proposed multiplier is similar with existing Mastrovito multiplier. The complexity of proposed multiplier is depend on the degree of intermediate term $x^k$ and the space complexity of the new multiplier is $2k^2-2k+1$ lower than existing multiplier's. The time complexity of the proposed multiplier is equal to that of existing multiplier or increased to $1T_X(10%{\sim}12.5%$) but space complexity is reduced to maximum 25%.

• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.98-108
• /
• 1998

In the multimedia tele-medical system the medical informations are stored and managed in multimedia database. Also, multimedia DBMS is essential in order to manage large scale medical informations, and the remote access function is necessary for the distributed processing at all around the hospital. For the multimedia tele-medical information that is composed of image/picture, data, video, and audio, a high-speed telecommunication network is necessary that can provide separated connections for each medical information type with different QoS. The commercial DBMSs are based on the TCP/IP socket API(Application Programming Interface) that does not provide multiple QoS. Also, each commercial DBMS has its own API that is incompatible with other DBMS. In this paper, we propose a multimedia DBMS agent for the remote access of the multimedia database in the tele-medical system. The proposed multimedia DBMS agent is based on the ATM API that can provide high-speed data transfer capability and multiple QoS connections. Also, the proposed multimedia DBMS agent is independent of the commercial DBMS. We explain the functional architecture of the multimedia DBMS agent, implementation technology on the ATM network environment, and the result of performance analysis.

• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.695-706
• /
• 2012

The purpose of this paper is to propose a service system for a digital hologram video, which has not been published yet. This system assumes the existing service frame for 2-dimensional or 3-dimensional image/video, which includes data acquisition, processing, transmission, reception, and reconstruction. This system also includes the function to service the digital hologram at the viewer's view point by tracking the viewer's face. For this function, the image information at the virtual view point corresponding to the viewer's view point is generated to get the corresponding hologram. Here in this paper, only a prototype that includes major functions of it is implemented, which includes camera system for data acquisition, camera calibration and image rectification, depth/intensity image enhancement, intermediate view generation, digital hologram generation, and holographic image reconstruction by both simulation and optical apparatus. The proposed prototype system was implemented and the result showed that it takes about 352ms to generate one frame of digital hologram and reconstruct the image by simulation, or 183ms to reconstruct image by optical apparatus instead of simulation.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1105-1112
• /
• 2002

Nowadays the information exchange based on XML such as B2B electronic commerce is spreading. Therefore a systematic and stable management mechanism for storing the exchanged information is needed. For this goal there are many research activities for concerning the connection between XML application and relational databases. But because XML data has hierarchical structure and relational databases can store only flat-structured data, we need to make a conversion rule which changes the hierarchical architecture to a 2-dimensional format. Accordingly the modeling methodology for storing such structured information in relational databases is needed. In order to build good quality application systems, modeling is an important first step. In 1997, the OMG adopted the UML as its standard modeling language. Since industry has warmly embraced UML, its popularity should become more important in the future. So a design methodology based on UML is needed to develop efficient XML applications. In this paper, we propose a unified design methodology for XML applications based on relational database using UML. To reach these goals, first we introduce a XML modeling methodology to design W3C XML schema using UML and second we propose data modeling methodology for relational database schema to store XML data efficiently in relational databases.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.180-192
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.889-900
• /
• 2006

Even though sensor networks are different in user requests and data characteristics depending on each application area, the existing researches on stream data transmission problem focus on the performance improvement of their methods rather than considering the original characteristic of stream data. In this paper, we introduce a hierarchical or distributed sensor network architecture and data model, and then evaluate the multivariate data reduction methods suitable for user requirements and data features so as to apply reduction methods alternatively. To assess the relative performance of the proposed multivariate data reduction methods, we used the conventional techniques, such as Wavelet, HCL(Hierarchical Clustering), Sampling and SVD (Singular Value Decomposition) as well as the experimental data sets, such as multivariate time series, synthetic data and robot execution failure data. The experimental results shows that SVD and Sampling method are superior to Wavelet and HCL ia respect to the relative error ratio and execution time. Especially, since relative error ratio of each data reduction method is different according to data characteristic, it shows a good performance using the selective data reduction method for the experimental data set. The findings reported in this paper can serve as a useful guideline for sensor network application design and construction including multivariate stream data.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.85-100
• /
• 2003

Today's computing system has expanded its application to business trade and distributed work transactions using the Internet. As the demand for more flexible, adaptable, extensible, and robust web-based enterprise, these application development has been gradually expanded based on reusable, independent, and portable components. Component Based Development (CBD) works by developing and evolving software from selected reusable software components and then assembling them within appropriate software architecture. However, it requires an increase in cost to build new components as well as the necessary effort to develop of the business requirement these components. Standardized component models are required as well from the perspective of systems in order to support rapid and exact component information transmission on the web. In this paper, we describe the e-Business Component Development with agent for rapid application development on the web that correspond to the demands of users in the business domain. We design and implement the specifications of e-business components by combining these demands. In order to improve the agent register and retrieval, we propose the intelligent search and register agents, which can conduct more precise searching and specializing for components. The system enables the locating of user's frequently used components through an agent involving register and retrieval, as well as rapid procedures for registers The e-BCOS (e-Business Component System) is the agent system for the user to register distributed components and to search for components Information. The e-BCOS increases reusability through the e-business component development of distributed components in the business domain. For the share and delivery, specification with XML is acceptable to user's variable order e-BCOS Includes the effective investment, timeliness, reliability, efficiency, and maintenance effort by with agent.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.319-326
• /
• 2004

To help network intrusion detection systems(NIDSs) keep up with the demands of today's networks, that we the increasing network throughput and amount of attacks, a radical new approach in hardware and software system architecture is required. In this paper, we propose a Network Processor(NP) based In-Line mode NIDS that supports the packet payload inspection detecting the malicious behaviors, as well as the packet filtering and the traffic metering. In particular, we separate the filtering and metering functions from the deep packet inspection function using two-level searching scheme, thus the complicated and time-consuming operation of the deep packet inspection function does not hinder or flop the basic operations of the In-line mode system. From a proto-type NP-based NIDS implemented at a PC platform with an x86 processor running Linux, two Gigabit Ethernet ports, and 2.5Gbps Agere PayloadPlus(APP) NP solution, the experiment results show that our proposed scheme can reliably filter and meter the full traffic of two gigabit ports at the first level even though it can inspect the packet payload up to 320 Mbps in real-time at the second level, which can be compared to the performance of general-purpose processor based Inspection. However, the simulation results show that the deep packet searching is also possible up to 2Gbps in wire speed when we adopt 10Gbps APP solution.