• Analytical Science and Technology
• /
• v.24 no.6
• /
• pp.510-518
• /
• 2011

Recent developments and improvements of multiple technological elements including mass spectrometry (MS) instrument, multi-dimensional chromatographic separation, and software tools processing MS data resulted in benefits of large scale proteomics analysis. However, its throughput is limited by the speed and reproducibility of the protein digestion process. In this study, we demonstrated a new method for rapid proteolytic digestion of proteins using acoustic technology. Tryptic digests of BSA prepared at various conditions by super acoustic for optimization time and intensity were analyzed by LC-MS/MS showed higher sequence coverage in compared with traditional 16 hrs digestion method. The method was applied successfully for complex proteins of a breast cancer cells at 30 min of digestion at intensity 2. This new application reduces time-consuming of sample preparation with better efficiency, even with large amount of proteins, and increases high-throughput process in sample preparation state.

• Journal of Intelligence and Information Systems
• /
• v.8 no.1
• /
• pp.141-157
• /
• 2002

extensible Markup Language (XML) is a new markup language for data exchange on the Internet. In this paper, we propose a language extensible Rule Markup Language (XRML) which is an extension of XML. The implicit rules embedded in the Web pages should be identifiable, interchangeable with structured rule format, and finally accessible by various applications. It is possible to realize by using XRML. In this light, Web based Knowledge Management Systems (KMS) can be integrated with rule-based expert systems. To meet this end, we propose the six design criteria: Expressional Completeness, Relevance Linkability, Polymorphous Consistency, Applicative Universality, Knowledge Integrability and Interoperability. Furthermore, we propose three components such as RIML (Rule Identification Markup Language), RSML (Rule Structure Markup Language) and RTML (Rule Triggering Markup Language), and the Document Type Definition DTD). We have designed the XRML version 0.5 as illustrated above, and developed its prototype named Form/XRML which is an automated form processing for disbursement of the research fund in the Korea Advanced Institute of Science and Technology (KAISI). Since XRML allows both human and software agent to use the rules, there is huge application potential. We expect that XRML can contribute to the progress of Semantic Web platforms making knowledge management and e-commerce more intelligent. Since there are many emerging research groups and vendors who investigate this issue, it will not take long to see XRML commercial products. Matured XRML applications may change the way of designing information and knowledge systems in the near future.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.10
• /
• pp.89-100
• /
• 2007

Consumer Portal is defined as "a combination of hardware and software that enables two-way communication between energy service provider(ESP, like KEPCO) and equipment within the consumer's premises". The portal provides both a physical link(between wires, radio waves, and other media) and a logical link(translating among language-like codes and etiquette-like protocols) between in-building and wide-area access networks. Thus, the consumer portal is an important, open public shared infrastructure in the future vision of energy services. In this paper, we describe a new methodology for local communication and computer network capacity design of consumer portal, and also presents capacity calculation method using a network system limitation factors. By the approach, we can check into the limitations of existing methods, and propose an improved data processing algorithm that can expand the maximum number of the networked end-use devices up to $30{\sim}40$ times. For validation, we applies the proposed methode to our real system design. Our contribution will help electrical power information network design.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.127-136
• /
• 2010

A wireless sensor network(WSN) which roles as a mediator between living environment and computers in ubiquitous computing is very essential research area. Due to the constraint that sensor nodes should work in very resource-restricted circumstances, an operating system that can manage resources effectively is demanded. Also, a sensor network should be able to deal with many events quickly and simultaneously in order to respond to various physical changes in outer environment. The Sensor Network Operating System such as TinyOS, MANTIS and NanoQplus is much designed so that it can satisfy such requirement. But, for programmers who develop application program for sensor networks, they have lack of frameworks which the development is easily possible from restricted development environment. In this paper for this, we implemented a state machine framework apt for responsive systems in NanoQplus which is multi-thread-based sensor network operating system. In addition we propose an event broker module(EBM) for effective event dispatching, a message data structure for message sharing among state machines, and an execution module that handles messages and their queue and performs state transition of the machines. Furthermore, we could do the development more easily an application program with a state-based framework by developing CASE tools.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.12 no.2
• /
• pp.13-29
• /
• 2001

The study examined the current status and the use of electronic publishing files to produce a bibliographic database. In particular . it examined the problems faced in the production of KoreaMed, an abstract database of Korean medical journals. The methodology of KoreaMed to utilize the computer files which was produced in the process of publication of a print journal is found to be very effective. It assures the accuracy of data, accelerates the input speeds, and reduces the input costs. However, such a project can not be accomplished to a satisfactory level without the cooperation of the publishers involved. It turns out that many small publishers and academic societies hardly have saved the electronic publishing files of previous issues. Besides, it is hard to maintain the right channel to receive the files continuously. The input and processing of special characters are very delicate problems. In addition, the diversity of layout and formats of journals, of the electronic publishing software used, and of the storage media, makes the utilization of the electronic publishing files a very complex process. In order to operate the KoreaMed system more efficiently by requiring the publishers to submit XML files which meets the standard of the KoreaMed, it is necessary to educate and train personnels of journal publishers for the management of electronic publishing files.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.45-52
• /
• 2006

To perform on-line maintenance for Distributed Information System, it is indispensable to disseminate files to participant nodes in the network. When users' requests for file deployment occur simultaneously in a short period a deployment server falls into overload phase, which is often called Flash Crowds. h common solution to avoid Flash Crowds is to increase hardware capacity. In this paper, we propose a software solution based on P2P, which does not cost any additional expense. In the proposed solution, nodes in the network are grouped into subnetworks one of which is composed of only neighboring nodes. In each subnetwork, copies of deployment files can be transferred to each other. Consequently, it brings about the effect of load balancing in deployment server. To raise the effectiveness, target files for deployment are packed into one package. Before being transferred, each package is divided into multiple equal-sized segments. A deployment server in a normal phase transmits a package requested from nodes in segment units. However a deployment server is overloaded, if segments already exist in the subnetwork participant nodes in the subnetwork receive necessary segments from neighboring nodes. In this paper, we propose data structures and algorithm for this approach and show performance improvement through simulation.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.1
• /
• pp.57-64
• /
• 2015

Activity recognition technology is gaining attention because it can provide useful information follow user's situation. In research of activity recognition before smartphone's dissemination, we had to infer user's activity by using independent sensor. But now, with development of IT industry, we can infer user's activity by using inner sensor of smartphone. So, more animated research of activity recognition is being implemented now. By applying activity recognition system, we can develop service like recommending application according to user's preference or providing information of route. Some previous activity recognition systems have a defect using up too much energy, because they use GPS sensor. On the other hand, activity recognition system which Google released recently (Google Activity Recognition) needs only a few power because it use 'Network Provider' instead of GPS. Thus it is suitable to smartphone application system. But through a result from testing performance of Google Activity Recognition, we found that is difficult to getting user's exact activity because of unnecessary activity element and some wrong recognition. So, in this paper, we describe problems of Google Activity Recognition and propose AGAR(Advanced Google Activity Recognition) applied method to improve accuracy level because we need more exact activity recognition for new service based on activity recognition. Also to appraise value of AGAR, we compare performance of other activity recognition systems and ours and explain an applied possibility of AGAR by developing exemplary program.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.1
• /
• pp.37-44
• /
• 2015

In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In our past study, we defined a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also defined a new measure, called the expanded ego betweenness centrality. In this paper, We propose algorithm that quickly computes expanded ego betweenness centrality by exploiting structural properties of expanded ego network. Through the experiment with virtual network used Barab$\acute{a}$si-Albert network model to represent the generic social network and facebook network to represent actual social network, We show that the node's importance rank based on the expanded ego betweenness centrality has high similarity with that the node's importance rank based on the existing betweenness centrality. We also show that the proposed algorithm computes the expanded ego betweenness centrality quickly than existing algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.5
• /
• pp.231-240
• /
• 2015

Medical imagery require to protect the privacy with preserving the quality of the original contents. Therefore, reversible watermarking is a solution for this purpose. Previous researches have focused on general imagery and achieved high capacity and high quality. However, they raise a distortion over entire image and hence are not applicable to medical imagery which require to preserve the quality of the objects. In this paper, we propose a novel reversible watermarking for medical imagery, which preserve the quality of the objects and achieves high capacity. First, object and background region is segmented and then predicted error histogram-based reversible watermarking is applied for each region. For the efficient watermark embedding with small distortion in the object region, the embedding level at object region is set as low while the embedding level at background region is set as high. In experiments, the proposed algorithm is compared with the previous predicted error histogram-based algorithm in aspects of embedding capacity and perceptual quality. Results support that the proposed algorithm performs well over the previous algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.5
• /
• pp.225-230
• /
• 2015

In this paper, we propose an effective real-time visual loop closure detector, VILODE, which makes use of key frames and bag of visual words (BoW) based on SURF feature points. In order to determine whether the camera has re-visited one of the previously visited places, a loop closure detector has to compare an incoming new image with all previous images collected at every visited place. As the camera passes through new places or locations, the amount of images to be compared continues growing. For this reason, it is difficult for a visual loop closure detector to meet both real-time constraint and high detection accuracy. To address the problem, the proposed system adopts an effective key frame selection strategy which selects and compares only distinct meaningful ones from continuously incoming images during navigation, and so it can reduce greatly image comparisons for loop detection. Moreover, in order to improve detection accuracy and efficiency, the system represents each key frame image as a bag of visual words, and maintains indexes for them using DBoW database system. The experiments with TUM benchmark datasets demonstrates high performance of the proposed visual loop closure detector.