Miracle-dz/UniFAR-FTUs huggingface dataset:
A network coding-based packet forwarding scheme for unicast random access networks with exponential backoff

Exponential backoff is an intrinsic feature of MAC-layer standards of most types of ad hoc networks. It leads to random access channels with memory. In this paper we propose a new network coding-based packet forwarding scheme suitable for multiple unicast scenarios in downlink direction of a wireless network. The wireless nodes as well as the access point attempt to access the channel, based on slotted Aloha with exponential backoff. In the proposed scheme we convert multiple unicast scenario to a combination of several anycast and a multicast scenarios. By proposing an open multiclass queueing network, we are able to derive the maximum stable download throughput of the network. The superiority of the proposed scheme compared to simple forwarding scheme as well as the optimum scheme recently proposed for memoryless channels is shown in different conditions. Simulation results confirm our analytical approach.
A Pay-and-Stay model for tackling intruders in hybrid wireless mesh networks

Intrusion handling in wireless mesh networks (WMNs) is a relatively less addressed topic. The difficulty may lie in the fact that there are other wireless networks for which some intrusion detection or prevention schemes are proposed that could also be applied in some way in a WMN setting. As those schemes are contributing, researchers may not find it necessary to specifically focus on this field. Another critical reason may be the difficulty in developing an effective scheme for WMNs. In fact, the structural differences among various wireless ad hoc networking technologies make it imperative to devise the mechanisms in subtle but critically different ways. For WMNs, there is a proper network backbone that is called mesh backbone (which is not present in many other wireless network counterparts), which supports the fringe part or the mesh clients. Hence, it is often possible to install the intrusion handling mechanisms or agents in the stable part and allowing some flexibility in the client or fringe parts. Nonetheless, instead of thinking in this pattern, we take a different approach of tackling intrusion by allowing an intruder to stay in the network as long as it proves to be worthy of staying in the network by supporting the network’s regular activities. The idea is that by not always directly purging rogue entities, one could exploit the intruder’s resources, thereby benefiting the network. We call our approach an intrusion-tackling mechanism and term it a Pay-and-Stay model. Alongside presenting the details and analysis of our model, in this paper, we also present the basics of various forms of intrusion handling in such types of networks. Using our evaluation results, we found that the model could be very effective in handling intruders and defending the network against a broad range of security attacks.
Stock Prices and Fundamentals: A Macroeconomic Perspective

This paper compares the predictions for the market value of firms from the Gordon growth model with those from a dynamic general-equilibrium model. The predictions for movements in the market value of firms following shifts in preferences, growth prospects, and risk are quantitatively and qualitatively different across the models. While previous research illustrated how a drop in the required return or an increase in the growth rate of the economy can explain the run-up in equity values in the 1990s in the Gordon growth model, the general-equilibrium model suggests that such results are misleading.
Diffusion filtering of depth maps in stereo video coding

A method for removing irrelevant information from depth maps in Video plus Depth coding is presented. The depth map is filtered in several iterations using a diffusional approach. In each iteration smoothing is carried out in local sample neighborhoods considering the distortion introduced to a rendered view. Smoothing is only applied when the rendered view is not affected. Therefore irrelevant edges and features in the depth map can be damped while the quality of the rendered view is retained. The processed depth maps can be coded at a reduced rate compared to unaltered data. Coding experiments show gains up to 0.5dB for the rendered view at the same bit rate.
Randomized Coordination Search for Scalable Multiagent Planning (Extended Abstract)

Multiagent Markov Decision Processes (MMDPs) are difficult problems to solve due to the exponential increase in the size of the planning space in the number of agents. One of the most successful approaches for solving MMDPs utilizes coordination graphs (CGs), which encode the decouplings between the agents to reduce the dimension of the value function, which in turn reduces the computational complexity. However, it is typically assumed that the structure of the CG is available a priori, which is a limiting assumption for many practical scenarios. This work presents a randomized planning scheme based on the Bayesian optimization algorithm to probabilistically search over the space of CGs to discover CG structures that yield high return policies. The results demonstrate that the proposed method is superior in terms of convergence speed and accumulated reward.
A Scheduling-Based Medium Access Control Protocol for Supporting Multi-class Services in Wireless Networks

In this paper, we propose a scheduling-based medium access control (MAC) protocol for supporting multi-class services in wireless networks. The proposed protocol is a centralized MAC protocol which applies a coordinator node (CN) to coordinate the network. Our protocol is composed of a slot-scheduling algorithm called weighted scheduling and a quality of service (QoS) enhanced admission control algorithm. The weighted scheduling algorithm is designed to efficiently utilize the network bandwidth and fairly schedule the transmission for various types of services, whereas the QoS-enhanced admission control algorithm is proposed to manage resources and guarantee the QoS requirements of services. We make mathematical analysis for the protocol parameters and compare our protocol with IEEE 802.11e EDCF and IEEE 802.11 PCF in terms of throughput and delay by conducting simulations. The experimental results show that our protocol has the best throughput and delay performance among the simulated protocols. Moreover, our protocol has much fewer collisions than IEEE 802.11e EDCF has and always keeps on excellent performance even in the high-loaded network.
Bridges: a tool for identifying local similarities in long sequences

SUMMARY Bridges is a heuristic search tool that uses short word matches to rapidly identify local similarities between sequences. It consists of three stages: filtering input sequences, identifying local similarities and post-processing local similarities. As input sequence data are released from memory after the filtering stage, genome-scale datasets can be efficiently compared in a single run. Bridges also includes 20 parameters, which enable the user to dictate the sensitivity and specificity of a search. AVAILABILITY Bridges is implemented in the C programming language and can be run on all platforms. Source code and documentation are available at http://github.com/rassis/bridges.
Integrating Finite-state Technology with Deep LFG Grammars

Researchers at PARC were pioneers in developing finite-state methods for applications in computational linguistics, and one of the original motivations was to provide a coherent architecture for the integration of lower-level lexical processing with higher-level syntactic analysis (Kaplan and Kay, 1981; Karttunen et al., 1992; Kaplan and Kay, 1994). Finite-state methods for tokenizing and morphological analysis were initially incorporated into the Grammar-writer’s Workbench for Lexical Functional Grammar (LFG) (Dalrymple, 2001; Kaplan and Bresnan, 1982), a relatively complete LFG parsing system but for relatively small-scale grammars (Kaplan and Maxwell, 1996). Finite-state transducers, also of a relatively small scale, were constructed automatically in this system from specifications provided by the LFG grammar writer, using the compilation techniques described by (Kaplan and Kay, 1994).
S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut

One standard solution for analyzing large natural graphs is to adopt distributed computation on clusters. In distributed computation, graph partitioning (GP) methods assign the vertices or edges of a graph to different machines in a balanced way so that some distributed algorithms can be adapted for. Most of traditional GP methods are offline, which means that the whole graph has been observed before partitioning. However, the offline methods often incur high computation cost. Hence, streaming graph partitioning (SGP) methods, which can partition graphs in an online way, have recently attracted great attention in distributed computation. There exist two typical GP strategies: edge-cut and vertex-cut. Most SGP methods adopt edge-cut, but few vertex-cut methods have been proposed for SGP. However, the vertex-cut strategy would be a better choice than the edge-cut strategy because the degree of a natural graph in general follows a highly skewed power-law distribution. Thus, we propose a novel method, called S-PowerGraph, for SGP of natural graphs by vertex-cut. Our S-PowerGraph method is simple but effective. Experiments on several large natural graphs and synthetic graphs show that our S-PowerGraph can outperform the state-of-the-art baselines.
Rational Herds: Subject Index

1. Introduction Part I. Social Learning: 2. Bayesian tools 3. Social learning with a common memory 4. Cascades and herds 5. Limited memories 6. Delays 7. More delays 8. Outputs 9. Networks and diffusion 10. Words Part II. Coordination: 11. Guessing to coordinate 12. Learning to coordinate 13. Delays and payoff externalities Part III. Financial Herding: 14. Sequences of financial trades 15. Gaussian financial markets 16. Financial frenzies.
Electroretinographic features of the retinopathy, globe enlarged (rge) chick phenotype

Purpose The purpose of the study was to characterize the electroretinographic features of the autosomal recessive retinopathy, globe enlarged (rge) phenotype, in chickens (Gallus gallus). Methods Dark-adapted, light-adapted intensity series and light-adapted 30 Hz flicker responses were recorded from rge and age matched normal control chicks from one to 270 days of age. Retinal sections from rge and control retinas were examined in 7 and 270-day-old chicks. Results Electroretinogram (ERG) thresholds of rge birds were raised, the intensity response plots were shifted toward brighter intensities, and retinal sensitivity was reduced. The leading slope of the dark- and light-adapted a-waves was more shallow than normal, suggesting altered photoreceptor responses. The inner retinal components to the ERG were also abnormal; there was a marked lack of oscillatory potentials and an abnormally smooth and broad shape to the b-wave. Additionally, the b-wave was supernormal in response to brighter stimuli in the earlier stages of the disease. There was a progressive deterioration in ERG amplitudes with age that mirrored a slowly progressive thinning of the photoreceptor layer. Conclusions The rge chicken has unusual ERG changes from an early age with altered waveforms and initially they develop a supernormal b-wave. This is followed by a progressive reduction of ERG amplitudes with age. The changes suggest that both photoreceptor and inner retinal responses are abnormal. Additional studies are needed to further elucidate the origin of the abnormal ERG components in the rge chick.
SAR backscatter multitemporal compositing via local resolution weighting

A method is presented for generating composite SAR imagery from a set of multiple radiometrically terrain-corrected (RTC) backscatter images and their co-registered local illuminated areas. The process is implemented in map geometry: the resolution of each image is estimated locally as the inverse of the local contributing area and used to weight the contributions from all available observations. Some potential contributors could be out-of-swath or occluded by radar shadow. The resulting composite backscatter image can trade off temporal resolution for improved local spatial resolution while simultaneously increasing the local number of looks. The composite image is characterized by more homogenous properties (resolution, noise) in comparison to single acquisitions. The technique is demonstrated using ScanSAR data from ENVISAT ASAR and Radarsat-2.
Specific Roles of NMDA Receptor Subunits in Mental Disorders

N-methyl-D-aspartate (NMDA) receptor plays important roles in learning and memory. NMDA receptors are a tetramer that consists of two glycine-binding subunits GluN1, two glutamate-binding subunits (i.e., GluN2A, GluN2B, GluN2C, and GluN2D), a combination of a GluN2 subunit and glycine-binding GluN3 subunit (i.e., GluN3A or GluN3B), or two GluN3 subunits. Recent studies revealed that the specific expression and distribution of each subunit are deeply involved in neural excitability, plasticity, and synaptic deficits. The present article summarizes reports on the dysfunction of NMDA receptors and responsible subunits in various neurological and psychiatric disorders, including schizophrenia, autoimmune-induced glutamatergic receptor dysfunction, mood disorders, and autism. A key role for the GluN2D subunit in NMDA receptor antagonist-induced psychosis has been recently revealed.
Extraction of individual pedestrians employing stereo camera images

A traffic accident occurs mainly because of carelessness of a driver. To prevent such an accident, many systems which detect pedestrians from vehicle are proposed. But most of these systems give a warning to a driver every time when a pedestrian is detected. The effect of warning becomes lower if the frequency of warning increases in a busy area. The objective of this study is to develop a technique for detecting pedestrians from a vehicle and to arrange them according to their potential risks by analyzing their behaviors. In this paper, we propose a technique for segmenting pedestrians employing stereo camera images to analyze a pedestrian's behavior. First, foreground regions are extracted employing background estimation using the mixture of Gaussian model. After extracting foreground regions in an input image, these regions are segmented by using the distance information. By using this method, each shape of the detected pedestrians can be obtained even when pedestrians are overlapping with each other. The proposed technique was examined experimentally employing real video images and satisfactory results were obtained.
A Tool to Analyze Potential I/O Attacks against PCs

Instead of making the CPU execute malware, I/O attacks exploit peripheral devices and, as such, can't be detected by traditional anti-malware techniques. The proposed multipurpose FPGA-based tool can help analyze such attacks and be programmed to mimic a malicious I/O controller, host a Trojan horse, and even apply fuzzing techniques to identify vulnerabilities that could be exploited from I/O controllers or peripheral devices.
Predictive Saccade Target Selection in Superior Colliculus during Visual Search

Searching for a visual object naturally involves sequences of gaze fixations, during which the current foveal image is analyzed and the next object to inspect is selected as a saccade target. Fixation durations during such sequences are short, suggesting that saccades may be concurrently processed. Therefore, the selection of the next saccade target may occur before the current saccade target is acquired. To test this hypothesis, we trained four female rhesus monkeys (Macaca mulatta) to perform a multiple-fixation visual conjunction search task. We simultaneously recorded the activity of sensorimotor neurons in the midbrain superior colliculus (SC) in two monkeys. In this task, monkeys made multiple fixations before foveating the target. Fixation durations were significantly shorter than the latency of the initial responses to the search display, with approximately one-quarter being shorter than the shortest response latencies. The time at which SC sensorimotor activity discriminated the target from distracters occurred significantly earlier for the selection of subsequent fixations than for the selection of the first fixation. Target selection during subsequent fixations occurred even before the visual afferent delay in more than half of the neuronal sample, suggesting that the process of selection can encompass at least two future saccade targets. This predictive selection was present even when differences in saccade latencies were taken into account. Altogether, these findings demonstrate how neural representations on the visual salience map are processed in parallel, thus facilitating visual search.
A Review of the Application of Multiobjective Evolutionary Fuzzy Systems: Current Status and Further Directions

Over the past few decades, fuzzy systems have been widely used in several application fields, thanks to their ability to model complex systems. The design of fuzzy systems has been successfully performed by applying evolutionary and, in particular, genetic algorithms, and recently, this approach has been extended by using multiobjective evolutionary algorithms, which can consider multiple conflicting objectives, instead of a single one. The hybridization between multiobjective evolutionary algorithms and fuzzy systems is currently known as multiobjective evolutionary fuzzy systems. This paper presents an overview of multiobjective evolutionary fuzzy systems, describing the main contributions on this field and providing a two-level taxonomy of the existing proposals, in order to outline a well-established framework that could help researchers who work on significant further developments. Finally, some considerations of recent trends and potential research directions are presented.
Investigating intuitiveness and effectiveness of gestures for free spatial interaction with large displays

A key challenge for creating large interactive displays in public spaces is in the definition of ways for the user to interact that are effective and easy to learn. This paper presents the outcomes of user evaluation sessions designed to test a series of different gestures for people interacting with large displays in the public space. It is an initial step towards the broader goal of establishing a natural means for immersive interactions. The paper proposes a set of simple gestures for the execution of the basic actions of selecting and rearranging items in a large-scale dashboard. We performed a comparative analysis of the gestures, leading to a more in-depth understanding of the nature of spatial interaction between people and large public displays. More specifically, the analysis focuses on the scenarios when the interaction is restricted to an individual's own body, without any further assistance from associated devices. The findings converge into the elaboration of a model for assisting with the applicability of spatial gestures in response to both the context and the content they are applied to.
Development of a Murine Infection Model with Leishmania killicki, Responsible for Cutaneous Leishmaniosis in Algeria: Application in Pharmacology

In Algeria, Leishmania infantum, Leishmania major, and Leishmania killicki (Leishmania tropica) are responsible for cutaneous leishmaniosis. We established a murine model of L. killicki infection to investigate its infective capacity, some immunophysiopathological aspects, and its suitability for pharmacological purposes. Following the injection of L. major or L. killicki metacyclic promastigotes in the ear dermis of BALB/c mice, the course of infection was followed. The infection with L. killicki caused slower lesion formation than with L. major. The presence of L. killicki or L. major DNA and parasites was detected in the ear dermis and in lymph nodes, spleen, and liver. Lesions induced by L. killicki were nonulcerative in their aspect, whereas those caused by L. major were highly ulcerative and necrotic, which matches well with the lesion phenotype reported in humans for L. killicki and L. major, respectively. The treatment of L. killicki lesions by injection of Glucantime® significantly reduced the lesion thickness and parasite burden. Ear dermal injection of BALB/c mice constitutes a model to study lesions physiopathology caused by L. killicki and presents interest for in vivo screening of new compounds against this pathogen, emerging in Algeria.
Energy-Efficient Precoding for Multiple-Antenna Terminals

The problem of energy-efficient precoding is investigated when the terminals in the system are equipped with multiple antennas. Considering static and fast-fading multiple-input multiple-output (MIMO) channels, the energy-efficiency is defined as the transmission rate to power ratio and shown to be maximized at low transmit power. The most interesting case is the one of slow fading MIMO channels. For this type of channels, the optimal precoding scheme is generally not trivial. Furthermore, using all the available transmit power is not always optimal in the sense of energy-efficiency [which, in this case, corresponds to the communication-theoretic definition of the goodput-to-power (GPR) ratio]. Finding the optimal precoding matrices is shown to be a new open problem and is solved in several special cases: 1. when there is only one receive antenna; 2. in the low or high signal-to-noise ratio regime; 3. when uniform power allocation and the regime of large numbers of antennas are assumed. A complete numerical analysis is provided to illustrate the derived results and stated conjectures. In particular, the impact of the number of antennas on the energy-efficiency is assessed and shown to be significant.
Random walker Segmentation based Cancer Detection technique

Cancer detection using image processing is an important field for the detection of cancer by extraction the features from the image. Since various cancers detection techniques are implemented such as using biclustering. Here in this paper an efficient technique is implemented for the cancer detection using segmentation method is proposed. The proposed methodology implemented here provides high accuracy of detection as compared to the other existing techniques for cancer detection. Key Terms: Biclustering, GSEA, Segmentation, Random Walker, walk-trap.
On ACTL Formulas Having Linear Counterexamples

In case an ACTL formula ? fails over a transition graph M, it is most useful to provide a counterexample, i.e., a computation tree of M, witnessing the failure. If there exists a single path in M which by itself witnesses the failure of ? , then ? has a linear counterexample. We show that, given M and ? , where M? , it is NP-hard to determine whether there exists a linear counterexample. Moreover, it is PSPACE-hard to decide whether an ACTL formula ? always admits a linear counterexample if it fails. This means that there exists no simple characterization of the ACTL formulas that guarantee linear counterexamples. Consequently, we study templates of ACTL formulas, i.e., skeletons of modal formulas whose atoms are disregarded. We identify the (unique) maximal set LIN of templates whose instances (obtained by replacing atoms with arbitrary pure state formulas) always guarantee linear counterexamples. We show that for each ACTL formula ? which is an instance of a template ? LIN, and for each Kripke structure M such that M? , a single path of M witnessing the failure by itself can be computed in polynomial time.