• Title/Summary/Keyword: Representation of Memory

Search Result 152, Processing Time 0.029 seconds

ON ALMOST SURE REPRESENTATIONS FOR LONG MEMORY SEQUENCES

  • Ho, Hwai-Chung
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.3
    • /
    • pp.741-753
    • /
    • 1998
  • Let G(*) be a Borel function applied to a stationary long memory sequence {X$_{i}$} of standard Gaussian random variables. Focusing on the process {G(X$_{i}$)}, the present paper establishes the almost sure representation for the empirical quantile process, that is, Bahadur's representation, and for the empirical process with respect to sample mean. Statistical applications of the representations are also addressed.sed.

  • PDF

Memory and Consciousness (기억과 의식)

  • Jung-HoKim
    • Korean Journal of Cognitive Science
    • /
    • v.7 no.3
    • /
    • pp.81-113
    • /
    • 1996
  • This paper examines the relation between memory and consciousness,especially the independence between memory and memory consciousness. First,the phenomena of memory performance without memory consciousness, next the phenomena of memory consciousness without memory representation are dealt with. They are examined both in special cases(e,g.,brain damaged patients,under hypnosis,etc.) and in normal cases.In both case, we can find that memory and memory consciousness are independent each other and that memory representation is neither necessary nor sufficient conditions for memory consciousness. Lastly, the roles of memory consciousness in our daily information processing are dealt with. Especially, the importance of memory consciousness in normal social life and the problem of self consciousness are discussed.

  • PDF

A Compact and Efficient Polygonal Mesh Representation (간결하고 효율적인 폴리곤 메쉬의 표현 구조)

  • Park S. K.;Lee S. H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.4
    • /
    • pp.294-305
    • /
    • 2004
  • Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

Hierachical representation of CT images with small memory computer (소용량 컴퓨터에 의한 CT 영상의 계층적 표현)

  • Yoo, S.K.;Kim, S.H.;Kim, N.H.;Kim, W.K.;Park, S.H.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1989 no.05
    • /
    • pp.39-43
    • /
    • 1989
  • In this paper, hierachical representation method with a 1-to-4 and 1-to-8 data structure is used to reconstruct the three-dimensional scene from two-dimensional cross sections provided by computed tomography with small memory computer system. To reduce the internal memory use, 2-D section is represented by quadtree, and 3-D scene is represented by octree. Octree is constructed by recursively merging consecutive quadtrees. This method uses 7/200 less memory than pointer type structure with all the case, and less memory up to 60.3% than linear octree with experimental data.

  • PDF

Spatial Data Structure for Efficient Representation of Very Large Sparse Volume Data for 3D Reconstruction (3차원 복원을 위한 대용량 희소 볼륨 데이터의 효율적인 저장을 위한 공간자료구조)

  • An, Jae Pung;Shin, Seungmi;Seo, Woong;Ihm, Insung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.23 no.3
    • /
    • pp.19-29
    • /
    • 2017
  • When a fixed-sized memory allocation method is used for sparse volume data, a considerable memory space is in general wasted, which becomes more serious for a large volume of high resolution. In this paper, in order to reduce such unnecessary memory consumption, we propose a volume representation method to store mostly voxels that represent valid information rather than all voxels in a fixed volume space. Then our method is compared with the conventional static memory allocation method, an octree-based representation, and a voxel hashing method in terms of memory usage and computation speed. In particular, we compare the proposed method and the voxel hashing method with respect to implementation of the GPU-based Marching Cubes algorithm.

Enhanced VLAD

  • Wei, Benchang;Guan, Tao;Luo, Yawei;Duan, Liya;Yu, Junqing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3272-3285
    • /
    • 2016
  • Recently, Vector of Locally Aggregated Descriptors (VLAD) has been proposed to index image by compact representations, which encodes powerful local descriptors and makes significant improvement on search performance with less memory compared against the state of art. However, its performance relies heavily on the size of the codebook which is used to generate VLAD representation. It indicates better accuracy needs higher dimensional representation. Thus, more memory overhead is needed. In this paper, we enhance VLAD image representation by using two level hierarchical-codebooks. It can provide more accurate search performance while keeping the VLAD size unchanged. In addition, hierarchical-codebooks are used to construct multiple inverted files for more accurate non-exhaustive search. Experimental results show that our method can make significant improvement on both VLAD image representation and non-exhaustive search.

A Study on the EMFG Representation of Timing Diagrams (타이밍도의 EMFG 표현에 관한 연구)

  • 김영운;여정모
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.05a
    • /
    • pp.179-184
    • /
    • 1999
  • A Timing Diagram is almost used to represent the various signals such as an address bus, a data bus, and the control signals during design and analysis of a digital system. But if so, its representation is somewhat complicated and also it is difficult to analyze the operation of the system. In this paper, we proposed the representation method of timing diagrams with the EMFG(Extended Mark Flow Graph). In the EMFG representation of the system operation, the logical states due to the various signals of the system is graphically represented. Therefore the proposal method allows that it is easy to design as well as analyze the system. As examples applied, we represented the memory read cycle of $\mu$PD70320 CPU and the read cycle of MCM60256A memory with the EMFG.

  • PDF

The effect of syntatic and pragmatic Constraints on Sentential Representaition and Memory Accessibility (통사적 제약과 화용적 제약이 문장의 표상과 기억접근에 미치는 효과)

  • Kim, Sung-Il;Lee, Jae-Ho
    • Korean Journal of Cognitive Science
    • /
    • v.6 no.2
    • /
    • pp.97-116
    • /
    • 1995
  • This study was conducted to investigate how syntaction and pragmatic constraints influence the sentential representation and memory accessibility. In order to seperate the syntactic constraints from the pragmatic constraint from the pragmatic constraints,the syntactic role of constituent in the sentence (subject or object) and the order of mention(first or second) were manipulted.After each sentence was presented by RSVP procedure,the probe recognition time was measured to investigate memory accessibility.In Experiment 1,in which SOA interval was 255ms,it was found that the subject of a sentece were more accessible than the object and participants first in a sentence were more accessible than participants mentioned later.However, in Experiment 2,in which SOA interval was 1540ms,it was found that participants mentioned first in a sentence were more accessible than participants mentioned later while there was no significant difference between the subject and object of a sentece.These results suggest that the syntactic and pragmatic constraints have an independent effect on the initial senential representation at the early stage of constructing representation,but as time passes only the pragmatic constraints influence sentential representation.These results also support a theoretical position which assumes that sentential representation is constructed through the process of convergent statisfaction of multiple constraints.

  • PDF

Culture, Memory, and Literature: In Search of an Interdisciplinary Relationship Between Cultural and Literary Studies (문화, 회상 그리고 문학: 문화학과 문예학의 학제적 연관성에 관한 모색″)

  • 최문규
    • Lingua Humanitatis
    • /
    • v.1 no.2
    • /
    • pp.67-90
    • /
    • 2001
  • In the past few years, a trend has emerged emphasizing the interdisciplinary relationship between cultural and literary studies, and "memory" has been suggested as the central theme in this trend. According to Aleida and Jan Assmann, "memory" as collective memory (not individual recollection) has various functions and forms, of which communicative memory and cultural memory occupy opposite poles of a central axis. Whereas communicative memory relates to the living past shared among contemporaries, cultural memory relates to "recollected history" rather than factual history. Cultural memory finds transmission through symbolic media such as myths, festivities, and literary works. Literary works preserve critical and living memories as opposed to forgotten memories. In other words, literature should be better read as "criticism and memory" than "imitation and preservation." Works of literature are characterized by a turning away from repetition toward representation-the process of "making present" of what is past.

  • PDF

Hybrid Model Representation for Progressive Indoor Scene Reconstruction (실내공간의 점진적 복원을 위한 하이브리드 모델 표현)

  • Jung, Jinwoong;Jeon, Junho;Yoo, Daehoon;Lee, Seungyong
    • Journal of the Korea Computer Graphics Society
    • /
    • v.21 no.5
    • /
    • pp.37-44
    • /
    • 2015
  • This paper presents a novel 3D model representation, called hybrid model representation, to overcome existing 3D volume-based indoor scene reconstruction mechanism. In indoor 3D scene reconstruction, volume-based model representation can reconstruct detailed 3D model for the narrow scene. However it cannot reconstruct large-scale indoor scene due to its memory consumption. This paper presents a memory efficient plane-hash model representation to enlarge the scalability of the indoor scene reconstruction. Also, the proposed method uses plane-hash model representation to reconstruct large, structural planar objects, and at the same time it uses volume-based model representation to recover small detailed region. Proposed method can be implemented in GPU to accelerate the computation and reconstruct the indoor scene in real-time.