Miracle-dz/UniFAR-FTUs huggingface dataset:
Towards Multilingual Event Extraction Evaluation: A Case Study for the Czech Language

This paper presents a multilingual corpus of news, annotated with event metadata information. The events in our corpus are from the domain of violence, natural and man made disasters. The main goal of the corpus is automatic evaluation of event detection and extraction systems in different languages. As a use case, we take a rulebased event extraction system, extend it to cover a new language, Czech in our case, and evaluate it on the corpus. We explain what needs to be done to cover a new language, especially learning domain-specific dictionaries and event extraction patterns. The evaluation of the Czech system can be viewed as a starting point for further research into the evaluation of multilingual event extraction systems, which is an important stage during the development of such systems. The comparison of the performance for the Czech and English systems indicates the importance for multilingual event extraction evaluation.
Semantic image segmentation using region bank

Semantic image segmentation assigns a predefined class label to each pixel. This paper proposes a unified framework by using region bank to solve this task. Images are hierarchically segmented leading to region banks. Local features and high-level descriptors are extracted on each region of the bank. Discriminative classifiers are learned based on the histograms of feature descriptors computed from training region bank (TRB). Optimally merging predicted regions of query region bank (QRB) results in semantic labeling. Each algorithmic module used in our system is detailed, and as the proposed framework is generic, any algorithm which fits corresponding modules can be plugged into the framework. Experiments on the challenging Microsoft Research Cambridge (MSRC 21) dataset show that the proposed approach achieves the state-of-the-art performance.
Link Error Prediction in Wireless Communication Systems with Quality Based Power Control

The quality of end-to-end services over wireless communication networks highly depends on the error characteristics of the wireless links. By utilizing the link error characteristics for optimizing the higher layer protocols in a so called cross-layer approach, high quality improvements can be achieved, especially when considering the predictability of errors. In this document it is shown that wireless communication systems with quality based power control mechanisms entail such predictive nature of the link error characteristics. A method for obtaining estimated values of future link error probabilities in the UMTS (universal mobile telecommunications system) DCH (Dedicated CHannel) as an example is presented in this document. Furthermore, it is shown that various well-known and often used error models based on Markov chains are not capable of representing the predictive nature of the channel, whereas a two-state alternating Weibull renewal process describes the characteristics properly.
EXPLORING THE BEHAVIOURAL PATTERNS IN PROJECT-BASED LEARNING WITH ONLINE DISCUSSION: QUANTITATIVE CONTENT ANALYSIS AND PROGRESSIVE SEQUENTIAL ANALYSIS

Project-based learning using online learning environments is becoming increasingly popular. To in-depth explore the behavioural patterns and limitations faced by students in project-based learning where online forums are used. This study conducted an empirical case study of an online project-based learning activity in a management course, in which 70 college students participated. The study integrates two analytical approaches: quantitative content analysis and progressive sequential analysis. The analytical approaches allow researchers to explore and visualize the content and patterns of participants’ online project learning discussion behaviours. The results indicate that learners’ limitations include poor time-management and insufficient initial data collection. The students also demonstrated a lack of proper data evaluation processes and sufficient comprehensive analysis. The limitations are in-depth discussed and suggestions for teachers and educational software developers are also proposed.
The missing link in newcomer adjustment: The role of perceived organizational support and leader‐member exchange

Purpose – The role of social support has been largely ignored in the organizational socialization literature. The purpose of this paper is therefore to examine this missing link in this research through the discussion of the role of perceived organizational support (POS) and leader‐member exchange (LMX) on newcomer adjustment.Design/methodology/approach – A pilot data including 191 newcomers were subjected to confirmatory factor analysis to evaluate the construct validity of the measurement scales on a Chinese sample. The main study data drawn from 167 newcomers in a leading insurance organization in China was then subjected to structural equation modeling to test the hypotheses and model fitness.Findings – Results suggest that LMX plays a significant role in influencing newcomers' POS and social integration. Moreover, newcomers' POS was found to associate with their turnover intentions.Research limitations/implications – This research was based on cross‐sectional and self‐report data, which may not permi.
Biomedical Event Detection using Rules, Conditional Random Fields and Parse Tree Distances

This paper reports on a system developed for the BioNLP'09 shared task on detection and characterisation of biomedical events. Event triggers and types were recognised using a conditional random field classifier and a set of rules, while event participants were identified using a rule-based system that relied on relative distances between candidate entities and the trigger in the associated parse tree. The results on previously unseen test data were encouraging: for non-regulatory events, the F-score was almost 50% (with precision above 60%), with the overall F-score of around 30% (49% precision). The performance on more complex regulatory events was poor (F-measure of 7%). Among the 24 teams submitting the test results, our results were ranked 12th for the overall F-score and 8th for the F-score of non-regulation events.
Essays on social and economic networks

This dissertation studies the outcome of social and economic interactions when agents have the possibility to establish bilateral or multilateral partnerships. Partnerships are critical to the scientific collaboration, RD (ii) if players are farsighted then whether players are allowed to deviate in pairs only or in groups does not matter. Chapter 3 analyzes the formation of risk-sharing networks among farsighted agents in rural areas of developing countries. We provide a theoretical explanation of the observation that risk-sharing takes place among agents having common characteristics (neighborhood, professional or religious affiliation, kinship, etc.). In chapter 4, we propose a new solution concept, the strong curb set, to analyze stability in non-cooperative games when groups of agents may coordinate their moves. We relate our concept with the standard notions of stability. It is shown that there is a class of dynamic learning processes such that at the limit, if memory is long enough, play settles down in a strong curb set.
State-Machine and Deferred-Update Replication: Analysis and Comparison

In the paper, we analyze and experimentally compare two popular replication schemes relying on atomic broadcast: state machine replication (SMR) and deferred update replication (DUR). We estimate the lower bounds on the time of executing requests by the SMR and DUR systems running on multi-core servers. We also consider variants of systems that can process read-only requests with a lower overhead. In the analysis of DUR, we consider conflict patterns. We then formally show the scalability of SMR and DUR, which reflects the capacity of systems to effectively utilize an increasing number of processor cores. Next, we compare SMR and DUR experimentally under different levels of contention, using several benchmarks. We show throughput, abort rate (in DUR), and network congestion. The key results of our work are that neither system is superior in all cases, and that the theoretical and experimental results are heavily influenced by the dominance of either the CPU execution time or atomic broadcast time. We therefore propose to combine both replication schemes and gain the best of both worlds.
A polynomial-time algorithm for the matching of crossing contact-map patterns

Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set S of elements (representing a protein's sequence of amino acids), and a set A of element pairs of S, called arcs (representing amino acids which are closely neighbored in the structure). Given two contact maps (S, A) and (Sp, Ap ) with |A| ges |Ap| the contact map pattern matching (CMPM) problem asks whether the "pattern" (Sp, Ap) "occurs" in (S, A), i.e., informally stated, whether there is a subset of |Ap| arcs in A whose arc structure coincides with Ap . CMPM captures the biological question of finding structural motifs in protein structures. In general, CMPM is NP-hard. In this paper, we show that CMPM is solvable in O(|A|6|Ap| time when the pattern is {<, }-structured, i.e., when each two arcs in the pattern are disjoint or crossing. Our algorithm extends to other closely related models. In particular, it answers an open question raised by Vialette that, rephrased in terms of contact maps, asked whether CMPM for {<, } -structured patterns is NP-hard or solvable in polynomial time. Our result stands in sharp contrast to the NP-hardness of closely related problems. We provide experimental results which show that contact maps derived from real protein structures can be processed efficiently
Decision-feedback equalization using multiple-hyperplane partitioning for detecting ISI-corrupted M-ary PAM signals

A decision-feedback equalizer scheme is derived based on multiple-hyperplane partitioning of signal space for detecting M-ary pulse amplitude modulation symbols transmitted through a noisy intersymbol interference channel. The proposed scheme is based on the fact that the optimal Bayesian decision boundary separating two neighboring signal classes is asymptotically piecewise linear and consists of several hyperplanes, when the signal-to-noise ratio tends to infinity. An algorithm is developed to determine these hyperplanes, which are then used to partition the observation signal space. The resulting detector can closely approximate the optimal Bayesian detector, at an advantage of considerably reduced detector complexity.
Single-shot burst imaging of ultrafast phenomena with sub-picosecond resolution and sub-nanosecond time window

For capturing ultrafast phenomena in sub-nanosecond (10−10 s) time region in a single-shot basis, we modified STAMP (Sequentially timed all-optical mapping photography) utilizing spectral filtering (SF-STAMP). Our SF-STAMP system consists of a 25-beam-generating diffractive optical element (DOE), a band-pass filter (BPF) or BPF-array, and two Fourier transform lenses. This system duplicates 25-multispectral images simultaneously. Therefore, a linearly frequency-chirped pulse makes spectrally and temporally resolved snapshot-images with the temporal resolution determined by the bandwidth of the wavelength selected by the BPFs. The combination of the DOE and BPF enables to select bandwidth of ∼40 nm for each flame, and the BPF-array chooses the entire spectrum ranging from 660 to 810 nm. The observation time window in a single-shot can be tuned from sub-picosecond (10−13 s) to sub-nanosecond (10−10 s) by controlling the second-order dispersion added to the laser pulse. In this work, we demonstrate 25-frame SF-STAMP system with two-kinds of BPF configuration (a tilted single BPF or BPF-array) and a frequency-chirped laser pulse broadened from 650 to 900 nm. Ultrafast 2D-burst images of crystalline-to-amorphous phase transition of Ge2Sb2Te5 and laser ablation process are captured with sub-picosecond to sub-nanosecond time windows.
Passive Direction Finding A Phase Interferometry Direction Finding System for an Airborne Platform

This paper describes the development of a phase interferometry direction finding system for an airborne platform developed for MIT Lincoln Laboratory. A phase interferometer uses the phase difference to determine the Angle of Arrival (AoA) of a received signal, but is unable to distinguish phase differences of more than one period, giving rise to phase ambiguities. The team utilized three antennas to resolve phase ambiguities and was able to determine the azimuthal AoA for a received electromagnetic signal in the X band to within ±0.1◦ in simulations including realistic noise models for a 170◦ field of view. A prototype was implemented using an FPGA-based board for data acquisition connected via USB to a PC for analysis, which connected to another PC via a TCP connection for tracking and display. The hardware was only able to utilize two channels. This limitation resulted in ambiguous solutions in AoA calculations. The team developed a graphical user interface for the system to display results to a system operator.
The in Vivo Phosphorylation Sites in Multiple Isoforms of Amphiphysin I from Rat Brain Nerve Terminals*S

Amphiphysin I (amphI) is dephosphorylated by calcineurin during nerve terminal depolarization and synaptic vesicle endocytosis (SVE). Some amphI phosphorylation sites (phosphosites) have been identified with in vitro studies or phosphoproteomics screens. We used a multifaceted strategy including 32P tracking to identify all in vivo amphI phosphosites and determine their relative abundance and potential relevance to SVE. AmphI was extracted from 32P-labeled synaptosomes, phosphopeptides were isolated from proteolytic digests using TiO2 chromatography, and mass spectrometry revealed 13 sites: serines 250, 252, 262, 268, 272, 276, 285, 293, 496, 514, 539, and 626 and Thr-310. These were distributed into two clusters around the proline-rich domain and the C-terminal Src homology 3 domain. Hierarchical phosphorylation of Ser-262 preceded phosphorylation of Ser-268, -272, -276, and -285. Off-line HPLC separation and two-dimensional tryptic mapping of 32P-labeled amphI revealed that Thr-310, Ser-293, Ser-285, Ser-272, Ser-276, and Ser-268 contained the highest 32P incorporation and were the most stimulus-sensitive. Individually Thr-310 and Ser-293 were the most abundant phosphosites, incorporating 16 and 23% of the 32P. The multiple phosphopeptides containing Ser-268, Ser-276, Ser-272, and Ser-285 had 27% of the 32P. Evidence for a role for at least one proline-directed protein kinase and one non-proline-directed kinase was obtained. Four phosphosites predicted for non-proline-directed kinases, Ser-626, -250, -252, and -539, contained low amounts of 32P and were not depolarization-responsive. At least one alternatively spliced amphI isoform was identified in synaptosomes as being constitutively phosphorylated because it did not incorporate 32P during the 1-h labeling period. Multiple phosphosites from amphI-co-migrating synaptosomal proteins were also identified, including SGIP (Src homology 3 domain growth factor receptor-bound 2 (Grb2)-like (endophilin)-interacting protein 1), AAK1, eps15R, MAP6, α/β-adducin, and HCN1. The results reveal two sets of amphI phosphosites that are either dynamically turning over or constitutively phosphorylated in nerve terminals and improve understanding of the role of individual amphI sites or phosphosite clusters in synaptic SVE.
Designing an Efficient Kernel-Level and User-Level Hybrid Approach for MPI Intra-Node Communication on Multi-Core Systems

The emergence of multi-core processors has made MPI intra-node communication a critical component in high performance computing. In this paper, we use a three-step methodology to design an efficient MPI intra-node communication scheme from two popular approaches: shared memory and OS kernel-assisted direct copy. We use an Intel quad-core cluster for our study. We first run micro-benchmarks to analyze the advantages and limitations of these two approaches, including the impacts of processor topology, communication buffer reuse, process skew effects, and L2 cache utilization. Based on the results and the analysis, we propose topology-aware and skew-aware thresholds to build an optimized hybrid approach. Finally, we evaluate the impact of the hybrid approach on MPI collective operations and applications using IMB, NAS, PSTSWM, and HPL benchmarks. We observe that the optimized hybrid approach can improve the performance of MPI collective operations by up to 60%, and applications by up to 17%.
An extension of PROMETHEE with evidential evaluations

We consider ranking problems where the actions are evaluated on a set of ordinal criteria and where the evaluations are imperfect and represented by basic belief assignments (BBAs). In this paper, a model inspired by PROMETHEE is proposed within this context. The notions of ascending and descending belief functions are used in order to compare the alternatives on each criterion. The proposed approach is also illustrated by a pedagogical example.
A common cell-type specific surface antigen in cultured human glial cells and fibroblasts: loss in malignant cells

Fibroblast surface antigen (SFA) is a high molecular weight protein antigen, first shown on the surface of cultured fibroblasts in fibrillar structures. It is shed to the extracellular medium and also present in the circulation (serum and plasma). Fibroblasts transformed by tumor viruses produce SFA but do not retain it on cell surface. In this report we show that SFA is also present in cultured nonestablished astroglial cells. The glial and fibroblast SFAs are immunologically indistinguishable. Glial cells (three different nonestablished lines) contain more SFA per milligram cellular protein than fibroblasts. SFA was located on cell surface in fibrillar striae that frequently extended out from the cell body. Fluorescence was also found intracellularly in the cytoplasm. Malignant gliomas (astrocytomas) established to grow in culture from human tumor material produced SFA into the growth medium but had very little (lines U-105 MG and U-343 MG) or no detectable (lines U-118 MG, U-251 MG, and U-343 MG-a) cell surface SFA. In cultures of the glioma cells many cells, in particular those that appeared to be in the telophase stage, stained strongly positive for intracellular cytoplasmic SFA. These data demonstrate that similar to fibroblasts transformed experimentally by oncogenic viruses, cells grown from naturally occurring human tumors (glioblastomas) produce SFA but lose ability to retain it on cell surface.
Nearly-linear size holographic proofs

We show how to construct holographic (or transparent) proofs of size nl” that can be checked by a verifier that is allowed to read only O(1) bits of the proof and has access to O(log n) random bits, for all c > 0. In general, we construct proofs of size ~1+2 ‘0(9(”)) (log n)q’(n)l checkable by the query of 2q~(n)) bits, for any q(n) = O(log log n). An essential element of our construction is a proof that the low-degree test used by Arora and Safra [AS92] is effective on domains of size linear in the degree of the encoded polynomial.
Think before you act: organizing structures of action in technology-induced change

Purpose – The purpose of this paper is to explore the influence of technology on organizational change during an electronic government implementation in a public organization in East Malaysia. It also examines the interpretation and enactment of technology as affecting organizational performance. Design/methodology/approach – The research utilized a case study approach involving semi-structured interviewing with 18 employees representing department heads, middle managers, and technical officers. The data were triangulated by unobtrusive observations of meetings and work processes as well as archival records. Findings – Technology could either constrain or enable change based on the interplay of intended and unintended use. The way actors interpret the role of technology during change also affects their enactment of technology, leading to both innovation and disruption in work practices. In turn, their enactment patterns shape organizational structure, strategy, and performance. Research limitations/implic.
Detecting contextual collective anomalies at a Glance

Many phenomena in our world can be modeled as networks, from neurons in the human brain, computer networks and bank transactions to social interactions. Anomaly detection is an important data mining task consisting in detecting rare objects that deviate from the majority of the data. Contextual collective anomaly detection techniques can be applied to intrusion detection in computer networks, bank fraud detection, or finding people with strange behavior in social networks. In this work, a fast and intuitive algorithm to detect collective contextual anomalies is presented. Furthermore, the importance of selecting algorithms which find meaningful outliers for the application domain specialists is analyzed.
Adaptive Gray Level Co-occurrence Probabilities for Texture Segmentation Based on Coarse-to-fine Strategy

In the applications of image segmentation, the tasks usually focused on extracting the exact boundaries among different texture classes. Traditionally, the popular texture feature extraction approach, gray level cooccurrence probability (GLCP) method, is widely used for extracting the boundaries. It scans the whole image by windows with fixed size to count the gray level co-occurrence and uses statistics to calculate the texture characteristics at each window. However, it has a tendency to misclassify and erode texture boundaries, especially for large window sizes and irregular texture boundaries in images. This paper presents the adaptive gray level co-occurrence probability (AGLCP) approach to improve the original GLCP method for the analysis of the image textures. Based on the coarse-to-fine strategy, the AGLCP method can adjust the scanning window and analyze texture features, adaptively. Therefore, it can generate a more suitable statistic characteristic matrix for further image segmentation. Experimental results show that this method can preserve the edge strength between textures and provide better segmentations when comparing with the previous methods.