• 제목/요약/키워드: combinatorial

검색결과 694건 처리시간 0.025초

보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법 (Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation)

  • 권오병
    • Asia pacific journal of information systems
    • /
    • 제19권3호
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

피부 섬유아세포에서 광자극의 효과 (The Effect of Photomodulation in Human Dermal Fibroblasts)

  • 김미나;곽택종;강내규;이상화;박선규;이천구
    • 대한화장품학회지
    • /
    • 제41권4호
    • /
    • pp.325-331
    • /
    • 2015
  • 피부는 낮 동안 태양빛과 인공 빛에 끊임없이 노출되어 있으며, 그중 5%는 UV 영역, 50%는 가시광선, 나머지 45%는 적외선 영역으로 구성되어 있다. 이중 자외선의 피부에 대한 영향은 많은 연구가 되어 왔으나, 나머지 영역에 대한 연구는 미진한 실정이다. 이에, 가시광선에서 적외선 사이의 파장이 피부 섬유아세포에 어떤 영향을 미치는지 연구하고자 하였다. 광처리에 의한 효과는 광파장, 처리 시간, 광세기, 광조합 등 다양한 파라미터들의 조합에 의해 그 효능이 결정되므로, 본 연구에서는 섬유아세포의 성장 및 콜라겐 합성과 관련된 기능을 촉진시킬 수 있는 광처리 조건을 찾아내고자 하였다. 가시광선과 적외선 영역 사이의 6개의 파장을 처리한 결과, 레드(630 nm)와 그린(520 nm) 파장에 의해 섬유아세포의 증식이 증가함을 확인하였다. 광처리 시간은 콜라겐 합성량 증가를 위해서는 10 min의 광처리가 30 min의 광처리 보다 적합한 조건이었다. 광세기는 $0.05{\sim}0.75mW/cm^2$에서 6개의 광세기로 분할하여 실험한 결과, 레드 $0.3mW/cm^2$와 그린파장 0.15, $0.3mW/cm^2$ 세기가 type I collagen의 mRNA의 양을 증가시킬 수 있었다. 마지막으로 두 개 파장을 순차적으로 조합 처리하였을 때의 효과를 확인한 결과, 레드와 그린파장의 조합 조건은 섬유아세포의 수적증가를 목적으로 할 때 효율적인 방법이며, 콜라겐 합성에는 레드 단독처리가 보다 효과적인 방법이었다. 따라서 본 연구에서 제시하는 광처리 조건을 이용시 피부 세포의 성장이나 콜라겐 합성에 긍정적 영향을 유도할 수 있으며, 재생 및 피부 미용 등에 활용할 수 있는 가능성이 클 것으로 기대된다.

과산화수소에 노출된 인간 각질형성세포에서 길이가 다른 시스테인 함유 펩타이드의 항산화 효과 (Antioxidant Effects of Cysteine-containing Peptides of Different Lengths in Human HaCaT Keratinocytes Exposed to Hydrogen Peroxide)

  • 하재원;최준용;부용출
    • 대한화장품학회지
    • /
    • 제49권3호
    • /
    • pp.193-201
    • /
    • 2023
  • H2O2는 세포에서 산화 스트레스를 유발하여 세포 성장, 증식, 노화 및 사멸에 영향을 미치는 일종의 활성산소종(ROS)이다. 본 연구의 목적은 H2O2의 세포 독성을 완화시키는 활성 펩타이드를 찾는 것이다. 잠재적인 활성 펩타이드의 서열을 예측하기 위해서 위치 스캐닝 합성 테트라펩타이드 조합 라이브러리를 탐색하였다. H2O2로 유도된 인간 각질형성세포(HaCaT 세포)의 사멸에 대한 펩타이드 풀들의 완화 효과를 비교한 결과, 다양한 활성 펩타이드의 시퀀스가 예측되었다. 특히 시스테인(C) 잔기를 함유한 펩타이드가 활성이 있을 것으로 예측되었다. 후속 실험에서 C-NH2, CC-NH2, CCC-NH2, CCCC-NH2 등의 길이가 다른 시스테인 함유 펩타이드들의 세포 독성과 활성을 조사하였다. C-NH2 및 CC-NH2는 1.0 mM 이하에서 유의한 세포 독성이 없었지만 CCC-NH2 및 CCCC-NH2는 상대적으로 강한 세포 독성을 보였다. C-NH2와 CC-NH2는 H2O2로 유도된 세포독성을 완화시켰다. CC-NH2는 C-NH2, C, N-아세틸 시스테인(NAC) 및 글루타티온(GSH)보다 세포 보호 효과가 높았다. 유세포 분석법으로 세포 내 ROS를 측정하였을 때, H2O2는 ROS의 생성을 증가시켰다.H2O2 노출조건에서 CC-NH2는 C-NH2보다는 더 효과적으로 ROS 생성을 억제하였고, C, NAC, GSH 만큼 효과적이었다. 본 연구의 결과는 다양한 시스테인 함유 펩타이드 중 특히 CC-NH2가 H2O2로 유도된 세포 독성과 ROS 생성을 안전하고 효과적으로 완화시키는 항산화 특성이 있음을 시사한다.

Memory Organization for a Fuzzy Controller.

  • Jee, K.D.S.;Poluzzi, R.;Russo, B.
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
    • /
    • pp.1041-1043
    • /
    • 1993
  • Fuzzy logic based Control Theory has gained much interest in the industrial world, thanks to its ability to formalize and solve in a very natural way many problems that are very difficult to quantify at an analytical level. This paper shows a solution for treating membership function inside hardware circuits. The proposed hardware structure optimizes the memoried size by using particular form of the vectorial representation. The process of memorizing fuzzy sets, i.e. their membership function, has always been one of the more problematic issues for the hardware implementation, due to the quite large memory space that is needed. To simplify such an implementation, it is commonly [1,2,8,9,10,11] used to limit the membership functions either to those having triangular or trapezoidal shape, or pre-definite shape. These kinds of functions are able to cover a large spectrum of applications with a limited usage of memory, since they can be memorized by specifying very few parameters ( ight, base, critical points, etc.). This however results in a loss of computational power due to computation on the medium points. A solution to this problem is obtained by discretizing the universe of discourse U, i.e. by fixing a finite number of points and memorizing the value of the membership functions on such points [3,10,14,15]. Such a solution provides a satisfying computational speed, a very high precision of definitions and gives the users the opportunity to choose membership functions of any shape. However, a significant memory waste can as well be registered. It is indeed possible that for each of the given fuzzy sets many elements of the universe of discourse have a membership value equal to zero. It has also been noticed that almost in all cases common points among fuzzy sets, i.e. points with non null membership values are very few. More specifically, in many applications, for each element u of U, there exists at most three fuzzy sets for which the membership value is ot null [3,5,6,7,12,13]. Our proposal is based on such hypotheses. Moreover, we use a technique that even though it does not restrict the shapes of membership functions, it reduces strongly the computational time for the membership values and optimizes the function memorization. In figure 1 it is represented a term set whose characteristics are common for fuzzy controllers and to which we will refer in the following. The above term set has a universe of discourse with 128 elements (so to have a good resolution), 8 fuzzy sets that describe the term set, 32 levels of discretization for the membership values. Clearly, the number of bits necessary for the given specifications are 5 for 32 truth levels, 3 for 8 membership functions and 7 for 128 levels of resolution. The memory depth is given by the dimension of the universe of the discourse (128 in our case) and it will be represented by the memory rows. The length of a world of memory is defined by: Length = nem (dm(m)+dm(fm) Where: fm is the maximum number of non null values in every element of the universe of the discourse, dm(m) is the dimension of the values of the membership function m, dm(fm) is the dimension of the word to represent the index of the highest membership function. In our case then Length=24. The memory dimension is therefore 128*24 bits. If we had chosen to memorize all values of the membership functions we would have needed to memorize on each memory row the membership value of each element. Fuzzy sets word dimension is 8*5 bits. Therefore, the dimension of the memory would have been 128*40 bits. Coherently with our hypothesis, in fig. 1 each element of universe of the discourse has a non null membership value on at most three fuzzy sets. Focusing on the elements 32,64,96 of the universe of discourse, they will be memorized as follows: The computation of the rule weights is done by comparing those bits that represent the index of the membership function, with the word of the program memor . The output bus of the Program Memory (μCOD), is given as input a comparator (Combinatory Net). If the index is equal to the bus value then one of the non null weight derives from the rule and it is produced as output, otherwise the output is zero (fig. 2). It is clear, that the memory dimension of the antecedent is in this way reduced since only non null values are memorized. Moreover, the time performance of the system is equivalent to the performance of a system using vectorial memorization of all weights. The dimensioning of the word is influenced by some parameters of the input variable. The most important parameter is the maximum number membership functions (nfm) having a non null value in each element of the universe of discourse. From our study in the field of fuzzy system, we see that typically nfm 3 and there are at most 16 membership function. At any rate, such a value can be increased up to the physical dimensional limit of the antecedent memory. A less important role n the optimization process of the word dimension is played by the number of membership functions defined for each linguistic term. The table below shows the request word dimension as a function of such parameters and compares our proposed method with the method of vectorial memorization[10]. Summing up, the characteristics of our method are: Users are not restricted to membership functions with specific shapes. The number of the fuzzy sets and the resolution of the vertical axis have a very small influence in increasing memory space. Weight computations are done by combinatorial network and therefore the time performance of the system is equivalent to the one of the vectorial method. The number of non null membership values on any element of the universe of discourse is limited. Such a constraint is usually non very restrictive since many controllers obtain a good precision with only three non null weights. The method here briefly described has been adopted by our group in the design of an optimized version of the coprocessor described in [10].

  • PDF