• 지능정보연구
• /
• 제17권1호
• /
• pp.1-16
• /
• 2011

실시간 유비쿼터스 환경은 센서로부터 얻어낸 데이터를 기반으로 상황을 인지하고 사용자에게 적절한 반응을 보이기까지 제한된 시간 내에 모든 것을 처리해야 한다. 전체적인 센서 데이터 처리는 센서로부터의 자료 확보, 상황 정보의 획득, 그리고 사용자로의 반응이라고 하는 과정을 거친다. 즉, 유비쿼터스 컴퓨팅 미들웨어는 입력된 센서 자료 및 데이터베이스 또는 지식베이스로부터 일련의 자료들을 활용하여 상황을 인식하며, 그 상황에 적합한 반응을 하게 된다. 그런데 실시간 환경의 특징 상 센서데이터가 들어오면 각 가용 자원들을 검색하고 그 곳에 있는 미들웨어가 데이터를 처리 할 경우 어느 정도의 대기 시간이 필요한지를 결정해야 한다. 또한 센서 데이터 처리의 우선순위가 높을 때는 미들웨어가 현재 처리중인 데이터를 언제 처리를 중지하고 얼마나 대기시켜야 하는지도 결정해야 한다. 그러나 이러한 의사결정에 대한 연구는 아직 활발하지 않다. 따라서 본 논문에서는 유비쿼터스 미들웨어가 이미 센서 데이터를 처리하고 있고 동시에 새로운 센서 데이터를 처리해야 할 때 각 작업의 최적 대기시간을 계산하고 스케줄링하는 알고리즘을 제안한다.

• East Asian mathematical journal
• /
• 제30권2호
• /
• pp.149-172
• /
• 2014

The problems of optimization addressed in the high school curriculum are usually posed in real-life contexts. However, because of the instructional purposes, problems are artificially constructed to suit computation, rather than to reflect real-life problems. Those problems have thus limited use for teaching 'practicalities', which is one of the goals of mathematics education. This study, by utilizing 'GeoGebra', suggests the optimization problem solving related to the quadratic curve, using the contour-line method which contemplates the quadratic curve changes successively. By considering more realistic situations to supplement the limit which deals only with numerical and algebraic approach, this attempt will help students to be aware of the usefulness of mathematics, and to develop interests in mathematics, as well as foster students' integrated thinking abilities across units. And this allows students to experience a variety of math.

• Journal of Computing Science and Engineering
• /
• 제6권3호
• /
• pp.207-218
• /
• 2012

In recent years, the skyline query paradigm has been established as a reliable method for database query personalization. While early efficiency problems have been solved by sophisticated algorithms and advanced indexing, new challenges in skyline retrieval effectiveness continuously arise. In particular, the rise of the Semantic Web and linked open data leads to personalization issues where skyline queries cannot be applied easily. We addressed the special challenges presented by linked open data in previous work; and now further extend this work, with a heuristic workflow to boost efficiency. This is necessary; because the new view on linked open data dominance has serious implications for the efficiency of the actual skyline computation, since transitivity of the dominance relationships is no longer granted. Therefore, our contributions in this paper can be summarized as: we present an intuitive skyline query paradigm to deal with linked open data; we provide an effective dominance definition, and establish its theoretical properties; we develop innovative skyline algorithms to deal with the resulting challenges; and we design efficient heuristics for the case of predicate equivalences that may often happen in linked open data. We extensively evaluate our new algorithms with respect to performance, and the enriched skyline semantics.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제14권4호
• /
• pp.391-406
• /
• 2014

The performance of General-Purpose computation on Graphics Processing Units (GPGPU) is heavily dependent on the memory access behavior. This sensitivity is due to a combination of the underlying Massively Parallel Processing (MPP) execution model present on GPUs and the lack of architectural support to handle irregular memory access patterns. Application performance can be significantly improved by applying memory-access-pattern-aware optimizations that can exploit knowledge of the characteristics of each access pattern. In this paper, we present an algorithmic methodology to semi-automatically find the best mapping of memory accesses present in serial loop nest to underlying data-parallel architectures based on a comprehensive static memory access pattern analysis. To that end we present a simple, yet powerful, mathematical model that captures all memory access pattern information present in serial data-parallel loop nests. We then show how this model is used in practice to select the most appropriate memory space for data and to search for an appropriate thread mapping and work group size from a large design space. To evaluate the effectiveness of our methodology, we report on execution speedup using selected benchmark kernels that cover a wide range of memory access patterns commonly found in GPGPU workloads. Our experimental results are reported using the industry standard heterogeneous programming language, OpenCL, targeting the NVIDIA GT200 architecture.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5231-5248
• /
• 2016

As a service-oriented paradigm, web service composition has obtained great attention from both academia and industry, especially in the area of cloud service. Nowadays more and more web services providing the same function but different in QoS are available in cloud, so an important mission of service composition strategy is to select the optimal composition solution according to QoS. Furthermore, the selected composition solution should satisfy the service level agreement (SLA) which defines users' request for the performance of composite service, such as price and response time. A composite service is feasible only if its QoS satisfies user's request. In order to obtain composite service with the optimal QoS and avoid SLA violations simultaneously, in this paper we first propose a QoS evaluation method which takes the SLA satisfaction into account. Then we design a service selection algorithm based on our QoS evaluation method. At last, we put forward a parallel running strategy for the proposed selection algorithm. The simulation results show that our approach outperforms existing approaches in terms of solutions' optimality and feasibility. Through our running strategy, the computation time can be reduced to a large extent.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2008년도 춘계 종합학술대회 논문집
• /
• pp.116-120
• /
• 2008

스마트 카메라는 종래의 획득한 영상을 압축하여 전송하는 네트워크 카메라 기능에 더하여, 획득한 영상을 해석하여 상황을 인지하고 이에 따른 실시간 조치가 가능한 지능 비젼 기능을 추가적으로 갖춘 카메라이다. 지능 비젼 알고리즘들은 연산량이 많다. 따라서 싱글 CPU로 영상을 압축하고 전송하는 일 뿐만 아니라 지능 비젼 처리까지 모두 실시간으로 처리하기에는 무리가 있다. Texas Instruments 사가 제공하는 다빈치 프로세서는 ARM 코어와 DSP 코어의 듀얼 코어이며 네트워킹 인터페이스 및 비디오 획득 인터페이스를 비롯하여 디지털 비디오 응용 임베디드 제품 개발에 필요한 다양한 I/O을 지원하는 인기 있는 ASSP(Application Specific Standard Product)이다. 본 논문에서는 다빈치 프로세서 기반 스마트 카메라의 S/W 를 설계하고 구현한 결과를 기술한다. 얼굴 검출 응용을 예로 구현하였고 동작이 잘 수행됨을 확인하였다. 향후 보다 광범위하고 실시간으로 동작되는 비젼 기능이 지원되는 스마트 카메라 개발을 위해 보다 효율적인 비젼 응용 S/W 구조와 알고리즘의 최적화에 대한 연구가 필요하다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5744-5764
• /
• 2018

In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

• International Journal of Computer Science & Network Security
• /
• 제22권3호
• /
• pp.364-374
• /
• 2022

Health information systems (HIS) are facing security challenges on data privacy and confidentiality. These challenges are based on centralized system architecture creating a target for malicious attacks. Blockchain technology has emerged as a trending technology with the potential to improve data security. Despite the effectiveness of this technology, still HIS are suffering from a lack of data privacy and confidentiality. This paper presents a blockchain-based data storage security architecture integrated with an e-Health care system to improve its security. The study employed a qualitative research method where data were collected using interviews and document analysis. Execute-order-validate Fabric's storage security architecture was implemented through private data collection, which is the combination of the actual private data stored in a private state, and a hash of that private data to guarantee data privacy. The key findings of this research show that data privacy and confidentiality are attained through a private data policy. Network peers are decentralized with blockchain only for hash storage to avoid storage challenges. Cost-effectiveness is achieved through data storage within a database of a Hyperledger Fabric. The overall performance of Fabric is higher than Ethereum. Ethereum's low performance is due to its execute-validate architecture which has high computation power with transaction inconsistencies. E-Health care system administrators should be trained and engaged with blockchain architectural designs for health data storage security. Health policymakers should be aware of blockchain technology and make use of the findings. The scientific contribution of this study is based on; cost-effectiveness of secured data storage, the use of hashes of network data stored in each node, and low energy consumption of Fabric leading to high performance.

• 한국컴퓨터정보학회논문지
• /
• 제19권3호
• /
• pp.63-71
• /
• 2014

본 논문에서는 CDMA2000 1xEV-DO의 매체 접근 제어 계층에서 현재 순방향 오류 정정 방법으로 사용되고 있는 리드-솔로몬 복호화 과정의 수행 시간을 다양한 채널 조건에서 분석하였다. 그 결과, 트래픽 채널의 패킷 손실률이 특정 수준 이상으로 높을 경우 리드-솔로몬 복호기의 수행 시간이 길어져 MPEG-4 비디오의 시간 제약을 보장할 수없음을 확인하였다. 이러한 문제를해결하기 위해서본 연구에서는3가지의 기법을제시하였다. 첫째, 정적기법은 패킷 손실률이 특정 임계값 이상일 경우 리드-솔로몬 복호를 생략함으로써 MPEG-4의 시간 제약을 맞춘다. 두 번째 동적 기법은 패킷 손실률이 높더라도 모든 리드-솔로몬 복호를 생략하지는 않고MPEG-4의 시간 제약을 맞출 수 있는 범위 안에서 최대한으로 복구를 수행한다. 마지막 기법인 비디오 인지 동적 기법은 동적 기법과 비슷하지만 비디오 복호에 대한 기여도에 따른 우선 순위 기반으로 복구를 함으로써 비디오의 품질을 더욱 향상시키는 것이다. 우리는 본 논문에서 제안한 기법들을 활용하는 것이 실시간 비디오방송의 서비스 품질을 크게 향상시킬 수 있음을 다양한 실험을 통해 입증하였다.