Solvent fractionation of hard palm stearin to increase the concentration of tripalmitoylglycerol and dipalmitoyl-stearoyl-glycerol as substrates for synthesis of human milk fat substitute

This research aimed to produce triacylglycerols fraction rich in palmitic acid (PA) at the sn-2 position from hard palm stearin (HPS) through acetone fractionation. Fractionations were done at HPS-to-acetone ratios of 1:3, 1:5 and 1:7 (w/v) and at temperatures of 25, 30 and 35 °C for 3 h. Triacylglycerols with PA at the sn-2 position, such as tripalmitoylglycerol (PPP) and dipalmitoyl-stearoyl-glycerol (PPS), were concentrated in the solid fraction, obtained after separation by filtration. The optimal fractionation conditions were at a HPS-to-acetone ratio of 1:5 (w/v) and 30 °C. The total PPP and PPS content was more than 91%, with a corresponding yield of more than 59%. Triacylglycerols obtained were composed of more than 91% PA in which 88% were at the sn-2 position. Conclusively, the solvent fractionation is a suited alternative method for the preparation of triacylglycerols used for the enzymatic synthesis of 1,3-dioleoyl-2-palmitoylglycerol which is the main triacylglycerol for human milk fat substitute.     

A globally convergent BFGS method for pseudo-monotone variational inequality problems

In this paper, we propose a globally convergent BFGS method to solve Variational Inequality Problems (VIPs). In fact, a globalization technique on the basis of the hyperplane projection method is applied to the BFGS method. The technique, which is independent of any merit function, is applicable for pseudo-monotone problems. The proposed method applies the BFGS direction and tries to reduce the distance of iterates to the solution set. This property, called Fejer monotonicity of iterates with respect to the solution set, is the basis of the convergence analysis. The method applied to pseudo-monotone VIP is globally convergent in the sense that subproblems always have unique solutions, and the sequence of iterates converges to a solution to the problem without any regularity assumption. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithm.     

Nano-sized carbon hollow spheres for abatement of ethylene

In this paper, the ethylene adsorption capacities of the nano-sized carbon hollow spheres (CNB) and active carbon (AC), the Pd (PdCl₂) impregnated CNB or AC (Pd/CNB, Pd/AC) and heat treatment under various conditions, were studied at different ethylene concentrations from 64 to 1060 ppm. The results indicated that AC had a good ethylene adsorption capacity at high ethylene concentration. Pd impregnation decreased the ethylene adsorption capacity of AC. Heat treatment and H₂ activation could increase the ethylene adsorption capacity, but also lowered than AC itself. CNB had lower ethylene adsorption capacity than AC, but heat treatment and H₂ activation could increase its ethylene adsorption capacity markedly. With activating condition from heat treatment in N₂ at 300 °C to activation in H₂/N₂ at 100 °C, to activation in H₂ at 200 °C, and to activation in H₂ at 300 °C, the ethylene adsorption capacity of Pd/CNB was increased regularly. At low ethylene concentration, viz., 64 ppm, the ethylene adsorption quantities (q _a) by Pd/CNB activated in H₂ at 200 or 300 °C were higher than any other adsorbents. So, activated in H₂ atmosphere at higher than 100 °C, Pd/CNB is particularly advantaged for adsorbing low concentration of ethylene. Amongst all the adsorbents used, Pd/CNB activated in H₂ atmosphere at 300 °C for 2 h has the highest ethylene adsorption capacity at lower concentration than 125 ppm. In addition, all the CNB, Pd/CNB, AC, and Pd/AC samples can be easily regenerated in airflow for more than 3 h.     

Feature Selection for Detecting ICMPv6-Based DDoS Attacks Using Binary Flower Pollination Algorithm

Internet Protocol version 6 (IPv6) is the latest version of IP that goal to host 3.4 × 10³⁸ unique IP addresses of devices in the network. IPv6 has introduced new features like Neighbour Discovery Protocol (NDP) and Address Auto-configuration Scheme. IPv6 needed several protocols like the Address Auto-configuration Scheme and Internet Control Message Protocol (ICMPv6). IPv6 is vulnerable to numerous attacks like Denial of Service (DoS) and Distributed Denial of Service (DDoS) which is one of the most dangerous attacks executed through ICMPv6 messages that impose security and financial implications. Therefore, an Intrusion Detection System (IDS) is a monitoring system of the security of a network that detects suspicious activities and deals with a massive amount of data comprised of repetitive and inappropriate features which affect the detection rate. A feature selection (FS) technique helps to reduce the computation time and complexity by selecting the optimum subset of features. This paper proposes a method for detecting DDoS flooding attacks (FA) based on ICMPv6 messages using a Binary Flower Pollination Algorithm (BFPA-FA). The proposed method (BFPA-FA) employs FS technology with a support vector machine (SVM) to identify the most relevant, influential features. Moreover, The ICMPv6-DDoS dataset was used to demonstrate the effectiveness of the proposed method through different attack scenarios. The results show that the proposed method BFPA-FA achieved the best accuracy rate (97.96%) for the ICMPv6 DDoS detection with a reduced number of features (9) to half the total (19) features. The proven proposed method BFPA-FA is effective in the ICMPv6 DDoS attacks via IDS.     

A new method for detecting various variants of GoF design patterns using conceptual signatures

Software design patterns are well-known solutions for solving commonly occurring problems in software design. Detecting design patterns used in the code can help to understand the structure and behavior of the software, evaluate the quality of the software, and trace important design decisions. To develop and maintain a software system, we need sufficient knowledge of design decisions and software implementation processes. However, the acquisition of knowledge related to design patterns used in complex software systems is a challenging, time-consuming, and costly task. Therefore, using a suitable method to detect the design patterns used in the code reduces software development and maintenance costs. In this paper, we proposed a new method based on conceptual signatures to improve the accuracy of design pattern detection. So we used the conceptual signatures based on the purpose of patterns to detect the patterns’ instances that conform to the standard structure of patterns, and cover more instances of patterns’ variants and implementation versions of the patterns and improve the accuracy of pattern detection. The proposed method is a specific process in two main phases. In the first phase, the conceptual signature and detection formula for each pattern is determined manually. Then in the second phase, each pattern in the code is detected in a semi-automatic process using the conceptual signature and pattern detection formula. To implement the proposed method, we focused on GoF design patterns and their variants. We evaluated the accuracy of our proposed method on five open-source projects, namely, Junit v3.7, JHotDraw v5.1, QuickUML 2001, JRefactory v2.6.24, and MapperXML v1.9.7. Also, we performed our experiments on a set of source codes containing the instances of GoF design patterns’ variants for a comprehensive and fair evaluation. The evaluation results indicate that the proposed method has improved the accuracy of design pattern detection in the code.