• Proceedings of the IEEK Conference
• /
• 2001.10a
• /
• pp.664-667
• /
• 2001

Segregation of binary particle systems in a horizontally gyrated bed has been experimentally studied to recover the heavy metals from municipal waste incineration (MWI) ash. Differences in density and size had less effect on segregation. Effective segregation took place under the centrifugal effect of 1 or less for any particle size ratio. Zn, Cu and Pb were concentrated in the upper side of bed by the horizontal vibration. However, there was less change in concentration for other metals such as Mg, Al and Fe etc. The separation system with the horizontal gyrating separator proved to be an effective method for the pretreatment of recovering Zn, Cu and Pb from incineration residues.

• Journal of the Korean Society of Costume
• /
• v.56 no.1 s.100
• /
• pp.106-120
• /
• 2006

Using aesthetics of Rosencranz as the basis, this study contains the peculiarities of 'ugliness' and the obscured conceptual meaning of 'avant-garde', 'grotesque', and 'decadence' that are being utilized under ambiguous significance are defined through modern fashion and fashion of online game characters. Forms of 'ugliness' expressed in modern fashion and in games characters display distortion of form through incongruity, unbalance, disproportion and disharmony, and with this lack of form and expressional imprecision, both contain the elements of comical characteristics of vulgarity and repugnance. The difference in 'ugliness' between modern fashion and game character fashion is, the significance of 'ugliness' being expressed in modern fashion challenges new concepts by refusing tradition and recovering the human nature that has become turbid. On the other hand, 'ugliness' in game character fashion complements the story of the game that uses legends, fantasies or novels as its basis. Opposed to the significance of recovering human nature that is displayed in modern fashion, in order to terminate the opposing game character, the fashion of game characters exaggerates the form of modern fashion with added brutality. In addition, with the advantage of virtual reality that allows a more flexible expression than in the real word, images created are more sensational and excessive use of grotesque images are being expressed.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.176-184
• /
• 1998

We present a sequential factorization method using singular value decomposition (SVD) for recovering both the three-dimensional shape of an object and the motion of camera from a sequence of images. We employ paraperpective projection [6] for camera model to handle significant translational motion toward the camera or across the image. The proposed mthod not only quickly gives robust and accurate results, but also provides results at each frame becauseit is a sequential method. These properties make our method practically applicable to real time applications. Considerable research has been devoted to the problem of recovering motion and shape of object from image [2] [3] [4] [5] [6] [7] [8] [9]. Among many different approaches, we adopt a factorization method using SVD because of its robustness and computational efficiency. The factorization method based on batch-type computation, originally proposed by Tomasi and Kanade [1] proposed the feature trajectory information using singular value decomposition (SVD). Morita and Kanade [10] have extenened [1] to asequential type solution. However, Both methods used an orthographic projection and they cannot be applied to image sequences containing significant translational motion toward the camera or across the image. Poleman and Kanade [11] have developed a batch-type factorization method using paraperspective camera model is a sueful technique, the method cannot be employed for real-time applications because it is based on batch-type computation. This work presents a sequential factorization methodusing SVD for paraperspective projection. Initial experimental results show that the performance of our method is almost equivalent to that of [11] although it is sequential.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.574-575
• /
• 2021

Re-manufacturing is the process of recovering the function and performance of the original product through a re-assembly process such as a new product assembly process after reprocessing by recovering used products or parts that are in the disposal stage at the end of their lifespan. One of the manufacturing methods. The remanufacturing industry is important not only in terms of environmental protection, but also in terms of economics. The success or failure of the industry as a whole depends on trust in products and price competitiveness. Image processing systems are used to reduce labor costs and improve product reliability in the product manufacturing process. In this study, foreign substances and defects that are difficult to identify with the human eye are detected by using the pre-processing step of determining whether to recycle the drum and image processing immediately before shipment after regenerating the drum to regenerate the waste drum.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.214-216
• /
• 2002

UDP를 이용하는 멀티캐스트에 있어서 에러 복구는 서비스의 신뢰성을 위해 반드시 필요한 알고리즘이다. 본 논문에서는 기존 라우터 기반의 에러 복구(Router-Assisted Schemes)알고리즘을 이용해서 라우터에 의한 에러 복구의 효율성이 증가하도록 하였다. 본 논문에서는 USC／ISI에서 개발한 네트워크 시뮬레이터인 NS-2를 이용하여 에러 복구 기능을 구현하였다. 또한 시뮬레이션을 통해 라우터에 멀티캐스트 에러 복구 방식이 적용되었을 경우, 기존의 에러 복구 방식의 효율성 향상이 가능함을 보이려 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.832-834
• /
• 2004

미래의 인터넷이 저속 네트워크에서 고속 네트워크로 그 특성이 변하고 있음에 반해 비교적 저속 네트워크에 최적화된 TCP의 성능 개선은 이루어지지 않고 있어 이래 인터넷에서 TCP의 효율적인 동작을 보장하기 어려운 실정이다. 이를 위해 본 논문에서는 기존 AIMD 메커니즘을 수정한 HSTCP와 네트워크로부터 명확한 피드백을 요하는 새로운 프로토콜인 XCP에 대해 살펴보고 고속 네트워크에 적합한 개선된 HSTCP 메커니즘을 제안한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.405-415
• /
• 2020

With the increase in smartphone user, mobile forensics has become an essential element in modern digital forensic investigation. Mobile messenger data is very important data in mobile forensics because it can acquire information such as user's life pattern and mental state. In order to analyze messenger data, a decryption technique of an encrypted messenger data is required. Since most messengers provide a message deleting function, a technique for recovering deleted messages is required. WeChat Messenger, a messenger used by about 1 billion people around the world, uses IMEI (International Mobile Equipment Identity) information to encrypt data and provides message deletion function. In this paper, we propose a data decryption method in the absence of IMEI information and propose a method for recovering deleted messages using FTS (Full Text Search) database created for full-text search function of SQLite database.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.956-966
• /
• 2004

Nowadays, NGN(Next Generation Network) is evolving into network with packet based QoS.\ulcorner This paper presents the recovery method as a selecting way of more efficient path in MPLS network that reduces the service interruption time. In order to increase the efficiency of usage of recovering resource which is one of major functions of disorder recovering, it opens the state information of each Node both to fault detector and bandwidth broker so that it reduces message transmission time for recovery when functional disorder occurs. in addition, by effective management and adjustment of required bandwidth of entire network depending on the changes of traffic load, it improves the efficiency of bandwidth usage. and in MPLS network supporting priority selection function, it allocates domains depending on the traffic relating to priority order to the entire network so that\ulcorner it efficiently allocates proper resources to the restoring process between the entry and the end for the traffic of high priority and for low priority traffic, it restores path oかy inside disordered domain. by doing this, it reduces resetting time and unnecessary massage transmission.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.199-204
• /
• 2006

The kernel hardening function is necessary in terms of kernel stability to reduce the system error or panic due to the kernel code error that is made by program developer. But, the traditional kernel hardening method is difficult to implement and consuming high cost. The suggested kernel hardening function that makes high availability system by changing the panic() function of inside kernel code guarantees normal system operation by recovering the incorrect address of the kernel stack frame. We experimented the kernel hardening function at the network module of the Linux by forcing panic code and confirmed the proposed design mechanism of kernel hardening is working well by this experiment.