Miracle-dz/UniFAR-FTUs huggingface dataset:
Generalizing wrapper induction across multiple Web sites using named entities and post-processing

This paper presents a novel method for extracting information from collections of Web pages across different sites. Our method uses a standard wrapper induction algorithm and exploits named entity information. We introduce the idea of post-processing the extraction results for resolving ambiguous facts and improve the overall extraction performance. Post-processing involves the exploitation of two additional sources of information: fact transition probabilities, based on a trained bigram model, and confidence probabilities, estimated for each fact by the wrapper induction system. A multiplicative model that is based on the product of those two probabilities is also considered for post-processing. Experiments were conducted on pages describing laptop products, collected from many different sites and in four different languages. The results highlight the effectiveness of our approach.
Evaluating student perceptions of using a game-based approach to aid learning: Braincept

Abstract Gamification in higher education has steadily been gaining traction as a useful addition to the diversity of learning resources available to both teachers and students. We have invented a card-based, role-playing team game called ‘Braincept’ to help aid pharmacology learning for medical students. The aims of the current study are to determine whether the students who played the game perceived any benefit to their pharmacology learning and to gauge any learning gain as a result of playing the game. Here, we present questionnaire data and thematic analysis collected from students who played Braincept along with our data on learning gain associated with play. Our data show that this style of gamified learning has a positive effect on student confidence in handling pharmacological knowledge and that there was measurable learning gain after playing the game.
An evaluation of existing and new feature selection metrics in text categorization

Text categorization is widely used for organizing and manipulating the documents in the electronic medium. Since the data in text categorization field are high-dimensional, feature selection is crucial to make the task more efficient and precise. In this paper, we make an extensive evaluation of the feature selection metrics used in text categorization by using local and global policies. For the experiments, we use three datasets which vary in size, complexity and skewness. We use SVM as the classifier and tf-idf weighting for term weighting. We observed that almost in all metrics, local policy outperforms when the number of keywords is low and global policy outperforms as the number of keywords increases. In addition to the evaluation of the existing feature selection metrics, we propose new metrics, which have shown high success rates especially in datasets with a low number of keywords. Moreover, we propose a keyword selection policy called adaptive keyword selection (AKS). It is based on selecting different number of keywords for different classes and it improved the performance significantly in skew datasets.
Stackelberg game formulation of prize competition design for seeking shortest path solutions

Prize competitions have been an open approach of soliciting expertise and creativity from the public to increase business success or solve problems. In spite of many successes, there are yet needs for an effective design methodology. To investigate methodology development, we consider a problem of shortest path solution seeking consisting of one path solution seeker (PSS) and multiple providers (PSPs). PSS has a coarse overall grasp of a transportation network and each PSP knows part of the network in detail and has a good path finding capacity. To find short path between two cities, the PSS divides the network into several sections and holds prize competitions in all sections to solicit shortest path solutions among specified pairs of cities. PSS further connects procured solutions into one desired shortest path. Moreover, to protect PSPs' intellectual rights, they first submit the distance of path only. Then the PSP with shortest path submission in each section turns over the route of path and is awarded the prize. In this paper, we formulate the optimal prize setting problem for PSS considering competitive submission strategies of PSPs. We model the hierarchical behaviors between PSS and PSPs as a Stackelberg game. Stackelberg equilibrium can be further investigated based on the model and serve the purpose of prize competition design for applications to collective innovation seeking.
Making contact: getting the group communicating with groupware

While groupware is readily available, people on wide area networks—such as the Internet—have considerable trouble contacting each other and setting up groupware connections. To pinpoint why this occurs, this paper identifies human factors critical to getting a group communicating through groupware. It addresses how people find suitable partners, and how people choose appropriate communication mediums. These factors are discussed in detail, and form a design foundation for systems that promote social presence and that integrate communication. Existing systems are critically reviewed and shown to be inadequate for general use over a wide area net, for they either do not meet some basic design criteria, or they require a very high technological entry level that is beyond the reach of most computer users. As an alternative, the paper presents the design considerations behind TELEFREEK, a flexible, extensible, and customizable platform for collaboration. Drawing on resources freely available to the Internet community, TELEFREEK assists people making contact with others, and integrates access to common communication facilities.
Zeri e LODE. Extracting the Zeri photo archive to linked open data: formalizing the conceptual model

This paper presents the first steps of a project to convert the notable Italian “Zeri photo archive” to a linked and open dataset. The full project entails the analysis of the records' description model (Scheda F) in order to define a suitable ontology by exploring existing data models, the creation of the RDF triple store, the creation of links to the cloud, and the definition of the user interface for browsing the linked open dataset. This paper presents and discusses the conceptual modeling of the data stored in the Zeri archival database.
Empirical Analysis on Relationships between Entrepreneurial Traits and Entrepreneurial Intention

The significance of entrepreneurial intention in determining business start-up behaviour has increased research interests on its influential factors. Subsequently, entrepreneurial attitudes and traits dominate findings on factors which influence entrepreneurial intention. While the entrepreneurial attitudes are proven to be antecedents of entrepreneurial intention, scholars are divided on how entrepreneurial traits affect entrepreneurial intention. As such the specific role of entrepreneurial traits in the formation of entrepreneurial intention is ambivalent. Motivated to contribute in clearing the ambiguity, this study empirically analysed various effects of entrepreneurial traits on entrepreneurial intention. To this end, a quantitative case study design involving a sample of 1000 students was used. The sample was reproduced using bootstrap sampling technique from a case in Mwakujonga and Sesabo (2012) that involved 60 final year students who were pursuing bachelors of business administration in marketing and entrepreneurship as their majors. Using regression and contemporary mediation and moderation analysis techniques, this study concludes entrepreneurial traits affect entrepreneurial intention through entrepreneurial attitudes. Furthermore, the study extends previous research findings by originally classifying entrepreneurial attitudes as full complementary mediators of the effect of entrepreneurial traits on entrepreneurial intention and discusses the implications of such findings to both the body of knowledge and practice.
Mode-Marginals : Expressing Uncertainty via Diverse M-Best Solutions

Representing uncertainty in predictions made by complex probabilistic models is often crucial but computationally challenging. There are a number of useful probabilistic models where computing the most probably assignment (or MAP) is easy but finding the marginal probability of variables is hard. In this paper, we present a novel representation of uncertainty in discrete probabilistic models, that we call Mode-Marginals. Mode-Marginals contain both max-marginals and marginals as special cases and express the entire spectrum in between the two. Computing mode-marginals involves performing MAP computation on deterministic perturbations to the unnormalized probability function, as introduced by Batra et al. [1]. We evaluate our method on a challenging computer vision application – human pose estimation, and demonstrate that mode-marginals provide a richer representation of uncertainty than max-marginals, leading to improved performance.
Impact of developer reputation on code review outcomes in OSS projects: an empirical investigation

<u>Context:</u> Gaining an identity and building a good reputation are important motivations for Open Source Software (OSS) developers. It is unclear whether these motivations have any actual impact on OSS project success. <u>Goal:</u> To identify how an OSS developer's reputation affects the outcome of his/her code review requests. <u>Method:</u> We conducted a social network analysis (SNA) of the code review data from eight popular OSS projects. Working on the assumption that core developers have better reputation than peripheral developers, we developed an approach, Core Identification using K-means (CIK) to divide the OSS developers into core and periphery groups based on six SNA centrality measures. We then compared the outcome of the code review process for members of the two groups. <u>Results:</u> The results suggest that the core developers receive quicker first feedback on their review request, complete the review process in shorter time, and are more likely to have their code changes accepted into the project codebase. Peripheral developers may have to wait 2 - 19 times (or 12 - 96 hours) longer than core developers for the review process of their code to complete. <u>Conclusion:</u> We recommend that projects allocate resources or create tool support to triage the code review requests to motivate prospective developers through quick feedback.
Spatiotemporal Analysis of Circulation Behaviors Using Path and Residing Time displaY (PARTY)

Spatio temporal data displayed in a spatial layout are not the best visualization for simultaneously exploring visitor paths and comparing their residing time. A challenging problem is the visual analytics of circulation patterns in varying layouts commonly found in both real and virtual environments. A circulation pattern is defined as how visitors move within space regarding a sequence of visited items. Understanding and discovering the circulation patterns has received much attention from space designers for increasing visitor satisfaction. This paper proposes a layout-independent visualization approach that transforms the four dimensional data of visitor trajectories (3D-position + time) into time series data. Onetime series datum represents a visitor path and his/her time spent residing in each particular region. In our visualization, we encode a time interval residing in an item boundary into a line segment. The length of a segment is in proportion to the total time spent in the layout. The time segment is placed in the row corresponding to its item boundary. A path of visited items is illustrated by connecting the time segments with vertical lines. The resulting visualization technique, called Path And Residing Time displaY (PARTY), enables users to find trends of circulation behaviors in a consistent fashion regardless of the targeted layout. The scalability of PARTY can be enhanced by a clustering technique which we enable PARTY to handle real data of more than two thousand visitors. We demonstrate the effectiveness of PARTY on these datasets. First, we show circulation behaviors of visiting styles in a 3D virtual museum. Second, we illustrate a flow of people who escaped from an explosive in a building. Third, we analyze players' patterns in a massively multiplayer online game, named Angel Love Online.
X-Tile

The ability to parse tumors into subsets based on biomarker expression has many clinical applications; however, there is no global way to visualize the best cut-points for creating such divisions. We have developed a graphical method, the X-tile plot that illustrates the presence of substantial tumor subpopulations and shows the robustness of the relationship between a biomarker and outcome by construction of a two dimensional projection of every possible subpopulation. We validate X-tile plots by examining the expression of several established prognostic markers (human epidermal growth factor receptor-2, estrogen receptor, p53 expression, patient age, tumor size, and node number) in cohorts of breast cancer patients and show how X-tile plots of each marker predict population subsets rooted in the known biology of their expression.
Loss of SOCS3 in T helper cells resulted in reduced immune responses and hyperproduction of interleukin 10 and transforming growth factor–β1

Suppressor of cytokine signaling (SOCS)3 is a major negative feedback regulator of signal transducer and activator of transcription (STAT)3-activating cytokines. Transgenic mouse studies indicate that high levels of SOCS3 in T cells result in type 2 T helper cell (Th2) skewing and lead to hypersensitivity to allergic diseases. To define the physiological roles of SOCS3 in T cells, we generated T cell–specific SOCS3 conditional knockout mice. We found that the mice lacking SOCS3 in T cells showed reduced immune responses not only to ovalbumin-induced airway hyperresponsiveness but also to Leishmania major infection. In vitro, SOCS3-deficient CD4+ T cells produced more transforming growth factor (TGF)-β1 and interleukin (IL)-10, but less IL-4 than control T cells, suggesting preferential Th3-like differentiation. We found that STAT3 positively regulates TGF-β1 promoter activity depending on the potential STAT3 binding sites. Furthermore, chromatin immunoprecipitation assay revealed that more STAT3 was recruited to the TGF-β1 promoter in SOCS3-deficient T cells than in control T cells. The activated STAT3 enhanced TGF-β1 and IL-10 expression in T cells, whereas the dominant-negative form of STAT3 suppressed these. From these findings, we propose that SOCS3 regulates the production of the immunoregulatory cytokines TGF-β1 and IL-10 through modulating STAT3 activation.
Article choice, theory of mind, and memory in children with high-functioning autism and children with specific language impairment

Previous studies show that young, typically developing (TD) children ( age 5) make errors in the choice between a definite and an indefinite article. Suggested explanations for overgeneration of the definite article include failure to distinguish speaker from hearer assumptions, and for overgeneration of the indefinite article failure to draw scalar implicatures, and weak working memory. However, no direct empirical evidence for these accounts is available. In this study, 27 Dutch-speaking children with high-functioning autism, 27 children with SLI, and 27 TD children aged 5–14 were administered a pragmatic article choice test, a nonverbal theory of mind test, and three types of memory tests (phonological memory, verbal, and nonverbal working memory). The results show that the children with high-functioning autism and SLI (a) make similar errors, that is, they overgenerate the indefinite article; (b) are TD-like at theory of mind, but (c) perform significantly more poorly than the TD children on phonological memory and verbal working memory. We propose that weak memory skills prevent the integration of the definiteness scale with the preceding discourse, resulting in the failure to consistently draw the relevant scalar implicature. This in turn yields the occasional erroneous choice of the indefinite article a in definite contexts.
Head-mounted cameras and stimulated recall in qualitative sport research

There are a number of innovative procedures available for use in qualitative research, including observation, note-taking and verbal protocol techniques. This paper highlights the potential usefulness of stimulated recall as an innovative technique for use in qualitative research in sport and possibly exercise. Specifically, it focuses on video footage obtained from head-mounted cameras for use in stimulated recall during post-event interviews. Examples of research studies carried out in simulation training with fire and emergency personnel and with leisure participants in a whitewater adventure setting, are used to illustrate how stimulated recall can be utilised effectively in practice. Participants in a river-surfing course completed daily qualitative semi-structured interviews, facilitated by footage from head-mounted video cameras. The cameras were worn throughout the course while participants were in the water. The use of the head-mounted equipment and video-footage as stimulated recall in the study and preliminary findings about the procedure are described. Finally, a number of advantages and disadvantages of head-mounted camera and stimulated recall procedures in general are discussed.
Appendix A . Complete Description of the Methods Used in the Simulation Studies

We performed a simulation study of amino-acid sequence evolution in order to be able to include ProbCons (one of the two " best " MSA methods), since ProbCons has only been developed for amino acid alignment. Our simulation study evolved amino-acid sequences with substitutions and indels, and included model trees ranging from small (approximately 20-30 taxa) to large (100 taxa) with varying rates of site substitution and indels. We aligned sequences using eight alignment methods, and evaluated accuracy by comparing the alignments to the true alignment; trees were constructed on each alignment (including the true alignment) using six phylogeny reconstruction methods, and accuracy evaluated by comparing the estimated trees to the true tree (i.e., the model tree with edges contracted on which no event occurred). The MSA methods we explored included new MSA methods that have been shown to produce the best alignments on the benchmark datasets, as well as the standard methods used by the phylogenetic research community. Thus, we included MAFFT (version 5. The settings used for each MSA program are given in the Online Appendix B. We simulated amino-acid sequence evolution on model trees using the ROSE [9] software, which allows sequences to evolve under fairly general site substitution models, as well as with insertions and deletions of strings of amino acids. The input to ROSE is a model tree with branch lengths, and the simulation settings including sequence length, marginal distribution of amino acids at the root of the model tree, substitution model, the insertion/deletion (indel) length distribution, and the indel rates relative to the point substitution events. The ROSE software simulates substitution by repeatedly applying the transition matrix N times, where N is the branch length multiplied by 100, since the PAM matrix is the transition probability matrix between the two sequences when they have 1% sequence difference. This " discretized " simulation of the time-continuous Markov model of amino acid substitution scheme forces branch lengths to correspond to integral multiples of the branch length equivalent to applying one PAM matrix. Consequently, there will be no substitutions on short branches, no matter how long the sequence is. We adjusted our experimental design in order to compensate for this issue by " slowing down " the substitution matrix 100-fold and multiplying branch lengths by 100. More specifically, we divide each off-diagonal element by 100, and then adjust the diagonal element accordingly so the resulting matrix is …
A Fault-Tolerant Strategy for Multicasting in MPLS Networks

Multicast is an effective way for increasing the efficiency of network resources utilization. But when designed, MPLS did not consider the support of multicast. So multicast in MPLS has many problems. To solve this, we introduce and propose a new multicast strategy in this paper that combines ERM and AMFM. Compared with the previous multicast algorithms, it simplifies LSP setup and has less forwarding states. And it is fault-tolerant. So if implemented in MPLS networks, it can get a better performance.
Fertility and reproductive preferences in post-transitional societies

THE TIMING OF the onset of contemporary fertility transitions and the pace of change during their early phases have been central concerns of researchers and policymakers in recent decades. Demographers and social scientists have studied survey data with detailed information about reproductive behaviors and attitudes of individuals in many countries. This research has provided new insights into the determinants of reproductive behavior and has contributed to the development of increasingly refined and realistic theories of fertility change. Policymakers and program managers in the developing world have been concerned about the contribution of high fertility to rapid population growth and poor reproductive health, and they have focused on implementing effective programs-in practice, mostly family planning programs-to reduce high and unwanted fertility. Until recently, less attention had been given to determinants and consequences of fertility in post-transitional societies. Conventional demographic theories have little to say about the level at which fertility will stabilize at the end of the transition. However, it is usually assumed that population growth in the long run will be near zero, which implies that fertility will on average be close to the replacement level of about 2.1 births per woman (Demeny 1997; Caldwell 1982; Freedman and Berelson 1974). This assumption is, for example, incorporated in past population projections of the United Nations and the World Bank (medium variants). If fertility in contemporary post-transitional societies had indeed leveled off at or near the replacement level, there would have been limited interest in the subject because this would have been expected. However, fertility has dropped below the replacement level-sometimes by a substantial margin-in virtually every population that has moved through the demographic transition. If future fertility remains at these low levels, populations will decline in size and will age rapidly. These demographic developments in
ECG denoising and compression by sparse 2D separable transform with overcomplete mixed dictionaries

In this paper, an algorithm for ECG denoising and compression based on a sparse separable 2-dimensional transform for both complete and overcomplete dictionaries is studied. For overcomplete dictionary we have used the combination of two complete dictionaries. The experimental results obtained by the algorithm for both complete and overcomplete transforms are compared to soft thresholding (for denoising) and wavelet db9/7 (for compression). It is experimentally shown that the algorithm outperforms soft thresholding for about 4dB or more and also outperforms Extended Kalman Smoother filtering for about 2dB in higher input SNRs. The idea of the algorithm is also studied for ECG compression, however it does not result in better compression ratios than wavelet compression.