A novel approach to predict shear strength of tilted angle connectors using artificial intelligence techniques

Shear connectors play a prominent role in the design of steel-concrete composite systems. The behavior of shear connectors is generally determined through conducting push-out tests. However, these tests are costly and require plenty of time. As an alternative approach, soft computing (SC) can be used to eliminate the need for conducting push-out tests. This study aims to investigate the application of artificial intelligence (AI) techniques, as sub-branches of SC methods, in the behavior prediction of an innovative type of C-shaped shear connectors, called Tilted Angle Connectors. For this purpose, several push-out tests are conducted on these connectors and the required data for the AI models are collected. Then, an adaptive neuro-fuzzy inference system (ANFIS) is developed to identify the most influencing parameters on the shear strength of the tilted angle connectors. Totally, six different models are created based on the ANFIS results. Finally, AI techniques such as an artificial neural network (ANN), an extreme learning machine (ELM), and another ANFIS are employed to predict the shear strength of the connectors in each of the six models. The results of the paper show that slip is the most influential factor in the shear strength of tilted connectors and after that, the inclination angle is the most effective one. Moreover, it is deducted that considering only four parameters in the predictive models is enough to have a very accurate prediction. It is also demonstrated that ELM needs less time and it can reach slightly better performance indices than those of ANN and ANFIS.

     

Application of genetic algorithm-based intuitionistic fuzzy weighted c-ordered-means algorithm to cluster analysis

Knowledge and Information Systems - With the advance of information technology, many fields have begun using data clustering to reveal data structures and obtain useful information. Most of the...     

Scheduling Optimization Modelling: A Case Study of a Woven Label Manufacturing Company

Production scheduling involves all activities of building production schedules, including coordinating and assigning activities to each person, group of people, or machine and arranging work orders in each workplace. Production scheduling must solve all problems such as minimizing customer wait time, storage costs, and production time; and effectively using the enterprise’s human resources. This paper studies the application of flexible job shop modelling on scheduling a woven labelling process. The labelling process includes several steps which are handled in different work-stations. Each workstation is also comprised of several identical parallel machines. In this study, job splitting is allowed so that the power of work stations can be utilized better. The final objective is to minimize the total completion time of all jobs. The results show a significant improvement since the new planning may save more than 60% of lead time compared to the current schedule. The contribution of this research is to propose a flexible job shop model for scheduling a woven labelling process. The proposed approach can also be applied to support complex production scheduling processes under fuzzy environments in different industries. A practical case study demonstrates the effectiveness of the proposed model.     

Energy efficiency in cloud computing based on mixture power spectral density prediction

Due to the budget and environmental issues, adaptive energy efficiency receives a lot of attention these days, especially for cloud computing. In the previous research, we developed a combined methodology based on nonparametric prediction and convex optimization to produce proactive energy efficiency-oriented solution. In this work, the predictive analysis was further enhanced by deriving the mixture power spectral density to model the complex cloud monitoring statistics. By engaging the improved technique to the predictive analysis, the prediction process was more adaptive to handle the fluctuation in system utilization. As a consequence, the optimization process could subsequently produce more appropriate setting for energy savings. After the infrastructure setting has been made available, the instruction of virtual machine migration was created and implemented by the cloud orchestrator. This instruction condensed the services into the pool of active facilities, satisfying the objective of power efficiency. Eventually, any physical machine out of the power configuration would be gradually terminated. Compared to our former method, the effectiveness of the proposed technique has been proven by cutting down 4.92% of energy consumption, while still maintaining a similar quality of services.

     

Deep neural network-based fusion model for emotion recognition using visual data

The Journal of Supercomputing - In this study, we present a fusion model for emotion recognition based on visual data. The proposed model uses video information as its input and generates emotion...     

Environmental-aware virtual data center network

Cloud computing services have recently become a ubiquitous service delivery model, covering a wide range of applications from personal file sharing to being an enterprise data warehouse. Building green data center networks providing cloud computing services is an emerging trend in the Information and Communication Technology (ICT) industry, because of Global Warming and the potential GHG emissions resulting from cloud services. As one of the first worldwide initiatives provisioning ICT services entirely based on renewable energy such as solar, wind and hydroelectricity across Canada and around the world, the GreenStar Network (GSN) was developed to dynamically transport user services to be processed in data centers built in proximity to green energy sources, reducing Greenhouse Gas (GHG) emissions of ICT equipments. Regarding the current approach, which focuses mainly in reducing energy consumption at the micro-level through energy efficiency improvements, the overall energy consumption will eventually increase due to the growing demand from new services and users, resulting in an increase in GHG emissions. Based on the cooperation between Mantychore FP7 and the GSN, our approach is, therefore, much broader and more appropriate because it focuses on GHG emission reductions at the macro-level. This article presents some outcomes of our implementation of such a network model, which spans multiple green nodes in Canada, Europe and the USA. The network provides cloud computing services based on dynamic provision of network slices through relocation of virtual data centers.     

Bead-based polymerase chain reaction on a microchip

We present a bead-based approach to microfluidic polymerase chain reaction (PCR), enabling fluorescent detection and sample conditioning in a single microchamber. Bead-based PCR, while not extensively investigated in microchip format, has been used in a variety of bioanalytical applications in recent years. We leverage the ability of bead-based PCR to accumulate fluorescent labels following DNA amplification to explore a novel DNA detection scheme on a microchip. The microchip uses an integrated microheater and temperature sensor for rapid control of thermal cycling temperatures, while the sample is held in a microchamber fabricated from (poly)dimethylsiloxane and coated with Parylene. The effects of key bead-based PCR parameters, including annealing temperature and concentration of microbeads in the reaction mixture, are studied to achieve optimized device sensitivity and detection time. The device is capable of detecting a synthetically prepared section of the Bordetella pertussis genome in as few as 10 temperature cycles with times as short as 15?min. We then demonstrate the use of the procedure in an integrated device; capturing, amplifying, detecting, and purifying template DNA in a single microfluidic chamber. These results show that this method is an effective method of DNA detection which is easily integrated in a microfluidic device to perform additional steps such as sample pre-conditioning.     

Fluctuating NMDA Receptor Subunit Levels in Perirhinal Cortex Relate to Their Dynamic Roles in Object Memory Destabilization and Reconsolidation

Reminder cues can destabilize consolidated memories, rendering them modifiable before they return to a stable state through the process of reconsolidation. Older and stronger memories resist this process and require the presentation of reminders along with salient novel information in order to destabilize. Previously, we demonstrated in rats that novelty-induced object memory destabilization requires acetylcholine (ACh) activity at M₁ muscarinic receptors. Other research predominantly has focused on glutamate, which modulates fear memory destabilization and reconsolidation through GluN2B- and GluN2A-containing NMDARs, respectively. In the current study, we demonstrate the same dissociable roles of GluN2B- and N2A-containing NMDARs in perirhinal cortex (PRh) for object memory destabilization and reconsolidation when boundary conditions are absent. However, neither GluN2 receptor subtype was required for novelty-induced destabilization of remote, resistant memories. Furthermore, GluN2B and GluN2A subunit proteins were upregulated selectively in PRh 24 h after learning, but returned to baseline by 48 h, suggesting that NMDARs, unlike muscarinic receptors, have only a temporary role in object memory destabilization. Indeed, activation of M₁ receptors in PRh at the time of reactivation effectively destabilized remote memories despite inhibition of GluN2B-containing NMDARs. These findings suggest that cholinergic activity at M₁ receptors overrides boundary conditions to destabilize resistant memories when other established mechanisms are insufficient.     

A unified method for optimal arbitrary pole placement

We consider the classic problem of pole placement by state feedback. We offer an eigenstructure assignment algorithm to obtain a novel parametric form for the pole-placing feedback matrix that can deliver any set of desired closed-loop eigenvalues, with any desired multiplicities. This parametric formula is then exploited to introduce an unconstrained nonlinear optimisation algorithm to obtain a feedback matrix that delivers the desired pole placement with optimal robustness and minimum gain. Lastly we compare the performance of our method against several others from the recent literature.     

Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks

The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object as their nearest neighbour. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organisation, fault-tolerance and load-balancing. In this study, we propose and evaluate 3 distinct P2P algorithms focusing on bichromatic RNN queries, in which mobile query peers and static objects of interest are of two different categories, based on a time-out mechanism and a boundary polygon around the mobile query peers. The Brute-Force Search Algorithm provides a naive approach to exploit shared information among peers whereas two other Boundary Search Algorithms filter a number of peers involved in query processing. The algorithms are evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving bichromatic RNN queries for mobile networks.