• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.545-548
• /
• 2000

A fundamental tenet of CBD is that a component has a specification which describes what that component does, and how it behaves when its services are used. In general, the implementation may be written in a different programming language and execute on different technology platform, from the language and platform used by the client program. In order to implement practically the system that is designed by the Farmer model, there is need to have the ISM (Interface Specification Model) which explains specification about the functions of entities of the Farmer model, such as, entity node, aspect node and ILB/OLB. This paper suggests the transformation methodology from the concepts of the Farmer model to the mapping notions of the ISM. Also in reality, TMN agents system which is designed by the Farmer model is transformed to the ISM system design.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.303-310
• /
• 2006

This paper is to execute a study for characteristic analysis of synchronization clock and maximum network node number with various clock states, normal, SPT, LPT, in NG-SDH networks. Through the simulations, maximum network node numbers showed from 42 to 38 nodes in normal state. In SPT state, maximum network node numbers, when the last NE network applied to only SPT state, presented from 19 to 4 nodes, much less than normal state. Node numbers to meet specification in case of occurrence of SPT state in all NE networks decreased greatly. In LPT state, all maximum node numbers, when the last NE network applied to only LPT state, presented more than 50 nodes, and the results in case of occurrence of LPT state in all NE networks were also identified. However, node numbers to meet specification in case of LPT state in all DOTS networks were few large with difference between LPT and normal or SPT state.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.5
• /
• pp.83-91
• /
• 2008

IISO/IEC 9594-8 defines the public key framework and attribute certificate framework. Attribute certificate framework deals with privilege management infrastructure(PMI). In PMI, for privilege management using attribute certificates, role assignment certificates and role specification certificates are used to assign and specify privileges independently. Role specification certificates includes privilege specifications and the details far privilege management of network environments. Privilege management of unreliable network environment tries to enhance the reliability and efficiency of privilege information transmission forwarding over unreliable routes in the presence of potentially faulty nodes and edges. Each node forms a role specification tree based on role specification relationship data collected from the network. In this paper privilege management cost with the role specification certificates tree structure is evaluated trying to reduce the overhead incurred by role creation and modification of privileges. The multicasting of packets are used for scalability. We establish management cost model taking into account the packet loss and node reliability which continuously join and leave for network. We present quantitative results which demonstrate the effectiveness of the proposed privilege management scheme.

• Proceedings of the KSR Conference
• /
• 2001.10a
• /
• pp.35.1-40
• /
• 2001

This study is on the behavior analysis which can define and verify a system requirement through a behavior diagram for High speed rail system. The model considered in this study is limited to the preconditioning control of the control system specification for HSRS. To build an executable model, requirements should be decomposed first into leaf node requirements. The behavior model is composed of input, output, and functions which are linked with leaf node requirements. It is important that a single requirement must specify a single Auction. Using the developed executable model and the traceability between requirements and functions, this study found out a lot of static and dynamic inconsistency, missed and derived requirements. This is to develop and executable behavior model to do functional analysis and be able to verify the integrity of a specification.

• Journal of Information Technology Services
• /
• v.1 no.1
• /
• pp.119-139
• /
• 2002

It is noteworthy that IMT -2000 communication network based on All-HP/AIN(Advanced Intelligent Network) should accomodate current and future wire/wireless AIN service easily through integration and gearing AIN construction elements. In this paper. Intelligent Farmer model(I-Farmer Model) and methodology are suggested in order to solve the several problems including standardization on implementation of Q3 interface in Telecommunication Management Network(TMN) agents which is caused by heterogeneous platform environment and future maintenance. Also this paper proposes ITI algorithm transforming the system which is designed by I-Farmer model to Interface Specification Model(ISM) applying the I-Farmer model. In addition to ITI algorithm. we suggest NTS(Node to SIB) algorithm converting entity node and ILB/OLB component in agent system designed by the I-Farmer model to SIB of AIN GFP(Global Functional Plane) and to ASIB for application program.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2667-2670
• /
• 2005

In this Paper is analyzed about FMS(Fieldbus Message Specification) service of FOUNDATION Fieldbus and designed using of UML(Unified Modeling Language). The FMS provides a number of services for reading, writing, and otherwise accessing objects. The FOUNDATION Fieldbus protocol is object oriented. The information in the devices is accessed in the form of objects. In FMS, the objects for configuring device and strategy in a node are listed in an object dictionary(OD). Each object is identified by an index. For example, every function block and every parameter has an index.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.4
• /
• pp.278-285
• /
• 2011

This paper makes an analysis of the encoding structure and the decoding algorithm proposed by the DVB-S2 specification. The methods of implementing the LDPC decoder are fully serial decoder, the partially parallel decoder and the fully parallel decoder. The partial parallel scheme is the efficient selection to achieve appropriate trade-offs between hardware complexity and decoding speed. Therefore, this paper proposed an efficient memory structure for check node update block, bit node update block, and LLR memory.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.409-416
• /
• 2003

We consider the problem of grouping orders into lots. The problem is modelled by a graph G = (V, E). where each node $\nu\;\in\;V$ denotes order specification and its weight $\omega(\nu)$ the orders on hand for the specification. We ran construct a lot simply from orders or single specification For a set of nodes (specifications) $\theta\;\subseteq\;V$, if the distance or any two nodes in $\theta$ is at most d, it is also possible to make a lot using orders on the nodes. The objective is to maximize the number of lots with size exactly $\lambda$. In this paper, we prove that our problem is NP-Complete when d = 2, $\lambda\;=\;3$ and each weight is 0 or 1. Moreover, it is also shown to be NP-Complete when d = 1, $\lambda\;=\;3$ and each weight is 1, 2 or 3

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.4
• /
• pp.253-258
• /
• 2003

We consider the problem of grouping orders into lots. The problem is modelled by a graph G=(V,E), where each node ${\nu}{\in}V$ denotes order specification and its weight ${\omega}(\nu)$ the orders on hand for the specification. We can construct a lot simply from orders of single specification. For a set of nodes (specifications) ${\theta}{\subseteq}V$, if the distance of any two nodes in $\theta$ is at most d, it is also possible to make a lot using orders on the nodes. The objective is to maximize the number of lots with size exactly $\lambda$. In this paper, we prove that our problem is NP-Complete when $d=2,{\lambda}=3$ and each weight is 0 or 1. Moreover, it is also shown to be NP-Complete when $d=1,{\lambda}=3$ and each weight is 1,2 or 3.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1435-1443
• /
• 2009

In this paper, an energy harvesting sensor network system is modeled and simulated by using the DEVS (Discrete Event System Specification) formalism. The system is composed of a sink (master) node, which is battery or mains powered, and a set of sensor (slave) nodes, each of which harvests ambient energy and converts it into electrical energy. For simulation, (i) the behavior of energy harvesting and storing circuits of the slave node is partitioned into a set of piecewise continuous segments and then each segment is represented as a discrete state; (ii) the interaction among the master node and components of the slave node is investigated preciously; and (iii) the investigated result is modeled and simulated by using the DEVS formalism.