OpenRaiser/Intern-Atlas huggingface dataset:
An Abstract Algebraic Logic View on Judgment Aggregation
Venue: arXiv cs.LO 2016
Year: 2016

In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg's algebraic approach to characterization results in on judgment aggregation and propositional-attitude aggregation, characterizing certain Arrovian classes of aggregators as Boolean algebra and MV-algebra homomorphisms, respectively. The characterization result of the present paper applies to agendas of formulas of an arbitrary selfextensional logic. This notion comes from AAL, and encompasses a vast class of logics, of which classical, intuitionistic, modal, many-valued and relevance logics are special cases. To each selfextensional logic $\Sm$, a unique class of algebras $\Alg\Sm$ is canonically associated by the general theory of AAL. We show that for any selfextensional logic $\Sm$ such that $\Alg\Sm$ is closed under direct products, any algebra in $\Alg\Sm$ can be taken as the set of truth values on which an aggregation problem can be formulated. In this way, judgment aggregation on agendas formalized in classical, intuitionistic, modal, many-valued and relevance logic can be uniformly captured as special cases. This paves the way to the systematic study of a wide array of "realistic agendas" made up of complex formulas, the propositional connectives of which are interpreted in ways which depart from their classical interpretation. This is particularly interesting given that, as observed by Dietrich, nonclassical (subjunctive) interpretation of logical connectives can provide a strategy for escaping impossibility results.
Optimal design of a micro-tubular fuel cell
Venue: arXiv cs.CE 2016
Year: 2016

We discuss the problem of the optimal design of a micro-tubular fuel cell applying an inverse homogenization technique. Fuel cells are extremely clean and efficient electrochemical power generation devices, made up of a cathode/electrolyte/anode structure, whose energetic potential has not being fully exploited in propulsion systems in aeronautics due to their low power densities. Nevertheless, thanks to the recent development of additive layer manufacturing techniques (3D printing), complex structures usually impossible to design with conventional manufacturing techniques can be constructed with a low cost, allowing notably to build porous or foam-type structures for fuel cells. We seek thus to come up with the micro-structure of an arrangement of micro-tubular cathodes which maximizes the contact surface subject to a pressure drop and a permeability constraint. The optimal periodic design (fluid/solid) emerges from the application of a shape gradient algorithm coupled to a level-set method for the geometrical description of the corresponding cell problem.
Hierarchy of Groups Evaluation Using Different F-score Variants
Venue: arXiv cs.CV 2016
Year: 2016

The paper presents a cursory examination of clustering, focusing on a rarely explored field of hierarchy of clusters. Based on this, a short discussion of clustering quality measures is presented and the F-score measure is examined more deeply. As there are no attempts to assess the quality for hierarchies of clusters, three variants of the F-Score based index are presented: classic, hierarchical and partial order. The partial order index is the authors' approach to the subject. Conducted experiments show the properties of the considered measures. In conclusions, the strong and weak sides of each variant are presented.
The Umwelt of an Embodied Agent -- A Measure-Theoretic Definition
Venue: arXiv cs.IT 2016
Year: 2016

We consider a general model of the sensorimotor loop of an agent interacting with the world. This formalises Uexküll's notion of a \emph{function-circle}. Here, we assume a particular causal structure, mechanistically described in terms of Markov kernels. In this generality, we define two $σ$-algebras of events in the world that describe two respective perspectives: (1) the perspective of an external observer, (2) the intrinsic perspective of the agent. Not all aspects of the world, seen from the external perspective, are accessible to the agent. This is expressed by the fact that the second $σ$-algebra is a subalgebra of the first one. We propose the smaller one as formalisation of Uexküll's \emph{Umwelt} concept. We show that, under continuity and compactness assumptions, the global dynamics of the world can be simplified without changing the internal process. This simplification can serve as a minimal world model that the system must have in order to be consistent with the internal process.
Citations: Indicators of Quality? The Impact Fallacy
Venue: arXiv cs.DL 2016
Year: 2016

We argue that citation is a composed indicator: short-term citations can be considered as currency at the research front, whereas long-term citations can contribute to the codification of knowledge claims into concept symbols. Knowledge claims at the research front are more likely to be transitory and are therefore problematic as indicators of quality. Citation impact studies focus on short-term citation, and therefore tend to measure not epistemic quality, but involvement in current discourses in which contributions are positioned by referencing. We explore this argument using three case studies: (1) citations of the journal Soziale Welt as an example of a venue that tends not to publish papers at a research front, unlike, for example, JACS; (2) Robert Merton as a concept symbol across theories of citation; and (3) the Multi-RPYS ("Multi-Referenced Publication Year Spectroscopy") of the journals Scientometrics, Gene, and Soziale Welt. We show empirically that the measurement of "quality" in terms of citations can further be qualified: short-term citation currency at the research front can be distinguished from longer-term processes of incorporation and codification of knowledge claims into bodies of knowledge. The recently introduced Multi-RPYS can be used to distinguish between short-term and long-term impacts.
Deep Embedding for Spatial Role Labeling
Venue: arXiv cs.CL 2016
Year: 2016

This paper introduces the visually informed embedding of word (VIEW), a continuous vector representation for a word extracted from a deep neural model trained using the Microsoft COCO data set to forecast the spatial arrangements between visual objects, given a textual description. The model is composed of a deep multilayer perceptron (MLP) stacked on the top of a Long Short Term Memory (LSTM) network, the latter being preceded by an embedding layer. The VIEW is applied to transferring multimodal background knowledge to Spatial Role Labeling (SpRL) algorithms, which recognize spatial relations between objects mentioned in the text. This work also contributes with a new method to select complementary features and a fine-tuning method for MLP that improves the $F1$ measure in classifying the words into spatial roles. The VIEW is evaluated with the Task 3 of SemEval-2013 benchmark data set, SpaceEval.
Incremental Voronoi Diagrams
Venue: arXiv cs.CG 2016
Year: 2016

We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram $\mathcal{V}(S)$ (and several variants thereof) of a set $S$ of $n$ sites in the plane as sites are added. We define a general update operation for planar graphs modeling the incremental construction of several variants of Voronoi diagrams as well as the incremental construction of an intersection of halfspaces in $\mathbb{R}^3$. We show that the amortized number of edge insertions and removals needed to add a new site is $O(\sqrt{n})$. A matching $Ω(\sqrt{n})$ combinatorial lower bound is shown, even in the case where the graph of the diagram is a tree. This contrasts with the $O(\log{n})$ upper bound of Aronov et al. (2006) for farthest-point Voronoi diagrams when the points are inserted in order along their convex hull. We present a semi-dynamic data structure that maintains the Voronoi diagram of a set $S$ of $n$ sites in convex position. This structure supports the insertion of a new site $p$ and finds the asymptotically minimal number $K$ of edge insertions and removals needed to obtain the diagram of $S \cup \{p\}$ from the diagram of $S$, in time $O(K\,\mathrm{polylog}\ n)$ worst case, which is $O(\sqrt{n}\;\mathrm{polylog}\ n)$ amortized by the aforementioned result. The most distinctive feature of this data structure is that the graph of the Voronoi diagram is maintained at all times and can be traversed in the natural way; this contrasts with other known data structures supporting nearest neighbor queries. Our data structure supports general search operations on the current Voronoi diagram, which can, for example, be used to perform point location queries in the cells of the current Voronoi diagram in $O(\log n)$ time, or to determine whether two given sites are neighbors in the Delaunay triangulation.
Deriving Application Level Relationships by Analysing the Run Time Behaviour of Simple and Complex SQL Queries
Venue: arXiv cs.DB 2016
Year: 2016

This paper describes a unique approach to perform application behavioral analysis for identifying how tables might be related to each other. The analysis techniques are based on the properties of primary and foreign keys and also the data present in their respective columns. We have also implemented the idea using JAVA and presented experimental results in Demo Section.This paper introduces a unique approach to predict the possible application level relationships in databases with the help of the application relationship analysis of simple and complex SQL queries. Complex SQL queries are those which contain multiple constraints at different levels of the database. In the process of deriving relations, we first parse the SQL statements and then analyse the parsed information to extract related information.
An Improved Self-Organizing Diffusion Mobile Adaptive Network for Pursuing a Target
Venue: arXiv cs.RO 2016
Year: 2016

In this letter we focus on designing self-organizing diffusion mobile adaptive networks where the individual agents are allowed to move in pursuit of an objective (target). The well-known Adapt-then-Combine (ATC) algorithm is already available in the literature as a useful distributed diffusion-based adaptive learning network. However, in the ATC diffusion algorithm, fixed step sizes are used in the update equations for velocity vectors and location vectors. When the nodes are too far away from the target, such strategies may require large number of iterations to reach the target. To address this issue, in this paper we suggest two modifications on the ATC mobile adaptive network to improve its performance. The proposed modifications include (i) distance-based variable step size adjustment at diffusion algorithms to update velocity vectors and location vectors (ii) to use a selective cooperation, by choosing the best nodes at each iteration to reduce the number of communications. The performance of the proposed algorithm is evaluated by simulation tests where the obtained results show the superior performance of the proposed algorithm in comparison with the available ATC mobile adaptive network.
On Fast Decoding of High Dimensional Signals from One-Bit Measurements
Venue: arXiv cs.IT 2016
Year: 2016

In the problem of one-bit compressed sensing, the goal is to find a $δ$-close estimation of a $k$-sparse vector $x \in \mathbb{R}^n$ given the signs of the entries of $y = Φx$, where $Φ$ is called the measurement matrix. For the one-bit compressed sensing problem, previous work \cite{Plan-robust,support} achieved $Θ(δ^{-2} k \log(n/k))$ and $\tilde{ \Oh} ( \frac{1}{ δ} k \log (n/k))$ measurements, respectively, but the decoding time was $Ω( n k \log (n / k ))$. \ In this paper, using tools and techniques developed in the context of two-stage group testing and streaming algorithms, we contribute towards the direction of very fast decoding time. We give a variety of schemes for the different versions of one-bit compressed sensing, such as the for-each and for-all version, support recovery; all these have $poly(k, \log n)$ decoding time, which is an exponential improvement over previous work, in terms of the dependence of $n$.
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
Venue: arXiv cs.DS 2016
Year: 2016

The Shoshan-Zwick algorithm solves the all pairs shortest paths problem in undirected graphs with integer edge costs in the range $\{1, 2, \dots, M\}$. It runs in $\tilde{O}(M\cdot n^ω)$ time, where $n$ is the number of vertices, $M$ is the largest integer edge cost, and $ω< 2.3727$ is the exponent of matrix multiplication. It is the fastest known algorithm for this problem. This paper points out the erroneous behavior of the Shoshan-Zwick algorithm and revises the algorithm to resolve the issues that cause this behavior. Moreover, it discusses implementation aspects of the Shoshan-Zwick algorithm using currently-existing sub-cubic matrix multiplication algorithms.
Development and Validation of Functional Model of a Cruise Control System
Venue: arXiv cs.SY 2016
Year: 2016

Modern automobiles can be considered as a collection of many subsystems working with each other to realize safe transportation of the occupants. Innovative technologies that make transportation easier are increasingly incorporated into the automobile in the form of functionalities. These new functionalities in turn increase the complexity of the system framework present and traceability is lost or becomes very tricky in the process. This hugely impacts the development phase of an automobile, in which, the safety and reliability of the automobile design should be ensured. Hence, there is a need to ensure operational safety of the vehicles while adding new functionalities to the vehicle. To address this issue, functional models of such systems are created and analysed. The main purpose of developing a functional model is to improve the traceability and reusability of a system which reduces development time and cost. Operational safety of the system is ensured by analysing the system with respect to random and systematic failures and including safety mechanism to prevent such failures. This paper discusses the development and validation of a functional model of a conventional cruise control system in a passenger vehicle based on the ISO 26262 Road Vehicles - Functional Safety standard. A methodology for creating functional architectures and an architecture of a cruise control system developed using the methodology are presented.
Modeling Interference Between OFDM/OQAM and CP-OFDM: Limitations of the PSD-Based Model
Venue: arXiv cs.IT 2016
Year: 2016

To answer the challenges put out by the next generation of wireless networks (5G), important research efforts have been undertaken during the last few years to find new waveforms that are better spectrally localized and less sensitive to asynchronism effects than the widely deployed Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM). One of the most studied schemes is OFDM-Offset Quadrature Amplitude Modulation (OFDM/OQAM) based on the PHYDYAS filter pulse. In the recent literature, spectrum coexistence between OFDM/OQAM and CP-OFDM is commonly studied based on the Power Spectral Density (PSD) model. In this paper, we show that this approach is flawed and we show that the actual interference injected by OFDM/OQAM systems onto CP-OFDM is much higher than what is classically expected with the PSD based model in the literature. We show that though using OFDM/OQAM in secondary systems is still advantageous, it brings limited gain in the context of coexistence with incumbent CP-OFDM systems.
Shirtless and Dangerous: Quantifying Linguistic Signals of Gender Bias in an Online Fiction Writing Community
Venue: arXiv cs.CL 2016
Year: 2016

Imagine a princess asleep in a castle, waiting for her prince to slay the dragon and rescue her. Tales like the famous Sleeping Beauty clearly divide up gender roles. But what about more modern stories, borne of a generation increasingly aware of social constructs like sexism and racism? Do these stories tend to reinforce gender stereotypes, or counter them? In this paper, we present a technique that combines natural language processing with a crowdsourced lexicon of stereotypes to capture gender biases in fiction. We apply this technique across 1.8 billion words of fiction from the Wattpad online writing community, investigating gender representation in stories, how male and female characters behave and are described, and how authors' use of gender stereotypes is associated with the community's ratings. We find that male over-representation and traditional gender stereotypes (e.g., dominant men and submissive women) are common throughout nearly every genre in our corpus. However, only some of these stereotypes, like sexual or violent men, are associated with highly rated stories. Finally, despite women often being the target of negative stereotypes, female authors are equally likely to write such stereotypes as men.
Palmprint Recognition Using Deep Scattering Convolutional Network
Venue: arXiv cs.CV 2016
Year: 2016

Palmprint recognition has drawn a lot of attention during the recent years. Many algorithms have been proposed for palmprint recognition in the past, majority of them being based on features extracted from the transform domain. Many of these transform domain features are not translation or rotation invariant, and therefore a great deal of preprocessing is needed to align the images. In this paper, a powerful image representation, called scattering network/transform, is used for palmprint recognition. Scattering network is a convolutional network where its architecture and filters are predefined wavelet transforms. The first layer of scattering network captures similar features to SIFT descriptors and the higher-layer features capture higher-frequency content of the signal which are lost in SIFT and other similar descriptors. After extraction of the scattering features, their dimensionality is reduced by applying principal component analysis (PCA) which reduces the computational complexity of the recognition task. Two different classifiers are used for recognition: multi-class SVM and minimum-distance classifier. The proposed scheme has been tested on a well-known palmprint database and achieved accuracy rate of 99.95% and 100% using minimum distance classifier and SVM respectively.
Massive MIMO with Multi-Antenna Users: When are Additional User Antennas Beneficial?
Venue: arXiv cs.IT 2016
Year: 2016

We analyze the performance of massive MIMO systems with $N$-antenna users. The benefit is that $N$ streams can be multiplexed per user, at the price of increasing the channel estimation overhead linearly with $N$. Uplink and downlink spectral efficiency (SE) expressions are derived for any $N$, and these are achievable using estimated channels and per-user-basis MMSE-SIC detectors. Large-system approximations of the SEs are obtained. This analysis shows that MMSE-SIC has similar asymptotic SE as linear MMSE detectors, indicating that the SE increase from having multi-antenna users can be harvested using linear detectors. We generalize the power scaling laws for massive MIMO to handle arbitrary $N$, and show that one can reduce the multiplication of the pilot power and payload power as $\frac{1}{M}$ where $M$ is the number of BS antennas, and still notably increase the SE with $M$ before reaching a non-zero asymptotic limit. Simulations testify our analysis and show that the SE increases with $N$. We also note that the same improvement can be achieved by serving $N$ times more single-antenna users instead, thus the additional user antennas are particular beneficial for SE enhancement when there are few active users in the system.
FPGA Impementation of Erasure-Only Reed Solomon Decoders for Hybrid-ARQ Systems
Venue: arXiv cs.AR 2016
Year: 2016

This paper presents the usage of the Reed Solomon Codes as the Forward Error Correction (FEC) unit of the Hybrid Automatic Repeat Request (ARQ) methods. Parametric and flexible FPGA implementation details of such Erasure-Only RS decoders with high symbol lengths (e.g. GF(2^32)) have been presented. The design is based on the GF(2m) multiplier logic core operating at a single clock cycle, where the resource utilization and throughput are both directly proportional to the number of these cores. For a fixed implementation, the throughput inversely decreases with the number of erasures to be corrected. Implementation in Zynq7020 SoC device of an example GF(2^32)-RS Decoder capable of correcting 64-erasures with a single multiplier resulted in 1641-LUTs and 188-FFs achieving 15Mbps, whereas the design with 8 multipliers resulted in 6128-LUTs and 628-FFs achieving 100Mbps.
Exploiting Facial Landmarks for Emotion Recognition in the Wild
Venue: arXiv cs.CV 2016
Year: 2016

In this paper, we describe an entry to the third Emotion Recognition in the Wild Challenge, EmotiW2015. We detail the associated experiments and show that, through more accurately locating the facial landmarks, and considering only the distances between them, we can achieve a surprising level of performance. The resulting system is not only more accurate than the challenge baseline, but also much simpler.
Circuit Synthesis of Electrochemical Supercapacitor Models
Venue: arXiv cs.SY 2016
Year: 2016

This paper is concerned with the synthesis of RC electrical circuits from physics-based supercapacitor models describing conservation and diffusion relationships. The proposed synthesis procedure uses model discretisation, linearisation, balanced model order reduction and passive network synthesis to form the circuits. Circuits with different topologies are synthesized from several physical models. This work will give greater understanding to the physical interpretation of electrical circuits and will enable the development of more generalised circuits, since the synthesized impedance functions are generated by considering the physics, not from experimental fitting which may ignore certain dynamics.
Iterated Ontology Revision by Reinterpretation
Venue: arXiv cs.AI 2016
Year: 2016

Iterated applications of belief change operators are essential for different scenarios such as that of ontology evolution where new information is not presented at once but only in piecemeal fashion within a sequence. I discuss iterated applications of so called reinterpretation operators that trace conflicts between ontologies back to the ambiguous of symbols and that provide conflict resolution strategies with bridging axioms. The discussion centers on adaptations of the classical iteration postulates according to Darwiche and Pearl. The main result of the paper is that reinterpretation operators fulfill the postulates for sequences containing only atomic triggers. For complex triggers, a fulfillment is not guaranteed and indeed there are different reasons for the different postulates why they should not be fulfilled in the particular scenario of ontology revision with well developed ontologies.