Miracle-dz/UniFAR-FTUs huggingface dataset:
Learning to Denoise and Decode: A Novel Residual Neural Network Decoder for Polar Codes

Polar codes are known as the first capacity-achievable codes with low encoding and decoding complexity. The sequential decoding nature of traditional polar decoding algorithms such as successive cancellation (SC) results in high decoding latency, which is not suitable for services that require high reliability and low latency. Deep learning for decoding, referred to as neural network decoder (NND), has shown strong competitiveness because of its non-iterative and full-parallel feature. Whereas, the bit-error-rate (BER) performance of NND is still not satisfactory. In this paper, we first propose a residual learning denoiser (RLD) for polar codes. The RLD can remarkably improve the signal-to-noise ratio (SNR) and reduce the symbol-error-rate (SER) of received symbols. In order to decode polar codes more efficiently, we subsequently propose a residual neural network decoder (RNND) for polar codes. Different from the traditional pure-NND (PNND) which directly uses neural network for decoding received symbols, the proposed RNND concatenates a RLD used for denoising and a NND used for decoding. We provide a novel multi-task learning (MTL) strategy to jointly optimize the denoiser and decoder, and find that the denoising gain of Joint-RLD is more significant than the Independent-RLD. Numerical results show that the proposed RNND outperforms its counterpart PNND with regard to the BER performance. In addition, the optimal RNND(MLP-MLP) approaches the traditional SC decoding performance, while saving more than one hundred times of computation time. Eventually, scalability of the RNND to longer polar codes as well as LDPC codes further demonstrates the superiority of our proposed scheme.
Improving image acquirement settings for cone-beam computed tomography

Volumetric discrepancies between cone-beam computed tomography (CBCT) and planning CT image sets were investigated for both prone and supine breast radiotherapy. A phantom study was performed in order to examine the artefacts’ dependency on CBCT acquisition parameters and to minimize their effect on patient set-up accuracy. At the Ghent University Hospital (GUH) radiotherapy division, bosom malignancy patients are treated with either inclined or recumbent force regulated radiotherapy. Day by day kilovoltage cone-pillar processed tomography (CBCT) pictures are obtained preceding treatment, keeping in mind the end goal to redress for persistent situating blunders. Any required set-up revisions are processed by unbendingly registrat-ing the CBCT to the arranging CT pictures. These enrollments, how-at any point, uncovered some volumetric inconsistencies between the CBCT and arranging CT picture sets. Contrasted with arranging CT pictures, CBCT pictures showed either tissue deficiencies or tissue overabundances in various anatomical districts. Since these relics show up from the main treatment division, they can't be credited to anatomi-cal changes like bosom oedema. These volumetric inconsistencies and their reliance on CBCT procurement parameters are investi-gated utilizing two human polystyrene apparitions.
Stationary Consensus Control of a Class of High-Order Uncertain Nonlinear Agents With Communication Delays

Achieving consensus over a class of high-order nonlinear multiagent systems in the Brunovsky form under directed networks is studied. By introducing coupled sliding-mode controllers, a robust protocol is addressed under which agents achieve agreement upon their positions in the presence of model uncertainties. The main contribution of this correspondence paper compared with similar existing studies is to guarantee achieving consensus in networks of agents in the presence of uncertain nonlinearities in agents models. Moreover, it is shown that consensus is achieved in the presence of any bounded constant communication delays. The results are validated by a numerical example.
A CD probe with a tailored cantilever for 3D-AFM measurement

A critical dimensional (CD) probe, such as a boot shaped probe, is widely used for measuring the sidewall profiles of nanostructures in atomic force microscopy (AFM). However, conventional CD probes usually have high spring constants that restrict their ability to operate in critical dimension scanning modes. Furthermore, the flexure spring constant of the tip is much smaller than the torsion spring constant of the cantilever, which probably makes the sidewall measurement unstable. Here, we proposed a method of tailoring the probe where the cantilever was trimmed to reduce the spring constant. The simulation results, using a finite element method (FEM), illustrated that both the flexure and torsion spring constants decreased nearly ten times. Meanwhile, the torsional resonant frequency decreased to below 1 MHz, which could benefit the torsional oscillation scanning. By using a focused ion beam (FIB), a CD probe with a rectangular cantilever was reprocessed. It was mounted to a home-built three-dimensional AFM system (3D-AFM), and had the flexure and torsion sensitivities precisely calibrated. The ratio of the flexure sensitivity to torsion sensitivity showed good accordance with the simulation results. Additionally, a grating standard sample was measured using the tailored probe under a modified step-in scanning mode, and the error due to torsional deformation of the tip was compensated. The measurement results demonstrated the validity of the tailored CD probe in 3D metrology.
Zygote : A Differentiable Programming System to Bridge Machine Learning and Scientific Computing

Scientific computing is increasingly incorporating the advancements in machine learning and the ability to work with large amounts of data. At the same time, machine learning models are becoming increasingly sophisticated and exhibit many features often seen in scientific computing, stressing the capabilities of machine learning frameworks. Just as the disciplines of scientific computing and machine learning have shared common underlying infrastructure in the form of numerical linear algebra, we now have the opportunity to further share new computational infrastructure, and thus ideas, in the form of Differentiable Programming. We describe Zygote, a Differentiable Programming (∂P ) system that is able to take gradients of general program structures. We implement this system in the Julia programming language. Our system supports almost all language constructs (control flow, recursion, mutation, etc.) and compiles high-performance code without requiring any user intervention or refactoring to stage computations. This enables an expressive programming model for deep learning, but more importantly, it enables us to incorporate a large ecosystem of libraries in our models in a straightforward way. We discuss our approach to automatic differentiation, including its support for advanced techniques such as mixed-mode, complex and checkpointed differentiation, and present several examples of differentiating programs.
The Open Journal of Occupational Therapy Assessing Functional Impairment in Individuals with Mild Cognitive Impairment Credentials Display Recommended Citation

Part of the Occupational Therapy Commons Copyright transfer agreements are not obtained by The Open Journal of Occupational Therapy (OJOT). Reprint permission for this article should be obtained from the corresponding author(s). Click here to view our open access statement regarding user rights and distribution of this article. (2016) "Assessing functional impairment in individuals with mild cognitive impairment," The Open
Data-driven sliding mode control: a new approach based on optimization

ABSTRACT In this paper a model free sliding mode controller (SMC) based on a novel reaching law for SISO nonlinear systems is provided. The novelty of the work lies in the approach used to achieve the reaching law. The proposed reaching law is more general than those proposed in recent works. Naturally, it is consistent with the proposed control law, which is composed of an optimal term and an exponential switching term. A proper cost function forces the sliding variable and its derivative to vanish. The switching part consists of an exponential term, which decreases the quasi-sliding domain. It is shown analytically that the sliding function enters and remains in the quasi-sliding bound. In addition, the UUB stability of error is rigorously proved. Computer simulation in different scenarios and comparison to the simple model free SMC and model free adaptive control methods has been provided to show better performance of the proposed method, compared with the mentioned methods.
A Dynkin Game on Assets with Incomplete Information on the Return

This paper studies a two-player zero-sum Dynkin game arising from pricing an option on an asset whose rate of return is unknown to both players. Using filtering techniques, we first reduce the problem to a zero-sum Dynkin game on a bidimensional diffusion (X,Y). Then we characterize the existence of a Nash equilibrium in pure strategies in which each player stops at the hitting time of (X,Y) to a set with a moving boundary. A detailed description of the stopping sets for the two players is provided along with global C1 regularity of the value function.
The Efficacy of Shield under Different Threat Models Paper Type : Appraisal Paper of Existing Method

In this appraisal paper, we evaluate the efficacy of Shield [1], a compression-based defense framework for countering adversarial attacks on image classificationmodels, which was published at KDD 2018. Here, we consider alternative threat models not studied in the original work, where we assume that an adaptive adversary is aware of the ensemble defense approach, the defensive pre-processing, and the architecture andweights of themodels used in the ensemble. We define scenarios with varying levels of threat and empirically analyze the proposed defense by varying the degree of information available to the attacker, spanning from a full white-box attack to the gray-box threat model described in the original work. To evaluate the robustness of the defense against an adaptive attacker, we consider the targeted-attack success rate of the Projected Gradient Descent (PGD) attack, which is a strong gradient-based adversarial attack proposed in adversarial machine learning research. We also experiment with training the Shield ensemble from scratch, which is different from re-training using a pre-trained model as done in the original work. We find that the targeted PGD attack has a success rate of 64.3% against the original Shield ensemble in the full white box scenario, but this drops to 48.9% if the models used in the ensemble are trained from scratch instead of being retrained. Our experiments further reveal that an ensemble whose models are re-trained indeed have higher correlation in the cosine similarity space, and models that are trained from scratch are less vulnerable to targeted attacks in the white-box and gray-box scenarios. ACM Reference format: Cory Cornelius, Nilaksh Das, Shang-Tse Chen, Li Chen, Michael E. Kounavis, and Duen Horng (Polo) Chau. 2019. The Efficacy of Shield under Different Threat Models. In Proceedings of KDD 2019Workshop on Learning andMining for Cybersecurity (LEMINCS’19), Anchorage, Alaska, United States, August 5th, 2019 (LEMINCS @ KDD’19), 7 pages.
Focus Is All You Need : Loss Functions For Event-based Vision — Supplementary Material —

To measure the “thickness” of the edges of the IWE (e.g., Fig. 3a), one could count the number of pixels with count of warped events above a threshold, e.g., one event. However, this is brittle since it depends on this arbitrary threshold. We propose to define the above-mentioned edge thickness or “area” of an edge-like image like the IWE (3) in a more sensible way as a weighted sum of the interior of the level sets of the image, as we show next.
Laboratory Evaluation of Asphalt Binder Rutting, Fracture, and Adhesion Tests

The current performance grading (PG) specification for asphalt binders was developed based on the Strategic Highway Research Program (SHRP) and is based primarily on the study of unmodified asphalt binders. Over the years, experience has proven that the PG grading system, while good for ensuring overall quality, fails in some cases to predict rutting and cracking performance, particularly as it applies to softer but highly modified binders. Therefore, it is necessary to improve current asphalt binders performance parameters and associated specification limits, especially for modified binders. This report documents the laboratory evaluation of several new tests for rutting, fatigue, and adhesion property of asphalt binders, including the multiple stress creep and recovery (MSCR) test, linear amplitude sweep (LAS) test, double edged notched tension (DENT) test, elastic recovery test, pull-off test, pneumatic adhesion tensile testing instrument (PATTI), dynamic mechanical analyzer (DMA) test and surface energy test. It was found that the MSCR test and associated specification works better than the current G*/sinð-based PG specification, especially for those highly modified asphalt binders (such as PG64-34).
Homogenization of very rough two-dimensional interfaces separating two dissimilar poroelastic solids with time-harmonic motions

The homogenization of a very rough three-dimensional interface separating two dissimilar isotropic poroelastic solids with time-harmonic motions was considered by Gilbert and Ou (Acoustic wave propagation in a composite of two different poroelastic materials with a very rough periodic interface: A homogenization approach. Int J Multiscale Comput Eng 2003; 1(4): 431–440). The homogenized equations have been derived; however, they are still in implicit form. In this paper, the homogenization of a very rough two-dimensional interface separating two dissimilar generally anisotropic poroelastic solids with time-harmonic motions is investigated. The main aim of the investigation is to derive homogenized equations in explicit form. By employing the homogenization method, along with the matrix formulation of the poroelasticity theory, the explicit homogenized equations have been derived. Since these equations are totally explicit, they are very useful in solving practical problems. As an example proving this, the reflection and transmission of SH waves at a very rough interface of the tooth-comb type is considered. The closed-form analytical expressions of the reflection and transmission coefficients are obtained. Based on these expressions, the dependence of the reflection and transmission coefficients on some parameters is examined numerically.
Measurements and modelling of I 2 , IO, OIO, BrO and NO 3 in the mid-latitude marine boundary layer

Time series observations of molecular iodine (I2), iodine oxides (IO, OIO), bromine oxide (BrO), and the ni- trate radical (NO3) in the mid-latitude coastal marine bound- ary layer (MBL) are reported. Measurements were made us- ing a new long-path DOAS instrument during a summertime campaign at Mace Head on the west coast of Ireland. I2 was detected using the B 3 5(0 + ) X 1 6 + electronic transition be- tween 535 and 575 nm. The I2 mixing ratio was found to vary from below the detection limit ( 5 ppt) up to a night- time maximum of 93 ppt. Along with I2, observations of IO, OIO and NO3 were also made during the night. Surprisingly, IO and OIO were detected at mixing ratios up to 2.5 and 10.8 ppt, respectively. A model is employed to show that the reaction between I2 and NO3 is the likely nighttime source of these radicals. The BrO mixing ratio varied from below the detection limit at night ( 1 ppt) to a maximum of 6 ppt in the first hours after sunrise. A bromine chemistry model is used to simulate the diurnal behaviour of the BrO radical, demon- strating the importance of halogen recycling through sea-salt aerosol. In the same campaign a zenith sky DOAS was em- ployed to determine the column density variation of NO3 as a function of solar zenith angle (SZA) during sunrise, from which vertical profiles of NO 3 through the troposphere were obtained. On several occasions a positive gradient of NO3 was observed over the first 2 km, possibly due to dimethyl sulphide (DMS) removing NO3 at the ocean surface.
Mode Seeking Generative Adversarial Networks for Diverse Image Synthesis Supplementary Material 1

In this supplementary material, we first present the implementation details of applying the proposed mode seeking regularization scheme on different baseline models. Second, we detail the procedure for using different quantitative evaluation metrics on various tasks. Third, we conduct an ablation study to analyze the impact of the proposed regularization term Lms by varying the corresponding weight λms for the training, and provide some results on the design choice of the distance metric. Then, the computational overheads are calculated to validate the efficiency of the proposed method. Finally, we demonstrate additional qualitative results to complement the paper.
Recursive identification of time-varying non-linear cascade systems with static input and dynamic output non-linearities

The paper deals with the recursive identification of time-varying non-linear dynamic systems using three-block cascade models with non-linear static, linear dynamic and non-linear dynamic blocks. These models are appropriate for systems with both actuator and sensor non-linearities. Multiple application of a decomposition technique provides special expressions for the corresponding non-linear model description that are linear in parameters. A modified recursive least-squares-based algorithm is used for estimation of the time-varying input polynomial and output backlash parameters. Simulation studies show the feasibility of proposed approach to estimate the model parameters and track their changes.
Contribution of transmission in HIV-positive men who have sex with men to evolving epidemics of sexually transmitted infections in England : an analysis using multiple data sources , 2009 – 2013

Citation style for this article: Malek R, Mitchell H, Furegato M, Simms I, Mohammed H, Nardone A, Hughes G. Contribution of transmission in HIV-positive men who have sex with men to evolving epidemics of sexually transmitted infections in England: an analysis using multiple data sources, 2009–2013. Euro Surveill. 2015;20(15):pii=21093. Available online: http://www.eurosurveillance. org/ViewArticle.aspx? ArticleId=21093
A COMPREHENSIVE PERFORMANCE EVALUATION OF DATA STORES IN CONTEXT WITH APPLICATION MANAGEMENT TOOLS

As of 2012, limits on the size of data sets that are feasible to process in a reasonable amount of time were on the order of exabytes of data.business informatics. The world's technological per-capita capacity to store information has roughly doubled every 40 months since the 1980s, as of 2012, every day 2.5 quintillion (2.5×10 18 ) bytes of data were created and it is required to analyze a vast amount of data. A number of companies have developed sophisticated monitoring tools for data analysis. For specialized APIs, can monitor single invocations. To maximize the benefit of data monitoring, the data has to be stored for an extended period of time for ulterior analysis. This new wave of big data analytics imposes new challenges especially for the application performance monitoring systems. The monitoring data has to be stored in a system that can sustain the high data rates and at the same time enable an up-to-date view of the underlying infrastructure. With the advent of modern key-value stores, a variety of data storage systems have emerged that are built with a focus on scalability and high data rates as predominant in this monitoring use case. In this work, we present our experience and a comprehensive performance evaluation of six modern (open-source) data stores in the context of application performance monitoring. We evaluated these systems with data and workloads that can be found in application performance monitoring, as well as, on-line advertisement, power monitoring, and many other use cases. We present our insights not only as performance results but also as lessons learned and our experience relating to the setup and configuration complexity of these data stores in an industry setting.
Implementation and Evaluation of Primal and Dual Simplex Methods with Different Pivot-Selection Techniques in the LPBench Environment A Research Report

In this study we implement Primal and Dual Simplex methods with different pivot-selection techniques, namely, the Non-Basic Gradient, Bland’s, the Least-Recently Considered (LRC), the Greatest-Increment and the Steepest-Edge. We present the derivation of the Simplex method from an analytic and geometric viewpoint. We provide derivation and interpretation of the five different pivot selection methods as it realtes to the geometry of the convex polytopes. We perform several experiments and evaluate their performance with respect to the number of pivot iterations until optimal solution, and computational effort for each iteration. There is a trade-off between the number of iterations and the cost per iteration in the solution of LP problem instances. The Bland’s method requires the shortest time per iteration but it usually requires many more iterations. The Non-Basic Gradient method performs comparably to the LRC, but the later one is more insensitive to degenerate pivots, and thus, it leads to fewer iterations in those cases. The Greatest-Increment increment has the most computational intensive iterations but it usually solves LP instances with fewer pivots than the previously mentioned three ones. The computation cost per iteration in the Steepest-Edge is lower than that of the Greatest-Increment but higher than those of the other three methods. The Steepest-Edge method requires fewer iterations than all other pivot selection methods that we investigated in this study. All the experiments are carried out in the LPBench linear programming environment, a home-grown system designed for the development and evaluation of pivot selection algorithms for the Simplex method. Index Terms Bland’s Method, Greatest-Increment, Linear Programming, Least-Recently Considered, Matrix Computations, Non-Basic Gradient, Pivot Selection Methods, Primal/Dual Simplex Algorithm, Tableau.
The order of things : an archaeology of the human sciences

Publishers Note, Forward to the English Edition, Preface Part I: 1.Las Meninas 2.The Prose of the World: I The Four Similitudes, II Signatures, III The Limits of the World, IV the Writing of Things, V The Being of Language 3.Representing: I Don Quixote, II Order, III The Representation of the Sign, IV Duplicated Representation, V The Imagination of Resemblance, VI Mathesis and 'Taxinoma' 4. Speaking: I Criticism and Commentary, II General Grammar, III The Theory of the Verb, IV Articulation, V Designation, VI Derivation, VII The Quadrilateral Language 5. Classifying: I What the Historians say, II Natural History, III Structure, IV Character, V Continuity and Catastrophe, VI Monsters and Fossils, VII The Discourse of Nature 6. Exchanging: I The Analysis of wealth, II Money and Prices, III Mercantilism, IV The Pledge and the Price, V The Creation of Value, VI Utility, VII General Table, VIII Desire and Representation Part 2 7. The Limits of Representation: I The Age of History, II The Measure of Labour, III The Organic Structure of Beings, IV Word Inflection, V Ideology and Criticism, VI Objective Synthesis 8. Labour, life, Language: I The New Empiricities, II Ricardo, III Cuvier, IV Bopp, V Language Became Object 9. Man and His Doubles: I The return of Language, II The Place of the King, III The Analytic of Finitude, IV The Empirical and the Transcendental, V The 'Cogito' and the Unthought, VI The Retreat and the Return of the Origin, VII Discourse and Man's Being, VIII The Anthropological Sleep 10. The Human Sciences: I The Three Faces of Knowledge, II The Form of the Human Sciences, III The Three Models, IV History, V Psychoanalysis and Ethnology, VI In Conclusion