• Title/Summary/Keyword: Information processing Model

Search Result 5,542, Processing Time 0.035 seconds

Efficient Collaboration Method Between CPU and GPU for Generating All Possible Cases in Combination (조합에서 모든 경우의 수를 만들기 위한 CPU와 GPU의 효율적 협업 방법)

  • Son, Ki-Bong;Son, Min-Young;Kim, Young-Hak
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.9
    • /
    • pp.219-226
    • /
    • 2018
  • One of the systematic ways to generate the number of all cases is a combination to construct a combination tree, and its time complexity is O($2^n$). A combination tree is used for various purposes such as the graph homogeneity problem, the initial model for calculating frequent item sets, and so on. However, algorithms that must search the number of all cases of a combination are difficult to use realistically due to high time complexity. Nevertheless, as the amount of data becomes large and various studies are being carried out to utilize the data, the number of cases of searching all cases is increasing. Recently, as the GPU environment becomes popular and can be easily accessed, various attempts have been made to reduce time by parallelizing algorithms having high time complexity in a serial environment. Because the method of generating the number of all cases in combination is sequential and the size of sub-task is biased, it is not suitable for parallel implementation. The efficiency of parallel algorithms can be maximized when all threads have tasks with similar size. In this paper, we propose a method to efficiently collaborate between CPU and GPU to parallelize the problem of finding the number of all cases. In order to evaluate the performance of the proposed algorithm, we analyze the time complexity in the theoretical aspect, and compare the experimental time of the proposed algorithm with other algorithms in CPU and GPU environment. Experimental results show that the proposed CPU and GPU collaboration algorithm maintains a balance between the execution time of the CPU and GPU compared to the previous algorithms, and the execution time is improved remarkable as the number of elements increases.

Design and Verification of PCI 2.2 Target Controller to support Prefetch Request (프리페치 요구를 지원하는 PCI 2.2 타겟 컨트롤러 설계 및 검증)

  • Hyun Eugin;Seong Kwang-Su
    • The KIPS Transactions:PartA
    • /
    • v.12A no.6 s.96
    • /
    • pp.523-530
    • /
    • 2005
  • When a PCI 2.2 bus master requests data using Memory Read command, a target device may hold PCI bus without data to be transferred for long time because a target device needs time to prepare data infernally. Because the usage efficiency of the PCI bus and the data transfer efficiency are decreased due to this situation, the PCI specification recommends to use the Delayed Transaction mechanism to improve the system performance. But the mechanism cann't fully improve performance because a target device doesn't know the exact size of prefetched data. In the previous work, we propose a new method called Prefetch Request when a bus master intends to read data from the target device. In this paper, we design PCI 2.2 controller and local device that support the proposed method. The designed PCI 2.2 controller has simple local interface and it is used to convert the PCI protocol into the local protocol. So the typical users, who don't know the PCI protocol, can easily design the PCI target device using the proposed PCI controller. We propose the basic behavioral verification, hardware design verification, and random test verification to verify the designed hardware. We also build the test bench and define assembler instructions. And we propose random testing environment, which consist of reference model, random generator ,and compare engine, to efficiently verify corner case. This verification environment is excellent to find error which is not detected by general test vector. Also, the simulation under the proposed test environment shows that the proposed method has the higher data transfer efficiency than the Delayed Transaction about $9\%$.

A MDA-based Approach to Developing UI Architecture for Mobile Telephony Software (MDA기반 이동 단말 시스템 소프트웨어 개발 기법)

  • Lee Joon-Sang;Chae Heung-Seok
    • The KIPS Transactions:PartD
    • /
    • v.13D no.3 s.106
    • /
    • pp.383-390
    • /
    • 2006
  • Product-line engineering is a dreaming goal in software engineering research. Unfortunately, the current underlying technologies do not seem to be still not much matured enough to make it viable in the industry. Based on our experiences in working on mobile telephony systems over 3 years, now we are in the course of developing an approach to product-line engineering for mobile telephony system software. In this paper, the experiences are shared together with our research motivation and idea. Consequently, we propose an approach to building and maintaining telephony application logics from the perspective of scenes. As a Domain-Specific Language(DSL), Menu Navigation Viewpoint(MNV) DSL is designed to deal with the problem domain of telephony applications. The functional requirements on how a set of telephony application logics are configured can be so various depending on manufacturer, product concept, service carrier, and so on. However, there is a commonality that all of the currently used telephony application logics can be generally described from the point of user's view, with a set of functional features that can be combinatorially synthesized from typical telephony services(i.e. voice/video telephony, CBS/SMS/MMS, address book, data connection, camera/multimedia, web browsing, etc.), and their possible connectivity. MNV DSL description acts as a backbone software architecture based on which the other types of telephony application logics are placed and aligned to work together globally.

Virtual Target Overlay Technique by Matching 3D Satellite Image and Sensor Image (3차원 위성영상과 센서영상의 정합에 의한 가상표적 Overlay 기법)

  • Cha, Jeong-Hee;Jang, Hyo-Jong;Park, Yong-Woon;Kim, Gye-Young;Choi, Hyung-Il
    • The KIPS Transactions:PartD
    • /
    • v.11D no.6
    • /
    • pp.1259-1268
    • /
    • 2004
  • To organize training in limited training area for an actuai combat, realistic training simulation plugged in by various battle conditions is essential. In this paper, we propose a virtual target overlay technique which does not use a virtual image, but Projects a virtual target on ground-based CCD image by appointed scenario for a realistic training simulation. In the proposed method, we create a realistic 3D model (for an instructor) by using high resolution Geographic Tag Image File Format(GeoTIFF) satellite image and Digital Terrain Elevation Data (DTED), and extract the road area from a given CCD image (for both an instructor and a trainee). Satellite images and ground-based sensor images have many differences in observation position, resolution, and scale, thus yielding many difficulties in feature-based matching. Hence, we propose a moving synchronization technique that projects the target on the sensor image according to the marked moving path on 3D satellite image by applying Thin-Plate Spline(TPS) interpolation function, which is an image warping function, on the two given sets of corresponding control point pair. To show the experimental result of the proposed method, we employed two Pentium4 1.8MHz personal computer systems equipped with 512MBs of RAM, and the satellite and sensor images of Daejoen area are also been utilized. The experimental result revealed the effective-ness of proposed algorithm.

Precise Relative Positioning for Formation Flying Satellite using GPS Carrier-phase Measurements (GPS 반송파 위상을 사용한 편대비행위성 상대위치결정 연구)

  • Park, Jae-Ik;Lee, Eunsung;Heo, Moon-Beom
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.40 no.12
    • /
    • pp.1032-1039
    • /
    • 2012
  • The present paper deals with precise relative positioning of formation satellites with long baseline in low Earth orbit making use of L1/L2 dual frequency GPS carrier phase measurements. Kinematic approach means to describe the motion of objects without taking its mass/dynamics model into consideration. The advantage of the kinematic approach is that information about dynamics of the system is not applied, which gives more flexibility and could improve the scientific interest of the observations made by the mission. The ionosphere terms, which are not canceled by double differenced measurement equation in the case of the long baseline, are explicitly estimated as unknown parameters by extended Kalman filter. The estimated float ambiguities by EKF are solved by existing efficient integer vector search strategy under integer least square condition. For the integer vector search, we employ well known MLAMBDA. Finally, The feasibility and accuracy of processing scheme are demonstrated using the GPS measurements for two satellites in low Earth orbit separated by baselines of 100 km.

Revitalization Plan and Value of Social Network Service in the Business Organization (기업조직 내 소셜 미디어 서비스 활용의 가치 제고 및 활성화 방안)

  • Kim, Dong-Hyun;Seo, Hyun-Shik;Kim, Hyung-Joon;Lee, Bong-Gyou
    • The KIPS Transactions:PartD
    • /
    • v.18D no.4
    • /
    • pp.275-286
    • /
    • 2011
  • The purpose of this study is to find the beneficial plan for business success by the advantage of social media service in the business organization. There is few research for applying social media on a variety of fields in business organization although many companies are trying to find the way for its application. Hence, this study identifies the possibility for the utilization of social media services, and it also finds the plan for their effective application. The social relationship is created by increasing communications between users of social media service. The research model is established on the basis of the hypothesis that the social relationship affects knowledge share, pursuit of ego, social participation, amusement. To maximize the impact of results, the research was conducted on the basis of the target on two groups including the business men and non-business men who use social media services. As results of the research, the business men tend to appeal their impression based on sharing knowledge with anonymous people. Also, it is necessary to make a social participation to a management participation, and to utilize the social media in the organization by including amusement to its function. This research is expected to have significant implication to companies which wants to apply social media services in the future.

The Scheme for Delegation of Temporary Right to Watching Pay-TV in N-Screen Service (유료 콘텐츠의 N-스크린 서비스를 위한 일시적 시청권한 위임 기법)

  • Kim, Jung-Hoon;Lee, Hoon-Jung;Kim, Sang-Jin;Oh, Hee-Kuck
    • The KIPS Transactions:PartC
    • /
    • v.18C no.3
    • /
    • pp.135-142
    • /
    • 2011
  • Recently, the strategy for N-screen service is in the spotlight along with the consumer's need to use contents regardless of time and place due to the rapid development of communication technology, which is meshing with the desire of service providers seeking a new business model. N-screen, as a screen-extension-concept service which enables consumers to continuously share and use contents in various equipments such as TV, computer and portable terminals, is an advanced type of 3-screen service strategy initially proposed by AT&T, an American telecommunication company. In the N-screen service for pay-contents, in order to support continuous screen changes to and from various equipments, temporary watching right should be given to the equipment intended for screen change. However, it is impossible to give the temporary watching right in the present broadcasting environment, adopting an access-control system. In this paper, the access-control technology being used for pay-contents in the present broadcasting environment and the reason for not being able to give temporary watching right, will be examined. After the examination, the solution for delegation of watching right by using an additional key on the basis of currently used access-control technology, will be proposed.

Estimation of Software Project Success and Completion Rate Using Gompertz Growth Function (Gompertz 성장곡선을 이용한 소프트웨어 프로젝트의 개발 성공률과 완료율 추정)

  • Lee, Sang-Un
    • The KIPS Transactions:PartD
    • /
    • v.13D no.5 s.108
    • /
    • pp.709-716
    • /
    • 2006
  • As the software complexity increases, the development success rate decreases and failure rate increases exponentially. The failure rate related to the software size can be described by a growth function. Based on this phenomenon, this paper estimates the development success and completion rate using the Gompertz growth function. At first, we transformed a software size of numerically suggested $10^n$ into a logarithm and kept the data interval constantly. We tried to derive a functional relationship between the development success rate and the completion rate according to the change of logarithmic software size. However, we could not find a function which can represent this relationship. Therefore, we introduced the failure rate and the cancel rate which are inverse to the development success rate and completion rate, respectively. Then, we indicated the relation between development failure rate and cancel rate based on the change of software size, as a type of growth function. Finally, as we made the Gompertz growth function with the function which describes the cancel rate and the failure rate properly. We could express the actual data suitably. When you apply the growth function model that I suggested, you will be able to get the success rate and completion rate of particular site of software very accurately.

Design and Implementation of a SQL based Moving Object Query Process System for Controling Transportation Vehicle (물류 차량 관제를 위한 SQL 기반 이동 객체 질의 처리 시스템의 설계 및 구현)

  • Jung, Young-Jin;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.12D no.5 s.101
    • /
    • pp.699-708
    • /
    • 2005
  • It becomes easy and generalized to track the cellular phone users and vehicles according to the Progress of wireless telecommunication, the spread of network, and the miniaturization of terminal devices. It has been constantly studied to provide location based services to furnish suitable services depending on the positions of customers. Various vehicle tracking and management systems are developed to utilize and manage the vehicle locations to relieve the congestion of traffic and to smooth transportation. However the designed previous work can not evaluated in real world, because most of previous work is only designed not implemented and it is developed for simple model to handle a point, a line, a polygon object. Therefore, we design a moving object query language and implement a vehicle management system to search the positions and trajectories of vehicles and to analyze the cost of transportation effectively. The designed query language based on a SQL can be utilized to get the trajectories between two specific places, the departure time, the arrival time of vehicles, and the predicted uncertainty positions, etc. In addition, the proposed moving object query language for managing transportation vehicles is useful to analyze the cost of trajectories in a variety of moving object management system containing transportation.

LiDAR Chip for Automated Geo-referencing of High-Resolution Satellite Imagery (라이다 칩을 이용한 고해상도 위성영상의 자동좌표등록)

  • Lee, Chang No;Oh, Jae Hong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.4_1
    • /
    • pp.319-326
    • /
    • 2014
  • The accurate geo-referencing processes that apply ground control points is prerequisite for effective end use of HRSI (High-resolution satellite imagery). Since the conventional control point acquisition by human operator takes long time, demands for the automated matching to existing reference data has been increasing its popularity. Among many options of reference data, the airborne LiDAR (Light Detection And Ranging) data shows high potential due to its high spatial resolution and vertical accuracy. Additionally, it is in the form of 3-dimensional point cloud free from the relief displacement. Recently, a new matching method between LiDAR data and HRSI was proposed that is based on the image projection of whole LiDAR data into HRSI domain, however, importing and processing the large amount of LiDAR data considered as time-consuming. Therefore, we wmotivated to ere propose a local LiDAR chip generation for the HRSI geo-referencing. In the procedure, a LiDAR point cloud was rasterized into an ortho image with the digital elevation model. After then, we selected local areas, which of containing meaningful amount of edge information to create LiDAR chips of small data size. We tested the LiDAR chips for fully-automated geo-referencing with Kompsat-2 and Kompsat-3 data. Finally, the experimental results showed one-pixel level of mean accuracy.