• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.199-209
• /
• 2009

In this paper, we suggest a stroke level of detail (LOD) based on a saliency density. On painter]y rendering, the stroke LOD has an advantage of making the observer concentrate on the main object and improving accuracy of expression. For the stroke LOD, it is necessary to classify the detailed and abstracted area. We divide the area on the basis of saliency distribution and the level of detailed expression is controlled based on the saliency information. 'We define that the area of which the saliency distribution is high is a major subject that an artist tries to express, it is described in detail. The area of which the saliency distribution is low is abstractly described. Each divided area has the abstraction level. And by adapting the brushes of which sizes are appropriate to each level, it is possible to express the area which needs to be expressed in details from the one which needs to be expressed abstractly.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.757-759
• /
• 2013

Until just a few years ago, digital circuit design techniques in register transfer level using Verilog or VHDL have been recognized as the up-to-date way compared with the traditional schematic design, and truly they have been used as the most popular skill for most chip designs. However, with the advent of era in which the complexity of semiconductor chip counts over billion transistors with advanced manufacturing technology, designing in register transfer level became too complex to meet the requirements of the needs, so the design paradigm has to change so that both design and synthesis can be done in higher level of abstraction. Bluespec SystemVerilog (BSV) is the only HDL which enables both circuit design and generating synthesizable code in the system level developed so far. In this contribution, I survey and analyze the features which supports the new paradigm in the BSV HDL, not very familiar to industry yet.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.3
• /
• pp.57-64
• /
• 2019

In this paper, an efficient prediction-based parallel simulation method using spatially partial simulation strategy is proposed for improving both the performance of the event-driven gate-level timing simulation and the debugging efficiency. The proposed method quickly generates the prediction data on-the-fly, but still accurately for the input values and output values of parallel event-driven local simulations by applying the strategy to the simulation at the higher abstraction level. For those six designs which had used for the performance evaluation of the proposed strategy, our method had shown about 3.7x improvement over the most general sequential event-driven gate-level timing simulation, 9.7x improvement over the commercial multi-core based parallel event-driven gate-level timing simulation, and 2.7x improvement over the best of previous prediction-based parallel simulation results, on average.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.4
• /
• pp.143-150
• /
• 2013

The purpose of this study is to suggest the methodology to develop variable-scale network model, which is able to induce large-scale road network in detailed level corresponding to small-scale linear objects with various abstraction in higher level. For this purpose, the definition of terms, the benefits and the specific procedures related with a variable-scale model were examined. Second, representation level and the components of layer to design the variable-scale map were presented. In addition, rule-based data generating method and indexing structure for higher LoD were defined. Finally, the implementation and verification of the model were performed to road network in study area (Jeju -do) so that the proposed algorithm can be practical. That is, generated variable scale road network were saved and managed in spatial database (Oracle Spatial) and performance analysis were carried out for the effectiveness and feasibility of the model.

• Journal of architectural history
• /
• v.23 no.4
• /
• pp.7-17
• /
• 2014

This paper aims at researching the cave concept of the Japanese architect Terunobu Fujimori and the result could be summarised as follows. First, a cave is Fujimori's only theme related to the interior space. He set some design guidelines for practice concerning openings of the wall and finishing materials of the interior, following the two major characteristics of a cave: 'comfortability' and 'homogeneity in material'. And 'fire' was also the premise in the cave as a 'spirit' of the space. Second, Fujimori applied the concrete guidelines to Tanpopo House (1994~95), which had in fact borne the ideas. Yakisugi House (2005~07) that took the cave as its design theme showed the transition of his cave concept, from closedness to openness. Third, though his cave concept might deserve the criticism that it is inclined to 'image' rather than 'essence', it illustrates that he seeks after an archetype of human dwelling before the purity of the original space was tarnished with rationality and abstraction. And the cave idea allows the seemingly contradictory 'sachlich' and 'surrealistic' features to coexist. Summing up, Fujimori's cave concept proves that his architecture is a rejection of the Cartesian modernist ideal and the contemporary architects' desire for dematerialisation. In a fundamental level, however, it is a result of his strategic choice induced by his own primary principle that his building must not be similar to any styles in history or any other architects' works in the world.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1936-1939
• /
• 2004

This paper proposes streaming layer for personal robot's middleware. Under assumption that robot has open architecture, i.e. consists of modules created by different vendors and intercommunication between these modules is necessary, we have to consider that there are many different network interfaces. To make communication between modules possible it is necessary to develop new type of middleware. Such middleware has to support different platforms, i.e. OS, network interface, hardware, etc. In addition, it is necessary to implement effective interface between network and application in order to manage inter application communications and use network resources more effectively. Streaming layer is such interface that implements necessary functionality together with simplicity and portability. Streaming layer provides high level of abstraction and makes communication between distributed applications transparent as if are located in same module. With possibility of extension by user defined application interfaces it is suitable for distributed environments, i.e. module based architecture including small-embedded systems like as DSP board. To verify the proposed streaming layer structure it is implemented using C and tested.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.411-420
• /
• 2002

The left-associative grammar model (LAG) has been applied successfully to the morphologic and syntactic analysis of various european and asian languages. The algebraic definition of the LAG is very well suited for the application to natural language processing as it inherently obeys de Saussure's second law (de Saussure, 1913, p. 103) on the linear nature of language, which phrase-structure grammar (PSG) and categorial grammar (CG) do not. This paper describes the so-called Loom-LAGs (LLAG) -a specialization of LAGs for the analysis of natural language. Whereas the only means of language-independent abstraction in ordinary LAG is the principle of possible continuations, LLAGs introduce a set of more detailed language-independent generalizations that form the so-called loom of a Loom-LAG. Every LLAG uses the very smut loom and adds the language-specific information in the form of a declarative description of the language -much like an ancient mechanised Jacquard-loom would take a program-card providing the specific pattern for the cloth to be woven. The linguistic information is formulated declaratively in so-called syntax plans that describe the sequential structure of clauses and phrases. This approach introduces the explicit notion of phrases and sentence structure to LAG without violating de Saussure's second law iud without leaving the ground of the original algebraic definition of LAG, LLAGS can in fact be shown to be just a notational variant of LAG -but one that is much better suited for the manual development of syntax grammars for the robust analysis of free texts.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.31 no.2
• /
• pp.116-124
• /
• 1989

Based on the theory of runoff equation proposed by SCS, the actual storage capacity(Sa) as a modified retention paramater was introduced to estimate the effective rainfall for the daily streamfiow analysis. During a storm, the actual storage capacity is limited by either soil water storage or infiltration rate as precipitation increases. Therefore, it was assumed that Sa is dependent on the baseflow before storm runoff(Qb) corresponding to soil water storage and the total amount of precipitation(P) corresponding to infiltration rate of a watershed. Effective rainfalls (Direct run-offs) estimate4 from SCS equation using Sa were compared with observed effective rainfalls at 10 watersheds in Geum river watershed boundary. 1. Regression equation for Sa was supposed Sa=Co+C$_1$XP+C$_2$X Qb Regression coefficients were highly significant at the level of 0. 01 and R$^2$ were 0.57 to 0.73. 2. The adjustment of coefficient of initial abstraction was made according to the storm size. It was adjusted to 025 for 30mm or less, 0.23 for 30 to 80mm, 0.20 for 80 to 200mm, and 0.1 for 200mm or more. 3. Regression equations between estimated and observed effective rainfall showed that slopes were 0.857 to 1.029 and R$^2$ were 0.779 to 0.989,

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.6
• /
• pp.1171-1180
• /
• 2019

Emotion is a psycho-physiological process that plays an important role in human interactions. Affective computing is centered on the development of human-aware artificial intelligence that can understand and regulate emotions. This field of study is also critical as mental diseases such as depression, autism, attention deficit hyperactivity disorder, and game addiction are associated with emotion. Despite the efforts in emotions recognition and emotion detection from nonstationary, detecting emotions from abnormal EEG signals requires sophisticated learning algorithms because they require a high level of abstraction. In this paper, we investigated LSTM hyperparameters for an optimal emotion EEG classification. Results of several experiments are hereby presented. From the results, optimal LSTM hyperparameter configuration was achieved.

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1178-1178
• /
• 1999

A spatial join has the property that its execution time exponentially increases in proportion to the number of spatial objects. Recently, there have been many attempts for improving the performance of the spatial join by using parallel processing schemes, In the case of executing parallel spatial join using the parallel machine with shared disk architecture, the disk bottleneck of parallel processing of spatial join worsens in comparison with sequential spatial join. This paper presents the algorithms of task creation and assignment to reduce the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing between processors, This paper proposes object caching which is a higher level of abstraction than page caching, and uses it to do creation and assignment of tasks according to temporal and spatial localities for minimizing disk access time. The object caching shows the performance improvement of 50%. The task creation and assignment using localities gives the gain of 30% and 20%. Overall performance evaluation of the proposed algorithms shows 7.2 times speed up than those of sequential execution of spatial joins.