Journal of the Korea Society of Computer and Information
/
v.10
no.1
s.33
/
pp.101-112
/
2005
Recently, one of the most challenging Problems is to compose web services dynamically, that is, on demand. In particular, when a functionality that cannot be directly realized by existing services is required, existing services may be combined together to fulfill the request. This paper is to implement the dynamic composition of web services using existing workflow technologies. Workflow systems play a major role in E-businesses. However, due to the composition of web services using workflows differs from the design of traditional workflow systems, two problems need to be solved. (1) how to efficiently discover web services and (2) how to facilitate the interoperability of heterogeneous web services. In this paper, we present a matching algorithm for web service discovery and propose an approach based on the use of ontologies to facilitate the integration of web services. Finally, we have built a prototype system to illustrate how to the dynamic composition of web services are achieved.
The Java programming language is designed for developing effective applications in a heterogeneous network environment. Major problem in Java is its performance. many attractive features of Java make the development of software easy, but also make it expensive to support ; applications written in Java are often much slower than their counterparts written in C or C++. To use Java`s attractive features without the performance penalty, sophisticated optimizations and runtime systems are required. Optimising Java bytecode has several advantages. First, the bytecode is independent of any compiler that is used to generate it. Second, the bytecode optimization can be performed as a pre=pass to Just-In-Time(JIT) compilation. Many attractive features of Java make the development of software easy, but also make it expensive to support. The goal of this work is to develop automatic construction of code optimizer for Java bytecode. We`ve designed and implemented a Bytecode Optimizer that performs the peephole optimization, bytecode-specific optimization, and method-inlining techniques. Using the Classfile optimizer, we see up to 9% improvement in speed and about 20% size reduction in Java class files, when compared to average code using the interpreter alone.
The present work is aimed at providing additional new pure cultures of oxalate utilizing bacteria and its preliminary characterization for further work in the field of oxalate-metabolism and taxonomic studies. The taxonomy of 14 mesophilic, aerobic oxalotrophic bacteria isolated by an enrichment culture technique from soils rhizosphers, and the juice of the petiole/stem tissue of plants was investigated. Isolates were characterized with 95 morphological, biochemical and physiological tests. Cellular lipid components and carotenoids of isolates were also studied as an aid to taxonomic characterization. All isolates were Gram-negative, oxidase and catalase positive and no growth factors were required. In addition to oxalates, some of the strains grow on methanol and/or formate. The taxonomic similarities among isolates, reference strains or previously reported oxalotrophic bacteria were analysed by using the Simple Matching (S/ sub SM/) and Jaccard (S$\_$J/) Coefficients. Clustering was performed by using the unweighted pair group method with arithmetic averages (UPGMA) algorithm. The oxalotrophic strains formed five major and two single-member clusters at the 70-86% similarity level. Based on the numerical taxonomy, isolates were separated into three phenotypic groups. Pink-pigmented strains belonged to Methylobacterium extorquens, yellow-pigmented strains were most similar to Pseudomonas sp. YOx and Xanthobacter autorophicus, and heterogeneous non-pigmented strains were closely related to genera Azospirillum, Ancylobacter, Burkholderia and Pseudomonas. New strains belonged to the genera Pseudomonas, Azospirillum and Ancylobacter that differ taxonomically from other known oxalate oxidizers were obtained. Numerical analysis indicated that some strains of the yellow-pigmented and nonpigmented clusters might represent new species.
Journal of the Korea Institute of Information and Communication Engineering
/
v.12
no.12
/
pp.2207-2218
/
2008
Various kind of business process exists within enterprise. These business processes achieve business purposes while operate and control using eAI solution. However legacy systems-ERP, PDM are able to many cooperations and interoperability. Generally real data is becoming interoperability using query based on store-procedure on legacy system for business process transaction. Also, It may occur some problems among schema conversion, matching, mapping and other heterogeneous between data interoperability in process. We propose business process interoperability framework based on XMDR Hub that can guarantee interoperability between legacy systems using process that is consisted of SQL query based on store-procedure. It is easy to process data interoperability between legacy systems when business process execute.
I develop a matching model in which risk-averse workers face borrowing constraints and make a labor force participation decision as well as a job search decision. A sharp distinction between unemployment and out of the labor force is made: those who look for work for a certain period but find no job are classified as the unemployed and those who do not look for work are classified as those out of the labor force. In the model, the job search decision consists of two steps. First, each individual who is not working obtains information about employment opportunities. Second, each individual who decides to search has to take costly actions to find a job. Since individuals differ with respect to asset holdings, they have different reservation job-finding probabilities at which an individual is indifferent between searching and not searching. Individuals, who have large asset holdings and thereby are less likely to participate in the labor market, have high reservation job-finding probability, and they are less likely to search if they have less quality of information. In other words, if individuals with large asset holdings search for job, they must have very high quality of information and face very high actual job-finding probability. On the other hand, individuals with small asset holdings have low reservation job-finding probability and they are likely to search for less quality of information. They face very low actual job-finding probability and seem to remain unemployed for a long time. Therefore, differences in the quality of information explain heterogeneous job search decisions among individuals as well as higher job finding probability for those who reenter the labor market than for those who remain in the labor force. The effect of the extended maximum duration of unemployment insurance benefits on the aggregate labor market and the labor market flows is investigated. The benchmark benefit duration is set to three months. As maximum benefit duration is extended up to six months, the employment-population ratio decreases while the unemployment rate increases because individuals who are eligible for benefits have strong incentives to remain unemployed and decide to search even if they obtain less quality of information, which leads to low job-finding probability and then high unemployment rate. Then, the vacancy-unemployment ratio decreases and, in turn, the job-finding probability for both the unemployed and those out of the labor force decrease. Finally, the outflow from nonparticipation decreases with benefit duration because the equilibrium job-finding probability decreases. As the job-finding probability decreases, those who are out of the labor force are less likely to search for the same quality of information. I also consider the matching model with two states of employment and unemployment. Compared to the results of the two-state model, the simulated effects of changes in benefit duration on the aggregate labor market and the labor market flows are quite large and significant.
The standing Buddha named Taehwa 4 yew in the Jincheon were sculptured with rock cliff of the dark grey shale. Front of the Buddha statue shows $N40^{\circ}W$ strike with nearly vertical dip toward the back side. Rock blocks of the Buddha statue well developed with bedding and laminations whereas rock surface distributed into the various irregular discontinuities. Sculptured lines of the Buddha were uncertain because of degradation and exfoliations on the rock surface. The surface near the Buddha statue is highly contaminated with lichen and mosses, and accelerate physical and biological weathering owing to the roots of weed and bush along the fracture systems. For the conservational treatment, we treated with primary wet cleaning by air gun and secondary cleaning treatment using distilled water. Separated rock surface and fractured parts fasten and/or fill up the boundaries of the rock blocks using epoxy resin for conservation of rock properties. Some brittle surface was treatment with water repellent consolidant of ethyl silicates, and heterogeneous surface carried out color matching by acrylic pigments. Upper part of the Buddha statue dig out small ditch for rain water drainage, and near surface of the Buddha statue treat removal works for lichen, weeds and bush. The duration capacity of the Buddha constituting rocks are degraded by various weathering factors, therefore we suggest that this Buddha statue have need to do long term monitoring and synthetic conservation researches.
Recently XML is becoming a de facto standard for online data exchange between heterogeneous systems and also the research of streaming XML data filtering comes into the spotlight. Since streaming XML data filtering technique needs rapid matching of queries with XML data, it is required that the query processing should be efficiently performed. Until now, most of researches focused only on partial sharing of path expressions or efficient predicate processing and they were work for time and space efficiency. However, if containment relationship between queries is previously calculated and the lowest level query is matched with XML data, we can easily get a result that high level queries can match with the XML data without any other processing. That is, using this containment technique can be another optimal solution for streaming XML data filtering. In this paper, we suggest an efficient XML data filtering based on prime number indexing and containment relationship between queries. Through some experimental results, we present that our suggested method has a better performance than the existing method. All experiments have shown that our method has a more than two times better performance even though each experiment has its own distinct test purpose.
Journal of the Institute of Electronics Engineers of Korea CI
/
v.40
no.1
/
pp.19-29
/
2003
This paper presents a novel hybrid classifier for face recognition with artificially generated virtual training samples. We utilize both the nearest neighbor approach in feature angle space and a connectionist model to obtain a synergy effect by combining the results of two heterogeneous classifiers. First, a classifier called the nearest feature angle (NFA), based on angular information, finds the most similar feature to the query from a given training set. Second, a classifier has been developed based on the recall of stored frontal projection of the query feature. It uses a frontal recall network (FRN) that finds the most similar frontal one among the stored frontal feature set. For FRN, we used an ensemble neural network consisting of multiple multiplayer perceptrons (MLPs), each of which is trained independently to enhance generalization capability. Further, both classifiers used the virtual training set generated adaptively, according to the spatial distribution of each person's training samples. Finally, the results of the two classifiers are combined to comprise the best matching class, and a corresponding similarit measure is used to make the final decision. The proposed classifier achieved an average classification rate of 96.33% against a large group of different test sets of images, and its average error rate is 61.5% that of the nearest feature line (NFL) method, and achieves a more robust classification performance.
This study presents an application of hydro-mechanical coupled Particle Flow Code 3D (PFC3D) to simulation of fluid injection induced fault slip experiment conducted in Mont Terri Switzerland as a part of a task in an international research project DECOVALEX-2019. We also aimed as identifying the current limitations of the modelling method and issues for further development. A fluid flow algorithm was developed and implemented in a 3D pore-pipe network model in a 3D bonded particle assembly using PFC3D v5, and was applied to Mont Terri Step 2 minor fault activation experiment. The simulated results showed that the injected fluid migrates through the permeable fault zone and induces fault deformation, demonstrating a full hydro-mechanical coupled behavior. The simulated results were, however, partially matching with the field measurement. The simulated pressure build-up at the monitoring location showed linear and progressive increase, whereas the field measurement showed an abrupt increase associated with the fault slip We conclude that such difference between the modelling and the field test is due to the structure of the fault in the model which was represented as a combination of damage zone and core fractures. The modelled fault is likely larger in size than the real fault in Mont Terri site. Therefore, the modelled fault allows several path ways of fluid flow from the injection location to the pressure monitoring location, leading to smooth pressure build-up at the monitoring location while the injection pressure increases, and an early start of pressure decay even before the injection pressure reaches the maximum. We also conclude that the clay filling in the real fault could have acted as a fluid barrier which may have resulted in formation of fluid over-pressurization locally in the fault. Unlike the pressure result, the simulated fault deformations were matching with the field measurements. A better way of modelling a heterogeneous clay-filled fault structure with a narrow zone should be studied further to improve the applicability of the modelling method to fluid injection induced fault activation.
As we enter the knowledge society, the importance of information as a new form of capital is being emphasized. The importance of information classification is also increasing for efficient management of digital information produced exponentially. In this study, we tried to automatically classify and provide tailored information that can help companies decide to make technology commercialization. Therefore, we propose a method to classify information based on Korea Standard Industry Classification (KSIC), which indicates the business characteristics of enterprises. The classification of information or documents has been largely based on machine learning, but there is not enough training data categorized on the basis of KSIC. Therefore, this study applied the method of calculating similarity between documents. Specifically, a method and a model for presenting the most appropriate KSIC code are proposed by collecting explanatory texts of each code of KSIC and calculating the similarity with the classification object document using the vector space model. The IPC data were collected and classified by KSIC. And then verified the methodology by comparing it with the KSIC-IPC concordance table provided by the Korean Intellectual Property Office. As a result of the verification, the highest agreement was obtained when the LT method, which is a kind of TF-IDF calculation formula, was applied. At this time, the degree of match of the first rank matching KSIC was 53% and the cumulative match of the fifth ranking was 76%. Through this, it can be confirmed that KSIC classification of technology, industry, and market information that SMEs need more quantitatively and objectively is possible. In addition, it is considered that the methods and results provided in this study can be used as a basic data to help the qualitative judgment of experts in creating a linkage table between heterogeneous classification systems.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.