• The Journal of Society for e-Business Studies
• /
• v.7 no.1
• /
• pp.87-106
• /
• 2002

The behavioral and dynamic implications of an ERP implementation/installation are, to say the least, not well understood. Getting the switches set to enable the ERP software to go live is becoming straightforward. The really difficult part is understanding all of the dynamic interactions that accrue as a consequence. Dynamic causal and connectionist models are employed to facilitate an understanding of the dynamics and to enable control of the information-enhanced processes to take place. The connectionist model ran be analyzing (behind the scenes) the information accesses and transfers and coming If some conclusions about strong linkages that are getting established and what the behavioral implications of those new linkages and information accesses we. Ultimately, the connectionist model will come to an understanding of the dynamic, behavioral implications of the larger ERP implementation/installation per se. The underlying connectionist model will determine information transfers and workflow. Once a map of these two infrastructures is determined by the model, it becomes a relatively easy job for an analyst to suggest improvements in both. Connectionist models start with analog object structures and then use learning to produce mechanisms for managerial problem diagnoses. These mechanisms are neural models with multiple-layer structures that support continuous input/output. Based on earlier work performed and published by the author[10][11], a Connectionist ReasOning and LEarning System(CROLES) is developed that mimics the real-world reasoning infrastructure. Coupled with an explanation subsystem, this system can provide explanations as to why a particular reasoning structure behaved the way it did. Such a system operates in the backgmund, observing what is happening as every information access, every information response coming from each and every intelligent node (whether natural or artificial) operating within the ERP infrastructure is recorded and encoded. The CROLES is also able to transfer all workflows and map these onto the decision-making nodes of the organization.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.5-12
• /
• 2004

The data transformation between XML and Relation Database is made through the Principle of mapping bewtween them. There are two ways to access SQL Server, one is to assign SQL query to URL and the other is to use template file. MS-SQL server takes advantage of OpenXML function to transform the results of executing SQL query into XML documents. That is, OpenXML first makes node tree and then transforms row set data of XML documents into XML data of relation type. In order to insert XML data into database data. data is extracted from parsing XML documents using sp_xml_preparedocument procedure, and then the document structure is mapped into tree structure and stored in a table of database. Consequently, Data transformation between XML and Relation Database is made through mapping bewtween them. This article proposes the principle of mapping between XML and Relation Database and then shows the implementation of transformation between them so that it introduces the possibilty of bringing the extension and efficiency of data and various effects.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.129-137
• /
• 2016

To identify the cause of the error and maintain the health of system, an administrator usually analyzes event log data since it contains useful information to infer the cause of the error. However, because today's systems are huge and complex, it is almost impossible for administrators to manually analyze event log files to identify the cause of an error. In particular, as OpenStack, which is being widely used as cloud management system, operates with various service modules being linked to multiple servers, it is hard to access each node and analyze event log messages for each service module in the case of an error. For this, in this paper, we propose a novel message-based log analysis method that enables the administrator to find the cause of an error quickly. Specifically, the proposed method 1) consolidates event log data generated from system level and application service level, 2) clusters the consolidated data based on messages, and 3) analyzes interrelations among message groups in order to promptly identify the cause of a system error. This study has great significance in the following three aspects. First, the root cause of the error can be identified by collecting event logs of both system level and application service level and analyzing interrelations among the logs. Second, administrators do not need to classify messages for training since unsupervised learning of event log messages is applied. Third, using Dynamic Time Warping, an algorithm for measuring similarity of dynamic patterns over time increases accuracy of analysis on patterns generated from distributed system in which time synchronization is not exactly consistent.

• Korean Journal of Head & Neck Oncology
• /
• v.14 no.1
• /
• pp.61-69
• /
• 1998

Objectives: The response rate of the radioactive iodine(RI) therapy with low dose was variable. Only a few studies reported the response and complication rate with high dose. The goal of this study was to access the ablation and complication rate after high dose of RI therapy (more than 100mCi) and to evaluate the factors affect the results. Material and Methods: During a period of 12 years, 225 patients received high dose of RI from 100 to 200mCi depending on the RI uptake in the whole body after total thyroidectomy. 100mCi of RI was given to 123 patients for ablation who showed the uptake only in the thyroid bed. 150mCi was given to another 84 patients for ablation who had uptake confined to the neck. The other 21 patients took more than 200mCi of RI because the whole body scan showed distant metastasis. Among these patients, the ablation and the complication rate was investigated. Results: Elevated level of the serum thyroglobulin(Tg) decreased less than 5ng/ml after RI therapy in all patients except two in the first group. The second group showed reduction of the serum Tg in 93%. Eighteen of the 21 patients in the third group are still alive after RI therapy. There were no fatal complications after high dose RI therapy and most of the complications were minimal and transient. The complication rate was not related with the dose of RI, age, sex, DNA flowcytometry, serum thyroglobulin level and the extent of node dissection. Conclusion: We concluded that RI therapy with high dose was very effective for thyroid ablation after operation and it also showed excellent results with minimal complications for treatment of metastatic lesions.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.231-242
• /
• 2009

The EPC-Discovery Service (EPC-DS) is a good representative of the RFID Track & Trace. But this mechanism has several problems. EPC-DS uses centralized server scheme which may arise bottle-neck state and that cannot provide detail trace information of a RFID object. In addition, a trace node requires direct access method to a RFID object or an element which has information of the RFID object for Track & Trace. In this paper, we propose a novel RFID Track & Trace mechanism which based on the SIP presence model and SIP event notification. This mechanism can provide detail trace information and monitoring function, and also can rid the bottle-neck section by combination of SIP methods instead of centralized element.

• Journal of Advanced Navigation Technology
• /
• v.21 no.3
• /
• pp.306-311
• /
• 2017

In the future ubiquitous network, information will collect data from various sensors in the field. Since the sensor nodes are equipped with small, often irreplaceable, batteries with limited power capacity, it is essential that the network be energy-efficient in order to maximize its lifetime. In this paper, we propose an effective network routing method that can operate with low power as well as the transmission of data and information obtained from sensor networks, and identified the number of sensors with the best connectivity to help with the proper placement of the sensor. These purposes of this research are the development of the sensor middle-ware to integrate the maritime information and the proposal of the routing algorithm for gathering the maritime information of various sensors. In addition, for more secure ship navigation, we proposed a method to construct a sensor network using various electronic equipments that are difficult to access in a ship, and then construct a communication system using NMEA(the national marine electronics association), a ship communication standard, in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.413-420
• /
• 2006

HMIPv6 is designed to reduce the signaling load to external network and improve handover speed of MN by including Mobility Anchor Point(MAP) in local handover. However in this case of macro handover, it's just used pervious MIPv6 handover algorithm. So, it occurs packet loss and transmission delay problem. In this paper, we propose the mechanism applying the HMIPv6 for Fast Handover to choose suitable to the condition buffering handover. The condition for the selection is result distance measurement between MN and CN, between MN and NAR. Furthermore, using F-SNOOP protocol, it is possible to improve wireless network performance. Wireless network has high Bit Error Rate(BER) characteristic because of path loss, fading, noise and interference. TCP regards such errors as congestion and starts congestion control. This congestion control makes packet transmission rate low. However, F-SNOOP improves TCP performance based on SNOOP and Freeze TCP that use Zero Window Advertisement(ZWA) message when handoff occurs in wireless network.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.34-50
• /
• 2005

Recently, various proposals for supporting network mobility, which provides efficient Internet access when a network formed within a vehicle moves around as a unit, have emerged. The schemes in those proposals, though, manifest some major drawbacks with respect to scalability: If the number of mobile nodes within a mobile network is large, the handoff latency would increase greatly, causing communication disruption; Data delivery to a node within a nested mobile network nay suffer extremely inefficient pinball routing. We propose a scalable network mobility supporting mechanism named SNEMOS (Scalable NEtwork Mobility Support), which resolves the above two major problems of the existing schemes. The performance of SNEMOS is compared with the existing schemes through extensive simulations. The numerical results show that SNEMOS outperforms the existing schemes with respect to handoff latency hop counts of routing paths, packet delivery time, header overhead in data packets, and signaling overhead.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.907-917
• /
• 2006

In this paper, we propose a strategy to improve fault-tolerance and scalability of replicated services in mobile agent systems by applying an appropriate passive replication protocol for each replicated service according to whether the service is deterministic or non-deterministic. For this purpose, two passive replication protocols, PRPNS and PRPDS, are designed for non-deterministic and deterministic services respectively. They both allow visiting mobile agents to be forwarded to and execute their tasks on any node performing a service agent, not necessarily the primary agent. Especially, in the protocol PRPDS, after a backup service agent has received each mobile agent request and obtained its delivery sequence number from the primary service agent, the backup is responsible for processing the request and coordinating with the other replica service agents. Therefore, our strategy using the two proposed protocols can promise high scalability of replicated services a large number of mobile agents attempt to access in mobile agent systems. Our simulation results show that the proposed strategy performs much better than the one using only the traditional passive replication protocol.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.879-888
• /
• 2006

Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.