The Transactions of the Korea Information Processing Society
/
v.4
no.1
/
pp.149-160
/
1997
This paper is concerned with the problem of speaker-adaptive speech synthes is method using a mapped codebook designed by fuzzy mapping on FLVQ (Fuzzy Learning Vector Quantization). The FLVQ is used to design both input and reference speaker's codebook. This algorithm is incorporated fuzzy membership function into the LVQ(learning vector quantization) networks. Unlike the LVQ algorithm, this algorithm minimizes the network output errors which are the differences of clas s membership target and actual membership values, and results to minimize the distances between training patterns and competing neurons. Speaker Adaptation in speech synthesis is performed as follow;input speaker's codebook is mapped a reference speaker's codebook in fuzzy concepts. The Fuzzy VQ mapping replaces a codevector preserving its fuzzy membership function. The codevector correspondence histogram is obtained by accumulating the vector correspondence along the DTW optimal path. We use the Fuzzy VQ mapping to design a mapped codebook. The mapped codebook is defined as a linear combination of reference speaker's vectors using each fuzzy histogram as a weighting function with membership values. In adaptive-speech synthesis stage, input speech is fuzzy vector-quantized by the mapped codcbook, and then FCM arithmetic is used to synthesize speech adapted to input speaker. The speaker adaption experiments are carried out using speech of males in their thirties as input speaker's speech, and a female in her twenties as reference speaker's speech. Speeches used in experiments are sentences /anyoung hasim nika/ and /good morning/. As a results of experiments, we obtained a synthesized speech adapted to input speaker.
The Transactions of the Korea Information Processing Society
/
v.3
no.1
/
pp.127-143
/
1996
Advanced countries are very active in deploying the National Information I infrastructure which provides universal service to promise fruitful quality of futuree life. Even in the distributed environment, we can closely converse, work together, and share information in a very convenient way. This is actually enabled with the help of groupware technology, which are currently focused and researched in a larger popularity. The aim of this study is to design a portable pack for group communications management to support the development of groupware application. In the paper we begin with technical survey, continue to build our own model for group communications man agement, and design its architecture and procedure. We also suggest group addressing mechanism under Internet environment such as how to create IP multicast address and IP port number dynamically and as a globally unique value for the communication session, with the help of the hierarchical and distributed address managers. We also indicate the reliable data transmission services to remedy the unreliable feature of the UDP multicast services, and finally the architecture/ applied to support the practical applications is briefly discussed for verification of the designed concept.
A class of SWP(Stochastic Wane Propagation) models microscopically mimics individual vehicles' stochastic behavior and traffic jam propagation with simplified car-following models based on CA(Cellular Automata) theory and macroscopically captures dynamic traffic flow relationships based on statistical physics. SWP model, a program-oriented model using both discrete time-space and integer data structure, can simulate a huge road network with high-speed computing time. However, the model has shortcomings to both the capturing of low speed within a jam microscopically and that of the density and back propagation speed of traffic congestion macroscopically because of the generation of spontaneous jam through unrealistic collision avoidance. In this paper, two additional rules are integrated into the NaSch model. The one is SMR(Stopping Maneuver Rule) to mimic vehicles' stopping process more realistically in the tail of traffic jams. the other is LAR(Low Acceleration Rule) for the explanation of low speed characteristics within traffic jams. Therefore, the CA car-following model with the two rules prevents the lockup condition within a heavily traffic density capturing both the stopping maneuver behavior in the tail of traffic jam and the low acceleration behavior within jam microscopically, and generates more various macroscopic traffic flow mechanism than NaSch model's with the explanation of propagation speed and density of traffic jam.
Using a strain-controlled rheometer [Rheometrics Dynamic Analyzer (RDA II)], the steady shear flow properties of a semi-solid ointment base (vaseline) have been measured over a wide range of shear rates at temperature range of $25{\sim}60^{\circ}C$. In this article, the steady shear flow properties (shear stress, steady shear viscosity and yield stress) were reported from the experimentally obtained data and the effects of shear rate as well as temperature on these properties were discussed in detail. In addition, several inelastic-viscoplastic flow models including a yield stress parameter were employed to make a quantitative evaluation of the steady shear flow behavior, and then the applicability of these models was examined by calculating the various material parameters (yield stress, consistency index and flow behavior index). Main findings obtained from this study can be summarized as follows : (1) At temperature range lower than $40^{\circ}C$, vaseline is regarded as a viscoplastic material having a finite magnitude of yield stress and its flow behavior beyond a yield stress shows a shear-thinning (or pseudo-plastic) feature, indicating a decrease in steady shear viscosity as an increase in shear rate. At this temperature range, the flow curve of vaseline has two inflection points and the first inflection point occurring at relatively lower shear rate corresponds to a static yield stress. The static yield stress of vaseline is decreased with increasing temperature and takes place at a lower shear rate, due to a progressive breakdown of three dimensional network structure. (2) At temperature range higher than $45^{\circ}C$, vaseline becomes a viscous liquid with no yield stress and its flow character exhibits a Newtonian behavior, demonstrating a constant steady shear viscosity regardless of an increase in shear rate. With increasing temperature, vaseline begins to show a Newtonian behavior at a lower shear rate range, indicating that the microcrystalline structure is completely destroyed due to a synergic effect of high temperature and shear deformation. (3) Over a whole range of temperatures tested, the Herschel-Bulkley, Mizrahi-Berk, and Heinz-Casson models are all applicable and have an almostly equivalent ability to quantitatively describe the steady shear flow behavior of vaseline, whereas the Bingham, Casson,and Vocadlo models do not give a good ability.
The Transactions of The Korean Institute of Electrical Engineers
/
v.67
no.11
/
pp.1423-1433
/
2018
Recently, a permanent magnet synchronous motor of middle and small-capacity has high torque, high precision control and acceleration / deceleration characteristics. But existing control has several problems that include unpredictable disturbances and parameter changes in the high accuracy and rigidity control industry or nonlinear dynamic characteristics not considered in the driving part. In addition, in the drive method for the control of low-vibration and high-precision, the process of connecting the permanent magnet synchronous motor and the load may cause the response characteristic of the system to become very unstable, to cause vibration, and to overload the system. In order to solve these problems, various studies such as adaptive control, optimal control, robust control and artificial neural network have been actively conducted. In this paper, an incremental encoder of the permanent magnet synchronous motor is used to detect the position of the rotor. And the position of the detected rotor is used for low vibration and high precision position control. As the controller, we propose augmented state feedback control with a speed observer and first order deadbeat disturbance observer. The augmented state feedback controller performs control that the position of the rotor reaches the reference position quickly and precisely. The addition of the speed observer to this augmented state feedback controller compensates for the drop in speed response characteristics by using the previously calculated speed value for the control. The first order deadbeat disturbance observer performs control to reduce the vibration of the motor by compensating for the vibrating component or disturbance that the mechanism has. Since the deadbeat disturbance observer has a characteristic of being vulnerable to noise, it is supplemented by moving average filter method to reduce the influence of the noise. Thus, the new controller with the first order deadbeat disturbance observer can perform more robustness and precise the position control for the influence of large inertial load and natural frequency. The simulation stability and efficiency has been obtained through C language and Matlab Simulink. In addition, the experiment of actual 2.5[kW] permanent magnet synchronous motor was verified.
Retransmissions on the DLC layer are essential to ABR service providing the low CLR (cell loss ratio) over the unreliable wireless channel with high bit error rate. In the wireless ATM, the DLC layer below ATM layer performs the retransmission and reordering of the cells to recover the cell loss over the wireless channel and by doing so, the effect of the wireless channel characteristics with high bit error rate can be minimized on the ATM layer which is designed under the assumption of the low bit error rate. We propose, in this paper, the schemes to reflect the changes of the transmission rate over the wireless channel on the ABR rate control. Proposed scheme can control the source rate to the changes of the transmission rate over the wireless channel and reduce the required buffer size in the AP (access point). In the simulation, we assume that the DLC layer can inform the ATM layer of the wireless channel quality as good or bad. Our simulation results show that the proposed schemes require the smaller buffer size compared with the existing scheme, enhanced dynamic max rate control algorithm (EDMRCA). It is also shown that the scheme with the intelligent DLC which adjusts the rate to the wireless channel quality not only provides the low CLR with smaller buffer requirement but also improves the throughput by utilizing the wireless bandwidth more efficiently.
A multicast tree includes several, possibly a large number of, paths connecting source-receiver pairs, and network failure may disable part of the multicast tree. Reconstruction of the entire multicast tree to recover from a component failure is highly undesirable, because some group members have to suffer service disruptions even though the communication paths to/from them are not affected by the failure. To limit reconfiguration region and to maximize the likelihood of successful reconfiguration, we propose and evaluate a pre-planned reconfiguration policy for QoS multicast sessions. Specifically, we equip a reconfiguration path (RP) with each end-to-end path that connects a source-receiver pair in the multicast tree, and reserve resources in advance along the RPs. Efficient resource-sharing techniques are applied to reduce the amount of resources reserved for RPs but not used in the absence of failures. This way, we prevent uncontrolled competition among different multicast sessions which may simultaneously try to recover from failures. We evaluate the performance of the proposed scheme using simulation on randomly-generated networks. We use the shortest-path routing for QoS multicast sessions, and simulate both source-based and shared multicast trees. The evaluation results indicates that successful pre-planned reconfiguration can be achieved for all group members with reasonable overhead. Our scheme is also shown to adapt well to dynamic changes of group membership.
We need various methods to develop MMORPG that is game genre which many users use among various game genre using Internet. Specially, to heighten efficiency of distributing work, Object-oriented language such as C++ is used and we need design techniques that can take advantage of enough object-oriented concept when making large-scale game. There is various pattern that can apply in software breakup design in GoF's design pattern for these design techniques. If you apply Observer pattern to Party System Design for forming community between game users, you can easily add new class and maintain system later. Party Play is one of the important system that is used to form game users' community in MMORPG games. The main point that must be considered in Party-Play-System is to divide evenly experience value and acquisition that is got by Party-Play among users according to each user's level. To implement Party Play System that consider maintenance of system, in this paper, we propose a method using GoF's Observer-Pattern, showing you that proposed method which has advantage to dynamic memory allocation and to virtual method call can be used usefully to change object to real time at program run and to add new class and to maintain system new.
The world of ubiquitous computing is one in which we will be surrounded by an ever-richer set of networked devices and services. Especially, mobile phone now becomes one of the key issues in ubiquitous computing environments. Mobile phones have been infecting our normal lives more thoroughly, and are the fastest technology in human history that has been adapted to people. In Korea, the number of mobile phones registered to the telecom company, is more than the population of the country. Last year, the numbers of mobile phone sold are many times more than the number of personal computer sold. The new advanced technology of mobile phone is now becoming the most concern on every field of technologies. The mix of wireless communication technology (wifi) and mobile phone (smart phone) has made a new world of ubiquitous computing and people can always access to the network anywhere, in high speed, and easily. In such a world, people cannot expect to have available to us specific applications that allow them to accomplish every conceivable combination of information that they might wish. They are willing to have information they want at easy way, and fast way, compared to the world we had before, where we had to have a desktop, cable connection, limited application, and limited speed to achieve what they want. Instead, now people can believe that many of their interactions will be through highly generic tools that allow end-user discovery, configuration, interconnection, and control of the devices around them. Serendipity is an application of the architecture that will help people to solve a concern of achieving their information. The word 'serendipity', introduced to scientific fields in eighteenth century, is the meaning of making new discoveries by accidents and sagacity. By combining to the field of ubiquitous computing and smart phone, it will change the way of achieving the information. Serendipity may enable professional practitioners to function more effectively in the unpredictable, dynamic environment that informs the reality of information seeking. This paper designs the Serendipity Service based on NFC (Near Field Communication) technology. When users of NFC smart phone get information and services by touching the NFC tags, serendipity service will be core services which will give an unexpected but valuable finding. This paper proposes the architecture, scenario and the interface of serendipity service using tag touch data, serendipity cases, serendipity rule base and user profile.
Kim, Sung-Ki;Jung, Jin-Chul;Park, Kyung-No;Min, Byoung-Joon
The KIPS Transactions:PartC
/
v.15C
no.3
/
pp.157-166
/
2008
The ubiquitous service environment is poor in reliability of connection and also has a high probability that the intrusion against a system and the failure of the services may happen. Therefore, It is very important to guarantee that the legitimate users make use of trustable services from the viewpoint of security without discontinuance or obstacle of the services. In this paper, we point out the problems in the standard Jini service environment and analyze the Jgroup/ARM framework that has been developed in order to help fault tolerance of Jini services. In addition, we propose a secure Jini service architecture to satisfy the security, availability and quality of services on the basis of the analysis. The secure Jini service architecture we propose in this paper is able to protect a Jini system not only from faults such as network partition or server crash, but also from attacks exploiting flaws. It provides security mechanism for dynamic trust establishment among the service entities. Moreover, our secure Jini service architecture does not incur high computation costs to merge the user service states because of allocation of the replica based on each session of a user. Through the experiment on a test-bed, we have confirmed that proposed secure Jini service architecture is able to guarantee the persistence of the user service states at the level that the degradation of services quality is ignorable.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.