Query: Real-time visual tracking using compressive sensing

Relevant passages:
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit <=SEP=> This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal. This is a massive improvement over previous results, which require O(m2) measurements. The new results for OMP are comparable with recent results for another approach called basis pursuit (BP). In some settings, the OMP algorithm is faster and easier to implement, so it is an attractive alternative to BP for signal recovery problems.

Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition <=SEP=> where fk is the current approximation, and Rk f the current residual (error). Using initial values of Ro f = f , fo = 0, and k = 1 , the M P algorithm is comprised of the following steps, In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries (I) Compute the inner-products {(Rkf, Zn)},. of elementary building blocks e.g. affine (wavelet) frames. We propose a modification to the Matching Pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual convergence. We refer to this modified algorithm as Orthogonal Matching Pursuit (OMP). It is shown that all additional computation required for the OMP algorithm may be performed recursively. (11) Find nktl such that (error) at every step and thereby leads to improved I ( R k f , 'nk+I) l 2 asYp I(Rkf, zj)I 1

On sequential Monte Carlo sampling methods for Bayesian filtering <=SEP=> In this article, we present an overview of methods for sequential simulation from posterior distributions. These methods are of particular interest in Bayesian filtering for discrete time dynamic models that are typically nonlinear and non-Gaussian. A general importance sampling framework is developed that unifies many of the methods which have been proposed over the last few decades in several different scientific disciplines. Novel extensions to the existing methods are also proposed. We show in particular how to incorporate local linearisation methods similar to those which have previously been employed in the deterministic filtering literature; these lead to very effective importance distributions. Furthermore we describe a method which uses Rao-Blackwellisation in order to take advantage of the analytic structure present in some important classes of state-space models. In a final section we develop algorithms for prediction, smoothing and evaluation of the likelihood in dynamic models.

Extensions of compressed sensing <=SEP=> We study the notion of Compressed Sensing (CS) as put forward in [14] and related work [20, 3, 4]. The basic idea behind CS is that a signal or image, unknown but supposed to be compressible by a known transform, (eg. wavelet or Fourier), can be subjected to fewer measurements than the nominal number of pixels, and yet be accurately reconstructed. The samples are nonadaptive and measure ‘random’ linear combinations of the transform coefficients. Approximate reconstruction is obtained by solving for the transform coefficients consistent with measured data and having the smallest possible ` norm. We perform a series of numerical experiments which validate in general terms the basic idea proposed in [14, 3, 5], in the favorable case where the transform coefficients are sparse in the strong sense that the vast majority are zero. We then consider a range of less-favorable cases, in which the object has all coefficients nonzero, but the coefficients obey an ` bound, for some p ∈ (0, 1]. These experiments show that the basic inequalities behind the CS method seem to involve reasonable constants. We next consider synthetic examples modelling problems in spectroscopy and image processing, and note that reconstructions from CS are often visually “noisy” . We post-process using translation-invariant de-noising, and find the visual appearance considerably improved. We also consider a multiscale deployment of compressed sensing, in which various scales are segregated and CS applied separately to each; this gives much better quality reconstructions than a literal deployment of the CS methodology. We also report that several workable families of ‘random’ linear combinations all behave equivalently, including random spherical, random signs, partial Fourier and partial Hadamard. These results show that, when appropriately deployed in a favorable setting, the CS framework is able to save significantly over traditional sampling, and there are many useful extensions of the basic idea.

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information <=SEP=> This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f/spl isin/C/sup N/ and a randomly chosen set of frequencies /spl Omega/. Is it possible to reconstruct f from the partial knowledge of its Fourier coefficients on the set /spl Omega/? A typical result of this paper is as follows. Suppose that f is a superposition of |T| spikes f(t)=/spl sigma//sub /spl tau//spl isin/T/f(/spl tau/)/spl delta/(t-/spl tau/) obeying |T|/spl les/C/sub M//spl middot/(log N)/sup -1/ /spl middot/ |/spl Omega/| for some constant C/sub M/>0. We do not know the locations of the spikes nor their amplitudes. Then with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the /spl lscr//sub 1/ minimization problem. In short, exact recovery may be obtained by solving a convex optimization problem. We give numerical values for C/sub M/ which depend on the desired probability of success. Our result may be interpreted as a novel kind of nonlinear sampling theorem. In effect, it says that any signal made out of |T| spikes may be recovered by convex programming from almost every set of frequencies of size O(|T|/spl middot/logN). Moreover, this is nearly optimal in the sense that any method succeeding with probability 1-O(N/sup -M/) would in general require a number of frequency samples at least proportional to |T|/spl middot/logN. The methodology extends to a variety of other situations and higher dimensions. For example, we show how one can reconstruct a piecewise constant (one- or two-dimensional) object from incomplete frequency samples - provided that the number of jumps (discontinuities) obeys the condition above - by minimizing other convex functionals such as the total variation of f.

TUNABLE AND SWITCHABLE BANDPASS FILTERS USING SLOT-LINE RESONATORS <=SEP=> In this paper, novel uniplanar tunable and switchable bandpass filters are designed by using the centrally-loaded slot-line resonator. From the voltage-wave distribution along the resonator, the appropriate location for the loading element is determined to be the center of the slot-line resonator, where the voltages of the fundamental signal and second harmonic are maximum and zero, respectively. As a result, the fundamental frequency can be tuned while the second harmonic remains almost unchanged. For the first time, the properties of the centrally-loaded slot-line resonator are analyzed by using the evenand odd-mode method, and their respective resonant frequencies are derived. The demonstrated tunable bandpass filter can give a 30.9% frequency tuning range with acceptable insertion loss when a varactor is used as the loading element. By replacing the loading varactors with PIN diodes, a switchable bandpass filter is realized in which the attenuation in the fundamental passband can be controlled. In experiments, the switchable bandpass filter exhibits a 2.13 dB insertion loss in the fundamental passband when the PIN diodes are off and more than 49 dB isolation across the passband when the PIN diodes are on. Received 8 October 2010, Accepted 5 November 2010, Scheduled 27 November 2010 Corresponding author: Zhi-Hua Bao (bao.zh@ntu.edu.cn).

Wavelet support vector machine <=SEP=> An admissible support vector (SV) kernel (the wavelet kernel), by which we can construct a wavelet support vector machine (SVM), is presented. The wavelet kernel is a kind of multidimensional wavelet function that can approximate arbitrary nonlinear functions. The existence of wavelet kernels is proven by results of theoretic analysis. Computer simulations show the feasibility and validity of wavelet support vector machines (WSVMs) in regression and pattern recognition.

A Cognitive Model of Semantic Network Learning <=SEP=> Child semantic development includes learning the meaning of words as well as the semantic relations among words. A presumed outcome of semantic development is the formation of a semantic network that reflects this knowledge. We present an algorithm for simultaneously learning word meanings and gradually growing a semantic network, which adheres to the cognitive plausibility requirements of incrementality and limited computations. We demonstrate that the semantic connections among words in addition to their context is necessary in forming a semantic network that resembles an adult’s semantic knowledge.

Survey on Fraud Detection Techniques Using Data Mining <=SEP=> Now a days, fraud is a million dollar business and every year it is increasing more and more. In a crime survey in 2009, tells that close to 30% of the company’s worldwide reported falling victim to fraud in the past year. Fraud involves individual or in a form of groups who intentionally act secretly to rob another of something of worth, for their own profit. Fraud is as against the humanity and it is unlimited variety of different forms. So in this paper, we introduce different methods and techniques to tackle the fraud and how to prevent the fraud into the organization, businesses, and hospital and insurance companies. Fraud prevention is a continuing battle. Many website owners must continually fight against many kinds of crime ranging from stealing identity theft and credit cards and many other types of fraud related to that. Internet Fraud is also very popular, where fraudster can steal the credit card number and buy thing from the different websites.

Effects of Weighted Vests on the Engagement of Children With Developmental Delays and Autism <=SEP=> The use of weighted vests for children with autism spectrum disorders and developmental disabilities is a common practice as part of sensory integration therapy programs. The purpose of the current investigation was to extend the research on the use of weighted vests for children with autism and developmental delays in a methodologically rigorous study. The study was conducted using an alternating treatment design. This allowed the comparison of three different conditions: weighted vest, vest with no weight (which served as a placebo), and no vest (which served as a baseline). The results showed no differentiation in engagement between conditions for any of the participants. Implications for practice and future research are provided.

The Impact of Information Technology Infrastructure Flexibility on Strategic Alignment and Application Implementations <=SEP=> IT infrastructure flexibility is now being viewed as an organizational core competency that is necessary for organizations to survive and prosper in rapidly-changing, competitive, business environments. Using data from 200 U.S. and Canadian companies, this study examines the impact of the four components of IT infrastructure flexibility (compatibility, connectivity, modularity, and IT personnel) on strategic IT-business alignment and the extent to which various applications are implemented within an organization. The “extent” of implementation refers to the the organization’s experience with the particular application and the degree to which the application is implemented and used throughout the organization. The findings from analysis of a structural model provide evidence that connectivity, modularity, and IT personnel (among other considerations that we discuss in the paper) make significant, positive impacts on strategic alignment and that all four components result in significant, positive impacts on the applications implementation. The study reinforces the importance of IT infrastructure flexibility to organizations as one source for sustainable competitive advantage.

Investigating Language Universal and Specific Properties in Word Embeddings <=SEP=> Recently, many NLP tasks have benefited from distributed word representation. However, it remains unknown whether embedding models are really immune to the typological diversity of languages, despite the language-independent architecture. Here we investigate three representative models on a large set of language samples by mapping dense embedding to sparse linguistic property space. Experiment results reveal the language universal and specific properties encoded in various word representation. Additionally, strong evidence supports the utility of word form, especially for inflectional languages.

Color and Uncertainty: It is not always Black and White <=SEP=> To fully comprehend the meaning and impact of visualized data it is crucial that users are able to perceive and comprehend the inherent uncertainty of the data in a correct and intuitive way. Data uncertainty is frequently visualized through color mappings. Previous studies argued that color hue is not suitable for communicating uncertainty because most hue scales lack an intrinsic perceptual order. In this paper we examine the use of hue for communicating data uncertainty in more detail. We investigated the potential of distinct color triples (rather than the entire spectrum of colors, as used in previously studies) to represent different levels of uncertainty. We identified several color triples that reliably map to an intuitive ordering of certainty. Bipolar color scales constructed from these color triples can be used to communicate uncertainty in visualizations, particularly to audiences of nonspecialists. A ‘traffic light’ configuration (with red and green at the endpoints and either yellow or orange in the middle) communicates uncertainty most intuitively.

The Fox News Effect: Media Bias and Voting∗ <=SEP=> Does media bias affect voting? We address this question by looking at the entry of Fox News in cable markets and its impact on voting. Between October 1996 and November 2000, the conservative Fox News Channel was introduced in the cable programming of 20 percent of US towns. Fox News availability in 2000 appears to be largely idiosyncratic. Using a data set of voting data for 9,256 towns, we investigate if Republicans gained vote share in towns where Fox News entered the cable market by the year 2000. We find a significant effect of the introduction of Fox News on the vote share in Presidential elections between 1996 and 2000. Republicans gain 0.4 to 0.6 percentage points in the towns which broadcast Fox News. The results are robust to town-level controls, district and county fixed effects, and alternative specifications. We also find a significant effect of Fox News on Senate vote share and, to a lesser extent, on voter turnout. Our estimates imply that Fox News convinced 3 to 8 percent of its viewers to vote Republican. The evidence is most consistent with voters suffering from persuasion bias. We also discuss a model of rational voter updating that fits most facts. ∗George Akerlof, Stephen Ansolabehere, Larry M. Bartels, Matthew Gentzkow, Alan Gerber, Jay Hamilton, Alan Krueger, Marco Manacorda, Enrico Moretti, Torsten Persson, Sam Popkin, Riccardo Puglisi, Matthew Rabin, Jesse Shapiro, David Stromberg, and audiences at Bonn University, EUI (Florence), Fuqua, Harvard University, IIES (Stockholm), Princeton University, UC Berkeley, University of Chicago GSB, and the NBER 2005 Political Economy and Labor Studies Meetings provided useful comments. We would like to specially thank Jim Collins and Matthew Gentzkow for providing the Scarborough data. Shawn Bananzadeh, Jessica Chan, Marguerite Converse, Neil Dandavati, Tatyana Deryugina, Monica Deza, Dylan Fox, Melissa Galicia, Calvin Ho, Sudhamas Khanchanawong, Richard Kim, Martin Kohan, Vipul Kumar, Jonathan Leung, Clarice Li, Tze Yang Lim, Ming Mai, Sameer Parekh, Sharmini Radakrishnan, Rohan Relan, Chanda Singh, Matthew Stone, Nan Zhang, Sibo Zhao, and Liya Zhu helped collect the voting and the cable data. Dan Acland, Saurabh Bhargava, Avi Ebenstein, and Devin Pope provided excellent research assistance.

A Lender-Based Theory of Collateral∗ <=SEP=> We consider an imperfectly competitive loan market in which a local relationship lender has an information advantage vis-à-vis distant transaction lenders. Competitive pressure from the transaction lenders prevents the local lender from extracting the full surplus from projects, so that she inefficiently rejects marginally profitable projects. Collateral mitigates the inefficiency by increasing the local lender’s payoff from precisely those marginal projects that she inefficiently rejects. The model predicts that, controlling for observable borrower risk, collateralized loans are more likely to default ex post, which is consistent with the empirical evidence. The model also predicts that borrowers for whom local lenders have a relatively smaller information advantage face higher collateral requirements, and that technological innovations that narrow the information advantage of local lenders, such as small business credit scoring, lead to a greater use of collateral in lending relationships. JEL classification: D82; G21

Graph-Level Operations: A High-Level Interface for Graph Visualization Technique Specification <=SEP=> Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these networks produces additional attributes such as degree, centrality, and clustering coefficients. Understanding the effects of this plethora of attributes is one of the main challenges of multivariate SNA. We present the design of GraphDice, a multivariate network visualization system for exploring the attribute space of edges and actors. GraphDice builds upon the ScatterDice system for its main multidimensional navigation paradigm, and extends it with novel mechanisms to support network exploration in general and SNA tasks in particular. Novel mechanisms include visualization of attributes of interval type and projection of numerical edge attributes to node attributes. We show how these extensions to the original ScatterDice system allow to support complex visual analysis tasks on networks with hundreds of actors and up to 30 attributes, while providing a simple and consistent interface for interacting with network data.

Table 1 : A Comparison between Lean Construction and Agile Project <=SEP=> This paper briefly summarises the evolution of Agile Project Management (APM) and differentiates it from lean and agile production and ‘leagile’ construction. The significant benefits being realized through employment of APM within the information systems industry are stated. The characteristics of APM are explored, including: philosophy, organizational attitudes and practices, planning, execution and control and learning. Finally, APM is subjectively assessed as to its potential contribution to the pre-design, design and construction phases. In conclusion, it is assessed that APM offers considerable potential for application in predesign and design but that there are significant hurdles to its adoption in the actual construction phase. Should these be overcome, APM offers benefits well beyond any individual project.

A Bandelet-Based Inpainting Technique for Clouds Removal From Remotely Sensed Images <=SEP=> It is well known that removing cloud-contaminated portions of a remotely sensed image and then filling in the missing data represent an important photo editing cumbersome task. In this paper, an efficient inpainting technique for the reconstruction of areas obscured by clouds or cloud shadows in remotely sensed images is presented. This technique is based on the Bandelet transform and the multiscale geometrical grouping. It consists of two steps. In the first step, the curves of geometric flow of different zones of the image are determined by using the Bandelet transform with multiscale grouping. This step allows an efficient representation of the multiscale geometry of the image's structures. Having well represented this geometry, the information inside the cloud-contaminated zone is synthesized by propagating the geometrical flow curves inside that zone. This step is accomplished by minimizing a functional whose role is to reconstruct the missing or cloud contaminated zone independently of the size and topology of the inpainting domain. The proposed technique is illustrated with some examples on processing aerial images. The obtained results are compared with those obtained by other clouds removal techniques.

SympGraph: a framework for mining clinical notes through symptom relation graphs <=SEP=> As an integral part of Electronic Health Records (EHRs), clinical notes pose special challenges for analyzing EHRs due to their unstructured nature. In this paper, we present a general mining framework SympGraph for modeling and analyzing symptom relationships in clinical notes.
 A SympGraph has symptoms as nodes and co-occurrence relations between symptoms as edges, and can be constructed automatically through extracting symptoms over sequences of clinical notes for a large number of patients. We present an important clinical application of SympGraph: symptom expansion, which can expand a given set of symptoms to other related symptoms by analyzing the underlying SympGraph structure. We further propose a matrix update algorithm which provides a significant computational saving for dynamic updates to the graph. Comprehensive evaluation on 1 million longitudinal clinical notes over 13K patients shows that static symptom expansion can successfully expand a set of known symptoms to a disease with high agreement rate with physician input (average precision 0.46), a 31% improvement over baseline co-occurrence based methods. The experimental results also show that the expanded symptoms can serve as useful features for improving AUC measure for disease diagnosis prediction, thus confirming the potential clinical value of our work.

A Flexible AC Distribution System Device for a Microgrid <=SEP=> This paper presents a flexible ac distribution system device for microgrid applications. The device aims to improve the power quality and reliability of the overall power distribution system that the microgrid is connected to. The control design employs a new model predictive control algorithm which allows faster computational time for large power systems by optimizing the steady-state and the transient control problems separately. Extended Kalman filters are also employed for frequency tracking and to extract the harmonic spectra of the grid voltage and the load currents in the microgrid. The design concept is verified through different test case scenarios to demonstrate the capability of the proposed device and the results obtained are discussed.

Chemical-protein relation extraction with ensembles of SVM, CNN, and RNN models <=SEP=> Text mining the relations between chemicals and proteins is an increasingly important task. The CHEMPROT track at BioCreative VI aims to promote the development and evaluation of systems that can automatically detect the chemical-protein relations in running text (PubMed abstracts). This manuscript describes our submission, which is an ensemble of three systems, including a Support Vector Machine, a Convolutional Neural Network, and a Recurrent Neural Network. Their output is combined using a decision based on majority voting or stacking. Our CHEMPROT system obtained 0.7266 in precision and 0.5735 in recall for an f-score of 0.6410, demonstrating the effectiveness of machine learning-based approaches for automatic relation extraction from biomedical literature. Our submission achieved the highest performance in the task during the 2017 challenge. Keywords—relation extraction; deep learning; chemical; protein

Modeling of Overhead Transmission Lines for Lightning Studies <=SEP=> The aim of this paper is to analyze the influence of the models proposed for representing overhead transmission lines in lightning calculations. A full model of a transmission line for lightning overvoltage calculations can be split into several parts: wires (shield wires and phase conductors), towers, footing impedances and insulators. An additional component, the arrester, should be added if the study is aimed at selecting the arrester ratings needed to achieve a given performance of the line. This paper presents a sensitivity study whose main goal is to determine the effect that the model and the parameters selected for representing the main parts of a transmission line can have on the flashover rate.

Semantic Structural Alignment of Neural Representational Spaces Enables Translation between English and Chinese Words <=SEP=> Two sets of items can share the same underlying conceptual structure, while appearing unrelated at a surface level. Humans excel at recognizing and using alignments between such underlying structures in many domains of cognition, most notably in analogical reasoning. Here we show that structural alignment reveals how different people's neural representations of word meaning are preserved across different languages, such that patterns of brain activation can be used to translate words from one language to another. Groups of Chinese and English speakers underwent fMRI scanning while reading words in their respective native languages. Simply by aligning structures representing the two groups' neural semantic spaces, we successfully infer all seven Chinese–English word translations. Beyond language translation, conceptual structural alignment underlies many aspects of high-level cognition, and this work opens the door to deriving many such alignments directly from neural representational content.

High-Q MEMS Resonators for Laser Beam Scanning Displays <=SEP=> This paper reports on design, fabrication and characterization of high-Q MEMS resonators to be used in optical applications like laser displays and LIDAR range sensors. Stacked vertical comb drives for electrostatic actuation of single-axis scanners and biaxial MEMS mirrors were realized in a dual layer polysilicon SOI process. High Q-factors up to 145,000 have been achieved applying wafer level vacuum packaging technology including deposition of titanium thin film getters. The effective reduction of gas damping allows the MEMS actuator to achieve large amplitudes at high oscillation frequencies while driving voltage and power consumption can be minimized. Exemplarily shown is a micro scanner that achieves a total optical scan angle of 86 degrees at a resonant frequency of 30.8 kHz, which fulfills the requirements for HD720 resolution. Furthermore, results of a new wafer based glass-forming technology for fabrication of three dimensionally shaped glass lids with tilted optical windows are presented.

AEKF-SLAM: A New Algorithm for Robotic Underwater Navigation <=SEP=> In this work, we focus on key topics related to underwater Simultaneous Localization and Mapping (SLAM) applications. Moreover, a detailed review of major studies in the literature and our proposed solutions for addressing the problem are presented. The main goal of this paper is the enhancement of the accuracy and robustness of the SLAM-based navigation problem for underwater robotics with low computational costs. Therefore, we present a new method called AEKF-SLAM that employs an Augmented Extended Kalman Filter (AEKF)-based SLAM algorithm. The AEKF-based SLAM approach stores the robot poses and map landmarks in a single state vector, while estimating the state parameters via a recursive and iterative estimation-update process. Hereby, the prediction and update state (which exist as well in the conventional EKF) are complemented by a newly proposed augmentation stage. Applied to underwater robot navigation, the AEKF-SLAM has been compared with the classic and popular FastSLAM 2.0 algorithm. Concerning the dense loop mapping and line mapping experiments, it shows much better performances in map management with respect to landmark addition and removal, which avoid the long-term accumulation of errors and clutters in the created map. Additionally, the underwater robot achieves more precise and efficient self-localization and a mapping of the surrounding landmarks with much lower processing times. Altogether, the presented AEKF-SLAM method achieves reliably map revisiting, and consistent map upgrading on loop closure.

Detection of SQL injection and XSS attacks in three tier web applications <=SEP=> Web applications are used on a large scale worldwide, which handles sensitive personal data of users. With web application that maintains data ranging from as simple as telephone number to as important as bank account information, security is a prime point of concern. With hackers aimed to breakthrough this security using various attacks, we are focusing on SQL injection attacks and XSS attacks. SQL injection attack is very common attack that manipulates the data passing through web application to the database servers through web servers in such a way that it alters or reveals database contents. While Cross Site Scripting (XSS) attacks focuses more on view of the web application and tries to trick users that leads to security breach. We are considering three tier web applications with static and dynamic behavior, for security. Static and dynamic mapping model is created to detect anomalies in the class of SQL Injection and XSS attacks.

Metasurface holograms reaching 80% efficiency. <=SEP=> Surfaces covered by ultrathin plasmonic structures--so-called metasurfaces--have recently been shown to be capable of completely controlling the phase of light, representing a new paradigm for the design of innovative optical elements such as ultrathin flat lenses, directional couplers for surface plasmon polaritons and wave plate vortex beam generation. Among the various types of metasurfaces, geometric metasurfaces, which consist of an array of plasmonic nanorods with spatially varying orientations, have shown superior phase control due to the geometric nature of their phase profile. Metasurfaces have recently been used to make computer-generated holograms, but the hologram efficiency remained too low at visible wavelengths for practical purposes. Here, we report the design and realization of a geometric metasurface hologram reaching diffraction efficiencies of 80% at 825 nm and a broad bandwidth between 630 nm and 1,050 nm. The 16-level-phase computer-generated hologram demonstrated here combines the advantages of a geometric metasurface for the superior control of the phase profile and of reflectarrays for achieving high polarization conversion efficiency. Specifically, the design of the hologram integrates a ground metal plane with a geometric metasurface that enhances the conversion efficiency between the two circular polarization states, leading to high diffraction efficiency without complicating the fabrication process. Because of these advantages, our strategy could be viable for various practical holographic applications.

Traffic management: a holistic approach to memory placement on NUMA systems <=SEP=> NUMA systems are characterized by Non-Uniform Memory Access times, where accessing data in a remote node takes longer than a local access. NUMA hardware has been built since the late 80's, and the operating systems designed for it were optimized for access locality. They co-located memory pages with the threads that accessed them, so as to avoid the cost of remote accesses. Contrary to older systems, modern NUMA hardware has much smaller remote wire delays, and so remote access costs per se are not the main concern for performance, as we discovered in this work. Instead, congestion on memory controllers and interconnects, caused by memory traffic from data-intensive applications, hurts performance a lot more. Because of that, memory placement algorithms must be redesigned to target traffic congestion. This requires an arsenal of techniques that go beyond optimizing locality. In this paper we describe Carrefour, an algorithm that addresses this goal. We implemented Carrefour in Linux and obtained performance improvements of up to 3.6 relative to the default kernel, as well as significant improvements compared to NUMA-aware patchsets available for Linux. Carrefour never hurts performance by more than 4% when memory placement cannot be improved. We present the design of Carrefour, the challenges of implementing it on modern hardware, and draw insights about hardware support that would help optimize system software on future NUMA systems.

Blockchain network slice broker in 5G: Slice leasing in factory of the future use case <=SEP=> 5G Network Slice Broker concept aims to enable mobile virtual network operators, over-the-top providers, and industry vertical market players to request and lease resources from infrastructure providers dynamically according to needs. In the future digital factory, the leasing of resources could also happen autonomously by manufacturing equipment. This paper presents Blockchain Slice Leasing Ledger Concept and analysis of its applicability in the Factory of the Future. The novel concept utilizes 5G Network Slice Broker in a Blockchain to reduce service creation time and enable manufacturing equipment autonomously and dynamically acquire the slice needed for more efficient operations.

Optimizing neighborhood projection with relaxation factor for inextensible cloth simulation <=SEP=> In this paper, we propose a novel method for inextensible cloth simulation. Our method introduces a neighborhood projection optimized with a relaxation factor. The neighborhood projection enforces inextensibility by modifying particle positions with a Jacobi-style iteration, leading to conservation of linear and angular quasi momenta. The relaxation factor is estimated according to the corrections and constraints, and is used to scale the corrections while keeping convergence to a smaller number of iterations. Experimental results demonstrate that our method increases the simulation efficiency, and stably handles inextensible cloth even in overconstrained situations. In addition to the simulation of hanging cloth and draping cloth, the simulated umbrella demonstrates the characters of our method for this type of objects.