• Journal of Korean Society for Quality Management
• /
• v.30 no.1
• /
• pp.162-171
• /
• 2002

A practical algorithm of generating most probable states in decreasing order of probability, given the probability of each unit\`s state, is suggested for approximating reliability(performability) evaluation of a network with multistate(multimode) units. Method of approximating network reliability for a given measure with most probable states is illustrated with a numerical example. The proposed method in this paper is compared with the previous method regarding memory requirement. Our method has some advantages for computation and achieves improvement with regard to memory requirement for a certain condition judging from the computation experiment.

• Journal of the Korean Society of Industry Convergence
• /
• v.24 no.3
• /
• pp.351-361
• /
• 2021

This study proposes an intelligent control of manufacturing robot with dual arm based on neural network for smart factory implementation. In the control method of robot system, the perspectron structure of single layer based on neural network is useful for simple computation. However, the limitations of computation are emerging in areas that require complex computations. To overcome limitation of complex parameters computation a new intelligent control technology is proposed in this study. The performance is illustrated by simulation and experiments for manufacturing robot dual arm robot with eight axes.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

• International Journal of Computer Science & Network Security
• /
• v.23 no.8
• /
• pp.146-158
• /
• 2023

Smart City is gaining attention with the advancement of Information and Communication Technology (ICT). ICT provides the basis for smart city foundation; enables us to interconnect all the actors of a smart city by supporting the provision of seamless ubiquitous services and Internet of Things. On the other hand, Crowdsourcing has the ability to enable citizens to participate in social and economic development of the city and share their contribution and knowledge while increasing their socio-economic welfare. This paper proposed a hybrid model which is a compound of human computation, machine computation and citizen crowds. This proposed hybrid model uses knowledge-based crowdsourcing that captures collaborative and collective intelligence from the citizen crowds to form democratic knowledge space, which provision solutions in areas of civic innovations. This paper also proposed knowledge-based crowdsourcing framework which manages knowledge activities in the form of human computation tasks and eliminates the complexity of human computation task creation, execution, refinement, quality control and manage knowledge space. The knowledge activities in the form of human computation tasks provide support to existing crowdsourcing system to align their task execution order optimally.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.131-135
• /
• 2009

This paper is the introduction of our work on distributed load scheduling in single-level tree network. In this paper, we derive a new calculation model in single-level tree network and show a closed-form formulation of the time for computation system. There are so many examples of the application of this technology such as distributed database, biology computation on genus, grid computing, numerical computing, video and audio signal processing, etc.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.119-131
• /
• 2008

The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.391-398
• /
• 2010

Because mobile sensor network is different with the existing wireless sensor network with fixed nodes, it is more difficult to implement a positioning algorithm in mobile sensor network than in mobile sensor network. In case of fast moving node, a positioning algorithm may be not completed in a given time. In this paper we present the positioning algorithm that improves performance and can complete a computation in time on mobile sensor network.

• Journal of Korean Society for Quality Management
• /
• v.11 no.2
• /
• pp.10-17
• /
• 1983

The former paper (Part I) studies two methods for searching and determining the simple paths in an acyclic or a cyclic network. The two methods are computer programmed as subroutines (SPLP1 and SPLP2) for various use. And a few examples of its applications are discussed Another paper (Par II) studies the reliability computation for a network by using the Event Space Methods. A computer program is developed for the computation by applying the SPLP2 subroutine subprogram. In this paper the former results are summarized with another computer program for reliability computation by using the Path Tracing Methods. The two subroutines appear in the Appendix as reference for others. The programs can be used in the reliability computation of reducible and irreducible structure networks.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.