35 research outputs found

    Advanced SOM & K Mean Method for Load Curve Clustering

    Get PDF
    From the load curve classification for one customer, the main features such as the seasonal factors, the weekday factors influencing on the electricity consumption may be extracted. By this way some utilities can make decision on the tariff by seasons or by day in week. The popular clustering techniques are the SOM & K-mean or Fuzzy K-mean. SOM &Kmean is a prominent approach for clustering with a two-level approach: first, the data set will be clustered using the SOM and in the second level, the SOM will be clustered by K-mean. In the first level, two training algorithms were examined: sequential and batch training. For the second level, the K-mean has the results that are strongly depended on the initial values of the centers. To overcome this, this paper used the subtractive clustering approach proposed by Chiu in 1994 to determine the centers. Because the effective radius in Chiu’s method has some influence on the number of centers, the paper applied the PSO technique to find the optimum radius. To valid the proposed approach, the test on well-known data samples is carried out. The applications for daily load curves of one Southern utility are presented

    Finding optimal reactive power dispatch solutions by using a novel improved stochastic fractal search optimization algorithm

    Get PDF
    In this paper, a novel improved Stochastic Fractal Search optimization algorithm (ISFSOA) is proposed for finding effective solutions of a complex optimal reactive power dispatch (ORPD) problem with consideration of all constraints in transmission power network. Three different objectives consisting of total power loss (TPL), total voltage deviation (TVD) and voltage stabilization enhancement index are independently optimized by running the proposed ISFSOA and standard Stochastic Fractal Search optimization algorithm (SFSOA). The potential search of the proposed ISFSOA can be highly improved since diffusion process of SFSOA is modified. Compared to SFSOA, the proposed method can explore large search zones and exploit local search zones effectively based on the comparison of solution quality. One standard IEEE 30-bus system with three study cases is employed for testing the proposed method and compared to other so far applied methods. For each study case, the proposed method together with SFSOA are run fifty run and three main results consisting of the best, mean and standard deviation fitness function are compared. The indication is that the proposed method can find more promising solutions for the three cases and its search ability is always more stable than those of SFSOA. The comparison with other methods also give the same evaluation that the proposed method can be superior to almost all compared methods. As a result, it can conclude that the proposed modification is really appropriate for SFSOA in dealing with ORPD problem and the method can be used for other engineering optimization problems

    Incorporating the core international labour standards on freedom of association and collective bargaining into Vietnam's legal system

    Get PDF
    This Dissertation evaluates the potential opportunities, challenges and outcomes attendant on Vietnam’s modernisation effort through the incorporation of International Labour Organisation (ILO) Core International Labour Standards (CILS) on freedom of association and collective bargaining into Vietnam law. The Dissertation shows that although Vietnam is likely to benefit from incorporating the CILS on freedom of association and collective bargaining into its legal system, its constitutional value system is not currently consistent with those of particular ILO CILS. It offers recommendations on pre- substantive and procedural measures necessary to ensure the successful reception of ILO CILS on freedom of association and collective bargaining into Vietnam legal practice.EThOS - Electronic Theses Online ServiceGovernment of VietnamGBUnited Kingdo

    On the Effectiveness of Adversarial Samples against Ensemble Learning-based Windows PE Malware Detectors

    Full text link
    Recently, there has been a growing focus and interest in applying machine learning (ML) to the field of cybersecurity, particularly in malware detection and prevention. Several research works on malware analysis have been proposed, offering promising results for both academic and practical applications. In these works, the use of Generative Adversarial Networks (GANs) or Reinforcement Learning (RL) can aid malware creators in crafting metamorphic malware that evades antivirus software. In this study, we propose a mutation system to counteract ensemble learning-based detectors by combining GANs and an RL model, overcoming the limitations of the MalGAN model. Our proposed FeaGAN model is built based on MalGAN by incorporating an RL model called the Deep Q-network anti-malware Engines Attacking Framework (DQEAF). The RL model addresses three key challenges in performing adversarial attacks on Windows Portable Executable malware, including format preservation, executability preservation, and maliciousness preservation. In the FeaGAN model, ensemble learning is utilized to enhance the malware detector's evasion ability, with the generated adversarial patterns. The experimental results demonstrate that 100\% of the selected mutant samples preserve the format of executable files, while certain successes in both executability preservation and maliciousness preservation are achieved, reaching a stable success rate

    TextANIMAR: Text-based 3D Animal Fine-Grained Retrieval

    Full text link
    3D object retrieval is an important yet challenging task, which has drawn more and more attention in recent years. While existing approaches have made strides in addressing this issue, they are often limited to restricted settings such as image and sketch queries, which are often unfriendly interactions for common users. In order to overcome these limitations, this paper presents a novel SHREC challenge track focusing on text-based fine-grained retrieval of 3D animal models. Unlike previous SHREC challenge tracks, the proposed task is considerably more challenging, requiring participants to develop innovative approaches to tackle the problem of text-based retrieval. Despite the increased difficulty, we believe that this task has the potential to drive useful applications in practice and facilitate more intuitive interactions with 3D objects. Five groups participated in our competition, submitting a total of 114 runs. While the results obtained in our competition are satisfactory, we note that the challenges presented by this task are far from being fully solved. As such, we provide insights into potential areas for future research and improvements. We believe that we can help push the boundaries of 3D object retrieval and facilitate more user-friendly interactions via vision-language technologies.Comment: arXiv admin note: text overlap with arXiv:2304.0573

    New Algorithm for Detecting Target on the Clutter Background Using Polarimetric Parameter

    No full text
    This paper proposes a new algorithm for detecting radar targets on the clutter background using a nonenergy polarimetry parameter, the ellipticity coefficient. The algorithm ultilises two-level threshold dectector (is used in this algorithm). Probability density function of ellipticity coefficient is calculated for two classes of target: target in clutter and only clutter. The optimum detection threshold is calculated based on the Neyman-Pearson criteria. In this paper, the detection threshold and the probability of detection are calculated based on a given false alarm, different signal to background clutter ratios, and with different polarimetric features of the background clutter. Proposed algorithm shows the efficiency of using ellipticity coefficient in detecting target on the background clutter

    Ocena zagroĆŒenia sejsmicznego dla kamienioƂomĂłw na rejonie Thuong Tan-Tan My (Wietnam)

    No full text
    This paper presents the seismic hazard assessment for Thuong Tan-Tan My quarries in Di An commune, Binh Duong province, Vietnam. Combination methods of gravity and magneto-telluric were used to estimate the dip angle and the width of the seismic source. The highest water column of 160 m will cause direct stress on the reservoir bottom with a maximum value of 1535.600 kPa and Coulomb stress of 68.693 kPa (at a depth of 2 km). The typical components of natural earthquake hazard (Mn.max = 5.0, depth of 10 km) in Thuong Tan - Tan My reservoir have the following values: peak ground acceleration PGA = 0.073 g Ă· 0.212 g; peak ground velocity PGV = 2.662 cm/s Ă· 7.984 cm/s; peak ground displacement PGD = 0.706 cm Ă· 1.918 cm at 10% probability of exceedance in 50 years. The typical components of triggered earthquake hazard (Mtr.max = 3.5, depth of 6 km) in Thuong Tan - Tan My reservoir have the following values: peak ground acceleration PGA = 0.024 g Ă· 0.172 g; peak ground velocity PGV = 0 Ă· 5.484 cm/s; peak ground displacement PGD = 0.061 cm Ă· 0.461 cm at 10% probability of exceedance in 50 years.W artykule przedstawiono ocenę zagroĆŒenia sejsmicznego dla kamienioƂomĂłw na rejonie Thuong Tan-Tan My w gminie Di An w prowincji Binh Duong, Wietnamie. Do oszacowania kąta upadu i szerokoƛci ĆșrĂłdƂa sejsmicznego wykorzystano kombinację metod grawitacyjnych i magneto-tellurycznych. NajwyĆŒszy sƂup wody 160 m spowoduje bezpoƛrednie naprÄ™ĆŒenia na dnie zbiornika o maksymalnej wartoƛci 1535,600 kPa i naprÄ™ĆŒeniu kulombowskim 68,693 kPa (na gƂębokoƛci 2 km). Typowe skƂadowe naturalnego zagroĆŒenia trzęsieniem ziemi (Mn.max = 5,0, gƂębokoƛć 10 km) w zbiorniku Thuong Tan-Tan My mają następujące wartoƛci: szczytowe przyspieszenie gruntu PGA = 0,073 g Ă· 0,212 g; szczytowa prędkoƛć gruntu PGV = 2,662 cm / s Ă· 7,984 cm / s; szczytowe przemieszczenie gruntu PGD = 0,706 cm Ă· 1,918 cm przy 10% prawdopodo-bieƄstwie przekroczenia za 50 lat. Typowe skƂadowe wywoƂanego zagroĆŒenia trzęsieniem ziemi (Mtr.max = 3,5, gƂębokoƛć 6 km) w zbiorniku Thuong Tan-Tan My mają następujące wartoƛci: szczytowe przyspieszenie ziemi PGA = 0,024 g Ă· 0,172 g; szczytowa prędkoƛć gruntu PGV = 0 Ă· 5,484 cm / s; szczytowe przemieszczenie ziemi PGD = 0,061 cm Ă· 0,461 cm przy 10% prawdopodobieƄstwie za 50 lat
    corecore