• Korean Journal of Computational Design and Engineering
• /
• v.7 no.1
• /
• pp.66-73
• /
• 2002

The purpose of this study is to propose a new process model for architects and suppliers in AEC(Architectural, Engineering and Construction) industry, which comes from its utilization of a distributed database. Information used by participants of this process is not held in one singular application sewer, but in tile databases of multiple participants. This study addresses the problem of coping with dynamic information changes that architects face when designing with increasingly time-sensitive product information from multiple suppliers. It also describes the new distributed architecture for design representation, and outlines a corresponding process model to address the needs architectural designers during design and procurement phases. The feasibility of the process was tested in a prototype system that combines existing technologies, which allows for an objects transfer from the Web to the CAD application.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.524-532
• /
• 2002

With the recent rapid progress of Internet, the higher speed network is needed to support the exploration of ambient information from text-based to multimedia-based information. Also, demands for additional Layer 3 routing technique, such as Network Address Translator (NAT) and Firewall, are required to solve a limitation of a current Internet address space and to protect the interior network from the exterior network. However, current router-based algorithms do not provide mechanisms to solve the congestion and fairness problems, while supporting the multimedia services and satisfying the user requirements. In this paper, to solve these problems, a new active queue management, called MFRED (Multiple Fairness RED) algorithm, is proposed. This algorithm can efficiently reduce the congestion in a router or gateway based on the Layer 3 routing technique, such as NAT. This algorithm can improve the fairness among TCP-like flows and unresponsive flows. It also works well in fairly protecting congestion-sensitive flows, i.e. fragile TCP, from congestion-insensitive or congestion-causing flows, i.e. robust TCP.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.185-192
• /
• 2016

Today, the Internet has penetrated almost all the ins and outs of social life, has changed work, communications, social influence and the lifestyle of humankind. However, it is still short of flexibility, transparency etc., due to network address translator overuse, masschanges, uncomfortable protocols, and so on. Hence, more research is necessary into future telecommunications networks based on contemporary networks accompanied by new requisitions and new designs that are compatible with today's and tomorrow's demands. This paper researches a new vision of the telecommunication network of the future, its effects on human life and society, and the targets to achieve a new generation network (NwGN). In the paper, we also propose orientation towards an NwGN from the current networks, especially with Vietnam's telecommunications networks.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.847-852
• /
• 2003

This paper implements MOD system using multicast delivery. Conventional system provide server-based system in multicast delivery but implemented system provides on-demand client-based multicast system. The scheduler aggregates clients' request and it generate multcast group addresses and port numbers according to requested video items and service request time. Then it transmits immediately multicast address to MOD server and client who request service. And then MOD server transmits requested streams with a multicast group address and the client joins the group automatically. The scheduler assigns the same multicast group address when other clients request an identical video within the same scheduling duration. The system can reduce load of server and support many clients at the same time.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.4
• /
• pp.71-79
• /
• 2000

The original March algorithms cannot detect CMOS ADOFs(Address Decoder Open Faults) which requires separate deterministic test patterns. Modified March algorithm using DOF(Degree of Freedom) was suggested to detect these faults in addition to conventional stuck faults. This paper augments the modified march test to further capture NPSFs(Neighborhood Pattern Sensitive Faults). Complete CA(Cellular Automata) is used for address generation and Rl-LFSRs(Randomly Inversed LFSRs) for data generation. A new modified March algorithm can detect SAF, CF, TF, CMOS ADOFs, and part of NPSFs. Time complexity of this algorithm is still O(n).

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.3
• /
• pp.9-16
• /
• 2017

In recent computing systems, LRU replacement policy has been widely used because it can be simply implemented and applicable to most programs. However, if the working set size of the program is bigger than the actual cache size, LRU replacement policy may occur thrashing problem. Thrashing problem means that cache blocks are consistently replaced without re-referencing in the cache. This paper proposes a new cache management scheme to solve the thrashing problem in the second-level cache. The proposed scheme measures per set reuse frequency using EAF structure to find thrashing sets. When the cache miss occurs, it tests whether the address of the missed block is stored or not. If the address of the missed block is stored, it means that the recently evicted block is re-requested, so the reuse frequency is predicted high. In this case, the corresponding counter of the set is increased. When the counter value is bigger than the threshold value, we assume that the corresponding set shows high reuse frequency. The proposed scheme assigns the set with high reuse frequency to the additional small size cache to keep the blocks in the cache for a long time. Our experimental results show that the proposed scheme improves the IPC by 3.81% on average.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.79-82
• /
• 2007

Recently the diffusion of the advancement of mobile communication technique and mobile terminal increased, The users were demanded seamless services when carrying and moving. It proposed the FMIPv6 (Fast Handoff for Mobile IPv6) from the IETF like this meeting this requirement. The handover procedure of the FMIPv6 causes to defecate with movement detection, new CoA configuration and binding update. But, the delay occurs from each process, when the DAD(Duplicate Address Detection) of the CoA executing, the big delay occurs. This paper proposes a scheme of delay reduction, it omits DAD process and stores in the AR(Access Router) relates in the CoA of the mobile terminal information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2027-2031
• /
• 2007

Recently the diffusion of the advancement of mobile communication technique and mobile terminal increased, The users were demanded seamless services when carrying and moving. It proposed the FMIPv6(Fast Handoff for Mobile IPv6) from the IETF like this meeting this requirement. The handover procedure of the FMIPv6 causes to defecate with movement detection, new CoA configuration and binding update. But, the delay occurs from each process, when the DAD(Duplicate Address Detection) of the CoA executing, the big delay occurs. This paper proposes a scheme of delay reduction, it omits DAD process and stores in the AR(Access Router) relates in the CoA of the mobile terminal information.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.874-876
• /
• 2008

Ethernet ring protection is a new technology introduced in ITU-T Recommendation G.8032, which utilizes the generic Ethernet MAC functions. We introduce an alternative enhanced protection switching scheme to suppress penalty in the switching transient, in which the Ethernet MAC filtering database (FDB) is actively and directly modified by information disseminated from the nodes adjacent to failure. The modified FDB at all nodes are guaranteed to be consistent to form a complete new ring network topology immediately. This scheme can reduce the capacity requirement of the G.8032 by several times. This proposed scheme can be also applied in IP protection rings.

• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1075-1086
• /
• 2018

In this paper a cross-validation algorithm for training probabilistic neural networks (PNNs) is presented in order to be applied to automatic face identification. Actually, standard PNNs perform pretty well for small and medium sized databases but they suffer from serious problems when it comes to using them with large databases like those encountered in biometrics applications. To address this issue, we proposed in this work a new training algorithm for PNNs to reduce the hidden layer's size and avoid over-fitting at the same time. The proposed training algorithm generates networks with a smaller hidden layer which contains only representative examples in the training data set. Moreover, adding new classes or samples after training does not require retraining, which is one of the main characteristics of this solution. Results presented in this work show a great improvement both in the processing speed and generalization of the proposed classifier. This improvement is mainly caused by reducing significantly the size of the hidden layer.