Search

Summary This is the second of a three-part series that charts the history of minimal access surgery from antiquity to current times. Although rapid developments in laparoscopic and robotic surgery have transformed surgical care over the last 30 years, our predecessors made significant advances in their time which set the principles for modern practice. Part I of this series described how ancient medical practitioners developed simple instruments, from metal or wood, for viewing body cavities. Improvements in the use of metal, glass and lighting allowed for inspection of deeper parts of the body. This second part of the series will show how advances in electrical technology allowed the development of improved lighting for endoscopy and laparoscopy along with the use of electrocautery for a wide range of therapeutic procedures.

We present a solution to egocentric 3D body pose estimation from monocular images captured from downward looking fish-eye cameras installed on the rim of a head mounted VR device. This unusual viewpoint leads to images with unique visual appearance, with severe self-occlusions and perspective distortions that result in drastic differences in resolution between lower and upper body. We propose an encoder-decoder architecture with a novel multi-branch decoder designed to account for the varying uncertainty in 2D predictions. The quantitative evaluation, on synthetic and real-world datasets, shows that our strategy leads to substantial improvements in accuracy over state of the art egocentric approaches. To tackle the lack of labelled data we also introduced a large photo-realistic synthetic dataset. xR-EgoPose offers high quality renderings of people with diverse skintones, body shapes and clothing, performing a range of actions. Our experiments show that the high variability in our new synthetic training corpus leads to good generalization to real world footage and to state of theart results on real world datasets with ground truth. Moreover, an evaluation on the Human3.6M benchmark shows that the performance of our method is on par with top performing approaches on the more classic problem of 3D human pose from a third person viewpoint., 14 pages. arXiv admin note: substantial text overlap with arXiv:1907.10045

In this paper, we propose to tackle egocentric action recognition by suppressing background distractors and enhancing action-relevant interactions. The existing approaches usually utilize two independent branches to recognize egocentric actions, i.e., a verb branch and a noun branch. However, the mechanism to suppress distracting objects and exploit local human-object correlations is missing. To this end, we introduce two extra sources of information, i.e., the candidate objects' spatial location and their discriminative features, to enable concentration on the occurring interactions. We design a Symbiotic Attention withObject-centric featureAlignmentframework (SAOA) to provide meticulous reasoning between the actor and the environment. First, we introduce an object-centric feature alignment method to inject the local object features to the verb branch and noun branch. Second, we propose a symbiotic attention mechanism to encourage the mutual interaction between the two branches and select the most action-relevant candidates for classification. The framework benefits from the communication among the verb branch, the noun branch, and the local object information. Experiments based on different backbones and modalities demonstrate the effectiveness of our method. Notably, our framework achieves the state-of-the-art on the largest egocentric video dataset.

We present JRDB, a novel egocentric dataset collected from our social mobile manipulator JackRabbot. The dataset includes 64 minutes of annotated multimodal sensor data including stereo cylindrical 360$^\circ$ RGB video at 15 fps, 3D point clouds from two Velodyne 16 Lidars, line 3D point clouds from two Sick Lidars, audio signal, RGB-D video at 30 fps, 360$^\circ$ spherical image from a fisheye camera and encoder values from the robot's wheels. Our dataset incorporates data from traditionally underrepresented scenes such as indoor environments and pedestrian areas, all from the ego-perspective of the robot, both stationary and navigating. The dataset has been annotated with over 2.3 million bounding boxes spread over 5 individual cameras and 1.8 million associated 3D cuboids around all people in the scenes totaling over 3500 time consistent trajectories. Together with our dataset and the annotations, we launch a benchmark and metrics for 2D and 3D person detection and tracking. With this dataset, which we plan on extending with further types of annotation in the future, we hope to provide a new source of data and a test-bench for research in the areas of egocentric robot vision, autonomous navigation, and all perceptual tasks around social robotics in human environments.

In this work, we consider transferring the structure information from large networks to compact ones for dense prediction tasks in computer vision. Previous knowledge distillation strategies used for dense prediction tasks often directly borrow the distillation scheme for image classification and perform knowledge distillation for each pixel separately, leading to sub-optimal performance. Here we propose to distill structured knowledge from large networks to compact networks, taking into account the fact that dense prediction is a structured prediction problem. Specifically, we study two structured distillation schemes: i) pair-wise distillation that distills the pair-wise similarities by building a static graph; and ii) holistic distillation that uses adversarial training to distill holistic knowledge. The effectiveness of our knowledge distillation approaches is demonstrated by experiments on three dense prediction tasks: semantic segmentation, depth estimation and object detection. Code is available at: https://git.io/StructKD, Comment: v1:10 pages cvpr2019 accepted; v2:15 pages for a journal version; Code is available at: https://github.com/irfanICMLL/structure_knowledge_distillation; fix typos

This paper studies the coordinated use of smart inverters with legacy voltage regulating devices to help increase the energy savings from conservation voltage reduction (CVR) in distribution systems with high photovoltaic penetration. Two voltage optimization algorithms are developed to evaluate the CVR benefit by considering two types of smart inverter functions: aggregated reactive power control and autonomous volt/VAR control. In each algorithm, smart inverters are coordinately controlled with the operation of legacy voltage regulating devices including load tap changers and capacitor banks. Both algorithms are tested on representative utility distribution system models. Simulation results demonstrate that the proposed algorithms can achieve around 1.8-3.6% energy savings when only using legacy voltage regulating devices and an additional 0.3-0.9% when adding smart inverters.

In this paper, a long-term workload management problem for multi-server edge computing with server collaboration is studied. In the considered model, mobile users computation-intensive tasks are generated dynamically over the time and offloaded to associated edge servers according to pre-determined subscription agreements. Upon receiving the subscribed workload, each edge server can then decide to whether participate in server collaboration for enabling workload re-allocation (i.e., workload exchange) with other heterogeneously configured edge servers. Unlike most of the existing work, this paper takes into account both competitions and collaborations among strategic edge servers in sharing their computing capacities. To achieve the equilibrium for each edge server in minimizing its expected cost (including energy consumption, delay, transmission, configuration and pricing costs), a joint optimization is formulated for determining i) its amount of workload to undertake, ii) compensation price charged from peers, and iii) computing speed to adopt. To efficiently solve this problem, we propose a novel cooperative queueing game approach, which integrates a convex optimization, a core cost sharing scheme and a mapping rule. Theoretical analyses and extensive simulations are conducted to evaluate the performance of the proposed solution, and demonstrate its superiority over counterparts.

Mobile Edge Computing (MEC) has emerged as a promising paradigm catering to overwhelming explosions of mobile applications, by offloading the compute-intensive tasks to an MEC network for processing. The surging of deep learning brings new vigor and vitality to shape the prospect of intelligent Internet of Things (IoT), and edge intelligence arises to provision real-time deep neural network (DNN) inference services for users. In this paper, we study a novel delay-aware DNN inference throughput maximization problem by accelerating each DNN inference through jointly exploring DNN partitioning and multi-thread parallelism. Specifically, we consider the problem under both offline and online request arrival settings: a set of DNN inference requests is given in advance, and a sequence of DNN inference requests arrives one by one without the knowledge of future arrivals, respectively. We first show that the defined problems are NP-hard. We then devise a novel constant approximation algorithm for the problem under the offline setting. We also propose an online algorithm with a provable competitive ratio for the problem under the online setting. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising.

The rise of the digital society is accompanied by incalculable social risks, but very little IS research has examined the implications of the new digital society. Drawing on concepts from Beck’s critical theory of the risk society and critical discourse analysis, this study examines the public discourse on risk events during the launch of NemID, a personal digital identifier for Danish citizens. This research illustrates our difficulties and challenges in managing some of the fundamental social risks from societal digitalisation. Limited institutional capabilities for digital technologies force public officials to depend on private companies motived by profit instead of the public interest. Beliefs in digital technology as the primary determinant of social and economic progress also present many public management dilemmas. When digital risk events occur and citizens’ fears are stoked by news media and public discourse, public officials seem to have no other strategy for managing the escalating fears than systematically distorted communication. The continued rise of the digital risk society demands that IS research respond to the challenge of generating knowledge for its public management.

The proliferation of enterprise social media generates an ever-growing record of digital traces that provides ample opportunities to study the social making of organisations. Subsequently, we present the social fabric framework, which comprises a structured five-step approach for eliciting, interpreting, and representing the situated social idiosyncrasies and underlying patterns of the social making of organisations. The paper focuses on the application of the social fabric framework as a research method. However, the framework also lends itself to practice as a diagnostic tool that can detect emergent changes in the social fabric of an organisation as well as support organisational development and change. Moreover, by providing a vocabulary for articulating the social making of organisations, the framework can help organisation members reify their dispositions, make sense of the social dynamics, and enable a constructive discussion at the grassroots level about any controversy or aspiration.

Social touch is essential to human development and communication. Mediated social touch is suggested as a solution for circumstances where distance prevents skin-to-skin contact. However, past research aimed at demonstrating efficacy of mediated touch in reducing stress and promoting helping have produced mixed findings. These inconsistent findings could possibly be due to insufficient control of contextual factors combined with unnatural interaction scenarios. For example, touch occurs less frequently among strangers and is often accompanied with nonverbal visual cues. We investigated how visual presentation of touch, and interpersonal relationship to the sender influence perception, affective experiences, and autonomic responses the touch evoke. Fifty couples of mixed gender were recruited. A mediated touch was repeatedly applied by either the male partner or male confederate to female participants. The latter witnessed through a webcam as the sender caressed a rubber hand or touchpad to send the touch. Following our hypotheses, touch sent by one's partner was perceived softer and more comforting than stranger touch. The partner's touch also resulted in weaker skin conductance responses, particularly when sent by touching a touchpad. In sum, how a mediated touch is experienced depends both on who is touching, and on how the touch is visually represented.

In this article, we investigate the problem of social link inference in a target location-aware social network (LSN), which aims at predicting the unobserved links between users within the network. This problem is critical for downstream applications, including network completion and friend recommendation. In addition to the network structures commonly used in general link prediction, the studies tailored for social link inference in an LSN leverage user trajectories from the spatial aspect. However, the temporal factor lying in user trajectories is largely overlooked by most of the prior studies, limiting the capabilities of capturing the temporal relevance between users. Moreover, effective user matching by fusing different views, i.e., social, spatial, and temporal factors, remains unresolved, which hinders the potential improvement of link inference. To this end, this article devises a novel multiview matching network (MVMN) by regarding each of the three factors as one view of any target user pair. MVMN enjoys the flexibility and completeness of modeling each factor by developing its suitable matching module: 1) location matching module; 2) time-series matching module; and 3) relation matching module. Each module learns a view-specific representation for matching, and MVMN fuses them for final link inference. Extensive experiments on two real-world data sets demonstrate the superiority of our approach against several competitive baselines for link prediction and sequence matching, validating the contribution of its key components.

The adaptive neurofuzzy inference system (ANFIS) is a structured multioutput learning machine that has been successfully adopted in learning problems without noise or outliers. However, it does not work well for learning problems with noise or outliers. High-accuracy real-time forecasting of traffic flow is extremely difficult due to the effect of noise or outliers from complex traffic conditions. In this study, a novel probabilistic learning system, probabilistic regularized extreme learning machine combined with ANFIS (probabilistic R-ELANFIS), is proposed to capture the correlations among traffic flow data and, thereby, improve the accuracy of traffic flow forecasting. The new learning system adopts a fantastic objective function that minimizes both the mean and the variance of the model bias. The results from an experiment based on real-world traffic flow data showed that, compared with some kernel-based approaches, neural network approaches, and conventional ANFIS learning systems, the proposed probabilistic R-ELANFIS achieves competitive performance in terms of forecasting ability and generalizability.

Introduction. To represent our national goods at the Western market it is necessary to ensure, first of all, the competitiveness of local products through complex mechanization of technological processes, labour costs reduction, increasing yields and quality of received products. The aim of the research is to provide the comparative analysis of technology and machines for potato harvesting, to determine the main factors that influence the agricultural technical indicators of harvesting equipment, to develop technological process patterns and to examine the strategies for improving the potato root-and-harvest machines. Methods and methodology. The research was carried out on the basis of technological and constructional analysis of technology and machines for potato harvesting. The methods of comparison and mathematical modelling of technological processes were used in the study. The research studies of Ukrainian and foreign scientists on technology and machines for potato harvesting were used as information base of our paper. Results. A comparative analysis of technology and machines for potato harvesting made it possible to determine the main factors that influence the agricultural performance of harvesting machinery and to develop the technological process for a digger, a double-loader digger and a harvester (harvesting machines). A theoretical model of the technological processes of harvesting machines includes both uncontrolled and controlled factors that influence the choice of a potato harvesting technology of a digger, a double-loader digger and a harvester. Nevertheless, the first factors are connected, primarily, with the conditions of potato growth and its biological properties, and the second factors deal with the organizational and technical measures, including the improvement of the working bodies of machines (cutting, dirt digging through, top separation, longitudinal hump with cut roller and other constructive and kinematic parameters), quality of received products, length and terms of potato storage, available farming human resources, free vehicle in the period of harvesting, farm potato storage, farm equipment for potato cleaning and sorting.

Exciting recent advances in genome sequencing, coupled with greatly reduced storage and computation costs, make genomic testing increasingly accessible to individuals. Already today, one’s digitized DNA can be easily obtained from a sequencing lab and later used to conduct numerous tests by engaging with a testing facility. Due to the inherent sensitivity of genetic material and the often-proprietary nature of genomic tests, privacy is a natural and crucial issue. While genomic privacy received a great deal of attention within and outside the research community, genomic security has not been sufficiently studied. This is surprising since the usage of fake or altered genomes can have grave consequences, such as erroneous drug prescriptions and genetic test outcomes. Unfortunately, in the genomic domain, privacy and security (as often happens) are at odds with each other. In this article, we attempt to reconcile security with privacy in genomic testing by designing a novel technique for a secure and private genomic range query protocol between a genomic testing facility and an individual user. The proposed technique ensures authenticity and completeness of user-supplied genomic material while maintaining its privacy by releasing only the minimum thereof. To confirm its broad usability, we show how to apply the proposed technique to a previously proposed genomic private substring matching protocol. Experiments show that the proposed technique offers good performance and is quite practical. Furthermore, we generalize the genomic range query problem to sparse integer sets and discuss potential use cases.

Tree fruit architecture results from combination of the training system and pruning and thinning processes across multiple growth and development years. Further, the tree fruit architecture contributes to the light interception and improves tree growth, fruit quality, and fruit yield, in addition to easing the process of orchard management and harvest. Currently tree architectural traits are measured manually by researchers or growers, which is labor-intensive and time-consuming. In this study, the remote sensing techniques were evaluated to phenotype critical architectural traits with the final goal to assist tree fruit breeders, physiologists and growers in collecting architectural traits efficiently and in a standardized manner. For this, a consumer-grade red–green–blue (RGB) camera was used to collect apple tree side-images, while an unmanned aerial vehicle (UAV) integrated RGB camera was programmed to image tree canopy at 15 m above ground level to evaluate multiple tree fruit architectures. The sensing data were compared to ground reference data associated with tree orchard blocks within three training systems (Spindle, V-trellis, Bi-axis), two rootstocks (‘WA 38 trees grafted on G41 and M9-Nic29) and two pruning methods (referred as bending and click pruning). The data were processed to extract architectural features from ground-based 2D images and UAV-based 3D digital surface model. The traits extracted from sensing data included box-counting fractal dimension (DBs), middle branch angle, number of branches, trunk basal diameter, and tree row volume (TRV). The results from ground-based sensing data indicated that there was a significant (P

Monitoring the degradation of induction motors is an essential concern for industries, especially when there are high costs related to maintenance and their stops. Nowadays, there are many non-invasive ways to monitor the health status of induction motors, including sensors to measure temperature, magnetic field, vibration, current, and power. However, installing these sensors may not be a simple task since intrusive procedures such as engine disassembling, wire separation, and engine interruption are commonly observed. Thus, we propose MUCLA (Multiphase Clamp and Tracking - patent pending) as a new device and methodology for monitoring motor degradation by analyzing its stator current. MUCLA introduces a non-invasive current sensors array on a proposed clamp in the hardware perspective, while a spectral tracking methodology refers to our novelty in the software viewpoint. For end-users, the main MUCLA contribution relies on the combination of the simplicity of installation and the possibility of using the proposed device even when considering Variable-Frequency Drive powered engines. The results obtained with both simulation and practical tests show encouraging results over different input workloads and emulated degradation. Compared to the current initiatives, we can classify MUCLA as a better solution for industrial plants in terms of installation time, installation complexity, and cost.

Today there is a rapid development taking place in phenotyping of plants using non-destructive image based machine vision techniques. Machine vision based plant phenotyping ranges from single plant trait estimation to broad assessment of crop canopy for thousands of plants in the field. Plant phenotyping systems either use single imaging method or integrative approach signifying simultaneous use of some of the imaging techniques like visible red, green and blue (RGB) imaging, thermal imaging, chlorophyll fluorescence imaging (CFIM), hyperspectral imaging, 3-dimensional (3-D) imaging or high resolution volumetric imaging. This paper provides an overview of imaging techniques and their applications in the field of plant phenotyping. This paper presents a comprehensive survey on recent machine vision methods for plant trait estimation and classification. In this paper, information about publicly available datasets is provided for uniform comparison among the state-of-the-art phenotyping methods. This paper also presents future research directions related to the use of deep learning based machine vision algorithms for structural (2-D and 3-D), physiological and temporal trait estimation, and classification studies in plants.

In regions such as hawai'i, south australia, Tasmania, Texas, and Ireland, power systems are commonly experiencing instantaneous penetration levels of inverter-based power sources (IBPSs) such as wind, solar photovoltaics (PV), and battery storage in excess of 50n60% relative to system demands.

This is the first work that incorporates recent advancements in "explainability" of machine learning (ML) to build a routing obfuscator called ObfusX. We adopt a recent metric---the SHAP value---which explains to what extent each layout feature can reveal each unknown connection for a recent ML-based split manufacturing attack model. The unique benefits of SHAP-based analysis include the ability to identify the best candidates for obfuscation, together with the dominant layout features which make them vulnerable. As a result, ObfusX can achieve better hit rate (97% lower) while perturbing significantly fewer nets when obfuscating using a via perturbation scheme, compared to prior work. When imposing the same wirelength limit using a wire lifting scheme, ObfusX performs significantly better in performance metrics (e.g., 2.4 times more reduction on average in percentage of netlist recovery).

For cloud network performance profiling, network tomography based on end-to-end measurement is often used in deducing the network performance for its efficiency. However, most tomography problems are under-constrained, which require additional assumptions or probing monitors planted among network switches, which are often unavailable in software-defined networking (SDN) environment. On the other hand, SDN based flow mirroring could provide accurate flow information, but the cost of both gathering and analysing the packet traces is tremendous that it is impossible to cover the whole network. We propose ScoutFlow, a method combining SDN flow measurement and end-to-end performance tomography, to achieve accurate performance profiling for cloud network while keeping low monitoring overhead. We evaluate ScoutFlow in our campus data center cloud, the experiment shows good scalability and accuracy.

Secure, Clean, and Efficient Energy is one of the great societal challenges of our time. Electricity as a sustainable energy carrier plays a central role in the most effective transition scenarios toward sustainability. To harness this potential, the current electricity infrastructure needs to be rigorously re-engineered into an integrated and intelligent electricity system: the smart grid. Key elements of the smart grid vision are the coordination mechanisms. In such a system, vast numbers of devices, currently just passively connected to the grid, will become actively involved in system-wide and local coordination tasks. In this light, transactive energy (TE ) is emerging as a strong contender for orchestrating the coordinated operation of so many devices.

Battery energy storage effectively staBIlizes the electric grid and aids renewable integration by balancing supply and demand in real time. The importance of such storage is especially crucial in densely populated urban areas, where traditional storage techniques such as pumped hydroelectric energy storage and compressed-air energy storage are often not feasible.

This paper proposes a comprehensive steady-state analysis for a front-end Modular Multi-Parallel Rectifiers (MMR) system with a shared DC-link. A generalised mathematical representation for n number of parallel rectifiers is proposed. The MMR is analysed for both Continuous Conduction Mode (CCM) and Discontinuous Conduction Mode (DCM). In addition, the CCM and DCM boundary of the MMR is identified mathematically. A 60kW Simulink model for the MMR is utilised to confirm the proposed steady-state mathematical modelling equations.

A new dc-dc converter with high voltage gain is proposed in this study. The proposed converter consists of two switches which are turned on and off simultaneously. Additionally, two Switched-Capacitor (SC) cells and one Energy Storage (ES) cell are utilized in the structure of the proposed converter. These result in high voltage gains at low values of the duty cycle. Besides, the voltage stress across the power devices is low and below half of the output voltage. Therefore, the MOSFET switches with low RDS-on and devices with reduced nominal voltage can be used in the proposed converter which in turn reduces the conduction and turn-on losses. The analysis of the voltage and current stresses of the devices is accomplished. The circuit performance is compared with other solutions in the literature in terms of voltage gain and normalized voltage stress of switches and diodes. Eventually, in order to verify the theoretical analysis, the experimental results are provided.

Multi-view classification with limited sample size and data augmentation is a very common machine learning (ML) problem in medicine. With limited data, a triplet network approach for two-stage representation learning has been proposed. However, effective training and verifying the features from the representation network for their suitability in subsequent classifiers are still unsolved problems. Although typical distance-based metrics for the training capture the overall class separability of the features, the performance according to these metrics does not always lead to an optimal classification. Consequently, an exhaustive tuning with all feature-classifier combinations is required to search for the best end result. To overcome this challenge, we developed a novel nearest-neighbor (NN) validation strategy based on the triplet metric. This strategy is supported by a theoretical foundation to provide the best selection of the features with a lower bound of the highest end performance. The proposed strategy is a transparent approach to identify whether to improve the features or the classifier. This avoids the need for repeated tuning. Our evaluations on real-world medical imaging tasks (i.e., radiation therapy delivery error prediction and sarcoma survival prediction) show that our strategy is superior to other common deep representation learning baselines [i.e., autoencoder (AE) and softmax]. The strategy addresses the issue of feature's interpretability which enables more holistic feature creation such that the medical experts can focus on specifying relevant data as opposed to tedious feature engineering.

With the rapid progress of wireless communication technologies along with their digital revolutions, the quantity of Internet of Things (IoT) has been increased by manifolds resulting in a huge increase in data volume and network traffic. It became easier for an intruder to pretend as a valid service provider, and generate different types of network attacks. This becomes even more severe when the service involves digital financial transactions. This paper proposes an intrusion detection system (IDS) based on a stacked autoencoder (AE) and a deep neural network (DNN). The stacked AE learns the features of the input network record in an unsupervised manner to decrease the feature width. Then, the DNN is trained in a supervised manner to extract deep-learned features for the classifier. In the proposed system, the stacked AE has two latent layers and the DNN has two or three layers, where each layer has a fully-connected layer, a batch normalization, and a dropout. The system was evaluated on three publicly available datasets: KDDCup99, NSL-KDD, and AWID. Experimental results exhibited that the proposed IDS achieved 94.2%, 99.7%, 99.9% accuracy, respectively, for multiclass classification.

Federated Learning (FL) has attracted significant interest given its prominent advantages and applicability in many scenarios. However, it has been demonstrated that sharing updated gradients/weights during the training process can lead to privacy concerns. In the context of the Internet of Things (IoT), this can be exacerbated due to Intrusion Detection Systems (IDS), which are intended to detect security attacks by analyzing the devices' network traffic. Our work provides a comprehensive evaluation of Differential Privacy (DP) techniques, which are applied during the training of an FL-enabled IDS for Industrial IoT (IIoT). Unlike previous approaches, we deal with non-iid data over the recent ToN_IoT dataset and compare the accuracy obtained considering different privacy requirements and aggregation functions, namely FedAvg and the recently proposed Fed+. According to our evaluation, the use of Fed+ in our setting provides similar results even when noise is included in the federated training process.

This paper aims to predict a set of apps a user will open on her mobile device in the next time slot. Such an information is essential for many smartphone operations, e.g., app pre-loading and content pre-caching, to improve user experience. However, it is hard to build an explicit model that accurately captures the complex environment context and predicts a set of apps at one time. This paper presents a deep reinforcement learning framework, named as DeepAPP, which learns a model-free predictive neural network from historical app usage data. Meanwhile, an online updating strategy is designed to adapt the predictive network to the time-varying app usage behavior. To transform DeepAPP into a practical deep reinforcement learning system, several challenges are addressed by developing a context representation method for complex contextual environment, a general agent for overcoming data sparsity and a lightweight personalized agent for minimizing the prediction time. Extensive experiments on a large-scale anonymized app usage dataset reveal that DeepAPP provides high accuracy (precision 70.6% and recall of 62.4%) and reduces the prediction time of the state-of-the-art by 6.58 times. A field experiment of 29 participants demonstrates DeepAPP can effectively reduce launch time of apps.

Projection techniques are often used to visualize high-dimensional data, allowing users to better understand the overall structure of multi-dimensional spaces on a 2D screen. Although many such methods exist, comparably little work has been done on generalizable methods of inverse-projection -- the process of mapping the projected points, or more generally, the projection space back to the original high-dimensional space. In this paper we present NNInv, a deep learning technique with the ability to approximate the inverse of any projection or mapping. NNInv learns to reconstruct high-dimensional data from any arbitrary point on a 2D projection space, giving users the ability to interact with the learned high-dimensional representation in a visual analytics system. We provide an analysis of the parameter space of NNInv, and offer guidance in selecting these parameters. We extend validation of the effectiveness of NNInv through a series of quantitative and qualitative analyses. We then demonstrate the method's utility by applying it to three visualization tasks: interactive instance interpolation, classifier agreement, and gradient visualization.

The assets in Industry 4.0 are categorised into physical, virtual and human. The innovation and popularisation of ubiquitous computing enhance the usage of smart devices: RFID tags, QR codes, LoRa tags, etc. for assets identification and tracking. The generated data from Industrial Internet of Things (IIoT) eases information visibility and process automation in Industry 4.0. Virtual assets include the data produced from IIoT. One of the applications of the industrial big data is to predict the failure of manufacturing equipment. Predictive maintenance enables the business owner to decide such as repairing or replacing the component before an actual failure which affects the whole production line. Therefore, Industry 4.0 requires an effective asset management to optimise the tasks distributions and predictive maintenance model. This paper presents the Genetic Algorithm (GA) based resource management integrating with machine learning for predictive maintenance in fog computing. The time, cost and energy performance of GA along with MinMin, MaxMin, FCFS, RoundRobin are simulated in the FogWorkflowsim. The predictive maintenance model is built in two-class logistic regression using real-time datasets. The results demonstrate that the proposed technique outperforms MinMin, MaxMin, FCFS, RoundRobin in execution time, cost and energy usage. The execution time is 0.48% faster, 5.43% lower cost and energy usage is 28.10% lower in comparison with second-best results. The training and testing accuracy of the prediction model is 95.1% and 94.5%, respectively.

Issuing a disaster certificate, which is used to decide the contents of a victim’s support, requires accuracy and rapidity. However, in Japan at large, issuing of damage certificates has taken a long time in past earthquake disasters. Hence, the government needs a more efficient mechanism for issuing damage certificates. This study developed an estimation system of roof-damaged buildings to obtain an overview of earthquake damage based on aero-photo images using deep learning. To provide speedy estimation, this system utilized the trimming algorithm, which automatically generates roof image data using the location information of building polygons on GIS (Geographic Information System). Consequently, the proposed system can estimate, if a house is covered with a blue sheet with 97.57 % accuracy and also detect whether a house is damaged, with 93.51 % accuracy. It would therefore be worth considering the development of an image recognition model and a method of collecting aero-photo data to operate this system during a real earthquake.

The rapid growth of GPS technology and mobile devices has led to a massive accumulation of location data, bringing considerable benefits to individuals and society. One of the major usages of such data is travel time prediction, a typical service provided by GPS navigation devices and apps. Meanwhile, the constant collection and analysis of the individual location data also pose unprecedented privacy threats. We leverage the notion of geo-indistinguishability, an extension of differential privacy to the location privacy setting, and propose a procedure for privacy-preserving travel time prediction without collecting actual individual GPS trace data. We propose new concepts to examine the impact of geo-indistinguishability-based sanitization on the usefulness of GPS traces and provide analytical and experimental utility analysis for privacy-preserving travel time prediction. We also propose new metrics to measure the adversary error in learning individual GPS traces from the collected sanitized data. Our experiment results suggest that the proposed procedure provides travel time prediction with satisfactory accuracy at reasonably small privacy costs.

This paper presents a practical optimum design solution of prismatic simply supported prestressed concrete girders that are subjected to uniformly distributed static loads. While assuming linear elastic behaviour and employing working stresses method, the optimum values of two design variables, namely the cross-sectional dimensions and the prestressing force, are formulated as a nonlinear optimization model. Optimum values of the design variables are computed to satisfy either a minimum weight or a minimum cost objective function. To solve the nonlinear programming models, a program named Non-Linear Programming Prestressed Concrete Optimizer (NLPRECO) was coded in MATLAB® programming environment. Some illustrative design problems were solved using NLPRECO and their results are demonstrated herein. Sensitivity analysis of the optimized design variables, to variations in design parameters, was also investigated and the results are presented. Results show substantial improvement over the regular un-optimized solutions and moderate improvement over a linear programming optimization solutions.

Smart materials have played significant contribution towards the development of buildings. There are various smart materials which can change their properties and behavior under the influence of external catalyst or stimulus. Such materials are changing the face of traditional engineering materials. Smart materials can be utilized individually as well as it can be incorporated with existing materials to enhance their desirable properties. Smart materials are widespread across all the domains of human inventions due to its multidisciplinary applications. Some of these materials are relatively new while some are being used from a very long time. Hence it suffices to say that the recently developed smart materials still require research. The general classification of smart material is illustrated in this review paper. The paper intends to identify the various types of available smart materials and also illustrated the application of such materials in the various fields of civil engineering. Further, the potential benefits and downsides are also discussed along with their applicability under different conditions. Some innovative materials are also discussed which can bring potential revolution in the construction industry. The impact or the benefits related to sustainability also discussed in this review paper.

Recently, Ivanov et al. proposed a new approach to construct code-based cryptosystems, namely the \begin{document}$ {\sf IKKR} $\end{document} public-key encryptions (PKE) in the International Workshop on Code-Based Cryptography (CBCrypto 2020) [ 9 ]. Unlike the usual construction in code-based encryption schemes which has restrictions on the Hamming weight of the error introduced into the ciphertext, the \begin{document}$ {\sf IKKR} $\end{document} approach allows error vectors of arbitrary weight being introduced into the ciphertext. Using this new approach, Ivanov et al. constructed two cryptosystems, namely the modified and the upgraded \begin{document}$ {\sf IKKR} $\end{document} -PKE. This paper aims to discuss the practical security of the \begin{document}$ {\sf IKKR} $\end{document} -PKE. In particular, we describe the weaknesses in the design of the public key used in the \begin{document}$ {\sf IKKR} $\end{document} -PKE. We exploit such weaknesses and propose two attacks to recover the plaintext in the \begin{document}$ {\sf IKKR} $\end{document} -PKE. The approach of our first attack is similar to the LCKN attack [ 12 ], whilst our second attack is more efficient than the LCKN attack. Our experimental results show that we can recover the plaintext from a given ciphertext in less than 176 milliseconds for schemes based on random Goppa codes and BCH codes.

Given the prevalence of depression worldwide and its major impact on society, several studies employed artificial intelligence modelling to automatically detect and assess depression. However, interpretation of these models and cues are rarely discussed in detail in the AI community, but have received increased attention lately. In this study, we aim to analyse the commonly selected features using a proposed framework of several feature selection methods and their effect on the classification results, which will provide an interpretation of the depression detection model. The developed framework aggregates and selects the most promising features for modelling depression detection from 38 feature selection algorithms of different categories. Using three real-world depression datasets, 902 behavioural cues were extracted from speech behaviour, speech prosody, eye movement and head pose. To verify the generalisability of the proposed framework, we applied the entire process to depression datasets individually and when combined. The results from the proposed framework showed that speech behaviour features (e.g. pauses) are the most distinctive features of the depression detection model. From the speech prosody modality, the strongest feature groups were F0, HNR, formants, and MFCC, while for the eye activity modality they were left-right eye movement and gaze direction, and for the head modality it was yaw head movement. Modelling depression detection using the selected features (even though there are only 9 features) outperformed using all features in all the individual and combined datasets. Our feature selection framework did not only provide an interpretation of the model, but was also able to produce a higher accuracy of depression detection with a small number of features in varied datasets. This could help to reduce the processing time needed to extract features and creating the model.

A case study of the steel–concrete composite structure in the Pidie Jaya Regency Multipurpose Hall which experienced substantial permanent lateral deformation due to the effect of an earthquake is presented in this study. Therefore, it is important to assess the response of the structure to earthquake load and propose the strengthening strategies to make the buildings useful again. The purpose was to evaluate the causes of large deformations and the behavior of structure in resisting earthquake loads. The building structure model used in this study is a space frame with two-column base support conditions which are fixed and hinged supports after which a non-linear time history analysis was conducted. The time history analysis was conducted using five ground motion acceleration data recorded during earthquakes to determine the deformation and it was found that the large structure permanent deformation was due to the small structure stiffness in the direction of the deformation due to the use of only one column row in front of the building. Moreover, hinged support was observed to have caused a greater deformation than fixed support but was found not to be the main cause of large permanent deformation of the structure. The building structure was further strengthened by adding 4 columns while the oblique columns remained in a sloping condition. Meanwhile, the response spectrum analysis showed the strengthening structure was able to withstand earthquake loads with less deformation than the required standard.

We propose a simple and effective method to inject word-level information into character-aware neural language models. Unlike previous approaches which usually inject word-level information at the input of a long short-term memory (LSTM) network, we inject it into the softmax function. The resultant model can be seen as a combination of character-aware language model and simple word-level language model. Our injection method can also be used together with previous methods. Through the experiments on 14 typologically diverse languages, we empirically show that our injection method, when used together with the previous methods, works better than the previous methods, including a gating mechanism, averaging, and concatenation of word vectors. We also provide a comprehensive comparison of these injection methods.

A tweakable enciphering scheme (TES) is a length preserving (tweakable) encryption scheme that provides (tweakable) strong pseudorandom permutation security on arbitrarily long messages. TES is traditionally built using block ciphers and the security of the mode depends on the strong pseudorandom permutation security of the underlying block cipher. In this paper, we construct TESs using public random permutations. Public random permutations are being considered as a replacement of block cipher in several cryptographic schemes including AEs, MACs, etc. However, to our knowledge, a systematic study of constructing TES using public random permutations is missing. In this paper, we give a generic construction of a TES which uses a public random permutation, a length expanding public permutation based PRF and a hash function which is both almost xor universal and almost regular. Further, we propose a concrete length expanding public permutation based PRF construction. We also propose a single keyed TES using a public random permutation and an AXU and almost regular hash function.

International audience; Internet of Things (IoT) applications often require the processing of data streams generated by devices dispersed over a large geographical area. Traditionally, these data streams are forwarded to a distant cloud for processing, thus resulting in high application end-to-end latency. Recent work explores the combination of resources located in clouds and at the edges of the Internet, called cloud-edge infrastructure, for deploying Data Stream Processing (DSP) applications. Most previous work, however, fails to scale to very large IoT settings. This paper introduces deployment strategies for the placement of DSP applications on to cloud-edge infrastructure. The strategies split an application graph into regions and consider regions with stringent time requirements for edge placement. The proposed Aggregate End-to-End Latency Strategy with Region Patterns and Latency Awareness (AELS+RP+LA) decreases the number of evaluated resources when computing an operator’s placement by considering the communication overhead across computing resources. Simulation results show that, unlike the state-of-the-art, AELS+RP+LA scales to environments with more than 100k resources with negligible impact on the application end-to-end latency.

Emotion recognition based on electroencephalography (EEG) is a significant task in the brain-computer interface field. Recently, many deep learning-based emotion recognition methods are demonstrated to outperform traditional methods. However, it remains challenging to extract discriminative features for EEG emotion recognition, and most methods ignore useful information in channel and time. This paper proposes an attention-based convolutional recurrent neural network (ACRNN) to extract more discriminative features from EEG signals and improve the accuracy of emotion recognition. First, the proposed ACRNN adopts a channel-wise attention mechanism to adaptively assign the weights of different channels, and a CNN is employed to extract the spatial information of encoded EEG signals. Then, to explore the temporal information of EEG signals, extended self-attention is integrated into an RNN to recode the importance based on intrinsic similarity in EEG signals. We conducted extensive experiments on the DEAP and DREAMER databases. The experimental results demonstrate that the proposed ACRNN outperforms state-of-the-art methods.

We propose a decentralized e-voting protocol that is coercion-resistant and vote-selling resistant, while being also completely transparent and not receipt-free. We achieve decentralization using blockchain technology. Because of the properties such as transparency, decentralization, and non-repudiation, blockchain is a fundamental technology of great interest in its own right, and it also has large potential when integrated into many other areas. We prove the security of the protocol under the standard DDH assumption on the underlying prime-order cyclic group (e.g. the group of points of an elliptic curve), as well as under standard assumptions on blockchain robustness.

The Micro-expressions (MEs) are very important nonverbal communication clues. However, due to their local and short nature, spotting them is challenging. In this paper, we address this problem by using a dedicated local and temporal pattern (LTP) of facial movement. This pattern has a specific shape (S-pattern) when ME are displayed. Thus, by using a classical classification algorithm (SVM), MEs are distinguished from other facial movements. We also propose a global final fusion analysis on the whole face to improve the distinction between ME (local) and head (global) movements. However, the learning of S-patterns is limited by the small number of ME databases and the low volume of ME samples. Hammerstein models (HMs) are known to be a good approximation of muscle movements. By approximating each S-pattern with a HM, we can both filter outliers and generate new similar S-patterns. By this way, we perform a data augmentation for S-pattern training dataset and improve the ability to differentiate micro-expressions from other facial movements. The spotting results, performed on CASME and CASME, show that our proposed LTP outperforms the most popular spotting method in terms of F1-score. Adding the fusion process and data augmentation improve even more the spotting performance.

Key assignment and key maintenance in encrypted networks of resource-limited devices may be a challenging task, due to the permanent need of replacing out-of-service devices with new ones and to the consequent need of updating the key information. Recently, Aragona et al. proposed a new cryptographic scheme, ECTAKS, which provides a solution to this design problem by means of a Diffie-Hellman-like key establishment protocol based on elliptic curves and on a prime field. Even if the authors proved some results related to the security of the scheme, the latter still lacks a formal security analysis. In this paper, we address this issue by providing a security proof for ECTAKS in the setting of computational security, assuming that no adversary can solve the underlying discrete logarithm problems with non-negligible success probability.

A cost-effective stereolithography for medium-scale components is developed to fabricate 3D components with high build speed and resolution from photo-curable resin. The developed SLA utilizes a focused light beam of wavelength range (300 nm–700 nm) coming from the DLP projector and passes through the objective lens and finally imposed on the platform containing a layer of photo-curable resin. After focusing the light beam on the liquid resin layer, the photo-polymerization reaction occurs and the liquid resin becomes solid. Thus, the 3D object is fabricated layer by layer curing of liquid resin. The photopolymer used in this experimentation is polyethylene glycol di-acrylate and Irgacure 784 as photo-initiator. The Creo 3.0 software is used for modelling of 3D objects. A special MATLAB code is developed for slicing of the 3D model and displaying the sliced image one by one through DLP projector. The Arduino microcontroller with stepper motor and ball screw is used to control the motion of Z-stage platform. The Creation workshop software is also used to control motion of the Z-stage and period to display the sliced images through DLP projector. The medium-scale 3D objects with rectangular, square, and circular cross-sections are obtained by curing the aforementioned photo-curable resin. It is observed that the 3D objects are best cured for two seconds curing time with 0.1 mm curing depth along Z-axis.

Due to rapid movement of rural population to new regions and countries in order to find work and for better living conditions, population growth and economic development, there is gradual increase in production of waste and demand of electricity worldwide. According to World Bank statistics, the global Municipal Solid Waste generated was 1.3 billion tons in year 2012 and this is expected to increase above 2.2 billion tons per year by 2025. Due to lack of sites for waste disposal, it has become a serious environmental as well as health issue. Now various methods have been adopted for waste disposal. Among this, energy accessed from municipal solid waste is the most common practice adopted by developing countries. In addition, Waste to Energy and Energy from Waste technologies are used which include thermal and biological technologies. Gasification, pyrolysis and incineration are thermal technologies used in conversion of waste to energy. During these processes, syngas is produced which is used in combustion engine or turbines to generate electricity. Apart from this, biomethanation is also used in which biogas is produced. In this review article, we have discussed all the environmental and green methods used for the generation of energy from Municipal Solid Waste their advantages and drawbacks.

This study addresses performances and behaviors of the multi-cross-section HAWT blade design with and without fences. The FX66-S-196 V, FX63-137 S and SG6043, supercritical airfoils were used and distributed along the blade radius; further, the NACA4412 single-cross-section HAWT blade having the same dimensions was used to compare the behaviors and overall performances of all the blades. Analyses were then performed numerically using blade elements momentum BEM theory with a self-code (F.90) and CFD as well as experimentally with three multi-cross-section blades designed using SOLIDWORKS and 3D- printed with polylactic acid. the multi-cross-section HAWT blades show good performance compared with the single- cross-section blade, with an approximately 8% increase in power coefficient, i.e., 40 W, for a miniature wind turbine (127 cm diameter 500 W output power) and greater improvements for wind turbines with large diameters. The fences were designed using boundary layer theory and installed on multi-cross-section blades in experimentally determined positions. The fences showed high performance, with a 16% increase in total power coefficient and high flutter stability.

In the context of digital signatures, the proxy signature holds a significant role of enabling an original signer to delegate its signing ability to another party (i.e., proxy signer). It has significant practical applications. Particularly it is useful in distributed systems, where delegation of authentication rights is quite common. For example, key sharing protocol, grid computing, and mobile communications. Currently, a large portion of existing proxy signature schemes are based on the hardness of problems like integer factoring, discrete logarithms, and/or elliptic curve discrete logarithms. However, with the rising of quantum computers, the problem of prime factorization and discrete logarithm will be solvable in polynomial-time, due to Shor's algorithm, which dilutes the security features of existing ElGamal, RSA, ECC, and the proxy signature schemes based on these problems. As a consequence, construction of secure and efficient post-quantum proxy signature becomes necessary. In this work, we develop a post-quantum proxy signature scheme Mult-proxy, relying on multivariate public key cryptography (MPKC), which is one of the most promising candidates of post-quantum cryptography. We employ a 5-pass identification protocol to design our proxy signature scheme. Our work attains the usual proxy criterion and a one-more-unforgeability criterion under the hardness of the Multivariate Quadratic polynomial (MQ) problem. It produces optimal size proxy signatures and optimal size proxy shares in the field of MPKC.