nils-herrmann/clean_scirepeval huggingface dataset:
A trust-risk perspective on social commerce use: an examination of the biasing role of habit

Social commerce websites have emerged as new platforms which integrate social media features with traditional commerce aspects to enhance users’ purchasing experience. The purpose of this paper is to examine the role of social factors such as trust toward site members in determining users’ trust and risk evaluations, and the role of social commerce use habit in attenuating users’ rational risk and trust considerations for developing purchase intentions.  Relying on the risk deterrence perspective and rational decision-making models involving trust and habit, this study proposes a set of hypotheses which are tested through analyzing survey data using structural equation modeling techniques.  Results show that commerce risk deters purchasing intentions; trust toward the social commerce website increases users’ purchasing intentions; and trust toward the site members indirectly increases purchasing intentions. Moreover, trust toward site members reduces perceived commerce risk. Findings also show that habit modulates trust and risk effects on use decisions in this context; habit moderates (weakens) the relationships between commerce risk and purchase intentions and between trust toward the social commerce site and purchase intentions.  This study extends theories on decision making in social settings such as in the case of social commerce. It does so by accounting for unique modulating effects of habit in social settings in which social aspects such as trust in other members and risk are unique and important.
Deep neural network dynamic traffic routing system for vehicles

Traffic grids have always suffered from a lack of dynamic routing and path planning algorithms and relied only on static characteristics of the roads like the number of lanes, distance and speed limits to avoid and resolve traffic congestion, by routing traffic to a lighter traffic path. However, with the increased number of vehicles in urban areas these algorithms may have reached their limitation due to the huge increase in the state space in a limited computing power and memory environment. In this research we will introduce a dynamic routing system for traffic in intersections based on real-time traffic conditions such as individual vehicle speed, destination and traffic light status to provide the fasted path between a source and a target point. This system will exploit the recent advancements in the field of machine learning by leveraging the power of deep learning especially deep convolutional neural networks. Simulation shows that the proposed model results in a path that are generally fast and avoids frequent red light stops.
Understanding semantic change of words over centuries

In this paper, we propose to model and analyze changes that occur to an entity in terms of changes in the words that co-occur with the entity over time. We propose to do an in-depth analysis of how this co-occurrence changes over time, how the change influences the state (semantic, role) of the entity, and how the change may correspond to events occurring in the same period of time. We propose to identify clusters of topics surrounding the entity over time using Topics-Over-Time (TOT) and k-means clustering. We conduct this analysis on Google Books Ngram dataset. We show how clustering words that co-occur with an entity of interest in 5-grams can shed some lights to the nature of change that occurs to the entity and identify the period for which the change occurs. We find that the period identified by our model precisely coincides with events in the same period that correspond to the change that occurs.
Sensing as a Service: Secure Wireless Sensor Network Infrastructure Sharing for the Internet of Things

Internet of Things (IoT) and Wireless Sensor Networks (WSN) are composed of devices capable of sensing/actuation, communication and processing. They are valuable technology for the development of applications in several areas, such as environmental, industrial and urban monitoring and processes controlling. Given the challenges of different protocols and technologies used for communication, resource constrained devices nature, high connectivity and security requirements for the applications, the main challenges that need to be addressed include: secure communication between IoT devices, network resource management and the protected implementation of the security mechanisms. In this paper, we present a secure Software-Defined Networking (SDN) based framework that includes: communication protocols, node task programming middleware, communication and computation resource management features and security services. The communication layer for the constrained devices considers IT-SDN as its basis. Concerning security, we address the main services, the type of algorithms to achieve them, and why their secure implementation is needed. Lastly, we showcase how the Sensing as a Service paradigm could enable WSN usage in more environments. TYPE OF PAPER AND
Candidate Multilinear Maps from Ideal Lattices

We describe plausible lattice-based constructions with properties that approximate the soughtafter multilinear maps in hard-discrete-logarithm groups, and show an example application of such multi-linear maps that can be realized using our approximation. The security of our constructions relies on seemingly hard problems in ideal lattices, which can be viewed as extensions of the assumed hardness of the NTRU function. This work was supported by the Intelligence Advanced Research Projects Activity (IARPA) via Department of Interior National Business Center (DoI/NBC) contract number D11PC20202. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon.  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of IARPA, DoI/NBC, or the U.S. Government. ∗Research conducted while at the IBM Research, T.J. Watson funded by NSF Grant No.1017660.
TreeNetViz: Revealing Patterns of Networks over Tree Structures

Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns.
An Interactive Web Mapping Visualization of Urban Air Quality Monitoring Data of China

In recent years, main cities in China have been suffering from hazy weather, which is gaining great attention among the public, government managers and researchers in different areas. Many studies have been conducted on the topic of urban air quality to reveal different aspects of the air quality problem in China. This paper focuses on the visualization problem of the big air quality monitoring data of all main cities on a nationwide scale. To achieve the intuitive visualization of this dataset, this study develops two novel visualization tools for multi-granularity time series visualization (timezoom.js) and a dynamic symbol declutter map mashup layer for thematic mapping (symadpative.js). With the two invented tools, we develops an interactive web map visualization application of urban air quality data of all main cities in China. This application shows us significant air pollution findings at the nationwide scale. These results give us clues for further studies on air pollutant characteristics, forecasting and control in China. As the tools are invented for general visualization purposes of geo-referenced time series data, they can be applied to other environmental monitoring data (temperature, precipitation, etc.) through some configurations.
Skin Segmentation Using YCBCR and RGB Color Models

Face detection is one of the challenging problems in image processing. This report proposes a novel technique for detecting faces in color images using skin color model algorithm combined with skin likely-hood, skin Segmentation, Morphological operation and Template matching. Color images with skin color in the chromatic and pure color space YCrCb, which separates luminance and chrominance components. A Gaussian probability density is estimated from skin samples, collected from different ethnic groups, via the maximum-likelihood criterion. Adaptive thresholding for segmentation to localize the faces within the detected skin regions. Further, mathematical morphological operators are used to remove noisy regions and fill holes in the skin-color region, so that candidate human face regions can be extracted. These systems can achieve high detection accuracy, high detection speed and reduce the false detecting rate. The two methodology used for the Skin Segmentation is YCbCr and RGB Model. In YCbCr model both the skin colour and texture of the image can be used to identify the particular object in the image,where as in RGB model only the skin color has to be used for identification of the person.Hence the YCbCr model is better than the RGB model . From our analysis we conclude that the new approach in modeling skin color can achieve good detection success rate. The algorithm gives computationally a very efficient as well as an accurate approach for skin detection. The performance of different color space may be dependent on the method used to model the color for skin pixel. Gaussian probability, YCrCb,RGB Model
Antenna in package design for WLAN using MCM-D manufacturing technology

This paper introduces an antenna design based on MCM-D manufacturing technology to realize an antenna-integrated package for IEEE 802.11b/g application. Co-design guidelines are employed to include the parasitic effects caused by the integration of the antenna and the RF module. The loop antenna is located on the second layer of the MCM-D substrate. The antenna incorporates the capacitively feed strip which is fed by the coplanar waveguide (CPW). By the coupling feed technique, the size of the proposed antenna is only 3.8 mm × 4.7 mm over the WLAN band (2.4–2.484 GHz). Furthermore, the resonant frequency can be adjusted by tuning the length of the coupling strip. The results show that the coupling-fed loop antenna achieved a gain of 1.6 dBi and radiation efficiency of 85 % at 2.45 GHz in a very compact size (0.03 λ0 × 0.04 λ0). In addition, the occupied area of the antenna is very small (4.4%) compared to the overall area of the package; therefore, the proposed method is very useful for package antenna design. The detailed parameters studies are presented, which demonstrate the feasibility of the proposed method.
Who are the crowdworkers?: shifting demographics in mechanical turk

Amazon Mechanical Turk (MTurk) is a crowdsourcing system in which tasks are distributed to a population of thousands of anonymous workers for completion. This system is increasingly popular with researchers and developers. Here we extend previous studies of the demographics and usage behaviors of MTurk workers. We describe how the worker population has changed over time, shifting from a primarily moderate-income, U.S.-based workforce towards an increasingly international group with a significant population of young, well-educated Indian workers. This change in population points to how workers may treat Turking as a full-time job, which they rely on to make ends meet.
Curriculum learning

Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more complex ones. Here, we formalize such training strategies in the context of machine learning, and call them "curriculum learning". In the context of recent research studying the difficulty of training in the presence of non-convex training criteria (for deep deterministic and stochastic neural networks), we explore curriculum learning in various set-ups. The experiments show that significant improvements in generalization can be achieved. We hypothesize that curriculum learning has both an effect on the speed of convergence of the training process to a minimum and, in the case of non-convex criteria, on the quality of the local minima obtained: curriculum learning can be seen as a particular form of continuation method (a general strategy for global optimization of non-convex functions).
Eliminative Materialism and the Propositional Attitudes

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
OFDM and MC-CDMA for Broadband Multi-user Communications

where he holds the chair in telecommunications. He has co-authored 10 books on mobile radio communications, published about 400 research papers, organised and chaired conference sessions, presented overview lectures and has been awarded a number of distinctions. Currently he heads an academic research team, working on a range of research projects in the field of wireless multimedia communications sponsored by industry, the Engineering and Physical Sciences Research Council (EPSRC) UK, the European IST Programme and the Mobile Virtual Centre of Excellence (VCE), UK. He is an enthusiastic supporter of industrial and academic liaison and he offers a range of industrial courses. He is also an IEEE Distinguished Lecturer. For further information on research in progress and associated publications please refer to http://www-where he was involved in developing the KoreaSat monitoring system, Digital DBS transmission system and W-CDMA based Wireless Local Loop (WLL) system. He was awarded the PhD degree in Mobile Communications at the University of Southampton, UK, where he was as a postdoctoral research assistant from Sep. 2001 to Aug. 2002. He is a recipient of the British Chevening Scholarship awarded by the British Council, UK. His current research interests are associated with mobile communication systems design with empasis on adaptive modulation aided OFDM, MC-CDMA and W-CDMA. Southampton, where he completed his PhD in mobile communications. His areas of interest include adaptive OFDM transmission, wideband channel estimation, CDMA and error correction coding. He recently joined Ubinetics, Cambridge, UK, where he is involved in the research vii viii and development of third-genertion wireless systems. Dr. Keller co-authored two monographs and about 30 various research papers.
Determining embedding dimension for phase-space reconstruction using a geometrical construction.

A, et al. Nonlinear analysis of electroencephalogram at rest and during cognitive tasks in patients with schizophrenia. One-dimensional electroencephalography (EEG) data were transformed into multidimensional phase space. The phase space concept is crucial for nonlinear dynamics analysis. In a hypothetical system governed by n variables, the phase space is n-dimensional. Each state of the system corresponds to a point in phase space, with n coordinates that are the values assumed by the governing variables for this specific state. If the system is observed for a period of time, the sequence of the point in phase space converges into a subspace, called system's attractor. The technique of delay coordinates is carried out to reconstruct the attractor's trajectory. To unfold the projection back to a multivariate state space, a representation of the original system, the delay coordinates y(t) = [xj(t), xj(t + T), … xj(t + [d-1] T)] from a single time series xj and the embedding procedure were performed. In this formula, y(t) is a point of the trajectory in the phase space at time t, x (t is iT) are the coordinates in the phase space corresponding to the time-delayed values of the time series, T is the time delay between the points of the time series considered, and d is the embedding dimension. 1,2 The choice of the optimal time delay T and embedding dimension d are important to the success of reconstruction with finite data. For the time delay, the first local minimum of the average mutual information between the set of measurements v(t) and v(t + T) was used in the present study. For the embedding dimension d the minimum (optimal) embedding was computed in the reconstruction procedure. 3 The attractor's reconstruction is necessary for the analysis of mathematical quantities characterizing the attractor itself. One important metric property of the attractor is the correlation dimension (D2), which estimates the degrees of freedom, such as the number of independent variables necessary to describe the dynamic of the original system. The larger the D2 values of the attractor, the more complicated the behavior of the nonlinear system. The D2 is thus a measure of the complexity of the process being investigated, and it characterizes the distribution of points in phase space. 4 The Gassberger–Procaccia algorithm 5 was computed to evaluate D2 values of the attractors from EEG data. With this algorithm, D2 is derived by determining the relative number …
Inferring Person-to-person Proximity Using WiFi Signals

Today's societies are enveloped in an ever-growing telecommunication infrastructure. This infrastructure offers important opportunities for sensing and recording a multitude of human behaviors. Human mobility patterns are a prominent example of such a behavior which has been studied based on cell phone towers, Bluetooth beacons, and WiFi networks as proxies for location. While mobility is an important aspect of human behavior, it is also crucial to study physical interactions among individuals. Sensing proximity that enables social interactions on a large scale is a technical challenge and many commonly used approaches—including RFID badges or Bluetooth scanning—offer only limited scalability. Here we show that it is possible, in a scalable and robust way, to accurately infer person-to-person physical proximity from the lists of WiFi access points measured by smartphones carried by the two individuals. Based on a longitudinal dataset of approximately 800 participants with ground-truth Bluetooth proximity collected over a year, we show that our model performs better than the current state-of-the-art. Our results demonstrate the value of WiFi signals as a tool for social sensing and show how collections of WiFi data pose a potential threat to privacy.
Impedance Control of Exoskeleton Suit Based on Adaptive RBF Neural Network

Exoskeleton suit is a typical human-machine system. Control the exoskeleton suit to track the pilot’s moving trajectory as well as to minimize the human-machine interaction force. The suit will help decrease the pilot’s power consumption and assist the pilot to carry heavy load. Impedance control was introduced to the control of exoskeleton suit. As the control laws that based on the dynamic model without model uncertainty compensation will increase the human-machine force, a RBF neural network with adaptive learning algorithm was used to compensate the model uncertainty. The stability analysis of the control law was given and the simulation results show the feasibility and validity of the proposed control law.
Empirical evaluation methods for multiobjective reinforcement learning algorithms

While a number of algorithms for multiobjective reinforcement learning have been proposed, and a small number of applications developed, there has been very little rigorous empirical evaluation of the performance and limitations of these algorithms. This paper proposes standard methods for such empirical evaluation, to act as a foundation for future comparative studies. Two classes of multiobjective reinforcement learning algorithms are identified, and appropriate evaluation metrics and methodologies are proposed for each class. A suite of benchmark problems with known Pareto fronts is described, and future extensions and implementations of this benchmark suite are discussed. The utility of the proposed evaluation methods are demonstrated via an empirical comparison of two example learning algorithms.
Forensics Investigations of Multimedia Data: A Review of the State-of-the-Art

Digital forensics is one of the cornerstones to investigate criminal activities such as fraud, computer security breaches or the distribution of illegal content. The importance and relevance of this research fields attracted various research institutes leading to substantial progress in the area of digital investigations. One essential piece of evidence is multimedia data. For this reason this paper provides an overview of the state-of-the-art in the forensic investigation of multimedia data, the relationship between the various research fields and further potential research activities.
De-anonymizing scale-free social networks by percolation graph matching

We address the problem of social network de-anonymization when relationships between people are described by scale-free graphs. In particular, we propose a rigorous, asymptotic mathematical analysis of the network de-anonymization problem while capturing the impact of power-law node degree distribution, which is a fundamental and quite ubiquitous feature of many complex systems such as social networks. By applying bootstrap percolation and a novel graph slicing technique, we prove that large inhomogeneities in the node degree lead to a dramatic reduction of the initial set of nodes that must be known a priori (the seeds) in order to successfully identify all other users. We characterize the size of this set when seeds are selected using different criteria, and we show that their number can be as small as n% for any small ε > 0. Our results are validated through simulation experiments on real social network graphs.
Dynamic Integration of Background Knowledge in Neural NLU Systems

Common-sense or background knowledge is required to understand natural language, but in most neural natural language understanding (NLU) systems, the requisite background knowledge is indirectly acquired from static corpora. We develop a new reading architecture for the dynamic integration of explicit background knowledge in NLU models. A new task-agnostic reading module provides refined word representations to a task-specific NLU architecture by processing background knowledge in the form of free-text statements, together with the taskspecific inputs. Strong performance on the tasks of document question answering (DQA) and recognizing textual entailment (RTE) demonstrate the effectiveness and flexibility of our approach. Analysis shows that our models learn to exploit knowledge selectively and in a semantically appropriate way.