• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.7
• /
• pp.2407-2424
• /
• 2022

Recently, Transformer has made great progress in video retrieval tasks due to its high representation capability. For the structure of a Transformer, the cascaded self-attention modules are capable of capturing long-distance feature dependencies. However, the local feature details are likely to have deteriorated. In addition, increasing the depth of the structure is likely to produce learning bias in the learned features. In this paper, an improved Transformer structure named TransDCS (Transformer with Dynamic Convolution and Shortcut) is proposed. A Multi-head Conv-Self-Attention module is introduced to model the local dependencies and improve the efficiency of local features extraction. Meanwhile, the augmented shortcuts module based on a dual identity matrix is applied to enhance the conduction of input features, and mitigate the learning bias. The proposed model is tested on MSRVTT, LSMDC and Activity-Net benchmarks, and it surpasses all previous solutions for the video-text retrieval task. For example, on the LSMDC benchmark, a gain of about 2.3% MdR and 6.1% MnR is obtained over recently proposed multimodal-based methods.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.293-300
• /
• 2000

The non-manifold geometric modeling technique is to improve design process and to Integrate design, analysis, and manufacturing by handling mixture of wireframe model, surface model, and solid model in a single data structure. For the non-manifold geometric modeling, Euler operators and other high level modeling methods are necessary. Boolean operation is one of the representative modeling method for the non-manifold geometric modeling. This thesis studies Boolean operations of non-manifold model with the data structure of selective storage. The data structure of selective storage is improved non-manifold data structure in that existing non-manifold data structures using ordered topological representation method always store non-manifold information even if edges and vortices are in the manifold situation. To implement Boolean operations for non-manifold model, intersection algorithm for topological cells of three different dimensions, merging and selection algorithm for three dimensional model, and Open Inventor(tm), a 3D toolkit from SGI, are used.

• Korean Journal of Cognitive Science
• /
• v.28 no.2
• /
• pp.111-131
• /
• 2017

The connectionist model is one approach to studying language processing from a computational perspective. And building a representation in the connectionist model study is just as important as making the structure of the model in that it determines the level of learning and performance of the model. The connectionist model has been constructed in two different ways: localist representation and distributed representation. However, the localist representation used in the previous studies had limitations in that the unit of the output layer having a rare target activation value is inactivated, and the past distributed representation has the limitation of difficulty in confirming the result by the opacity of the displayed information. This has been a limitation of the overall connection model study. In this paper, we present a new method to induce distributed representation with local representation using abstraction of information, which is a feature of restricted Boltzmann machine, with respect to the limitation of such representation of the past. As a result, our proposed method effectively solves the problem of conventional representation by using the method of information compression and inverse transformation of distributed representation into local representation.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.3
• /
• pp.293-301
• /
• 2006

A new discretization method for calculating a sampled-data representation of a nonlinear continuous-time system is proposed. The proposed method is based on the well-known Taylor series expansion and zero-order hold (ZOH) assumption. The mathematical structure of the new discretization method is analyzed. On the basis of this structure, a sampled-data representation of a nonlinear system with a time-delayed input is derived. This method is applied to obtain a sampled-data representation of a non-affine nonlinear system, with a constant input time delay. In particular, the effect of the time discretization method on key properties of nonlinear control systems, such as equilibrium properties and asymptotic stability, is examined. 'Hybrid' discretization schemes that result from a combination of the 'scaling and squaring' technique with the Taylor method are also proposed, especially under conditions of very low sampling rates. Practical issues associated with the selection of the method parameters to meet CPU time and accuracy requirements are examined as well. The performance of the proposed method is evaluated using a nonlinear system with a time-delayed non-affine input.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.781-791
• /
• 1999

DD(Decision Diagrams) is an efficient operational data structure for an optimal expression of boolean functions. In a graph-based synthesis using DD, the goal of optimization decreases representation space for boolean functions. This paper represents boolean functions using OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagrams) for a graph-based synthesis and is based on the number of nodes as the criterion of DD size. For a property of OPKFDD that is able to select one of different decomposition types for each node, OPKFDD is variable in its size by the decomposition types selection of each node and input variable order. This paper proposes a method for generating OPKFDD efficiently from the current BDD(Binary Decision Diagram) Data structure and an algorithm for minimizing one. In the multiple output functions, the relations of each function affect the number of nodes of OPKFDD. Therefore this paper proposes a method to decide the input variable order considering the above cases. Experimental results of comparing with the current representation methods and the reordering methods for deciding input variable order are shown.

• The KIPS Transactions:PartA
• /
• v.19A no.1
• /
• pp.9-16
• /
• 2012

Abstract In informatics subject, a good understanding of information representation and the structure of materials is the first step to acquire the basic principles of computer science. But few studies have ever focused on the educational significance of the structure of materials in informatics subject or how to organize materials in a manner to stimulate students to introspect. The purpose of this study was to examine whether the 'information representation and management' sections of informatics textbooks of the revised 2007 curriculum that have been in use since 2010 had an inquiry tendency or not. As a result of analyzing the textbooks by utilizing Romey method, one textbook was found to have an inquiry tendency in terms of texts, figures/diagrams, activities and questions at the end of chapters. If textbooks are just organized to convey knowledge, it might result in making students less interactive in class. Specifically, informatics is a subject to teach basic problem-solving skills by using IT, and the findings of the study suggest that students who get less interactive in class are likely to have less chances to learn about how to solve the given problems in diverse ways.

• 한국방재학회:학술대회논문집
• /
• 2007.02a
• /
• pp.497-500
• /
• 2007

Data structure was designed not only to estimate LCC but also to analyze time-variant reliability index of plate girder bridges. Information model for data structure was categorized into cost information, cost variable information, user cost information, and reliability analysis information according to the characteristic of data. EXPRESS language of STEP was adopted to describe the data structure for the electronic representation of LCC information. The suitability of the developed data structure was verified by estimating LCC and analyzing time-variant reliability index of a plate girder bridge considering corrosion on the basis of the constructed test database.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.327-332
• /
• 2003

A new discretization method for nonlinear system with time-delay is proposed. It is based on the well-known Taylor series expansion and the zero-order hold (ZOH) assumption. We know that a discretization of linear system can be obtained with the ZOH assumption and within the sampling interval. A similar line of thinking is available in nonlinear case. The mathematical structure of the new discretization method is explored and under the structure, the sampled-data representation of nonlinear system including time-delay is computed. Provided that the discrete form of the single input nonlinear system with time-delay is derived, this result is easily extended to nonlinear system with multi-input time-delay. For simplicity two inputs are considered in this study. It is enough to generalize that of multiple inputs. Finally, the time-discretization of non-affine nonlinear system with time-delay is investigated for apply all nonlinear system

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.20-32
• /
• 1996

The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.15-26
• /
• 2009

Given an n-length text T over a $\sigma$-size alphabet, we present a compressed representation of T which supports retrieving queries of rank/select/access and updating queries of insert/delete. For a measure of compression, we use the empirical entropy H(T), which defines a lower bound nH(T) bits for any algorithm to compress T of n log $\sigma$ bits. Our representation takes this entropy bound of T, i.e., nH(T) $\leq$ n log $\sigma$ bits, and an additional bits less than the text size, i.e., o(n log $\sigma$) + O(n) bits. In compressed space of nH(T) + o(n log $\sigma$) + O(n) bits, our representation supports O(log n) time queries for a log n-size alphabet and its extension provides O(($1+\frac{{\log}\;{\sigma}}{{\log}\;{\log}\;n}$) log n) time queries for a $\sigma$-size alphabet.