• Title/Summary/Keyword: 대안집합

Search Result 73, Processing Time 0.024 seconds

Comparative Analysis Study between Korean public education and Waldorf education Focusing on Teaching the Numbers from 0 to 10 (우리나라 공교육과 발도르프 교육에서 0부터 10까지의 수 지도 비교 연구)

  • Cho, Youngmi
    • School Mathematics
    • /
    • v.15 no.1
    • /
    • pp.137-158
    • /
    • 2013
  • In this paper we compared waldorf education with korean public education in the area of teaching the numbers form 0 to 10. We took several characters of both. The korean education style has the characters like separation of 0~9 and 10, teaching of the meaning of ordinal numbers and cardinal numbers, use of storytelling. The waldorf education style has the characters like teaching of the qualitive meaning of numbers, use of storytelling, meeting numners in rhythm, teaching from whole to part.

  • PDF

Proposing the Methods for Accelerating Computational Time of Large-Scale Commute Time Embedding (대용량 컴뮤트 타임 임베딩을 위한 연산 속도 개선 방식 제안)

  • Hahn, Hee-Il
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.2
    • /
    • pp.162-170
    • /
    • 2015
  • Commute time embedding involves computing the spectral decomposition of the graph Laplacian. It requires the computational burden proportional to $o(n^3)$, not suitable for large scale dataset. Many methods have been proposed to accelerate the computational time, which usually employ the Nystr${\ddot{o}}$m methods to approximate the spectral decomposition of the reduced graph Laplacian. They suffer from the lost of information by dint of sampling process. This paper proposes to reduce the errors by approximating the spectral decomposition of the graph Laplacian using that of the affinity matrix. However, this can not be applied as the data size increases, because it also requires spectral decomposition. Another method called approximate commute time embedding is implemented, which does not require spectral decomposition. The performance of the proposed algorithms is analyzed by computing the commute time on the patch graph.

A Methodology of the Information Retrieval System Using Fuzzy Connection Matrix and Document Connectivity Order (색인어 퍼지 관계와 서열기법을 이용한 정보 검색 방법론)

  • Kim, Chul;Lee, Seung-Chai;Kim, Byung-Ki
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1160-1169
    • /
    • 1996
  • In this study, an experiment of information retrieval using fuzzy connection matrix of keywords was conducted. A query for retrieval was constructed from each keyword and Boolean operator such as AND, OR, NOT. In a workstation environment, the performance of the fuzzy retrieval system was proved to be considerably effective than that of the system using the crisp set theory. And both recall ratio and precision ratio showed that the proposed technique would be a possible alternative in future information retrieval. Some special features of this experimental system were ; ranking the results in the order of connectivity, making the retrieval results correspond flexibly by changing the threshold value, trying to accord the retrieval process with the retrieval semantics by treating the averse-connectivity (fuzzy value) as a semantic approximation between kewords.

  • PDF

A Study on the Mathematical Programming Approach to the Subway Routing Problem (지하철 차량운용 문제에 대한 수리적 해법에 관한 연구)

  • Kim, Kyung-Min;Hong, Soon-Heum
    • Proceedings of the KSR Conference
    • /
    • 2007.11a
    • /
    • pp.1731-1737
    • /
    • 2007
  • This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

  • PDF

Estimating Values of Statistical Lives using Choice Experiment Method (선택실험법을 이용한 확률적 인간생명가치의 추정)

  • Shin, Young Chul
    • Environmental and Resource Economics Review
    • /
    • v.16 no.3
    • /
    • pp.683-699
    • /
    • 2007
  • This study applied the choice experiment (CE) method to measure values of statistical lives from multi-attributed mortality risk reduction choices. The four characteristics of mortality risk (i.e. cause of death, voluntariness of mortality risk, timing of death, magnitude of mortality risk reduction) are utilized to design the alternatives of choice sets. The estimation results for the multinomial logit model show that individuals are willing to pay 27,930 won per year for a change from the status quo to a $\frac{1}{100}$ mortality risk reduction for 10 years, 116,773 won per year for mortality risk reduction associated with adults, 97,682 won per year for voluntary mortality risk reduction, 77,234 won per year for involuntary mortality risk reduction. There were several estimates of VSL related to different attributes of mortality risk. The mean VSLs of infant/child/young adult ranged from 1,165 million won to 1,367 million won. The mean VSLs ranged from 1,631 million won to 1,833 million won for adult, and were between 1,128 million won and 1,330 million won for old person.

  • PDF

An efficient Decision-Making using the extended Fuzzy AHP Method(EFAM) (확장된 Fuzzy AHP를 이용한 효율적인 의사결정)

  • Ryu, Kyung-Hyun;Pi, Su-Young
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.6
    • /
    • pp.828-833
    • /
    • 2009
  • WWW which is an applicable massive set of document on the Web is a thesaurus of various information for users. However, Search engines spend a lot of time to retrieve necessary information and to filter out unnecessary information for user. In this paper, we propose the EFAM(the Extended Fuzzy AHP Method) model to manage the Web resource efficiently, and to make a decision in the problem of specific domain definitely. The EFAM model is concerned with the emotion analysis based on the domain corpus information, and it composed with systematic common concept grids by the knowledge of multiple experts. Therefore, The proposed the EFAM model can extract the documents by considering on the emotion criteria in the semantic context that is extracted concept from the corpus of specific domain and confirms that our model provides more efficient decision-making through an experiment than the conventional methods such as AHP and Fuzzy AHP which describe as a hierarchical structure elements about decision-making based on the alternatives, evaluation criteria, subjective attribute weight and fuzzy relation between concept and object.

A Novel Multi-focus Image Fusion Technique Using Directional Multiresolution Transform (방향성 다해상도 변환을 사용한 새로운 다중초점 이미지 융합 기법)

  • Park, Dae-Chul;Atole, Ronnel R.
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.59-68
    • /
    • 2009
  • This paper addresses a hybrid multi-focus image fusion scheme using the recent curvelet transform constructions. Hybridization is obtained by combining the MS fusion rule with a novel "copy" method. The proposed scheme use MS rule to fuse the m most significant terms in spectrum of an image at each decomposition level. The scheme is dubbed in this work as m-term fusion in adherence to its use of the MSC (most significant coefficients) in the transform set at any given scale, orientation, and translation. We applied the edge-sensitive objective quality measure proposed by Xydeas and Petrovic to evaluate the method. Experimental results show that the proposed scheme is a potential alternative to the redundant, shift-invariant Dual-Tree Complex Wavelet transforms. In particular, it was confirmed that a 50% m-term fusion produces outputs with no visible quality degradation.

  • PDF

Re-understanding of Technoscience and Nature through Actor-Network Theory (행위자-연결망 이론을 통한 과학과 자연의 재해석)

  • Kim, Sook-Jin
    • Journal of the Korean Geographical Society
    • /
    • v.45 no.4
    • /
    • pp.461-477
    • /
    • 2010
  • Recent environmental issues such as genetically modified organisms, the loss of biodiversity, climate change, and nuclear waste cannot be reduced to a matter of science or society and explained through nature-society dualist approaches because of their complexity and heterogeneity. This paper examines how nature-society dualism has been embedded in science studies and geography and how this dualism can be overcome. Actor-Network Theory as an attempt to overcome this nature-society dualism is appropriate in analysing "strange imbriglio" of biology, politics, technoscience, market, value, ethics and facts that constitute our society by focusing on heterogeneous association, and can contribute to providing a useful framework to solve environmental problems.

Searching an Efficient frontier in the DEA Model based on the Reference Point Method (참조점 방법을 이용한 DEA모형의 프론티어 탐구)

  • 오동일
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.1 no.1
    • /
    • pp.83-90
    • /
    • 2000
  • DEA is a newly developed analyzing tool to measure efficiency evaluation of decision making units (DMU). It compares DMU by radial Projection on the efficient frontier. The purpose of this study is to show reference point approach used for searching solution in multiple objective linear Programming can be usefully used to determine flexible efficient frontier of each DMU In reference point approach, the minimization of ASF Produces an efficient points in frontier and enhances the usefulness of DEA by Providing flexibility in DEA and optimally allocating resources to DMU. Various DEA models can be supported by reference point method by changing the projection direction in order to choose the targets units, standards costs and management benching-marking.

  • PDF

Low-complexity Sensor Selection Based on QR factorization (QR 분해에 기반한 저 복잡도 센서 선택 알고리즘)

  • Yoon Hak, Kim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.27 no.1
    • /
    • pp.103-108
    • /
    • 2023
  • We study the problem of selecting a subset of sensor nodes in sensor networks in order to maximize the performance of parameter estimation. To achieve a low-complexity sensor selection algorithm, we propose a greedy iterative algorithm that allows us to select one sensor node at a time so as to maximize the log-determinant of the inverse of the estimation error covariance matrix without resort to direct minimization of the estimation error. We apply QR factorization to the observation matrix in the log-determinant to derive an analytic selection rule which enables a fast selection of the next node at each iteration. We conduct the extensive experiments to show that the proposed algorithm offers a competitive performance in terms of estimation performance and complexity as compared with previous sensor selection techniques and provides a practical solution to the selection problem for various network applications.