Miracle-dz/UniFAR-FTUs huggingface dataset:
Parallel Evaluation of Interaction Nets: Some Observations and Examples

Abstract. Interaction nets are a particular kind of graph rewriting system that have many properties that make them useful for capturing sharing and parallelism. There have been a number of research efforts towards implementing interaction nets in parallel, and these have focused on the implementation technologies. In this paper we investigate a related question: when is an interaction net system suitable for parallel evaluation? We observe that some nets are cannot benefit from parallelism (they are sequential) and some have the potential to be evaluated in a highly parallel way. This first investigation aims to highlight a number of issues, by presenting experimental evidence for a number of case studies. We hope this can be used to help pave the way to a wider use of this technology for parallel evaluation.
Recent allopolyploid origin of Zygosaccharomyces rouxii strain ATCC 42981

Zygosaccharomyces rouxii strain ATCC 42981 has been reported to have two copies of several genes including HOG1 and SOD2, whereas the type strain of Z. rouxii (CBS 732) has only one. To investigate the structure of the ATCC 42981 genome we sequenced random fragments from this genome and compared the data to the type strain. We found that ATCC 42981 contains two versions of the ribosomal RNA array, one of which is identical in the ITS1–ITS2 and 26S D1/D2 regions to Z. rouxii CBS 732, while the other is almost identical to a species provisionally named Z. pseudorouxii. We found that most genomic regions from Z. rouxii CBS 732 map in a one‐to‐two fashion to pairs of regions in ATCC 42981, with one of the ATCC 42981 regions having 97–100% DNA sequence identity to CBS 732 and the other having about 80–90% identity. Complete sequencing of regions containing 30 pairs of genes from ATCC 42981 and their orthologues in CBS 732 showed no evidence of the gene deletions or pseudogene formation that might be expected if ATCC 42981 had undergone whole‐genome duplication several million years ago and was in the early stages of gene loss. Instead, we conclude that ATCC 42981 is a Z. rouxii–Z. pseudorouxii interspecies hybrid that was formed so recently that its genome has not had time to decay. Copyright © 2008 John Wiley & Sons, Ltd.
Distributed output regulation of switching multi-agent systems subject to input saturation

In this paper, we consider the distributed output regulation problem of linear multi-agent systems subject to input saturation with switching topology. It is natural to take the semiglobal frame for distributed output regulation with input saturation which allows us to use distributed linear feedback controller. The basic problem is to design distributed feedback controller for the considered multi-agent systems subject to input saturation in order to achieve asymptotically tracking and disturbance rejection. A systematic distributed linear design approach based on the solvability condition is proposed for the semiglobal distributed output regulation with switching interconnection topology.
Second Workshop on Coreference Resolution beyond OntoNotes

ii Introduction Many NLP researchers, especially those not working in the area of discourse processing, tend to equate coreference resolution with the sort of coreference that people did in MUC, ACE, and OntoNotes, having the impression that coreference is a well-worn task owing in part to the large number of papers reporting results on the MUC/ACE/OntoNotes corpora. This is an unfortunate misconception: the previous SemEval 2010 and CoNLL 2012 shared tasks on coreference resolution have largely focused on entity coreference, which constitutes only one of the many kinds of coreference relations that were discussed in theoretical and computational linguistics in the past few decades. In fact, by focusing on entity coreference resolution, NLP researchers have only scratched the surface of the wealth of interesting problems in coreference resolution. The decision to focus on entity coreference resolution was initially made by information extraction (IE) researchers when coreference was selected as one of the tasks in the MUC-6 coreference in 1995. Many interesting kinds of coreference relations, such as bridging and reference to abstract entities, were left out not because they were not important, but because " it was felt that the menu was simply too ambitious ". It turned out that this decision had an important consequence: the progress made in coreference research in the past two decades was largely driven by the availability of coreference-annotated corpora such as MUC, ACE, and OntoNotes, where entity coreference was the focus. Being aware of other fora gathering coreference-related papers (such as LAW, DiscoMT or EVENTS), in 2016 we started a new workshop on the single topic of knowledge-oriented coreference resolution under the name of Coreference Resolution Beyond OntoNotes (CORBON) that would bring together researchers who were interested in under-investigated coreference phenomena, willing to contribute both theoretical and applied computational work on coreference resolution, especially for languages other than English, less-researched forms of coreference and new applications of coreference resolution. The success of the first edition of the workshop (held in conjunction with NAACL HLT 2016 in San Diego, USA) and our intention to verify the role of the Europe-based researchers in the field encouraged us to organise the second edition of the workshop in conjunction with EACL 2017 in Valencia, Spain. Our call attracted 12 submissions (nine from European research institutions and three from India). We are pleased to see that the submissions covered not only a variety of less-studied languages in the …
Implementation of the Network Control Protocol using ECN Bits (eNCP)

Many studies have shown that the transmission control protocol (TCP) which is the major transport protocol in the Internet today is finding it increasingly difficult to cope with the growth of communication network capacities and applications. TCP’s inability to properly utilize network links is one of the problems. Besides, TCP takes a long time to achieve fairness between flows. Many of the new modification of TCP inherit these main problems of TCP. Clean-slate protocols such as the explicit Congestion control Protocol (XCP) which get congestion feedback from routers can fully utilize the links and reduce queueing delays in the path of the flows. But XCP, in addition to having many router computation overheads also takes many rounds to allocate fair shares to flows. To solve the drawbacks of XCP and TCP, we have previously presented a network control protocol (NCP). NCP allocates fair share to flows in one round resulting in increased average file completion time (AFCT) as short flows are not blocked by big file transfer flows. Although smaller than that of XCP, NCP uses a 32 bit additional header in every packet to carry a congestion feedback from the routers in the path of every flow to each source of the flow. Apart from the inconvenience of modifying the TCP/IP packet formats, the additional header may accumulate to cause some increase in AFCT. In this paper we present an efficient implementation scheme (algorithm) of the Network Congestion Control (NCP) protocol using Explicit Congestion Notification (ECN) bits (eNCP). Using this implementation scheme, NCP does not need any additional packet header, avoiding the per packet overhead. In addition to the convenience of not having to change the TCP/IP packet header format, numerical results show that a significant amount of data overhead can be saved using eNCP. Not having to add a layer can also make NCP easily deployable and backward compatible.
Non-rigid motion estimation from hierarchical adaptive local affine registrations

Non-rigid image registrations have been widely employed in medical imaging to estimate the complex tissue deformations such as those caused by respiratory motion. To reduce the computational burden of non-rigid registration techniques, alternative approaches have been proposed which decompose the non-rigid registration problem into a combination of multiple more simple registration problems, such as locally affine components. For the EMPIRE10 challenge we apply a modified version of a local affine registration algorithm, where all local affine components are embedded in an adaptive hierarchical structure.
Genetic programming with a norm-referenced fitness function

In this paper, we develop a new fitness function based on adjustment of the original fitness function using population performance. We call this new fitness function norm-referenced fitness function since it is motivated by the idea of norm-referenced test. Experiments performed in two benchmark problems show that, the norm-referenced fitness function developed is capable of improving the overall performance of GP system. Further analysis of the fitness function reveals that the original fitness function suffers from an implicit bias we named as implicit bias towards exploitation in later generations. This implicit bias pushes the population towards convergence. The norm-referenced fitness developed however does not inherit this bias, and we think this is the main reason why the norm-referenced fitness function is able to outperform the original fitness function. We further study the selection of the newly introduced parameter lambda in norm-referenced fitness function and give a number of advices to select the optimal value of the parameter.
LMS-based Equalization in Filter Bank Multicarrier Wireless Communication Systems

Multicarrier systems give many attractive characteristics for high data rates wireless communications. Filter bank multicarrier systems (FBMC) provide some advantages more than the traditional orthogonal frequency division multiplexing (OFDM) with cyclic prefix (CP). The most obvious difference between the two techniques is in frequency selectivity. In this paper, we will design adaptive channel equalization algorithms for FBMC system with offset QAM modulation(OQAM). Our proposed algorithms will be optimized based on well-known cost functions, which is the mean-squared error (MSE) criterion and it is based on least-mean-square (LMS) algorithm. Thus we will have an adaptive equalizer with lower complexity because of applying the equalizer to each sub-carrier. We have used in our simulation practical channel information based on the International Telecommunications Union ITU Standards. In this paper, we aim to optimize and evaluate the convergence characteristic curves of LMS equalization algorithm per-subcarrier.
IRIS: A New Generation of IRAS Maps

The Infrared Astronomical Satellite (IRAS) had a tremendous impact on many areas of modern astrophysics. In particular, it revealed the ubiquity of infrared cirrus that are a spectacular manifestation of the interstellar medium complexity but also an important foreground for observational cosmology. With the forthcoming Planck satellite there is a need for all-sky complementary data sets with arcminute resolution that can bring informations on specific foreground emissions that contaminate the cosmic microwave background radiation. With its ∼4′ resolution matching perfectly the high-frequency bands of Planck, IRAS is a natural data set to study the variations of dust properties at all scales. But the latest version of the images delivered by the IRAS team (the ISSA plates) suffer from calibration, zero level, and striping problems that can preclude its use, especially at 12 and 25 μm. In this paper we present how we proceeded to solve each of these problems and enhance significantly the general quality of the ISSA plates in the four bands (12, 25, 60, and 100 μm). This new generation of IRAS images, called IRIS, benefits from a better zodiacal light subtraction, from a calibration and zero level compatible with DIRBE, and from a better destriping. At 100 μm the IRIS product is also a significant improvement from the Schlegel et al. maps. IRIS keeps the full ISSA resolution, it includes well-calibrated point sources, and the diffuse emission calibration at scales smaller than 1° was corrected for the variation of the IRAS detector responsivity with scale and brightness. The uncertainty on the IRIS calibration and zero level is dominated by the uncertainty on the DIRBE calibration and on the accuracy of the zodiacal light model.
Caller identification for the SCANMail voicemail browser

SCANMail is a prototype system developed at AT&T Labs for the purpose of providing useful tools for managing and searching through voicemail messages. Content is extracted from voicemail messages using various speech and text processing tools. One such content category is the identity of the message caller. This paper describes CallerID, the server tool attached to SCANMail for the purpose of providing caller labels for voicemail messages. CallerID makes use of text independent speaker recognition techniques. Two kinds of requests are handled by the CallerID server. A request triggered by the arrival of a new voicemail message results in the processing of the message to score it against the models of callers assigned to the user (recipient) in order to propose the identity of the caller. A second request is initiated by a user who provides a caller label for a message he/she has reviewed. CallerID processes the message and uses it to train or adapt a speaker model for the caller whose label is provided. The paper describes in detail the CallerID functions and provides some results of performance evaluations of the caller identification capability.
Political Ideology and Racial Preferences in Online Dating

What explains the relative persistence of same-race romantic relationships? One possible explanation is structural-this phenomenon could reflect the fact that social interactions are already stratified along racial lines-while another attributes these patterns to individual-level preferences. We present novel evidence from an online dating community involving more than 250,000 people in the United States about the frequency with which individuals both express a preference for same-race romantic partners and act to choose same-race partners. Prior work suggests that political ideology is an important correlate of conservative attitudes about race in the United States, and we find that conservatives, including both men and women and blacks and whites, are much more likely than liberals to state a preference for same-race partners. Further, conservatives are not simply more selective in general; they are specifically selectivewithregardtorace. Dothesestatedpreferencespredictrealbehaviors? Ingeneral,wefindthatstatedpreferences are a strong predictor of a behavioral preference for same-race partners, and that this pattern persists across ideological groups. At the same time, both men and women of all political persuasions act as if they prefer same-race relationships even when they claim not to. As a result, the gap between conservatives and liberals in revealed same-race preferences, while still substantial, is not as pronounced as their stated attitudes would suggest. We conclude by discussing some implications of our findings for the broader issues of racial homogamy and segregation.
A class-based approach to parallelization of legacy codes

Computation-intensive legacy codes for numerical models stand to benefit from application of parallel computing. However, parallelization of legacy codes poses special challenges. These codes are very large and complex. Manual parallelization has proven to be extremely time-consuming and error-prone. Furthermore, while a large number of parallelization tools exist, they cannot handle these complex legacy codes. Development of automatic parallelization tools for legacy codes remains a research area of considerable interest. This thesis describes a new approach to automatic parallelization of legacy codes. Our approach focuses on special classes of codes as opposed to parallelization of arbitrary codes. The advantage is that we are able to use high-level knowledge of the special class to manage the complexity of the parallelization problem. This approach provides a pragmatic solution for parallelization: it requires the user to specify the high-level knowledge, but automates tasks which are time-consuming, tedious, and error-prone for the user. Using this new approach, we have developed parAgent--a parallelizing tool which facilitates quick development of efficient parallel codes for legacy Fortran-77 codes based on the explicit time-marching finite difference model. parAgent has been used on several well-known and widely-used Mesoscale Meteorological codes. It took only a few weeks to parallelize each of these legacy codes. Qualitatively, the performance of parallelization have been found to be on par with manual parallelization. This new approach can be applied to a variety of problem domains. The key benefits are: substantial reuse of existing software and considerable saving of time and effort for developing efficient parallel code. Although the new approach and parAgent have been developed with parallelization as the main objective, the information provided by the tool can be used for various purposes. For example, the information about the underlying numerical method and the exchange of data is valuable to the application scientist.
Robust 2D-3D alignment based on geometrical consistency

This paper presents a new registration algorithm of a 2D image and a 3D geometrical model, which is robust for initial registration errors, for reconstructing a realistic 3D model of indoor scene settings. One of the typical techniques of pose estimation of a 3D model in a 2D image is the method based on the correspondences between 2D photometrical edges and 3D geometrical edges projected on the 2D image. However, for indoor settings, features extracted on the 2D image and jump edges of the geometrical model, which can be extracted robustly, are limited. Therefore, it is difficult to find corresponding edges between the 2D image and the 3D model correctly. For this reason, in most cases, the relative position has to be manually set close to correct position beforehand. To overcome this problem, in the proposed method, first the relative pose is roughly estimated by utilizing geometrical consistencies of back-projected 2D photometrical edges on a 3D model. Next, the edge-based method is applied for the precise pose estimation after the above estimation procedure is converged. The performance of the proposed method is successfully demonstrated with some experiments using simulated models of indoor scene settings and actual environments measured by range and image sensors.
The Role of Conceptual and Linguistic Ontologies in Discourse

In this paper we argue that a clear division between two sources of information— one oriented to world knowledge, the other to linguistic semantics—offers a framework within which mechanisms for modelling the highly flexible relation between language and interpretation necessary for natural discourse can be specified and empirically validated. Moreover, importing techniques and results from formal ontology provides the formal underpinnings necessary for representing these sources of information appropriately. The result is a computationally specifiable model of dialogic interaction within which flexible discourse interpretation is seen as the result of inter-ontology mappings between our two sources of information. These mappings are dynamically negotiated according to the concrete discourse moves of interlocutors. The paper draws on our ongoing empirical studies in spatial discourse, where interlocutors jointly solve varieties of spatially-embedded tasks, and suggests that ontological formalization is of considerable benefit for constructing computational dialogue systems.
Aspect Based Sentiment Analysis using Sentiment Flow with Local and Non-local Neighbor Information

Aspect-level analysis of sentiments contained in a review text is important to reveal a detailed picture of consumer opinions. While a plethora of methods have been traditionally employed for this task, majority focus has been on analyzing only aspect-centered local information. However, incorporating context information from non-local aspect neighbors may capture richer structure in review text and enhance prediction. This may especially be helpful to resolve ambiguous predictions. The context around an aspect can be incorporated using semantic relations within text and inter-label dependencies in the output. On the output side, this becomes a structured prediction task. However, non-local label correlations are computationally heavy and intractable to infer for structured prediction models like Conditional Random Fields (CRF). Moreover, some prior intuition is required to incorporate non-local context. Thus, inspired by previous research on multi-stage prediction, we propose a two-level model for aspect-based analysis. The proposed model uses predicted probability estimates from first level to incorporate neighbor information in the second level. The model is evaluated on data taken from SemEval Workshops and Bing Liu’s review collection. It shows comparatively better performance against few existing methods. Overall, we get prediction accuracy in a range of 83-88% and almost 3-4 point increment against baseline (first level only) scores.
Determinants of Glycated Hemoglobin in Subjects With Impaired Glucose Tolerance: Subanalysis of the Japan Diabetes Prevention Program

Background Limited evidence is available about the relationship of lifestyle factors with glycated hemoglobin (HbA1c) in subjects with impaired glucose tolerance. The aim of study was to identify such determinant factors of HbA1c in subjects with impaired glucose tolerance. Methods This cross-sectional study included 121 men and 124 women with impaired glucose tolerance, who were diagnosed based on a 75-g oral glucose tolerance test. Demographic and biochemical parameters, including the body mass index (BMI), fasting plasma glucose (FPG), 2-h post-load glucose (2-h PG), and HbA1c, were measured. The pancreatic β-cell function and insulin resistance were assessed using homeostasis model assessment (HOMA-β). Dietary intake was assessed by a food frequency questionnaire. Results The levels of FPG, 2-h PG, and carbohydrate intake were correlated with the HbA1c level in men, while the FPG and 2-h PG levels were correlated with the HbA1c level in women. In multiple regression analyses, BMI, FPG, 2-h PG, and white rice intake were associated with HbA1c levels in men, while BMI, FPG, HOMA-β, and bread intake were associated with HbA1c levels in women. Conclusions The present findings suggest that a substantial portion of HbA1c may be composed of not only glycemic but also several lifestyle factors in men with impaired glucose tolerance. These factors can be taken into consideration as modifiable determinants in assessing the HbA1c level for the diagnosis and therapeutic monitoring of the disease course.