nils-herrmann/clean_scirepeval huggingface dataset:
SoK Security and Privacy in the Age of Drones: Threats, Challenges, Solution Mechanisms, and Scientific Gaps
Venue: ArXiv
Year: 2019

The evolution of drone technology in the past nine years since the first commercial drone was introduced at CES 2010 has caused many individuals and businesses to adopt drones for various purposes. We are currently living in an era in which drones are being used for pizza delivery, the shipment of goods, and filming, and they are likely to provide an alternative for transportation in the near future. However, drones also pose a significant challenge in terms of security and privacy within society (for both individuals and organizations) and many drone related incidents are reported on a daily basis. These incidents have called attention to the need to detect and disable drones used for malicious purposes and opened up a new area of research and development for academia and industry, with a market that is expected to reach $1.85 billion by 2024. While some of the knowledge used to detect UAVs has been adopted for drone detection, new methods have been suggested by industry and academia alike to deal with the challenges associated with detecting the very small and fast flying objects. In this paper, we describe new societal threats to security and privacy created by drones, and present academic and industrial methods used to detect and disable drones. We review methods targeted at areas that restrict drone flights and analyze their effectiveness with regard to various factors (e.g. weather, birds, ambient light, etc. We present the challenges arising in areas that allow drone flights, introduce the methods that exist for dealing with these challenges, and discuss the scientific gaps that exist in this area. Finally, we review methods used to disable drones, analyze their effectiveness, and present their expected results. Finally, we suggest future research directions.
Artificial Intelligence (AI) new developments and innovations applied to e commerce
Year: 2020

This in depth analysis discusses the opportunities and challenges brought by the recent and the foreseeable developments of Artificial Intelligence into online platforms and marketplaces. The paper advocates the importance to support trustworthy, explainable AI (in order to fight discrimination and manipulation, and empower citizens) and societal aware AI (in order to fight polarisation, monopolistic concentration and excessive inequality, and pursue diversity and openness) This document was provided by the Policy Department for Economic, Scientific and Quality of Life Policies at the request of the committee on the Internal Market and Consumer Protection (IMCO) Artificial Intelligence (AI) new developments and innovations applied to e commerce Challenges to the functioning of the Internal Market This document was requested by the European Parliament's committee on the Internal Market and Consumer Protection. AUTHORS Dino PEDRESCHI, University of Pisa, Italy Ioanna MILIOU, University of Pisa, Italy ADMINISTRATORS RESPONSIBLE Mariusz MACIEJEWSKI Christina RATCLIFF EDITORIAL ASSISTANT Roberto BIANCHINI LINGUISTIC VERSIONS Original: EN ABOUT THE EDITOR Policy departments provide in house and external expertise to support EP committees and other parliamentary bodies in shaping legislation and exercising democratic scrutiny over EU internal policies. To contact the Policy Department or to subscribe for updates, please write to: Policy Department for Economic, Scientific and Quality of Life Policies European Parliament L 2929 Luxembourg  Poldep Economy Science@ep.europa.eu Manuscript completed: May 2020 Date of publication: May 2020 (c) European Union, 2020 This document is available on the internet at: http:/www.europarl.europa.eu/supporting analyses DISCLAIMER AND COPYRIGHT The opinions expressed in this document are the sole responsibility of the authors and do not necessarily represent the official position of the European Parliament. Reproduction and translation for non commercial purposes are authorised, provided the source is acknowledged and the European Parliament is given prior notice and sent a copy. For citation purposes, the study should be referenced as: Pedreschi, D. Artificial Intelligence (AI) new developments and innovations applied to e commerce, Study for the committee on the Internal Market and Consumer Protection, Policy Department for Economic, Scientific and Quality of Life Policies, European Parliament, Luxembourg, 2020. (c) Cover image used under licence from Shutterstock.com Artificial Intelligence (AI) new developments and innovations applied to e commerce 3 PE 648.791 CONTENTS LIST OF FIGURES 5 EXECUTIVE SUMMARY 6 1. ARTIFICIAL INTELLIGENCE, BIG DATA, MACHINE LEARNING 9 2. AI RISKS AND CHALLENGES 11
Anxiety and Politics
Year: 2017

The English version of this article was first published in 1957.  In this essay, Franz L. Neumann discusses the role of anxiety in politics.  How does it happen that the masses sell their souls to leaders and follow them blindly? On what does the power of attraction of leaders over masses rest? What are the historical situations in which this identification of leader and masses is successful, and what view of history do the men have who accept leaders? For answering these questions, the author suggests a combination of political economy, Freudian political psychology, and ideology critique. He sees anxiety in the context of alienation. Alienation is analysed as a multidimensional phenomenon consisting of economic, political, social and psychological alienation. Neumann introduces the notions of Caesaristic identification, institutionalised anxiety and persecutory anxiety. The essay shows that fascism remains an actual threat in capitalist societies.  The editors of tripleC express their gratitude to the Neumann and Marcuse families for their support in republishing this essay, to Simon Schuster for granting us the rights, and to Denise Rose Hansen for her invaluable editorial assistance.  From the book "The Democratic and the Authoritarian State" by Franz Neumann.  Reprinted by permission of Free Press, a Division of Simon Schuster, Inc. Originally delivered as a lecture before the Free University of Berlin and published in the series "Recht und Staat," Tubingen,1954. Translated by Professor Peter Gay. This article is published in tripleC without a CC licence. About the Author Franz Leopold Neumann (1900 1954) was a political theorist associated with the Frankfurt School. He obtained a doctoral degree in legal studies at the University of Frankfurt with the dissertation ,Rechtsphilosophische Einleitung zu einer Abhandlung uber das Verhaltnis von Staat und Strafe" A Legal Philosophical Introduction to A Treatise on the Relationship between the State and Punishment Neumann became the German Social Democratic Party's (SPD) main legal advisor at a time when the Nazis and Hitler gained strength in Germany. At the time when Hitler came to power in 1933, the legal office had to be closed and Neumann had to flee from Germany. In London, he in 1936 obtained his second doctoral degree from the London School of Economics with the work "The Governance of the Rule of Law" under the supervision of Harold Laski and Karl Mannheim. Neumann moved to New York in 1936, where he became a member of the Institute of Social Research (also known as the "Frankfurt School" that was then in exile in the USA. In 1942, he started working for the Office of Strategic Service (OSS) where he together with Herbert Marcuse and Otto Kirchheimer analysed Nazi Germany. In 1942, Neumann published his main book is Behemoth: The Structure and Practice of National Socialism, 1933 1944 (2 nd updated edition published in 1944) one of the most profound analyses of Nazi Germany's political economy and ideology. Franz L. Neumann died in 1954 in a car accident.
Resource Fairness and Composability of Cryptographic Protocols
Venue: Journal of Cryptology
Year: 2010

We introduce the notion of resource fair protocols. Informally, this property states that if one party learns the output of the protocol, then so can all other parties, as long as they expend roughly the same amount of resources. As opposed to previously proposed definitions related to fairness, our definition follows the standard simulation paradigm and enjoys strong composability properties. In particular, our definition is similar to the security definition in the universal composability (UC) framework, but works in a model that allows any party to request additional resources from the environment to deal with dishonest parties that may prematurely abort.In this model we specify the ideally fair functionality as allowing parties to "invest resources" in return for outputs, but in such an event offering all other parties a fair deal. (The formulation of fair dealings is kept independent of any particular functionality, by defining it using a "wrapper." Thus, by relaxing the notion of fairness, we avoid a well known impossibility result for fair multi party computation with corrupted majority; in particular, our definition admits constructions that tolerate arbitrary number of corruptions. We also show that, as in the UC framework, protocols in our framework may be arbitrarily and concurrently composed.Turning to constructions, we define a "commit prove fair open" functionality and design an efficient resource fair protocol that securely realizes it, using a new variant of a cryptographic primitive known as "time lines." With (the fairly wrapped version of) this functionality we show that some of the existing secure multi party computation protocols can be easily transformed into resource fair protocols while preserving their security.
Capital Social, Confiance Et Developpement Territorial: Une Etude Appliquee En Kabylie (Social Capital, Trustworthiness and Territorial Development: An Applied Study in Kabylia)
Year: 2014

French  Des organisations informelles sont creees en l'absence d'institutions formelles fortes ou en cas de manque de confiance dans les institutions. Le capital social structurel civil, comme par exemple le systeme de gouvernance traditionnel des villages kabyles, peut alors se substituer au capital social structurel gouvernemental. Le mode d'organisation traditionnel kabyle, fonde sur un certain nombre de valeurs (democratie, entraide. privilegie les liens de type bonding qui caracterisent des relations communautaires. Mais, cet etat de fait ne tend il pas vers un renfermement communautaire qui pourrait avoir un impact negatif sur la dynamique territoriale Cet article montre, grace au traitement d'une enquete originale sur la confiance, que cela ne semble pas etre le cas. As numerous economists and anthropologists underline it, informal organizations are created in the absence of strong formal insitutions or in the case of lack of trustworthiness. Civil structural social capital, as the traditional villages' governance system in Kabylia, can then be substituted to the governmental structural social capital. This traditionnal organization, based on values such as mutual aid, equality, democracy..promotes the bonding ties wich characterize community relations. Can this situation engender a "relational closure" wich could have a negative impact on territorial dynamics? This research brings into light, with an original survey administrated in Tizi Ouzou, that it's not the case.
Multi Agent Path Finding for Large Agents
Venue: SOCS
Year: 2019

Multi Agent Path Finding (MAPF) has been widely studied in the AI community. For example, Conflict Based Search (CBS) is a state of the art MAPF algorithm based on a twolevel tree search. However, previous MAPF algorithms assume that an agent occupies only a single location at any given time, e.g. a single cell in a grid. This limits their applicability in many real world domains that have geometric agents in lieu of point agents. Geometric agents are referred to as "large" agents because they can occupy multiple points at the same time. In this paper, we formalize and study LAMAPF, i.e. MAPF for large agents. We first show how CBS can be adapted to solve LA MAPF. We then present a generalized version of CBS, called Multi Constraint CBS (MCCBS) that adds multiple constraints (instead of one constraint) for an agent when it generates a high level search node. We introduce three different approaches to choose such constraints as well as an approach to compute admissible heuristics for the high level search. Experimental results show that all MC CBS variants outperform CBS by up to three orders of magnitude in terms of runtime. The best variant also outperforms EPEA* (a state of the art A* based MAPF solver) in all cases and MDD SAT (a state of the art reduction based MAPF solver) in some cases.
United States Patent Nagrath
Year: 2013

Alon U (2007) Network motifs: theory and experimental approaches.  Rev Genet 8: 450 461 (12 pages) Chickarmane, V. eta! Transcriptional dynamics of the embryonic stem cell switch.  p. e123. (13 pages) Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen Orr S, et al. (2004) Superfamilies of evolved and designed networks.  15381542 (6 pages) Milo R, Shen Orr S, ltzkovitz S, Kashtan N, Chklovskii D, et a! (2002) Network motifs: simple building blocks of complex networks.  824 827 (5 pages) Nagrath, D. eta! Metabolomics for mitochondrial and cancer studies. Biochim Biophys Acta, 2011. 1807(6) p. 650 63 (14 pages) Balazsi G, Barabasi AL, Oltvai ZN (2005) Topological units of environmental signal processing in the transcriptional regulatory network of Escherichia coli.  7846 (6 pages)
Optimal coding and the origins of Zipfian laws
Venue: ArXiv
Year: 2019

The problem of compression in standard information theory consists of assigning codes as short as possible to numbers. Here we consider the problem of optimal coding under an arbitrary coding scheme and show that it predicts Zipf's law of abbreviation, namely a tendency in natural languages for more frequent words to be shorter. We apply this result to investigate optimal coding also under so called non singular coding, a scheme where unique segmentation is not warranted but codes stand for a distinct number. Optimal non singular coding predicts that the length of a word should grow approximately as the logarithm of its frequency rank, which is again consistent with Zipf's law of abbreviation. Optimal non singular coding in combination with the maximum entropy principle also predicts Zipf's rank frequency distribution. Furthermore, our findings on optimal non singular coding challenge common beliefs about random typing. It turns out that random typing is in fact an optimal coding process, in stark contrast with the common assumption that it is detached from cost cutting considerations. Finally, we discuss the implications of optimal coding for the construction of a compact theory of Zipfian laws and other linguistic laws.
Data Efficient Image Recognition with Contrastive Predictive Coding
Venue: ICML
Year: 2020

Human observers can learn to recognize new categories of images from a handful of examples, yet doing so with artificial ones remains an open challenge. We hypothesize that data efficient recognition is enabled by representations which make the variability in natural signals more predictable. We therefore revisit and improve Contrastive Predictive Coding, an unsupervised objective for learning such representations. This new implementation produces features which support state of the art linear classification accuracy on the ImageNet dataset. When used as input for non linear classification with deep neural networks, this representation allows us to use 2 5x less labels than classifiers trained directly on image pixels. Finally, this unsupervised representation substantially improves transfer learning to object detection on the PASCAL VOC dataset, surpassing fully supervised pre trained ImageNet classifiers.
Book Review: Digital Labour and Karl Marx
Year: 2016

In this book, Fuchs sets out to elucidate Marx's theory of labour and exploitation within the capitalist mode of production and then to apply this theory in an analysis of the role of labour within the various stages of production that result in the delivery of digital media. He claims in particular that only such a theoretical perspective allows us to grasp (a) the way in which users of social media are being exploited to produce surplus value for the owners of services such as Facebook and (b) the need for a classic Marxist proletarian revolution within the field of social media to end this exploitation and replace it with what he calls 'a communications commons' Fuchs places his project within the renewed interest in Marxism inspired by the 2008 financial crisis and explicitly sees it as a continuation of the debate between Cultural Studies and The Political Economy of Communications. Certainly, the book, in its case studies of the labour process and the relations of production within the various stages of global production that underpin, within the International Division of Labour (IDL) our usage of digital devices and network services, serves as a useful reminder, to those with a more benign, idealist view of the digital information revolution, of the very real material costs involved and who bears them. A reminder unfortunately that cannot be reiterated often enough. However, one does not, I think, require the very narrow and dogmatic version of Marxist theory that Fuchs deploys to get this point. Much writing on the Left in response to the 2008 crisis has talked in terms of a return to Marxism. After the years in the wilderness of neo liberal hegemony, the rumbling of capitalist crisis is heard again, and now, perhaps, at last it can be claimed that 'our time has come' One more circumnavigation of the walls of capitalism blowing the trumpets of proletarian revolution and the gates to an unalienated paradise will open to us. The sense of anger and the widespread economic and social distress are, of course, very real. But it is the idea that we should go back to something with which I want to take issue. Particularly to a set of theories of both economy and polity designed for very different conditions. What is required is not a going back but a going beyond which takes into account the very real theoretical inadequacies of Marxism and the lessons learnt by political economists, and citizens at large, from analysing and experiencing 150 years of capitalist development and attempts at socialist transformation. Indeed, in my judgement, the sad irony is that both Marxism and neo liberalism suffer from the same failure, born of the same 19th century model of the world. Both systems of thought believe that the economy is a simple, monolithic system and that therefore there 612543 MCS0010.1177/0163443715612543Media, Culture SocietyBook Review research article2015
Stationary and pulsating vector dissipative solitons in nonlinear multimode interference based fiber lasers.
Venue: Optics express
Year: 2020

Rapid progress in real time spectroscopy uncovers the spatio spectral scenarios of ultrashort pulses in dissipative systems. Varieties of transient soliton dynamics on different timescales have been revealed. Here, we report on an experimental observation of stationary and pulsating vector dissipative solitons in a nonlinear multimode interference (NL MMI) based fiber laser with net normal dispersion. Polarization non discrimination of the NL MMI mode locking facilitates the dissipative soliton trapping process. Two orthogonally polarized components are coupled together through oppositely shifting their central frequencies to form the group velocity locked vector dissipative solitons (GVLVDSs) Dispersive Fourier transform (DFT) based polarization resolved measurement enables insights into the transient polarization dynamics and the long term evolution. Particularly, both stationary and pulsating GVLVDSs are obtained with appropriate parameter settings. It is found that the quasi stationary pulsating manner is accompanied with recurrent spectral breathing and energy oscillation; the two orthogonally polarized components possess synchronous pulsating manners due to the cross phase modulation induced trapping mechanism and the similar formation process. Additionally, chaotic pulsation is also captured in sense that the spectra cannot recover to their original profiles despite of the harmonic energy oscillation. All these findings can enhance our understanding towards soliton pulsation with the freedom of vectorial degree.
Correction: COG5 CDG: expanding the clinical spectrum
Venue: Orphanet Journal of Rare Diseases
Year: 2013

Author details Centre for Human Genetics, University of Leuven, Leuven, Belgium. Centre for Metabolic Diseases, University Hospital Gasthuisberg, Herestraat 49, BE 3000, Leuven, Belgium. University Children's Hospital Queen Fabiola, Brussels, Belgium. Division of Metabolism, Bambino Gesu Hospital, Rome, Italy. Duchess of Kent Children's Hospital, University of Hong Kong, Pokfulam, Hong Kong. Institute of Chemistry and Technology of Polymers, Catania, Sicily, Italy. Structural and Functional Glycobiology Unit, University of Lille 1, Lille 1, France.
Discrete Polar Decoder using Information Bottleneck Method
Venue: ICC 2020 2020 IEEE International Conference on Communications (ICC)
Year: 2020

Polar codes are attracting much attention and being used for control channels of the 5th generation of mobile communication system (5G) As a feature, it is easier to implement encoder and decoder than Turbo codes and LDPC (Low Density Parity Check) codes. One of the decoding methods of polar codes is BP (Belief Propagation) decoding, which can decode in parallel, so that decoding can be performed at high speed. However, due to hardware limitation, calculations on the decoder get very complicated. This issue can be solved by using the information bottleneck method. This method compresses an observation variable to a quantized one while attempting to preserve the mutual information shared with a relevant random variable. In the conventional research, the information bottleneck method is applied to the BP decoding of the LDPC codes. In this paper, the information bottleneck method is used for the BP decoding of polar codes. The BP decoding of polar codes is distinct from that of LDPC codes. It has several types of the messages, and each time a message is updated, the decoding becomes more complex. By using the information bottleneck method, the decoder can compress the channel outputs and the messages of BP into unsigned integers while preventing degradation of the error correcting performance. Thus, we can reduce the complexity of calculation in the decoding process and easily implement the decoder. This paper also investigates the minimum bit width for quantization with negligible degradation and the suboptimal $E_{b}/N_{0} for designing the lookup tables. These lookup tables are used for updating the messages. The simulation results show that the error correcting capability of the discrete polar decoders of the proposed method is negligibly degraded compared to the BP decoding without compression.
Approximate dynamic programming methods applied to far trajectory planning in optimal control
Venue: 2014 IEEE Intelligent Vehicles Symposium Proceedings
Year: 2014

There are several applications that need far trajectory planning within optimal control problems. One use case is the optimal predictive control of plug in hybrid electric vehicles (PHEV) It is possible to find an optimal control with models of the vehicle and environment and a fast optimization algorithm that is capable to calculate over long distances within seconds so that dynamic information such as traffic can be recognized quickly. In this paper, several methods based on dynamic programming (DP) are combined to generate approximated optimal control trajectories with a reduced computational complexity to achieve close to real time application. The resulting trajectories are transferred as strategic planning trajectory to subordinated vehicle controllers. Close to optimal trajectories are achieved with a large reduction in memory.