• Title/Summary/Keyword: engineering information

Search Result 83,292, Processing Time 0.099 seconds

An Adjustable Process of Requirements Prioritizing for Release Plan (릴리즈 플랜의 적응적 요구사항 우선순위 프로세스)

  • Seong, Jae-Seok;Kang, Dong-Su;Song, Chee-Yang;Baik, Doo-Kwon
    • The KIPS Transactions:PartD
    • /
    • v.15D no.6
    • /
    • pp.841-856
    • /
    • 2008
  • The priority of requirement is important because the priority is a critical activity of release plan especially in software development which has an open market customer. Also, it is important for stakeholders to select a method and aspects to prioritize requirements. The selection is based on the organizational experience of a priority process, the process model of the product, goals and a type of products, and dependencies between requirements. But, the current researches considered only static dependency between requirements and did not suggest a systematic priority process. In addition, the current researches only suggest limited aspects to prioritize requirements, such as cost and value. Therefore, this paper proposes an adjustable priority process based on a priority model to select a method and aspects for the suitable priority for product and organization. Especially, this paper enhances the completeness of a release plan by a definition of static and dynamic dependency types between requirements. This paper suggests a priority model, which considers the dependencies between requirement and various viewpoint of software development. Based on the priority model, the paper suggests a systematic priority process to promote reasonable decisions to the priority and release plan of requirement.

An RDB to RDF Mapping System Considering Semantic Relations of RDB Components (관계형 데이터베이스 구성 요소의 의미 관계를 고려한 RDB to RDF 매핑 시스템)

  • Sung, Hajung;Gim, Jangwon;Lee, Sukhoon;Baik, Doo-Kwon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.1
    • /
    • pp.19-30
    • /
    • 2014
  • For the expansion of the Semantic Web, studies in converting the data stored in the relational database into the ontology are actively in process. Such studies mainly use an RDB to RDF mapping model, the model to map relational database components to RDF components. However, pre-proposed mapping models have got different expression modes and these damage the accessibility and reusability of the users. As a consequence, the necessity of the standardized mapping language was raised and the W3C suggested the R2RML as the standard mapping language for the RDB to RDF model. The R2RML has a characteristic that converts only the relational database schema data to RDF. For the same reasons above, the ontology about the relation data between table name and column name of the relational database cannot be added. In this paper, we propose an RDB to RDF mapping system considering semantic relations of RDB components in order to solve the above issue. The proposed system generates the mapping data by adding the RDFS attribute data into the schema data defined by the R2RML in the relational database. This mapping data converts the data stored in the relational database into RDF which includes the RDFS attribute data. In this paper, we implement the proposed system as a Java-based prototype, perform the experiment which converts the data stored in the relational database into RDF for the comparison evaluation purpose and compare the results against D2RQ, RDBToOnto and Morph. The proposed system expresses semantic relations which has richer converted ontology than any other studies and shows the best performance in data conversion time.

Real-Time Vehicle License Plate Recognition System Using Adaptive Heuristic Segmentation Algorithm (적응 휴리스틱 분할 알고리즘을 이용한 실시간 차량 번호판 인식 시스템)

  • Jin, Moon Yong;Park, Jong Bin;Lee, Dong Suk;Park, Dong Sun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.9
    • /
    • pp.361-368
    • /
    • 2014
  • The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.

Copyright Protection for Fire Video Images using an Effective Watermarking Method (효과적인 워터마킹 기법을 사용한 화재 비디오 영상의 저작권 보호)

  • Nguyen, Truc;Kim, Jong-Myon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.579-588
    • /
    • 2013
  • This paper proposes an effective watermarking approach for copyright protection of fire video images. The proposed watermarking approach efficiently utilizes the inherent characteristics of fire data with respect to color and texture by using a gray level co-occurrence matrix (GLCM) and fuzzy c-means (FCM) clustering. GLCM is used to generate a texture feature dataset by computing energy and homogeneity properties for each candidate fire image block. FCM is used to segment color of the fire image and to select fire texture blocks for embedding watermarks. Each selected block is then decomposed into a one-level wavelet structure with four subbands [LL, LH, HL, HH] using a discrete wavelet transform (DWT), and LH subband coefficients with a gain factor are selected for embedding watermark, where the visibility of the image does not affect. Experimental results show that the proposed watermarking approach achieves about 48 dB of high peak-signal-to-noise ratio (PSNR) and 1.6 to 2.0 of low M-singular value decomposition (M-SVD) values. In addition, the proposed approach outperforms conventional image watermarking approach in terms of normalized correlation (NC) values against several image processing attacks including noise addition, filtering, cropping, and JPEG compression.

Optimizing Similarity Threshold and Coverage of CBR (사례기반추론의 유사 임계치 및 커버리지 최적화)

  • Ahn, Hyunchul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.535-542
    • /
    • 2013
  • Since case-based reasoning(CBR) has many advantages, it has been used for supporting decision making in various areas including medical checkup, production planning, customer classification, and so on. However, there are several factors to be set by heuristics when designing effective CBR systems. Among these factors, this study addresses the issue of selecting appropriate neighbors in case retrieval step. As the criterion for selecting appropriate neighbors, conventional studies have used the preset number of neighbors to combine(i.e. k of k-nearest neighbor), or the relative portion of the maximum similarity. However, this study proposes to use the absolute similarity threshold varying from 0 to 1, as the criterion for selecting appropriate neighbors to combine. In this case, too small similarity threshold value may make the model rarely produce the solution. To avoid this, we propose to adopt the coverage, which implies the ratio of the cases in which solutions are produced over the total number of the training cases, and to set it as the constraint when optimizing the similarity threshold. To validate the usefulness of the proposed model, we applied it to a real-world target marketing case of an online shopping mall in Korea. As a result, we found that the proposed model might significantly improve the performance of CBR.

Methods for Stabilizing QoS in Mobile Cloud Computing (모바일 클라우드 컴퓨팅을 위한 QoS 안정화 기법)

  • La, Hyun Jung;Kim, Soo Dong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.507-516
    • /
    • 2013
  • Mobile devices have limited computing power and resources. Since mobile devices are equipped with rich network connectivity, an approach to subscribe cloud services can effectively remedy the problem, which is called Mobile Cloud Computing (MCC). Most works on MCC depend on a method to offload functional components at runtime. However, these works only consider the limited verion of offloading to a pre-defined, designated node. Moveover, there is the limitation of managing services subscribed by applications. To provide a comprehensive and practical solution for MCC, in this paper, we propose a self-stabilizing process and its management-related methods. The proposed process is based on an autonomic computing paradigm and works with diverse quality remedy actions such as migration or replicating services. And, we devise a pratical offloading mechanism which is still in an initial stage of the study. The proposed offloading mechanism is based on our proposed MCC meta-model. By adopting the self-stabilization process for MCC, many of the technical issues are effectively resolved, and mobile cloud environments can maintain consistent levels of quality in autonomous manner.

Asynchronous Message Pushing Framework between Android Devices using Remote Intent (Remote Intent를 이용한 안드로이드 장치 간 비동기식 메시지 푸싱 프레임워크)

  • Baek, Jihun;Nam, Yongwoo;Park, Sangwon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.517-526
    • /
    • 2013
  • When developing an android mobile application the androids intent is used as a mechanism to send messages between local equipment of androids application inner part and other applications. But the androids intent does not support sending messages via each android products intent. If there is a way to support each androids equipments to send messages, it will be easier to make non-stopping services. Non-stopping service is used when the user is using the android to do word or searching services and suddenly changes to a different android product but still maintains the progress what was currently being done without waiting the programs to be loaded. It is possible to send messages to each android products by using the socket, but the connection must be maintained stably which is the weak point. In this paper, I am suggesting a BRIF(Broadcasting Remote Intent Framework) framework to send messages to different android products. BRIF is a framework that uses the Googles C2DM service which services asynchronous transmissions to different android products. This is organized with the C2DM server, RemoteContext Api, web server and RISP(Remote Intent Service Provider) which is will be easy to be used for the developers since there are no big changes for coding compared to the intent code.

Security Requirements Analysis on IP Camera via Threat Modeling and Common Criteria (보안위협모델링과 국제공통평가기준을 이용한 IP Camera 보안요구사항 분석)

  • Park, Jisoo;Kim, Seungjoo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.3
    • /
    • pp.121-134
    • /
    • 2017
  • With rapid increasing the development and use of IoT Devices, requirements for safe IoT devices and services such as reliability, security are also increasing. In Security engineering, SDLC (Secure Development Life Cycle) is applied to make the trustworthy system. Secure Development Life Cycle has 4 big steps, Security requirements, Design, Implementation and Operation and each step has own goals and activities. Deriving security requirements, the first step of SDLC, must be accurate and objective because it affect the rest of the SDLC. For accurate and objective security requirements, Threat modeling is used. And the results of the threat modeling can satisfy the completeness of scope of analysis and the traceability of threats. In many countries, academic and IT company, a lot of researches about drawing security requirements systematically are being done. But in domestic, awareness and researches about deriving security requirements systematically are lacking. So in this paper, I described about method and process to drawing security requirements systematically by using threat modeling including DFD, STRIDE, Attack Library and Attack Tree. And also security requirements are described via Common Criteria for delivering objective meaning and broad use of them.

A Study on the Quantitative Risk Assessment of Bridge Construction Projects (교량 공사 프로젝트의 정량적 리스크 평가에 관한 연구)

  • Ahn, Sung-Jin
    • Journal of the Korea Institute of Building Construction
    • /
    • v.20 no.1
    • /
    • pp.83-91
    • /
    • 2020
  • The recent bridge construction projects is demanded more sophisticated risk management measures and loss forecasts to brace for risk losses from an increase in the trend of bridge construction. This study aims to analyze the risk factors that caused the loss of material in actual bridge construction and to develop a quantified predictive loss model, based on the past record of insurance payment by major domestic insurance companies for bridge construction projects. For the development of quantitative bridge construction loss model, the dependent variable was selected as the loss ratio, i.e., the ratio of insurance payout divided by the total project cost, while the independent variable adopted 1) Technical factors: superstructure type, foundation type, construction method, and bridge length 2) Natural hazards: typhoon and flood 3) Project information: construction period and total project cost. Among the selected independent variables, superstructure type, construction method, and project period were shown to affect the ratio of bridge construction losses. The results of this study can provide government agencies, bridge construction design and construction and insurance companies with the quantitative damage prediction and risk assessment services, using risk indicators and loss prediction functions derived from the findings of this study and can be used as a guideline for future basic bridge risk assessment development research.

A bidirectional full duplex medium access control protocol for underwater acoustic networks (수중 음향 네트워크를 위한 양방향 전이중 매체 접속 제어 프로토콜)

  • Kang, Sung Min;Hwang, Ho Young;Cho, Ho-Shin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.3
    • /
    • pp.211-217
    • /
    • 2017
  • In this paper, we propose a bidirectional full duplex MAC (Medium Access Control) protocol for underwater acoustic networks. An underwater sensor node can set a back-off timer according to the priority of transmission. When the back-off timer expires, the underwater sensor node acquires a transmission opportunity. If a source node wants to send data to a destination node, it broadcasts RTS (Request-To-Send) including ID of the destination node to neighbor nodes. The destination node receiving RTS sends CTS (Clear-To-Send) to the source node to inform the bidirectional full duplex communication. After the source node receives CTS, the source node and the destination node can send the data to each other. In the underwater environment, the existing MAC protocol may take a lot of time for successful transmission of data due to long underwater propagation delay. On the other hand, the proposed bidirectional full duplex MAC protocol improves the throughput by shortening the time for successful transmission of data. In this paper, we analyze the throughput of the proposed bidirectional full duplex MAC protocol. In addition, we show that the proposed bidirectional full duplex MAC protocol has better performance in the presence of the long underwater propagation delay compared with existing MAC protocols for underwater environments.