• Nuclear Engineering and Technology
• /
• v.29 no.6
• /
• pp.433-443
• /
• 1997

In this work, an analytic approach to the dependability of software in the operational phase is suggested with special attention to the hardware fault effects on the software behavior : The hardware faults considered are memory faults and the dependability measure in question is the reliability. The model is based on the simple reliability theory and the graph theory which represents the software with graph composed of nodes and arcs. Through proper transformation, the graph can be reduced to a simple two-node graph and the software reliability is derived from this graph. Using this model, we predict the reliability of an application software in the digital system (ILS) in the nuclear power plant and show the sensitivity of the software reliability to the major physical parameters which affect the software failure in the normal operation phase. We also found that the effects of the hardware faults on the software failure should be considered for predicting the software dependability accurately in operation phase, especially for the software which is executed frequently. This modeling method is particularly attractive for the medium size programs such as the microprocessor-based nuclear safety logic program.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.625-634
• /
• 2014

This paper studies a dual-hop multiple-access relay network where two independent source nodes transmit information to a common destination node with the aid of multiple single-antenna amplify-and-forward relays. Each relay node is subject to an individual power constraint. We focus on the design of distributed beamforming schemes for the relays to support the transmission rate requirements of the two sources. To this end, we first characterize the achievable rate region for this network via solving a sequence of corner point optimization problems proposed in this paper. We also develop several low-complexity suboptimal schemes in closed form. Two inner bounds of the achievable rate region are theoretically shown to be approximately optimal in two special scenarios. Finally, numerical results demonstrate the effectiveness of our proposed approaches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.939-951
• /
• 1996

The previous study of virtual path design for one traffic class with ATM DCS only should be generalized to that for the multiple traffic class cases of being given neither virtual path candidate set nor end nodes o each virtual path. In this paper, a design model of virtual paths for the general case with multiple traffic classes is suggested. The model is represented as an optimization rpoblem with a special structure. It is solved by SQA algorithm, which is developed by authors in [3, 4]. The model and the algorithm are applied to a numerical example, and results are shown.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.534-538
• /
• 2008

Maya currently is used form various area in 3D graphics. Maya provide that modeling methods are NURBs, Polygon, and Subdivision. There are special feature their modeling method. So we need to modeling convert. After modeling convert, there is no UV node. In this paper, we study creating techniques UV node which NURBs modeling convert Subdivsion modeling. Moreover, we present prototype implementation.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.03a
• /
• pp.22-24
• /
• 2008

This paper presents a numerical model of internal flows in a lubricant supplying and scavenging flow path of an aero-engine lubrication system. The numerical model was built in the General Analysis Software of Aero-engine Lubrication System, GASLS, developed by Northwestern Polytechnical University. The lubricant flow flux, pressure and temperature distribution at steady state were calculated. GASLS is a general purpose computer program employed a 1-D steady state network algorithm for analyzing flowrates, pressures and temperatures in a complex flow network. All kinds of aero-engine lubrication systems can be divided into finite correlative typical elements and nodes from which the calculation network be developed in GASLS. Special emphasis is on how to use combined elements which is a type of typical elements to replace some complex components like bearing bores, accessory gearboxes or heat exchangers. This method can reduce network complexity and improve calculation efficiency. Final computational results show good agreement with experimental data.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.165-168
• /
• 2005

The objects, which can be personal digital assistants, electronic rings, doors or even clothes, offer embedded chips with computation facilities and are generally called artifacts. I later realized that this was not so the real problem is actually authentication. Recent results indicate scalability problems for flat ad hoc networks. Sensor network achieves function that handle surrounding information perception through sensor and sensed information to network that is consisted of sensor nodes of large number. Research about new access control techniques and height administration techniques need authentication information persons' certification assurance level classification in sensor network environment which become necessary different view base with authentication information at node for application of AAA technology in USN environment that must do authentication process using information that is collected from various sensor mountings. So, get base authentication information in sensor type and present weight grant model by security strength about authentication information through information who draw. In this paper collected information of sensor nodes model who give weight drawing security reinforcement as authentication information by purpose present be going to. and Must be able to can grasp special quality of each sensor appliances in various side and use this and decide authentication assurance level for value estimation as authentication information elements. Therefore, do to define item that can evaluate Authentication information elements thus and give simple authentication assurance level value accordingly because applying weight. Present model who give authentication assurance level value and weight for quotation according to security strength.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.296-304
• /
• 2007

This paper deals with essentially secure group management and key transfer methods in a wireless sensor network environment. To provide an efficient security service to a widespread network with a large number of sensor nodes, the network has to be made up by several security groups, and Group Key distribution and group management are needed. In this paper we propose a mechanism for efficiently constructing and managing a security node by constructing a group using an algorithm to construct a logical group. Previous Group Key Transport method has special condition. When Base Station transports Group Key, all sensor nodes must share Secret Key with Base Station before it is intended to be deployed. Hence, we also propose a Key transport mechanism without sharing Secret Key between Base Station and sensor node.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.458-465
• /
• 2007

Wireless Sensor Network(WSN) is a special network that collects measured data by sensor nodes in the predefined sensor field and forwards them to the base station in a distance using their own routing scheme. WSN requires routing techniques to maximize energy efficiency because sensor nodes have non-rechargeable and thus limited energy. Characteristics of WSN are various according to applications, many of routing algorithms have been proposed. This paper proposes an algorithm called A-PEGASIS that basically bases on PEGASIS and enhances in two aspects - an elegant chain generation algorithm and periodical update of chains. We compare performance of the previous algorithm of LEACH, PEGASIS, PEDAP and PEDAP-PA with ours through simulation. It confirms that the A-PEGASIS is most superior in terms of average WSN lifetime and high probability of node survival rate during WSN life time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1189-1197
• /
• 2011

To manage sensing information such as temperature, humidity and so on efficiently, it is need to use special purpose protocol. In this reason, IETF WG proposed CoAP protocol, and it is on Internet draft. If it is possible to work on a specific protocol, sensor end-nodes and network devices will be managed efficiently. However, end-nodes have restricted resources, it is hard to applying to CoAP protocol directly. In this paper we analyse a CoAP protocol stack for USN. To verify this protocol quickly, at first we implemented CoAP protocol stack over PC environments. After the logical verification, we applied this protocol to the USN environment. To do this, we ported CoAP protocol to Cygwin environment, and proposed solutions for hardware dependencies, and it is verified through experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.6
• /
• pp.135-149
• /
• 2006

Securing wireless Ad hoc network including the secure mechanism design and implementation is generally more difficult for vulnerability of channels and nodes, the absence of infrastructure, topology that change dynamically, and etc, than ire network. The efforts of early researches are based on the adaptation of securing methods for the wire network to wireless ad hoc network. However, wireless ad hoc network could not get effective study finding because network has essential problems. This paper proposes that some new problems are being came to light over the survivability and availability of the network itself, that are caused by the massive packet attack of more than one or two nodes, and proves the consequence of this phenomenon. Also, we propose an effective prevention mechanism of masquerade attacks for survivability reinforcement that escape standard of the early way by survivability of wireless Ad hoc network and approaches for performance elevation and reflect special quality of wireless Ad hoc network.