• Title/Summary/Keyword: Real-valued data

Search Result 62, Processing Time 0.13 seconds

Function Optimization and Event Clustering by Adaptive Differential Evolution (적응성 있는 차분 진화에 의한 함수최적화와 이벤트 클러스터링)

  • Hwang, Hee-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.5
    • /
    • pp.451-461
    • /
    • 2002
  • Differential evolution(DE) has been preyed to be an efficient method for optimizing real-valued multi-modal objective functions. DE's main assets are its conceptual simplicity and ease of use. However, the convergence properties are deeply dependent on the control parameters of DE. This paper proposes an adaptive differential evolution(ADE) method which combines with a variant of DE and an adaptive mechanism of the control parameters. ADE contributes to the robustness and the easy use of the DE without deteriorating the convergence. 12 optimization problems is considered to test ADE. As an application of ADE the paper presents a supervised clustering method for predicting events, what is called, an evolutionary event clustering(EEC). EEC is tested for 4 cases used widely for the validation of data modeling.

Research on University Students' Recognition of Recreation (대학생들의 레크리에이션에 관한 인식 조사)

  • Song, Dea-Jin;Son, Jeoung-A
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.5
    • /
    • pp.2038-2044
    • /
    • 2012
  • This study speculates on the Korea's current recreation activity via surveys on students' recognition of recreation activity. For the research, the number of 200 university students (subjects) in D metropolitan city who had attended a recreation class or program was collected as a population, among which the data of 188 subjects were used for the real analysis. The collected data were analyzed through 'Frequency Anaalysis' and 'Chi-square Test' using SPSS Ver. 12.0. First, 'gender' was not significant in the area of students' recognitional difference according to their personal data (gender, department); on the other hand, a slight difference was found in 'department'; but in general, the recreation activity was regarded as a sort of entertainment in which people gather and have fun together, and it was thought to be involved in leisure. Second, the recreational activity in students' minds was presented into school MT, orientation, athletic meeting, camping, etc. The results demonstrate that the concept of recreation in our country became considerably reduced compared to its original meaning, and a recreation leader's authority came to be also low-valued.

Genetic Programming with Weighted Linear Associative Memories and its Application to Engineering Problems (가중 선형 연상기억을 채용한 유전적 프로그래밍과 그 공학적 응용)

  • 연윤석
    • Korean Journal of Computational Design and Engineering
    • /
    • v.3 no.1
    • /
    • pp.57-67
    • /
    • 1998
  • Genetic programming (GP) is an extension of a genetic algoriths paradigm, deals with tree structures representing computer programs as individuals. In recent, there have been many research activities on applications of GP to various engineering problems including system identification, data mining, function approximation, and so forth. However, standard GP suffers from the lack of the estimation techniques for numerical parameters of the GP tree that is an essential element in treating various engineering applications involving real-valued function approximations. Unlike the other research activities, where nonlinear optimization methods are employed, I adopt the use of a weighted linear associative memory for estimation of these parameters under GP algorithm. This approach can significantly reduce computational cost while the reasonable accurate value for parameters can be obtained. Due to the fact that the GP algorithm is likely to fall into a local minimum, the GP algorithm often fails to generate the tree with the desired accuracy. This motivates to devise a group of additive genetic programming trees (GAGPT) which consists of a primary tree and a set of auxiliary trees. The output of the GAGPT is the summation of outputs of the primary tree and all auxiliary trees. The addition of auxiliary trees makes it possible to improve both the teaming and generalization capability of the GAGPT, since the auxiliary tree evolves toward refining the quality of the GAGPT by optimizing its fitness function. The effectiveness of this approach is verified by applying the GAGPT to the estimation of the principal dimensions of bulk cargo ships and engine torque of the passenger car.

  • PDF

On the Errors of the Phased Beam Tracing Method for the Room Acoustic Analysis (실내음향 해석을 위한 위상 빔 추적법의 사용시 오차에 관하여)

  • Jeong, Cheol-Ho;Ih, Jeong-Guon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.1
    • /
    • pp.1-11
    • /
    • 2008
  • To overcome the mid frequency limitation of geometrical acoustic techniques, the phased geometrical method was suggested by introducing the phase information into the sound propagation from the source. By virtue of phase information, the phased tracing method has a definite benefit in taking the interference phenomenon at mid frequencies into account. Still, this analysis technique has suffered from difficulties in dealing with low frequency phenomena, so called, wave nature of sound. At low frequencies, diffraction at corners, edges, and obstacles can cause errors in simulating the transfer function and the impulse response. Due to the use of real valued absorption coefficient, simulated results have shown a discrepancy with measured data. Thus, incorrect phase of the reflection characteristic of a wall should be corrected. In this work, the uniform theory of diffraction was integrated into the phased beam tracing method (PBTM) and the result was compared to the ordinary PBTM. By changing the phase of the reflection coefficient, effects of phase information were investigated. Incorporating such error compensation methods, the acoustic prediction by PBTM can be further extended to low frequency range with improved accuracy in the room acoustic field.

Single Path Phase-only Security System using Phase-encoded XOR Operations in Fourier Plane (푸리에 영역에서의 위상 변조 Exclusive-OR 연산을 이용한 단일 경로 위상 암호화 시스템)

  • Shin, Chang-Mok;Cho, Kyu-Bo;Kim, Soo-Joong;Noh, Duck-Soo
    • Korean Journal of Optics and Photonics
    • /
    • v.16 no.4
    • /
    • pp.326-333
    • /
    • 2005
  • Phase-only encryption scheme using exclusive-OR rules in Fourier plane and a single path decryption system are presented. A zero-padded original image, multiplied by a random phase image, is Fourier transformed and its real-valued data is encrypted with key data by using XOR rules. A decryption is simply performed based on 2-1 setup with spatial filter by Fourier transform for multiplying phase-only encrypted data by phase-only key data, which are obtained by phase-encoding process, and spatial filtering for zero-order elimination in inverse-Fourier plane. Since the encryption process is peformed in Fourier plane, proposed encryption scheme is more tolerant to loss of key information by scratching or cutting than previous XOR encryption method in space domain. Compare with previous phase-visualization systems, due to the simple architecture without a reference wave, our system is basically robust to mechanical vibrations and fluctuations. Numerical simulations have confirmed the proposed technique as high-level encryption and simple decryption architecture.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

Evaluation Methodology of Greenhouse Gas On-Line Monitoring on Freeway (고속도로 구간의 온실가스 On-Line 모니터링 산정방법)

  • Lee, Soong-bong;Chang, Hyun-ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.16 no.2
    • /
    • pp.92-104
    • /
    • 2017
  • Previous management for speed in road traffic system was aimed only to the improvement of mobility and safety. However, consideration for the aspect of environment and energy consumption efficiency was valued less than the former ones. Nevertheless, economical damage scope caused by climate change has been increasing and it is estimated that environmental value will be increased because of the change of external circumstances. In addition, policy for reducing carbon emission in transportation system was assessed as insufficient in improving the condition of traffic road since it only focused on the transition of private vehicle into public transportation and development of eco-friendly car. Now it is the time to prepare for the adaptation strategy and precaution for the increased number of private vehicle in Korea. For this, paradigm shift in traffic operation which includes the policy not only about the mobility but also about caring environment would be needed. It is needed to be able to monitor the actual amount of greenhouse gas in real time to reduce the amount of emitted greenhouse gas in the aspect of traffic management. In this research, a methodology which can build on-line greenhouse gas emission monitoring system by using real time traffic data and predicting the circumstance in next 5 minutes was suggested.

A Study of the Weight value to Risky Driving Type (위험운전유형에 따른 가중치 산정에 관한 연구)

  • Oh, Ju-Taek;Lee, Sang-Yong
    • International Journal of Highway Engineering
    • /
    • v.11 no.1
    • /
    • pp.105-115
    • /
    • 2009
  • According to the accident statistics published by the National Police Agency in 2007, the number of commercial vehicle(city, suburb and other buses) accidents consumes 3.5 percent of the total number of traffic accidents in this year. Since the commercial vehicles are responsible for not only the drivers but also the passengers, it leads more serious social and economic problems. There have been various forms of systems such as a digital speedometer or a black box to meet the social requirement for reducing traffic accidents and safe driving. however the system based on the data after accident control the driver by analyze dangerous drive behaviors, so there is a limit to control driver in real-time. Also speedometer currently managed provide the driver warning information in real-time, but using only the speed of vehicle and RPM information regardless of actual dangerous drive behaviors, disappear the effectiveness. In this study performed a simulation for drivers in general using a simulator programed with dangerous driving types we had developed in the previous study and judging the types. It'd be more effective system to provide the drivers warning information using weight valued in this study. However in this study is limited to apply weight as a result of simulation of drivers in general in actual situation should be made up the deficit based on information of driving type of actual commercial vehicles.

  • PDF

A Study of Textured Image Segmentation using Phase Information (페이즈 정보를 이용한 텍스처 영상 분할 연구)

  • Oh, Suk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.249-256
    • /
    • 2011
  • Finding a new set of features representing textured images is one of the most important studies in textured image analysis. This is because it is impossible to construct a perfect set of features representing every textured image, and it is inevitable to choose some relevant features which are efficient to on-going image processing jobs. This paper intends to find relevant features which are efficient to textured image segmentation. In this regards, this paper presents a different method for the segmentation of textured images based on the Gabor filter. Gabor filter is known to be a very efficient and effective tool which represents human visual system for texture analysis. Filtering a real-valued input image by the Gabor filter results in complex-valued output data defined in the spatial frequency domain. This complex value, as usual, gives the module and the phase. This paper focused its attention on the phase information, rather than the module information. In fact, the module information is considered very useful at region analysis in texture, while the phase information was considered almost of no use. But this paper shows that the phase information can also be fully useful and effective at region analysis in texture, once a good method introduced. We now propose "phase derivated method", which is an efficient and effective way to compute the useful phase information directly from the filtered value. This new method reduces effectively computing burden and widen applicable textured images.

Image Watermark Method Using Multiple Decoding Keys (다중 복호화 키들을 이용한 영상 워터마크 방법)

  • Lee, Hyung-Seok;Seo, Dong-Hoan;Cho, Kyu-Bo
    • Korean Journal of Optics and Photonics
    • /
    • v.19 no.4
    • /
    • pp.262-269
    • /
    • 2008
  • In this paper, we propose an image watermark method using multiple decoding keys. The advantages of this method are that the multiple original images are reconstructed by using multiple decoding keys in the same watermark image, and that the quality of reconstructed images is clearly enhanced based on the idea of Walsh code without any side lobe components in the decoding process. The zero-padded original images, multiplied with random-phase pattern to each other, are Fourier transformed. Encoded images are then obtained by taking the real-valued data from these Fourier transformed images. The embedding images are obtained by the product of independent Walsh codes, and these spreaded phase-encoded images which are multiplied with new random-phase images. Also we obtain the decoding keys by multiplying these random-phase images with the same Walsh code images used in the embedding images. A watermark image is then made from the linear superposition of the weighted embedding images and a cover image, which is multiplied with a new independent Walsh code. The original image is simply reconstructed by the inverse-Fourier transform of the despreaded image of the multiplication between the watermark image and the decoding key. Computer simulations demonstrate the efficiency of the proposed watermark method with multiple decoding keys and a good robustness to the external attacks such as cropping and compression.