nils-herrmann/clean_scirepeval huggingface dataset:
The Complexity of Cooperation: Agent-based Models of Competition and Collaboration Game Theory, Agent-based Modeling, and the Evolution of Social Behavior

T he latest volume in the series of Princeton Studies in Complexity is Robert Axelrod's sequel to his influential book, The Evolution of Cooperation . The earlier book was an extended commentary on his pioneering computer simulations of cooperation and competition in the iterated Prisoner's Dilemma game, originally reported in 1980 and discussed in a prize-winning journal article . The new book consists of an introduction and seven chapters extending and developing the earlier research in various directions as well as appendices containing useful technical information for researchers in the fields of complexity and agent-based modeling. The chapters are all reprints of previously published material, but they originally appeared in such widely scattered journals and edited volumes that few readers will have seen all of them before. For this volume, Axelrod has included brief introductory comments to each of them, describing the circumstances in which they were written and reactions to them. Some chapters are only indirectly related to Axelrod's well-known agent-based models of cooperation. In particular , there are two chapters devoted to his more recent landscape theory— according to which, in a group of decision makers who are myopic in their assessments of their own payoffs, the coalitions that are likely to form are those that minimize strain between the multiple elements of the interacting system. A chapter by Axelrod and D. Scott Bennett shows that landscape theory successfully predicts the alignment of 17 European nations in World War II. A separate chapter by Axelrod, Bennett, and three others shows how the theory predicts the alignment that occurred among nine major computer companies promoting two different UNIX operating system standards in 1988. A major problem with these contributions is that the coalitions predicted by landscape theory turn out to be nothing more than the Nash equilibria of conventional game theory—outcomes in which none of the actors can gain an individual advantage by defecting unilaterally to a different coalition. Nash equilibria provide necessary but insufficient criteria for deter-minate solutions to games, and game theorists have developed theories of coalition formation that are far more sophisticated and subtle and that go far beyond mere Nash equilibria . The most interesting chapters are the ones in which Axelrod is on home territory, developing his earlier agent-based simulation models of the evolution of cooperation. Starting in 1978-79, he had organized two r o u n d-r o b i n computer tournaments …
Telerobotics, automation, and human supervisory control [Review]

In Telerobotics, Automation, and Human Supervisory Control, Thomas B. Sheridan shows that progress in robotics depends not only on change in technology, but also on advances in humans’ relationships to machines. Sheridan, Professor of Engineering and Applied Psychology at M.I.T., has spent decades studying human-machine relations. His idea of “human supervisory control” (just “supervisory control” for short) has the potential to bring robotics out of the laboratory and into the difficult and messy world. Traditionally, the public and researchers alike have focused on automation which seeks to build into a machine all necessary capabilities for achieving a particular task, including sensors, actuators, servos, and algorithms. In contrast to automatic control, supervisory control puts a human back “in the loop,” usually at the highest levels of abstraction, while maintaining lower-level functions within the machine. In a supervisory control system human and machine work together. The operator may intervene and operate manually in a particular situation, or she (Sheridan refers to the generic operator as female) might turn over control to an automatic controller for a time, acting as monitor of the task at hand. Typically the “system” (including the human) will operate somewhere on the spectrum between manual and automatic, dividing the task in different degrees depending on the situation. When the operator and the machine are not collocated but are connected by some communication channel, the system is said to be telerobotic. Determining the proper balance of man and machine, manual and automatic control, or providing tools to do so, is the goal of Sheridan’s book. An important modern example of a supervisory control system (although not a telerobotic one) is a modem aircraft. The pilot can command the flight surfaces directly and fly manually, or she can program an autopilot to fly a complete route, including nearly complete takeoff and landing. Typically, the pilot performs some
The benefits of hybridization

This article presents the impact of the performance of an FC and control strategies on the benefits of hybridization of fuel cell/supercapacitor hybrid sources for vehicle applications. Then, the storage device can complement the main source to produce the compatibility and performance characteristics needed in a load. The studies of two hybrid power systems for vehicle applications, FC/battery and FC/supercapacitor hybrid power sources, are explained. Experimental results with small-scale devices (a PEMFC of 500 W, 40 A, and 13 V; a lead-xicid battery module of 33 Ah and 48 V; and a supercapacitor module of 292 F, 500 A, and 30 V) in laboratory will illustrate the performance of the system during motor-drive cycles.
Epitrochlear Lymph Node Dissection

Epitrochlear node involvement occurs in a small minority of patients with forearm or hand melanoma. Although in-transit sentinel lymph nodes are identified infrequently, they contain metastatic disease at nearly the same frequency as sentinel lymph nodes in cervical, axillary, and inguinal nodal basins. Positive in-transit sentinel lymph nodes are likely to be the only site of nodal metastasis. Therefore, detailed preoperative lymphoscintigraphy and meticulous intraoperative search for in-transit nodes should be performed. The recovery of nodes from in-transit nodal areas is low; however, there appears to be an increase in the performance of these dissections since the advent of lymphatic mapping and sentinel lymph node biopsy. This streaming video demonstrates the incidence of epitrochlear lymph node involvement and technical considerations associated with epitrochlear lymph node dissection.
CareLog: a selective archiving tool for behavior management in schools

Identifying the function of problem behavior can lead to the development of more effective interventions. One way to identify the function is through functional behavior assessment (FBA). Teachers conduct FBA in schools. However, the task load of recording the data manually is high, and the challenge of accurately identifying antecedents and consequences is significant while interacting with students. These issues often result in imperfect information capture. CareLog allows teachers more easily to conduct FBAs and enhances the capture of relevant information. In this paper, we describe the design process that led to five design principles that governed the development of CareLog. We present results from a five-month, quasi-controlled study aimed at validating those design principles. We reflect on how various constraints imposed by special education settings impact the design and evaluation process for HCI practitioners and researchers.
CYCLOSA: Decentralizing Private Web Search through SGX-Based Browser Extensions

By regularly querying Web search engines, users (unconsciously) disclose large amounts of their personal data as part of their search queries, among which some might reveal sensitive information (e.g. health issues, sexual, political or religious preferences). Several solutions exist to allow users querying search engines while improving privacy protection. However, these solutions suffer from a number of limitations: some are subject to user re-identification attacks, while others lack scalability or are unable to provide accurate results. This paper presents CYCLOSA, a secure, scalable and accurate private Web search solution. CYCLOSA improves security by relying on trusted execution environments (TEEs) as provided by Intel SGX. Further, CYCLOSA proposes a novel adaptive privacy protection solution that reduces the risk of user re-identification. CYCLOSA sends fake queries to the search engine and dynamically adapts their count according to the sensitivity of the user query. In addition, CYCLOSA meets scalability as it is fully decentralized, spreading the load for distributing fake queries among other nodes. Finally, CYCLOSA achieves accuracy of Web search as it handles the real query and the fake queries separately, in contrast to other existing solutions that mix fake and real query results.
Classifying distinct basal cell carcinoma subtype by means of dermatoscopy and reflectance confocal microscopy.

The current guidelines for the management of basal cell carcinoma (BCC) suggest a different therapeutic approach according to histopathologic subtype. Although dermatoscopic and confocal criteria of BCC have been investigated, no specific studies were performed to evaluate the distinct reflectance confocal microscopy (RCM) aspects of BCC subtypes.



To define the specific dermatoscopic and confocal criteria for delineating different BCC subtypes.



Dermatoscopic and confocal images of histopathologically confirmed BCCs were retrospectively evaluated for the presence of predefined criteria. Frequencies of dermatoscopic and confocal parameters are provided. Univariate and adjusted odds ratios were calculated. Discriminant analyses were performed to define the independent confocal criteria for distinct BCC subtypes.



Eighty-eight BCCs were included. Dermatoscopically, superficial BCCs (n=44) were primarily typified by the presence of fine telangiectasia, multiple erosions, leaf-like structures, and revealed cords connected to the epidermis and epidermal streaming upon RCM. Nodular BCCs (n=22) featured the classic dermatoscopic features and well outlined large basaloid islands upon RCM. Infiltrative BCCs (n=22) featured structureless, shiny red areas, fine telangiectasia, and arborizing vessels on dermatoscopy and dark silhouettes upon RCM.



The retrospective design.



Dermatoscopy and confocal microscopy can reliably classify different BCC subtypes.
The Tree-to-Tree Correction Problem

The tree-to-tree correctmn problem Is to determine, for two labeled ordered trees T and T', the distance from T to T' as measured by the mlmmum cost sequence of edit operaUons needed to transform T into T' The edit operations investigated allow changing one node of a tree into another node, deleting one node from a tree, or inserting a node into a tree An algorithm Is presented which solves this problem m time O(V* V'*LZ* L'2), where V and V' are the numbers of nodes respectively of T and T', and L and L' are the maximum depths respectively of T and T' Possible apphcatmns are to the problems of measuring the similarity between trees, automatic error recovery and correction for programming languages, and determining the largest common substructure of two trees
Effective erasure codes for reliable computer communication protocols

Reliable communication protocols require that all the intended recipients of a message receive the message intact. Automatic Repeat reQuest (ARQ) techniques are used in unicast protocols, but they do not scale well to multicast protocols with large groups of receivers, since segment losses tend to become uncorrelated thus greatly reducing the effectiveness of retransmissions. In such cases, Forward Error Correction (FEC) techniques can be used, consisting in the transmission of redundant packets (based on error correcting codes) to allow the receivers to recover from independent packet losses.Despite the widespread use of error correcting codes in many fields of information processing, and a general consensus on the usefulness of FEC techniques within some of the Internet protocols, very few actual implementations exist of the latter. This probably derives from the different types of applications, and from concerns related to the complexity of implementing such codes in software. To fill this gap, in this paper we provide a very basic description of erasure codes, describe an implementation of a simple but very flexible erasure code to be used in network protocols, and discuss its performance and possible applications. Our code is based on Vandermonde matrices computed over GF(pr), can be implemented very efficiently on common microprocessors, and is suited to a number of different applications, which are briefly discussed in the paper. An implementation of the erasure code shown in this paper is available from the author, and is able to encode/decode data at speeds up to several MB/s running on a Pentium 133.
Application of antenna arrays to mobile communications. II. Beam-forming and direction-of-arrival considerations

Array processing involves manipulation of signals induced on various antenna elements. Its capabilities of steering nulls to reduce cochannel interferences and pointing independent beams toward various mobiles, as well as its ability to provide estimates of directions of radiating sources, make it attractive to a mobile communications system designer. Array processing is expected to play an important role in fulfilling the increased demands of various mobile communications services. Part I of this paper showed how an array could be utilized in different configurations to improve the performance of mobile communications systems, with references to various studies where feasibility of an array system for mobile communications is considered. This paper provides a comprehensive and detailed treatment of different beam-forming schemes, adaptive algorithms to adjust the required weighting on antennas, direction-of-arrival estimation methods—including their performance comparison—and effects of errors on the performance of an array system, as well as schemes to alleviate them. This paper brings together almost all aspects of array signal processing. It is presented at a level appropriate to nonexperts in the field and contains a large reference list to probe further.
Generalisation and Sharing in Triplet Convnets for Sketch based Visual Search

We propose and evaluate several triplet CNN architectures for measuring the similarity between sketches and photographs, within the context of the sketch based image retrieval (SBIR) task. In contrast to recent fine-grained SBIR work, we study the ability of our networks to generalise across diverse object categories from limited training data, and explore in detail strategies for weight sharing, pre-processing, data augmentation and dimensionality reduction. We exceed the performance of pre-existing techniques on both the Flickr15k category level SBIR benchmark by 18%, and the TU-Berlin SBIR benchmark by ∼ 10Tb, when trained on the 250 category TU-Berlin classification dataset augmented with 25k corresponding photographs harvested from the Internet.
Automatic refinement of large-scale cross-domain knowledge graphs

Knowledge graphs are a way to represent complex structured and unstructured information integrated into an ontology, with which one can reason about the existing information to deduce new information or highlight inconsistencies. Knowledge graphs are divided into the terminology box (TBox), also known as ontology, and the assertions box (ABox). The former consists of a set of schema axioms defining classes and properties which describe the data domain. Whereas the ABox consists of a set of facts describing instances in terms of the TBox vocabulary. In the recent years, there have been several initiatives for creating large-scale cross-domain knowledge graphs, both free and commercial, with DBpedia, YAGO, and Wikidata being amongst the most successful free datasets. Those graphs are often constructed with the extraction of information from semi-structured knowledge, such as Wikipedia, or unstructured text from the web using NLP methods. It is unlikely, in particular when heuristic methods are applied and unreliable sources are used, that the knowledge graph is fully correct or complete. There is a tradeoff between completeness and correctness, which is addressed differently in each knowledge graph’s construction approach. There is a wide variety of applications for knowledge graphs, e.g. semantic search and discovery, question answering, recommender systems, expert systems and personal assistants. The quality of a knowledge graph is crucial for its applications. In order to further increase the quality of such large-scale knowledge graphs, various automatic refinement methods have been proposed. Those methods try to infer and add missing knowledge to the graph, or detect erroneous pieces of information. In this thesis, we investigate the problem of automatic knowledge graph refinement and propose methods that address the problem from two directions, automatic refinement of the TBox and of the ABox. In Part I we address the ABox refinement problem. We propose a method for predicting missing type assertions using hierarchical multilabel classifiers and ingoing/outgoing links as features. We also present an approach to detection of relation assertion errors which exploits type and path patterns in the graph. Moreover, we propose an approach to correction of relation errors originating from confusions between entities. Also in the ABox refinement direction, we propose a knowledge graph model and process for synthesizing knowledge graphs for benchmarking ABox completion methods. In Part II we address the TBox refinement problem. We propose methods for
Automatic Gloss Finding for a Knowledge Base using Ontological Constraints

While there has been much research on automatically constructing structured Knowledge Bases (KBs), most of it has focused on generating facts to populate a KB. However, a useful KB must go beyond facts. For example, glosses (short natural language definitions) have been found to be very useful in tasks such as Word Sense Disambiguation. However, the important problem of Automatic Gloss Finding, i.e., assigning glosses to entities in an initially gloss-free KB, is relatively unexplored. We address that gap in this paper. In particular, we propose GLOFIN, a hierarchical semi-supervised learning algorithm for this problem which makes effective use of limited amounts of supervision and available ontological constraints. To the best of our knowledge, GLOFIN is the first system for this task. Through extensive experiments on real-world datasets, we demonstrate GLOFIN's effectiveness. It is encouraging to see that GLOFIN outperforms other state-of-the-art SSL algorithms, especially in low supervision settings. We also demonstrate GLOFIN's robustness to noise through experiments on a wide variety of KBs, ranging from user contributed (e.g., Freebase) to automatically constructed (e.g., NELL). To facilitate further research in this area, we have made the datasets and code used in this paper publicly available.
Impact Of Online Advertising On Consumer Attitudes And Interests Buy Online ( Survey On Students Of Internet Users In Makassar )

The rapid development of technology today makes Internet users continues to increase. This is supported by the ease of internet users access the internet either through a PC, laptop, mobile phones, tablets and other media. The increase in Internet users this makes the internet into a proper promotion using online advertising. With a wide reach and touch the various layers of the Internet media communities may be appropriate advice for company promotion. However, an increasing number of Internet users, especially in the city of Makassar is not accompanied by an increase in the number of online purchases. Based on that it is necessary to examine how the effect of online advertising on consumer buying behavior and online, as well as how to control the behavior and subjective norms influence the attitudes and interests of consumers buy online. This study aims to analyze and test the effect of online advertising on consumer attitudes and purchase interest online, a survey conducted on students of Internet users in the city of Makassar. The study was conducted on students of public and private universities in the city of Makassar. The method used was a quantitative analysis using the technique of purposive sampling method with a sample of 340 people. Testing this hypothesis using structural equation modeling (SEM). The results showed that online advertising has an influence on consumer buying behavior and online. Dimensions interactivity of online advertising provides the highest influence on the attitudes and interests of consumers purchasing online.
HumorTools : A Microtask Workflow for Writing News Satire

Humor is a highly-valued human skill — a sign of intelligence and creativity. Humor creation is a long-standing problem in Artificial Intelligence, because it does not easily decompose and it cannot readily be defined or detected; indeed, many humans cannot readily create jokes. However, in our survey of advice from professional comedians, we found evidence that the humor-generation process can be described. Based on this survey, we performed an analysis of news satire from The Onion and decomposed the process of humor creation into seven microtasks. We then developed a workflow, inspired by the design literature, that invokes these microtasks in a novel, dynamic manner. To evaluate our microtasks and workflow, we recruited 20 people, finding that the 85% of them found the workflow made their process more methodical and the microtasks enabled them to make a wider variety of jokes.
Extension of Soft-Switching Region of Dual-Active-Bridge Converter by a Tunable Resonant Tank

Hard-switching-induced switching loss can contribute significantly to the power loss of an isolated bidirectional dual-active-bridge (DAB) dc–dc converter operating at high frequency. An <inline-formula> <tex-math notation="LaTeX">$LC$</tex-math></inline-formula>-type series resonant DAB converter based on a switch-controlled-inductor (SCI) is proposed to mitigate the loss arising from hard switching under wide-range variations in output voltage and current. Zero-voltage switching is achieved at the primary side (high voltage), while at the secondary side (low voltage), zero-current switching is preferred to reduce excessive ringing due to circulating current and switching loss. In order to achieve reduced conduction loss, a nominal operating point is chosen where the root-mean-square resonant tank current is the minimum. To validate the proposed topology and modulation scheme, an <inline-formula><tex-math notation="LaTeX">$LC$</tex-math></inline-formula>-type series resonant DAB converter based on SCI operating at 100 kHz is designed to interface a 400-V dc bus to a supercapacitor-based energy storage. Simulation and experimental results validate the effectiveness of the proposed topology for charging/discharging a supercapacitor with an output voltage variation of between 10 and 48 V and a maximum rated power of 480 W. A maximum efficiency of 94.6% is achieved using the proposed topology and modulation scheme.