Designing Metallic and Insulating Nanocrystal Heterostructures to Fabricate Highly Sensitive and Solution Processed Strain Gauges for Wearable Sensors

All‐solution processed, high‐performance wearable strain sensors are demonstrated using heterostructure nanocrystal (NC) solids. By incorporating insulating artificial atoms of CdSe quantum dot NCs into metallic artificial atoms of Au NC thin film matrix, metal–insulator heterostructures are designed. This hybrid structure results in a shift close to the percolation threshold, modifying the charge transport mechanism and enhancing sensitivity in accordance with the site percolation theory. The number of electrical pathways is also manipulated by creating nanocracks to further increase its sensitivity, inspired from the bond percolation theory. The combination of the two strategies achieves gauge factor up to 5045, the highest sensitivity recorded among NC‐based strain gauges. These strain sensors show high reliability, durability, frequency stability, and negligible hysteresis. The fundamental charge transport behavior of these NC solids is investigated and the combined site and bond percolation theory is developed to illuminate the origin of their enhanced sensitivity. Finally, all NC‐based and solution‐processed strain gauge sensor arrays are fabricated, which effectively measure the motion of each finger joint, the pulse of heart rate, and the movement of vocal cords of human. This work provides a pathway for designing low‐cost and high‐performance electronic skin or wearable devices.     

Theory and techniques of data mining in CGF behavior modeling

For the large quantity of data,rules and models generated in the course of computer generated forces (CGFs) behavior modeling,the common analytical methods are statistical methods based on the tactical rules,tactical doctrine and empirical knowledge.However,from the viewpoint of data mining,we can find many of these analytical methods are also each-and-every different data mining methods.In this paper,we survey the data mining theory and techniques that have appeared in the course of CGF behavior modeling f...     

Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems.     

On finding fundamental cut sets

In this paper a linear time algorithm is proposed for preprocessing the edges of a graph. After preprocessing (in linear time), the fundamental cut set of any tree edge can be determined in time proportional to the size of that cut set.     

A characterization of (regular) circular languages generated by monotone complete splicing systems

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a characterization of the class of circular languages generated by circular splicing systems is still an open problem. In this paper we solve this problem for monotone complete systems, which are finite circular splicing systems with rules of a simpler form. We show that a circular language L is generated by a monotone complete system if and only if the set Lin(L) of all words corresponding to L is a pure unitary language generated by a set closed under the conjugacy relation. The class of pure unitary languages was introduced by A. Ehrenfeucht, D. Haussler, G. Rozenberg in 1983, as a subclass of the class of context-free languages, together with a characterization of regular pure unitary languages by means of a decidable property. As a direct consequence, we characterize (regular) circular languages generated by monotone complete systems. We can also decide whether the language generated by a monotone complete system is regular. Finally, we point out that monotone complete systems have the same computational power as finite simple systems, an easy type of circular splicing system defined in the literature from the very beginning, when only one rule of a specific type is allowed. From our results on monotone complete systems, it follows that finite simple systems generate a class of languages containing non-regular languages, showing the incorrectness of a longstanding result on simple systems.     

Existence and uniqueness of strictly nondecreasing and positive solution for a fractional three-point boundary value problem

In this paper, we consider the following nonlinear fractional three-point boundary value problem

     

改进的证据理论在合作频谱感知中的应用

为了能够在认知无线电网络中有效、准确地检测出授权用户,提出了基于改进的证据理论的合作频谱感知方案设计方法.根据各个次用户对授权用户进行多次本地检测得出的时域DS融合结果,设计并改进融合顺序和融合结构,将多个时域DS融合结果送到融合中心进行空域DS融合,得到最终判决.在此基础上,给出了融合顺序、融合结构的改变对算法性能的...     

Geometrically non-linear behavior of structural systems with random material property: An asymptotic spectral stochastic approach

An asymptotic spectral stochastic approach is presented for computing the statistics of the equilibrium path in the post-bifurcation regime for structural systems with random material properties. The approach combines numerical implementation of Koiter’s asymptotic theory with a stochastic Galerkin scheme and collocation in stochastic space to quantify uncertainties in the parametric representation of the load–displacement relationship, specifically in the form of uncertain post-buckling slope, post-buckling curvature, and a family of stochastic displacement fields. Using the proposed method, post-buckling response statistics for two plane frames are obtained and shown to be in close agreement with those obtained from Monte Carlo simulation, provided a fine enough spectral representation is used to model the variability in the random dimension.     

Multi‐Unit Bayesian Auction with Demand or Budget Constraints

We consider the problem of revenue maximization on multi‐unit auctions where items are distinguished by their relative values; any pair of items has the same ratio of values to all buyers. As is common in the study of revenue maximizing problems, we assume that buyers' valuations are drawn from public known distributions and they have additive valuations for multiple items. Our problem is well motivated by sponsored search auctions, which made money for Google and Yahoo! in practice. In this auction, each advertiser bids an amount b_i to compete for ad slots on a web page. The value of each ad slot corresponds to its click‐through‐rate, and each buyer has her own per‐click valuations, which is her private information. Obviously, a strategic bidder may bid an amount that is different with her true valuation to improve her utility. Our goal is to design truthful mechanisms avoiding this misreporting. We develop the optimal (with maximum revenue) truthful auction for a relaxed demand model (where each buyer i wants at most d_i items) and a sharp demand model (where buyer i wants exactly d_i items). We also find an auction that always guarantees at least half of the revenue of the optimal auction when the buyers are budget constrained. Moreover, all of the auctions we design can be computed efficiently, that is, in polynomial time.