Discrete modeling of sand–tire mixture considering grain-scale deformability

Mixing sand or soil with small pieces of tire is common practice in civil engineering applications. Although the properties of the soil are changed, it is environmentally friendly and sometimes economical. Nevertheless, the mechanical behavior of such mixtures is still not fully understood and more numerical investigations are required. This paper presents a novel approach for the modeling of sand–tire mixtures based on the discrete element method. The sand grains are represented by rigid agglomerates whereas the tire grains are represented by deformable agglomerates. The approach considers both grain shape and deformability. The micromechanical parameters of the contact law are calibrated based on experimental results from the literature. The effects of tire content and confining pressure on the stress–strain response are investigated in detail by performing numerical triaxial compression tests. The main results indicate that both strength and stiffness of the samples decrease with increasing tire content. A tire contact of 40% is identified as the boundary between rubber-like and sand-like behavior.     

Classification of Electroencephalogram Signals Using LSTM and SVM Based on Fast Walsh-Hadamard Transform

Classification of electroencephalogram (EEG) signals for humans can be achieved via artificial intelligence (AI) techniques. Especially, the EEG signals associated with seizure epilepsy can be detected to distinguish between epileptic and non-epileptic regions. From this perspective, an automated AI technique with a digital processing method can be used to improve these signals. This paper proposes two classifiers: long short-term memory (LSTM) and support vector machine (SVM) for the classification of seizure and non-seizure EEG signals. These classifiers are applied to a public dataset, namely the University of Bonn, which consists of 2 classes –seizure and non-seizure. In addition, a fast Walsh-Hadamard Transform (FWHT) technique is implemented to analyze the EEG signals within the recurrence space of the brain. Thus, Hadamard coefficients of the EEG signals are obtained via the FWHT. Moreover, the FWHT is contributed to generate an efficient derivation of seizure EEG recordings from non-seizure EEG recordings. Also, a k-fold cross-validation technique is applied to validate the performance of the proposed classifiers. The LSTM classifier provides the best performance, with a testing accuracy of 99.00%. The training and testing loss rates for the LSTM are 0.0029 and 0.0602, respectively, while the weighted average precision, recall, and F1-score for the LSTM are 99.00%. The results of the SVM classifier in terms of accuracy, sensitivity, and specificity reached 91%, 93.52%, and 91.3%, respectively. The computational time consumed for the training of the LSTM and SVM is 2000 and 2500 s, respectively. The results show that the LSTM classifier provides better performance than SVM in the classification of EEG signals. Eventually, the proposed classifiers provide high classification accuracy compared to previously published classifiers.     

Efficient utilization of elliptic curve cryptosystem for hierarchical access control

The elliptic curve cryptosystem (ECC) has recently received significant attention by researchers due to its high performance, low computational cost, and small key size. In this paper, an efficient key management and derivation scheme based on ECC is proposed to solve dynamic access problems in a user hierarchy. Compared to previous ECC based works, the proposed method does not require constructing interpolate polynomials, therefore, the computational complexity of key generation and key derivation is significantly reduced. At the same time, time complexity of adding/deleting security classes, modifying their relationships, and changing of secret keys is decreased in the proposed method.     

Real time fractal image coder based on characteristic vector matching

Fractal coding algorithm has many applications including image compression. In this paper a classification scheme is presented which allows the hardware implementation of the fractal coder. High speed and low power consumption are the goal of the suggested design. The introduced method is based on binary classification of domain and range blocks. The proposed technique increases the processing speed and reduces the power consumption while the qualities of the reconstructed images are comparable with those of the available software techniques. In order to show the functionality of the proposed algorithm, the architecture was implemented on a FPGA chip. The application of the proposed hardware is shown in image compression. The resulted compression ratios, PSNR error, gate count, compression speed and power consumption are compared with the existing designs. Other applications of the proposed design are feasible in certain fields such as mass–volume database coding and also in video coder’s block matching schemes.     

Nonlinear ceramics for tunable microwave devices

The research on materials and systems for tunable microwave devices has gained attraction within the last years. The radio frequency characterization and the component design of tunable microwave components based on dielectric ceramics especially barium-strontium-titanate (BST) are presented in this second part, whereas the basic material properties are discussed in detail in the first part. After a short introduction to the processing technology used for the fabrication of tunable components based on a BST thick film, the relations between microwave properties and material properties as well as the microstructure are presented in detail. The design process for tunable microwave components based on BST thick films is described. Especially the considerations related to micro- and macrostructure and their connection are highlighted. The paper closes with two different application examples: a reconfigurable array antenna for satellite communication and varactors for high power applications.     

Semantic partitioning of peer-to-peer search space

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be conceived as an ontology-based distributed hash table (DHT). Also, we introduce a lookup service for the network which is very scalable and independent of the network size and just depends on depth of the ontology tree. Further, we introduce a broadcast algorithm on the network. We present worst case analysis of both lookup and broadcast algorithms and measure their performance using simulation. The results show that our scheme is highly scalable and can be used in real P2P applications.     

A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration

In this paper, we consider minimizing total weighted completion time criteria on a single machine. Jobs processing times are step function of its starting time and all jobs have a common due date. First, we present some new lemmas and dominance properties for this NP-hard problem, and then a memetic algorithm using these properties is developed. We compare the solutions of the memetic algorithm with optimal solutions obtained from complete enumeration. The results show that the average percentage error of the proposed algorithm from optimal solutions is about 2% and as the variance of processing time increase, the percentage errors decrease.     

Building extraction from high-resolution satellite images in urban areas: recent methods and strategies against significant challenges

Building extraction from high-resolution satellite images (HRSI) in urban areas is an intricate problem. Recent studies proposed different methods during 2005–2015. However, in HRSI, they have not investigated the effects of challenges altogether. This paper studies the effects of non-building features which are the main drawbacks in building extraction. To overcome each challenge, it reviews recent strategies between 2005 and 2015. The pros and cons of each strategy are discussed, and proper strategies are combined to generate hybrid methods. Lower cost and fewer strategies are efficient attributes to recognize the best hybrid methods. Hybrid methods can be useful for different case studies in the future.     

Structural Properties of Networked Control Systems With Bandwidth Limitations and Delays

The structural properties of networked control systems with both bandwidth limitations and delays are investigated. Sufficient conditions are given for controllability (stabilizability) and reconstructibility (detectability). Our results enhance previous works by capturing bandwidth limitations and delays simultaneously. The adopted modeling framework could be readily used in control and estimation methods, including optimal and predictive schemes. It also facilitates the use of scheduling optimization algorithms in conjunction with the control scheme presented.