• Title/Summary/Keyword: Focus 값

Search Result 312, Processing Time 0.035 seconds

A Mean of Structural equation modeling on AMOS Software (AMOS 소프트웨어에서 구현되는 구조방정식 모형과 의미)

  • Kim, Kyung-Tae
    • Proceedings of the Korean Association for Survey Research Conference
    • /
    • 2007.11a
    • /
    • pp.55-65
    • /
    • 2007
  • In this research, it will be examined on mathematical model of AMOS software program that ues for Covariance Structure Analysis. if we have not understood to mathematical model of Covariance Structure, we fail to understand Structural equation modeling. Similarly If We were not understand to mathematical model of AMOS Software, we do not use Software adequately. Therefore we examine two sorts of Software that be designed for Structural equation modeling or Covariance Structure Analysis. In this research, We will focus on 8 assumption of Structural equation modeling and compare AMOS(Analysis of MOment Structure) program with LISREL(Linear Structure RELation) program. We found that A Program of AMOS Software have materialized with RAM(Reticular Action Model).

  • PDF

A summary-concept based analysis on the representative values and the measures of spread with the 9th grade Korean mathematics textbook (중학교 3학년 수학교과서 통계단원에 나타난 요약개념 분석)

  • Lee, Young-Ha;Lee, Eun-Hee
    • The Mathematical Education
    • /
    • v.50 no.4
    • /
    • pp.489-505
    • /
    • 2011
  • This study is an analysis on the focus of textbooks regarding the statistical chapters of "measures of representative(central tendency) and of the spread". Applying the summary-concept criteria of Juhyeon Nam(2007), 4 kinds of aspect of the chapter; (1) definition and its teleological validity of the measures of representative, (2) definition and practical value of the measures of spread (3) distributional form on the measures of representative and of spread (4) location and scale preservation or invariance of the measures of representative and of spread were observed. On the measures of representative, some definitions were insufficient to check the teleological validity of the measure. Most definitions of the measure of spread were based on the practical view points but no preparation for the future statistical inferences were found even by implication. Some books mention about the measures of representative and of spread for distributions, but we could not find any comments on the correspondence between the sample mean and the expectation of a distribution or population mean. However it is stimulant that some books check the validity of corresponding measures with the location and scale preservation or invariant property, that were not found in the previous curriculum.

Foundmental Study of Prediction of Natural Disaster Using the Aerial Photo Interpretation (항공사진판독에 의한 자연재해예측을 위한 기초적 연구)

  • Kang, In-Joon;Kwak, Jae-Ha;Jung, Jae-Hyung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.10 no.2
    • /
    • pp.57-62
    • /
    • 1992
  • As population is increased, land use types are changed mountainous areas from flatland in Korea. Because natural disaster as landslides occur of life, property, and environmental damage, prediction of landslides have become increasingly important. We focus on the issue for assessment of landslides, not slope stability analysis for a simple slope site. In this study, we could know the correlations of mean, standard deviation for brightness value of imagery by aerial photo scanning. The range of brightness values and standard deviation of landslide area is 35~65 and tend to increment of value, in the every years. When evaluating large regions with past occurrence of landslides, it is possible to search for correlation of site conditions such as degree of slope, soil characteristics, vegetative cover, and rainfall conditions in aerial photo interpretation data.

  • PDF

A Study on Buffer Scheme enhancing Performance In Intrusion Detection System (침입탐지시스템의 성능 향상을 위한 버퍼구조에 관한 연구)

  • 최인수;장덕성
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.2
    • /
    • pp.44-50
    • /
    • 2003
  • Even though algorithm of intrusion detection is superior to other algorithm in intrusion detection system, it is supposed that captured packet happened hostly lead to lose packet in system architecture when a buffer is full. If packet lost concerned to be hacked, it might impact to system all over. In this paper, try to focus on performance improvement of detection system. Buffer with threshold value could classify normal packet and hacked packet. The buffer accept normal packet and supposed to be hacked packet until critical value. When buffer reached at threshold value, destroyed packet is only normal packet. Proposed method can complement weakness that bypass hacked packet.

  • PDF

A Routing Protocol for Improving Path Stability in Mobile Ad-hoc Networks (애드혹 네트워크에서 경로 안정성 향상을 위한 라우팅 프로토콜)

  • Kim, Hyungjik;Choi, Sunwoong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.7
    • /
    • pp.1561-1567
    • /
    • 2015
  • Nodes of Mobile ad-hoc network usually use the energy-limited battery. Balanced energy consumptionis important to maintain path's stability. In this paper, we focus on improving the stability of the routing path in mobile ad-hoc networks. For that purpose, we propose a new routing protocol to find the highest minimum node residual energy path among shortest paths. The largest path of minimum value of the remain energy has a longer life than other paths to improve the reliability to data-transmission. Using ns-3 simulator, we show that the proposed routing protocol can provide more long-life stable routing path than AODV and EA-AODV.

Efficient Sampling of Graph Signals with Reduced Complexity (저 복잡도를 갖는 효율적인 그래프 신호의 샘플링 알고리즘)

  • Kim, Yoon Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.2
    • /
    • pp.367-374
    • /
    • 2022
  • A sampling set selection algorithm is proposed to reconstruct original graph signals from the sampled signals generated on the nodes in the sampling set. Instead of directly minimizing the reconstruction error, we focus on minimizing the upper bound on the reconstruction error to reduce the algorithm complexity. The metric is manipulated by using QR factorization to produce the upper triangular matrix and the analytic result is presented to enable a greedy selection of the next nodes at iterations by using the diagonal entries of the upper triangular matrix, leading to an efficient sampling process with reduced complexity. We run experiments for various graphs to demonstrate a competitive reconstruction performance of the proposed algorithm while offering the execution time about 3.5 times faster than one of the previous selection methods.

Count-Min HyperLogLog : Cardinality Estimation Algorithm for Big Network Data (Count-Min HyperLogLog : 네트워크 빅데이터를 위한 카디널리티 추정 알고리즘)

  • Sinjung Kang;DaeHun Nyang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.3
    • /
    • pp.427-435
    • /
    • 2023
  • Cardinality estimation is used in wide range of applications and a fundamental problem processing a large range of data. While the internet moves into the era of big data, the function addressing cardinality estimation use only on-chip cache memory. To use memory efficiently, there have been various methods proposed. However, because of the noises between estimator, which is data structure per flow, loss of accuracy occurs in these algorithms. In this paper, we focus on minimizing noises. We propose multiple data structure that each estimator has the number of estimated value as many as the number of structures and choose the minimum value, which is one with minimum noises, We discover that the proposed algorithm achieves better performance than the best existing work using the same tight memory, such as 1 bit per flow, through experiment.

Edge Weight Prediction Using Neural Networks for Predicting Geographical Scope of Enterprises (입지선정 범위 예측을 위한 신경망 기반의 엣지 가중치 예측)

  • Ko, JeongRyun;Jeon, Hyeon-Ju;Jeon, Joshua;Yoon, Jeong-seop;Jung, Jason J.;Kim, Bonggil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.05a
    • /
    • pp.22-24
    • /
    • 2021
  • This paper is a proposal for edge weight prediction using neural networks to graph configurations of nodes and edges. Brand is one of the components of society. and one of the brand's most important strategies is geographical location strategy. This paper is focus on that strategy. In This paper propose two things: 1) Graph Configuration. node consists of brand store, edge consists of store-to-store relationships and edge weight consists of actual walk and drive distance values. 2) numbering edges and training neural networks to predict next store distance values. It is expected to be useful in analyzing successful brand geographical location strategies.

  • PDF

Image Mosaicking Using Feature Points Based on Color-invariant (칼라 불변 기반의 특징점을 이용한 영상 모자이킹)

  • Kwon, Oh-Seol;Lee, Dong-Chang;Lee, Cheol-Hee;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.89-98
    • /
    • 2009
  • In the field of computer vision, image mosaicking is a common method for effectively increasing restricted the field of view of a camera by combining a set of separate images into a single seamless image. Image mosaicking based on feature points has recently been a focus of research because of simple estimation for geometric transformation regardless distortions and differences of intensity generating by motion of a camera in consecutive images. Yet, since most feature-point matching algorithms extract feature points using gray values, identifying corresponding points becomes difficult in the case of changing illumination and images with a similar intensity. Accordingly, to solve these problems, this paper proposes a method of image mosaicking based on feature points using color information of images. Essentially, the digital values acquired from a digital color camera are converted to values of a virtual camera with distinct narrow bands. Values based on the surface reflectance and invariant to the chromaticity of various illuminations are then derived from the virtual camera values and defined as color-invariant values invariant to changing illuminations. The validity of these color-invariant values is verified in a test using a Macbeth Color-Checker under simulated illuminations. The test also compares the proposed method using the color-invariant values with the conventional SIFT algorithm. The accuracy of the matching between the feature points extracted using the proposed method is increased, while image mosaicking using color information is also achieved.

Extracting Rules from Neural Networks with Continuous Attributes (연속형 속성을 갖는 인공 신경망의 규칙 추출)

  • Jagvaral, Batselem;Lee, Wan-Gon;Jeon, Myung-joong;Park, Hyun-Kyu;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.45 no.1
    • /
    • pp.22-29
    • /
    • 2018
  • Over the decades, neural networks have been successfully used in numerous applications from speech recognition to image classification. However, these neural networks cannot explain their results and one needs to know how and why a specific conclusion was drawn. Most studies focus on extracting binary rules from neural networks, which is often impractical to do, since data sets used for machine learning applications contain continuous values. To fill the gap, this paper presents an algorithm to extract logic rules from a trained neural network for data with continuous attributes. It uses hyperplane-based linear classifiers to extract rules with numeric values from trained weights between input and hidden layers and then combines these classifiers with binary rules learned from hidden and output layers to form non-linear classification rules. Experiments with different datasets show that the proposed approach can accurately extract logical rules for data with nonlinear continuous attributes.