Miracle-dz/UniFAR-FTUs huggingface dataset:
Human-inspired search for redundancy in automatic sign language recognition

Human perception of sign language can serve as inspiration for the improvement of automatic recognition systems. Experiments with human signers show that sign language signs contain redundancy over time. In this article, experiments are conducted to investigate whether comparable redundancies also exist for an automatic sign language recognition system. Such redundancies could be exploited, for example, by reserving more processing resources for the more informative phases of a sign, or by discarding uninformative phases. In the experiments, an automatic system is trained and tested on isolated fragments of sign language signs. The stimuli used were similar to those of the human signer experiments, allowing us to compare the results. The experiments show that redundancy over time exists for the automatic recognizer. The central phase of a sign is the most informative phase, and the first half of a sign is sufficient to achieve a recognition performance similar to that of the entire sign. These findings concur with the results of the human signer studies. However, there are differences as well, most notably the fact that human signers score better on the early phases of a sign than the automatic system. The results can be used to improve the automatic recognizer, by using only the most informative phases of a sign as input.
A Simple and Accurate Color Face Detection Algorithm in Complex Background

Human face detection plays an important role in many applications such as video surveillance, face recognition, and face image database management. This paper describes a fast face detection algorithm with accurate results. We use lighting compensation to improve the performance of color-based scheme, and reduce the computation complexity of feature-based scheme. Our method is effective on facial variations such as dark/bright vision, close eyes, open mouth, a half-profile face, and pseudo faces. It is worth stressing that our algorithm can also discriminate cartoon and human face correctly. The experimental results show that our approach can detect a frame in 111 msecs with the 92.3% detection rate
Evolution of Co-Authors Communities Formed by Terms on DBLP

The DBLP Computer Science Bibliography server provides biblio- graphic information on major computer science journals and proceedings. DBLP indexes more than 2.1 million articles and contains titles of articles, their authors, years of publication etc. Downloadable DBLP dataset is very interesting resource for evolution analysis of co-author networks. The paper deals with subgraphs of the authors from DBLP with common interests. The common interest of the authors is defined by terms, which are extracted from the titles of articles. The subgraphs are extracted for each year separately based on the published years. These subgraphs represent the communities of co-authors, for which is observed their development in time. That new view of these communities of the co-authors offer a new way for analysis and measurement of article datasets.
Planning a urban Radio over Fibre network

In order to reduce the costs associated with network planning, this paper presents a tool tailored for Radio over Fibre networks that: determines the location of antennas to cover a Manhattan like scenario considering candidate sites at different heights, for example on top of building or on street lamp posts; defines the number and location of optical splitters; determines the amount of fibre required for the deployment; and defines the path that reduces conduit usage. In this paper, we also describe the algorithms developed for this tool, including an algorithm to divide the deployment area, an algorithm to define the location of the optical splitters and a modified Dijkstra's algorithm to find the shortest path that also reduces the amount of conduits. The main outcomes of a study comprising different scenarios are that there is no significant fibre savings from supporting more than 10 antennas per optical splitter and that the modified Dijkstra's algorithm allows saving more than 20% in length of conduits.
Dynamic and Distributed Multipath Routing Policy for High-Speed Cluster Networks

The increasing demand of parallel applications in Cluster Computing requires the use of Interconnection Networksto provide low and bounded communication delays. However, message congestion appears when communication load between nodes is not fairly distributed over the network. Congestion spreading increases latency and reduces network throughput causing important performance degradation. In this paper we present Dynamic Routing Balancing with Multipath Distribution (DRB-MD), a new method developed to control network congestion based on a uniform balancing of communication load. DRB-MD distributes the traffic load according to a gradual and load-controlled path expansion. It monitors message latency in network switches, makes decisions about how many alternative paths should be used, and finally decides which path (or paths) to use between each source-destination pair. Experiments with permutation patterns and hotspot traffic were conducted to evaluate DRB-MD performance under conditions commonly created by parallel scientific applications.
Secure group communication protocol for distributed systems

In distributed applications like groupware, group communication among multiple entities is required. The local area networks (LANs) and radio networks provide broadcast communication at the media access control (MAC) layer, that is, every entity can receive every protocol data unit (PDU) transmitted in the network. Group communication among multiple entities can be easily realized by these networks. One problem in the broadcast network is how to provide secure communication for the group. In this paper, we discuss how to provide secure group communication in the presence of attacks by malicious entities. The protocol is based on the distributed control scheme by using less-secure broadcast networks. A group of entities is named a cluster. By the protocol, only and all the entities in the cluster can agree on a same secret key by exchanging the nonce enciphered by the public key. A subset of the cluster may require such secure communication that the other entities in the cluster cannot join the communication. In this paper, we discuss how to establish the secure subcluster communication in the cluster. <<ETX>>
Cognitive study of polysemy, metaphor and metonymy in Azerbaijani Turkish

The aim of the present study is to investigate the role of metaphor and metonymy in the polysemy of the visual verb of /görmək/ (see) in Azerbaijani Turkish within the framework of cognitive semantics. The research method is a descriptive analytic and the study tries to present the various meanings of the verb. To achieve this goal, the linguistic corpus was gathered by using Azerbaijani Turkish dictionaries, books, magazines, newspapers, and one of the authors' linguistic intuitions. The findings indicate that for visual verb /görmək/ (see) there are 24 senses with regard to its classification and abstracting away of contextual variations. They also show that the polysemy is a systematic phenomenon and factor such as metaphor and metonymy are crucially involved in the formation and description of polysemy and this makes broad meaning and eventually leads to polysemy of verb. In this way, semantic extensive network of verb is formed and on the other hand, it is claimed that metaphor has stronger role than metonymy in the formation of polysemy and usage of verb in the different context. The findings also show that polysemy is not randomly and forms based on our experiences of different concepts and the meanings of verbs are different from each other because they are understood from different ways.
Uniform limit theorems for wavelet density estimators

Let pn(y) = Σ k Φ (y-k) + Σ jn-1 l=0 Σ k lk 2l/2 ψ(2 l y-k) be the linear wavelet density estimator, where φ, ψ are a father and a mother wavelet (with compact support ? are the empirical wavelet coefficients based on an i.i.d. sample of random variables distributed according to a density p 0 on R, and j n ∈ Z, j n ∞. Several uniform limit theorems are proved: First, the almost sure rate of convergence of sup y∈R | Pn (y) - Ep n (y)| is obtained, and a law of the logarithm for a suitably scaled version of this quantity is established. This implies that sup y∈R |p n (y) - po (y)| Attains the optimal almost sure rate of convergence for estimating p 0 , if j n is suitably chosen. Second, a uniform central limit theorem as well as strong invariance principles for the distribution function of p n , that is, for the stochastic processes n(F W n (s) - F (s)) n∫ s - ∞ (pn - p 0 ), s ∈ R, are proved; and more generally, uniform central limit theorems for the processes n∫(p n - P 0 )? , f ∈ F, for other Donsker classes F of interest are considered. As a statistical application, it is shown that essentially the same limit theorems can be obtained for the hard thresholding wavelet estimator introduced by Donoho et al. [Ann. Statist. 24 (1996) 508-539].
Telomere Maintenance and Survival in Saccharomyces cerevisiae in the Absence of Telomerase and RAD52

Telomeres are essential features of linear genomes that are crucial for chromosome stability. Telomeric DNA is usually replenished by telomerase. Deletion of genes encoding telomerase components leads to telomere attrition with each cycle of DNA replication, eventually causing cell senescence or death. In the Saccharomyces cerevisiae strain W303, telomerase-null populations bypass senescence and, unless EXO1 is also deleted, this survival is RAD52 dependent. Unexpectedly, we found that the S. cerevisiae strain S288C could survive the removal of RAD52 and telomerase at a low frequency without additional gene deletions. These RAD52-independent survivors were propagated stably and exhibited a telomere organization typical of recombination between telomeric DNA tracts, and in diploids behaved as a multigenic trait. The polymerase-δ subunit Pol32 was dispensable for the maintenance of RAD52-independent survivors. The incidence of this rare escape was not affected by deletion of other genes necessary for RAD52-dependent survival, but correlated with initial telomere length. If W303 strains lacking telomerase and RAD52 first underwent telomere elongation, rare colonies could then bypass senescence. We suggest that longer telomeres provide a more proficient substrate for a novel telomere maintenance mechanism that does not rely on telomerase, RAD52, or POL32.
Compress-and-Forward Cooperative MIMO Relaying With Full Channel State Information

This paper addresses cooperative time division duplex (TDD) relaying in the multiple-antenna case with full channel state information (CSI), i.e., assuming perfect knowledge of all channels. The main focus of the paper is on the compress-and-forward (CF) strategy, for which an achievable rate on the Gaussian MIMO relay channel can be derived by applying distributed vector compression techniques. The processing at the CF relay consists in a conditional Karhunen-Loeve transform (CKLT) followed by a separate Wyner-Ziv (WZ) coding of each output stream at a different rate. The paper provides a simple analytical expression for the optimum WZ coding rates, and also proposes an iterative procedure to perform this optimization jointly with that of the transmit covariance matrices at the source and relay. The multiple access channel (MAC) formed by the source and relay transmitting simultaneously to the destination is considered, and it is shown that an optimal decoding order exists at least in the single-antenna case. We discuss the extension to MIMO-OFDM, as well as practical source coding implementation. The CF achievable rates are benchmarked with other upper and lower bounds on capacity. Simulation results show that CF can outperform decode-and-forward (DF) and approach capacity for realistic SNR values, which validates the performance of the proposed optimization procedure.
Cooperating Resource Managers

Operating System designers currently face two major challenges. One is the coexistence of time-sharing and dynamic real-time components on a single machine and even in the same application. The other is that many acceleration techniques (e.g. caches) used in modern hardware architectures work very well for the average case, but not for the worst case which counts for real-time systems. This scenario is addressed by DROPS, the Dresden Realtime OPerating System. DROPS uses resource managers which have been and still are being built in an ad hoc manner and that allow the reservation of resources, the enforcement of the reservations and the usage of unreserved or reserved but unused resources for other, non-real-time applications. While these resource managers have been built and work very well and are well published (see e.g. [5, 9, 3]), they all have their own, unique ad hoc interface. This paper describes a more unified, systematic approach that is applicable at various system levels and allows a systematic construction of applications using cooperating resource managers.
Does the Brain Extrapolate the Position of a Transient Moving Target?

When an object moves in the visual field, its motion evokes a streak of activity on the retina and the incoming retinal signals lead to robust oculomotor commands because corrections are observed if the trajectory of the interceptive saccade is perturbed by a microstimulation in the superior colliculus. The present study complements a previous perturbation study by investigating, in the head-restrained monkey, the generation of saccades toward a transient moving target (100–200 ms). We tested whether the saccades land on the average of antecedent target positions or beyond the location where the target disappeared. Using target motions with different speed profiles, we also examined the sensitivity of the process that converts time-varying retinal signals into saccadic oculomotor commands. The results show that, for identical overall target displacements on the visual display, saccades toward a faster target land beyond the endpoint of saccades toward a target moving slower. The rate of change in speed matters in the visuomotor transformation. Indeed, in response to identical overall target displacements and durations, the saccades have smaller amplitude when they are made in response to an accelerating target than to a decelerating one. Moreover, the motion-related signals have different weights depending upon their timing relative to the target onset: early signals are more influential in the specification of saccade amplitude than later signals. We discuss the “predictive” properties of the visuo-saccadic system and the nature of this location where the saccades land, after providing some critical comments to the “hic-et-nunc” hypothesis (Fleuriet and Goffart, 2012). SIGNIFICANCE STATEMENT Complementing the work of Fleuriet and Goffart (2012), this study is a contribution to the more general scientific research aimed at understanding how ongoing action is dynamically and adaptively adjusted to the current spatiotemporal aspects of its goal. Using the saccadic eye movement as a probe, we provide results that are critical for investigating and understanding the neural basis of motion extrapolation and prediction.
Leveraging rating behavior to predict negative social ties

User social networks are a useful information for many information access related tasks, such as recommendation or information retrieval. In such tasks, recent papers have exploited the polarity of these links (friend/enemy) by capturing more precisely social patterns. This negative information being relatively scarce, a recent work proposed to infer it in social networks that contain none. However, this work relies on the direct interaction between users. In this paper, we pursue this approach under the assumption that we do not have access to this kind of data neither, thus allowing to cope with most social networks, where users can rate items and have friendship relationships. We exploit the user ratings polarity, i.e the fact that a rating can be positive (like) or negative (dislike), to infer negative ties. Experiments on the Epinions dataset show the potential of our approach.
Resource Allocation for Downlink Cellular OFDMA Systems: Part II - Asymptotic Analysis and Applications

In a companion paper (see Resource Allocation for Downlink Cellular OFDMA Systems: Part I— Optimal Allocation), we characterized the optimal resource allocation in terms of power control and sub-carrier assignment, for a downlink OFDMA system impaired by multicell interference. In our model, the network is assumed to be one dimensional (linear) for the sake of analysis. We also assume that a certain part of the available bandwidth is likely to be reused by different base stations and that the other part of the bandwidth is shared in an orthogonal way between the different base stations. The optimal resource allocation characterized in Part I is obtained by minimizing the total power spent by the network under the constraint that all users’ rate requirements in nats/s/Hz are satisfied. It is worth noting that when optimal resource allocation is used, any user receives data either in the reused bandwidth or in the protected bandwidth, but not in both (except for at most one pivot user in each cell). In the present paper, we study the asymptotic behavior of the optimal resource allocation as the number of users in each cell tends to infinity. Our analysis allows to characterize the performance of the optimal resource allocation algorithm and to determine the asymptotically optimal pivot-position. As a byproduct of our analysis, we propose a decentralized suboptimal resource allocation algorithm with low complexity and prove that the proposed algorithm is asymptotically optimal when the number of users tends to infinity. Finally, we characterize the optimal value of the frequency reuse factor. Simulations sustain our claims and show that substantial performance improvements are obtained when the optimal value of the frequency reuse factor is used.
Regression-Based Fusion Prediction for Collaborative Filtering

Existing memory-based collaborative filtering techniques predict the unknown preference by taking weighted average of ratings by similar users on the active item or ratings of similar items by the active user, which just make use of the predictive power of ratings located in the row or column of user-item matrix corresponding to the active user or the active item. Due to sparsity, it is possible that some highly similar users have not rated the active item or some highly similar items have not been rated by the active user, resulting in they contributing nothing to the prediction. In this paper, first we propose improved regression-based methods to model the prediction of individual rating for the unknown preference. Then we propose regression-based fusion prediction (RBFP) algorithm, which adopts two-stage linear regression technique to exploit the predictive power of these unrated but highly similar items and these highly similar users who have not rated the active item. We have conducted extensive experiments, especially, we have investigated the sensitivity of parameters over the time, performance variation with the size of memory space available. Having done comparisons with some popular recommendation algorithms, we can conclude that our proposed methods can indeed improve the performance of collaborative filtering.
Study on Switched Reluctance Motor Control System Based on DSP

Accord to the theory of micro-step control, this study is about a design of a four-phase switched reluctance motor based on DSP-driven control system. Firstly, the study is about the design of the hardware circuit, such as the power inverter and its drive, current detection, position detection and the system power supply. And then to build a switched reluctance motor control system, TMS320L2812 as the core of control. Experiments show that this control strategy control is simple, but able to effectively restrain the torque ripple of switched reluctance motor under low speed.
MNE microfoundations and routines for building a legitimate and sustainable position in emerging markets

Summary A number of studies have analysed how multinational enterprises (MNEs) develop appropriate strategies for managing the institutionally different contexts of various markets. However, we still know rather little about how MNEs manage different institutional pressures when they operate in emerging markets. These markets have a higher level of uncertainty as their values and structures undergo change. This paper investigates the microfoundations and routines that can be part of developing a firm's capability to achieve a legitimate and environmentally sustainable position in emerging markets. We focus upon the microfoundations and routines for managing regulative, normative, and cultural–cognitive pressures. The paper utilizes an extensive qualitative case study approach. It reports a study at corporate and subsidiary levels of 3 Swedish MNEs in the in 4 markets: Brazil, Russia, India and China. The study identifies a set of routines for managing each of the 3 institutional forces and supporting microfoundations at individual, interactive, and structural levels. We are thus able to offer new insights on how the institutional context interacts with MNE strategies and identify more generic routines and microfoundations behind the capability for developing a sustainable market position.
Infant-feeding patterns and cardiovascular risk factors in young adulthood: data from five cohorts in low- and middle-income countries

Background Infant-feeding patterns may influence lifelong health. This study tested the hypothesis that longer duration of breastfeeding and later introduction of complementary foods in infancy are associated with reduced adult cardiovascular risk. Methods Data were pooled from 10 912 subjects in the age range of 15–41 years from five prospective birth-cohort studies in low-/middle-income countries (Brazil, Guatemala, India, Philippines and South Africa). Associations were examined between infant feeding (duration of breastfeeding and age at introduction of complementary foods) and adult blood pressure (BP), plasma glucose concentration and adiposity (skinfolds, waist circumference, percentage body fat and overweight/obesity). Analyses were adjusted for maternal socio-economic status, education, age, smoking, race and urban/rural residence and infant birth weight. Results There were no differences in outcomes between adults who were ever breastfed compared with those who were never breastfed. Duration of breastfeeding was not associated with adult diabetes prevalence or adiposity. There were U-shaped associations between duration of breastfeeding and systolic BP and hypertension; however, these were weak and inconsistent among the cohorts. Later introduction of complementary foods was associated with lower adult adiposity. Body mass index changed by −0.19 kg/m2 [95% confidence interval (CI) −0.37 to −0.01] and waist circumference by −0.45 cm (95% CI −0.88 to −0.02) per 3-month increase in age at introduction of complementary foods. Conclusions There was no evidence that longer duration of breastfeeding is protective against adult hypertension, diabetes or overweight/adiposity in these low-/middle-income populations. Further research is required to determine whether ‘exclusive’ breastfeeding may be protective. Delaying complementary foods until 6 months, as recommended by the World Health Organization, may reduce the risk of adult overweight/adiposity, but the effect is likely to be small.