• Title/Summary/Keyword: Restricted Code

Search Result 61, Processing Time 0.048 seconds

Android malicious code Classification using Deep Belief Network

  • Shiqi, Luo;Shengwei, Tian;Long, Yu;Jiong, Yu;Hua, Sun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권1호
    • /
    • pp.454-475
    • /
    • 2018
  • This paper presents a novel Android malware classification model planned to classify and categorize Android malicious code at Drebin dataset. The amount of malicious mobile application targeting Android based smartphones has increased rapidly. In this paper, Restricted Boltzmann Machine and Deep Belief Network are used to classify malware into families of Android application. A texture-fingerprint based approach is proposed to extract or detect the feature of malware content. A malware has a unique "image texture" in feature spatial relations. The method uses information on texture image extracted from malicious or benign code, which are mapped to uncompressed gray-scale according to the texture image-based approach. By studying and extracting the implicit features of the API call from a large number of training samples, we get the original dynamic activity features sets. In order to improve the accuracy of classification algorithm on the features selection, on the basis of which, it combines the implicit features of the texture image and API call in malicious code, to train Restricted Boltzmann Machine and Back Propagation. In an evaluation with different malware and benign samples, the experimental results suggest that the usability of this method---using Deep Belief Network to classify Android malware by their texture images and API calls, it detects more than 94% of the malware with few false alarms. Which is higher than shallow machine learning algorithm clearly.

Code-Reuse Attack Detection Using Kullback-Leibler Divergence in IoT

  • Ho, Jun-Won
    • International journal of advanced smart convergence
    • /
    • 제5권4호
    • /
    • pp.54-56
    • /
    • 2016
  • Code-reuse attacks are very dangerous in various systems. This is because they do not inject malicious codes into target systems, but reuse the instruction sequences in executable files or libraries of target systems. Moreover, code-reuse attacks could be more harmful to IoT systems in the sense that it may not be easy to devise efficient and effective mechanism for code-reuse attack detection in resource-restricted IoT devices. In this paper, we propose a detection scheme with using Kullback-Leibler (KL) divergence to combat against code-reuse attacks in IoT. Specifically, we detect code-reuse attacks by calculating KL divergence between the probability distributions of the packets that generate from IoT devices and contain code region addresses in memory system and the probability distributions of the packets that come to IoT devices and contain code region addresses in memory system, checking if the computed KL divergence is abnormal.

인동간격에 따른 일조환경에 대한 연구 (A Study on Sunshine Environment with Different Distance between Buildings)

  • 최용석;최지혜;김용식
    • 한국주거학회논문집
    • /
    • 제15권2호
    • /
    • pp.55-62
    • /
    • 2004
  • Apartment design in residential Area is restricted by building distance limit code. Building distance limit decreases gradually to the 0.8H(height), and residential area has 250% site area ratio by building code, so site using has become efficient. In this study, examine the relationship between present building distance limit and right of daylighting environment by computer simulation. As well, high-rise residential officetel and multipurpose residential building becomes increase in commercial non-residential area. In the domestic, residential type multipurpose building made at the business area or central business area has 400∼800% site area ratio by building code. However, at a dweller's point of view, there are much lacks of environmental consideration to provide suitable daylighting environment. And, POE: Post Occupancy Evaluation is not completed yet. In this study, however, progress architectural environment prediction, basis by right of daylighting, and examine the possibility of daylighting by architectural distance limit code in residental area and by high-rise, high-density residential building in non-residental downtown area.

속도향상에 따른 열차속도와 전차선 파동전파속도에 대한 실험적 연구 (A Experimental Study on Train Speed and Wave Propagation Speed of Contact Wire according to the Speed-up)

  • 이기원
    • 전기학회논문지
    • /
    • 제62권12호
    • /
    • pp.1820-1823
    • /
    • 2013
  • An overhead catenary system is the one of the main subjects for increasing speed in electric railway. When a vehicle increases the speed over 350km/h, vibrations and wave propagation reflections occur severely. Therefore, the system suitable for the speed are needed. A wave propagation speed of contact wire is the main criteria to determine the tension for the system. Therefore, a train speed is restricted below 70% of wave propagation speed of it in European railway code. In this study, we measured a strain and uplift of contact wire while HEMU-430X tain is operated for the speed-up trial test in Kyungbu high-speed railway. The measured strain and uplift are analyzed with wave propagation speed according to the speed-up. The more a train speed reaches to a propagation speed, the more measured strain is high. Through the study, an experimental approach is performed about the code which a train speed is restricted below 70% of wave propagation speed of it.

색상 및 채도 값에 의한 이미지 코드의 칼라 인식 (Recognition of Colors of Image Code Using Hue and Saturation Values)

  • 김태우;박흥국;유현중
    • 한국콘텐츠학회논문지
    • /
    • 제5권4호
    • /
    • pp.150-159
    • /
    • 2005
  • 유비쿼터스 컴퓨팅에 대한 관심이 증가함에 따라, 이미지 코드도 다양한 영역에서 관심을 끌고 있다. 유비쿼터스 컴퓨팅에서 이미지 코드가 중요한 이유는 비용면과 함께 많은 영역에서 RFID(radio frequency identification)를 보완하거나 대체할 수 있기 때문이다. 그렇지만, 칼라의 왜곡이 심하여 정확한 칼라를 읽는데 어려움이 있기 때문에, 그 응용은 아직까지는 매우 제한적이다. 이 논문에서는, 칼라의 색상 및 채도 값을 이용하여 자동으로 이미지 코드를 찾아내는 것을 포함하여, 이미지 코드 인식에 관한 효율적인 방법을 제시한다. 이 논문의 실험에서는 현재 상용되고 있는 것들 중 가장 실용적이라고 판단되는 디자인을 사용하였다. 이 이미지 코드에는 여섯 개의 안전 칼라, 즉, R, G, B, C, M, Y가 사용되었다. 실험 영상들로는 크기가 $2464{\times}1632$인 72개의 트루 칼라 필드 영상들을 사용하였다. 히스토그램에 의해 칼라를 보정한 경우, 코드 검출 정확도는 96%, 검출된 코드에 대한 칼라 분류 정확도는 91.28% 이었다. 이미지 코드를 검출 및 인식하는데 2 GHz P4 PC에서 약 5초가 소요되었다.

  • PDF

LINEAR AND NON-LINEAR LOOP-TRANSVERSAL CODES IN ERROR-CORRECTION AND GRAPH DOMINATION

  • Dagli, Mehmet;Im, Bokhee;Smith, Jonathan D.H.
    • 대한수학회보
    • /
    • 제57권2호
    • /
    • pp.295-309
    • /
    • 2020
  • Loop transversal codes take an alternative approach to the theory of error-correcting codes, placing emphasis on the set of errors that are to be corrected. Hitherto, the loop transversal code method has been restricted to linear codes. The goal of the current paper is to extend the conceptual framework of loop transversal codes to admit nonlinear codes. We present a natural example of this nonlinearity among perfect single-error correcting codes that exhibit efficient domination in a circulant graph, and contrast it with linear codes in a similar context.

수리계산 적용을 위한 스프링클러설비의 화재안전기준 개선방안 연구 (An Improvement Study on National Fire Safety Code of Sprinkler System for Hydraulic Calculation Application)

  • 이근오;강주형
    • 한국안전학회지
    • /
    • 제22권1호
    • /
    • pp.7-12
    • /
    • 2007
  • There are two kinds of design process for sprinkler system. one is pipe schedule system and the other is hydraulically designed system. We have inefficient results when we design by hydraulically designed system because the design process for sprinkler system is restricted by domestic fire code. Therefore, it is essential to do an introduction of hydraulically designed system which is based on engineering for enhancing reliability and efficiency of sprinkler system. This study presents points at issue by comparing and studying design standards of sprinkler system from Korea, Japan and NFPA, and presents improvement plans of national fire safety code of sprinkler system by processing, comparing and analyzing designs according to piping schedule and hydraulically designed system about domestic objects. Installation standards of sprinkler system have to be applied not by object buildings but by hazard classification. It is hard to design an efficient sprinkler system for fire control when water supply requirement of sprinkler systems allocated according to a size of a building because the same purpose but other buildings may request more water requirement or less. We should sublate the pipe schedule system from national fire safety code and need to introduce the hydraulically designed system. The pipe schedule system presents easy access because it is based on the forecasted engineering calculations but it is applied to only small buildings like NFPA due to its low reliability.

CONSTRUCTION OF TWO- OR THREE-WEIGHT BINARY LINEAR CODES FROM VASIL'EV CODES

  • Hyun, Jong Yoon;Kim, Jaeseon
    • 대한수학회지
    • /
    • 제58권1호
    • /
    • pp.29-44
    • /
    • 2021
  • The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.

A Computational Study on the Unsteady Lateral Loads in a Rocket Nozzle

  • ;김희동
    • 한국추진공학회:학술대회논문집
    • /
    • 한국추진공학회 2008년도 제31회 추계학술대회논문집
    • /
    • pp.78-81
    • /
    • 2008
  • A numerical study of the unsteady flow in an over-expanded thrust optimized contour and compressed truncated perfect rocket nozzle is carried out in present paper. These rocket nozzles are subject to flow separation in transient phase at engine start-up and/or engine shut-down. The separation flow structures at different pressure ratios are observed. The start-up process exhibits two different shock structures such as FSS (Free Shock Separation) and RSS (Restricted Shock Separation). For a range of pressure ratios, hysteresis phenomenon occurs between these two separation patterns. A three-dimension compressible Navier-Stokes solver is used for the present study. One equation Spalart-Allmaras turbulence model is selected. The computed nozzle wall pressures show a good agreement with the experimental measurements. Present results have shown that present code can be used for the analysis of the transient flows in nozzle.

  • PDF

A Function Point Model for Measuring the Development Cost of Information Services using Wireless Data Broadcast

  • Seokjin Im
    • International journal of advanced smart convergence
    • /
    • 제13권1호
    • /
    • pp.12-22
    • /
    • 2024
  • Software applications have a huge and inseparable impact on our lives. The complexity of the applications increases rapidly to support high performance and multifunction. Accordingly, the cost model for applications is increasingly important. Line of Code (LOC) and Man-Month (M/M) as the cost model measure the quantitative sides of the applications. Unlike them, Function Point (FP) measures the functionalities of the application. FP is efficient for estimating qualitative characteristics, but it is restricted to measuring the cost of an application using the wireless data broadcast which can support any number of clients. In this paper, we propose, a Function Point model for Information services using wireles data Broadcast (FPIB) to measure the development cost of an application that serves using the wireless data broadcast environment. FPIB adopts critical parameters of the wireless broadcast environment and the complexity of them to measure effectively the cost developing the application. Through the evaluation comparing the proposed FPIB with FP, we reveal the effectiveness of the proposed FPIB.