ALBERT

Description: We propose and show efficiency of a new fuzzy-transform-based numerical method of solving ordinary differential equations with boundary conditions. The focus is on weak solutions and a special construction of a two-parameterized family of test functions. On theoretical and computational levels, we show how the proposed technique relates to and outperforms the Ritz–Galerkin method. We emphasize the importance of the proposed technique by considering its application to a real-life problem—the option pricing policy.

Description: A fluent economical collaboration between countries is a major need. European flows of trade and people are supported by efficient connections between main localities from a geographic region, in many cases overriding national borders. This paper introduces three traveling salesmen problem instances based on freely available geographic coordinates of the main cities of France, Portugal and Spain. These instances are unified, generating other four larger instances: three with all pairs of countries and one instance with the settlements from all the three countries. The study includes an analysis of quality of solutions for a version of branch & cut algorithm and some hybrid heuristics including the Lin–Kernighan algorithm. $Bormathring{u}vka$, Quick$Bormathring{u}vka$ and Greedy algorithms are also used in the hybrid approaches in order to obtain a potential beneficent initial solution for the Lin–Kernighan algorithm. Concorde solver, nowadays state-of-the-art exact software, together with the already mentioned algorithms, is used to test and furthermore analyze the new TSP instances. Some results are represented using online services such as Google Maps, showing the potential integration of the Concorde’s optimum results into commercial routing applications. The very good results provided by the Lin–Kernighan method allow its usage for real medium-sized routing instances.

Description: Specifically tailored industrial control systems (ICSs) attacks are becoming increasingly sophisticated, accentuating the need of ICS cyber security. The nature of these systems makes traditional IT security measures not suitable, requiring expressly developed security countermeasures. Within the past decades, research has been focused in network-based intrusion detection systems. With the appearance of software-defined networks (SDNs), new opportunities and challenges have shown up in the research community. This paper describes the potential benefits of using SDNs in industrial networks with security purposes and presents the set up and results of a pilot experiment carried out in a scaled physical implementation. The experimental set up consists in the detection of ICMP flood and packet payload alteration based on signature comparison. Results point to the potential viability of the technology for intrusion detection and the need of researching in architectural scalability.

Description: The starting point is Peano’s expression of the axiomatics of natural numbers in the framework of Leśniewski’s elementary ontology. The author enriches elementary ontology with the so-called Frege’s predication scheme and goes on to propose the formulations of this axiomatic, in which the original natural number (N) term is replaced by the term Anzahl (A). The functor of the successor (S) is defined in it.

Description: Stirling’s method is considered as an alternative to Newton’s method when the latter fails to converge to a solution of a nonlinear equation. Both methods converge quadratically under similar convergence criteria and require the same computational effort. However, Stirling’s method has shortcomings too. In particular, contractive conditions are assumed to show convergence. However, these conditions limit its applicability. The novelty of our paper lies in the fact that our convergence criteria do not require contractive conditions. Hence, we extend its applicability of Stirling’s method. Numerical examples illustrate our new findings.

Description: A complex fuzzy set is an extension of the fuzzy set, of which membership grades take complex values in the complex unit disk. We present two complex fuzzy power aggregation operators including complex fuzzy weighted power (CFWP) and complex fuzzy ordered weighted power (CFOWP) operators. We then study two geometric properties which include rotational invariance and reflectional invariance for these complex fuzzy aggregation operators. We also apply the new proposed aggregation operators to decision making and illustrate an example to show the validity of the new approach.

Description: With the rapid development in social media, single-modal emotion recognition is hard to satisfy the demands of the current emotional recognition system. Aiming to optimize the performance of the emotional recognition system, a multimodal emotion recognition model from speech and text was proposed in this paper. Considering the complementarity between different modes, CNN (convolutional neural network) and LSTM (long short-term memory) were combined in a form of binary channels to learn acoustic emotion features; meanwhile, an effective Bi-LSTM (bidirectional long short-term memory) network was resorted to capture the textual features. Furthermore, we applied a deep neural network to learn and classify the fusion features. The final emotional state was determined by the output of both speech and text emotion analysis. Finally, the multimodal fusion experiments were carried out to validate the proposed model on the IEMOCAP database. In comparison with the single modal, the overall recognition accuracy of text increased 6.70%, and that of speech emotion recognition soared 13.85%. Experimental results show that the recognition accuracy of our multimodal is higher than that of the single modal and outperforms other published multimodal models on the test datasets.

Description: This paper considers an urban transit network design problem (UTNDP) that deals with construction of an efficient set of transit routes and associated service frequencies on an existing road network. The UTNDP is an NP-hard problem, characterized by a huge search space, multiobjective nature, and multiple constraints in which the evaluation of candidate route sets can be both time consuming and challenging. This paper proposes a hybrid differential evolution with particle swarm optimization (DE-PSO) algorithm to solve the UTNDP, aiming to simultaneously optimize route configuration and service frequency with specific objectives in minimizing both the passengers’ and operators’ costs. Computational experiments are conducted based on the well-known benchmark data of Mandl’s Swiss network and a large dataset of the public transport system of Rivera City, Northern Uruguay. The computational results of the proposed hybrid algorithm improve over the benchmark obtained in most of the previous studies. From the perspective of multiobjective optimization, the proposed hybrid algorithm is able to produce a diverse set of nondominated solutions, given the passengers’ and operators’ costs are conflicting objectives.

Description: When the pumping operation of pumped storage unit suffers from power outage, the hydraulic transient poses a serious threat to the safe operation of the unit and its pressure pipeline system. For high-head pumped storage power station (PSPS), the water hammer pressure (WHP) and rotational speed rise ratio (RSRR) of each hydraulic unit will be increased during the pump outage condition. In order to limit the fluctuation of rotational speed and WHP in power-off condition, optimizing and choosing a reasonable guide vane closure scheme (GVCS) is an economic and efficient means to improve the dynamic characteristics of pumped storage unit. On the basis of the calculation model of the transition process of single tube-double unit type of a high-head PSPS, an optimization model of GVCS balancing WHP and RSRR objectives is established. Furthermore, the two-stage broken line and three-stage delayed GVCSs are applied to the pump outage condition, and the nondominated sorting genetic algorithm-II (NSGA-II) is introduced to calculate the optimal solution set under different water heads and different closure schemes. For four typical water heads, the multiobjective optimization results of the closure law show that the two-stage broken line law has a better Pareto front under high water head, while the three-stage delayed law has a better performance under low water head. Furthermore, through the results of transition process of typical schemes, the adaptability of GVCS and water head is analyzed. The method proposed in this paper can make the RSRR not more than −0.89, and the three-stage delayed law can even make the RSRR only −0.01. Methods of this paper provide a theoretical basis for optimum guide vane closure mode setting of PSPS.

Description: Structural damage identification (SDI) plays a major role in structural health monitoring (SHM), which has been demanded by researchers to better face the challenges in the aging civil engineering, such as bridge structure and building structure. Many methods have been developed for the application to the real structures, but there are still some difficulties which result in inaccurate, even false damage identification. As a variant of particle swarm optimization (PSO), bare bones particle swarm optimization (BBPSO) is a simple but very powerful optimization tool. However, it is easy to be trapped in the local optimal state like other PSO algorithms, especially in SDI problems. In order to improve its performance in SDI problems, this paper aims to propose a novel optimization algorithm which is named as bare bones particle swarm optimization with double jump (BBPSODJ) for finding a new solution to the SDI problem in SHM field. To begin with, after the introduction of sparse recovery theory, the mathematical model for SDI is established where an objective function based on l1 regularization is constructed. Secondly, according to the basic theory of the BBPSODJ, a double jump strategy based on the BBPSO is designed to enhance the dynamic of particles, and it is able to make a large change in particle searching scopes, which can improve the search behaviour of BBPSO and prevent the algorithm from being trapped into local minimum state. Thirdly, three optimization test functions and a numerical example are utilized to validate the optimization performance of BBPSO, traditional PSO, and genetic algorithm (GA) comparatively; it is obvious that the proposed BBPSODJ shows great self-adapting property and good performance in the optimization process by introducing the novel double jump strategy. Finally, in the laboratory, an experimental example of steel frame with 4 damage cases is implemented to further assess the damage identification capability of the BBPSODJ with l1 regularization. From the damage identification results, it can be seen that the proposed BBPSODJ algorithm, which is efficient and robust, has great potential in the field of SHM.