• Title/Summary/Keyword: processing

Search Result 68,835, Processing Time 0.08 seconds

Automatic Test Case Generation Through 1-to-1 Requirement Modeling (1대1 요구사항 모델링을 통한 테스트 케이스 자동 생성)

  • Oh, Jung-Sup;Choi, Kyung-Hee;Jung, Gi-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.17D no.1
    • /
    • pp.41-52
    • /
    • 2010
  • A relation between generated test cases and an original requirement is important, but it becomes very complex because a relation between requirement models and requirements are m-to-n in automatic test case generation based on models. In this paper, I suggest automatic generation technique for REED (REquirement EDitor), 1-to-1 requirement modeling tool. Test cases are generated though 3 steps, Coverage Target Generation, IORT (Input Output Relation Tree)Generation, and Test Cases Generation. All these steps are running automatically. The generated test cases can be generated from a single requirement. As a result of applying to three real commercial systems, there are 5566 test cases for the Temperature Controller, 3757 test cases for Bus Card Terminal, and 4611 test cases for Excavator Controller.

Design and Implementation of Embedded Linux-based Personal Mobile Broadcasting Service (임베디드 리눅스 기반의 개인 모바일 방송국 서비스 설계 및 구현)

  • Kim, Do-Hyung;Kim, Sun-Ja;Lee, Cheol-Hoon
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.441-450
    • /
    • 2009
  • This paper describes the design and implementation of Personal Mobile Broadcasting Service which bases on embedded Linux and it supports personal broadcasting in wireless network environments. Recently, with the advent of various wireless networks and the increased use of high performance mobile devices, the demand for personal mobile broadcasting is being increased. The personal mobile broadcasting service makes it possible that mobile users create contents using their own mobile devices while they are moving or they are in any place. And then, it sends the created contents to server in real-time where their blogs are. Users connected to the content creator's blog can play the contents in real-time. With the implemented personal mobile broadcasting service, mobile users can share multimedia contents in real-time through wireless networks. And, it also helps users to construct their own broadcasting stations where they can broadcast the scene of the accident or public performance in real-time.

Development of System Model for Integrated Information Management of Construction Material (건설자재 통합정보 관리를 위한 시스템 모델 구현)

  • Han, Choong-Han;Ju, Ki-Bum
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.433-440
    • /
    • 2009
  • As information technology of constructional area develops recently, web-based on-line system is rapidly increasing to provide information on diverse constructional materials so as to enhance productivity of constructional business and to reduce cost. Since the constructional materials information provided by these systems, i.e., quality, specification, etc are not standardized, however, the staffs on the constructional site suffer considerable difficulties in using materials information when acquiring information on specific materials, e.g., using diverse information systems or repeating similar jobs. Thus, this research typified information items of constructional materials on the basis of GDAS and designed multi system model to control integrated information on constructional materials. This system can efficiently control and utilize materials information by supporting automatic classification of constructional materials to which OmniClass Part-22 and UNSPSC are applied, conditional complex retrieval of materials information, real-time automatic embodiment of electronic catalog and retrieving/controlling RFID.

Multiple Asynchronous Requests on a Client-based Mashup Page (클라이언트 기반 매시업 페이지에서 다중 비동기 서비스 호출)

  • Lee, Eun-Jung
    • The KIPS Transactions:PartD
    • /
    • v.17D no.1
    • /
    • pp.9-16
    • /
    • 2010
  • Web service mashup bacomes one of the important web application development methods. This paper considers a client based mashup, where a page interfaces many service methods asynchronously. Browser systems execute callbacks when the corresponding reply arrives, possibly concurrent to user interface actions. In this case, callbacks and user interface actions share data memory and screen. Moreover, when the user is able to send another request before the previous ones have replied, the shared resource problem becomes more complicated. In order to solve the multiple requests problem, our contributions are as follows. First, we modeled a mashup page with user actions and callbacks, and we presented several types of callbacks. Secondly, concurrency condition is defined between callbacks and user actions in terms of shared resources, and the test method is presented. Also, we proposed the serialization approach to guarantee the safe execution of callbacks. Finally, we applied the proposed concurrency condition on XForms language and extended the XForms browser to implement the proposed approach. The prototype implementation showed that the proposed approach helps enhancing user experience on mashup pages.

Development and Application of An Adaptive Web Site Construction Algorithm (적응형 웹 사이트 구축을 위한 연관규칙 알고리즘 개발과 적용)

  • Choi, Yun-Hee;Jun, Woo-Chun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.423-432
    • /
    • 2009
  • Advances in information and communication technologies are changing our society greatly. In knowledge-based society, information can be obtained easily via communication tools such as web and e-mail. However, obtaining right and up-to-date information is difficult in spite of overflowing information. The concept of adaptive web site has been initiated recently. The purpose of the site is to provide information only users want out of tons of data gathered. In this paper, an algorithm is developed for adaptive web site construction. The proposed algorithm is based on association rules that are major principle in adaptive web site construction. The algorithm is constructed by analysing log data in web server and extracting meaning documents through finding behavior patterns of users. The proposed algorithm has the following characteristics. First, it is superior to existing algorithms using association rules in time complexity. Its superiority is proved theoretically. Second, the proposed algorithm is effective in space complexity. This is due to that it does not need any intermediate products except a linked list that is essential for finding frequent item sets.

Assessing the Construct Validity of PMIS Effectiveness Measurement - Focusing the Administration DB Construction Projects - (공공정보시스템 효과성 측정지표의 타당성 검증에 관한 연구 - 행정정보DB구축사업을 중심으로 -)

  • Kang, Dong-Seok;Yoo, Si-Hyeong
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.417-422
    • /
    • 2009
  • It is important to verify the validity of indicators assessing PMIS(Public Management Information System) effectiveness in academic research as well as practical affairs. As people invest in the field of Information Technology(IT) or IT system, private corporations are interested in investment in IT and it's business value. Moreover, the need of evaluating effectiveness on the investment in IT with the limited national budget are on the increase in public sector. Therefore, it is necessary to define the construct of PMIS(Public Management Information System) effectiveness so that we systematically compare and measure performance of public informatization project processed by each public organizations. It needs to develop indicators and verify the construct validity of them. we verified the construct validity of indicators assessing PMIS(Public Management Information System) effectiveness on the Administration DB Construction Projects.

An Experimental Study of Generality of Software Defects Prediction Models based on Object Oriented Metrics (객체지향 메트릭 기반인 결함 예측 모형의 범용성에 관한 실험적 연구)

  • Kim, Tae-Yeon;Kim, Yun-Kyu;Chae, Heung-Seok
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.407-416
    • /
    • 2009
  • To support an efficient management of software verification and validation activities, much research has been conducted to predict defects in early phase. And defect prediction models have been proposed to predict defects. But the generality of the models has not been experimentally studied for other software system. In other words, most of prediction models were applied only to the same system that had been used to build the prediction models themselves. Therefore, we performed an experiment to explore generality of major prediction models. In the experiment, we applied three defects prediction models to three different systems. As a result, we cannot find their generality of defect prediction capability. The cause is analyzed to result from a different metric distribution between the systems.

Semantic-based Automatic Open API Composition Algorithm for Easier-to-use Mashups (Easier-to-use 매쉬업을 위한 시맨틱 기반 자동 Open API 조합 알고리즘)

  • Lee, Yong Ju
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.5
    • /
    • pp.359-368
    • /
    • 2013
  • Mashup is a web application that combines several different sources to create new services using Open APIs(Application Program Interfaces). Although the mashup has become very popular over the last few years, there are several challenging issues when combining a large number of APIs into the mashup, especially when composite APIs are manually integrated by mashup developers. This paper proposes a novel algorithm for automatic Open API composition. The proposed algorithm consists of constructing an operation connecting graph and searching composition candidates. We construct an operation connecting graph which is based on the semantic similarity between the inputs and the outputs of Open APIs. We generate directed acyclic graphs (DAGs) that can produce the output satisfying the desired goal. In order to produce the DAGs efficiently, we rapidly filter out APIs that are not useful for the composition. The algorithm is evaluated using a collection of REST and SOAP APIs extracted from ProgrammableWeb.com.

An Optimal ILP Algorithm of Memory Access Variable Storage for DSP in Embedded System (임베디드 시스템에서 DSP를 위한 메모리 접근 변수 저장의 최적화 ILP 알고리즘)

  • Chang, Jeong-Uk;Lin, Chi-Ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.2
    • /
    • pp.59-66
    • /
    • 2013
  • In this paper, we proposed an optimal ILP algorithm on memory address code generation for DSP in embedded system. This paper using 0-1 ILP formulations DSP address generation units should minimize the memory variable data layout. We identify the possibility of the memory assignment of variable based on the constraints condition, and register the address code which a variable instructs in the program pointer. If the process sequence of the program is declared to the program pointer, then we apply the auto-in/decrement mode about the address code of the relevant variable. And we minimize the loads on the address registers to optimize the data layout of the variable. In this paper, in order to prove the effectiveness of the proposed algorithm, FICO Xpress-MP Modeling Tools were applied to the benchmark. The result that we apply a benchmark, an optimal memory layout of the proposed algorithm then the general declarative order memory on the address/modify register to reduce the number of loads, and reduced access to the address code. Therefor, we proved to reduce the execution time of programs.

An Improved Side Channel Attack Using Event Information of Subtraction (뺄셈연산의 이벤트 정보를 활용한 향상된 RSA-CRT 부채널분석공격 방법)

  • Park, Jong-Yeon;Han, Dong-Guk;Yi, Okyeon;Kim, Jung-Nyeo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.2
    • /
    • pp.83-92
    • /
    • 2013
  • RSA-CRT is a widely used algorithm that provides high performance implementation of the RSA-signature algorithm. Many previous studies on each operation step have been published to verify the physical leakages of RSA-CRT when used in smart devices. This paper proposes SAED (subtraction algorithm analysis on equidistant data), which extracts sensitive information using the event information of the subtraction operation in a reduction algorithm. SAED is an attack method that uses algorithm-dependent power signal changes. An adversary can extract a key using differential power analysis (DPA) of the subtraction operation. This paper indicates the theoretical rationality of SAED, and shows that its results are better than those of other methods. According to our experiments, only 256 power traces are sufficient to acquire one block of data. We verify that this method is more efficient than those proposed in previously published studies.