Miracle-dz/UniFAR-FTUs huggingface dataset:
Techniques for the Calculation of Electroweak Radiative Corrections at the One‐Loop Level and Results for W‐physics at LEP 200

We review the techniques necessary for the calculation of virtual electroweak and soft photonic corrections at the one-loop level. In particular we describe renormalization, calculation of one-loop integrals and evaluation of one-loop Feynman amplitudes. We summarize many explicit results of general relevance. We give the Feynman rules and the explicit form of the counterterms of the electroweak standard model, we list analytical expressions for scalar one-loop integrals and reduction of tensor integrals, we present the decomposition of the invariant matrix element for processes with two external fermions and we give the analytic form of soft photonic corrections. These techniques are applied to physical processes with external W-bosons. We present the full set of analytical formulae and the corresponding numerical results for the decay width of the W-boson and the top quark. We discuss the cross section for the production of W-bosons in e+e− annihilation including all O(x) radiative corrections and finite width effects. Improved Born approximations for these processes are given.
Mathematical methods for uncertainty quanti cation in nonlin-ear multi-physics systems and their numerical simulations

Nonlinear multi-physics systems and their numerical simulations play an important role in many practical engineering elds, and the development of reliable mathematical methods for uncertainty quanti cation of such multi-physics systems is still facing great challenges. In this paper, taking the multi-physics models from detonation mechanics and their numerical solution, we briefly introduce recently developed mathematical meth-ods for uncertainty quanti cation in both complex multi-physics engineering modeling and associated numerical simulation. Also, the strengths and weaknesses of the methods will be discussed, and open problems as well as mathematical challenges will be underlined.
Flexible Green Perovskite Light Emitting Diodes

Flexible perovskite light-emitting diodes (LEDs) have attracted increasing interest to realize ultrathin, light weight, highly conformable, and nonfragile vivid displays. Solution-processed lead halide perovskite offers numerous distinctive characteristics, such as pure emission color, tunable bandgaps, and low fabrication cost. In this paper, green perovskite LEDs (PeLEDs) are fabricated on 50-<inline-formula> <tex-math notation="LaTeX">$\mu \text{m}$ </tex-math></inline-formula> thick polyimide substrates. Using colloidal 2-D formamidinium lead bromide perovskite emitter, the PeLEDs show a high current efficiency (<inline-formula> <tex-math notation="LaTeX">${\eta }_{\mathrm{ CE}}$ </tex-math></inline-formula>) of 5.3 cd <inline-formula> <tex-math notation="LaTeX">$\text{A}^{-1}$ </tex-math></inline-formula> with a peak emission at 529 ± 1 nm and a narrow width of 22.8 nm. The resultant green emission shows color saturation >95%, in the Rec. 2020 standard gamut area. To demonstrate mechanical flexibility, the device functionality is tested by dynamic bending experiments down to 10 mm for up to 5000 cycles, resulting in device lifetime over 36 h in a glove box and a drop of <inline-formula> <tex-math notation="LaTeX">${\eta }_{\mathrm{ CE}}$ </tex-math></inline-formula> and external quantum efficiency (textrtailn <inline-formula> <tex-math notation="LaTeX">$\eta_{\rm ext}$ </tex-math></inline-formula>) as low as 15% and 18%, respectively. For the selective activation of multiple PeLEDs, <inline-formula> <tex-math notation="LaTeX">$7\times 7$ </tex-math></inline-formula> passive arrays on rigid and flexible substrates are demonstrated. Moreover, preliminary results of active matrices show the compatibility of PeLEDs with oxide-based thin-film transistors (TFTs) for display applications.
Optimization Everywhere: Convex, Combinatorial, and Economic

Author(s): Wong, Chiu Wai | Advisor(s): Papadimitriou, Christos H; Raghavendra, Prasad | Abstract: In this thesis we study fundamental problems that arise in optimization and its applications. We present provably efficient algorithms that achieve better running times or approximation guarantees than previously known. Our method draws on the toolkit from convex and combinatorial optimization as well as economics. By intertwining techniques from these disciplines, we are able to make progress on multiple old and new problems, some of which have stood open for many years. Main results of this thesis include the following:Convex Programming: We show how to solve convex programming with an expected O(n log(nR/\epsilon)) evaluations of the separation oracle and additional time O(n^3\log^{O(1)}(nR/\epsilon)). This matches the oracle complexity and improves upon the O(n^{\omega+1}\log(nR/\epsilon)) additional time of the previous fastest algorithm achieved over 25 years ago for the current value of the matrix multiplication constant when R/\epsilon=O(\poly(n)). Submodular Function Minimization: We provide new weakly and strongly polynomial time algorithms with a running time of O(n^{2}\log nM\cdot\text{EO}+n^{3}\log^{O(1)}nM) and O(n^{3}\log^{2}n\cdot\text{EO}+n^{4}\log^{O(1)}n), improving upon the previous best of O((n^{4}\cdot\text{EO}+n^{5})\log M) and O(n^{5}\cdot\text{EO}+n^{6}) respectively. We also provide the first subquadratic time algorithm for computing an approximately optimal solution.Matroid Intersection: We provide new algorithms with a running time of O(nr\mathcal{T_{\text{rank}}}\log n\log(nM)+n^{3}\log^{O(1)}nM) and O(n^{2}\mathcal{T_{\text{ind}}}\log(nM)+n^{3}\log^{O(1)}nM , achieving the first quadratic bound on the query complexity for the independence and rank oracles. In the unweighted case, this is the first improvement since 1986 for independence oracle.Submodular Flow: We obtain a faster weakly polynomial running time of O(n^{2}\log(nCU)\cdot\EO+n^{3}\log^{O(1)}(nCU)), improving upon the previous best of O(mn^{5}\log(nU)\cdot\EO) and O\left(n^{4}h\min\left\{ \log C,\log U\right\} \right) from 15 years ago by a factor of \tilde{O}(n^{4}). Semidefinite Programming: We obtain a running time of \tilde{O}(n(n^{2}+m^{\omega}+S)), improving upon the previous best of \tilde{O}(n(n^{\omega}+m^{\omega}+S)) for the regime S is small.Market Equilibrium: We present the first polynomial time algorithm for computing market equilibrium in an economy with indivisible goods and general buyer valuations having only access to an aggregate demand oracle.Vertex Cover with Hard Capacity: We give a f-approximation algorithm for the minimum unweighted Vertex Cover problem with Hard Capacity constraints on f-hypergraphs This improves over the previous 2f-approximation and is the best possible assuming the unique game conjecture.Network Design for Effective Resistance: We initiate the study of network design for s-t effective resistance. Among other results we present a constant factor approximation by applying classic techniques to a convex quadratic programming relaxation.
Efficient Region-of-Interest Based Adaptive Bit Allocation for 3D-TV Video Transmission over Networks

Due to characteristics of human visual system (HVS), people usually focus more on a specific region named region-of-interest (ROI) of a video frame, rather than watch the whole frame. In addition, ROI-based video coding can also help to effectively reduce the number of encoding bitrates required for video transmission over networks, especially for the 3D-TV transmissions. Therefore, in this work, we propose a novel ROI-based bit allocation (BA) method which can adaptively extract and increase the visual quality of ROI while saving a huge number of encoding bitrates for video data. In the proposed method, we first detect and extract ROI based on the depth information obtained from 3D-TV video coding sequences. Then, based on the extracted ROI, a novel BA scheme is performed to solve the rate-distortion (R-D) optimization problem, in which the higher priority bitrates are adaptively assigned to ROI while the total encoding bitrates of video frames are kept satisfying all constraints required by the R-D optimization. Experimental results show that the proposed method provides much better higher peak signal-to-noise ratio (PSNR) as compared to other conventional BA methods.
Cosmic voids, spatial algorithms and data structures

Cosmic voids are regions with low density in the large scale structure of the universe. These cosmic structures are discovered from simulated or observational galaxy catalogs. In this work, we expose a slight overview of the importance of cosmic voids in cosmology and the type of algorithms used for its discovery in data sets. The octrees, hierarchical spatial data structures, are proposed as an available option to find cosmic voids in galaxy catalogs.
Software based deployment of encryption keys in wireless sensor networks.

Sensor networks are just in their infancy. Their use will continue to grow as the technology becomes cheaper and more efficient. A current shortcoming with sensor networks is the inability to efficiently provide secure communications. As sensor networks are deployed to monitor and control systems, the security of communications will become a more important. This thesis proposes a new approach to key establishment and renewal through the use of point-to-point keys and software verification and validation to ensure the integrity of two nodes. Sensor networks exist on limited resources, so power efficiency is a concern. The proposed protocol allows for the use of small keys instead of large pre-distributed keys. This thesis explores the design and implementation of a new point-to-point key generation and renewal algorithm. The main contribution is the development of an algorithm that utilizes a software integrity check to ensure the validity of a node. The thesis also utilizes a simulated sensor network to test and validate the new software algorithm.
SUDBC: a Quickly Clustering Algorithm Based on Spatial Unit Density

With the rapid increase of data scale in databases,it is required that clustering algorithms have high efficiency,extensibility,ability to deal with arbitrary shapes of clusters,and non-sensitivity to noise data.In this paper,we propose a quickly clustering algorithm SUDBC based on spatial unit density. It first partitions the data space to be clustered into a set of spatial units. Then,it merges all neighbor units into the same clusters based on the spatial unit density.Therefore,the algorithm can deal with the large scalability of points.Experimental results confirm that SUDBC algorithm has the feature of dealing with arbitrary shape of data and non-sensitivity to noise data.
Developments in Mapping and Localization for Mobile Robots Using Bayesian Methods

This article provides an overview of developments in mapping and localization for mobile robots using Bayesian methods, basing in Bayes method. During the past nine years the literature of these issues has grown tremendously in relation to this is broadly possible to show the advancements in these developments. The purpose of this article is to afford for non-specialists in the field a good presentation with various models, problems, approaches, and results into a proper context thereof and for specialists a better perception about the field emphasizing in Simultaneous Localization and Mapping.
A Comparative Study on Resilient Observer Design; Lipschitz and One-sided Lipschitz Fractional Order Systems’ State Estimation

frequency distribution results in H nonlinear resilient observer design in the presence of an exogenous disturbance input and observer's gain perturbation. Since one-sided Lipschitz class of nonlinear systems encompasses a wide range of nonlinearities including the Lipschitz class, It is shown that the proposed observer design based on the one-sided Lipschitz systems has simpler LMI and it can tolerate a wide range of changes in gains perturbation and exogenous disturbances compared to recent research findings for the counterpart Lipschitz systems. Finally, a financial fractional order system with Lipschitz nonlinearity is presented as an example, which can illustrate the effectiveness of the proposed one-sided Lipschitz observer design and compare the feasible region of input disturbance and observer’s gain for both Lipschitz and one-sided Lipschitz observer design.
TFSIW-Excited Dual-Polarized Array Antenna With 30° Beam-Pointing for Millimeter-Wave Applications

This communication presents a dual-polarized series-fed array antenna with 30° beam-pointing for millimeter-wave (MM-Wave) applications. The 45° and −45° polarized subarrays share the aperture in an interdigital shape. The spacing between subarrays with the same polarization orientation is set to <inline-formula> <tex-math notation="LaTeX">$0.56\lambda _{0}$ </tex-math></inline-formula> through the use of narrower T-type folded substrate integrated waveguide (TFSIW) instead of substrate integrated waveguide (SIW). The substrate integrated coaxial line (SICL) is adopted to design the array feeding network. To validate the proposed design, a <inline-formula> <tex-math notation="LaTeX">$4 \times 6$ </tex-math></inline-formula> (single polarization) dual-polarized array antenna operating at 28 GHz with 30° beam-pointing is fabricated. Based on the measurement, the return losses are lower than −10 dB from 27.5 to 28.5 GHz, the isolations between the two polarization ports are higher than 30.0 dB in the frequencies mentioned above, the maximum gain at the center frequency is 15.7 dBi, and the cross-polarization levels are lower than −18.5 dB. The proposed antenna only needs one-step processing with the standard PCB technology without additional stitching assembly. Simulated and measured results of the proposed antennas were compared.
Wide Angle Beam Steerable High Gain Flat Top Beam Antenna Using Graded Index Metasurface Lens

This paper presents a beam steerable low-profile lens antenna with a flat top wide beam and a high gain operating at 10.10 GHz. It consists of a graded index metasurface (GIMS) lens placed on the top of a microstrip patch antenna (MPA) radiator. An ultrathin linear graded index metasurface (LGIMS) and a radial graded index metasurface (RGIMS) lens were designed for the magnitude and phase transformation of the radiated beam from the microwave radiator. First, an LGIMS lens antenna was designed by placing an LGIMS on the top of an MPA radiator at an optimum height. A maximum measured gain of 16.37 dBi indicating a maximum gain enhancement of 11.50 dB with beam steering in a conical plane with a vertex angle of 84° was observed. Next, a flat top beam (FTB) antenna with a stable gain band was designed by placing an RGIMS on top of an LGIMS lens antenna. The measured peak gain of 14.82 dBi with an FTB pattern having a 1 dB gain variation range of about 96° is observed. Furthermore, the movement of the LGIMS and the RGIMS on top of the radiator results in continuous beam scanning with a maximum gain variation of 1 dB in a conical plane with a vertex angle of about 100°. A maximum gain of 14.82 dBi with a maximum gain enhancement of 10.30 dB at 10.15 GHz was obtained due to the linear and angular movement of the LGIMS and the RGIMS in the FTB antenna. The simulated and measured results are in good agreement.
Macros that Reach Out and Touch Somewhere

By providing a macro facility, languages such as Scheme and Common Lisp allow users to define new special forms as local, syntactic program transformations. This allows users to abstract away what would otherwise be repetitive or cumbersome syntax. One limitation to the power of macro facilities is that only textually local transformations can be defined—the user cannot, for example, define a delay macro which automatically inserts calls to force at all required points in the program. In this paper, we present a new kind of macro, called a data path macro, in which transformations can take place at any point along the dataflow path that includes the macro invocation. The heart of the data path macro facility is a dataflow analysis mechanism that allows the user to easily request powerful data flow analyses.
Study of the brain connectivity in an Immersive Space

Virtual reality is a powerful tool for scientific visualization. When the amount and complexity of the visualized data grows, standard visualization applications on desktop computers become inefficient. In this paper we present the use of a CAVE like VR facility in a neuroscientific context. The aim is to have a better understanding of the brain connectivity. Both anatomical and functional data are attached to a mesh representing the brain surface. Specific tools developed for this study and the way we used them are presented below, emphasizing drawbacks and advantages of virtual reality in a scientific visualization context.
Novel and simple description for smooth transition from $\alpha$ cluster to $jj$-coupling shell model wave function

We propose an improved version of Antisymmetrized Quasi-Cluster Model (AQCM) to describe a smooth transition from the $\alpha$-cluster wave function to the $jj$-coupling shell model wave function and apply it to the ground state of $^{12}$C. The cluster-shell transition in $^{12}$C is characterized in AQCM by only two parameters: $R$ representing the distance between $\alpha$ clusters and the center of mass, and $\Lambda$ describing the break of $\alpha$ clusters. The optimal AQCM wave function for the ground state of $^{12}$C is an intermediate state between the three-$\alpha$ cluster state and the shell model state with the $p_{3/2}$ subshell closure configuration. The result is consistent with that of the Antisymmetrized Molecular Dynamics (AMD), and the optimal AQCM wave function quantitatively agrees with the AMD one, although the number of degrees of freedom in AQCM is significantly fewer.
Data sets for the Frontiers in Materials article entitled "Structure of the intermediate phase glasses GeSe3 and GeSe4: The deployment of neutron diffraction with isotope substitution"

Data sets used to prepare Figures 1-13 in the Frontiers in Materials article entitled "Structure of the intermediate phase glasses GeSe3 and GeSe4: The deployment of neutron diffraction with isotope substitution. " The figures show (i) the measured neutron diffraction results and (ii) a comparison of several of the neutron diffraction results with those obtained from first principles molecular dynamics simulations. The data sets were created using the methodology described in the manuscript. The files are labelled according to the figure numbers. Each of the plots was drawn using QtGrace (https://sourceforge.net/projects/qtgrace/). The data set corresponding to a plotted curve within an QtGrace file can be identified by clicking on that curve. Once a data set has been identified, it can be exported in ASCII format via the DATA tab. The units for each axis are identified on the plots. An explanation of each figure is documented in the README file, and in the published paper.
The Rayleigh paired comparison model with Bayesian analysis

A paired comparison (PC) method is more reliable to rank or compare more than two items/ objects at the same time. It is a welldeveloped method of ordering attributes or characteristics of a given set of items.The PC model is developed using Rayleigh random variables on the basis of Stern's criteria [17]. The Rayleigh PC model is analyzed in Bayesian framework using non-informative (Jeffreys and Uniform) priors. The Bayesian inference of the developed model is compared with existing the Bradley-Terry model. The preference and predictive probabilities for current and future comparisons are calculated. The posterior probabilities of hypotheses for comparing two parameters are evaluated. The Bayesian 95% credible interval are calculated.Appropriateness of the model is also examined. Graphs of marginal posterior distributions of the parameters are drawn. The Bayesian analysis is performed using real life data sets.
Realization of Communication among Clients under B/S Using Ajax

The communication among the clients can be easily realized using the Socket programming or middleware of message queue in the mode of the client/server.But it is difficult to be realized in the mode of browser/server,since the changing of clients which is browser can easily be sent to server while the changing of server could not be sent to the clients.The clients can only be modified by sending the request of HTTP again in the mode of browser/server.Traditional method is to refresh the client at regular intervals.It must lead to continuously refreshing and loading.It is a waste of time and bandwidth.In this paper,a novel method of combining the characteristic of asynchronous communication of Ajax and the strong function of Jsp/Servlet is proposed.It can achieve the high quality of synchronization between the clients and server,and realize the communication among clients by web server.The experiments reveal its applicability.
Multichannel Blind Image Restoration

In order to well utilize the information in the observed images and the complementarities between the information to improve the results of the image restoration,this paper proposed a blind restoration algorithm for multichannel images.Firstly,the prior models of the original image,point spread functions and the observed images were reconstructed,from which the prior distributions of them were obtained;secondly,the Gamma distribution was used to describe the unknown model parameters;finally,based on the inference of the max posterior probability,the optimal original image and the point spread functions were estimated using the evidence analysis method.Compared with the single channel algorithms,the experiments show that the multichannel blind image restoration can obtain better results.Meanwhile,the proposed algorithm shows competitive performance on restored results compared with some state-of-the-art algorithms.
PROTOTYPE ROBOT PENUNJUK LOKASI BIDANG BUKU BERBASIS LINE FOLLOWER PERPUSTAKAAN TANGERANG

Perpustakaan merupakan gudang ilmu pengetahuan sekaligus menjadi tempat rekreasi yang bermanfaat bagi semua kalangan. Di dalam perpustakaan terdapat banyak koleksi buku yang dapat digunakan untuk menambah wawasan dan ilmu pengetahuan. Seperti hal nya perpustakaan lain, perpustakaan Kota Tangerang memiliki koleksi buku yang cukup lengkap. Perkembangan sistem komputer secara signifikan telah menjadi kebutuhan dalam meningkatkan mutu pelayanan dan fasilitas yang diberikan kepada pengunjung. Penerapan dari perkembangan sistem komputer berupa robot yang akan mengantarkan pengunjung ke lokasi buku diharapkan akan meningkatkan mutu pelayanan pada Perpustakaan Kota Tangerang. Robot bekerja berdasarkan prinsip line follower yang menggunakan 4 buah sensor garis yang akan diproses oleh sebuah mikrokontroler arduino uno. Selain itu robot dilengkapi dengan sensor ultrasonik agar dalam proses berjalan robot tidak menabrak objek yang menghalanginya. Dengan adanya robot ini akan mempermudah pengunjung dalam mencari lokasi buku, serta membantu meningkatkan mutu pelayanan akan fasilitas yang diberikan pada pengunjung. Kata Kunci: Perpustakaan, Mikrokontroler, Arduino Uno.
Anomaly Diagnosis Analysis for Running Meter Based on BP Neural Network

Smart meters is important equipment in the electric information acquisition system, it is the terminal equipment on the user side to realize information collection, energy metering and other functions. However, because of maintenance workload greatly, artificial detection can’t meet the need. In this paper, anomaly diagnosis analysis for running meter is proposed, by dealing with data collected, setting up diagnosis model, realize maintain for smart meter. Keywords-BP neural network; electric meter; anomaly diagnosis