• Title/Summary/Keyword: time representation

Search Result 1,187, Processing Time 0.026 seconds

Delay-Dependent Control for Time-Delayed T-S Fuzzy Systems Using Descriptor Representation

  • Jeung, Eun-Tae;Oh, Do-Chang;Park, Hong-Bae
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.2
    • /
    • pp.182-188
    • /
    • 2004
  • This paper presents a design method of delay-dependent control for T-S fuzzy systems with time delays. Based on parallel distributed compensation (PDC) and a descriptor model transformation of the system, a delay-dependent control is utilized. An appropriate Lyapunov-Krasovskii functional is chosen for delay-dependent stability analysis. A sufficient condition for delay-dependent control is represented in terms of linear matrix inequalities (LMIs).

Face Representation Method Using Pixel-to-Vertex Map(PVM) for 3D Model Based Face Recognition (3차원 얼굴인식을 위한 픽셀 대 정점 맵 기반 얼굴 표현방법)

  • Moon, Hyeon-Jun;Jeong, Kang-Hun;Hong, Tae-Hwa
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.1031-1032
    • /
    • 2006
  • A 3D model based face recognition system is generally inefficient in computation time because 3D face model consists of a large number of vertices. In this paper, we propose a novel 3D face representation algorithm to reduce the number of vertices and optimize its computation time.

  • PDF

Efficient bit-parallel multiplier for GF(2$^m$) defined by irreducible all-one polynomials (기약인 all-one 다항식에 의해 정의된 GF(2$^m$)에서의 효율적인 비트-병렬 곱셈기)

  • Chang Ku-Young;Park Sun-Mi;Hong Do-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.115-121
    • /
    • 2006
  • The efficiency of the multiplier largely depends on the representation of finite filed elements such as normal basis, polynomial basis, dual basis, and redundant representation, and so on. In particular, the redundant representation is attractive since it can simply implement squaring and modular reduction. In this paper, we propose an efficient bit-parallel multiplier for GF(2m) defined by an irreducible all-one polynomial using a redundant representation. We modify the well-known multiplication method which was proposed by Karatsuba to improve the efficiency of the proposed bit-parallel multiplier. As a result, the proposed multiplier has a lower space complexity compared to the previously known multipliers using all-one polynomials. On the other hand, its time complexity is similar to the previously proposed ones.

A Knowledge Representation Scheme Formalizing Spatio-Temporal Aspects of Dynamic Situations in Virtual Environments

  • Gebre, Haymanot Alalo;Choi, Jun Seong;Park, Jong Hee
    • International Journal of Contents
    • /
    • v.11 no.1
    • /
    • pp.21-30
    • /
    • 2015
  • A simulated realistic virtual environment is inhabited by autonomous cyber-humans who play the roles of agents in events. A key element, which enables this realism, is the historical context formed by time and space. A knowledge-representation scheme, composed of both spatial and temporal aspects needed by the agent to respond to dynamically changing situations, is essential for the design of a realistic virtual agent. In this work, spatial and temporal aspects of dynamic situations in the virtual environment have been formalized as a key component of our knowledge-representation scheme. This scheme provides a mathematical framework to construct realistic virtual situations that change with time, and background knowledge for agents in the simulated environment to deduce new pieces of information and plan against changing situations.

Insertion/Deletion algorithms on M-heap with an array representation (배열 표현을 이용한 M-힙에서 삽입/삭제 알고리즘)

  • Jung Hae-Jae
    • The KIPS Transactions:PartA
    • /
    • v.13A no.3 s.100
    • /
    • pp.261-266
    • /
    • 2006
  • Priority queues can be used in applications such as scheduling, sorting, and shortest path network problem. Fibonacci heap, pairing heap, and M-heap are priority queues based on pointers. This paper proposes a modified M-heap with an way representation, called MA-heap, that resolves the problem mentioned in [1]. The MA-heap takes O(1) amortized time and O(logn) time to insert an element and delete the max/min element, respectively. These time complexities are the same as those of the M-heap. In addition, it is much easier to implement an MA-heap than a heap proposed in [5] since it is based on the simple traditional heap.

Representation Forms of Personal Style on the Fashion Blogs (패션블로그에서 퍼스널 스타일 표현형식)

  • Suh, Sung Eun
    • Fashion & Textile Research Journal
    • /
    • v.16 no.5
    • /
    • pp.689-697
    • /
    • 2014
  • This study aims to analyze the representation forms of bloggers' personal style on the fashion blogs and enlighten their values which can be actively applied to design and marketing in fashion industry. Image representation of fashion bloggers is reflected by the characteristics in the digital environment, which are the creative manipulation of expression and the production of virtual and fantastic images by taking advantage of the composite medium such as images, music, videos, articles, etc. Also real time updates in blog indicate the latest trends in terms of the representation of image as the actual currency. The study conducted case studies of 5 women's personal fashion blogs through the verification of a variety of global fashion media and blog ranking sites: Style Bubble, Style Rookie, The Cherry Blossom Girl, The Blond Salad, and Fashion Toast. Research findings are as follows. First, the application of creative design elements is indicated as symbolic items, self-made designs, DIY, and various mix and match emphasizing design elements such as color, patterns, proportion, etc. Second, the virtual representation is very highlighted on the story telling applied by film like production or digital effect. Third, the commercial application with mainly sponsored wardrobe and designer collaboration indicates promoting a updated trend as well as a specific brand or designer to make their business profits.

Multi-view Clustering by Spectral Structure Fusion and Novel Low-rank Approximation

  • Long, Yin;Liu, Xiaobo;Murphy, Simon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.3
    • /
    • pp.813-829
    • /
    • 2022
  • In multi-view subspace clustering, how to integrate the complementary information between perspectives to construct a unified representation is a critical problem. In the existing works, the unified representation is usually constructed in the original data space. However, when the data representation in each view is very diverse, the unified representation derived directly in the original data domain may lead to a huge information loss. To address this issue, different to the existing works, inspired by the latest revelation that the data across all perspectives have a very similar or close spectral block structure, we try to construct the unified representation in the spectral embedding domain. In this way, the complementary information across all perspectives can be fused into a unified representation with little information loss, since the spectral block structure from all views shares high consistency. In addition, to capture the global structure of data on each view with high accuracy and robustness both, we propose a novel low-rank approximation via the tight lower bound on the rank function. Finally, experimental results prove that, the proposed method has the effectiveness and robustness at the same time, compared with the state-of-art approaches.

Vertex Quadtree and Octree for Geometric Modeling : Their Average Storage and Time Complexities (기하학적 모형을 위한 꼭지점 중심의 쿼드트리와 옥트리)

  • Lee, Hyeon-Chan;Lee, Cheol-Dong
    • ETRI Journal
    • /
    • v.11 no.1
    • /
    • pp.109-122
    • /
    • 1989
  • We developed new quadtree and octree representation schemes which reduce the storage requirements from exponential to polynomial. The new schemes not only lessen the large storage requirements of the existing quadtree and octree representation schemes but guarantee an exact representation of the original object. These are made possible by adopting a new set of termination conditions that ensure finiteness of the quadtree and octree during the decomposition. These new data structures are analyzed theoretically and tested empirically. For space complexity, we analyzed its best case, worst case, and average case. Given an $n_e$-gon, we show that the expected number of nodes in our quadtree isO($$$n_e^1.292$) For a polyhedron with $n_f$ faces, the expected number of nodes in the new octree is O($$$n_f^1.667$). For time complexity, we again analyzed the best, worst, and average cases for constructing such quadtree and octree and find the average to be the same as those of the space complexity. Finally, random $n_e$- gons are generated as test data. Regression equations are fitted and are shown to support the claims on the average case performance.

  • PDF

Design and Analysis of Continuous Media Representation Mechanism to minimize the Variance of Latency Time (지연시간의 변화를 고려한 연속미디어 표현 메카니즘의 설계 및 분석)

  • Yeo, In-Kook;Hwang, Dae-Hoon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.5
    • /
    • pp.787-796
    • /
    • 1995
  • In this paper, a mechanism to enhance the utilization of the tertiary storage devices such as optical disk, digital tape and so on is proposed. For this purpose, we suggest a storage structure with a CD-ROM and multiple disk and design an efficient mechanism to represent the continuous media stored in CD-ROM. The continuous media storage structure proposed in this pater can enhanced the retrieval capability of information by sending data using a shared bus with high bandwidth. And a continuous media representation mechanism not only can reduce the discontinuity of representation using parallel operation of fetch and representation but also minimize the variance of service time and the missing ratio of re-reference requirement by residing frequently accessed object on the disk.

  • PDF

Representation of the Body in Fashion -Focusing on the Representation of Physicality- (복식에 표현된 몸의 재현성[I] -몸의 사실성 재현을 중심으로-)

  • Yim, Eun-Hyuk;Kim, Min-Ja
    • Journal of the Korean Society of Costume
    • /
    • v.56 no.7 s.107
    • /
    • pp.126-141
    • /
    • 2006
  • Clothes and human body are inseparably related. Aesthetic consciousness of the body determines the form of clothing, reflecting the time and culture as well as the individual and society. Clothes can even reorganize the meaning of the body, while transcending their instrumental functions of protecting, expanding and deforming the body. Using 'body' to analyze the clothing farm, my study develops a framework by which to classify the representation of the body in fashion focusing on the representation of physicality. In order to inquire the formative style and aesthetic values expressed in representing body in fashion, my study examines subjects from the 14th century European costumes to fashion collections of the 20th century. In fashion, representation of the body is visually analogous to the ideal body shape and structure, including a realistic presentation of the body as well as reflection of aesthetic ideals. Representation of physicality refers to structural designs and elastic fabrication. Structural designs appeared in tailoring and bias-cut draping, as well as in stretchy clothes such as Lycra body suit and knit garments that highlights the body structure and movements of the body joints. In representing physicality in fashion, clothing forms reflect body silhouette and each body parts. Therefore, the shape of clothes (signifiant) corresponds to the anatomy and movement of the body ($signifi\'{e}$) in pursuit of aptness. Aesthetic ideal of the body is visualized in the form of a dress. Some clothes prioritize the body, particularly the feminine bodily curves, while others focus on the clothing itself as abstract and sculptural forms. Fashion continues to explore forms and images that transcend the traditional representations of the clothed body. As a type of intimate architecture, fashion always mediates the dialogue between clothes and body, or fashion and figure. My study suggests a framework to analyze bodily representation in fashion, focusing on the relationship between the clothes and body.