Miracle-dz/UniFAR-FTUs huggingface dataset:
Statistical bounds on the drop probability of assured forwarding services in DiffServ interior nodes under the processor sharing scheduling discipline

This paper addresses the problem of modelling and analysing an interior node in IETF's DiffServ services model. Specifically it is concerned with the performance of the DiffServ assured forwarding service category in presence of a premium service class. In this model, the network node shares its outgoing link capacity between a premium service representing the expedited forwarding (EF) per-hop behavior, and two classes of assured service, that represent two classes of the assured forwarding (AF) per-hop behavior. It this paper, the traffic is modelled as Markov modulated fluid sources, and we focus on a system where out of profile traffic is dropped at the edge of the network thus both AF queues support only one drop precedence. Using a decomposition approach, approximations, and spectral analysis, we are able to derive upper and lower bounds on the tail of the distribution of the buffer content for both AF classes given a generalized processor sharing scheduling is used to differentiate the two classes. Such approximate analysis of the interaction between traffic classes can help to achieve a better understanding of this type of networks; enables the provision of throughput differentiation as defined by the AF PHB through the GPS scheduler while quantifying delay; and finally helps simplify greatly the design of bandwidth brokers that do not rely on long term bandwidth (over) provisioning.
Learning Cross-lingual Word Embeddings via Matrix Co-factorization

A joint-space model for cross-lingual distributed representations generalizes language-invariant semantic features. In this paper, we present a matrix cofactorization framework for learning cross-lingual word embeddings. We explicitly define monolingual training objectives in the form of matrix decomposition, and induce cross-lingual constraints for simultaneously factorizing monolingual matrices. The cross-lingual constraints can be derived from parallel corpora, with or without word alignments. Empirical results on a task of cross-lingual document classification show that our method is effective to encode cross-lingual knowledge as constraints for cross-lingual word embeddings.
Using column generation for gate planning at Amsterdam Airport Schiphol

Assigning a set of flights to a set of gates at an airport used to be very easy. Due to the increased number of flights and the increased number of constraints that have to be satisfied, the assignment of flights to gates has become very complex nowadays. In this paper we look at the gate assignment problem as it appears at Schiphol Airport Amsterdam. Given the expected arrivals and departures for the next 24 hours, we aim at finding a robust solution, such that the amount of replanning due to deviations from the expected arrival and departure times is minimum. We solve this problem by a two-phase procedure. In the first phase, we solve the problem in which we include the single-gate constraints; in the second phase, we consider the constraints in which multiple gates are involved. We solve the first-phase problem by formulating it as an integer linear program (ILP) using a completely new formulation. We find an approximately optimal solution for it by solving the ILP for a restricted set of variables. We find this restricted set by first solving the LP-relaxation problem by means of column generation. In every iteration of the column generation a small number of additional columns are also generated and put into a column pool. After the LP-relaxation problem has been solved to optimality, the generated columns and all additional columns from the column pool are used to solve the ILP problem. This part of the solution is then handed to the planners at Schiphol as an input for the second phase. To test the performance of the algorithm we have implemented it, and we have tested this implementation with real life data provided by Amsterdam Airport Schiphol. The results are promising and the algorithm is able to solve real-life instances within acceptable running
Automatic Adjustment of Transfer Functions for 3D Volume Visualization

In most volume rendering scenarios implicit classification is performed manually by specification of a transfer function, that maps abstract data values to visual attributes. An appropriate classification requires both specialized knowledge of the interesting structures within the data set as well as the technical knowhow of the computer scientist. Recent automatic data-driven techniques are verywell capable of separating different regions in the data set. However, their applicability in practice is limited, since they do not contain any information about the critical structures which are of interest. In this scenario we propose an efficient and reproducible way to automatically assign transfer function templates, which include individual knowledge as well as personal taste. The presented approach is based on dynamic programming and was successfully applied in medical environment.
An Improved ID3 Based on Weighted Modified Information Gain

ID3 is the most classical algorithm generating decision tree. Greedy search strategy is applied to choose splitting attributes. Though it can insure the least testing frequency, the quick classifying speed and a decision tree with the least nodes, the shortcoming of inclining to attributes with many values still exists. However, these attributes are often not the optimal splitting attributes. Therefore, an improved ID3 based on weighted modified information gain called is proposed in this paper. Only if the information gain and values of a condition attribute are maximum, its information gain will be modified. An experiment is presented to compare with ID3 and the result indicates not only overcomes the shortcoming of ID3 better, but also is superior to ID3 on classification accuracy.
Some Algebraic Symmetries of (2,2)-Supersymmetric Systems

The Hilbert spaces of supersymmetric systems admit symmetries which are often related to the topology and geometry of the (target) ﬁeld-space. Here, we study certain (2,2)-supersymmetric systems in 2-dimensional spacetime which are closely related to superstring models. They all turn out to posess some hitherto unexploidted and geometri-cally and topologically unobstructed symmetries, providing new tools for studying the topology and geometry of superstring target spacetimes, and so the dynamics of the eﬀective ﬁeld theory in these.
A balance control strategy of a walking biped robot in an externally applied force

In this paper, we present a balance control strategy for a walking biped robot in an unexpected external applied force. We assume that a sudden lateral and longitudinal force could be applied at the center of the pelvis of the biped robot during walking with a walking trajectory which is predesigned in advance by considering the energy-efficiency. With this situation, an balance control strategy is investigated and suggested. The balance control strategy is divided into four successive actions. Firstly, the robot should be controlled for the ZMP(Zero Moment Point) to move to the center of its sole. Secondly, the robot moves its swing leg to make the height of the sole of its swing leg lower. Thirdly, the swing leg of robot is stretched. Fourthly, the stance leg is contracted to make the robot in the double support phase. To verify the suggested strategy, computer simulation is performed.
Self-correction of 3D reconstruction from multi-view stereo images

We present a self-correction approach to improving the 3D reconstruction of a multi-view 3D photogrammetry system. The self-correction approach has been able to repair the reconstructed 3D surface damaged by depth discontinuities. Due to self-occlusion, multi-view range images have to be acquired and integrated into a watertight non-redundant mesh model in order to cover the extended surface of an imaged object. The integrated surface often suffers from “dent” artifacts produced by depth discontinuities in the multi-view range images. In this paper we propose a novel approach to correcting the 3D integrated surface such that the dent artifacts can be repaired automatically. We show examples of 3D reconstruction to demonstrate the improvement that can be achieved by the self-correction approach. This self-correction approach can be extended to integrate range images obtained from alternative range capture devices.
The proximate unit in Chinese handwritten character production

In spoken word production, a proximate unit is the first phonological unit at the sublexical level that is selectable for production (O'Seaghdha et al., 2010). The present study investigated whether the proximate unit in Chinese handwritten character production is the stroke, the radical, or something in between. A written version of the form preparation task was adopted. Chinese participants learned sets of two-character words, later were cued with the first character of each word, and had to write down the second character (the target). Response times were measured from the onset of a cue character to the onset of a written response. In Experiment 1, the target characters within a block shared (homogeneous) or did not share (heterogeneous) the first stroke. In Experiment 2, the first two strokes were shared in the homogeneous blocks. Response times in the homogeneous blocks and in the heterogeneous blocks were comparable in both experiments (Experiment 1: 687 vs. 684 ms, Experiment 2: 717 vs. 716). In Experiment 3 and 4, the target characters within a block shared or did not share the first radical. Response times in the homogeneous blocks were significantly faster than those in the heterogeneous blocks (Experiment 3: 685 vs. 704, Experiment 4: 594 vs. 650). In Experiment 5 and 6, the shared component was a Gestalt-like form that is more than a stroke, constitutes a portion of the target character, can be a stand-alone character itself, can be a radical of another character but is not a radical of the target character (e.g., ± in , , , ; called a logographeme). Response times in the homogeneous blocks were significantly faster than those in the heterogeneous blocks (Experiment 5: 576 vs. 625, Experiment 6: 586 vs. 620). These results suggest a model of Chinese handwritten character production in which the stroke is not a functional unit, the radical plays the role of a morpheme, and the logographeme is the proximate unit.
Interaction Effects of the COMT and DRD4 Genes with Anxiety-Related Traits on Selective Attention

Abstract The study investigated whether the DRD4 and COMT genes can modify relations between trait anxiety and selective attention. Two hundreds and sixty-six subjects performed a visual search task in which they had to find words looking through a sheet with rows of letters. After finishing the first sheet the subject was presented the second one, this time with an instruction to perform the task as quickly and accurate as possible. To study top-down attention, the number of correctly identified words (accuracy) and the time for completion of each trial were analyzed. To study bottom-up attention, the letters ‘o’ and ‘n’ were written in green, whilst the others were in black, and subjects were asked whether they had noticed that 2–3 minutes after the task completion. Genotypes for the COMT Val158Met and DRD4 VNTR-48 polymorphisms and TCI Harm Avoidance and MMPI Depression scales’ scores were obtained as well. High anxious individuals showed a more pronounced increase in accuracy in the second trial and more profound processing of irrelevant stimuli (colored letters). There was a significant interaction effect of DRD4 and Harm avoidance on the accuracy dynamics F(1, 210), = 7.65, p = . 006, η2 = . 04. Among DRD4 long allele carriers, high anxious subjects significantly improved accuracy (p = .013) and tended to slow speed, while those with lower Harm avoidance demonstrated the opposite trend. These effects were more robust in less educated individuals. It was concluded that the DRD4 polymorphism may modify the influence of trait anxiety on the speed-accuracy tradeoff.
NEW ASPECTS IN THE THEORY OF AQUEOUS ELECTROLYTE SOLUTIONS: THE EFFECTS OF CATION HYDROLYSIS AND POLYNUCLEAR ION FORMATION

The polynuclear ion formation in aqueous solutions of metal salts is mimiced by the intercationic association interaction. The statistical mechanics of such ionic model is solved using multidensity associative formalism. The theory predicts a signiicant innuence of the polynu-clear ion formation on the thermodynamics and structure properties of electrolyte solutions in a wide range of concentrations including very dilute concentration regions.
The cytoplasmic domain of N-cadherin modulates MMP-9 induction in oral squamous carcinoma cells

Oral squamous carcinoma is the sixth most common cancer worldwide, and one of the most common cancers in developing countries. Regional and distant metastases comprise the majority of cases at initial diagnosis and correlate with poor patient outcomes. Oral epithelia is one of many tissue types to exhibit a cadherin switch during tumor progression, in which endogenous cell adhesion proteins, such as E-cadherin, give way to those of mesenchymal origin. The mesenchymal cell adhesion protein N-cadherin is found at the invading front of oral squamous carcinomas and has been strongly correlated with poor patient prognosis. The goal of the present study was to elucidate the mechanism by which N-cadherin may increase extracellular matrix-associated proteolytic activity to facilitate invasiveness in oral tumor development. The overexpression of N-cadherin in two oral squamous carcinoma cell lines increased motility, invasive capacity and synthesis of matrix metalloproteinase-9 (MMP-9) in a manner that was independent of E-cadherin downregulation. The use of EN and NE chimeric cadherin molecules with reciprocally substituted cytoplasmic domains revealed that optimal induction of MMP-9 synthesis required the cytoplasmic region, but not the extracellular region, of N-cadherin. Utilizing an N-cadherin mutant with impaired p120 binding ability, we found that such mutation resulted in a 4-fold decrease in motility compared to wild-type N-cadherin, but did not affect either MMP-9 expression or motility-normalized invasion. Overexpression of wild-type N-cadherin produced a 27-fold increase in the transcriptional activity of β-catenin, concomitant with increases in MMP-9 transcription. These results suggest that N-cadherin may promote motility and invasiveness through distinct mechanisms, and that β-catenin may be an integral mediator of N-cadherin-dependent invasive signaling in oral epithelia.
Safeguarding schedule updates in wireless sensor networks

Working in the duty cycling mode enables sensor nodes to utilize limited energy efficiently instead of unnecessary idle listening. In such networks, awareness of neighboring nodes' working schedules is essential, especially when each node sets up the schedule independently. Most traditional research assumes that a node can always share its working schedule with its neighbors once it joins the network. However, dynamic energy supply and varied requirements of system performance make adjusting duty cycles necessary. Consequently, sensor nodes have to regularly change their schedules and advertise the new schedule to their one-hop neighbors. In this work, instead of changing nodes' working schedule directly, we introduce SSD, a staged and smooth design for safeguarding schedule updates. Our design is aimed at bounding average packet loss rate with a minimum energy cost. We evaluate our design with large-scale simulation and show that under the comparable packet loss rate, our design saves up to 35% energy compared with the minimal packet loss solution.
Cluster based Mixed Coding Schemes for Inverted File Index Compression

The cluster property of document collections in today's search engines provides valuable information for index compression. By clustering d-gaps of an inverted list based on a threshold, and then encoding clustered and non-clustered d-gaps using different methods, we can tailor to the specific properties of different d-gaps and achieve better compression ratio. Based on this idea, in this paper we propose a cluster based approach and presents two new codes for inverted file index compression: mixed gamma/flat binary code and mixed delta/flat binary code. Experiment results show that the two new codes achieve better or equal performance in terms of compression ratio comparing to interpolative code which is considered as the most efficient bitwise code at present. Besides, the two new codes have much lower complexity comparing to interpolative code and therefore enable faster encoding and decoding. By adjusting the parameters for the mixed codes, even better results may be achieved. Experiments show promising results with our approaches.
The Effect of a G:T Mispair on the Dynamics of DNA

Distortions in the DNA sequence such as damages or mispairs are specifically recognized and processed by DNA repair enzymes. A particular challenge for the enzymatic specificity is the recognition of a wrongly-placed native nucleotide such as thymine in T:G mispairs. An important step of substrate binding which is observed in many repair proteins is the flipping of the target base out of the DNA helix into the enzyme’s active site. In this work we investigate how much the intrinsic dynamics of mispaired DNA is changed compared to canonical DNA. Our molecular dynamics simulations of DNA with and without T:G mispairs show significant differences in the conformation of paired and mispaired DNA. The wobble pair T:G shows local distortions such as twist, shear and stretch which deviate from canonical B form values. Moreover, the T:G mispair is found to be kinetically less stable, exhibiting two states with respect to base opening: a closed state comparable to the canonical base pairs, and a more open state, indicating a proneness for base flip. In addition, we observe that the thymine base in a T:G mispair is significantly more probable to be flipped than thymine in a T:A pair or cytosine in a C:G pair. Such local deformations and in particular the existence of a second, more-open state can be speculated to help the target-site recognition by repair enzymes.
A new improved seam carving content aware image resizing method

Image resizing is one of the basic operations for image and video display, transmission, and analysis, etc. Traditional image resizing methods usually utilize an interpolation algorithm to zoom in or zoom out an image, e.g., the nearest neighborhood interpolation, the bilinear interpolation and the cubic interpolation are most widely used ones. The interpolation based methods don't pay attention to the content of an image and so they may make the image be seen unnaturally. The famous seam carving based image resizing method reserves the high energy part of an image during the image resizing process, so it is content aware and has better performance than the interpolation based methods. But drawbacks still exist in the former seam carving based image resizing methods proposed by researchers. In this paper, a new improved seam carving image resizing method is proposed. In the proposed improved method, a new combined energy is utilized which can better describe the content of the image. Optimization methods are also provided to accelerate the algorithms. Experimental results show that the proposed method is effective.
Fast connected component labeling in binary images

This paper presents algorithm for fast connected component labeling of the binary images. Simplicity of the algorithm predetermines its use especially in real-time applications like human computer interfaces. Current algorithms are based on different hierarchical structures and union-trees. The presented algorithm does not connect every component as in a common approach. Instead, some regions stay left unconnected. This property may be beneficial in some cases, especially when two neighbouring objects, in the binary image, look like one connected region. Two way testing north-left was used to determine component membership. If two different regions are detected in the neighborhood, the algorithm decides to merge or split the component regions.
Matrix Metalloproteinase Activity Inactivates the CXC Chemokine Stromal Cell-derived Factor-1*

Chemokines provide directional cues for leukocyte migration and activation that are essential for normal leukocytic trafficking and for host responses during processes such as inflammation, infection, and cancer. Recently we reported that matrix metalloproteinases (MMPs) modulate the activity of the CC chemokine monocyte chemoattractant protein-3 by selective proteolysis to release the N-terminal tetrapeptide. Here we report the N-terminal processing, also at position 4–5, of the CXC chemokines stromal cell-derived factor (SDF)-1α and β by MMP-2 (gelatinase A). Robustness of the MMP family for chemokine cleavage was revealed from identical cleavage site specificity of MMPs 1, 3, 9, 13, and 14 (MT1-MMP) toward SDF-1; selectivity was indicated by absence of cleavage by MMPs 7 and 8. Efficient cleavage of SDF-1α by MMP-2 is the result of a strong interaction with the MMP hemopexin C domain at an exosite that overlaps the monocyte chemoattractant protein-3 binding site. The association of SDF-1α with different glycosaminoglycans did not inhibit cleavage. MMP cleavage of SDF-1α resulted in loss of binding to its cognate receptor CXCR-4. This was reflected in a loss of chemoattractant activity for CD34+ hematopoietic progenitor stem cells and pre-B cells, and unlike full-length SDF-1α, the MMP-cleaved chemokine was unable to block CXCR-4-dependent human immunodeficiency virus-1 infection of CD4+ cells. These data suggest that MMPs may be important regulatory proteases in attenuating SDF-1 function and point to a deep convergence of two important networks, chemokines and MMPs, to regulate leukocytic activity in vivo.
Cross-section retrieval from full-waveform LiDAR using sparse solutions

Accurate waveform restoration, from the received noisy waveform, is of great interest to the full-waveform LiDAR community. As a result of this, important attributes could be estimated precisely which are valuable in describing and differentiating LiDAR targets. Assumptions behind prominent methods like the Gaussian decomposition do not hold due to the complexity of the land surface. Deconvolution is a standard approach to retrieve the target cross-section. A regularization method is proposed based on sparsity constraints and it is compared to other well-known deconvolution methods. Numerical and visual results illustrate the robustness of the proposed method with regard to signal restoration and to suppression of noise and oscillation effects.
Single pairing spike-timing dependent plasticity in BiFeO3 memristors with a time window of 25 ms to 125 μs

Memristive devices are popular among neuromorphic engineers for their ability to emulate forms of spike-driven synaptic plasticity by applying specific voltage and current waveforms at their two terminals. In this paper, we investigate spike-timing dependent plasticity (STDP) with a single pairing of one presynaptic voltage spike and one post-synaptic voltage spike in a BiFeO3 memristive device. In most memristive materials the learning window is primarily a function of the material characteristics and not of the applied waveform. In contrast, we show that the analog resistive switching of the developed artificial synapses allows to adjust the learning time constant of the STDP function from 25 ms to 125 μs via the duration of applied voltage spikes. Also, as the induced weight change may degrade, we investigate the remanence of the resistance change for several hours after analog resistive switching, thus emulating the processes expected in biological synapses. As the power consumption is a major constraint in neuromorphic circuits, we show methods to reduce the consumed energy per setting pulse to only 4.5 pJ in the developed artificial synapses.