Model: sarwin/rp-embed-max
Author: sarwin
Pipeline: sentence-similarity
Library: sentence-transformers
Tags: sentence-transformers, safetensors, bert, sentence-similarity, feature-extraction, generated_from_trainer, dataset_size:730454, loss:MultipleNegativesRankingLoss, arxiv:1908.10084, arxiv:1705.00652, base_model:nreimers/MiniLM-L6-H384-uncased, base_model:finetune:nreimers/MiniLM-L6-H384-uncased, text-embeddings-inference, endpoints_compatible, region:us
Base models (finetune): id: nreimers/MiniLM-L6-H384-uncased
Card metadata: base_model: nreimers/MiniLM-L6-H384-uncased
library_name: sentence-transformers
pipeline_tag: sentence-similarity
tags: sentence-transformers, sentence-similarity, feature-extraction, generated_from_trainer, dataset_size:730454, loss:MultipleNegativesRankingLoss
widget: source_sentence: Continuous finite-time control approach for series elastic actuator
sentences: Distributed coordination is difficult, especially when the system may suffer intrusions that corrupt some component processes. We introduce the abstraction of a failure detector that a process can use to (imperfectly) detect the corruption (Byzantine failure) of another process. In general, our failure detectors can be unreliable, both by reporting a correct process to be faulty or by reporting a faulty process to be correct. However, we show that if these detectors satisfy certain plausible properties, then the well known distributed consensus problem can be solved. We also present a randomized protocol using failure detectors that solves the consensus problem if either the requisite properties of failure detectors hold or if certain highly probable events eventually occur. This work can be viewed as a generalization of benign failure detectors popular in the distributed computing literature., This paper deals with multilevel partial-response class-IV (PRIV) transmission over unshielded twisted-pair (UTP) cables. Specifically, transmission at a rate of 155.52 Mb/s over data-grade UTP cables for local-area networking is considered. As a low-complexity method used to compensate for cable-length dependent signal distortion, adaptive analog equalization with two controlled parameters is proposed: one parameter determines a frequency-independent receiver gain, the other parameter controls the transfer characteristic of a variable analog receive-filter section. For the stepwise design of the transmit and receive filters, a combination of analytic techniques and simulated annealing is employed. First, the variable equalizer section, then the remaining fixed analog receive filter section are developed and finally the analog transmit filter is determined. The paper also describes the adjustment of the equalizer section, and the control of the sampling phase in the receiver front-end. The two equalizer parameters are controlled by an algorithm that operates on the sampled signals and adjusts these parameters to optimum settings independently of the sampling phase. The latter is controlled by a decision-directed phase-locked loop algorithm that becomes effective when equalization has been achieved. The dynamic behaviour and mean-square error in steady-state obtained with these control algorithms are investigated., In this paper, a practical control approach is suggested for series elastic actuators(SEAs) to generate the desired torque. Firstly, based on the analysis of a nonlinear SEA, the generic dynamics for a class of SEAs is summarized. Then the dynamic equations are transformed into a novel state-space form which is convenient for controller design. Finally, based on the recently developed finite-time control technique, a finite time disturbance observer and a continuous terminal sliding-mode control scheme are introduced to synthesize the control law. The finite-time stability of the proposed controller is theoretically ensured by Lyapunov analysis. Compared with most existing methods, the contribution of the paper is two-fold: (i) The proposed controller is suitable for not only linear, but also a class of nonlinear SEAs, which means that it is a more generic method for SEA torque control; (ii) It achieves faster convergence rate and works well even in the presence of unknown payload parameters and external disturbances. A series of experiments are carried out on the self-built SEA testbed to demonstrate the superior performance of the proposed controller by comparing it with the cascade-PID controller., source_sentence: Matrix Methods for Solving Algebraic Systems
sentences: We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining an overconstrained system and constructing a Sylvester-type matrix of its sparse resultant. Third, C code for a Sylvester-type matrix of the sparse resultant and a superset of all common roots of the initial well-constrained system by computing the eigen-decomposition of a square matrix obtained from the resultant matrix. We conclude with experiments in computing molecular conformations., Design trade-offs between estimation performance, processing delay and communication cost for a sensor scheduling problem is discussed. We consider a heterogeneous sensor network with two types of sensors: the first type has low-quality measurements, small processing delay and a light communication cost, while the second type is of high quality, but imposes a large processing delay and a high communication cost. Such a heterogeneous sensor network is common in applications, where for instance in a localization system the poor sensor can be an ultrasound sensor while the more powerful sensor can be a camera. Using a time-periodic Kalman filter, we show how one can find an optimal schedule of the sensor communication. One can significantly improve estimation quality by only using the expensive sensor rarely. We also demonstrate how simple sensor switching rules based on the Riccati equation drives the filter into a stable time-periodic Kalman filter., The Multi-stage Genetic Algorithm, MGA, is introduced to solve a class of compositional design problems. The problem with complicated constraints is formulated as a set of local subproblems with simple constraints and a supervising problem. Every subproblem is solved by GA to generate a set of suboptimal solutions. And in the supervising problem, the elements of each set are optimally combined by GA to yield the optimal solution for the original problem. The method is a learning method where the empirical knowledge obtained by solving the problem is effectively utilized to solve similar problems efficiently. Extended knapsack problems are solved to demonstrate the proposed method, and the efficiency of the method is shown. In addition, the method is successfully applied to optimal realization of cooperative robot soccer behaviors., source_sentence: Low-power partial-parallel Chien search architecture with polynomial degree reduction
sentences: In this paper, we present a novel attentive and immersive user interface based on gaze and hand gestures for interactive large-scale displays. The combination of gaze and hand gestures provide more interesting and immersive ways to manipulate 3D information., There is significant interest in the synthesis of discrete-state random fields, particularly those possessing structure over a wide range of scales. However, given a model on some finest, pixellated scale, it is computationally very difficult to synthesize both large- and small-scale structures, motivating research into hierarchical methods. In this paper, we propose a frozen-state approach to hierarchical modeling, in which simulated annealing is performed on each scale, constrained by the state estimates at the parent scale. This approach leads to significant advantages in both modeling flexibility and computational complexity. In particular, a complex structure can be realized with very simple, local, scale-dependent models, and by constraining the domain to be annealed at finer scales to only the uncertain portions of coarser scales; the approach leads to huge improvements in computational complexity. Results are shown for a synthesis problem in porous media., The Chien search for the error locator polynomial root computation in BCH and Reed-Solomon decoding accounts for a significant part of the overall decoder power consumption, especially r long codes over finite fields of high order. For serial Chien search, the power consumption is substantially lowered by a polynomial degree reduction (PDR) scheme. Every time a root is found, it is factored out of the error locator polynomial. Only the hardware units associated with the reduced-degree polynomial coefficients are active. However, this PDR scheme can not be directly extended to partial-parallel Chien search, which is needed in any systems to achieve high throughput. By analyzing the formulas of the evaluation values over finite field elements and available intermediate results of the Chien search, this paper proposes a partial-parallel Chien search architecture that reduces the error locator polynomial degree on the fly whenever a root is found without using long division. For a 122-error-correcting BCH code over GF(215), an 8-parallel Chien search using the proposed architecture achieves 32% power reduction over existing partial-parallel architectures for a typical case., source_sentence: An efficient network-switch scheduling for real-time applications
sentences: Bursts consist of a varying number of asynchronous transfer mode cells corresponding to a datagram. Here, we generalized weighted fair queueing to a burst-based algorithm with preemption. The new algorithm enhances the performance of the switch service for real-time applications, and it preserves the quality of service guarantees. We study this algorithm theoretically and via simulations., Online Social Network (OSN) is one of the hottest innovations in the past years, and the active users are more than a billion. For OSN, users' behavior is one of the important factors to study. This demonstration proposal presents Harbinger, an analyzing and predicting system for OSN users' behavior. In Harbinger, we focus on tweets' timestamps (when users post or share messages), visualize users' post behavior as well as message retweet number and build adjustable models to predict users' behavior. Predictions of users' behavior can be performed with the discovered behavior models and the results can be applied to many applications such as tweet crawler and advertisement., The computation and memory required for kernel machines with N training samples is at least O(N2). Such a complexity is significant even for moderate size problems and is prohibitive for large datasets. We present an approximation technique based on the improved fast Gauss transform to reduce the computation to O(N). We also give an error bound for the approximation, and provide experimental results on the UCI datasets., source_sentence: Summarizing the Evidence on the International Trade in Illegal Wildlife
sentences: This paper proposes a method to represent classifiers or learned regression functions using an OWL ontology. Also proposed are methods for finding an appropriate learned function to answer a simple query. The ontology standardizes variable names and dependence properties, so that feature values can be given by users or found on the semantic web., The global trade in illegal wildlife is a multi-billion dollar industry that threatens biodiversity and acts as a potential avenue for invasive species and disease spread. Despite the broad-sweeping implications of illegal wildlife sales, scientists have yet to describe the scope and scale of the trade. Here, we provide the most thorough and current description of the illegal wildlife trade using 12 years of seizure records compiled by TRAFFIC, the wildlife trade monitoring network. These records comprise 967 seizures including massive quantities of ivory, tiger skins, live reptiles, and other endangered wildlife and wildlife products. Most seizures originate in Southeast Asia, a recently identified hotspot for future emerging infectious diseases. To date, regulation and enforcement have been insufficient to effectively control the global trade in illegal wildlife at national and international scales. Effective control will require a multi-pronged approach including community-scale education and empowering local people to value wildlife, coordinated international regulation, and a greater allocation of national resources to on-the-ground enforcement., Griffithsin (GRFT) is a red alga-derived lectin with demonstrated broad spectrum antiviral activity against enveloped viruses, including severe acute respiratory syndrome–Coronavirus (SARS-CoV), Japanese encephalitis virus (JEV), hepatitis C virus (HCV), and herpes simplex virus-2 (HSV-2). However, its pharmacokinetic profile remains largely undefined. Here, Sprague Dawley rats were administered a single dose of GRFT at 10 or 20 mg/kg by intravenous, oral, and subcutaneous routes, respectively, and serum GRFT levels were measured at select time points. In addition, the potential for systemic accumulation after oral dosing was assessed in rats after 10 daily treatments with GRFT (20 or 40 mg/kg). We found that parenterally-administered GRFT in rats displayed a complex elimination profile, which varied according to administration routes. However, GRFT was not orally bioavailable, even after chronic treatment. Nonetheless, active GRFT capable of neutralizing HIV-Env pseudoviruses was detected in rat fecal extracts after chronic oral dosing. These findings support further evaluation of GRFT for pre-exposure prophylaxis against emerging epidemics for which specific therapeutics are not available, including systemic and enteric infections caused by susceptible enveloped viruses. In addition, GRFT should be considered for antiviral therapy and the prevention of rectal transmission of HIV-1 and other susceptible viruses.
Likes: 0 | All-time downloads: 84
Created: 2024-11-04 11:47:12