Mobile crowdsensing (MCS) has been an emerging technology thanks to the smart devices which are capable of sensing and computing to achieve large-scale, complex sensing tasks by cooperation. However, large-scale deployment might be impeded due to that fact that the participant may face the risk of privacy leakage, and if they are not compensated favorably, they may not be willing to contribute sensing

Recent advancements in Generative Adversarial Networks (GANs) have led to significant improvements in various image generation tasks including image synthesis based on text descriptions. In this paper, we present an enhanced Attentional Generative Adversarial Network (e-AttnGAN) with improved training stability for text-to-image synthesis. e-AttnGAN’s integrated attention module utilizes both sentence

Abstract Ontology, as a semantic representation of a shared conceptualization, makes knowledge machine-readable and easy to spread. One of its typical applications is used to develop e-learning systems with Educational Ontology. Ontology can help students master knowledge architecture of required subjects and make scattered courseware more systematic. A big challenge is how to construct Educational

Aimed at finding a scientific and effective method to diagnose faults in rotating machinery, the algorithm based on Supervision Kernel Entropy Component Analysis with Whale Optimization Algorithm (WOSKECA) for feature selection has been proposed in this paper. Firstly, for ensure sufficient information gathering from the rotating machinery, multi-features parameters of the time domain, frequency domain

Image steganography is a technique of hiding secret data into a cover image and so as to prevent the intruders from accessing the secret data. The efficiency of image steganography techniques are usually evaluated based on perceptual transparency, payload capacity, security, temper resistance and computational costs. Though there has been significant improvement in related research over the decades

Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It includes as special cases an axiomatic characterisation for choice functions based on (sets of) total orders, (sets of) weak orders, (sets of) coherent lower previsions

This paper reports on our experiences with verifying automotive C code by state-of-the-art open source software model checkers. The embedded C code is automatically generated from Simulink open-loop controller models. Its diverse features (decision logic, floating-point and pointer arithmetic, rate limiters and state-flow systems) and the extensive use of floating-point variables make verifying the

Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich combinatorial context. In particular, we stress the link to the theory of (structural) sparsity, which leads to alternative proofs, refinements and solutions of open problems

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints. In this paper we show that one of the most popular variants of the SCSP, called No-Rainbow Problem, is NP-Hard.

Avionics is one of the fields in which verification methods have been pioneered and brought a new level of reliability to systems used in safety critical environments. Tragedies, like the 2015 insider attack on a German airplane, in which all 150 people on board died, show that safety and security crucially depend not only on the well functioning of systems but also on the way how humans interact with

Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs, including in attempting to solve the well-known Russell's paradox. These semantics are often non-intuitive and hard-to-understand when unrestricted negation is used in recursion

Team semantics is the mathematical framework of modern logics of dependence and independence in which formulae are interpreted by sets of assignments (teams) instead of single assignments as in first-order logic. In order to deepen the fruitful interplay between team semantics and database dependency theory, we define "Polyteam Semantics" in which formulae are evaluated over a family of teams. We begin

We present a device for specifying and reasoning about syntax for datatypes, programming languages, and logic calculi. More precisely, we study a notion of signature for specifying syntactic constructions. In the spirit of Initial Semantics, we define the syntax generated by a signature to be the initial object---if it exists---in a suitable category of models. In our framework, the existence of an

Using techniques from the fields of symbolic computation and satisfiability checking we verify one of the cases used in the landmark result that projective planes of order ten do not exist. In particular, we show that there exist no projective planes of order ten that generate codewords of weight fifteen, a result first shown in 1973 via an exhaustive computer search. We provide a simple satisfiability

We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for these systems is introduced, and proved adequate and expressively complete for bisimulation equivalence. A main technical novelty is the use of finitely supported

We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as $\mathcal{ALC}$ in a Horn DL such as~$\mathcal{EL}$. We provide concrete approximation schemes that are necessarily infinite and observe that in the $\mathcal{ELU}$-to-$\mathcal{EL}$ case finite approximations tend to exist in practice and are guaranteed to exist when the original ontology is acyclic

This paper considers repeated games in which one player has more information about the game than the other players. In particular, we investigate repeated two-player zero-sum games where only the column player knows the payoff matrix A of the game. Suppose that while repeatedly playing this game, the row player chooses her strategy at each round by using a no-regret algorithm to minimize her (pseudo)

Quality control plays a critical role in crowdsourcing. The state-of-the-art work is not suitable for large-scale crowdsourcing applications, since it is a long haul for the requestor to verify task quality or select professional workers in a one-by-one mode. In this paper, we propose a misreport- and collusion-proof crowdsourcing mechanism, guiding workers to truthfully report the quality of submitted

We study the price of anarchy (PoA) of simultaneous 2nd price auctions (S2PA) under a natural condition of {\em no underbidding}. No underbidding means that an agent's bid on every item is at least its marginal value given the outcome. In a 2nd price auction, underbidding on an item is weakly dominated by bidding the item's marginal value. Indeed, the no underbidding assumption is justified both theoretically

Aggregative games have many industrial applications, and computing an equilibrium in those games is challenging when the number of players is large. In the framework of atomic aggregative games with coupling constraints, we show that variational Nash equilibria of a large aggregative game can be approximated by a Wardrop equilibrium of an auxiliary population game of smaller dimension. Each population

Transportation Network Companies employ dynamic pricing methods at periods of peak travel to incentivise driver participation and balance supply and demand for rides. Surge pricing multipliers are commonly used and are applied following demand and estimates of customer and driver trip valuations. Combinatorial double auctions have been identified as a suitable alternative, as they can achieve maximum

The Local Mutual Exclusion (LME) problem is a variant of classical Mutual Exclusion (ME) problem and can be considered as an extension of dining philosopher problem. In LME, no two neighboring nodes can enter the critical section (CS) simultaneously, whereas two non-neighboring nodes can be in their CS simultaneously. The resource allocation problem in Flying Ad hoc Networks (FANETs), is relatively

This paper studies the statistical behavior of a switched variable step size Normalized Least Mean Square adaptive filter. The purpose of the switching is to obtain a Normalized Least Mean Square adaptive filter combination with fast convergence and small steady-state mean-square weight deviation (MSD). Previous works studied variable step-size Least Mean Square (LMS) and Normalized Mean Square (NLMS)

Abstract Cooperative multiple task assignment problem is an essential issue in the collaboration of multiple unmanned aerial vehicles (UAVs). Consensus-based bundle algorithm (CBBA) is a decentralized task assignment method that only considers homogeneous agents and independent tasks. Thus, we develop an extended CBBA with task coupling constraints (CBBA-TCC) in this paper to solve the multi-task assignment

Abstract Mining frequent itemset is considered as a core activity to find association rules from transactional datasets. Among the different well-known approaches to find frequent itemsets, the Apriori algorithm is the earliest proposed. Many attempts have been made to adopt the Apriori algorithm for large-scale datasets. But the bottlenecks associated with Apriori like/such as repeated scans of the

Abstract It is estimated that there will be approximately 125 billion Internet of Things (IoT) devices connected to the Internet by 2030, which are expected to generate large amounts of data. This will challenge data processing capability, infrastructure scalability, and privacy. Several studies have demonstrated the benefits of using distributed intelligence (DI) to overcome these challenges. We propose

Abstract Several approaches to forecast the service quality based on its quality of service (QoS) properties are reported in the literature. However, their main disadvantage resides in their limited scalability. In fact, they elaborate a forecasting model for each quality attribute per service, which cannot scale well for large or even medium size datasets of services. Accordingly, we propose a novel

Abstract State actors can minimize the risk of combat deaths by making decisions consistent with a likelihood ratio test that fuses attack detection data with prior war probabilities. The power-law, which has for decades been used to model the distribution of combat fatalities, is invalid as a probability because the mean is divergent. An investigation of Correlates of War data reveal that combat fatalities

In this paper, a heuristic algorithm fusing with niche identification (NIT) and Artificial Bee Colony (ABC) technique is developed to solve multimodal optimization problems, and is then applied for structural damage detection. In order to improve the detection accuracy of the proposed algorithm, the Depth First Search (DFS) is adopted, and a new particle update scheme is proposed to maintain the diversity

Heuristic algorithms have been used for a long time to tackle problems that are known or conjectured intractable. A heuristic algorithm is one that provides a correct decision for most inputs, but may fail on some. We focus on the case when failure means that the algorithm does not return any answer, rather than returning a wrong result. These algorithms are called errorless heuristics. A reasonable

Although XQuery is a statically typed, functional query language for XML data, some of its features such as upward and horizontal XPath axes are typed imprecisely. The main reason is that while the XQuery data model allows us to navigate upwards and between siblings from a given XML node, the type model, e.g., regular tree types, can describe only the subtree structure of the given node. To alleviate

The need for solving optimization problems is prevalent in a wide range of physical applications, including neuroscience, network design, biological systems, socio-economics, and chemical reactions. Many of these are classified as non-deterministic polynomial-time (NP) hard and thus become intractable to solve as the system scales to a large number of elements. Recent research advances in photonics

Among the various key networks in the human body, the nervous system occupies central importance. The debilitating effects of spinal cord injuries (SCI) impact a significant number of people throughout the world, and to date, there is no satisfactory method to treat them. In this paper, we review the major treatment techniques for SCI that include promising solutions based on information and communication

Traditional silicon-on-insulator (SOI) platform based on-chip photonic interconnects have limited energy-bandwidth scalability due to the optical non-linearity induced power constraints of the constituent photonic devices. In this paper, we propose to break this scalability barrier using a new silicon-on-sapphire (SOS) based photonic device platform. Our physical-layer characterization results show

Surface integral equation (SIE) methods are of great interest for the numerical solution of Maxwell's equations in the presence of homogeneous objects. However, existing SIE algorithms have limitations, either in terms of scalability, frequency range, or material properties. We present a scalable SIE algorithm based on the generalized impedance boundary condition which can efficiently handle, in a

In a previous work we considered a two-dimensional lattice of particles and calculated its time evolution by using an interaction law based on the spatial position of the particles themselves. The model reproduced the behaviour of deformable bodies both according to the standard Cauchy model and second gradient theory; this success led us to use this method in more complex cases. This work is intended

Blockchain-based cryptocurrencies and applications have flourished the blockchain research community. Massive data generated from diverse blockchain systems bring not only huge business values and but also technical challenges in data analytics of heterogeneous blockchain data. Different from Bitcoin and Ethereum, EOSIO has richer diversity and higher volume of blockchain data due to its unique architectural

This article presents a selective survey of algorithms for the offline detection of multiple change points in multivariate time series. A general yet structuring methodological strategy is adopted to organize this vast body of work. More precisely, detection algorithms considered in this review are characterized by three elements: a cost function, a search method and a constraint on the number of changes

The freud Python package is a powerful library for analyzing simulation data. Written with modern simulation and data analysis workflows in mind, freud provides a Python interface to fast, parallelized C++ routines that run efficiently on laptops, workstations, and supercomputing clusters. The package provides the core tools for finding particle neighbors in periodic systems, and offers a uniform API

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints. In this paper we show that one of the most popular variants of the SCSP, called No-Rainbow Problem, is NP-Hard.

Given a linear dynamical system affected by stochastic noise, we consider the problem of selecting an optimal set of sensors (at design-time) to minimize the trace of the steady state a priori or a posteriori error covariance of the Kalman filter, subject to certain selection budget constraints. We show the fundamental result that there is no polynomial-time constant-factor approximation algorithm

The classes PPA-$p$ have attracted attention lately, because they are the main candidates for capturing the complexity of Necklace Splitting with $p$ thieves, for prime $p$. However, these classes are not known to have complete problems of a topological nature, which impedes any progress towards settling the complexity of the problem. On the contrary, such problems have been pivotal in obtaining completeness

Transportation Network Companies employ dynamic pricing methods at periods of peak travel to incentivise driver participation and balance supply and demand for rides. Surge pricing multipliers are commonly used and are applied following demand and estimates of customer and driver trip valuations. Combinatorial double auctions have been identified as a suitable alternative, as they can achieve maximum

A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.

The posthoc verification protocol [J. F. Fitzsimons, M. Hajdu{\v s}ek, and T. Morimae, Physical Review Letters {\bf120}, 040501 (2018)] enables an information-theoretically-sound non-interactive verification of quantum computing, but the message from the prover to the verifier is quantum and the verifier has to do single-qubit measurements. The Mahadev protocol removes these quantum parts, but the

Abstract Iterative and time-step methods are spread far and wide in several mathematics and physics domains. At the same time, modern computers include multicore CPUs along with GPUs, so it is important to use all their computing capabilities for their efficient use. Aiming to improve performance of this kind of numerical methods, we introduce in this work a new heterogeneous parallelism CPU + GPU

Abstract The increasing usage of mobile cloud computing leads the cloud to become a hotbed of crime. Cloud storage is different from previous data storage in digital forensics. In this paper, we concentrate on gathering evidence from mobile iOS devices and the types of data remnants that can be found on iOS devices for different user scenarios and device states. We develop several steps for experimenting

Spectrum Sensing as a Service (SSaS) has recently emerged as a promising solution to realize dynamic spectrum access networks (aka, cognitive radio networks (CRNs)). This paradigm relies on a dedicated infrastructure wireless sensor network, operated by a spectrum sensing service provider S3P entity, for spectrum monitoring. Wireless users which are interested in knowing the status of a given spectrum

In this paper, we investigate the uplink and downlink performance of single cell Massive multiple-input multiple-output (MIMO) system under channel varying conditions due to rapid user mobility. During uplink, the mobile users transmit orthogonal pilot sequences to the base station for channel state information (CSI) estimation prior to data transmission. During downlink, the base station sends orthogonal

Aiming at the problem that drilling data is disturbed by environment noise, which affects the accuracy of stratum identification based on expert experience. Due to the impact of drilling environment and limited resources of drilling experts, experienced experts have been unable to visit the site in person to guide the site in the form of one-to-one. Firstly, the paper introduces remote wireless acquisition

Breast thermography images are a new type of data that has been analyzed in recent years in order to detect abnormalities, which can lead to a future breast cancer. This paper proposes a methodology for breast thermal image classification, which is useful in Computer-Aided Detection Systems. The main contribution is an automatic method to segment the region of interest (ROI) based on local operations

Given a seller with k types of items and n single-minded buyers, i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the seller must assign some amount of bundles to each buyer with respect to the buyer's accepted price. Each buyer bi is associated with a value function vi(⋅) such that vi(x) is the accepted unit bundle price bi is willing to pay for x bundles

To meet the requirement of social influence analytics in various applications, the problem of influence maximization has been studied in recent years. The aim is to find a limited number of nodes (i.e., users) which can activate (i.e. influence) the maximum number of nodes in social networks. However, the community diversity of influenced users is largely ignored even though it has unique value in

Advertisement.

In recent years, with the rapid development of China’s economy, many civil engineering structures such as high-rise buildings, bridges, dams and tunnel have increased rapidly. Sensor optimization layout, as an important technology of Structural Health Monitoring (SHM), has become one of the research hotspots in related fields and disciplines. Due to the limitations of civil engineering structures and

In practice, as a well-known statistical method, the logistic regression model is used to evaluate the credit-worthiness of borrowers due to its simplicity and transparency in predictions. However, in literature, sophisticated machine learning models can be found that can replace the logistic regression model. Despite the advances and applications of machine learning models in credit scoring, there

Breast cancer is the most common cancer type attacking women worldwide. Also, breast cancer has been phenotypically classified into five subtypes. Each subtype group has unique characteristics that demonstrate the heterogeneity present within the breast cancer tumour. In 2012, the American Association for Cancer Research provided a population based molecular integrative clusters for the METABRIC (Molecular

The n-dimensional folded hypercube FQn interconnection network has been shown that it is bipartite for every odd n≥3, and which is non-bipartite for every even n≥2. Let F4={f1,f2,f3,f4} denote the faulty set of extreme vertices from any four cycle in FQn. Then, we show that the fault-free cycles can be embedded in FQn−F4 as follows: 1. For n≥3, FQn−F4 contains a fault-free cycle of every even length

In this paper, we study the generic hardness of the inversion problem on a ring, which is a problem to compute the inverse of a given prime c by just using additions, subtractions and multiplications on the ring. If the characteristic of an underlying ring is public and coprime to c, then it is easy to compute the inverse of c by using the extended Euclidean algorithm. On the other hand, if the characteristic