• Title/Summary/Keyword: Auxiliary information

Search Result 528, Processing Time 0.027 seconds

REGULARIZED MIXED QUASI EQUILIBRIUM PROBLEMS

  • Noor Muhammad Aslam
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.183-191
    • /
    • 2007
  • In this paper, we introduce and study a new class of equilibrium problems, known as regularized mixed quasi equilibrium problems. We use the auxiliary principle technique to suggest and analyze some iterative schemes for regularized equilibrium problems. We prove that the convergence of these iterative methods requires either pseudomonotonicity or partially relaxed strongly monotonicity. Our proofs of convergence are very simple. As special cases, we obtain earlier results for solving equilibrium problems and variational inequalities involving the convex sets.

Characteristics of DC Plasma Display Panel with Double Pulse Memory (Double Pulse Memory 방식을 이용한 DC Plasma Display Panel의 특성 연구)

  • 최경철;신범재;왕기웅
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.1
    • /
    • pp.67-75
    • /
    • 1992
  • A new method of driving the PDP(Plasma Display Panel) was proposed and its characteristics were investigated. Applying high frequency non-discharge pulses to an auxiliary anode resulted an increased region of stable operation, decreased delay time and increased light intensity. It is suggested that PDP with DPM (Double Pulse Memory) drive technique improves the delay time, luminance, region of stable operation and luminous efficacy compared to PDP with PPM(Planar Pulse Memory) drive technique developed by NHK Lab. in Japan.

  • PDF

A Study on Implementing of AC-3 Decoding Algorithm Software (AC-3 Decoding Algorithm Software 구현에 관한 연구)

  • 이건욱;박인규
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.1215-1218
    • /
    • 1998
  • 본 논문은 Digital Audio Compression(AC-3) Standard 인 A-52를 기반으로 하였으며 Borland C++3.1 Compiler를 사용하여 AC-3 Decoding Algorithm 구현하였다. Input Stream은 DVD VOB File에서 AC-3 Stream만을 분리하여 사용하며 최종 출력은 16 Bit PCM File이다. AC-3의 Frame구조는 Synchronization Information, Bit Stream Information, Audio Block, Auxiliary Data, Error Check로 구성된다. Aduio Block 은 모두 6개의 Block으로 나뉘어져 있다. BSI와 Side Information을 참조하여 Exponent를 추출하여 Exponent Strategy에 따라 Exponent를 복원한다. 복원된 Exponent 정보를 이용하여 Bit Allocation을 수행하여 각각의 Mantissa에 할당된 Bit수를 계산하고 Stream으로부터 Mantissa를 추출한다. Coupling Parameter를 참조하ㅕ Coupling Channel을 Original Channel로 복원시킨다. Stereo Mode에 대해서는 Rematrixing을 수행한다. Dynamic Range는 Mantissa와 Exponent의 Magnitude를 바꾸는 것으로 선택적으로 사용할 수 있다. Mantissa와 Exponent를 결합하여 Floating Point coefficient로 만든 후 Inverse Transform을 수행하면 PCM Data를 얻을 수 있다. PC에서 듣기 위해서는 Multi Channel을 Stereo나 Mono로 Downmix를 수행한다. 이렇게 만들어진 PCM data는 PCM Data를 재생하는 프로그램으로 재생할 수 있다.

  • PDF

Self Maintainable Data Warehouse Views for Multiple Data Sources (다중 데이터 원천을 가지는 데이터웨어하우스 뷰의 자율갱신)

  • Lee, Woo-Key
    • Asia pacific journal of information systems
    • /
    • v.14 no.3
    • /
    • pp.169-187
    • /
    • 2004
  • Self-maintainability of data warehouse(DW) views is an ability to maintain the DW views without requiring an access to (i) any underlying databases or (ii) any information beyond the DW views and the delta of the databases. With our proposed method, DW views can be updated by using only the old views and the differential files such as different files, referential integrity differential files, linked differential files, and backward-linked differential files that keep the truly relevant tuples in the delta. This method avoids accessing the underlying databases in that the method achieves self-maintainability even in preparing auxiliary information. We showed that out method can be applicable to the DW views that contain joins over relations in a star schema, a snowflake schema, or a galaxy schema.

Grammatical Interfaces in Korean Honorification: A Constraint-based Perspective

  • Kim, Jong-Bok
    • Language and Information
    • /
    • v.19 no.1
    • /
    • pp.19-36
    • /
    • 2015
  • Honorific agreement is one of the main properties in languages like Korean, playing a pivotal role in appropriate communication. This makes the deep processing of honorific information crucial in various computational applications such as spoken language translation and generation. This paper shows that departing from previous literature, an adequate analysis of Korean honorification needs to involve a system that has access not only to morpho-syntax but to semantics and pragmatics as well. Along these lines, this paper offers a constraint-based HPSG analysis of Korean honorification in which the enriched lexical information tightly interacts with syntactic, semantic, and pragmatic levels for the proper honorific system.

  • PDF

Bidirectional Soft Switching DC-DC Converter using ZVS method (ZVS기법을 사용한 양방향 소프트 스위칭 DC-DC 컨버터)

  • Oh, Soon-Tack;Kim, Jae-Hyung;Eom, Ju-Kyung;Won, Chung-Yuen;Jung, Yong-Chae
    • Proceedings of the KIPE Conference
    • /
    • 2010.07a
    • /
    • pp.29-30
    • /
    • 2010
  • This paper proposed bidirectional DC-DC converter applying soft switching technique. Compared with conventional bidirectional converter, the main switches of proposed converter are operated without switching losses, and auxiliary switches were run under soft switching condition using quasi-resonant current mode. To verify the validity of the proposed converter, mode analysis and simulation results are presented.

  • PDF

Implementation of .NET-based Multi Messenger supporting Face to face chatting (.NET을 기반으로 한 화상 전송이 가능한 멀티 메신저의 구현)

  • Kim, Dong-Gyu;Park, Jae-Uk;Lee, Seong-Jin;An, Seong-Ok
    • The Journal of Engineering Research
    • /
    • v.5 no.1
    • /
    • pp.5-16
    • /
    • 2004
  • In the era which computer communication changes from auxiliary means of communication to main means of communication, the messenger system becomes the leader of communication. The multi messenger implemented in this paper used .NET and strong MFC as a language of next generation to put n higher competitiveness than current another messenger systems. In addition, it included face to face chatting function as well as messenger function.

  • PDF

Collaborative Filtering Algorithm Based on User-Item Attribute Preference

  • Ji, JiaQi;Chung, Yeongjee
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.2
    • /
    • pp.135-141
    • /
    • 2019
  • Collaborative filtering algorithms often encounter data sparsity issues. To overcome this issue, auxiliary information of relevant items is analyzed and an item attribute matrix is derived. In this study, we combine the user-item attribute preference with the traditional similarity calculation method to develop an improved similarity calculation approach and use weights to control the importance of these two elements. A collaborative filtering algorithm based on user-item attribute preference is proposed. The experimental results show that the performance of the recommender system is the most optimal when the weight of traditional similarity is equal to that of user-item attribute preference similarity. Although the rating-matrix is sparse, better recommendation results can be obtained by adding a suitable proportion of user-item attribute preference similarity. Moreover, the mean absolute error of the proposed approach is less than that of two traditional collaborative filtering algorithms.

Implementation of the Agent using Universal On-line Q-learning by Balancing Exploration and Exploitation in Reinforcement Learning (강화 학습에서의 탐색과 이용의 균형을 통한 범용적 온라인 Q-학습이 적용된 에이전트의 구현)

  • 박찬건;양성봉
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.7_8
    • /
    • pp.672-680
    • /
    • 2003
  • A shopbot is a software agent whose goal is to maximize buyer´s satisfaction through automatically gathering the price and quality information of goods as well as the services from on-line sellers. In the response to shopbots´ activities, sellers on the Internet need the agents called pricebots that can help them maximize their own profits. In this paper we adopts Q-learning, one of the model-free reinforcement learning methods as a price-setting algorithm of pricebots. A Q-learned agent increases profitability and eliminates the cyclic price wars when compared with the agents using the myoptimal (myopically optimal) pricing strategy Q-teaming needs to select a sequence of state-action fairs for the convergence of Q-teaming. When the uniform random method in selecting state-action pairs is used, the number of accesses to the Q-tables to obtain the optimal Q-values is quite large. Therefore, it is not appropriate for universal on-line learning in a real world environment. This phenomenon occurs because the uniform random selection reflects the uncertainty of exploitation for the optimal policy. In this paper, we propose a Mixed Nonstationary Policy (MNP), which consists of both the auxiliary Markov process and the original Markov process. MNP tries to keep balance of exploration and exploitation in reinforcement learning. Our experiment results show that the Q-learning agent using MNP converges to the optimal Q-values about 2.6 time faster than the uniform random selection on the average.

A Bi-clausal Account of English 'to'-Modal Auxiliary Verbs

  • Hong, Sungshim
    • Language and Information
    • /
    • v.18 no.1
    • /
    • pp.33-52
    • /
    • 2014
  • This paper proposes a unified structural account of some instances of the English Modals and Semi-auxiliaries. The classification and the syntactic/structural description of the English Modal auxiliary verbs and verb-related elements have long been the center for many proposals in the history of generative syntax. According to van Gelderen (1993) and Lightfoot (2002), it was sometime around 1380 that the Tense-node (T) appeared in the phrasal structures of the English language, and the T-node is under which the English Modal auxiliaries occupy. Closely related is the existing evidence that English Modals were used as main verbs up to the early sixteenth century (Lightfoot 1991, Han 2000). This paper argues for a bi-clausal approach to English Modal auxiliaries with the infinitival particle 'to' such as 'ought to' 'used to' and 'dare (to)' 'need (to)', etc. and Semi-auxiliaries including 'be to' and 'have to'. More specifically, 'ought' in 'ought to' constructions, for instance, undergoes V-to-T movement within the matrix clause, just like 'HAVEAux' and all instances of 'BE', whereas 'to' occupies the T position of the embedded complement clause. By proposing the bi-clausal account, Radford's (2004, 2009) problems can be solved. Further, the historical motivation for the account takes a stance along with Norde (2009) and Brinton & Traugott (2005) in that Radford's (2004, 2009) syncretization of the two positions of the infinitival particle 'to' is no different from the 'boundary loss' in the process of Grammariticalization. This line of argument supports Krug's (2011), and in turn Bolinger's(1980) generalization on Auxiliaryhood, while providing a novel insight into Head movement of V-to-T in Present Day English.

  • PDF