Miracle-dz/UniFAR-FTUs huggingface dataset:
A First Course In Business Statistics

Thank you for reading a first course in business statistics. As you may know, people have search numerous times for their favorite novels like this a first course in business statistics, but end up in harmful downloads. Rather than enjoying a good book with a cup of tea in the afternoon, instead they are facing with some malicious bugs inside their computer. a first course in business statistics is available in our book collection an online access to it is set as public so you can get it instantly. Our digital library spans in multiple countries, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the a first course in business statistics is universally compatible with any devices to read.
Content-based Music Access: Combining Audio Features and Semantic Information for Music Search Engines

During the last decade, the Internet has reinvented the music industry. Physical media have evolved towards online products and services. As a consequence of this transition, online music corpora have reached a massive scale and are constantly being enriched with new documents. At the same time, a great quantity of cultural heritage content remains undisclosed because of the lack of metadata to describe and contextualize it. This has created a need for music retrieval and discovery technologies that allow users to interact with all these music repositories efficiently and effectively. Music Information Retrieval (MIR) is the research field that studies methods and tools for improving such interaction as well as access to music documents. Most of the research works in MIR focuses on content-based approaches, which exploit the analysis of the audio signal of a song to extract significant descriptors of the music content. These content descriptors may be processed and used in different application scenarios, such as retrieval, recommendation, dissemination, musicology analysis, and so on. The thesis explores novel automatic (contentbased) methodologies for music retrieval which are based on semantic textual descriptors, acoustic similarity, and a combination of the two; we show empirically how the proposed approaches lead to efficient and competitive solutions with respect to other alternative stateof-the-art strategies. Part of the thesis focuses on music discovery systems, that is search engines where users do not look for a specific song or artist, but may have some general criteria they wish to satisfy. These criteria are commonly expressed in the form of tags, that is short phrases that capture relevant characteristics of the songs, such as genre, instrumentation, emotions, and so on. Because of the scale of current collections, manually assigning tags to songs is becoming an infeasible task; for this reason the automatic tagging of music content is now considered a core challenge in the design of fully functional music retrieval systems. State-ofthe-art content-based systems for music annotation (which are usually called auto-taggers) model the acoustic patterns of the songs associated with each tag in a vocabulary through machine learning approaches. Based on these tag models, auto-taggers generate a vector
Planck-LFI: Instrument Design and Ground Calibration Strategy

The ESA Planck satellite is designed to achieve precision imaging of the Cosmic Microwave Background with an unprecedented combination of angular resolution, sensitivity, spectral range and sky coverage. The Low Frequency Instrument is one of two complementary instruments, and covers 30, 44, and 70 GHz with an array of wideband pseudo-correlation, cryogenic radiometers. Advanced qualification models of the radiometer chains and of the instrument electronics have been manufactured, tested and integrated into the LFI Qualification Model. The main radiometer calibration, RF tuning and performance characterization is carried out at a single radiometer chain level, and then verified at instrument integrated level in dedicated cryofacilities. Here we describe the main requirements and instrument design, and we summarize the radiometer calibration strategy optimised during the qualification activity in view of the LFI Flight Model campaign. Index Terms – please enter
A Proposal of a Wireless Mesh Network "WAPL" and Its Simulation Results

無線メッシュネットワークは有線 LANで接続していたアクセスポイント間をアドホックネットワー クで接続することにより無線 LANのバックボーンインフラを容易に構築することができる. しかし, 従来の無線メッシュネットワークは,アドホックルーティングプロトコルを改造する方式が一般であ り,用途が限定されるという課題があった. また,端末が移動したときにパケットロスが発生すると いう課題があった. 本稿で提案するWAPL(Wireless Access Point Link)は,無線メッシュネッ トワークを実現するための機能を,アドホックルーティングプロトコルから完全に独立させた. その 結果,ルーティングプロトコルを自由に選択し,様々な用途に応用できる. また,無線メッシュネッ トワークに必要なテーブルの生成をオンデマンドで実現するため,制御パケットが通信トラヒックに 与える影響が少ない. さらに近隣の APの通信状況を常時監視しておくことにより,端末が移動した ときのハンドオーバ通知をユニキャストで実現できるようにした. これによりシームレスハンドオー バを確実に行うことができる. 提案方式の有効性を評価するため,既存方式とWAPL を ns-2 のモ ジュールに組み込んで比較を行った. その結果,WAPL の特徴を定量的に示すことができた.
Quantum Clonal Algorithm for Multicast Routing Problem

The bounded shortest multicast algorithm(BSMA)is believed the best constrained multicast algorithm. However,the large computation time restricts its application.As a global optimizing algorithm,genetic algorithm (GA)is applied to solve the problem of multicast more and more.GA has more powerful searching ability than traditional algorithm,however its property of"prematurity"makes it difficult to get a good multicast tree.A quantum clonal algorithm(QCA)to deal with multicast routing problem is presented in this paper,which saliently solves the"prematurity"problem in Genetic based multicast algorithm.Furthermore,the algorithm is accelerated by using quantum crossover.The algorithm has the property of simple realization and flexible control.The simulation results show that QCA has a better performance than BSMA and traditional GA.
Cooperative reconnaissance mission planning for multiple UAVs based on improved PSO algorithm

For multiple UAVs cooperative reconnaissance mission planning problem,the mission planning model was established in fully considering the reconnaissance resolution of the target and time window restraint.An improved particle swarm optimization(PSO) algorithm is proposed,which can make the particle swarm optimization evenly search in the question space,to maintain the rapid convergence of PSO and strengthen the partial search capability of the algorithm.The multiple UAVs cooperative reconnaissance mission plan was established based on the model and algorithm above.In order to satisfy the mission requirements,it has lowest cost and optimal effectiveness in the conditions of platform performance and battlefield constraints.
The Open-Faced Sandwich Adjustment for MCMC Using Estimating Functions

The situation frequently arises where working with the likelihood function is problematic. This can happen for several reasons---perhaps the likelihood is prohibitively computationally expensive, perhaps it lacks some robustness property, or perhaps it is simply not known for the model under consideration. In these cases, it is often possible to specify alternative functions of the parameters and the data that can be maximized to obtain asymptotically normal estimates. However, these scenarios present obvious problems if one is interested in applying Bayesian techniques. Here we describe open-faced sandwich adjustment, a way to incorporate a wide class of non-likelihood objective functions within Bayesian-like models to obtain asymptotically valid parameter estimates and inference via MCMC. Two simulation examples show that the method provides accurate frequentist uncertainty estimates. The open-faced sandwich adjustment is applied to a Poisson spatio-temporal model to analyze an ornithology dataset from the citizen science initiative eBird.
Determination of the thermodynamic temperature between 236 K and 430 K from speed of sound measurements in helium

We report speed of sound measurements in helium at 273.16 K and at eight temperatures in the range between 236 K and 430 K. These results determine the difference (T − T90) between the thermodynamic temperature T and its approximation T90 by the International Temperature Scale of 1990 (ITS-90). The uncertainty of our measurements of (T − T90) spans between a minimum of 0.25 mK near 247 K and a maximum of 0.89 mK at the freezing point of indium (429.75 K) with comparable contributions from the uncertainty of our acoustic determination of T and from the uncertainty of our laboratory realization of ITS-90. On the overlapping temperature ranges these results are consistent with other recent acoustic determinations of (T − T90). We also present evidence that (T − T90) can be determined with comparably small uncertainties by the alternative, time-saving procedure of measuring the speed-of-sound in helium using only a single, judiciously-chosen, pressure on each isotherm.
A Two-Step Integrated Theory of Everything

Two opposing Theory of Everything (TOE) visions are, a Two-Step Integrated TOE consisting of a fundamental physics step followed by a mathematics step, and the prevailing Stephen Hawking’s single mathematics step. The essence of the Two-Step Integrated TOE’s fundamental physics step is the intimate relationships between 20 existing theories. Currently, these 20 theories are independent of each other because physicists in one theory worked independently of physicists in the 19 other theories. Intimate relationships between 7 of the 20 theories (e.g., string, particle creation, inflation, Higgs forces, spontaneous symmetry breaking, dark energy, and dark matter) follow.
Time-Optimal Point Stabilization Control for WIP Vehicles Using Quasi-Convex Optimization and B-Spline Adaptive Interpolation Techniques

This paper addresses a time-optimal point stabilization control for inherent unstable wheeled inverted pendulum (WIP) vehicles using quasi-convex optimization and B-spline adaptive interpolation techniques. First, to handle the difficulty caused by the inherent unstable characteristic, a state feedback control law is introduced to the state-space model deduced with the kinematic coupling relationship between the longitudinal motion and tilt angle of vehicle body. Then, by system discretization, a standard quasi-convex optimization problem is formulated to plan a time-optimal trajectory with various constraints being taken into account, and the optimization problem can be solved by a bisection method combined with solving a series of convex feasibility problems. Next, to obtain the analytic expression of the discrete optimal trajectory, a B-spline interpolation algorithm with adaptive curve refinement is presented based on feature points recognition. Furthermore, as the time-optimal trajectories with analytic expressions, including displacement, velocity, and acceleration trajectories, have been obtained, a proportional–integral–derivative (PID) tracking controller is applied to control the vehicle to track the optimal trajectories and, thus, the time-optimal point stabilization control for the WIP vehicle can be realized. Finally, simulation results of a numerical example is presented to validate the feasibility and effectiveness of the proposed method.
More Than One Replication Study Is Needed for Unambiguous Tests of Replication

The problem of assessing whether experimental results can be replicated is becoming increasingly important in many areas of science. It is often assumed that assessing replication is straightforward: All one needs to do is repeat the study and see whether the results of the original and replication studies agree. This article shows that the statistical test for whether two studies obtain the same effect is smaller than the power of either study to detect an effect in the first place. Thus, unless the original study and the replication study have unusually high power (e.g., power of 98%), a single replication study will not have adequate sensitivity to provide an unambiguous evaluation of replication.
ON THE CONNECTION BETWEEN SHAPE AND STELLAR POPULATION IN EARLY-TYPE GALAXIES

We report on the discovery of a relation between the stellar mass M* of early-type galaxies (hereafter ETGs), their shape, as parameterized by the Sersic index n, and their stellar mass-to-light ratio M*/L. In a three-dimensional log space defined by these variables, the ETGs populate a plane surface with small scatter. This relation tells us that galaxy shape and stellar population are not independent physical variables, a result that must be accounted for by theories of galaxy formation and evolution.
Active Disturbance Rejection Control for Bearingless Induction Motor Based on Hyperbolic Tangent Tracking Differentiator

To meet the operation requirements of a bearingless induction motor (BIM) control system, such as fast speed response, stable suspension, and high disturbance rejection ability, an active disturbance rejection control (ADRC) strategy based on hyperbolic tangent tracking differentiator (HTTD) is proposed. First, based on the air-gap magnetic field decoupling control of the BIM, the uncertainties of the system itself and the load disturbance are regarded as a total disturbance. The extended state observer (ESO) is used to observe the total disturbance in real time. The speed ADRC and suspension ADRC are designed for the torque winding and suspension winding, respectively. Second, the hyperbolic tangent function is applied to the tracking differentiator (TD) of ADRC to simplify its structure. The frequency characteristic curves are analyzed through the sweep-frequency test, and the design parameters are further determined. Finally, this strategy is analyzed with simulation in MATLAB/Simulink and verified on an experimental prototype. Both simulation and experimental results show that the strategy not only has good speed and current characteristics but also reduces the effect of load disturbance on the system and improves the suspension characteristics of the BIM.
HPCG Technical Specification

The High Performance Conjugate Gradient (HPCG) benchmark [2] is a tool for ranking computer systems based on a simple additive Schwarz, symmetric Gauss-Seidel preconditioned conjugate gradient solver. HPCG is similar in its purpose to High Performance Linpack (HPL) currently used to rank systems as part of the Top 500 benchmark [1], but HPCG is intended to better represent how today’s applications perform. In this paper we describe the technical details of HPCG: how it is designed and implemented, what code transformations are permitted and how to interpret and report results.
Steganography

Recently, there has been an increas 86.1 Hiding the Data 1116 86.2 Steganography in Image Files 1116 86.3 A Practical Example of Steganography at Work 1117 86.4 Practical (and Not So Legal) Uses for Steganography 1117 86.5 Defeating Steganography 1118 86.6 Summary 1119 References 1119
Reduced edge‐to‐edge spaced MIMO antenna using parallel coupled line resonator for WLAN applications

In this paper, a pair of parasitic parallel coupled line resonators (PCLR) is printed between the two patches that reduce the mutual coupling in multiple‐input‐multiple‐output (MIMO) antenna system. The proposed design offers reduced edge‐to‐edge spacing of 3.5 mm (0.066λo, λo is the free space wavelength) at 5.7 GHz. The proposed decoupling structure of length 0. 49λo and area 0. 05λo × 0. 49λo consists of a pair of parallel coupled lines, placed between the antenna elements and provides a band stop properties over the desired operating band that helps to eradicate the near coupled field. The PCLR decoupling structure helps to improve the isolation and bandwidth by 16 dB and 0.22 GHz, respectively, at the resonating frequency without any change in radiation characteristics of the MIMO system. Moreover, the antenna system yields a good broadside gain of 6.43 dBi, efficiency 70–85%, with acceptable channel diversity performances over the entire operating band (5.47–5.9 GHz). Good agreements between the simulated and measured results make the proposed design approach suitable for a closely packed MIMO system.
Consensus of One-Sided Lipschitz Multi-Agents Under Input Saturation

This brief investigates a new consensus control methodology for nonlinear one-sided Lipschitz (OSL) multi-agents by considering the input saturation nonlinearity for each agent. Local design approaches are followed for dealing with the constrained consensus control of nonlinear agents by using the OSL dynamics, saturation nonlinearity, and quadratic inner-boundedness property. A region of initial conditions based on the consensus error is revealed, for which the proposed control approach guarantees the consensus error’s convergence to the origin. A new design condition for computation of the consensus protocol gain is developed for the leader-following consensus. Then, simulation results on synchronization of mobile OSL are provided by considering input saturation.
Extending test signal generation using sigma-delta encoding beyond the voltage/amplitude domain

This thesis extends signal generation techniques using sigma-delta encoding principles for synthesizing test signals of all types. In fact, sigma-delta encoding is used to generate repeatable and programmable noise-like signals; phase domain signals such as accurate phase offsets, sinusoidal and Gaussian jitter; and frequency domain signals used for accurate frequency synthesis. For the synthesis of noise-like signals, a Gaussian noise with the desired frequency characteristic is encoded in the voltage/amplitude domain in software using sigma-delta modulation. The resulting sequence of bits is then captured and applied cyclically to an analog filter to reconstruct the noise-like signal with the desired frequency spectrum (e.g. spectrum with a notch for noise-power ratio test). Moreover, a novel bit-to-bit mapping algorithm that converts digital signals to either phase or frequency, is proposed. A digital-to-time conversion (DTC) algorithm is used to convert a digital signal to the phase domain; likewise, a digital-to-frequency conversion (DFC) algorithm is used to convert a digital signal to the frequency domain. The DTC or DFC conversion algorithm is implemented in software together with the sigma-delta encoding process in order to digitally encode a phase or frequency domain signal. The resulting bit sequence with the desired phase or frequency signal is then captured and applied cyclically to an analog time/frequency-mode reconstruction filter. The time/frequency-mode filtering is realized by a PLL structure with the desired phase/frequency domain transfer function. All signal generation schemes (amplitude, noise, phase and frequency) consist of a digital bit-stream with the desired signal encoded and a reconstruction filtering device in the appropriate domain. Using the proposed techniques and circuits, robust, programmable, repeatable, and portable test signals in the amplitude, phase, and frequency domains can be synthesized at low-cost. Although the techniques are demonstrated in a production test environment using a commercial mixed-signal tester, the methodology can be implemented in any testing environment: production test, characterization test, design-for-test (DFT), or built-in self-test (BIST). %%%%Cette these etend les techniques de generation de signal se basant sur les principes d'encodage sigma-delta pour la synthese de tous les types de signaux de test. En effet, l'encodage sigma-delta est utilise pour generer de facon repetable et programmable des signaux ressemblant au bruit; des signaux dans le domaine de la phase, tel que des delais precis et gigue d'horloge sinusoidale et Gaussienne; et des signaux dans le domaine frequentielle utilises pour une synthese precise de frequence.Pour la synthese de signaux ressemblant au bruit, un bruit Gaussien avec le spectre desire est encode dans le domaine voltage/amplitude en software en utilisant la modulation sigma-delta. La sequence de bits resultante est par la suite capturee et appliquee cycliquement a un filtre analogique afin de reconstituer le signal…
SOFIA: A flexible source finder for 3D spectral line data

We introduce SOFIA, a flexible software application for the detection and parametrization of sources in 3D spectral line data sets. SOFIA combines for the first time in a single piece of software a set of new source-finding and parametrization algorithms developed on the way to future H I surveys with ASKAP (WALLABY, DINGO) and APERTIF. It is designed to enable the general use of these new algorithms by the community on a broad range of data sets. The key advantages of SOFIA are the ability to: search for line emission on multiple scales to detect 3D sources in a complete and reliable way, taking into account noise level variations and the presence of artefacts in a data cube; estimate the reliability of individual detections; look for signal in arbitrarily large data cubes using a catalogue of 3D coordinates as a prior; provide a wide range of source parameters and output products which facilitate further analysis by the user. We highlight the modularity of SOFIA, which makes it a flexible package allowing users to select and apply only the algorithms useful for their data and science questions. This modularity makes it also possible to easily expand SOFIA in order to include additional methods as they become available. The full SOFIA distribution, including a dedicated graphical user interface, is publicly available for download.
Musical named entity recognition method

In order to extract musical entities from different Web pages quickly and correctly, this paper presented a hybrid approach based on rules and statistics for Chinese named entity recognition in music domain based on the characteristics in music domain, and implemented the musical named entity recognition system. The experimental results show that this system has a higher precision and recall rate.
Detection of Web-site with Trojan Based on HoneyClient

As client-side attacks occur frequently on the Internet,this article describes the concept of client-side attacks based on local-program vulnerabilities,and focuses on the characteristics of Web Trojan attacks. Then it,clarifi es the basic principles of the client-side honeypot system,and gives an effi cient client-side honeypot system HoneyClient. Then in the light of characteristic analysis on Web Trijan,it presents an effective Web Trojan detection scheme based on HoneyClient. The effi ciency of this scheme is tested and verifi ed. Finally,based on analysis of the results and summary,improvement strategies and development prospects for detection of client-side Web Trojan attacks are provided.
Koszul duality between Higgs and Coulomb categories $\mathcal{O}$

We prove a Koszul duality theorem between the category of weight modules over the quantized Coulomb branch (as defined by Braverman, Finkelberg and Nakajima) attached to a group $G$ and representation $V$ and a category of $G$-equivariant D-modules on the vector space $V$. This is proven by relating both categories to an explicit, combinatorially presented category. These categories are related to generalized categories $\mathcal{O}$ for symplectic singularities. Letting $\mathcal{O}_{\operatorname{Coulomb}}$ and $\mathcal{O}_{\operatorname{Higgs}}$ be these categories for the Coulomb and Higgs branches associated to $V$ and $G$, we obtain a functor $\mathcal{O}_{\operatorname{Coulomb}}^! \to \mathcal{O}_{\operatorname{Higgs}}$ from the Koszul dual of one to the other. This functor is an equivalence in the special cases where the hyperkahler quotient of $T^*V$ by $G$ is a Nakajima quiver variety or smooth hypertoric variety. This includes as special cases the parabolic-singular Koszul duality of category $\mathcal{O}$ in type A, the categorified rank-level duality proposed by Chuang and Miyachi and proven by Shan, Vasserot and Varagnolo, and the hypertoric Koszul duality proven by Braden, Licata, Proudfoot and the author. We also show that this equivalence intertwines so-called twisting and shuffling functors. This together with the duality discussed confirms the most important components of the symplectic duality conjecture of Braden, Licata, Proudfoot and the author in this case.