• The Journal of Society for e-Business Studies
• /
• v.12 no.4
• /
• pp.145-163
• /
• 2007

Service-Oriented Architecture is a style of information systems that enables the creation of applications that are built by combining loosely coupled and interoperable services. A service is an implementation of business functionality with proper granularity and invoked with well-defined interface. In service modeling, when the granularity of a service is finer, the reusability and flexibility of the service is lower. For solving this problem concerns with the service granularity, it is critical to identify and define coarse-grained services from the domain analysis model. In this paper, we define the process to identify services from the Use Case model elicited from domain analysis. A task tree is derived from Use Cases and their descriptions, and Use Cases are reconstructed by the composition and decomposition of the task tree. Reconstructed Use Cases are defined and specified as services. Because our method is based on the widely used UML Use Case models, it can be helpful to minimize time and cost for developing services in various platforms and domains.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1117-1123
• /
• 2015

Use The Use Case Points method is a software estimation method that is based on user requirements. When requirement analysts elicit user requirements, they obtain different use cases because different levels of detail are possible for the Use Case, and this affects the Use Case Points. In this paper, we suggest a method to refine the level of detail of the Use Case by using the concept of an elementary function. This refinement method achieves the desired reliability for the Use Case Points because it produces less of a deviation in the Use Case Points for different requirement analysts than other methods that are based on the step, transaction, and narrative of the Use Case.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.352-354
• /
• 2005

1990년대 후반에 들어서면서 않은 기업들이 기업의 생산성 향상 및 고객 서비스를 위해 IT투자를 확대해감에 따라 기업 내에서도 다수의 이질적인 시스템 도입을 추진하게 되었다. 그 결과 않은 기업 내에는 호환성이 없는 시스템이 산재해 업무추진에 어려움을 주고 있으며, 이러한 복잡하고 까다로운 분산화된 시스템을 통합하고자 업계에서는 많은 노력을 기울이게 되었다. 그 결과로 등장한 기술이 웹서비스이며 이것은 분산화된 시스템을 통합하는 기존의 통합기술들의 문제점을 해결하고 분산된 애플리케이션을 저비용${\cdot}$고효율로 통합하기 위한 대안이 되었다. 본 논문에서는 웹서비스기반 시스템 개발을 위한 웹서비스 개발 절차를 제시하고 비즈니스 도메인에서 요구사항 분석을 통해 생성된 유스케이스모델을 기반으로 하는 웹 서비스 식별 방법을 제안한다. 유스케이스를 기반으로 서비스를 식별하므로 서비스에 도메인의 비즈니스가 잘 반영되도록 할 수 있으며 적절한 입도(granularity)을 갖는 서비스를 식별할 수 있다.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.61-70
• /
• 2013

The increasing number of mobile users and the popularity of real-time applications make wired-wireless integrated network extremely attractive. In this case, quality of service (QoS) adaptability is particularly important since some important features of the integrated network call for QoS adaptability, such as mobility, bursty applications and so on. Traditional QoS schemes include integrated service (IntServ) and differentiated service (DiffSev) as well as their variants. However, they are not able to balance well between scalability and QoS granularity. For example, IntServ faces the scalability problem, while DiffServ can only provide coarse granular QoS. In addition, they are also unable to efficiently support QoS adaptability. Therefore, a per-packet differentiated queueing service (DQS) was proposed. DQS was originally proposed to balance between scalability and QoS granularity in wired networks and then extended to wireless networks. This paper mainly discusses how to use DQS to support QoS adaptability in wired-wireless integrated networks. To this end, we propose a scheme to determine dynamic delay bounds, which is the key step to implement DQS to support QoS adaptability. Simulation studies along with some discussions are further conducted to investigate the QoS adaptability of the proposed scheme, especially in terms of its support of QoS adaptability to mobility and to bursty real-time applications.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.51-60
• /
• 2006

The paradigm in biology is currently changing from that of conducting hypothesis-driven individual experiments to that of utilizing the results of a massive data analysis with appropriate computational tools. We present LayMap, an implemented visualization system that helps the user to deal with a high volume of the biomedical literature such as MEDLINE, through the layered maps that are constructed on the results of an information extraction system. LayMap also utilizes filtering and granularity for an enhanced view of the results. Since a biomedical information extraction system gives rise to a focused and effective way of slicing up the data space, the combined use of LayMap with such an information extraction system can help the user to navigate the data space in a speedy and guided manner. As a case study, we have applied the system to datasets of journal abstracts on 'MAPK pathway' and 'bufalin' from MEDLINE. With the proposed visualization, we have successfully rediscovered pathway maps of a reasonable quality for ERK, p38 and JNK. Furthermore, with respect to bufalin, we were able to identify the potentially interesting relation between the Chinese medicine Chan su and apoptosis with a high level of detail.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.1-17
• /
• 2007

As XML is becoming a de facto standard for distribution and sharing of information, the need for an efficient yet secure access of XML data has become very important. To enforce the fine-level granularity requirement, authorization models for regulating access to XML documents use XPath which is a standard for specifying parts of XML data and a suitable language for both query processing. An access control environment for XML documents and some techniques to deal with authorization priorities and conflict resolution issues are proposed. Despite this, relatively little work has been done to enforce access controls particularly for XML databases in the case of query access. Developing an efficient mechanism for XML databases to control query-based access is therefore the central theme of this paper. This work is a proposal for an efficient yet secure XML access control system. The basic idea utilized is that a user query interaction with only necessary access control rules is modified to an alternative form which is guaranteed to have no access violations using tree-aware metadata of XML schemes and set operators supported by XPath 2.0. The scheme can be applied to any XML database management system and has several advantages over other suggested schemes. These include implementation easiness, small execution time overhead, fine-grained controls, and safe and correct query modification. The experimental results clearly demonstrate the efficiency of the approach.