• Title/Summary/Keyword: Weighted sum

Search Result 489, Processing Time 0.023 seconds

Development of a disaster index for quantifying damages to wastewater treatment systems by natural disasters (하수처리시설의 자연 재해 영향 정량화 지수 개발 연구)

  • Park, Jungsu;Park, Jae-Hyeoung;Choi, June-Seok;Heo, Tae-Young
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.35 no.1
    • /
    • pp.53-61
    • /
    • 2021
  • The quantified analysis of damages to wastewater treatment plants by natural disasters is essential to maintain the stability of wastewater treatment systems. However, studies on the quantified analysis of natural disaster effects on wastewater treatment systems are very rare. In this study, a total disaster index (DI) was developed to quantify the various damages to wastewater treatment systems from natural disasters using two statistical methods (i.e., AHP: analytic hierarchy process and PCA: principal component analysis). Typhoons, heavy rain, and earthquakes are considered as three major natural disasters for the development of the DI. A total of 15 input variables from public open-source data (e.g., statistical yearbook of wastewater treatment system, meteorological data and financial status in local governments) were used for the development of a DI for 199 wastewater treatment plants in Korea. The total DI was calculated from the weighted sum of the disaster indices of the three natural disasters (i.e., TI for typhoon, RI for heavy rain, and EI for earthquake). The three disaster indices of each natural disaster were determined from four components, such as possibility of occurrence and expected damages. The relative weights of the four components to calculate the disaster indices (TI, RI and EI) for each of the three natural disasters were also determined from AHP. PCA was used to determine the relative weights of the input variables to calculate the four components. The relative weights of TI, RI and EI to calculate total DI were determined as 0.547, 0.306, and 0.147 respectively.

Weight Adjustment Scheme Based on Hop Count in Q-routing for Software Defined Networks-enabled Wireless Sensor Networks

  • Godfrey, Daniel;Jang, Jinsoo;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.1
    • /
    • pp.22-30
    • /
    • 2022
  • The reinforcement learning algorithm has proven its potential in solving sequential decision-making problems under uncertainties, such as finding paths to route data packets in wireless sensor networks. With reinforcement learning, the computation of the optimum path requires careful definition of the so-called reward function, which is defined as a linear function that aggregates multiple objective functions into a single objective to compute a numerical value (reward) to be maximized. In a typical defined linear reward function, the multiple objectives to be optimized are integrated in the form of a weighted sum with fixed weighting factors for all learning agents. This study proposes a reinforcement learning -based routing protocol for wireless sensor network, where different learning agents prioritize different objective goals by assigning weighting factors to the aggregated objectives of the reward function. We assign appropriate weighting factors to the objectives in the reward function of a sensor node according to its hop-count distance to the sink node. We expect this approach to enhance the effectiveness of multi-objective reinforcement learning for wireless sensor networks with a balanced trade-off among competing parameters. Furthermore, we propose SDN (Software Defined Networks) architecture with multiple controllers for constant network monitoring to allow learning agents to adapt according to the dynamics of the network conditions. Simulation results show that our proposed scheme enhances the performance of wireless sensor network under varied conditions, such as the node density and traffic intensity, with a good trade-off among competing performance metrics.

Time-aware Item-based Collaborative Filtering with Similarity Integration

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.7
    • /
    • pp.93-100
    • /
    • 2022
  • In the era of information overload on the Internet, the recommendation system, which is an indispensable function, is a service that recommends products that a user may prefer, and has been successfully provided in various commercial sites. Recently, studies to reflect the rating time of items to improve the performance of collaborative filtering, a representative recommendation technique, are active. The core idea of these studies is to generate the recommendation list by giving an exponentially lower weight to the items rated in the past. However, this has a disadvantage in that a time function is uniformly applied to all items without considering changes in users' preferences according to the characteristics of the items. In this study, we propose a time-aware collaborative filtering technique from a completely different point of view by developing a new similarity measure that integrates the change in similarity values between items over time into a weighted sum. As a result of the experiment, the prediction performance and recommendation performance of the proposed method were significantly superior to the existing representative time aware methods and traditional methods.

Minimizing the Maximum Weighted Membership of Interval Cover of Points (점들의 구간 커버에 대한 최대 가중치 맴버쉽 최소화)

  • Kim, Jae-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.10
    • /
    • pp.1531-1536
    • /
    • 2022
  • This paper considers a problem to find a set of intervals containing all the points for the given n points and m intervals on a line, This is a special case of the set cover problem, well known as an NP-hard problem. As optimization criteria of the problem, there are minimizing the number of intervals to cover the points, maximizing the number of points each of which is covered by exactly one interval, and so on. In this paper, the intervals have weights and the sum of weights of intervals to cover a point is defined as a membership of the point. We will study the problem to find an interval cover minimizing the maximum of memberships of points. Using the dynamic programming method, we provide an O(m2)-time algorithm to improve the time complexity O(nm log n) given in the previous work.

An R package UnifiedDoseFinding for continuous and ordinal outcomes in Phase I dose-finding trials

  • Pan, Haitao;Mu, Rongji;Hsu, Chia-Wei;Zhou, Shouhao
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.4
    • /
    • pp.421-439
    • /
    • 2022
  • Phase I dose-finding trials are essential in drug development. By finding the maximum tolerated dose (MTD) of a new drug or treatment, a Phase I trial establishes the recommended doses for later-phase testing. The primary toxicity endpoint of interest is often a binary variable, which describes an event of a patient who experiences dose-limiting toxicity. However, there is a growing interest in dose-finding studies regarding non-binary outcomes, defined by either the weighted sum of rates of various toxicity grades or a continuous outcome. Although several novel methods have been proposed in the literature, accessible software is still lacking to implement these methods. This study introduces a newly developed R package, UnifiedDoseFinding, which implements three phase I dose-finding methods with non-binary outcomes (Quasi- and Robust Quasi-CRM designs by Yuan et al. (2007) and Pan et al. (2014), gBOIN design by Mu et al. (2019), and by a method by Ivanova and Kim (2009)). For each of the methods, UnifiedDoseFinding provides corresponding functions that begin with next that determines the dose for the next cohort of patients, select, which selects the MTD defined by the non-binary toxicity endpoint when the trial is completed, and get oc, which obtains the operating characteristics. Three real examples are provided to help practitioners use these methods. The R package UnifiedDoseFinding, which is accessible in R CRAN, provides a user-friendly tool to facilitate the implementation of innovative dose-finding studies with nonbinary outcomes.

Developing the Customer Quality Satisfaction Index Using Online Reviews: Case Study of TV (리뷰를 활용한 고객 품질 만족도 지수 개발 : TV 사례연구)

  • Jiye, Shin;Heesoo, Kim;Jaiho, Lee;Hyoungwoo, Jeon;Jeongsik, Ahn;Sunghoon, Hwang
    • Journal of Korean Society for Quality Management
    • /
    • v.50 no.4
    • /
    • pp.863-876
    • /
    • 2022
  • Purpose: The purpose of this study is to propose the product quality satisfaction index based on multiple linear regression using customer reviews. Methods: The proposed framework is composed of four steps. First, we collect online reviews and divide it into insight phrases. The insight phrases are classified using product attribute dictionary and sentiment analysis is conducted. Second, the importance of attributes is calculated in consideration of both regression coefficient and frequency. Third, the positive rate is calculated concerning sentiment analysis result. Therefore, the quality satisfaction index is measured by the weighted sum of importance and positive rate in the last step. Results: We conduct a case study using 2-years(2020, 2021) of Samsung TV reviews to confirm the effectiveness of the proposed methodology. As a result, we found that Picture quality is the most crucial attribute in TV evaluation. The importance of Gaming and content has grown up as the positive rate has also increased. Therefore, the overall satisfaction of TV has increased in 2021 compared to 2020. Conclusion: The result of this study shows that the proposed index reveals the customer's mind efficiently and can be explained by the importance and positive rate of each attribute. By using the proposed index, companies are able to improve and the priority of improvement can be determined.

Assessment of Collaborative Source-Side DDoS Attack Detection using Statistical Weight (통계적 가중치를 이용한 협력형 소스측 DDoS 공격 탐지 기법 성능 평가)

  • Yeom, Sungwoong;Kim, Kyungbaek
    • KNOM Review
    • /
    • v.23 no.1
    • /
    • pp.10-17
    • /
    • 2020
  • As the threat of Distributed Denial-of-Service attacks that exploit weakly secure IoT devices has spread, research on source-side Denial-of-Service attack detection is being activated to quickly detect the attack and the location of attacker. In addition, a collaborative source-side attack detection technique that shares detection results of source-side networks located at individual sites is also being activated to overcome regional limitations of source-side detection. In this paper, we evaluate the performance of a collaborative source-side DDoS attack detection using statistical weights. The statistical weight is calculated based on the detection rate and false positive rate corresponding to the time zone of the individual source-side network. By calculating weighted sum of the source-side DoS attack detection results from various sites, the proposed method determines whether a DDoS attack happens. As a result of the experiment based on actual DNS request to traffic, it was confirmed that the proposed technique reduces false positive rate 2% while maintaining a high attack detection rate.

Study on Weight Summation Storage Algorithm of Facial Recognition Landmark (가중치 합산 기반 안면인식 특징점 저장 알고리즘 연구)

  • Jo, Seonguk;You, Youngkyon;Kwak, Kwangjin;Park, Jeong-Min
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.1
    • /
    • pp.163-170
    • /
    • 2022
  • This paper introduces a method of extracting facial features due to unrefined inputs in real life and improving the problem of not guaranteeing the ideal performance and speed of the object recognition model through a storage algorithm through weight summation. Many facial recognition processes ensure accuracy in ideal situations, but the problem of not being able to cope with numerous biases that can occur in real life is drawing attention, which may soon lead to serious problems in the face recognition process closely related to security. This paper presents a method of quickly and accurately recognizing faces in real time by comparing feature points extracted as input with a small number of feature points that are not overfit to multiple biases, using that various variables such as picture composition eventually take an average form.

Magnetic resonance imaging texture analysis for the evaluation of viable ovarian tissue in patients with ovarian endometriosis: a retrospective case-control study

  • Lee, Dayong;Lee, Hyun Jung
    • Journal of Yeungnam Medical Science
    • /
    • v.39 no.1
    • /
    • pp.24-30
    • /
    • 2022
  • Background: Texture analysis has been used as a method for quantifying image properties based on textural features. The aim of the present study was to evaluate the usefulness of magnetic resonance imaging (MRI) texture analysis for the evaluation of viable ovarian tissue on the perfusion map of ovarian endometriosis. Methods: To generate a normalized perfusion map, subtracted T1-weighted imaging (T1WI), T1WI and contrast-enhanced T1W1 with sequences were performed using the same parameters in 25 patients with surgically confirmed ovarian endometriosis. Integrated density is defined as the sum of the values of the pixels in the image or selection. We investigated the parameters for texture analysis in ovarian endometriosis, including angular second moment (ASM), contrast, correlation, inverse difference moment (IDM), and entropy, which is equivalent to the product of area and mean gray value. Results: The perfusion ratio and integrated density of normal ovary were 0.52±0.05 and 238.72±136.21, respectively. Compared with the normal ovary, the affected ovary showed significant differences in total size (p<0.001), fractional area ratio (p<0.001), and perfusion ratio (p=0.010) but no significant differences in perfused tissue area (p=0.158) and integrated density (p=0.112). In comparison of parameters for texture analysis between the ovary with endometriosis and the contralateral normal ovary, ASM (p=0.004), contrast (p=0.002), IDM (p<0.001), and entropy (p=0.028) showed significant differences. A linear regression analysis revealed that fractional area had significant correlations with ASM (r2=0.211), IDM (r2=0.332), and entropy (r2=0.289). Conclusion: MRI texture analysis could be useful for the evaluation of viable ovarian tissues in patients with ovarian endometriosis.

A Simulation-based Optimization for Scheduling in a Fab: Comparative Study on Different Sampling Methods (시뮬레이션 기반 반도체 포토공정 스케줄링을 위한 샘플링 대안 비교)

  • Hyunjung Yoon;Gwanguk Han;Bonggwon Kang;Soondo Hong
    • Journal of the Korea Society for Simulation
    • /
    • v.32 no.3
    • /
    • pp.67-74
    • /
    • 2023
  • A semiconductor fabrication facility(FAB) is one of the most capital-intensive and large-scale manufacturing systems which operate under complex and uncertain constraints through hundreds of fabrication steps. To improve fab performance with intuitive scheduling, practitioners have used weighted-sum scheduling. Since the determination of weights in the scheduling significantly affects fab performance, they often rely on simulation-based decision making for obtaining optimal weights. However, a large-scale and high-fidelity simulation generally is time-intensive to evaluate with an exhaustive search. In this study, we investigated three sampling methods (i.e., Optimal latin hypercube sampling(OLHS), Genetic algorithm(GA), and Decision tree based sequential search(DSS)) for the optimization. Our simulation experiments demonstrate that: (1) three methods outperform greedy heuristics in performance metrics; (2) GA and DSS can be promising tools to accelerate the decision-making process.