• 제목/요약/키워드: Assignment Test

검색결과 163건 처리시간 0.021초

상위 수준 기술로부터 순차 회로의 자동 생성 (FSM Synthesis from High-Level Descriptions)

  • 황선영;유진수
    • 대한전자공학회논문지
    • /
    • 제27권12호
    • /
    • pp.1906-1915
    • /
    • 1990
  • A synthesis system generating sequential circuits from a high-level hardware descdription language CHDL, modelling language for Thor functional/behavioral simulator, is developed. In this paper, we describe the semantic analysis process, state minimization and state assignment algorithms. proposed assignment algorithm generates optimal state vectors using constraint matrix and similarity graph. Expremental results for MCNC benchmarks, standard test circuits, show that the system inplementing the proposed algorithms can be a viable tool for designing large finite state machines.

  • PDF

저지연 HEVC 부호화기를 위한 효율적인 프레임별 양자화 파라미터 할당 방법 (Efficient QP-per-frame Assignment Method for Low-delay HEVC Encoder)

  • 박상효;장의선
    • 방송공학회논문지
    • /
    • 제21권3호
    • /
    • pp.349-356
    • /
    • 2016
  • 본 논문에서는 HEVC 부호화기에서의 주어진 Group of picture(GOP) 구조에 맞추어 양자화 파라미터(Quantization parameter, QP)를 효율적으로 할당하는 방법을 제안한다. HEVC에서는 주어진 GOP 설정에 따라 각 비디오 프레임에 다른 QP값들을 할당할 수 있다. 특히, 낮은 QP값은 중요한 프레임에 할당시키고, 높은 QP값은 덜 중요한 프레임들에 할당하는 QP 변화 전략을 통해 압축률 증가를 꾀할 수 있다. 그러나 지금까지 효율적으로 QP를 할당하는 방법에 대한 정밀한 분석은 철저히 이루어진 바가 없다. HEVC 참조소프트웨어 부호화기에서도 단지 단조로운 QP 할당 방식만을 사용하고 있을 뿐이다. 본 제안기술은 QP할당을 각 GOP마다 적응적으로 하는 방식으로써, 그 기반은 GOP간의 시간적인 동적 활동 특성들을 활용한다는 것에 있다. 실험 결과, 저지연 부호화 환경설정에서 제안기술은 HEVC 테스트 모델(HM)과 비교하여 BD-rate의 관점으로 7.3%의 압축률을 더 이루었으며, 타 QP 할당방식 연구보다도 평균적으로 압축성능이 우월함을 확인하였다.

Divide and Conquer 기법을 사용한 스위치박스 배선기 (A Switchbox Router using Divide-and-Conquer Technique)

  • 이성호;정종화
    • 전자공학회논문지A
    • /
    • 제30A권3호
    • /
    • pp.104-113
    • /
    • 1993
  • A new switchbox router, called CONQUEROR, is proposed in this paper. The proposed CONQUEROR efficiently routes large switchbox routing area using divide-and-conquer technique. The CONQUEROR consists of three phases` namely, partition of large routing area and assignment of optimal pins of sub-area, detailed routing of each sub-ared, reassignment of pins after rip-up. First, large switchbox routing area is partitioned into several sub-areas and each sub-area contains 4-6 detailed grids. Then pins are assigned on boundary of sub-area by the estimated weight. Secondly, when global pin assignment is completed on all sub-areas, each sub-area is routed using detailed router. Also, detailed routing consists of three pases` layerless maze routing, assignment of layer using coloring, and rip-up and reroute. Lastly, if detailed routing of any sub-area fails,reassignment of pins after rip-up is invoked. Detailed routing is performed for the failed sub-area again. Benchmark test cases have been run, and on all the benchmark data known in the literature CONQUEROR has performed as well as or better than existing switchbox routers.

  • PDF

Common Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times

  • Kim, Jun-Gyu;Yu, Jae-Min;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • 제19권1호
    • /
    • pp.29-36
    • /
    • 2013
  • This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.

IPv6 기반의 네트워크 접근제어 시스템 설계 및 구현 (Design and Implementation of Network Access Control based on IPv6)

  • 신해준
    • 한국산학기술학회논문지
    • /
    • 제15권10호
    • /
    • pp.6310-6316
    • /
    • 2014
  • 인터넷 사용자 및 스마트 디바이스의 증가로 네트워크 보안의 중요성이 점차적으로 커지고 있다. 네트워크 보안의 세부기술들은 방화벽, IPS, DDoS차단시스템, UTM, VPN, 네트워크 접근제어시스템, 무선네트워크보안, 모바일보안, 망분리 등으로 구성된다. 현재 하드웨어 인프라는 이미 IPv6를 위한 기능을 지원하고 있지만 IPv6 기반 서비스의 제공은 미진하여 대부분의 보안제품들은 IPv4에서 동작하고 있다. 그러므로 본 논문에서는 IPv6를 지원하는 보안 기술인 네트워크 접근제어기능을 설계하고 이를 위해 필수적으로 요구되는 IPv6 단말의 탐색, 차단/격리 그리고 128bit IPv6 주소의 효율적인 관리를 위한 도메인자동 할당 기능을 설계 및 구현하였다. 이를 위해 KISA에서 실제 구축한 IPv6 환경에서 보편적 단말들에 적용이 가능하도록 구현하였다. 결과적으로 보편적으로 사용하고 있는 IPv6 장비들에 대해서 유 무선 호스트 검출, 차단, 격리 및 도메인 할당이 정상적으로 동작하는 것을 확인할 수 있었다.

생존도를 고려한 WDM 망의 경로설정 및 파장할당 (Routing and Wavelength Assignment in Survivable WDM Networks)

  • Lee, Taehan;Park, Sungsoo
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2001년도 추계학술대회 논문집
    • /
    • pp.124-127
    • /
    • 2001
  • We consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it based on column generation technique and variable fixing. We devise a branch-and-price algorithm to solve the column generation problem. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

  • PDF

Routing and Wavelength Assignment in Survivable WDM Networks without Wavelength Conversion

  • Lee, Tae-Han;Park, Sung-Soo;Lee, Kyung-Sik
    • Management Science and Financial Engineering
    • /
    • 제11권2호
    • /
    • pp.85-103
    • /
    • 2005
  • In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

설비배치안 작성을 위한 유전 알고리즘에 관한 연구 (A Genetic Algorithm for the Quadratic Assignment Formulation to the Facility Layout Problem)

  • 홍관수;권성우
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 1997년도 추계학술대회 발표논문집:21세기를 향한 정보통신 기술의 전망
    • /
    • pp.535-552
    • /
    • 1997
  • The facility layout problem has the goal of locating the different facilities in a floor to achieve the greatest efficiency in producing a product or service. This problem is usually formulated as the quadratic assignment problem(QAP). However, the problem of finding optimal layout is hard and traditional approaches are not computationally feasible. In this paper, a genetic algorithm is presented for obtaining efficient layouts. To test the effectiveness of the algorithm, a set of examples is solved and the results are compared to those from other Known algorithms. The comparison indicates that the proposed method performs well for the classical test problems.

  • PDF

Empirical Selection of Informative Microsatellite Markers within Co-ancestry Pig Populations Is Required for Improving the Individual Assignment Efficiency

  • Lia, Y.H.;Chu, H.P.;Jiang, Y.N.;Lin, C.Y.;Li, S.H.;Li, K.T.;Weng, G.J.;Cheng, C.C.;Lu, D.J.;Ju, Y.T.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • 제27권5호
    • /
    • pp.616-627
    • /
    • 2014
  • The Lanyu is a miniature pig breed indigenous to Lanyu Island, Taiwan. It is distantly related to Asian and European pig breeds. It has been inbred to generate two breeds and crossed with Landrace and Duroc to produce two hybrids for laboratory use. Selecting sets of informative genetic markers to track the genetic qualities of laboratory animals and stud stock is an important function of genetic databases. For more than two decades, Lanyu derived breeds of common ancestry and crossbreeds have been used to examine the effectiveness of genetic marker selection and optimal approaches for individual assignment. In this paper, these pigs and the following breeds: Berkshire, Duroc, Landrace and Yorkshire, Meishan and Taoyuan, TLRI Black Pig No. 1, and Kaohsiung Animal Propagation Station Black pig are studied to build a genetic reference database. Nineteen microsatellite markers (loci) provide information on genetic variation and differentiation among studied breeds. High differentiation index ($F_{ST}$) and Cavalli-Sforza chord distances give genetic differentiation among breeds, including Lanyu's inbred populations. Inbreeding values ($F_{IS}$) show that Lanyu and its derived inbred breeds have significant loss of heterozygosity. Individual assignment testing of 352 animals was done with different numbers of microsatellite markers in this study. The testing assigned 99% of the animals successfully into their correct reference populations based on 9 to 14 markers ranking D-scores, allelic number, expected heterozygosity ($H_E$) or $F_{ST}$, respectively. All miss-assigned individuals came from close lineage Lanyu breeds. To improve individual assignment among close lineage breeds, microsatellite markers selected from Lanyu populations with high polymorphic, heterozygosity, $F_{ST}$ and D-scores were used. Only 6 to 8 markers ranking $H_E$, $F_{ST}$ or allelic number were required to obtain 99% assignment accuracy. This result suggests empirical examination of assignment-error rates is required if discernible levels of co-ancestry exist. In the reference group, optimum assignment accuracy was achievable achieved through a combination of different markers by ranking the heterozygosity, $F_{ST}$ and allelic number of close lineage populations.

중학교 수학과 수행평가의 문제점 분석 및 그 해결 방안 연구 (Problem Analysis and Study of Solution Device in Relation with Middle School Mathematics Performance Assessment)

  • 박재용
    • 한국학교수학회논문집
    • /
    • 제3권1호
    • /
    • pp.149-163
    • /
    • 2000
  • The Ministry of Education have had us practice the performance test as a substitute proposal, however, all the more for the idealistic purport, our education front does not have such a sufficient condition as to practice the performance test for many classes and miscellaneous duties and over-populated class, and that practice has been enforced so abruptly without any drastic preparation and has caused much confusion from the beginning of that enforcement. Thus, these problematic concerns are remained as the tasks of the teachers to be solved by themselves in the front of education, and herein I came to do this research. The followings are the conclusions that I got as the results of the research (1) Performance test style should be applied in consideration of the students' achievement level and the gap of the teachers' recognition; descriptive test, portfolio assignment and formative test styles were proper for the students lacking basic study ability. (2) Descriptive test should have its beginning with the question items to which students can write the problem solving procedure logically rather than those to evaluate the creation ability and thinking ability: and putting down specifically the assessment standard could prevent students' confusion and scheme the impartiality of the assessment. (3) Portfolio assignment evaluation should be given with as interesting and suitable amounts as possible so that the students can do by themselves. (4) Utilizing the performance test table enabled easy management of documentary evidence. And it is needless to say that the success of the performance test should have preceding conditions like the teachers' understanding and their positive participation. Therefore, I'd like to give suggestions herein like the followings; (1) The performance test should not always be made into grades, and there is a need to develop the test gradually in the condition that the education surroundings permit by checking time, frequency, ratio and contents of the test while practicing the multiple choice writing test. (2) As long as the performance test has the aims of improving the studying and learning activities, any performance test only for the sake of making numerals with the thought that assessment is the disposal of the grades should be avoided, and the change of the lecturing styles and development of various assessing types and studying materials should be endeavored to confirm with the aims.

  • PDF