Electro-copolymerisation of indene and styrene

Electroinitiated cationic copolymerisation of indene and styrene was investigated by constant potential electrolysis. Effects of copolymerisation potential and temperature on the copolymer composition and the reactivity ratios are discussed. The reactivity ratios of the monomers were calculated according to the integrated Lewis-Mayo equation.     

Application du recuit simulé à la synthèse d’antennes en réseau constituées d’éléments annulaires imprimés

This publication consists of an analysis and a synthesis by the amplitude law of linear and planar ring printed antennas array. The analysis of the structure is based on the modified cavity model which allows taking into account the fringing fields effects. The synthesis problem is solved by the simulated annealing method based on a random process research controlled by temperature parameter. The feeding network amplitude permitting to produce an optimal radiation pattern is then given. Various synthesis results for linear and planar arrays are presented.     

Morphological evolution of edge-hillocks on single-crystal films having anisotropic drift-diffusion under the capillary and electromigration forces

The morphological evolution of hillocks at the unpassivated sidewalls of single-crystal metallic thin film interconnects is investigated via computer simulations using the free-moving boundary value problem. The effect of drift-diffusion anisotropy on the development of surface topographical scenarios is fully explored under the action of electromigration and capillary forces, utilizing numerous combinations of the surface texture, the drift-diffusion anisotropy and the direction of the applied electric field. The simulation studies yield analytical relationships for the velocity of the surface solitary waves and the drift velocity of electromigration-induced internal voids as a function of the applied current densities, which contain intrinsic and structural properties of the single-crystal thin films. The threshold value of the applied current density, above which electromigration-induced internal voids can be formed and may cause the catastrophic failure of interconnects by breaching, also appears explicitly in this relationship.     

Fuzzy rule interpolation for multidimensional input spaces in determining d50c of hydrocyclones

Fuzzy rule-based systems have been very popular in many engineering applications. In mineral engineering, fuzzy rules are normally constructed using some fuzzy rule extraction techniques to establish the determination model in predicting the d50c of hydrocyclones. However, when generating fuzzy rules from the available information, it may result in a sparse fuzzy rule base. The use of more than one input variable is also common in hydrocyclone data analysis. This paper examines the application of fuzzy interpolation to resolve the problems using sparse fuzzy rule bases, and to perform analysis of fuzzy interpolation in multidimensional input spaces.     

A new deep intuitionistic fuzzy time series forecasting method based on long short-term memory

The Journal of Supercomputing - In recent years, deep artificial neural networks can have better forecasting performance than many other artificial neural networks. The long short-term memory...     

Visual reasoning about social networks using centrality sensitivity

In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance of a node in a network, its sensitivity represents the importance of the relationship between this and all other nodes in the network. We have derived an analytical solution that extracts the sensitivity as the derivative of centrality with respect to degree for two centrality metrics based on feedback and random walks. We show that these sensitivities are good indicators of the distribution of centrality in the network, and how changes are expected to be propagated if we introduce changes to the network. These metrics also help us simplify a complex network in a way that retains the main structural properties and that results in trustworthy, readable diagrams. Sensitivity is also a key concept for uncertainty analysis of social networks, and we show how our approach may help analysts gain insight on the robustness of key network metrics. Through a number of examples, we illustrate the need for measuring sensitivity, and the impact it has on the visualization of and interaction with social and other scale-free networks.     

A modified genetic algorithm for forecasting fuzzy time series

Fuzzy time series approaches are used when observations of time series contain uncertainty. Moreover, these approaches do not require the assumptions needed for traditional time series approaches. Generally, fuzzy time series methods consist of three stages, namely, fuzzification, determination of fuzzy relations, and defuzzification. Artificial intelligence algorithms are frequently used in these stages with genetic algorithms being the most popular of these algorithms owing to their rich operators and good performance. However, the mutation operator of a GA may cause some negative results in the solution set. Thus, we propose a modified genetic algorithm to find optimal interval lengths and control the effects of the mutation operator. The results of applying our new approach to real datasets show superior forecasting performance when compared with those obtained by other techniques.     

The Training of Pi-Sigma Artificial Neural Networks with Differential Evolution Algorithm for Forecasting

Computational Economics - Looking at the artificial neural networks’ literature, most of the studies started with feedforward artificial neural networks and the training of many feedforward...     

Coverage-guided test generation for continuous and hybrid systems

In this paper, we describe a formal framework for conformance testing of continuous and hybrid systems, using the international standard ‘Formal Methods in Conformance Testing’ FMCT. We propose a novel test coverage measure for these systems, which is defined using the star discrepancy notion. This coverage measure is used to quantify the validation ‘completeness’. It is also used to guide input stimulus generation by identifying the portions of the system behaviors that are not adequately examined. We then propose a test generation method, which is based on a robotic motion planning algorithm and is guided by the coverage measure. This method was implemented in a prototype tool that can handle high dimensional systems (up to 100 dimensions).     

On basic properties of fault-tolerant multi-topology routing

Multi-topology routing has recently gained popularity as a simple yet efficient traffic engineering concept. Its basic purpose is to separate different classes of network traffic, which are then transported over disjoint logical topologies. Multi-topology routing is used as a basis for implementation of an IP fast reroute scheme called Multiple Routing Configurations (MRC).MRC has a range of attractive properties, but they do come at a cost. In order to guarantee recovery from any single link or node failure in the network, MRC has to maintain several logical topologies and thus an increased amount of routing information. The number of the logical topologies in MRC need not be large; even simple heuristic algorithms often yield good results in practice. However, why this is the case is not fully understood yet.In this paper, we introduce a theoretical framework for fault-tolerant multi-topology routing (FT-MTR). MRC is a practical implementation of FT-MTR in connectionless IP networks. We use FT-MTR to study how the internal topological structure of the communication network relates to two important problems. The first problem is minimizing the number of logical topologies and thus the routing state in FT-MTR. We show how to use the sets of nodes that separate the topology graph to devise an advanced heuristic for “intelligent” construction of the logical topologies. Finding the separating sets in a topology graph is computationally demanding; we present an algorithm that performs well in tested real network topologies. We evaluate the separation-set based heuristic for the logical topology construction and show that it outperforms the known MRC heuristics.The second problem is the FT-MTR load distribution after a failure. We use the separating sets to devise a novel algorithm for failure load distribution. This algorithm does not require knowledge of the traffic demand matrix, still, our tests indicate that it performs as good as, or better than, known MRC load-distribution algorithms that do require the demand matrix as input.