Miracle-dz/UniFAR-FTUs huggingface dataset:
A Graph Framework for Manifold-Valued Data

Graph-based methods have been proposed as a unified framework for discrete calculus of local and nonlocal image processing methods in recent years. In order to translate variational models and partial differential equations to a graph, certain operators have been investigated and successfully applied to real-world applications involving graph models. So far the graph framework has been limited to real- and vector-valued functions on Euclidean domains. In this paper we generalize this model to the case of manifold-valued data. We introduce the basic calculus needed to formulate variational models and partial differential equations for manifold-valued functions and discuss the proposed graph framework for two particular families of operators, namely, the isotropic and anisotropic graph $p$-Laplacian operators, $p\geq1$. Based on the choice of $p$ we are in particular able to solve optimization problems on manifold-valued functions involving total variation ($p=1$) and Tikhonov ($p=2$) regularization. Finall.
Active Learning of Abstract System Models from Traces using Model Checking [Extended]

We present a new active model-learning approach to generating abstractions of a system implementation, as finite state automata (FSAs), from execution traces. Given an implementation and a set of observable system variables, the generated automata admit all system behaviours over the given variables and provide useful insight in the form of invariants that hold on the implementation. To achieve this, the proposed approach uses a pluggable model learning component that can generate an FSA from a given set of traces. Conditions that encode a completeness hypothesis are then extracted from the FSA under construction and used to evaluate its degree of completeness by checking their truth value against the system using software model checking. This generates new traces that express any missing behaviours. The new trace data is used to iteratively refine the abstraction, until all system behaviours are admitted by the learned abstraction. To evaluate the approach, we reverse-engineer a set of publicly available Simulink Stateflow models from their C implementations.
We Are Humor Beings : Understanding and Predicting Visual Humor

Scenes Vocabulary The abstract scenes interface developed by Antol et al. [1] consists of 20 “deformable” humans, 31 animals in different poses, and about 100 objects that can be found in indoor scenes (e.g., couch, picture, doll, door, window, plant, fireplace) or outdoor scenes (e.g., tree, pond, sun, clouds, bench, bike, campfire, grill, skateboard). In addition to the 8 different expressions available for humans, the ability to vary the pose of a human at a fine-grained level enables these abstract scenes to effectively capture the semantics of a scene. The large clipart vocabulary (of which only a fraction is shown to a worker during creation of a scene) ensures diversity in the scenes being depicted. A subset of objects from our Abstract Scenes vocabulary is shown in Fig. 4.
VR Queries and Their Transformations in a Progressive Querying Environment

We have proposed a progressive querying environment that enables the user to interact with the database by a sequence of partial queries, and to visualize both database queries and retrieval results in many different representations. In our approach, the user can query the database in the Virtual Reality (VR) space, and then switch to the logical space to continue the formulation of the query. This paper provides a formal definition and characterization of VR queries, describes what database operators are applicable under the different interaction paradigms, and investigates how VR queries can be transformed into other types of queries, so that they can be utilized as part of a progressive querying system.
Skill2vec: Machine Learning Approach for Determining the Relevant Skills from Job Description

Unsupervise learned word embeddings have seen tremendous success in numerous Natural Language Processing (NLP) tasks in recent years. The main contribution of this paper is to develop a technique called Skill2vec, which applies machine learning techniques in recruitment to enhance the search strategy to find candidates possessing the appropriate skills. Skill2vec is a neural network architecture inspired by Word2vec, developed by Mikolov et al. in 2013. It transforms skills to new vector space, which has the characteristics of calculation and presents skills relationships. We conducted an experiment evaluation manually by a recruitment company's domain experts to demonstrate the effectiveness of our approach.
Probabilistic behavior of asymmetric level compressed tries

Level‐Compressed (in short LC) tries were introduced by Andersson and Nilsson in 1993. They are compacted versions of tries in which, from the top down, maximal height complete subtrees are level compressed. We show that when the input consists of n independent strings with independent Bernoulli (p) bits, p ≠ 1/2, then the expected depth of a typical node is in probability asymptotic to $${{\rm log\,\,log}\,\,n} \over {\rm log}\,\, \left(1 - {{\cal H} \over {\cal H} - \infty}\right)$$ where H − p log p − (1 − p) log (1 − p) is the Shannon entropy of the source, and H−∞ = log (1 / min(p, 1 − p)). The height is in probability asymptotic to $${{\rm log}\,\,n}\,\, \over {\cal H}_2$$ where H2 = log(1/(p2 + (1−p)2)). © 2005 Wiley Periodicals, Inc. Random Struct. Alg. , 2005
Buuer Requirements for Tcp/ip over Abr 1

We study the buuering requirements for zero cell loss for TCP over ABR. We show that the maximum buuers required at the switch is proportional to the maximum round trip time (RTT) of all VCs through the link. The number of round-trips depends upon the the switch algorithm used. With our ERICA 2] switch algorithm, we nd that the buuering required is independent of the number of TCP sources. We substantiate our arguments with simulation results.
Fe b 20 08 Approximate Capacity of Gaussian Relay Networks

We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant depends on the topology of the network, but not the values of the channel gains. Therefore, we uniformly characterize the capacity of Gaussian relay networks within a constant number of bits, for all channel parameters.
A novel clustering algorithm for coverage a large scale in WSN

The applications require coverage of the whole monitored area for long periods of time. Clustering is a way to reduce communications, minimize energy consumption and organize messages among the cluster head and their members. The message exchange of communication and data transmission between the different sensor nodes must be minimized to keep and extended the lifetime of the network because of limited energy resources of the sensors. In this paper, we take into consideration the problem isolated nodes that are away from the cluster head (CH) and by consequence or CH is not within the reach from these nodes. To solve this problem, we propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy) a routing protocol that takes into account the orphan nodes. Indeed, a cluster member will be able to play the role of a gateway which allows the joining of orphan nodes. Our contribution is to election a cluster head that has enough energy for a better now to coordinate with these member nodes and maintain the full coverage for applications which requires of useful data for the entire area to be covered. The simulation results show that O-LEACH performs better than LEACH in terms of connectivity rate, energy, scalability and coverage.
Comparative Analysis of Several Real-Time Systems for Tracking People and/or Moving Objects using GPS

When we talk about real-time systems for tracking people and/or moving objects using a Global Positioning System (GPS), there are several categories of such systems and the ways in which they work. Some uses additional hardware to extend the functionality of the offered opportunities, some are free, some are too complex and cost too much money. This paper aims to provide a clearer picture of several such systems and to show results from a comparative analysis of some popular systems for tracking people and moving objects that use the GPS, like Navixy, Frotcom GPS Vehicle Tracking & Fleet Management System, FollowMee GPS Tracker, Open GPS Tracking System and our system RadinTechnology GPS Tracking System.
On Cosets of the Generalized First-Order Reed-Muller Code with Low PMEPR

Golay sequences are well-suited for use as codewords in orthogonal frequency-division multiplexing (OFDM) since their peak-to-mean envelope power ratio (PMEPR) in q-ary phase-shift keying (PSK) modulation is at most 2. It is known that a family of polyphase Golay sequences of length 2m organizes in m! /2 cosets of a generalized first-order Reed-Muller code RMq(1, m). In this paper a more general construction technique for cosets of RMq(1, m) with low PMEPR is provided. These cosets contain so-called near-complementary sequences. The application of this result is then illustrated by providing some construction examples. First, it is shown that the m! /2 cosets of RMq(1, m) comprised of Golay sequences just arise as a special case. Second, further families of cosets of RMq(1, m) with maximum PMEPR between 2 and 4 are presented, showing that some previously unexplained phenomena can now be understood within a unified framework. A lower bound on the PMEPR of cosets of RM q(1, m) is proved as well, and it is demonstrated that the upper bound on the PMEPR is tight in many cases
Preprocessor Blazes spec Grey box analysis Blazes Strategy Code generation Annotations Storm topology Bloom program Inputs Bloom Runtime Storm Engine Outputs Or Or

Distributed consistency is perhaps the most discussed topic in distributed systems today. Coordination protocols can ensure consistency, but in practice they cause undesirable performance unless used judiciously. Scalable distributed architectures avoid coordination whenever possible, but undercoordinated systems can exhibit behavioral anomalies under fault, which are often extremely difficult to debug. This raises significant challenges for distributed system architects and developers. In this paper we present BLAZES, a cross-platform program analysis framework that (a) identifies program locations that require coordination to ensure consistent executions, and (b) automatically synthesizes application-specific coordination code that can significantly outperform general-purpose techniques. We present two case studies, one using annotated programs in the Twitter Storm system, and another using the Bloom declarative language.
Dreamento: An open-source dream engineering toolbox utilizing sleep wearable

We introduce Dreamento (Dream engineering toolbox), an open-source Python package for dream engineering utilizing the ZMax (Hypnodyne Corp., Sofia, Bulgaria) headband sleep wearable. Dreamento main functions are (1) real-time recording, monitoring, analysis, and stimulation in a graphical user interface (GUI) (2) and offline post-processing of the resulting data. In real-time, Dreamento is capable of (1) recording data, (2) visualizing data, including power-spectrum analysis and navigation, (3) automatic sleep-scoring, (4) sensory stimulation (visual, auditory, tactile), (5) establishing text-to-speech communication, and (6) managing the annotations of automatic and manual events. The offline functionality aids in post-processing the acquired data with features to reformat the wearable data and synchronize it with non-wearable recorded modalities such as electromyography. While the primary application of Dreamento was developed for (lucid) dreaming studies, it is open to being adapted for other purposes and measurement modalities.
On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks

We consider the multiple-unicast problem with three source-terminal pairs over directed acyclic networks with unit-capacity edges. The three s<sub>i</sub>-t<sub>i</sub> pairs wish to communicate at unit-rate via network coding. The connectivity between the s<sub>i</sub>-t<sub>i</sub> pairs is quantified by means of a connectivity-level vector, [k<sub>1</sub> k<sub>2</sub> k<sub>3</sub>] such that there exist k<sub>i</sub> edge-disjoint paths between si and t<sub>i</sub>. In this paper, we attempt to classify networks based on the connectivity level. It can be observed that unit-rate transmission can be supported by routing if k<sub>i</sub> ≥ 3, for all i = 1, . , 3. In this paper, we consider connectivity-level vectors such that min<sub>i=1</sub>,. ,<sub>3</sub> k<sub>i</sub> <; 3. We present either a constructive linear network coding scheme or an instance of a network that cannot support the desired unit-rate requirement, for all such connectivity-level vectors except the vector [1 2 4] (and its permutations). The benefits of our schemes extend to networks with higher and potentially different edge capacities. Specifically, our experimental results indicate that for networks where the different source-terminal paths have a significant overlap, our constructive unit-rate schemes can be packed along with routing to provide higher throughput as compared to a pure routing approach.
Facial Expression Recognition in still pictures and videos using Active Appearance Models . A comparison approach

The paper highlights the performance of video sequence-oriented facial expression recognition using Active Appearance Model – AAM, in a comparison with the analysis based on still pictures. The AAM is used to extract relevant information regarding the shapes of the faces to be analyzed. Specific key points from a Facial Characteristic Point FCP model are used to derive the set of features. These features are used for the classification of the expressions of a new face sample into the prototypic emotions. The classification method uses Support Vector Machines.
Full Contextual Attention for Multi-resolution Transformers in Semantic Segmentation - Supplementary

In our approach we introduce the Non-Local Upsampling (NLU) module which is used in place of conventional upsampling operations which are based on local information only (bilinear, deconvolution). The idea of the NLU is to upsample the semantic features based on all the tokens coming from the skip connection by using a MSA block in the decoder. The NLU module is detailed in Fig. 1. By using the same blocks as in [5], the skip connection is embedded into a query matrix Q ∈ R(4Np)×C while the keys and values are computed from the semantic low resolution features: K ∈ RNp×C and V ∈ RNp×C . The resulting attention matrix is A ∈ R(4Np)×Np . To maintain the residual connection in the Transformer block, the low resolution features are upsampled and a linear projection adapts the number of channels before the sum. Then a Feed Forward (FF) layer is also used. It is worth noting that a normalization layer is included in both parts but omitted in the schema for clarity. At the end, a concatenation of the skip-connection and the upsampled semantic features ends the NLU the same way than in the standard U-Net architectures.
ASYMPTOTIC MINIMAXITY OF FALSE DISCOVERY RATE THRESHOLDING FOR SPARSE EXPONENTIAL DATA 1

We apply FDR thresholding to a non-Gaussian vector whose coordinates X i , i = 1 ,. ,n , are independent exponential with individual means µ i . The vector µ = (µ i ) is thought to be sparse, with most coordinates 1 but a small fraction signiﬁcantly larger than 1; roughly, most coordinates are simply ‘noise,’ but a small fraction contain ‘signal. ’ We measure risk by per-coordinate mean-squared error in recovering log (µ i ) , and study minimax estimation over parameter spaces deﬁned by constraints on the per-coordinate p -norm of log (µ i ) , 1 n (cid:1) ni = 1 log p (µ i ) ≤ η p . We show for large n and small η that FDR thresholding can be nearly minimax. The FDR control parameter 0 < q < 1 plays an important role: when q ≤ 1 / 2, the FDR estimator is nearly minimax, while choosing a ﬁxed q > 1 / 2 prevents near minimaxity. These conclusions mirror those found in the Gaussian case in Abramovich et al. [ Ann. Statist. 34 (2006) 584–653]. The techniques developed here seem applicable to a wide range of other distributional assumptions, other loss measures and non-i.i. d. dependency structures.
Logic Column 14: Nominal Logic and Abstract Syntax

Formalizing syntactic proofs of properties of logics, programming languages, security protocols, and other formal systems is a significant challenge, in large part because of the obligation to handle name-binding correctly. We present an approach called nominal abstract syntax that has attracted considerable interest since its introduction approximately six years ago. After an overview of other approaches, we describe nominal abstract syntax and nominal logic, a logic for reasoning about nominal abstract syntax. We also discuss applications of nominal techniques to programming, automated reasoning, and identify some future directions.
Model Checking in Bits and Pieces

The central thesis explored in this paper is that parallel model checking is easily achieved through compositional methods. This may strike the reader as being self-evident. Nevertheless, it does not appear to have been considered before. The justiﬁcation comes from the following observations: (1) the efﬁcacy of a parallel program is inversely proportional to the amount of synchronization and communication across processors, and (2) compositional methods break up the analysis into nearly-independent parts; in each part, a program component is analyzed with limited knowledge of the internal state of other components. For loosely coupled programs, therefore, one may expect compositional methods to work well, and to further beneﬁt from parallelization. To test this thesis, we have implemented a parallel version of an assertional compositional model checking method. A brief introduction is necessary in order to explain the parallel algorithm. The basis is a computation of a vector of assertions, θ = ( θ 1 , θ 2 , . . . , θ n ) , with the following properties: (1) each θ i is an assertion deﬁned over the state visible to process i ; (2) θ i is a local inductive invariant for process i ; and (3) the conjunction ( (cid:86) i : θ i ) is a globally inductive invariant . We call such a vector a “split in-variant”. These conditions correspond to the interference-free proof outlines of Owicki
Compression with actions

We consider the setting where actions can be used to modify a state sequence before compression. The minimum rate needed to losslessly describe the optimal modified sequence is characterized when the state sequence is either non-causally or causally available at the action encoder. The achievability is closely related to the optimal channel coding strategy for channel with states. We also extend the analysis to the the lossy case.
Optimal Mechansim Design and Money Burning

Mechanism design is now a standard tool in computer science for aligning the incentives of self-interested agents with the objectives of a system designer. There is, however, a fundamental disconnect between the traditional application domains of mechanism design (such as auctions) and those arising in computer science (such as networks): while monetary transfers (i.e., payments) are essential for most of the known positive results in mechanism design, they are undesirable or even technologically infeasible in many computer systems. Classical impossibility results imply that the reach of mechanisms without transfers is severely limited. Computer systems typically do have the ability to reduce service quality--routing systems can drop or delay traffic, scheduling protocols can delay the release of jobs, and computational payment schemes can require computational payments from users (e.g., in spam-fighting systems). Service degradation is tantamount to requiring that users burn money}, and such ``payments'' can be used to influence the preferences of the agents at a cost of degrading the social surplus. We develop a framework for the design and analysis of money-burning mechanisms to maximize the residual surplus--the total value of the chosen outcome minus the payments required.
JEPETTO : a Cytoscape plugin for gene set enrichment and topological analysis based on interaction networks

In this study, we use JEPETTO to perform an integrated analysis with a target set of misregulated genes associated with Alzheimer’s disease. Alzheimer is the most common type of dementia resulting in the brain degeneration. The desease is one of the leading causes of death for individuals over the age of 65. Dysregulation of the brain cell functions slowly generates a set of harmful symptoms: memory loss, personality changes, misorientation and others. The disease worsens as it progresses and although some treatments exist, they do not tackle the long-term effects (Thies and Bleiler, 2011). Alzheimer’s disease remains incurable. Therefore, it is important to identify new components that may be involved in the disease development or the potential targets for a cure. 2 DATA SOURCES
A Probabilistic Analysis of Some Tree Algorithms

INRIA In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques. This approach gives a unified probabilistic treatment of these questions. It simplifies and extends some of the results known in this domain. 1. Introduction. A splitting algorithm is a procedure that divides recur-sively into subsets an initial set of n items until each of the subsets obtained has a cardinality strictly less than some fixed number D. These algorithms have a wide range of applications: