• Journal of Industrial Technology
• /
• v.18
• /
• pp.195-202
• /
• 1998

The effect of the number of nodes on the heat loss from a rectangular fin for a finite difference method is studied. There are two ways for selecting nodes for the upper half fin in this finite difference method. In the first place, all the ${\Delta}x$ are the same and all the ${\Delta}y$ are the same for the entire upper half fin. Incremental length of x (i.e. ${\Delta}x$) is divided by two near the fin tip while all the ${\Delta}y$ are the same for another way. The results show that 1) About 30 nodes are enough to obtain the satisfactory exact analysis (relative error < 5%) on the heat loss for a given range of Biot number in case of short fin (i.e. $L{\leq}2$). 2) Under usual circumstances (Bi<0.1), the relative error of heat loss between using 30 nodes and 90 nodes is within 4% for given range of non-dimensional fin length. 3) The relative error of the calculated heat loss (the number of node=90) as compared to the expected exact heat loss is less then 1.5% for Bi=0.1 and L=10 while that is over 13% for Bi=1.0 and L=10.

• Fashion & Textile Research Journal
• /
• v.1 no.1
• /
• pp.50-55
• /
• 1999

The repeatability of fabric drape was studied. Two methods for draping were used and the relation between node distributions was investigated using statistical analysis. With this, the relationship between node distribution and fabric mechanical properties was studied. The repeated measurements showed that there was no evidence that fabric has intrinsic node number and the mechanical properties influence on the number of nodes.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.363-370
• /
• 2014

Despite several years of intense research, the security and cryptography in wireless sensor networks still have a number of ongoing problems. This paper describes how identification (ID)-based node authentication can be used to solve the key agreement problem in a three-layer interaction. The scheme uses a novel security mechanism that considers the characteristics, architecture, and vulnerability of the sensors, and provides an ID-based node authentication that does not require expensive certificates. The scheme describes the routing process using a simple ID suitable for low power and ID exposure, and proposes an ID-based node authentication. This method achieves low-cost communications with an efficient protocol. Results from this study demonstrates that it improves routing performance under different node densities, and reduces the computational cost of key encryption and decryption.

• Korean Management Science Review
• /
• v.27 no.3
• /
• pp.1-14
• /
• 2010

In this paper we study the access network design problem in Universal Mobile Telecommunication Systems (UMTS) networks. Given the location of radio base stations (node-Bs), their traffic demands, and the candidate facility centers for locating radio network controllers (RNCs), the problem is to determine the configuration of access network, including the number and location of facility centers, the number of RNCs in each facility center, and the links between RNCs and node-Bs, with the objective being to design such a network at the minimum cost. We provide a mathematical formulation of the problem with constraints on RNC and node-B capacities, along with a lower bounding method. We develop a heuristic algorithm with two different initial solution methods designed to strengthen the solution quality. The computational efficacy of their procedures is then demonstrated on a number of test problems.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1165-1168
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.63-66
• /
• 2001

In this paper, We propose the new interconnection network which is designed to edge numbering labeling using postorder traversal which can reduce diameter when it has same node number with Hypercube, which can reduce total node numbers considering node degree and diameter on Fibonacci trees and its jump sequence of circulant is Fibonacci numbers. It has a simple (shortest oath)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded to Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.603-609
• /
• 1987

In this paper, the single-row routing algorithm for munimizing the street congestion and reducing the between node congestion is deviced. To reduce the between node congestion, reference line crossing is defined and used. Reducing the number of total reference line crossing means reducing the total length which help reduce the power consumption of the integrated system and reducing the between node congestin which help reduce the wiring area. This algorithm has been implemented and tested with various example, then produced good results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.9
• /
• pp.407-415
• /
• 2007

In parallel cluster computing systems, the efficiency of communication between computing nodes is one of important factors that decide overall system performance. Accordingly, many researchers have studied on high-performance inter-node communication. The recently launched multi-core processor, however. increases the importance of intra-node communication as well because the more the number of cores in a node, the more the number of parallel processes running in the same node. Though there have been studies on intra-node communications, these have limited considerations on the state-of-the-art systems. In this paper, we propose a Linux kernel module that minimizes the number of data copy by exploiting the memory mapping mechanism for high-performance intra-node communication. The proposed kernel module supports the Linux kernel version 2.6. The performance measurements over a multi-core system present that the proposed kernel module can achieve lower latency up to 62% and higher throughput up to 144% than an existing kernel module approach. In addition, the measurements reveal that the performance of intra-node communication can vary significantly based on whether the cores that run the communication processes are belong to the same processor package (i.e., sharing the L2 cache).

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.189-199
• /
• 2005

The grid computing is a technique to solve big problems such as a field of scientific technique by sharing the computing power and a big storage space of the numerous computers on the distributed network. The environment of the grid computing is composed with the WAN which has a different performance and a heterogeneous network condition. Therefore, it is more important to reflect heterogeneous performance elements to calculation work. In this paper, we propose an efficient method that decides work process number of each node by considering a network state information. The network state information considers the latency, the bandwidth and latency-bandwidth mixture information. First, using information which was measured, we compute the performance ratio and decide work process number of each node. Finally, RSL file was created automatically based on work process number which was decided, and then accomplishes a work. The network performance information is collected by the NWS. According to experimental results, the method which was considered of network performance information is improved respectively 23%, 31%, and 57%, compared to the methods of existing in a viewpoint of work amount, work process number, and node number.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.32-39
• /
• 2016

With the help of a small wearable device, patients reside in an isolated village need constant monitoring which may increase access to care and decrease healthcare delivery cost. As the number of patients' requests increases in simultaneously manner, the web service gateway located in the village hall encounters limitations for performing them successfully and concurrently. The gateway based RESTful technology responsible for handling patients' requests attests an internet latency in case a large number of them submit toward the gateway increases. In this paper, we propose the design tasks of the web service gateway for handling concurrency events. In the procedure of designing tasks, concurrency is best understood by employing multiple levels of abstraction. The way that is eminently to accomplish concurrency is to build an object-oriented environment with support for messages passing between concurrent objects. We also investigate the performance of event-driven architecture for building web service gateway using node.js. The experiments results show that server-side JavaScript with Node.js and MongoDB as database is 40% faster than Apache Sling. With Node.js developers can build a high-performance, asynchronous, event-driven healthcare hub server to handle an increasing number of concurrent connections for Remote Healthcare Monitoring System in an isolated village with no access to local medical care.