http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
아지즈나스리디노프 ( Aziz Nasridinov ),김경욱 ( Kyoungwook Kim ),변정용 ( Jeongyong Byun ) 한국정보처리학회 2009 한국정보처리학회 학술대회논문집 Vol.16 No.2
Since the amount of available Web Services keeps growing and thus the problem occurs - how to find an appropriate web service matching the requirements amongst the vast majority of available. This research sets the following objective to be accomplished: to assist proper service selection by semantically describing customer’s goals and provider’s web service capability by means of carefully designed ontologies and logical expressions, and illustrate matching cases of customer’s requirements and web services capabilities.
아지즈나스리디노프 ( Aziz Nasridinov ),김경욱 ( Kyoungwook Kim ),변정용 ( Jeongyong Byun ) 한국정보처리학회 2009 한국정보처리학회 학술대회논문집 Vol.16 No.1
Web services provide the possibility of dynamically integrating distributed service components scattered over the Internet to fulfill sophisticated business demands. However due to today’s wide variety of services offered to perform a specific task, it’s essential that users are supported in the eventual selection of appropriate services. An example of web services for which selection of appropriate services will be crucial is Auto Repair Services. Selecting proper service from a variety of Auto Part Shops would be result of delivering high-quality service and minimizing Auto Repair Service customer’s waiting time. Therefore, in this research to assist selecting proper service, we present Functional-Level Mediator and illustrate its usage in matching customer’s and web service’s goals. Five matching cases have been analyzed and results from experiment have been shown. Also, taking advantage of implementing multithreaded web services which reflects concurrent activity in the real world more naturally, we have significantly minimized customer’s waiting time at Auto Repair Service.
아지즈나스리디노프 ( Aziz Nasridinov ),변정용 ( Jeongyong Byun ) 한국정보처리학회 2010 한국정보처리학회 학술대회논문집 Vol.17 No.1
Since in web service composition, the same service may be offered by different providers with different Quality of Services (QoS) attributes, selection criteria are needed to select which Web Services will be considered for composition. Location of provider can be one of these criteria and intends to decrease the number of remote interactions between providers as well as reducing waiting time of service consumer. Therefore in this paper, we present technique for composing web services according to their location by semantically describing customer’s goals and provider’s web service capability by means of carefully designed ontology and logical expression.
WS -트랜잭션의 확장된 적시적 장기수행 트랜잭션 관리 전략
림청 ( Lin Qing ),아지즈나스리디노프 ( Aziz Nasridinov ),변정용 ( Jeongyong Byun ) 한국정보처리학회 2011 한국정보처리학회 학술대회논문집 Vol.18 No.1
Timely management is an important activity in long running transactions. This can be seen in many Supply Chain scenarios where insufficient time management could lead to expensive compensations. Therefore, effective strategy for timely management in long running transactions is needed. In this paper, we propose our solution to detect and avoid violating deadline based on a comparison strategy of predicted complete time and required deadline. Three approaches are used. Firstly, we build Open Nested Transaction Model (ONTM) where deadline of top-level transactions are managed through a flexible time adjustment of lower level transactions. Secondly, workflow is introduced to WS-Transaction framework which supports the algorithm to predict complete time and spot delaying activities. Thirdly, a rule-based coordinator is developed to decide the confirmation or cancelation of participants’ ongoing activities. We also discuss a workflow example for implementation.
밤복흥 ( Pham Phuoc Hung ),아지즈나스리디노프 ( Aziz Nasridinov ),변정용 ( Jeongyong Byun ) 한국정보처리학회 2011 한국정보처리학회 학술대회논문집 Vol.18 No.1
When SOAP message in Web Services has sensitive and important data, it is necessary to protect the message from XML rewriting attacks. These attacks create a foundation for typical faults in SOAP message and make it vulnerable to use in Web Service environment. Currently, Web Services middleware offers limited functions to detect these faults and possibly fix them. In this paper, we propose a Security Description Assistance which identifies and fixes typical faults in SOAP messages. Our system adapts simulation-based approach, which allows system to self-optimize its performance in different conditions and thus improve the reliability of Web Services.
키넥트를 이용한 뼈대 휘어짐으로 발생할 수 있는 질병 분석기법
진하연 ( Ha Yeon Jin ),아지즈나스리디노프 ( Aziz Nasridinov ),김영균 ( Younggyun Kim ) 한국정보처리학회 2017 한국정보처리학회 학술대회논문집 Vol.24 No.1
본 연구는 사회적으로 문제가 되는 질병들을 사전에 예방하기 위한 연구로 키넥트라는 장비를 이용하여 사람의 골격을 촬영하여 뼈대의 휘어짐을 분석하여 뼈대의 휘어짐 상태를 사용자에게 알려준다. 또한 그에 따라 유발될 수 있는 질병들을 예측하여 알려주고 사용자가 질병을 예방할 수 있도록 도와주는 시스템에 대해 연구하였다. 본 논문에서 제안한 시스템은 질병 예방으로 건강관리, 생활 습관 개선, 의료비용절감 등에 활용이 가능할 것이다.
림청 ( Lin Qing ),아지즈나스리디노프 ( Aziz Nasridinov ),변정용 ( Jeongyong Byun ) 한국정보처리학회 2010 한국정보처리학회 학술대회논문집 Vol.17 No.2
Business transactional process is usually long running computation which requests services from multiple enterprises. Web Services Transaction specification (WS-TX) defines a protocol, WSBusinessActivity which is specifically designed for such lengthy interaction and maintains overall consistency through compensation. However timely web services transaction is prone to compensate due to tasks’ missing deadline. Therefore, this paper proposes a reservation-based protocol which is used to select providers who can provide resources promptly and deselect ones who may fail. And this selection happens during resource reservation phase and before real commitment. In this way, we achieve the goal of minimizing transactions’ compensation. Finally, we design the framework architecture for the proposed protocol that is extended from WS-BusinessActivity.
밤복흥 ( Pham Phuoc Hung ),아지즈나스리디노프 ( Aziz Nasridinov ),림청 ( Lin Qing ),변정용 ( Jeongyong Byun ) 한국정보처리학회 2011 한국정보처리학회 학술대회논문집 Vol.18 No.2
Nowadays Web Services are one of the most rapidly developed technologies and have become platform for eecommerce as well as B2B model. Therefore, when Web Services use SOAP as a protocol for communication, their security should be considered. However, those SOAP messages are prone to XML attacks that can create a foundation for typical faults and make it vulnerable to use. Unfortunately, recent researches established that solutions to deal with these problems have several limitations. In this paper, we explore attacks on SOAP messages and also provide confidentiality and integrity solutions. It is a tolerant scheme which is able to automatically detect and fix typical faults occurred in SOAP messages to combat with the security threats in order to improve its reliability.
다차원 데이터 및 동적 이용자 선호도를 위한 색인 구조의 연구
최종혁,유관희,나스리디노프 아지즈 사단법인 인문사회과학기술융합학회 2017 예술인문사회융합멀티미디어논문지 Vol.7 No.7
R-tree is index structure which is frequently used for handling spatial data. However, if the number of dimensions increases, or if only partial dimensions are used for searching the certain data according to user preference, the time for indexing is greatly increased and the efficiency of the generated R-tree is greatly reduced. Hence, it is not suitable for the multidimensional data, where dimensions are continuously increasing. In this paper, we propose a multidimensional hash index, a new multidimensional index structure based on a hash index. The multidimensional hash index classifies data into buckets of euclidean space through a hash function, and then, when an actual search is requested, generates a hash search tree for effective searching. The generated hash search tree is able to handle user preferences in selected dimensional space. Experimental results show that the proposed method has better indexing performance than R-tree, while maintaining the similar search performance. 다차원 색인 구조 중 대표적인 것은 R-tree에 기초한 색인으로써 공간 정보 등에 있어 강력한 성능을 보인다. 하지만 R-tree의 경우 차원의 수가 증가하거나 이용자 선호에 따라 부분 차원만을 이용하는 경우, 색인을 생성하는 시간이 크게 증가하고 생성된 색인의 효율성이 감소하는 문제를 갖고 있다. 따라서 지속적으로 차원이 증가하고 있는 최근의 다차원 데이터에는 해당 방법들은 적합하지 않다. 본 논문에서는 이런 문제를 해결하기 위해 해시 색인에 기반한 새로운 다차원 색인 구조인 다차원 해시 색인을 제안한다. 다차원 해시 색인은 해시 함수를 통해 데이터들을 유클리드 공간의 버킷들로 분류하여 색인을 생성하고 이후 탐색이 요청되었을 때 이용자 선호도에 따라 선택된 부분 차원의 공간을 탐색할 수 있는 해시 탐색 트리를 생성하여 효과적인 탐색을 수행한다. 실험 결과, 해당 기법은 R-tree와 비교하여 색인 생성에 있어 매우 큰 성능의 향상과 함께 탐색에서도 유사한 탐색 성능을 보이는 것을 확인할 수 있었다.