Characterizations of friction welding joint interface for AISI 316

Because of heat amount is different from peripheral to central of friction welding interface, which is leaded to vary the characterizations along that interface. Current study, respectively, focused on the effect of different friction pressure on micro-structural and mechanical properties of that friction welding joint interface. Presently, these friction pressures are 110, 130, 150 and 170 MPa while kept all other conditions constant. The effects of different friction pressure on welding interface characterization were investigated by EDX, SEM, tensile, compression, impact and hardness tests. The tensile tests carried out on the standardized test piece with diameter 6 mm and 8 mm, thus, compression tests were extracted from the positions of 0°, 45° 90° with test specimen of 4 mm diameter and 6.5 mm length at weld center. Whereas, the impact test pieces were picked up in two positions, the first one is symmetrical, which it obtained to the respect of the rotation axis and the interface, on the other hand, the second one is non-symmetrical with the axis of rotation and symmetrical to the interface, for making the notch head coincide with the center of the welded joint, The obtained results showed that with reducing of friction pressure will present lack of bonding increasing from peripheral toward the welding center, which will responsible on reducing of the mechanical properties such as tensile, compression and impact strength.     

A 3D unsplit-advection volume tracking algorithm with planarity-preserving interface reconstruction

A new volume tracking method is introduced for tracking interfaces in three-dimensional (3D) geometries partitioned with orthogonal hexahedra. The method approximates interface geometries as piecewise planar, and advects volumes in a single unsplit step using fully multidimensional fluxes that have their definition based in backward-trajectory remapping. By using multidimensional unsplit advection, the expense of high-order interface reconstruction is incurred only once per timestep. Simple departures from strict backward-trajectory remapping remove any need for consideration of volume computations involving shapes consisting of non-planar ruled surfaces. Second-order accuracy of the method is demonstrated even for vigorous 3D deformations.     

Gripper Design for Radio Base Station Autonomous Maintenance System

For an autonomous system to perform maintenance tasks in a networking device or a radio base station (RBS), it has to deal with a series of technological challenges ranging from identifying hardware-related problems to manipulating connectors. This paper describes the development of a robot maintenance system dedicated to detect and resolve faulty links caused by unplugged or poorly connected cables. Although the maintenance system relies on four subsystems, we significantly focus on our low-cost and efficient custom gripper solution developed to handle RJ45 Ethernet connectors. To examine our gripper, we conducted three experiments. First, a qualitative questionnaire was submitted to 30 users in the case of the teleoperated scenario of the gripper attached to a robotic arm. Similarly, we also tested the automatic operation mode. The results showed that our system is reliable and delivers a highly efficient maintenance tool in both teleoperated and autonomous operation modes. The practical experiment containing the removal or unplugging of connectors demonstrated our gripper’s ability to adequately handle these, whereas the feedback from the questionnaire pointed to a positive user experience. The automatic test assessed the gripper’s robustness against the continuous operation.

     

Structural hidden Markov models for biometrics: Fusion of face and fingerprint

The goal of this paper is threefold: (i) propose a novel face and fingerprint feature modeling using the structural hidden Markov models (SHMMs) paradigm, (ii) explore the use of some feature extraction techniques such as ridgelet transform, discrete wavelet transform with various classifiers for biometric identification, and (iii) determine the best method for classifier combination. The experimental results reported in both fingerprint and face recognition reveal that the SHMMs concept is promising since it has outperformed several state-of-the-arts classifiers when combined with the discrete wavelet transform. Besides, this study has shown that the ridgelet transform without principal components analysis (PCA) dimension reduction fits better with the support vector machines (SVMs) classifier than it does with the SHMMs in the fingerprint recognition task. Finally, these results also reveal a small improvement of the bimodal biometric system over unimodal systems; which suggest that a most effective fusion scheme is necessary.     

SPIDER: An availability-aware framework for the service function chain placement in distributed scenarios

The network function virtualization (NFV) paradigm replaces hardware-dependent network functions by virtual network functions (VNFs) that can be deployed in commodity hardware, including legacy servers. Consequently, the use of NFV is expected to reduce operating and capital expenses, as well as improve service deployment operation and management flexibility. For many use cases, the VNFs must be visited and invoked following a specific order of execution in order to compose a complete network service, named service function chain (SFC). Nonetheless, despite the benefits from NFV and SFC virtualization technologies, their introduction must not harm network performance and service availability. On the one hand, redundancy is seen by network service planners as a mechanism well established to combat availability issues. At same time, there is a goal to optimize resource utilization in order to reduce operational expenditure. In this article, we share our experience in the design use of a framework, named SPIDER, focused on SFC placement that considers the network infrastructure condition and the required SFC availability to define the placement strategy. The SPIDER monitors the status of infrastructure nodes and links and defines which servers the VNFs should be placed on and the number of redundant replicas needed. We present a proof-of-concept of SPIDER using Kubernetes to launch the VNFs as containers. We also use Kubernetes to forward the traffic between the VNFs, composing the service chain. We perform experiments to evaluate the runtime of SPIDER and the SFC delay under different network conditions.     

Embedding HMMs-based models in a Euclidean space: the topological hidden Markov models

Current extensions of hidden Markov models such as structural, hierarchical, coupled, and others have the power to classify complex and highly organized patterns. However, one of their major limitations is the inability to cope with topology: When applied to a visible observation (VO) sequence, the traditional HMM-based techniques have difficulty predicting the n-dimensional shape formed by the symbols of the VO sequence. To fulfill this need, we propose a novel paradigm named “topological hidden Markov models” (THMMs) that classifies VO sequences by embedding the nodes of an HMM state transition graph in a Euclidean space. This is achieved by modeling the noise embedded in the shape generated by the VO sequence. We cover the first and second level topological HMMs. We describe five basic problems that are assigned to a second level topological hidden Markov model: (1) sequence probability evaluation, (2) statistical decoding, (3) structural decoding, (4) topological decoding, and (5) learning. To show the significance of this research, we have applied the concept of THMMs to: (i) predict the ASCII class assigned to a handwritten numeral, and (ii) map protein primary structures to their 3D folds. The results show that the second level THMMs outperform the SHMMs and the multi-class SVM classifiers significantly.     

Integrating customer's preferences in the QFD planning process using a combined benchmarking and imprecise goal programming model

Quality function deployment (QFD) is a customer-oriented design tool for developing new or improved products to achieve higher customer satisfaction by integrating various functions of an organization. The engineering characteristics (ECs) affecting the product performances are designed to match the customer attributes (CAs). However, from the viewpoint of the QFD team, product design processes are performed in imprecise environments, and more than one factor must be taken into account in determining the target levels of ECs, especially the limited resources and increased market competition. This paper presents an imprecise goal programming (GP) approach to determine the optimum target levels of ECs in QFD for maximizing customer satisfaction under resource limitation and considerations of market competition. Based on benchmarking data of CAs, the concept of satisfaction functions is utilized to formulate explicitly the customer's preferences and to integrate the competitive analysis of target market into the modelling and solution process. In addition, the relationships linking CAs and ECs and the ECs to each other are integrated by functional relationships. The proposed approach will be illustrated through a car door design example.     

Traffic analysis and synthetic models of second life

Virtual Worlds (VW), such as Massive Multiplayer Online Social Games, have been gaining increasing attention in the last few years, mainly due to the new way users interact with them. However, little effort has been devoted to understand their traffic profile and the implications to the traffic management area. With the current growing rate of VWs’ usage, their traffic demand could eventually impose a significant burden on the operation of a typical Internet Service Provider (ISP) network. In this paper, we seek to understand the traffic behavior of an increasingly popular VW application, namely Second Life (SL), from both the connection and network level perspectives. We also show results of a traffic analysis of a SL client, when an avatar performs different actions in the VW, at different places and under different network conditions. Our results show that SL makes intensive use of network resources (mostly bandwidth), since the capacity needed for having a full SL experience (listening to live music) may reach 500 kbps. We then extend the traffic analysis work on SL by providing analytical models for its traffic profile. We aim at helping the network management and planning area to estimate the impact of an intense use of such VW on access links or core networks. Such synthetic models are also useful to the networking research community for the use in network simulations.     

Supervisory control based on minimal cuts and Petri net sub-controllers coordination

This paper addresses the synthesis of Petri net (PN) controller for the forbidden state transition problem with a new utilisation of the theory of regions. Moreover, as any method of control synthesis based on a reachability graph, the theory of regions suffers from the combinatorial explosion problem. The proposed work minimises the number of equations in the linear system of theory of regions and therefore one can reduce the computation time. In this paper, two different approaches are proposed to select minimal cuts in the reachability graph in order to synthesise a PN controller. Thanks to a switch from one cut to another, one can activate and deactivate the corresponding?PNcontroller. An application is implemented in a flexible manufacturing system to illustrate the present method. Finally, comparison with previous works with experimental results in obtaining a maximally permissive controller is presented.