Model: vaios-stergio/all-mpnet-base-v2-dblp-aminer-180k-pairs
Author: vaios-stergio
Pipeline: sentence-similarity
Library: sentence-transformers
Tags: sentence-transformers, safetensors, mpnet, sentence-similarity, feature-extraction, dense, generated_from_trainer, dataset_size:146640, loss:CachedMultipleNegativesRankingLoss, arxiv:1908.10084, arxiv:2101.06983, base_model:sentence-transformers/all-mpnet-base-v2, base_model:finetune:sentence-transformers/all-mpnet-base-v2, endpoints_compatible, region:us
Base models (finetune): id: sentence-transformers/all-mpnet-base-v2
Card metadata: tags: sentence-transformers, sentence-similarity, feature-extraction, dense, generated_from_trainer, dataset_size:146640, loss:CachedMultipleNegativesRankingLoss
base_model: sentence-transformers/all-mpnet-base-v2
widget: source_sentence: Motion saliency based automatic delineation of glottis contour in highspeed digital images.In recent years highspeed videoendoscopy HSV has significantly aided the diagnosis of voice pathologies and furthered the understanding the voice production in recent years
sentences: . The most common loss function used in this context is the crossentropy loss which reduces to the log loss in the typical case when there is a single correct response label. While this loss is insensitive to the identity of the assigned class in the case of misclassification in practice it is often the case that some errors may be more detrimental than others. Here we present the bilinearloss and related logbilinearloss which differentially penalizes the different wrong assignments of the model. We thoroughly test this method using standard models and benchmark image datasets. As one application we show the ability of this method to better contain error within the correct superclass in the hierarchically labeled CIFAR100 dataset without affecting the overall performance of the classifier., . This is the case in latencysensitive applications such as online creditcard fraud detection graphbased computing for analysis on social networks etc. Such pauses compromise latency requirements of the whole application stack and result from applicationsu0027 aggressive bufferingcaching of data exposing an illsuited GC design which assumes that most objects will die young and does not consider that applications hold large amounts of middlelived data in memory. 82avoid such pauses we propose NG2C a new GC algorithm that combines pretenuring with an NGenerational heap. By being able to allocate objects into different generations NG2C is able to group objects with similar lifetime profiles in the same generation. By allocating objects with similar lifetime profiles close to each other i.e. in the same generation we 82avoid object promotion copying between generations and heap fragmentation which leads to heap compactions both responsible for most of the duration of HotSpot GC pause times. is 166implemented for the OpenJDK 8 HotSpot Java Virtual Machine as an extension of the Garbage First GC. We evaluate NG2C using Cassandra Lucene and GraphChi with three different GCs Garbage First G1 Concurrent Mark Sweep CMS and NG2C. Results show that NG2C decreases the worst observable GC pause time by up to 94.8 for Cassandra 85.0 for Lucene and 96.45 for GraphChi when compared to current collectors G1 and CMS. In addition NG2C has no negative impact on application throughput or memory usage., . As the first step of these studies automatic segmentation of glottal images till presents a major challenge for this technique. In this paper we propose an improved Saliency Network that automatically delineates the contour of the glottis from HSV image sequences. Our proposed additional saliency measure Motion Saliency MS improves upon the original Saliency Network by using the velocities of defined edges. In our results and analysis we demonstrate the effectiveness of our approach and discuss its potential applications for computeraided assessment of voice pathologies and understanding voice production., source_sentence: Acceleration of 3D Mass Digitization Processes Recent Advances and Challenges.In the heritage field the demand for fast and efficient 3D digitization technologies for historic remains is increasing
sentences: . Besides 3D has proven to be a promising approach to enable precise reconstructions of cultural heritage objects. Even though 3D technologies and postprocessing tools are widespread and approaches to semantic enrichment and storage of 3D models are just emerging only few approaches enable mass capture and computation of 3D virtual models from zoological and archeological findings. To illustrate how future 3D mass digitization systems may look like we introduce CultLab3D a recent approach to 3D mass digitization annotation and archival storage by the Competence Center for Cultural Heritage Digitization at the Fraunhofer Institute for Computer Graphics Research IGD. CultLab3D can be regarded as one of the first feasible approaches worldwide to enable fast efficient and costeffective 3D digitization. It is specifically designed to automate the entire process and thus allows to scan and archive large amounts of heritage objects for documentation and preservation in the best possible quality taking advantage of integrated 3D visualization and annotation within regular Web browsers using technologies such as WebGl and X3D., . Preferential attachment and node fitness are two ubiquitous growth mechanisms that not only explain certain structural properties commonly observed in realworld systems but are also tied to a number of applications in modeling and inference. While there are standard statistical packages for estimating the structural properties of complex networks there is no corresponding package when it comes to the estimation of growth mechanisms. This paper introduces the R package PAFit which implements wellestablished statistical methods for estimating preferential attachment and node fitness as well as a number of functions for generating complex networks from these two mechanisms. The main computational part of the package is implemented in C with OpenMP to ensure good performance for largescale networks. In this paper we first introduce the main functionalities of PAFit using simulated examples and then use the package to analyze a collaboration network between scientists in the field of complex networks., . For homogeneous delayinsensitive data encoding only dualrail i.e. 1of2 code is used and for heterogeneous delayinsensitive data encoding 1of2 and 1of4 codes are used. The 4phase returntozero protocol is used for handshaking. To demonstrate the merits of the proposed dualbit full adder designs 32bit ripple carry adders RCAs are constructed comprising dualbit full adders. The proposed dualbit full adders based 32bit RCAs incorporating redundant logic feature reduced latency and area compared to their nonredundant counterparts with no accompanying power penalty. In comparison with the weakly indicating 32bit RCA constructed using homogeneously encoded dualbit full adders containing redundant logic the early output 32bit RCA comprising the proposed homogeneously encoded dualbit full adders with redundant logic reports corresponding reductions in latency and area by 22.2 and 15.1 with no associated power penalty. On the other hand the early output 32bit RCA constructed using the proposed heterogeneously encoded dualbit full adder which incorporates redundant logic reports respective decreases in latency and area than the weakly indicating 32bit RCA that consists of heterogeneously encoded dualbit full adders with redundant logic by 21.5 and 21.3 with nil power overhead. The simulation results obtained are based on a 3228nm CMOS process technology., source_sentence: Digital Memory and Integrated Data Capturing Innovations for an Inclusive Cultural Heritage in Europe Through 3D Semantic Modelling.Starting from different applications in 3D integrated laser scanner survey of heritage buildings and sites this chapter will illustrate advanced procedures in 3D surveying and modelling of complex buildings focusing on the ongoing European project INCEPTIONInclusive Cultural Heritage in Europe through 3D semantic modelling funded by the EC within the Programme Horizon 2020
sentences: . However SSC has quadratic computation and memory requirements with respect to the number of input data points. This burden has prohibited SSCs use for all but the smallest datasets. To overcome this we propose a new method kSSC that screens out a large number of data points to both reduce SSC to linear memory and computational requirements. We provide theoretical analysis for the bounds of success for kSSC. Our experiments show that kSSC exceeds theoretical expectations and outperforms existing SSC approximations by maintaining the classification performance of SSC. Furthermore in the spirit of reproducible research we have publicly released the source code for kSSC, . This paper investigates the physical layer security of a wireless multipleinput multipleoutput MIMO orthogonal frequency division multiplexing OFDM communication system in the presence of a multipleantenna eavesdropper. We first propose a transmitfilterassisted secure MIMOOFDM system which can destroy the orthogonality of eavesdropperu0027s signals. Our proposed transmit filter can disturb the reception of eavesdropper while maintaining the quality of legitimate transmission. Then we propose another artificial noise ANassisted secure MIMOOFDM system to further improve the security of the legitimate transmission. The timedomain AN signal is designed to disturb the reception of eavesdropper while the legitimate transmission will not be affected. Simulation results are presented to demonstrate the security performance of the proposed transmit filter design and ANassisted scheme in the MIMOOFDM system., . The project methodology proposes the enhancement of efficiency in 3D data capturing methodologies procedures and devices beyond current standards especially as regards their suitability and aptitude for tangible cultural assets characterized by nonconventional features locations and geometries. Within the overall documentation process the semantic enrichment of 3D models will enable an inclusive approach for accessing and understanding European cultural heritage through digital documentation., source_sentence: A Sport Tournament Scheduling by Genetic Algorithm with Swapping Method.A sport tournament problem is considered the Traveling Tournament Problem TTP
sentences: . In this paper we give tights bounds on HfX when the function f is not onetoone and we illustrate a few scenarios where this matters. As an intermediate step towards our main result we prove a lower bound on the entropy of a probability distribution when only a bound on the ratio between the maximum and the minimum probability is known. Our lower bound improves previous results in the literature and it could find applications outside the present scenario., . Here phenotype measurements are taken for Neurospora crassa wild type growing on agar in the standard laboratory conditions. I define a phenotype as a set of traits including apical extension velocity branching angle and branching distance. I use the above measures traits to model estimate biologically complex filamentous fungi network as a simplified u0027In Silico Fungusu0027 consisting of series of straight lines. Phenotype data under the central limit theorem is often characterized by means and standard deviations. Subsequently P values are used to show statistical validity. Here I question whether making normality assumption based on the popularity of such approach is always justified. Therefore I test three different scenarios by making different assumptions 146data collected. 1 Firstly I use the most popular approach I assume the phenotype 146data comes from the continuous normal Gauss distribution. Thus I predict the future measurement outcomes by using normal Gauss parametric approximation. 2 Secondly I use the most intuitive approach I do not make any assumptions about the 146data use 199it to predict the future measurement outcomes by withdrawing values pseudo randomly from the actual raw and discrete dataset. 3 Finally I use the strategy the 226previous two I construct a customised continuous and nonparametric distribution based on the 146data collected. Thus I predict the future measurement using 249kernel density estimation I 254implement all of the strategies above 1 2 and 3 in the in silico fungus programme to compare the computer simulation outcomes. More specifically I 281surface coverage expressed as the proportion of the 281surface occupied by the fungus. Obtained results show that the differences between different 146data regimes 1 2 and 308significant. Therefore I conclude that the correct assessment of the 146data normality is crucial for the correct interpretation and implementation of scientific observations. I suspect the described 146data classification process determines successful implementation of biological findings especially in the fields such as medicine and engineering., . One interesting type is the mirrored Traveling Tournament Problem mTTP. The objective of the problem is to minimize either the total number of traveling or the total distances of traveling or both. This research aims to find an optimized solution of the mirrored Traveling Tournament Problem with minimum total number of traveling. The solutions consisting of traveling and scheduling tables are solved by using genetic algorithm GA with swapping method. The number of traveling of all teams from obtained solutions are close to the lower bound theory of number of traveling. Moreover this algorithm generates better solutions than known results for most cases., source_sentence: Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix.We consider a symmetric matrix the entries of which depend linearly on some parameters
sentences: . In this work we define an evolutionary gametheoretic model to study how norms change in a society based on the idea that different strength of norms in societies translate to different gametheoretic interaction structures and incentives. We use this model to study both analytically and with extensive agentbased simulations the evolutionary relationships of the need for coordination in a society which is related to its norm strength with two key aspects of norm change cultural inertia whether or how quickly the population responds when faced with conditions that make a norm change desirable and exploration rate the willingness of agents to try out new strategies. Our results show that a high need for coordination leads to both high cultural inertia and a low exploration rate while a low need for coordination leads to low cultural inertia and high exploration rate. This is the first work to our knowledge on understanding the evolutionary causal relationships among these factors., . We show that such reductions exhibit the same desirable properties as their qualitative counterparts and additionally retain the optimality of solutions. Moreover we introduce vertexranked games as a generalpurpose target for quantitative reductions and show how to solve them. In such games the value of a play is determined only by a qualitative winning condition and a ranking of the vertices. 88provide quantitative reductions of quantitative requestresponse games to vertexranked games thus showing ExpTimecompleteness of solving the former games. Furthermore we exhibit the usefulness and flexibility of vertexranked games by showing how to use such games to compute faultresilient strategies for safety specifications. This work lays the foundation for a general study of faultresilient strategies for more complex winning conditions, . The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each or some setting of the parameters the matrix is positive definite or positive semidefinite. We state a characterization in the form of equivalent conditions and also propose some computationally cheap sufficient necessary conditions. Our results extend the classical results on positive semidefiniteness of interval matrices. They may be useful for checking convexity or nonconvexity in global optimization methods based on branch and bound framework and using interval techniques.
pipeline_tag: sentence-similarity
library_name: sentence-transformers
Likes: 0 | All-time downloads: 216
Created: 2025-10-23 10:49:45