• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.176-186
• /
• 2007

An interconnection network can be represented as a graph where a vertex corresponds to a node and an edge corresponds to a link. The diameter of an interconnection network is the maximum length of the shortest paths between all pairs of vertices. The fault diameter of an interconnection network G is the maximum length of the shortest paths between all two fault-free vertices when there are $_k(G)-1$ or less faulty vertices, where $_k(G)$ is the connectivity of G. The fault diameter of an R-regular graph G with diameter of 3 or more and connectivity ${\tau}$ is at least diam(G)+1 where diam(G) is the diameter of G. We show that the fault diameter of a 2-dimensional $m{\times}n$ torus with $m,n{\geq}3$ is max(m,n) if m=3 or n=3; otherwise, the fault diameter is equal to its diameter plus 1. We also show that in $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ torus with each $k_i{\geq}3$, there are 2d mutually disjoint paths joining any two vertices such that the lengths of all these paths are at most diameter+1. The paths joining two vertices u and v are called to be mutually disjoint if the common vertices on these paths are u and v. Using these mutually disjoint paths, we show that the fault diameter of $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ totus with each $k_i{\geq}3$ is equal to its diameter plus 1.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.3
• /
• pp.213-219
• /
• 2017

Recently, the Internet Protocol Television (IPTV) services have become very common, enabling various Internet-based services as well as watching TV. In the IPTV system, a Set-Top box (STB) plays a key role as a network terminal device that transmits and receives realtime multimedia contents. In addition, the IPTV networks are usually supported by broadband optical fiber-base network such as fiber-to-the-home (FTTH), However, a general IPTV STB is regarded as one of the local area network (LAN)-attached devices while sharing the bandwidth of the LAN (e.g., Ethernet). In order to overcome the limited bandwidth utilization by fully facilitating the broadband bandwidth (e.g., 1 Gbps) of the optical fiber-based network, we propose a new FC (Fiber Channel)-embedded IPTV STB which can be directly attached to the optical fiber network. Then, we verify that the impacts of the proposed FC-embedded IPTV STB by organizing the the FC-AL (Fiber Channel-Arbitration Loop) network equipped with the FC-embedded IPTV We measures the average Start-up Delay, Average Reject Ratio and the Number of Concurrent Users through extensive simulations to investigate the performances of the suggested FC-AL-based IPTV network. Surprisingly, the IPTV network architecture with the proposed FC-embedded IPTV STBs has an excellent average start-up delay of less than 10 msec, an acceptable average reject ratio of less than 3 % as well as a linear increase of the number of concurrent users when extending the architecture. This reveals that the proposed FC embedded STB has a superior impacts on the performance of the entire IPTV network by effectively utilizing the broadband bandwidth of the fiber optic-based network.

• KIISE Transactions on Computing Practices
• /
• v.22 no.11
• /
• pp.619-624
• /
• 2016

Social-aware video displays not only the relationships between characters but also diverse information on topics such as economics, politics and culture as a story unfolds. Particularly, the speaking habits and behavioral patterns of people in different situations are very important for the analysis of social relationships. However, when dealing with this dynamic multi-modal data, it is difficult for a computer to analyze the drama data effectively. To solve this problem, previous studies employed the deep concept hierarchy (DCH) model to automatically construct and analyze social networks in a TV drama. Nevertheless, since location knowledge was not included, they can only analyze the social network as a whole in stories. In this research, we include location knowledge and analyze the social relations in different locations. We adopt data from approximately 4400 minutes of a TV drama Friends as our dataset. We process face recognition on the characters by using a convolutional- recursive neural networks model and utilize a bag of features model to classify scenes. Then, in different scenes, we establish the social network between the characters by using a deep concept hierarchy model and analyze the change in the social network while the stories unfold.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.326-338
• /
• 2003

The objective of a neural network design and model selection is to construct an optimal network with a good generalization performance. However, training data include noises, and the number of training data is not sufficient, which results in the difference between the true probability distribution and the empirical one. The difference makes the teaming parameters to over-fit only to training data and to deviate from the true distribution of data, which is called the overfitting phenomenon. The overfilled neural network shows good approximations for the training data, but gives bad predictions to untrained new data. As the complexity of the neural network increases, this overfitting phenomenon also becomes more severe. In this paper, by taking statistical viewpoint, we proposed an integrative process for neural network design and model selection method in order to improve generalization performance. At first, by using the natural gradient learning with adaptive regularization, we try to obtain optimal parameters that are not overfilled to training data with fast convergence. By adopting the natural pruning to the obtained optimal parameters, we generate several candidates of network model with different sizes. Finally, we select an optimal model among candidate models based on the Bayesian Information Criteria. Through the computer simulation on benchmark problems, we confirm the generalization and structure optimization performance of the proposed integrative process of teaming and model selection.

• The KIPS Transactions:PartB
• /
• v.14B no.1 s.111
• /
• pp.51-58
• /
• 2007

This paper suggests prototype of dialog system combining VXML(VoiceXML) that is the W3C's standard XML format for specifying interactive voice dialogues between human and computer, and RSS(RDF Site Summary or Really Simple Syndication) that is representative technology of semantic web for syndication and subscription of updated web-contents. Merits of the proposed system are as following: 1) It is a new method that recognize spoken contents using ire and wireless telephone networks and then provide contents to user via STT(Speech-to-Text) and TTS(Text-to-Speech) instead of traditional method using web only. 2) It can apply advantage of RSS that subscription of updated contents is converted to VXML without modifying traditional method to provide RSS service, 3) In terms of users, it can reduce restriction on time-spate in search of contents that is provided by RSS because it uses ire and wireless telephone networks, not internet environment. 4) In terms of information provider, it does not need special component for syndication of the newest contents using speech recognition and synthesis technology. We implemented a news service system using VXML and RSS for performance evaluation of the proposed system. In experiment results, we estimated the response time and the speech recognition rate in subscription and search of actuality contents, and confirmed that the proposed system can provide contents those are provided using RSS Feed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.48-58
• /
• 2009

Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.51-63
• /
• 2013

Recently with base apply MANET with the application for the service discovery and delivery which are various techniques are being proposed the result of such MANET base research techniques from actual inside. This dissertation proposes T-Chord(Trustworthy-based Chord) Ring system for MANET to guarantees from such requirements. T-Chord Ring system in order to manage Efficiently the services which the mobile nodes provide is the service discovery system which uses P2P overlay network Technique in mobile environment. The system which is proposed MANET communications in order to accomplish a service discovery operation with physical network class and logical network class will be able to minimize problems from about MANET service discoveries, and uses the dispersive hash table technique for a service discovery and effectiveness of service discovery improves and will be able to guarantee the expandability of network size. The mobile nodes(mobile device) have a mobility from MANET and operate with service request node, service provide node and service transmit node. The mobile nodes will be able to elect cluster header using Trustworthy that was evaluated service request, provision and delivery in each other. The system which is proposed a service discovery and a delivery efficiently will compose the cluster head which will grow of P2P overlay networks and will be able to accomplish. The system which proposes from dissertation is composed of Trustworthy evaluations of MANET mobile nodes, service information collection which is dispersed and P2P overlay networks that composed of Chord algorithm modules which provide O(Log N) efficiencies. The system comparison evaluation analyzes an efficiency from the expandability side of effectiveness and the network of service discovery technique and the service discovery message over head, service discovery and delivery of former times and service discovery and delivery is excellent gives proof from MANET.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.47-58
• /
• 2006

Due to the movement of nodes, ad-hoc networks suffer from the problems such as the decrease of data delivery ratio, the increase of end-to-end delay, and the increase of routing overhead. The backup routing schemes try to solve these problems by finding the backup routes during the route discovery phase and using them when a route fails. Generally the backup routing schemes outperform the single-path routing schemes in terms of data delivery ratio, end-to-end delay, and routing overhead when the nodes move rapidly. But when the nodes don't move rapidly, the backup routing schemes generate more routing traffics than the single-path routing schemes because they need to exchange packets to find the backup route. In addition, when the backup route fails earlier than the main route, it can not use the backup route because in many backup route algorithms, the backup route is found only at the initial route discovery phase. RBR(Reactive Backup Routing Algorithm) proposed in this paper is an algorithm that provides more stable data delivery than the previous backup routing schemes through the selective maintenance of backup route and the backup route rediscovery. To do that RBR prioritize the backup routes, and maintain and use them selectively Thus it can also decrease the routing overheads. Also, RBR can increase data delivery ratio and decrease delay because it reestablishes the backup route when the network topology changes. For the performance evaluation, OPNET simulator is used to compare RBR with the single-path routing scheme and some of the well known backup routing schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.50-64
• /
• 2013

In clustered sensor networks, since a CH (Cluster Head) collects data from its members and delivers the collected data to the sink, it is very important to prevent compromised nodes from joining a CH election and manipulating and fabricating the election result. In order to protect CH elections from compromised nodes, unpredictability, non-manipulability, and agreement property should be guaranteed in CH elections. However, existing CH election schemes cannot prevent intelligent compromised nodes from skilfully violating those properties via their cooperation. In this paper, we propose a scheme which protects the CH election process by detecting intelligent compromised nodes and excluding them. For every CH election round, each member gives a direct trust value to other members according to their behavior. Then a real reputation value is given to each member by combining the direct trust value and indirect trust values provided by other members. Then, each node evaluates the real reputation values of members in its cluster and excludes some untrustable nodes from CH candidates. The scheme greatly improves the non-manipulability and agreement property of CH election results compared to other rival schemes. Furthermore, the scheme preserves the high non-manipulability and the high agreement property even in an environment where message losses can happen.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.1-16
• /
• 2012

In this paper, we propose a cost-effective location and service management scheme in LTE (Long Term Evolution) networks, which a per-user service proxy is created to serve as a gateway between the mobile user and all client-server applications engaged by the mobile user. The service proxy is always co-located with the mobile user's location database such that whenever the MU's location database moves during a location hand-off, a service hand-off also ensues to co-locate the service proxy with the location database. This allows the proxy to know the location of the mobile user all the time to reduce the network communication cost for service delivery. We analyze four integrated location and service management schemes. Our results show that the centralized scheme performs the best when the mobile user's SMR (service to mobility ratio) is low and ${\upsilon}$(session to mobility ratio) is high, while the fully distributed scheme performs the best when both SMR and ${\upsilon}$ are high. In all other conditions, the dynamic anchor scheme is the best except when the service context transfer cost is high under which the static anchor scheme performs the best. Through analytical results, we demonstrate that different users with vastly different mobility and service patterns should adopt different integrated location and service management methods to optimize system performance.