• Title/Summary/Keyword: 그런지

Search Result 798, Processing Time 0.029 seconds

The Characteristics of Spectacularity and Narrative in Digital Fiction Film Split Screen (디지털 극영화 화면분할(Split Screen)의 내러티브와 스펙터클적 특성에 대하여)

  • Jang, Mi-Hwa;Moon, Jae-Cheol
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.1
    • /
    • pp.193-200
    • /
    • 2017
  • Computer technology pursuing more innovative image than before, makes some characteristics which distinguishes the digital fiction film from the analogue fiction film. One hand, the split screen in analogue film aides the development of drama in the aspect of narrative, on the other hand, it controls the psychology of spectator. The composite image in digital fiction film by computer graphic, and elaborated digital editing show many innovation in the field of audiovisual. In this context, I would like to remark on the digital film (2003) directed by Ang-Lee. In , the split screen and the composition of the fast transiition of shots in the scene of laboratory were created by computer graphic program for special effects. As visual special effect plays an important role in digital film, its narrative space creates a space which is distinguishable from that of analogue film.This can be an example which says a lot for the special aspect of digital narrative.

The User-centered Service Encounters for Service Design of Coffee Shop (커피 전문점 서비스디자인을 위한 사용자 중심의 서비스 접점)

  • Min, Sungki
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.10
    • /
    • pp.478-489
    • /
    • 2018
  • In this study, a normative script was designed for service design of coffee shop based on user's current and expected script. 1) Activities contained in current and expected script were identified. 2) High frequency activities were selected from current and expected script. Then they were combined and sorted by scene. 3) Importance of the integrated scenes and activities was assessed. 4) According to certain rules, unnecessary activities were deleted, or excluded as optional activities. Then, the remaining activities were classified by scene and listed in order to complete one normative script. Each activity belonging to each scene became a service encounter. Scenes consisted of 'Entering', 'Settling', 'Ordering', 'Waiting for drinks', 'Receiving drinks', 'Spending time drinking beverages', 'Go to the toilet', and 'Get out'. There were 2 activities in 'Entering', 6 activities in 'Settling', 11 activities in 'Ordering', 2 activities in 'Waiting for drinks', 4 activities in 'Receiving drinks', 6 activities in 'Spending time drinking beverages', 3 activities in 'Go to the toilet', and 4 activities in 'Get out'. Specific points were discussed along with these results, and the significance and limitations of the study were added at the end.

Comparability and uniformity of ontology for automated information integration of parts (부품 라이브러리의 자동 정보 통합을 위한 온톨로지의 비교 가능성과 균질성 확보)

  • Cho Joonmyun;Han Soonhung;Kim Hyun
    • The KIPS Transactions:PartD
    • /
    • v.12D no.3 s.99
    • /
    • pp.365-374
    • /
    • 2005
  • The B2B electronic product commerce needs intermediary system to provide an integrated interface for the parts libraries of multiple suppliers. However, it is difficult to automatically integrate the parts libraries because they are heterogeneous. Existing ontology-based approaches show a limited functionality of automated integration of information because Dey can not prevent ontologies from being modeled in different ways, so that the inter-ontology mappings to resolve the heterogeneity become complicated and arbitrary. In order to overcome such problems this paper proposes an ontology modeling framework for parts libraries based on the Guarino's theory of upper ontology. The framework provides knowledge modeling primitives which have explicit formal meanings and modeling principles based on ontological natures. Using the framework, ontology developers can model the knowledge of parts libraries systematically and consistently, so that the resulting ontologies become comparable and uniform and the ontology merging algorithm for the automated information integration can be easily developed.

A Simple Connection Pruning Algorithm and its Application to Simulated Random Signal Classification (연결자 제거를 위한 간단한 알고리즘과 모의 랜덤 신호 분류에의 응용)

  • Won, Yong-Gwan;Min, Byeong-Ui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.2
    • /
    • pp.381-389
    • /
    • 1996
  • A simple modification of the standard back-propagation algorithm to eliminate redundant connections(weights and biases) is described. It was motivated by speculations from the distribution of the magnitudes of the weights and the biases, analysis of the classification boundary, and the nonlinearity of the sigmoid function. After initial training, this algorithm eliminates all connections of which magnitude is below a threshold by setting them to zero. The algorithm then conducts retraining in which all weights and biases are adjusted to allow important ones to recover. In studies with Boolean functions, the algorithm reconstructed the theoretical minimum architecture and eliminated the connections which are not necessary to solve the functions. For simulated random signal classification problems, the algorithm produced the result which is consistent with the idea that easier problems require simpler networks and yield lower misclassification rates. Furthermore, in comparison, our algorithm produced better generalization than the standard algorithm by reducing over fitting and pattern memorization problems.

  • PDF

A Study on Generation of Parallel Task in High Performance Language (고성능 언어에서의 병렬 태스크 생성에 관한 연구)

  • Park, Sung-Soon;Koo, Mi-Soon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.6
    • /
    • pp.1636-1651
    • /
    • 1997
  • In task parallel language like Fortran M, programmer writes a task parallel program using parallel constructs which is provided. When some data dependencies exist between called procedures in various applications, it is difficult for programmer to write program according to their dependencies. Therefore, it is desirous that compiler can detect some implicit parallelisms and transform a program to parallelized form by using the task parallel constructs like PROCESSES block or PROCESSDO loop of Fortran M. But current task parallel language compilers can't provide these works. In this paper, we analyze the cases according to dependence relations and detect the implicit parallelism which can be transformed to task parallel constructs like PROCESSES block and PROCESSDO loop of Fortran M. Also, For the case which program can be paralleized both PROCESSES block and PROCESSDO loop, we analyze that which construct is more effective for various conditions.

  • PDF

Design and Fabrication of High Energy Efficient Reconfigurable Processor for Mobile Multimedia Applications (모바일 멀티미디어 응용을 위한 고에너지효율 재구성형 프로세서의 설계 및 제작)

  • Yeo, Soon-Il;Lee, Jae-Heung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11A
    • /
    • pp.1117-1123
    • /
    • 2008
  • Applications for mobile multimedia are testing the performance limits of present day CPUs with variety. However, hardwired solutions are inflexible and expensive to develop. CPUs with flexibility have limitation of performance. So, the requirement for both ASIC-like performance and CPU-like flexibility has led to reconfigurable processor. Mobile systems require low power and high performance concurrently. In this paper, we propose reconfigurable processor for mobile multimedia with high energy efficiency. Reconfigurable processor with 121MOPS/mW is developed by 130nm CMOS technology. And the processor was simulated for energy efficiency with 539MOPS/mW by 90nm CMOS technology and effective use of instructions. And we tested its applications for multimedia field. We tested the case of inverse MDCT for MP3 and DF for MPEG4 and ME for H.264.

Robust Detection of Body Areas Using an Adaboost Algorithm (에이다부스트 알고리즘을 이용한 인체 영역의 강인한 검출)

  • Jang, Seok-Woo;Byun, Siwoo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.11
    • /
    • pp.403-409
    • /
    • 2016
  • Recently, harmful content (such as images and photos of nudes) has been widely distributed. Therefore, there have been various studies to detect and filter out such harmful image content. In this paper, we propose a new method using Haar-like features and an AdaBoost algorithm for robustly extracting navel areas in a color image. The suggested algorithm first detects the human nipples through color information, and obtains candidate navel areas with positional information from the extracted nipple areas. The method then selects real navel regions based on filtering using Haar-like features and an AdaBoost algorithm. Experimental results show that the suggested algorithm detects navel areas in color images 1.6 percent more robustly than an existing method. We expect that the suggested navel detection algorithm will be usefully utilized in many application areas related to 2D or 3D harmful content detection and filtering.

Opinion Retrieval in Twitter Considering Syntactic Relations of Sentiment Phrase (의견 어구의 구문 관계를 고려한 트위터 의견 검색)

  • Kim, Yoonsung;Yang, Min-Chul;Lee, Seung-Wook;Rim, Hae-Chang
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.9
    • /
    • pp.492-497
    • /
    • 2014
  • In this paper, we propose a method of retrieving opinioned tweets in Twitter, which is the one of the popular Social Network Services and shares diverse opinions among various users. In typical opinion retrieval systems, they may consider the presence of sentiment phrases (subjectivity) as the important factor even if the subjective phrases are not related to a given query or speaker. To alleviate these problems, we utilized the syntactic structure of a sentence to identify the relationships between 1) subjectivity-query and 2) subjectivity-speaker and 3) the syntactic role of subjectivity. Besides, our learning-to-rank approach is trained to retrieve opinioned tweets based on query-relevance, textual features, user information, and Twitter-specific features. Experimental results on real world data show that our proposed method can achieve better performance than several baseline methods in terms of precision and nDCG.

A Point-Of-Interest Allomorph Database Construction System (POI 이형태 데이타베이스 구축 시스템)

  • Yang, Seung-Weon;Lee, Hyun-Young;Wang, Ji-Hyun
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.3
    • /
    • pp.226-235
    • /
    • 2009
  • People use various information for searching POI in the navigation system such as name, category, address, phone number. Most of users use name and category to search their POT. They don't know exact name in POI DB provided by Maker. They use abbreviated or generalized name as key word for searching POI. Because of these reasons, the hit ratio has been very low. In this paper, We suggest a extra DB_construction system for raising the hit ratio. It generates allomorphes DB link to the POI name in original DB. We classified the POI names in original DB into seven types of allomorph by analyzing the gathered patterns from the POI DB which has over 650,000 entries. For auto_generating the allomorphes, we made 577 rules based on the classified types. And we generated the allomorphes manually for the entries which are difficult to make the rule and has low frequency The generated allomorphes account for 35.8% of all original DB. The hit ratio is 89% under suggested system.

A Method for Identifying Nicknames of a User based on User Behavior Patterns in an Online Community (온라인 커뮤니티 사용자의 행동 패턴을 고려한 동일 사용자의 닉네임 식별 기법)

  • Park, Sang-Hyun;Park, Seog
    • Journal of KIISE
    • /
    • v.45 no.2
    • /
    • pp.165-174
    • /
    • 2018
  • An online community is a virtual group whose members share their interests and hobbies anonymously with nicknames unlike Social Network Services. However, there are malicious user problems such as users who write offensive contents and there may exist data fragmentation problems in which the data of the same user exists in different nicknames. In addition, nicknames are frequently changed in the online community, so it is difficult to identify them. Therefore, in this paper, to remedy these problems we propose a behavior pattern feature vectors for users considering online community characteristics, propose a new implicit behavior pattern called relationship pattern, and identify the nickname of the same user based on Random Forest classifier. Also, Experimental results with the collected real world online community data demonstrate that the proposed behavior pattern and classifier can identify the same users at a meaningful level.