Sense representations have gone beyond word representations like Word2Vec, GloVe and FastText and achieved innovative performance on a wide range of natural language processing tasks. Although very useful in many applications, the traditional approaches for generating word embeddings have a strict drawback: they produce a single vector representation for a given word ignoring the fact that ambiguous words can assume different meanings. In this paper, we explore unsupervised sense representations which, different from traditional word embeddings, are able to induce different senses of a word by analyzing its contextual semantics in a text. The unsupervised sense representations investigated in this paper are: sense embeddings and deep neural language models. We present the first experiments carried out for generating sense embeddings for Portuguese. Our experiments show that the sense embedding model (Sense2vec) outperformed traditional word embeddings in syntactic and semantic analogies task, proving that the language resource generated here can improve the performance of NLP tasks in Portuguese. We also evaluated the performance of pre-trained deep neural language models (ELMo and BERT) in two transfer learning approaches: feature based and fine-tuning, in the semantic textual similarity task. Our experiments indicate that the fine tuned Multilingual and Portuguese BERT language models were able to achieve better accuracy than the ELMo model and baselines.
Web services, which can be described as functionality modules invoked over a network as part of a larger application are often used in software development. Instead of occasionally incorporating some of these services in an application, they can be thought of as fundamental building blocks that are combined in a process known as Web service composition. Manually creating compositions from a large number of candidate services is very time consuming, and developing techniques for achieving this objective in an automated manner becomes an active research field. One promising group of techniques encompasses evolutionary computing, which can effectively tackle the large search spaces characteristic of the composition problem. Therefore, this paper proposes the use of genetic programming for Web service composition, investigating three variations to ensure the creation of functionally correct solutions that are also optimised according to their quality of service. A variety of comparisons are carried out between these variations and two particle swarm optimisation approaches, with results showing that there is likely a trade-off between execution time and the quality of solutions when employing genetic programming and particle swarm optimisation. Even though genetic programming has a higher execution time for most datasets, the results indicate that it scales better than particle swarm optimisation. 相似文献
Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships. 相似文献
MV-algebras as well as orthomodular lattices can be seen as a particular case of so-called “basic algebras” which are an alter ego of bounded lattices whose sections are equipped with fixed antitone involutions. The class of basic algebras is an ideal variety. In the paper, we give an internal characterization of congruence kernels (ideals) and find a finite basis of ideal terms, with focus on monotone and effect basic algebras. We also axiomatize basic algebras that are subdirect products of linearly ordered ones. 相似文献
The multiple determination tasks of chemical properties are a classical problem in analytical chemistry. The major problem is concerned in to find the best subset of variables that better represents the compounds. These variables are obtained by a spectrophotometer device. This device measures hundreds of correlated variables related with physicocbemical properties and that can be used to estimate the component of interest. The problem is the selection of a subset of informative and uncorrelated variables that help the minimization of prediction error. Classical algorithms select a subset of variables for each compound considered. In this work we propose the use of the SPEA-II (strength Pareto evolutionary algorithm II). We would like to show that the variable selection algorithm can selected just one subset used for multiple determinations using multiple linear regressions. For the case study is used wheat data obtained by NIR (near-infrared spectroscopy) spectrometry where the objective is the determination of a variable subgroup with information about E protein content (%), test weight (Kg/HI), WKT (wheat kernel texture) (%) and farinograph water absorption (%). The results of traditional techniques of multivariate calibration as the SPA (successive projections algorithm), PLS (partial least square) and mono-objective genetic algorithm are presents for comparisons. For NIR spectral analysis of protein concentration on wheat, the number of variables selected from 775 spectral variables was reduced for just 10 in the SPEA-II algorithm. The prediction error decreased from 0.2 in the classical methods to 0.09 in proposed approach, a reduction of 37%. The model using variables selected by SPEA-II had better prediction performance than classical algorithms and full-spectrum partial least-squares. 相似文献
This work considers the open-loop control problem of steering a two-level quantum system from any initial to any final condition. The model of this system evolves on the state space , having two inputs that correspond to the complex amplitude of a resonant laser field. A symmetry preserving flat output is constructed using a fully geometric construction and quaternion computations. Simulation results of this flatness-based open-loop control are provided. 相似文献
In this study we implemented a comprehensive analysis to validate the MODIS and GOES satellite active fire detection products (MOD14 and WFABBA, respectively) and characterize their major sources of omission and commission errors which have important implications for a large community of fire data users. Our analyses were primarily based on the use of 30 m resolution ASTER and ETM+ imagery as our validation data. We found that at the 50% true positive detection probability mark, WFABBA requires four times more active fire area than is necessary for MOD14 to achieve the same probability of detection, despite the 16× factor separating the nominal spatial resolutions of the two products. Approximately 75% and 95% of all fires sampled were omitted by the MOD14 and WFABBA instantaneous products, respectively; whereas an omission error of 38% was obtained for WFABBA when considering the 30-minute interval of the GOES data. Commission errors for MOD14 and WFABBA were found to be similar and highly dependent on the vegetation conditions of the areas imaged, with the larger commission errors (approximately 35%) estimated over regions of active deforestation. Nonetheless, the vast majority (> 80%) of the commission errors were indeed associated with recent burning activity where scars could be visually confirmed in the higher resolution data. Differences in thermal dynamics of vegetated and non-vegetated areas were found to produce a reduction of approximately 50% in the commission errors estimated towards the hours of maximum fire activity (i.e., early-afternoon hours) which coincided with the MODIS/Aqua overpass. Lastly, we demonstrate the potential use of temporal metrics applied to the mid-infrared bands of MODIS and GOES data to reduce the commission errors found with the validation analyses. 相似文献
This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred at the origin, and with radius less than one. The underlying philosophy in this constraint is to avoid certain undesirable dynamic features which arise in quadratic optimal designs. An expression for the performance loss due to the pole location constraint is also provided. Using numerical examples, we show that the performance loss is compensated by an improved transient performance, specially visible in the control signals. 相似文献
The uptake of digital photos vs. print photos has altered the practice of photo-sharing. Print photos are easy to share within the home, but much harder to share outside of it. The opposite is true of digital photos. People easily share digital photos outside the home, e.g., to family and friends by e-mail gift-giving, and to social networks and the broader public by web publishing. Yet within the home, collocated digital photo-sharing is harder, primarily because digital photos are typically stored on personal accounts in desktop computers located in home offices. This leads to several consequences. (1) The invisibility of digital photos implies few opportunities for serendipitous photo-sharing. (2) Access control and navigation issues inhibit family members from retrieving photo collections. (3) Photo viewing is compromised as digital photos are displayed on small screens in an uncomfortable viewing setting.To mitigate some of these difficulties, we explore how physical memorabilia collected by family members can create opportunities that encourage social and collocated digital photo-sharing. First, we studied (via contextual interviews with 20 households) how families currently practice photo-sharing and how they keep memorabilia. We identified classes of memorabilia that can serve as memory triggers to family events, trips, and times when people took photos. Second, we designed Souvenirs, a photo-viewing system that exploits memorabilia as a social instrument. Using Souvenirs, a family member can meaningfully associate physical memorabilia with particular photo-sets. Later, any family member can begin their story-telling with others through the physical memento, and then enrich the story by displaying its associated photos simply by moving the memento close to the home's large-format television screen. Third, we re-examined our design premises by evoking household reactions to an early version of Souvenirs. Based on these interviews, we redesigned Souvenirs to better reflect the preferences and real practices of photo and memorabilia use in the home. 相似文献