• Journal of Information Technology Applications and Management
• /
• v.15 no.3
• /
• pp.43-59
• /
• 2008

This paper studies small and medium sized financial agency's management states that take advantage of the Korea Federation of Saving Bank's data. It also presents the management state and the decision-making model that monitors progressive insolvency by standardizing transfer path between relevant groups. With this in mind, we extracted explanatory variables for predictions of insolvency by using existing studies of document related insolvency. First of all, we designed a state model based on demarcated groups to take advantage of the self organizing map that groups in line with a neural network. Secondly, we developed a transition model by standardizing the transfer path between individual banks in a state model. Finally, we presented a decision-making model that integrated the state model and the transition model. This paper will provide groundwork for methods of insolvency prevention to businesses in order for them to have a smooth management system in the financial agencies.

• Journal of Korean Home Economics Education Association
• /
• v.13 no.3
• /
• pp.103-118
• /
• 2001

The purpose of this study was to analyze the casual relationship of the background variables. 4-value orientations. 5 money spending styles and the money management behavior of high school girls. The subjects were 498 high school girls. We used Cronbach\` $\alpha$. Pearson correlation coefficients multiple regression and path analysis as statistical analysis. The results were summarized as follows Resulting from path analysis, the money spending styles were the most influential variable on money management behavior and value orientations were more influential variable on the money spending styles rather than the money management behavior. The money management behavior of high school girls had the directive linear relationships with the variables such as goal-oriented value and 4 money spending styles-security conspicuous. non-monetary and unconcerned.

• Journal of information and communication convergence engineering
• /
• v.13 no.4
• /
• pp.248-256
• /
• 2015

With the dramatic increase in mobile traffic in recent years, some of the limitations of mobility management frameworks have magnified. The current centralized mobility management (CMM) strategy has various problems, such as a suboptimal routing path, low scalability, signaling overhead, and a single point of failure. To overcome these weaknesses in the CMM strategy, the Internet Engineering Task Force has been discussing distributed mobility management (DMM) strategies. The fundamental concept of a DMM strategy is to distribute the mobility anchors closer to the users. While the distribution of mobility anchors results in low-cost traffic delivery, it increases the signaling cost. To reduce this higher signaling cost, we propose a new DMM strategy applying the pointer forwarding technique. The proposed strategy keeps the existing tunnels and extends the traffic path as much as possible. In this paper, we analyze the performance of the pointer forwarding-DMM strategy and discuss its pros and cons.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3B
• /
• pp.207-215
• /
• 2006

It has known that the handover based on MIP in mobile environments has many constraints for proving seamless service due to well hon problems. Although there has been researching for the solutions, such as MRSVP and HMRSVP etc, it is difficult to do the research related with QoS due to the issues based on MIP used as a seamless mobility. In this paper, the seamless provides in a mobility based on SCTP, which is applied by IntServ for end-to-end QoS service. The paper also proposes the path management scheme for saving reservation cost. the scheme searches a new path on the moving mobile terminal and reserves the resources on the path for providing seamless QoS service. The paper is also analyzed on the comparition between a SCTP based and MIP based solutions. the scheme is evaluated using the cost effect saved for resource reservation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.233-241
• /
• 2013

One fundamental issue in ad hoc networks is the alternative node election problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we proposed EEAP(Energy-Efficient Alternative Paths). This is a method of selecting an alternative node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting an alternative node of Step-Parents head node on the path management, the node's energy level and distance information are cared in context-awareness. This is not only increased the system's capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.

• 한국디지털정책학회:학술대회논문집
• /
• 2005.06a
• /
• pp.277-283
• /
• 2005

In this paper, the performance of high data rate-wirelesss personal area network(HDR-WPAN) system is analyzed under multi-path indoor channel. In the analysis, Saleh and Valenzuel channel model is used for the multi-path indoor channel. From the results, HDR-WPAN system has reliability of 10-5 at Eb/No = 18.5dB in multi-path indoor channel. It is a suitable performance for high data rate personal area network applications.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.641-643
• /
• 2000

CATV Network Management system of Korea is used for mainly monitor forward broadcasting signal because of the difficulty of tracking, measuring and control reverse path nosie. Thereby Purpose of this Structure is removing return Path noise of CATV Network for maintaining two way Netowrk Service of the Highest quality.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.79-90
• /
• 2015

Multipath routing technique is recognized as one of the effective approaches to improve the reliability of data forwarding. However, the traditional multipath routing focuses only on how many paths are needed to ensure a desired reliability. For this purpose, the protocols construct additional paths and thus cause significant energy consumption. These problems have motivated the study for the energy-efficient and reliable data forwarding. Thus, this paper proposes an energy-efficient concurrent multipath routing protocol with a small number of paths based on interaction between paths. The interaction between paths helps to reinforce the multipath reliability by making efficient use of resources. The protocol selects several nodes located in the radio overlapped area between a pair of paths as bridge nodes for the path-interaction. In order to operate the bridge node efficiently, when the transmission failure has detected by overhearing at each path, it performs recovery transmission to recover the path failure. Simulation results show that proposed protocol is superior to the existing multipath protocols in terms of energy consumption and delivery reliability.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.201-208
• /
• 2010

This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.103-114
• /
• 2008

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.