• Korean Chemical Engineering Research
• /
• v.46 no.2
• /
• pp.369-375
• /
• 2008

To achieve zero-emission, one of the main goals of an eco-industrial park (EIP), it is needed to develop an effective water exchange network. The network includes various subsystems and decision making processes, which make the modeling process extremely complicated. Agent-based modeling was used to simulate water exchange network in an EIP. Firm agents were created based on the behavior pattern of firms, and an agent-based model (ABM) was made with the agents, showing the growth of the exchange network. An existing steel and iron making industrial park was chosen as a case study, and the ABM model shows eco-efficient behavior with a decreased environmental cost. Water reuse network based on the ABM model results in 35% decrease of the fresh water supply and 50% reduction of the wastewater generation in EIP. A case study shows that agent-based model can be a powerful tool in modeling and designing complex eco-industrial parks, especially when a part of the system needs to be changed.

• Review of KIISC
• /
• v.25 no.2
• /
• pp.12-19
• /
• 2015

모든 사물들이 인터넷에 연결되어 정보의 생산과 교환이 실시간으로 이루어지는 사물인터넷 기술은 사용자에게 개인 맞춤형 서비스를 제공함으로써 삶의 질을 향상시키고 있다. 하지만 사용자가 제공한 민감한 개인 정보가 적법한 서비스가 아닌 악의적인 목적으로 사용된다면 사물인터넷 기술의 발전은 인류에게 큰 재앙으로 다가올 것이다. 따라서 이를 방지하기 위한 방안으로 사물들 간에 교환되는 정보에 대하여 암호화 연산을 수행하게 된다. 이는 교환되는 정보에 대한 기밀성을 제공한다는 장점을 가지지만 암호화 연산을 수행하기 위해 추가적인 계산이 필요한 단점을 가진다. 이러한 연산 복잡도는 사물인터넷과 같은 임베디드 환경에서는 큰 부하로 다가온다. 따라서 이러한 문제점을 해결하기 위한 다양한 경량 암호 알고리즘이 암호학자에 의해 정의되고 이는 다시 암호 엔지니어에 의해 효율적인 구현 방안이 제시되고 있다. 본 논문에서는 지금까지 연구되어온 경량 암호 알고리즘의 실용성을 사물인터넷 환경에서 소프트웨어와 하드웨어 관점에서 살펴보도록 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1914-1927
• /
• 1996

Banyan networks have a number of applications in the area of computer and communications. While several analytical models have been proposed for the performance evaluation of Banyan networks, they are either not very accurate of too complex to be generalized. In this paper a new model for evaluating multibuffered MINs with 2*2 switching elements is proposed. the proposed model is very accurate for any size and traffic condition. It is also simple and can be easily generalized.

• KSCI Review
• /
• v.8 no.1
• /
• pp.9-18
• /
• 2001

정보통신 기술의 비약적인 발전은 시간적 공간적 제약이 존재하지 않는 방대한 양의 정보와 지식의 교환의 장인 가상시장 전자적 시장이라는 용어로 대변되는 전자상거래 시스템에 대한 관심이 고조되고 있다. 또한 기존의 인터넷에 많이 사용하던 HTML의 한계와 SGML의 복잡함을 해결한 XML을 차세대 문서형식으로 이용하려는 추세이다 본 논문에서는 인터넷을 이용한 전자상거래가 보편화 되는 시점에서 XML을 적용하는 방법에 대해서 고찰하고자 한다.

• Product Safety
• /
• s.59
• /
• pp.14-17
• /
• 1997

미래 기업환경은 변혁적이며 복잡다양해져 보다 유연한 경영조직의 구축과 보다 효율적이고 혁신적인 조직으로 탈바꿈할 것을 요구하고 있다. 기능적으로 분화된 전통적인 기업조직으로는 이러한 환경변화에 대응하기 어렵게 되었다. 기업은 이러한 미래 환경변화에 유연하게 대응하기 위해서 자신의 전문 기능을 강화하고 타기능은 외부조직과 교환 및 제휴를 해야 한다. 그리고 외부조직과의 연계는 사안별로 기능들간의 네트워크를 형성하여 시장 및 고객의 요구에 전문성을 활용해야

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.110-118
• /
• 2006

Cryptographic protocol design in a two-party setting has of tel ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channel). In particular, most protocols for two-party key exchange have been designed assuming that parties alternate sending their messages (i.e., assuming a bidirectional half-duplex channel). However, by taking advantage of the communication characteristics of the network it may be possible to design protocols with improved latency. This is the focus of the present work. We present three provably-secure protocols for two-party authenticated key exchange (AKE) which require only a single round. Our first, most efficient protocol provides key independence but not forward secrecy. Our second scheme additionally provides forward secrecy but requires some additional computation. Security of these two protocols is analyzed in the random oracle model. Our final protocol provides the same strong security guarantees as our second protocol, but is proven secure in the standard model. This scheme is only slightly less efficient (from a computational perspective) than the previous ones. Our work provides the first provably- secure one-round protocols for two-party AKE which achieve forward secrecy.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.1
• /
• pp.87-93
• /
• 2004

In the design of mobile wireless communication network, BSC(Base Station Location), BSC(Base Station Controller) and MSC(Mobile Switching Center) are the most important parameters. Designing base station location, the cost must be minimized by combining various, complex parameters. We can solve this Problem by combining optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been used extensively for global optimization. This paper shows the 4 kinds of algorithm to be applied to the optimization of base station location for communication system and then compares, analyzes the results and shows optimization process of algorithm.

• Journal of Korea Multimedia Society
• /
• v.5 no.6
• /
• pp.704-711
• /
• 2002

Multimedia communication systems are characterized by supporting three different typer of services such as circuit switched services, and packet switched real Lime and non real time services. The wireless channels in a cell ate allocated by calls of these different service classes and the different service requirements have to be met. SRN is an extension of stochastic Petri nets and provides compact Modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. In this paper, we present a SRN model for performance analysis of channel allocation of multimedia mobile communication systems. The key contribution of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performance analysis for channel allocations under SRN rewards concepts.

• Journal of the Korean Society for Library and Information Science
• /
• v.34 no.1
• /
• pp.229-242
• /
• 2000

Today, we are confronted with huge amount of data which contain complex documents, images and multimedia contents. Therefore a new method is needed to analyze and manage the mathematical expressions and extract new Information from them. It is more and more important to manage the document files including mathematical expressions which are generated by general-purpose word processors. Three major word processors are shared over 90% of domestic market. These are HWP, TeX and MS word. Due to the progress of Internet and digital library, it is necessary to develop a system to manage the document file containing mathematical expressions over the Web.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.3
• /
• pp.125-135
• /
• 2004

IEEE 802.15.3 High Rate WPAN is a mechanism for wireless home network such as PDAs, digital video camcoder, etc. While symmetric keys are used for MAC layer security, the process of establishing a secure membership or a secure relationship is outside of the scope of the standard. In addition, to prepare for ubiquitous environment in the near future, it is important to study the process of establishing a secure relationship between DEVs in different dependent piconets. This paper propose a secure model and a process of establishing a secure relationship using PKI without a ousted certificate authority.