nils-herrmann/clean_scirepeval huggingface dataset:
Game theory meets network security and privacy

This survey provides a structured and comprehensive overview of research on security and privacy in computer and communication networks that use game-theoretic approaches. We present a selected set of works to highlight the application of game theory in addressing different forms of security and privacy problems in computer networks and mobile applications. We organize the presented works in six main categories: security of the physical and MAC layers, security of self-organizing networks, intrusion detection systems, anonymity and privacy, economics of network security, and cryptography. In each category, we identify security problems, players, and game models. We summarize the main results of selected works, such as equilibrium analysis and security mechanism designs. In addition, we provide a discussion on the advantages, drawbacks, and future direction of using game theory in this field. In this survey, our goal is to instill in the reader an enhanced understanding of different research approaches in applying game-theoretic methods to network security. This survey can also help researchers from various fields develop game-theoretic solutions to current and emerging security problems in computer networking.
Nuclear feature extraction for breast tumor diagnosis

Interactive image processing techniques, along with a linear-programming-based inductive classiier, have been used to create a highly accurate system for diagnosis of breast tumors. A small fraction of a ne needle aspirate slide is selected and digitized. With an interactive interface, the user initializes active contour models, known as snakes, near the boundaries of a set of cell nuclei. The customized snakes are deformed to the exact shape of the nuclei. This allows for precise, automated analysis of nuclear size, shape and texture. Ten such features are computed for each nucleus, and the mean value, largest (or \worst") value and standard error of each feature are found over the range of isolated cells. After 569 images were analyzed in this fashion, diierent combinations of features were tested to nd those which best separate benign from malignant samples. Tenfold cross-validation accuracy of 97% was achieved using a single separating plane on three of the thirty features: mean texture, worst area and worst smoothness. This represents an improvement over the best diagnostic results in the medical literature. The system is currently in use at the University of Wisconsin Hospitals. The same feature set has also been utilized in the much more diicult task of predicting distant recurrence of malignancy in patients, resulting in an accuracy of 86%.
Two-dimensional full-hemisphere frequency scanning array based on metamaterial leaky wave antennas and feed networks

This paper presents a novel two-dimensional (2-D) frequency scanning antenna array that can exhibit a full-hemisphere coverage of radiation beams. The proposed 2-D frequency scanning antenna array utilizes transmission-line based microwave metamaterials (MTMs) to realize both leaky wave antennas and antenna array feed networks. By engineering the dispersion of both metamaterial leaky wave antennas and metamaterial feed networks, the proposed passive 2-D MTM antenna array is able to perform one-to-one frequency-space mapping and beamforming over the entire full-hemisphere without using any phase shifters or mixers.
Improved generator objectives for GANs

We present a framework to understand GAN training as alternating density ratio estimation, and approximate divergence minimization. This provides an interpretation for the mismatched GAN generator and discriminator objectives often used in practice, and explains the problem of poor sample diversity. Further, we derive a family of generator objectives that target arbitrary f -divergences without minimizing a lower bound, and use them to train generative image models that target either improved sample quality or greater sample diversity.
Web Service Clustering using a Hybrid Term-Similarity Measure with Ontology Learning

Clustering Web services into functionally similar clusters is a very efficient approach to service discovery. A principal issue for clustering is computing the semantic similarity between services. Current approaches use similarity-distance measurement methods such as keyword, information-retrieval or ontology based methods. These approaches have problems that include discovering semantic characteristics, loss of semantic information and a shortage of high-quality ontologies. In this paper, the authors present a method that first adopts ontology learning to generate ontologies via the hidden semantic patterns existing within complex terms. If calculating similarity using the generated ontology fails, it then applies an information-retrieval-based method. Another important issue is identifying the most suitable cluster representative. This paper proposes an approach to identifying the cluster center by combining service similarity with term frequency–inverse document frequency values of service names. Experimental results show that our term-similarity approach outperforms comparable existing approaches. They also demonstrate the positive effects of our cluster-center identification approach. Web Service Clustering using a Hybrid Term-Similarity Measure with Ontology Learning
Km4City Ontology Building vs Data Harvesting and Cleaning for Smart-city Services

Presently, a very large number of public and private data sets are available from local governments. In most cases, they are not semantically interoperable and a huge human effort would be needed to create integrated ontologies and knowledge base for smart city. Smart City ontology is not yet standardized, and a lot of research work is needed to identify models that can easily support the data reconciliation, the management of the complexity, to allow the data reasoning. In this paper, a system for data ingestion and reconciliation of smart cities related aspects as road graph, services available on the roads, traffic sensors etc., is proposed. The system allows managing a big data volume of data coming from a variety of sources considering both static and dynamic data. These data are mapped to a smart-city ontology, called KM4City (Knowledge Model for City), and stored into an RDF-Store where they are available for applications via SPARQL queries to provide new services to the users via specific applications of public administration and enterprises. The paper presents the process adopted to produce the ontology and the big data architecture for the knowledge base feeding on the basis of open and private data, and the mechanisms adopted for the data verification, reconciliation and validation. Some examples about the possible usage of the coherent big data knowledge base produced are also offered and are accessible from the RDF-store and related services. The article also presented the work performed about reconciliation algorithms and their comparative assessment and selection. & 2014 The Authors.
A longitudinal investigation of continued online shopping behavior: An extension of the theory of planned behavior

The purpose of this study is to propose an extended model of Theory of Planned Behavior (TPB) by incorporating constructs drawn from the model of Expectation Disconfirmation Theory (EDT) and to examine the antecedents of users’ intention to continue using online shopping (continuance intention). Prior research has demonstrated that TPB constructs, including attitude, subjective norm, and perceived behavioral control, are important factors in determining the acceptance and use of various information technologies. These factors, however, are insufficient to explain a user’s continuance intention in the online shopping context. In this study we extended TPB with two EDT constructs—disconfirmation and satisfaction—for studying users’ continuance intention in the online shopping context. By employing longitudinal method with two-stage survey, we empirically validated the proposed model and research hypotheses.
Outer-loop vectorization - revisited for short SIMD architectures

Vectorization has been an important method of using data-level parallelism to accelerate scientific workloads on vector machines such as Cray for the past three decades. In the last decade it has also proven useful for accelerating multi-media and embedded applications on short SIMD architectures such as MMX, SSE and AltiVec. Most of the focus has been directed at innermost loops, effectively executing their iterations concurrently as much as possible. Outer loop vectorization refers to vectorizing a level of a loop nest other than the innermost, which can be beneficial if the outer loop exhibits greater data-level parallelism and locality than the innermost loop. Outer loop vectorization has traditionally been performed by interchanging an outer-loop with the innermost loop, followed by vectorizing it at the innermost position. A more direct unroll-and-jam approach can be used to vectorize an outer-loop without involving loop interchange, which can be especially suitable for short SIMD architectures.
 In this paper we revisit the method of outer loop vectorization, paying special attention to properties of modern short SIMD architectures. We show that even though current optimizing compilers for such targets do not apply outer-loop vectorization in general, it can provide significant performance improvements over innermost loop vectorization. Our implementation of direct outer-loop vectorization, available in GCC 4.3, achieves speedup factors of 3.13 and 2.77 on average across a set of benchmarks, compared to 1.53 and 1.39 achieved by innermost loop vectorization, when running on a Cell BE SPU and PowerPC970 processors respectively. Moreover, outer-loop vectorization provides new reuse opportunities that can be vital for such short SIMD architectures, including efficient handling of alignment. We present an optimization tapping such opportunities, capable of further boosting the performance obtained by outer-loop vectorization to achieve average speedup factors of 5.26 and 3.64.
Declarative Terrain Modeling for Military Training Games

Military training instructors increasingly often employ computer games to train soldiers in all sorts of skills and tactics. One of the difficulties instructors face when using games as a training tool is the creation of suitable content, including scenarios, entities, and corresponding terrain models. Terrain plays a key role in many military training games, as for example, in our case game Tactical Air Defense. However, current manual terrain editors are both too complex and too time-consuming to be useful for instructors; automatic terrain generation methods show a lot of potential, but still lack user control and intuitive editing capabilities. We present a novel way for instructors to model terrain for their training games: instead of constructing a terrain model using complex modeling tools, instructors can declare the required properties of their terrain using an advanced sketching interface. Our framework integrates terrain generation methods and manages dependencies between terrain features in order to automatically create a complete 3D terrain model that matches the sketch. With our framework, instructors can easily design a large variety of terrain models that meet their training requirements.
HDP code: A Horizontal-Diagonal Parity Code to Optimize I/O load balancing in RAID-6

With higher reliability requirements in clusters and data centers, RAID-6 has gained popularity due to its capability to tolerate concurrent failures of any two disks, which has been shown to be of increasing importance in large scale storage systems. Among various implementations of erasure codes in RAID-6, a typical set of codes known as Maximum Distance Separable (MDS) codes aim to offer data protection against disk failures with optimal storage efficiency. However, because of the limitation of horizontal parity or diagonal/anti-diagonal parities used in MDS codes, storage systems based on RAID-6 suffers from unbalanced I/O and thus low performance and reliability. To address this issue, in this paper, we propose a new parity called Horizontal-Diagonal Parity (HDP), which takes advantages of both horizontal and diagonal/anti-diagonal parities. The corresponding MDS code, called HDP code, distributes parity elements uniformly in each disk to balance the I/O workloads. HDP also achieves high reliability via speeding up the recovery under single or double disk failure. Our analysis shows that HDP provides better balanced I/O and higher reliability compared to other popular MDS codes.
A Dual Circularly Polarized Horn Antenna in Ku-Band Based on Chiral Metamaterial

A dual circularly polarized horn antenna, which employs a chiral metamaterial composed of two-layered periodic metallic arc structure, is presented. The whole antenna composite has functions of polarization transformation and band-pass filter. The designed antenna produces left-handed circularly polarized wave in the band from 12.4 GHz to 12.5 GHz, and realizes right-handed circularly polarized wave in the range of 14.2 GHz-14.4 GHz. Due to low loss characteristic of the chiral metamaterial, the measured gains are only reduced by about 0.6 dB at the above two operation frequencies, compared with single horn antenna. The axial ratios are 1.05 dB at 12.45 GHz and 0.95 dB at14.35 GHz.
Overlapping community detection via bounded nonnegative matrix tri-factorization

Complex networks are ubiquitous in our daily life, with the World Wide Web, social networks, and academic citation networks being some of the common examples. It is well understood that modeling and understanding the network structure is of crucial importance to revealing the network functions. One important problem, known as community detection, is to detect and extract the community structure of networks. More recently, the focus in this research topic has been switched to the detection of overlapping communities. In this paper, based on the matrix factorization approach, we propose a method called bounded nonnegative matrix tri-factorization (BNMTF). Using three factors in the factorization, we can explicitly model and learn the community membership of each node as well as the interaction among communities. Based on a unified formulation for both directed and undirected networks, the optimization problem underlying BNMTF can use either the squared loss or the generalized KL-divergence as its loss function. In addition, to address the sparsity problem as a result of missing edges, we also propose another setting in which the loss function is defined only on the observed edges. We report some experiments on real-world datasets to demonstrate the superiority of BNMTF over other related matrix factorization methods.
VirtuOS: an operating system with kernel virtualization

Most operating systems provide protection and isolation to user processes, but not to critical system components such as device drivers or other system code. Consequently, failures in these components often lead to system failures. VirtuOS is an operating system that exploits a new method of decomposition to protect against such failures. VirtuOS exploits virtualization to isolate and protect vertical slices of existing OS kernels in separate service domains. Each service domain represents a partition of an existing kernel, which implements a subset of that kernel's functionality. Unlike competing solutions that merely isolate device drivers, or cannot protect from malicious and vulnerable code, VirtuOS provides full protection of isolated system components. VirtuOS's user library dispatches system calls directly to service domains using an exceptionless system call model, avoiding the cost of a system call trap in many cases.
 We have implemented a prototype based on the Linux kernel and Xen hypervisor. We demonstrate the viability of our approach by creating and evaluating a network and a storage service domain. Our prototype can survive the failure of individual service domains while outperforming alternative approaches such as isolated driver domains and even exceeding the performance of native Linux for some multithreaded workloads. Thus, VirtuOS may provide a suitable basis for kernel decomposition while retaining compatibility with existing applications and good performance.
PointerPhone: Using Mobile Phones for Direct Pointing Interactions with Remote Displays

Large screens or projections in public and private settings have become part of our daily lives, as they enable the collaboration and presentation of information in many diverse ways. When discussing the shown information with other persons, we often point to a displayed object with our index finger or a laser pointer in order to talk about it. Although mobile phone-based interactions with remote screens have been investigated intensively in the last decade, none of them considered such direct pointing interactions for application in everyday tasks. In this paper, we present the concept and design space of PointerPhone which enables users to directly point at objects on a remote screen with their mobile phone and interact with them in a natural and seamless way. We detail the design space and distinguish three categories of interactions including low-level interactions using the mobile phone as a precise and fast pointing device, as well as an input and output device. We detail the category of widgetlevel interactions. Further, we demonstrate versatile high-level interaction techniques and show their application in a collaborative presentation scenario. Based on the results of a qualitative study, we provide design implications for application designs.
Millimeter Wave Channel Measurements and Implications for PHY Layer Design

There has been an increasing interest in the millimeter wave (mmW) frequency regime in the design of the next-generation wireless systems. The focus of this paper is on understanding mmW channel properties that have an important bearing on the feasibility of mmW systems in practice and have a significant impact on physical layer design. In this direction, simultaneous channel sounding measurements at 2.9, 29, and 61 GHz are performed at a number of transmit–receive location pairs in indoor office, shopping mall, and outdoor environments. Based on these measurements, this paper first studies large-scale properties, such as path loss and delay spread across different carrier frequencies in these scenarios. Toward the goal of understanding the feasibility of outdoor-to-indoor coverage, material measurements corresponding to mmW reflection and penetration are studied and significant notches in signal reception spread over a few gigahertz are reported. Finally, implications of these measurements on system design are discussed, and multiple solutions are proposed to overcome these impairments.
Convex and Scalable Weakly Labeled SVMs

In this paper, we study the problem of learning from weakly labeled data, where labels of the training examples are incomplete. This includes, for example, (i) semi-supervised learning where labels are partially known; (ii) multi-instance learning where labels are implicitly known; and (iii) clustering where labels are completely unknown. Unlike supervised learning, learning with weak labels involves a difficult Mixed-Integer Programming (MIP) problem. Therefore, it can suffer from poor scalability and may also get stuck in local minimum. In this paper, we focus on SVMs and propose the WellSVM via a novel label generation strategy. This leads to a convex relaxation of the original MIP, which is at least as tight as existing convex Semi-Definite Programming (SDP) relaxations. Moreover, the WellSVM can be solved via a sequence of SVM subproblems that are much more scalable than previous convex SDP relaxations. Experiments on three weakly labeled learning tasks, namely, (i) semi-supervised learning; (ii) multi-instance learning for locating regions of interest in content-based information retrieval; and (iii) clustering, clearly demonstrate improved performance, and WellSVM is also readily applicable on large data sets.
Topology matching for fully automatic similarity estimation of 3D shapes

There is a growing need to be able to accurately and efficiently search visual data sets, and in particular, 3D shape data sets. This paper proposes a novel technique, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs (MRGs). The MRG thus operates well as a search key for 3D shape data sets. In particular, the MRG represents the skeletal and topological structure of a 3D shape at various levels of resolution. The MRG is constructed using a continuous function on the 3D shape, which may preferably be a function of geodesic distance because this function is invariant to translation and rotation and is also robust against changes in connectivities caused by a mesh simplification or subdivision. The similarity calculation between 3D shapes is processed using a coarse-to-fine strategy while preserving the consistency of the graph structures, which results in establishing a correspondence between the parts of objects. The similarity calculation is fast and efficient because it is not necessary to determine the particular pose of a 3D shape, such as a rotation, in advance. Topology Matching is particularly useful for interactively searching for a 3D object because the results of the search fit human intuition well.
Symbolic clustering using a new dissimilarity measure

-A new dissimilarity measure, based on "position", "span" and "content" of symbolic objects is proposed for symbolic clustering. The dissimilarity measure is new in the sense that it is not just another aspect of a similarity measure. In the proposed hierarchical agglomerative clustering methodology, composite symbolic objects are formed using a Cartesian join operator whenever a mutual pair of symbolic objects is selected for agglomeration based on minimum dissimilarity. The minimum dissimilarity values of different merging levels are used to compute the cluster indicator values and hence to determine the number of clusters in the data. The results of the application of the algorithm on numeric data of known number of classes are described first so as to show the efficacy of the method. Subsequently, the results of the experiments on two data sets of Assertion type of symbolic objects drawn from the domains of fat-oil and microcomputers are presented. Symbolic clustering Conceptual clustering Symbolic dissimilarity Composite symbolic objects Number of clusters
A survey of intrusion detection in Internet of Things

Internet of Things (IoT) is a new paradigm that integrates the Internet and physical objects belonging to different domains such as home automation, industrial process, human health and environmental monitoring. It deepens the presence of Internetconnected devices in our daily activities, bringing, in addition to many benefits, challenges related to security issues. For more than two decades, Intrusion Detection Systems (IDS) have been an important tool for the protection of networks and information systems. However, applying traditional IDS techniques to IoT is difficult due to its particular characteristics such as constrained-resource devices, specific protocol stacks, and standards. In this paper, we present a survey of IDS research efforts for IoT. Our objective is to identify leading trends, open issues, and future research possibilities. We classified the IDSs proposed in the literature according to the following attributes: detection method, IDS placement strategy, security threat and validation strategy. We also discussed the different possibilities for each attribute, detailing aspects of works that either propose specific IDS schemes for IoT or develop attack detection strategies for IoT threats that might be embedded in IDSs.