A peaceful pyramid? Hierarchy and anonymity in newspaper comment sections

Several studies have linked deindividuation to an increase in aggression and incivility. This paper seeks to ascertain the influence of anonymity and hierarchy in online aggression by comparing two different newspaper comment sections: one with a hierarchical system and the other with an equalitarian setting. This study distinguishes itself form previous works by analyzing systems where identification is optional and where identified and anonymous users coexist. The hierarchical solution might be relevant to dissuade aggression when optional identifiability is seen as an essential asset. Results show that a hierarchical system provides some improvements in terms of civility and comment moderation, but that poor implementation of the hierarchy causes perversions in the system and affects its effectiveness.

Topological abstraction of higher-dimensional automata

Higher-dimensional automata constitute a very expressive model for concurrent systems. In this paper, we discuss ``topological abstraction" of higher-dimensional automata, i.e., the replacement of HDAs by smaller ones that can be considered equivalent from the point of view of both computer science and topology. By definition, topological abstraction preserves the homotopy type, the trace category, and the homology graph of an HDA. We establish conditions under which cube collapses yield topological abstractions of HDAs.

Comparison of single and multi-objective evolutionary algorithms for robust link-state routing

Traffic Engineering (TE) approaches are increasingly impor- tant in network management to allow an optimized configuration and resource allocation. In link-state routing, the task of setting appropriate weights to the links is both an important and a challenging optimization task. A number of different approaches has been put forward towards this aim, including the successful use of Evolutionary Algorithms (EAs). In this context, this work addresses the evaluation of three distinct EAs, a single and two multi-objective EAs, in two tasks related to weight setting optimization towards optimal intra-domain routing, knowing the network topology and aggregated traffic demands and seeking to mini- mize network congestion. In both tasks, the optimization considers sce- narios where there is a dynamic alteration in the state of the system, in the first considering changes in the traffic demand matrices and in the latter considering the possibility of link failures. The methods will, thus, need to simultaneously optimize for both conditions, the normal and the altered one, following a preventive TE approach towards robust configurations. Since this can be formulated as a bi-objective function, the use of multi-objective EAs, such as SPEA2 and NSGA-II, came nat- urally, being those compared to a single-objective EA. The results show a remarkable behavior of NSGA-II in all proposed tasks scaling well for harder instances, and thus presenting itself as the most promising option for TE in these scenarios.

Bidirectional battery charger with grid-to-vehicle, vehicle-to-grid and vehicle-to-home technologies

This paper presents the development of na on-board bidirectional battery charger for Electric Vehicles (EVs) targeting Grid-to-Vehicle (G2V), Vehicle-to-Grid (V2G), and Vehicle-to-Home (V2H) technologies. During the G2V operation mode the batteries are charged from the power grid with sinusoidal current and unitary power factor. During the V2G operation mode the energy stored in the batteries can be delivered back to the power grid contributing to the power system stability. In the V2H operation mode the energy stored in the batteries can be used to supply home loads during power outages, or to supply loads in places without connection to the power grid. Along the paper the hardware topology of the bidirectional battery charger is presented and the control algorithms are explained. Some considerations about the sizing of the AC side passive filter are taken into account in order to improve the performance in the three operation modes. The adopted topology and control algorithms are accessed through computer simulations and validated by experimental results achieved with a developed laboratory prototype operating in the different scenarios.

Factoriality and the pin-reutenauer procedure

We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest such signature is closed under taking factors within the free pro-V semigroup on the same set of generators. Furthermore, we show that the natural analogue of the Pin-Reutenauer descriptive procedure for the closure of a rational language in the free group with respect to the profinite topology holds for the pseudovariety of all finite semigroups. As an application, we establish that a pseudovariety enjoys this property if and only if it is full.