• Title/Summary/Keyword: copy paper

Search Result 502, Processing Time 0.021 seconds

Emotion Evaluation algorithm of Brain Information System using Dynamic Genitive Maps (동적인지 맵을 이용한 뇌 정보 처리 시스템의 감정 평가 알고리즘)

  • 홍인택;김성주;서재용;김용택;전홍태
    • Proceedings of the IEEK Conference
    • /
    • 2003.07d
    • /
    • pp.1243-1246
    • /
    • 2003
  • It is known that structure of Human's brain information system is controlled by cerebral cortex mainly. Cerebral cortex is divided by sensory area, motor area and associated area largely. Sensory area takes part in information from environment and motor area is actuation by decision as associated area determined. It is possible to copy brain information system by input-output pattern. but there is difficulty in modeling of memorizing new information. Such action is performed by Limbic Lobe and Papez circuit which is controlled by intrinsic emotion. So we need of definition of emotion's role in decision. In this paper, we define roles of emotion in intrinsic decision using Dynamic Cognitive Maps(DCMs). The emotion is evaluated by outside information then intrinsic decision performed as how much emotion variated. The dynamic cognitive maps take part in emotion evaluating process.

  • PDF

Fuzzy Inference for Idle Time Optimization of Hard Disk Drive (퍼지 추론을 이용한 하드디스크드라이브의 유휴시간 최적화)

  • Jun, Jin-Wan;Kim, Gyu-Taek;Lee, Jee-Hyong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.3
    • /
    • pp.473-479
    • /
    • 2008
  • Generally, HDDs are widely used as data storage device in office, home and mobile machineries. So, it is used for various applications or tasks, such as file copy, file download, music and movie play etc., in various environment. In spite of this kind of varieties in tasks and environment in which HDDs perform, most commercial HDDs hardly control its operations adaptively to these varieties. Thus, it is preferred to optimize the performance and energy consumption of HDDs according to the task and/or the environment. So, this paper proposes a new fuzzy inference algorithm which adaptively controls HDDs operations and may also easily be implemented as the firmware of HDDs and run in the restricted environment such as embedded systems.

Lossless Inductor Snubber-Assisted ZCS-PFM High Frequency Series Resonant Inverter for Eddy Current-Heated Roller

  • Feng Y. L.;Ishitobi M.;Okuno A.;Nakaoka M.;Lee H. W.
    • Proceedings of the KIPE Conference
    • /
    • 2001.10a
    • /
    • pp.304-308
    • /
    • 2001
  • This paper presents a novel prototype of ZCS-PFM high frequency series resonant inverter using IGBT power module for electromagnetic induction eddy current-heated roller in copy and printing machines. The operating principle and unique features of this voltage source half bridge inverter with two additional soft commutation inductor snubber are presented including the transformer modeling of induction heated rolling drum. This soft switching inverter can achieve stable zero current soft commutation under a discontinuous and continuous resonant load current for a widely specified power regulation processing. The experimental results and computer-aided analysis of this inverter are discussed from a practical point of view.

  • PDF

A Design of Multi-Field User Interface for Simulated Breeding

  • Unemi, Tastsuo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.489-494
    • /
    • 1998
  • This paper describes a design of graphical user interface for a simulated breeding tool with multifield. The term field is used here as a population of visualized individuals that are candidates of selection. Multi-field interface enables the user to breed his/her favorite phenotypes by selection independently in each field, and he/she can copy arbitrary individual into another field. As known on genetic algorithms, a small population likely leads to premature convergence trapped by a local optimum, and migration among plural populations is useful to escape from local optimum. The multi-field user interface provides easy implementation of migration and wider diversity. We show the usefulness of multi-field user interface through an example of a breeding system of 2D CG images.

  • PDF

Schm Constructions within Optimality Theory

  • Yu, Sihyeon
    • Korean Journal of English Language and Linguistics
    • /
    • v.2 no.3
    • /
    • pp.431-469
    • /
    • 2002
  • The main purpose of this paper is to present data about schm constructions in English and to examine them within the framework of Optimality Theory. American people sometimes reduplicate a word in deprecation using a prefix schm- or shm-, as in fancy-shmancy, and old-shmold. In these data, reduplicants surface as a copy of the whole word except the onset of the first syllable, which is replaced with schm. My data include some examples where the onset of the second syllable, not the first syllable, within the word reduplication is deleted and replaced with fixed segmentism schm, which seems to be infix rather than prefix. Above all, this study presents concrete evidence for the existence and function of ‘syllable’ and ‘foot’ known as prosodic categories by examining schm reduplication. Such extensions of schm-reduplcation also make predictions about types of outputs corresponding to their inputs.

  • PDF

A Robust Video Fingerprinting Algorithm Based on Centroid of Spatio-temporal Gradient Orientations

  • Sun, Ziqiang;Zhu, Yuesheng;Liu, Xiyao;Zhang, Liming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2754-2768
    • /
    • 2013
  • Video fingerprints generated from global features are usually vulnerable against general geometric transformations. In this paper, a novel video fingerprinting algorithm is proposed, in which a new spatio-temporal gradient is designed to represent the spatial and temporal information for each frame, and a new partition scheme, based on concentric circle and rings, is developed to resist the attacks efficiently. The centroids of spatio-temporal gradient orientations (CSTGO) within the circle and rings are then calculated to generate a robust fingerprint. Our experiments with different attacks have demonstrated that the proposed approach outperforms the state-of-the-art methods in terms of robustness and discrimination.

Edge-Integrity and the Syllable Structure in Korean

  • Kang, Eun-Yeong
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2002.02a
    • /
    • pp.135-146
    • /
    • 2002
  • The so-called overapplication of Coda Neutralization in Korean, the occurrence of a neutralized consonant in a non-neutralizing environment, is often considered as evidence for serial derivation. In this paper I propose that the neutralization effect at surface is not a result of a phonological process at an intermediate level in serial derivation, but due to a constraint requiring the integrity of the morphological constituent: EDGE-INTEGRITY. It is argued that this is not reducible to an alignment constraint, but a genuine faithfulness constraint on the edge of a morphological constituent. The putative opacity related with the coda neutralization is shown to be an epiphenomenon arising from the ambisyllabic representation of a consonant at a morphological juncture, satisfying both EDGE-INTEGRITY arid Syllabic Conditions. Consonant Copy in the Jeju dialect provides further evidence for EDGE-INTEGRITY, the Only difference being that the conflict between Syllabic Conditions and EDGE-INTEGRITY is resolved by insertion of a copied consonant.

  • PDF

Construction of curve-net interpolation surface considering trajectory of cross-section curves (단면곡선의 궤적을 고려한 곡선망 보간곡면 형성)

  • Yoo, Woo-Sik;Shin, Ha-Yong;Choi, Byoung-K.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.2
    • /
    • pp.77-90
    • /
    • 1994
  • Curve-net interpolation surface is one of the most popular method in engineering design. Therefore it is supported with many commercial CAD/CAM system. However, construction algorithm of curve-net interpolation surfaces is rarely opened to the public because of its copy-right. In this paper we establish a construction algorithm of curve-net interpolation surface so called sweeping surface which especially concentrates on trajectory of cross-section curve. We also show the method which can construct sweeping surfaces as NURB or Bezier mathematical models. Surfaces having the form of standard mathematical models are very useful for the application of joining, trimming, blending etc. The proposed surface interpolation scheme consists of four steps; (1) preparation of guide curves and section curves, (2) remeshing guide curves and section curves, (3) blending section curves after deformation, and (4) determination of control points for sweeping surface using gordon method. The proposed method guarantee $G^1$-continuety, and construct the surface salifying given section curves and trajectory of section curves.

  • PDF

Digital Watermarking Technique for the Copyright Protection of Motion Pictures (동영상 저작권 보호를 위한 디지털 워터마킹 기술)

  • 류대현
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.4
    • /
    • pp.438-450
    • /
    • 1999
  • In this paper, a new watermaking method embedding digital watermarks in the compressed video for the copy protection of multimedia data. The proposed method segments objects and embeds independent watermarks in each objects by spread spectrum method in the bitstream domain which is compressed by DCT and motion compensated coding method like MPEG-2. And, the proposed method not only embeds watermarks but show the robustness to the attacks like average operation or statistical analysis.

  • PDF

H-V -SUPER MAGIC DECOMPOSITION OF COMPLETE BIPARTITE GRAPHS

  • KUMAR, SOLOMON STALIN;MARIMUTHU, GURUSAMY THEVAR
    • Communications of the Korean Mathematical Society
    • /
    • v.30 no.3
    • /
    • pp.313-325
    • /
    • 2015
  • An H-magic labeling in a H-decomposable graph G is a bijection $f:V(G){\cup}E(G){\rightarrow}\{1,2,{\cdots},p+q\}$ such that for every copy H in the decomposition, $\sum{_{{\upsilon}{\in}V(H)}}\;f(v)+\sum{_{e{\in}E(H)}}\;f(e)$ is constant. f is said to be H-V -super magic if f(V(G))={1,2,...,p}. In this paper, we prove that complete bipartite graphs $K_{n,n}$ are H-V -super magic decomposable where $$H{\sim_=}K_{1,n}$$ with $n{\geq}1$.