• Title/Summary/Keyword: 컴퓨팅 문제 해결

Search Result 946, Processing Time 0.032 seconds

DPay : Distributed-Hash-Table-based Micropayment System for Peer-to-Peer Environments (DPay : 피어-투-피어 환경을 위한 분산 해시 테이블 기반의 소액 지불 시스템)

  • Seo, Dae-Il;Kim, Su-Hyun;Song, Gyu-Won
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.10
    • /
    • pp.752-760
    • /
    • 2009
  • Emerging peer-to-peer systems benefit from the large amount of resources provided by many peers. However, many peer-to-peer systems or applications suffer from malicious peers and it is not guaranteed that peers are always online. Micropayment systems are accounting and charging mechanism for buying services, so we can apply them to solve these problems. In the past the majority of micropayment system uses a centralized broker but the problem with most existing micropayment system is a heavy load on the broker. For instance, when an owner of the coin is offline, the broker delegates the owner and handles payment messages. It occurs frequently because of characteristic of peer-to-peer system and is another load of the broker. In this paper we introduce DPay, a peer-to-peer micropayment system that uses distributed hash table (DHT) for storing encrypted payment messages and increases scalability and reduces the load of broker by removing downtime protocol. We show the idea of real-time double spending detection in DPay and report the results of several evaluations in order to compare DPay and other payment scheme. In simulation result, the load of broker in DPay is reduced by 30% on average of other previous payment scheme. We expect that DPay can apply various peer-to-peer systems because it provides a real-time double spending detection and stores more secure payment messages.

Crew Schedule Optimization by Integrating Integer Programming and Heuristic Search (정수계획법과 휴리스틱 탐색기법의 결합에 의한 승무일정계획의 최적화)

  • Hwang, Jun-Ha;Park, Choon-Hee;Lee, Yong-Hwan;Ryu, Kwang-Ryel
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.2
    • /
    • pp.195-205
    • /
    • 2002
  • Crew scheduling is the problem of pairing crews with each of the vehicles in operation during a certain period of time. A typical procedure of crew schedule optimization consists of enumerating all possible pairings and then selecting the subset which can cover all the operating vehicles, with the goal of minimizing the number of pairings in the subset. The linear programming approach popularly adopted for optimal selection of pairings, however, is not applicable when the objective function cannot be expressed in a linear form. This paper proposes a method of integrating integer programming and heuristic search to solve difficult crew scheduling problems in which the objective function cannot be expressed in linear form and at the same time the number of crews available is limited. The role of heuristic search is to improve the incomplete solution generated by integer programming through iterative repair. Experimental results show that our method outperforms human experts in terms of both solution quality and execution time when applied to real world crew scheduling Problems which can hardly be solved by traditional methods.

An Efficient Scheduling Method Taking into Account Resource Usage Patterns on Desktop Grids (데스크탑 그리드에서 자원 사용 경향성을 고려한 효율적인 스케줄링 기법)

  • Hyun Ju-Ho;Lee Sung-Gu;Kim Sang-Cheol;Lee Min-Gu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.429-439
    • /
    • 2006
  • A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.

A Performance Improvement Scheme for a Wireless Internet Proxy Server Cluster (무선 인터넷 프록시 서버 클러스터 성능 개선)

  • Kwak, Hu-Keun;Chung, Kyu-Sik
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.415-426
    • /
    • 2005
  • Wireless internet, which becomes a hot social issue, has limitations due to the following characteristics, as different from wired internet. It has low bandwidth, frequent disconnection, low computing power, and small screen in user terminal. Also, it has technical issues to Improve in terms of user mobility, network protocol, security, and etc. Wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. In this paper, wireless internet proxy server clusters are used for the wireless Internet because their caching, distillation, and clustering functions are helpful to overcome the above limitations and needs. TranSend was proposed as a clustering based wireless internet proxy server but it has disadvantages; 1) its scalability is difficult to achieve because there is no systematic way to do it and 2) its structure is complex because of the inefficient communication structure among modules. In our former research, we proposed the All-in-one structure which can be scalable in a systematic way but it also has disadvantages; 1) data sharing among cache servers is not allowed and 2) its communication structure among modules is complex. In this paper, we proposed its improved scheme which has an efficient communication structure among modules and allows data to be shared among cache servers. We performed experiments using 16 PCs and experimental results show 54.86$\%$ and 4.70$\%$ performance improvement of the proposed system compared to TranSend and All-in-one system respectively Due to data sharing amount cache servers, the proposed scheme has an advantage of keeping a fixed size of the total cache memory regardless of cache server numbers. On the contrary, in All-in-one, the total cache memory size increases proportional to the number of cache servers since each cache server should keep all cache data, respectively.

Performance Tests of 3D Data Models for Laser Radar Simulation (레이저레이더 시뮬레이션을 위한 3차원 데이터 모델의 성능 테스트)

  • Kim, Geun-Han;Kim, Hye-Young;Jun, Chul-Min
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.17 no.3
    • /
    • pp.97-107
    • /
    • 2009
  • Experiments using real guided weapons for the development of the LADAR(Laser radar) are not practical. Therefore, we need computing environment that can simulate the 3D detections by LADAR. Such simulations require dealing with large sized data representing buildings and terrain over large area. And they also need the information of 3D target objects, for example, material and echo rate of building walls. However, currently used 3D models are mostly focused on visualization maintained as file-based formats and do not contain such semantic information. In this study, as a solution to these problems, a method to use a spatial DBMS and a 3D model suitable for LADAR simulation is suggested. The 3D models found in previous studies are developed to serve different purposes, thus, it is not easy to choose one among them which is optimized for LADAR simulation. In this study, 4 representative 3D models are first defined, each of which are tested for different performance scenarios. As a result, one model, "Body-Face", is selected as being the most suitable model for the simulation. Using this model, a test simulation is carried out.

  • PDF

Environmental monitoring system research based on low-power sensor network (저전력 센서네트워크 기반 환경모니터링 시스템 연구)

  • Kim, Ki-Tae;Kim, Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.807-810
    • /
    • 2011
  • The sensor network technology for core technology of ubiquitous computing is in the spotlight recently, the research on sensor network is proceeding actively which is composed many different sensor node. USN(Ubiquitous Sensor Network) is the network that widely applies for life of human being. It works out to sense, storage, process, deliver every kind of appliances and environmental information from the stucktags and sensors. And it is possible to utilize to measure and monitor about the place of environmental pollution which is difficult for human to install. It's studied constantly since it be able to compose easily more subminiature, low-power, low-cost than previous one. And also it spotlights an important field of study, graft the green IT and IT of which the environment and IT unite stragically onto the Network. The problem for the air pollution in the office or the indoor except a specific working area is the continuously issue since the human beings have lived in the dwelling facilities. Measures for that problem are urgently needed. It's possible to solve for the freshair of outside with enough ventilation but that is the awkward situation to be managed by person. This study is the system engineering to management for indoor air condition under the sensor network. And research for efficiently manage an option.

  • PDF

An Ontology-based Collaboration System for Service Interoperability (온톨로지 기반의 서비스 상호운용을 위한 협업 시스템)

  • Hwang, Chi-Gon;Moon, Seok-Jae;Jung, Kye-Dong;Choi, Young-Keun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.210-217
    • /
    • 2013
  • The development of collaboration among information systems in accordance with changes in enterprises' business environment brings about the problems of duplication of the existing business services and increase in costs of maintenance. Accordingly, Web service has been suggested as the standard of distributed computing to prevent the duplication of services within the same business domain and to attain the services that are already being utilized. But since the data needed for Web services are not standardized, it is difficult for the users to find services that meet diverse business purposes. In this paper, we construct an ontology-based collaboration system for service interoperability. The ontology can support fusion service by finding services which are existed interdependently under the distributed environment for collaboration processing. The role of the collaborative system includes development, registration and call of services based on ontology. A local systems request collaboration support through the service profile. Collaborative system supports the development of service using the service profiles, represents the semantic association between real data through system ontology, and infers relationship between instances contained in the services. Based on this, we applied the travel booking services for collaboration system. As a result, service can be managed effectively preventing collision in collaborative system, and we verify that the mapping between system is reduced.

Message Interoperability in e-Logistics System (e-Logistics시스템의 메시지 상호운용성)

  • Seo Sungbo;Lee Young Joon;Hwang Jaegak;Ryu Keun Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.5
    • /
    • pp.436-450
    • /
    • 2005
  • Existing B2B, B2C computer systems and applications that executed business trans-actions were the client- server based architecture which consists of heterogeneous hardware and software including personal computers and mainframes. Due to the active boom of electronic business, integration and compatibility of exchanged data, applications and hardwares have emerged as hot issue. This paper designs and implements a message transport system and a document transformation system in order to solve the interoperability problem of integrated logistics system in e-Business when doing electronic business. Message transport system integrated ebMS 2.0 which is standard business message exchange format of ebXML, the international standard electronic commerce framework, and JMS of J2EE enable to ensure reliable messaging. The document transformation system could convert non-standard XML documents into standard XML documents and provide the web services after integrating message system. Using suggested business scenario and various test data, our message oriented system preyed to be interoperable and stable. We participated ebXML messaging interoperability test organized by ebXML Asia Committee ITG in oder to evaluate and certify the suitability for message system.

Development of Informatics Curriculum(Plan) for General Education Level in Prospective Elementary Teachers (초등 예비교원을 위한 교양수준의 정보교육과정(안) 개발)

  • An, YoungHee;Kim, JaMee;Woo, HoSung;Yang, HyeJi;Kim, MinJeong;Jung, DaYun;Lee, WonGyu
    • The Journal of Korean Association of Computer Education
    • /
    • v.22 no.1
    • /
    • pp.21-30
    • /
    • 2019
  • In this research, there is a purpose to develop an informatics education curriculum of the general level that the preliminary teacher at elementary school prepares for information education. First of all, in order to achieve the purpose, we compare and analyze the standard CS 2013 of the educational curriculum of elementary school teacher training university, University-Level Program cooperation deepening course, higher education course, and prepared content and level. Secondly, subjects were structured in consideration of standard J07-GE analysis of higher education curriculum and cooperation with secondary education course. Third, subject names were determined by examination by experts, taking into consideration the scope of subjects, content system composition, etc. Computer Science II, Computer Science II, Data Management in the domain to understand the basic principles of Computer Science I, Computing System, in order to approach expert opinions, analysis results, problems arising in information society from the viewpoint of computer science We proposed data management and analysis to grasp the patterns and relationships involved. In this research, not only improving ability to solve problems based on the basic capacity strengthening of teachers but also presenting subjects of general level, considering continuity star of high school information subjects it makes sense.

An Analysis of Research Trends Related to Software Education for Young Children in Korea (유아의 소프트웨어 교육 관련 국내 최근 연구의 경향 분석)

  • Chun, Hui Young;Park, Soyeon;Sung, Jihyun
    • Korean Journal of Child Education & Care
    • /
    • v.19 no.2
    • /
    • pp.177-196
    • /
    • 2019
  • Objective: This study aims to analyze research trends related to software education for young children, focusing on studies published in Korea from 2016 to 2019 March. Methods: A total of 26 research publications on software education for young children, searched from Korea Citation Index and Research Information Sharing Service were identified for the analysis. The trend in these publications was classified and examined respectively by publication dates, types of publications, and the fields of study. To investigate a means of research, the analysis included key topics, types of research methods, and characteristics of the study variables. Results: The results of the analysis show that the number of publications on the topic of software education for young children has increased over the three years, of which most were published as a scholarly journal article. Among the 26 research studies analyzed, 16 (61.5%) are related to the field of early childhood education or child studies. Key topics and target subjects of the most research include the curriculum development of software education for young children or the effectiveness of software education on 4- and 5-year-old children. Most of the analyzed studies are experimental research designs or in the form of literature reviews. The most frequently studied research variable is young children's cognitive characteristics. For the studies that employ educational programs, the use of a physical computing environment is prevalent, and the most frequently used robot as a programming tool is "Albert". The duration of the program implementation varies, ranging from 5 weeks to 48 weeks. In the analyzed research studies, computational thinking is conceptualized as a problem-solving skill that can be improved by software education, and assessed by individual instruments measuring sub-factors of computational thinking. Conclusion/Implications: The present study reveals that, although the number of research publications in software education for young children has increased, the overall sufficiency of the accumulated research data and a variety of research methods are still lacking. An increased interest in software education for young children and more research activities in this area are needed to develop and implement developmentally appropriate software education programs in early childhood settings.