The other side of ranking schemes: generating weights for specified outcomes

This paper treats the problem of how to determine weights in a ranking, which will cause a selected entity to attain the highest possible position. We establish that there are two types of entities in a ranking scheme: those which can be ranked as number one and those which cannot. These two types of entities can be identified using the “ranking hull” of the data; a polyhedral set that envelops the data. Only entities with data points on the boundary of this hull can attain the number one position. There are no weights that will make an entity whose data point is in the interior of the hull to ever attain the number one position. We deal with these two types of entities separately. In the first case, we propose an approach for finding a set of weights that, under special conditions, will result in a selected entity achieving the top of the ranking without ties and without ignoring any of the attributes. For the second category of entities, we devise a procedure to guarantee that these entities will attain their highest possible position in the ranking. The first case will require using interior point methods to solve a linear program (LP). The second case involves a binary mixed integer formulation. These two mathematical programs were tested on data from a well‐known university ranking.     

3D block-based medial axis transform and chessboard distance transform based on dominance

Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. In fact, there exist some equivalent properties between them. The relationship between both of them is first derived and proved in this paper. One of the significant properties is that CDT for 3D binary image V is equal to BB-MAT for image V' where it denotes the inverse image of V. In a parallel algorithm, a cost is defined as the product of the time complexity and the number of processors used. The main contribution of this work is to reduce the costs of 3D BB-MAT and 3D CDT problems proposed by Wang [65]. Based on the reverse-dominance technique which is redefined from dominance concept, we achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N³, our parallel algorithm can be run in O(logN) time using N³ processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. The presented results for the cost are reduced in comparison with those of Wang's. To the best of our knowledge, this work is the lowest costs for the 3D BB-MAT and 3D CDT algorithms known. In parallel algorithms, the running time can be divided into computation time and communication time. The experimental results of the running, communication and computation times for the different problem sizes are implemented in an HP Superdome with SMP/CC-NUMA (symmetric multiprocessor/cache coherent non-uniform memory access) architecture. We conclude that the parallel computer (i.e., SMP/CC-NUMA architecture or cluster system) is more suitable for solving problems with a large amount of input size.     

FAST: acceleration from theory to practice

Fast acceleration of symbolic transition systems (Fast) is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under study. Even if this reachability set is not necessarily recursive, we use innovative techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. Fast has proved to perform very well on case studies. This paper describes the tool, from the underlying theory to the architecture choices. Finally, Fast capabilities are compared with those of other tools. A range of case studies from the literature is investigated. This paper is mainly based on results presented at CAV 2003, TACAS 2004 and ATVA 2005.     

Improving security and performance of an Ad Hoc network through a multipath routing strategy

Privacy and security solutions require today the protection of personal information so that it may not be disclosed to unauthorized participant for illegal purposes. It is a challenge to address these issues in networks with strong constraints such as Ad Hoc network. The security increase is often obtained with a quality of service (QoS) decrease. We propose in this paper a solution that provides at the anonymity, security to Ad Hoc network with a limited impact on QoS. This method could be efficient against some viral attacks. We also give some security proofs of our solution for Ad Hoc networks. The work of Hervé Aiache and Cédric Tavernier was supported by DISCREET, IST project no. 027679, funded in part by the European Commission’s Information Society Technology 6th Framework Programme.     

Fast attack detection using correlation and summarizing of security alerts in grid computing networks

Due to the extensive growth of grid computing networks, security is becoming a challenge. Usual solutions are not enough to prevent sophisticated attacks fabricated by multiple users especially when the number of nodes connected to the network is changing over the time. Attackers can use multiple nodes to launch DDoS attacks which generate a large amount of security alerts. On the one hand, this large number of security alerts degrades the overall performance of the network and creates instability in the operation of the security management solutions. On the other hand, they can help in camouflaging other real attacks. To address these issues, a?correlation mechanism is proposed which reduces the security alerts and continue detecting attacks in grid computing networks. To obtain the more accurate results, a?major portion of the experiments are performed by launching DDoS and Brute Force (BF) attacks in real grid environment, i.e., the Grid??5000 (G5K) network.     

An electrical conductivity and TEM study of the sulphurization by gaseous H2S of NiO single crystals

An electrical conductivity and transmission electron microscopy study of the very early stages of the sulphurization by H₂S of NiO single crystals were carried out at low pressure (p<20 Torr) and at T<700 K. For treatments at pH₂S < 10^-4 Torr 2 main stages of reaction were found: (a) a topotactical reduction of the oxide producing Ni islands with a diameter of about 20 nm and (b) an epitaxial overgrowth of Ni₃S₂ from the metallic islands. The maximal conversion rate of the NiO sulphurization is very low and depends on the states of the crystal surface. For treatments at pH₂S 20 Torr a non-stoichiometric nickel sulphide was identified.     

Measuring Affective Clarity Indirectly: Individual Differences in Response Latencies of State.

This research investigated a new method to measure momentary affective clarity indirectly, which is based on latencies of responses to state affect items. Three studies revealed that this indirect measure of momentary clarity demonstrated high reliability and stability as well as convergent and predictive validity. The indirect measure was associated with dispositional clarity when the concept of clarity was activated before measuring response latencies (Studies 1 and 2) and was related to self-reports of momentary clarity (Study 3). Furthermore, Study 3 demonstrated that indirectly measured clarity decreased after an affectively complex film. Indirectly, but not directly, measured momentary clarity predicted a more positive affective state at the end of the study. This effect was mediated by affect regulation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

In-situ comprehensive calibration of a tri-port nano-electro-mechanical device

We report on experiments performed in vacuum and at cryogenic temperatures on a tri-port nano-electro-mechanical (NEMS) device. One port is a very nonlinear capacitive actuation, while the two others implement the magnetomotive scheme with a linear input force port and a (quasi-linear) output velocity port. We present an experimental method enabling a full characterization of the nanomechanical device harmonic response: the nonlinear capacitance function C(x) is derived, and the normal parameters k and m (spring constant and mass) of the mode under study are measured through a careful definition of the motion (in meters) and of the applied forces (in Newtons). These results are obtained with a series of purely electric measurements performed without disconnecting/reconnecting the device, and rely only on known dc properties of the circuit, making use of a thermometric property of the oscillator itself: we use the Young modulus of the coating metal as a thermometer, and the resistivity for Joule heating. The setup requires only three connecting lines without any particular matching, enabling the preservation of a high impedance NEMS environment even at MHz frequencies. The experimental data are fit to a detailed electrical and thermal model of the NEMS device, demonstrating a complete understanding of its dynamics. These methods are quite general and can be adapted (as a whole, or in parts) to a large variety of electromechanical devices.     

A Robust Transferable Method for the Determination of Glyphosate Residue in Liver After Derivatization by Ultra-high Pressure Liquid Chromatography–Tandem Mass Spectrometry

Glyphosate determination in liver is challenging due to this particular molecule/matrix combination. Glyphosate is a very polar molecule and liver composition is highly variable between individuals and species. Since 2014, the Multiannual Control Program (MACP) of the European Union (EU) demands to analyse glyphosate in food of animal origin on a voluntary basis. Moreover, this analysis will be mandatory in 2017. This paper describes a robust and easily transferable method for glyphosate quantification in liver of animal origin by means of liquid chromatography–tandem mass spectrometry (LC-MS/MS). An intensive clean-up was used to eliminate matrix interferences and was combined with a derivatization step which ensures good retention of glyphosate on a conventional reverse-phase LC column. This method allows to meet the MACP requirements without a time-consuming change in the set-up of the routinely used LC-MS/MS system. Furthermore, it allows the use of an LC column and mobile phases often used in multi-residue analysis. The analytical method was validated according to the SANCO/12571/2013 criteria. Isotopic dilution was used to quantify glyphosate, leading to mean apparent recoveries of 115 and 101 % for the low (0.025 mg kg^?1) and the high (0.250 mg kg^?1) fortification levels, respectively. At both levels, the relative standard deviation was below 10 %. The limit of quantification of 0.025 mg kg^?1 was found to be satisfactory as it was below the maximum residue level (MRL) value set at 0.050 mg kg^?1 for glyphosate in liver. It is also the lowest MRL for all commodity types.