• Title/Summary/Keyword: Problem Space

Search Result 3,980, Processing Time 0.032 seconds

A Simplified 3D-Location Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 저복잡도 3차원 무선측위 기법)

  • Hoang, Quan T.;Kim, Kwang-Yul;Shin, Yo-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9C
    • /
    • pp.573-580
    • /
    • 2011
  • WSNs (Wireless Sensor Networks) are becoming more widely used in various fields, and improving localization performance is a crucial and essential issue for sensor network applications. In this paper, we propose a low-complexity localization mechanism for WSNs that operates in 3D (Three-Dimensional) space. The basic idea is to use aerial vehicles or flying objects that are deliberately equipped with the anchor nodes. These anchor nodes periodically broadcast beacon signals containing their current locations, and the unknown nodes receive these signals as soon as they enter the communication range of the anchors. We estimate the locations of the unknown nodes based on the proposed scheme that transforms the 3D problem into 2D computations to reduce the complexity of 3D localization. Simulated results show that our approach is an effective scheme for 3D self-positioning in WSNs.

A Neural Network-based Artificial Intelligence Algorithm with Movement for the Game NPC (게임 NPC를 위한 신경망 기반의 이동 안공지능 알고리즘)

  • Joe, In-Whee;Choi, Moon-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1181-1187
    • /
    • 2010
  • This paper proposes a mobile AI (Artificial Intelligence) conducting decision-making in the game through education for intelligent character on the basis of Neural Network. Neural Network is learned through the input/output value of the algorithm which defines the game rule and the problem solving method. The learned character is able to perceive the circumstances and make proper action. In this paper, the mobile AI using Neural Network has been step-by-step designed, and a simple game has been materialized for its functional experiment. In this game, the goal, the character, and obstacles exist on regular 2D space, and the character, evading obstacles, has to move where the goal is. The mobile AI can achieve its goals in changing environment by learning the solution to several problems through the algorithm defined in each experiment. The defined algorithm and Neural Network are designed to make the input/output system the same. As the experimental results, the suggested mobile AI showed that it could perceive the circumstances to conduct action and to complete its mission. If mobile AI learns the defined algorithm even in the game of complex structure, its Neural Network will be able to show proper results even in the changing environment.

Analyzing Virtual Memory Write Characteristics and Designing Page Replacement Algorithms for NAND Flash Memory (NAND 플래시메모리를 위한 가상메모리의 쓰기 참조 분석 및 페이지 교체 알고리즘 설계)

  • Lee, Hye-Jeong;Bahn, Hyo-Kyung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.543-556
    • /
    • 2009
  • Recently, NAND flash memory is being used as the swap device of virtual memory as well as the file storage of mobile systems. Since temporal locality is dominant in page references of virtual memory, LRU and its approximated CLOCK algorithms are widely used. However, cost of a write operation in flash memory is much larger than that of a read operation, and thus a page replacement algorithm should consider this factor. This paper analyzes virtual memory read/write reference patterns individually, and observes the ranking inversion problem of temporal locality in write references which is not observed in read references. With this observation, we present a new page replacement algorithm considering write frequency as well as temporal locality in estimating write reference behaviors. This new algorithm dynamically allocates memory space to read/write operations based on their reference patterns and I/O costs. Though the algorithm has no external parameter to tune, it supports optimized implementations for virtual memory systems, and also performs 20-66% better than CLOCK, CAR, and CFLRU algorithms.

Anomaly Detection Analysis using Repository based on Inverted Index (역방향 인덱스 기반의 저장소를 이용한 이상 탐지 분석)

  • Park, Jumi;Cho, Weduke;Kim, Kangseok
    • Journal of KIISE
    • /
    • v.45 no.3
    • /
    • pp.294-302
    • /
    • 2018
  • With the emergence of the new service industry due to the development of information and communication technology, cyber space risks such as personal information infringement and industrial confidentiality leakage have diversified, and the security problem has emerged as a critical issue. In this paper, we propose a behavior-based anomaly detection method that is suitable for real-time and large-volume data analysis technology. We show that the proposed detection method is superior to existing signature security countermeasures that are based on large-capacity user log data according to in-company personal information abuse and internal information leakage. As the proposed behavior-based anomaly detection method requires a technique for processing large amounts of data, a real-time search engine is used, called Elasticsearch, which is based on an inverted index. In addition, statistical based frequency analysis and preprocessing were performed for data analysis, and the DBSCAN algorithm, which is a density based clustering method, was applied to classify abnormal data with an example for easy analysis through visualization. Unlike the existing anomaly detection system, the proposed behavior-based anomaly detection technique is promising as it enables anomaly detection analysis without the need to set the threshold value separately, and was proposed from a statistical perspective.

A Moving Picture Coding Method Based on Region Segmentation Using Genetic Algorithm (유전적 알고리즘을 이용한 동화상의 영역분할 부호화 방법)

  • Jung, Nam-Chae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.10 no.1
    • /
    • pp.32-39
    • /
    • 2009
  • In this paper, the method of region segmentation using genetic algorithm is proposed for an improvement of efficiency in moving picture coding. A genetic algorithm is the method that searches a large probing space using only a function value for a optimal combination consecutively. By progressing both motion presumption and region segmentation at once, we can assign the motion vector in a image to a small block or a pixel respectively, and transform the capacity of coding and a signal to noise rate into a problem of optimization. That is to say, there is close correlation between region segmentation and motion presumption in motion-compensated prediction coding. This is to optimize the capacity of coding and a S/N ratio. This is to arrange the motion vector in each block of picture according to the state of optimization. Therefore, we examined both the data type of genetic algorithm and the method of data processing to obtain the results of optimal region segmentation in this paper. And we confirmed the validity of a proposed method using the test pictures by means of computer simulation.

  • PDF

3D Modeling of Self-Occluding Objects from 2D Drawings (자기폐색 물체의 2D 커브로부터의 3D모델링)

  • Cordier Frederic;Seo Hye-Won;Cho Young-Sang
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.9
    • /
    • pp.741-750
    • /
    • 2006
  • In this paper, we propose a method for reconstructing a 3D object (or a set of objects) from a 2D drawing provided by a designer. The input 2D drawing consists of a set of contours that may partially overlap each other or be self-overlapping. Accordingly, the resulting 3D object(s) may occlude each other or be self-occluding. The proposed method is composed of three major steps: 2D contour analysis, 3D skeleton computation, and 3D object construction. Our main contribution is to compute the 3D skeleton from the self-intersecting 2D counterpart. We formulate the 3D skeleton construction problem as a sequence of optimization problems, to shape the skeleton and place it in the 3D space while satisfying C1-continuity and intersection-free conditions. Our method is mainly for a silhouette-based sketching interface for the design of 3D objects including self-intersecting objects.

The assessment of the Spatial Variation of the Wind Field using the Meso-velocity Scale and its Contributing Factors (중간 속도 규모를 이용한 바람장의 균질성 평가 및 영향요소 분석)

  • Lee, Seong-Eun;Shin, Sun-Hee;Ha, Kyung-Ja
    • Atmosphere
    • /
    • v.20 no.3
    • /
    • pp.343-353
    • /
    • 2010
  • A regional wind network with complex surface conditions must be designed with sufficient space and time resolution to resolve the local circulations. In this study, the spatial variations of the wind field observed in the Seoul and Jeju regional networks were evaluated in terms of annual, seasons, and months to assess the spatial homogeneity of wind fields within the regional networks. The coherency of the wind field as a function of separation distance between stations indicated that significant coherency was sometimes not captured by the network, as inferred by low correlations between adjacent stations. A meso-velocity scale was defined in terms of the spatial variability of the wind within the network. This problem is predictably most significant with weak winds, dull prevailing wind, clear skies and significant topography. The relatively small correlations between stations imply that the wind at a given point cannot be estimated by interpolating winds from the nearest stations. For the Seoul and Jeju regional network, the meso-velocity scale has typically a same order of magnitude as the speed of the network averaged wind, revealing the large spatial variability of the Jeju network station imply topography and weather. Significant scatter in the relationship between spatial variability of the wind field and the wind speed is thought to be related to thermally-generated flows. The magnitude of the mesovelocity scale was significantly different along separation distance between stations, wind speed, intensity of prevailing wind, clear and cloudy conditions, topography. Resultant wind vectors indicate much different flow patterns along condition of contributing factors. As a result, the careful considerations on contributing factors such as prevailing wind in season, weather, and complex surface conditions with topography and land/sea contrast are required to assess the spatial variations of wind field on a regional network. The results in the spatial variation from the mesovelocity scale are useful to represent the characteristics of regional wind speed including lower surface conditions over the grid scale of large scale atmospheric model.

Intelligent Digital Redesign for Uncertain Nonlinear Systems Using Power Series (Powrer Series를 이용한 불확실성을 갖는 비선형 시스템의 지능형 디지털 재설계)

  • Sung Hwa Chang;Park Jin Bae;Go Sung Hyun;Joo Young Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.881-886
    • /
    • 2005
  • This paper presents intelligent digital redesign method of global approach for hybrid state space fuzzy-model-based controllers. For effectiveness and stabilization of continuous-time uncertain nonlinear systems under discrete-time controller, Takagi-Sugeno(TS) fuzzy model is used to represent tile complex system. And global approach design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between nonlinearly interpolated linear operators to be matched. Also, by using the power series, we analyzed nonlinear system's uncertain parts more precisely. When a sampling period is sufficiently small, the conversion of a continuous-time structured uncertain nonlinear system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the global state-matching of tile digitally controlled system are formulated in terms of linear matrix inequalities (LMIs). Finally, a TS fuzzy model for the chaotic Lorentz system is used as an example to guarantee the stability and effectiveness of the proposed method.

Materialized View Selection Scheme for enhancing RDF Query Performance (RDF 질의 처리 성능 향상을 위한 실체 뷰 선택 기법)

  • Park, Jaeyeol;Yoon, Sangwon;Choi, Kitae;Lim, Jongtae;Lee, Byoungyup;Shin, Jaeryong;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.12
    • /
    • pp.24-34
    • /
    • 2015
  • With the development of the semantic web, a large amount of data being produced nowadays is in RDF format. RDF is represented by a triple. An RDF database consisting of triples requires the high cost of join query processing. Materialized view is known as a scheme to reduce the query processing cost by accessing materialized views without accessing the database. It is physically stored the results or the intermediate results of the query processing in a storage area. In this paper, we propose a materialized view selection scheme by using decision tree to solve such a problem. The decision tree considers the size and maintenance costs of the materialized view as well as the profit of query response times. It is shown through performance evaluation that the proposed scheme increases the number of materialized views in the limited storage space and decreases the update rates of the materialized views.

Technology Commercialization Model of Public R&D Based on Living Labs (리빙랩을 활용한 공공연구개발의 사업화 모델 도출)

  • Song, Wichin;Jeong, Seohwa;Han, Kyu-young;Seong, Jieun;Kim, Jongseon
    • Journal of Korea Technology Innovation Society
    • /
    • v.20 no.2
    • /
    • pp.458-486
    • /
    • 2017
  • This article suggests Living Lab approach as a technology commercialization model of public research and development (R&D) projects. Living Lab is a model for end-users, private companies, research institutes, and public organizations to develop technology in a living space which works as a laboratory. Unlike the dominant technology commercialization model which focuses on private enterprises, a new living lab model discusses end-user centered commercialization. Based on general living lab model, three types of technology commercialization model are suggested. The 'Demand exploring type living lab' and the 'Problem solving type living lab' are project-based living lab. The other type of living lab is 'Living lab platform'. The projectbased living lab can be utilized as modules when promoting R&D projects. On the other hand, the living lab platform is infrastructure to provide living labs services to companies, public institutes and municipalities.