Analytical study on cantilever resonance type magnet-integrated sensor device for micro-magnetic field detection

A beam-shaped cantilever resonance type magnetic sensor device has been proposed with a micro magnet. Two structural designs, named as design 1 and design 2, have been comparatively analyzed using ANSYS in order to obtain larger frequency shifts (higher magnetism sensitivity) due to the applied exterior magnetic field. The analytical results show that, in the range of 0–10 mT, the frequency shifts are small, while under 100 mT, a relatively larger frequency shift of about 30 Hz can be theoretically obtained. The power consumption of the proposed devices has been further theoretically studied for preliminary understanding. Using the well-known displacement equations, the estimated power consumption is around 0.21 μW, which is very lower than that of the reported magnetic field sensors. This implies that it is possible to fabricate higher sensitive magnetic field sensor with lower power consumption.     

交互更新模式的量子遗传算法的几何约束求解

目的针对传统量子遗传算法无法充分利用种群中未成熟个体信息的不足,提出了基于交互更新模式的量子遗传算法(IUMQGA)并应用于几何约束求解中。方法几何约束问题的约束方程组可转化为优化模型,因此约束求解问题可以转化为优化问题。采用将遗传算法与量子理论相结合的量子遗传算法,使用双串量子染色体结构,使用交互更新策略将遗传算法中的交叉操作利用量子门变换来实现,根据不同情况采用不同的交互更新策略。这里的交互,指的是两个个体进行信息交换的过程,该过程用以产生新的个体。这不仅增加了个体间信息的交换而且充分利用了种群中未成熟个体的信息,提高了算法的收敛速度。结果通过非线性方程实例和几何约束实例测试并与其他方法比较表明,基于交互更新模式的量子遗传算法求解几何约束问题具有更好的求解精度和求解速率。双圆外公切线问题实例中,IUMQGA算法比QGA算法稳定;单圆填充问题和双圆外公切线问题实例中,通过实验求得各变量的最优值与其相应的精确值的误差在1E-2以下。结论采用交互更新模式的量子遗传算法可以很好地求解几何约束问题。     

图像自适应分块的压缩感知采样算法

目的 在图像压缩感知过程中,不管是整体采样还是固定分块采样,都不能充分利用图像的稀疏性,存在采样率与图像重构质量的矛盾。提出了一种基于图像纹理变化的自适应分块感知采样算法ABCS(adaptive block compressed sensing),再结合JPEG量化思想,在不降低图像重构质量的前提下降低采样率,更大地提高压缩比。方法 首先进行图像预分块,计算分析各块纹理复杂度,当图像块纹理复杂度低于相应阈值,选择最佳采样率对各块观测采样,当图像块纹理复杂度高于相应阈值,需再分块,重复上述步骤,达到最小16×16块时停止分块。当最小块的纹理复杂度高于最大阈值采用JPEG量化编码,其他块选择匹配的采样率,以压缩感知方式压缩。结果 ABCS算法与典型的压缩感知重构算法结合并与其原始算法比较,在相近采样率条件下,图像重构质量提高明显,尤其在低采样率下性能更佳,如20%采样率下重构图像PSNR值达到30 dB左右。结论 提出的自适应的分块采样充分利用图像的稀疏分布,提高压缩感知的效率;高复杂纹理块采用JPEG编码处理,避免了重构质量差的缺点,同时减少了重构时间。     

Think,feel, bid: the impact of environmental conditions on the role of bidders’ cognitive and affective processes in auction bidding

Environmental conditions and the interplay of cognitive and affective processes both exert influences on bidding behavior. This paper brings the above together, considering how the (external) auction environment determines the impact of (internal) cognitive and affective processes on bidding behavior, assessed in comparison to the optimal bid. Two aspects of the auction environment were considered, namely auction dynamics (low: first-price sealed-bid auction, high: Dutch auction) and value uncertainty (low, high). In a laboratory experiment, we assess bidders’ cognitive workload and emotional arousal through physiological measurements. We find that higher auction dynamics increase the impact of emotional arousal on bid deviations, but not that of cognitive workload. Higher value uncertainty, conversely, increases the impact of cognitive workload on bid deviations, but not that of emotional arousal. Taken together, the auction environment is a critical factor in understanding the nature of the underlying decision process and its impact on bids.     

Quantum commitments from complexity assumptions

Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and in the quantum regime, we examine computationally secure commitment schemes. In this paper we study worst-case complexity assumptions that imply quantum bit commitment schemes. First, we show that QSZK \({\not\subseteq}\) QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP \({\not\subseteq}\) QMA (which is weaker than PSPACE \({\not\subseteq}\) PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK \({\not\subseteq}\) QMA, we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA, the class of languages that can be verified using a classical proof in quantum polynomial time.     

Factors of low individual degree polynomials

Kaltofen (Randomness in computation, vol 5, pp 375–412, 1989) proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen’s work, many questions remain unanswered regarding the complexity aspects of polynomial factorization, such as the question of whether factors of polynomials efficiently computed by arithmetic formulas also have small arithmetic formulas, asked in Kopparty et al. (2014), and the question of bounding the depth of the circuits computing the factors of a polynomial. We are able to answer these questions in the affirmative for the interesting class of polynomials of bounded individual degrees, which contains polynomials such as the determinant and the permanent. We show that if \({P(x_{1},\ldots,x_{n})}\) is a polynomial with individual degrees bounded by r that can be computed by a formula of size s and depth d, then any factor \({f(x_{1},\ldots, x_{n})}\) of \({P(x_{1},\ldots,x_{n})}\) can be computed by a formula of size \({\textsf{poly}((rn)^{r},s)}\) and depth d + 5. This partially answers the question above posed in Kopparty et al. (2014), who asked if this result holds without the dependence on r. Our work generalizes the main factorization theorem from Dvir et al. (SIAM J Comput 39(4):1279–1293, 2009), who proved it for the special case when the factors are of the form \({f(x_{1}, \ldots, x_{n}) \equiv x_{n} - g(x_{1}, \ldots, x_{n-1})}\). Along the way, we introduce several new technical ideas that could be of independent interest when studying arithmetic circuits (or formulas).     

Product fit uncertainty and its effects on vendor choice: an experimental study

Recommender systems and other Internet-enabled technologies have changed the surrounding conditions of pre-purchase evaluations on the Internet. In some cases consumers can now sample entire products prior to a purchase – hereby removing all uncertainty about whether a product fits their taste. While previous research has mainly focused on vendor and product quality uncertainty, it is still not clear how declining product fit uncertainty affects consumers. To close this gap, we conducted a laboratory experiment to analyze the effects on consumers’ vendor selection. We find that full elimination of product fit uncertainty is beneficial for vendors, as it increases both the number of purchases and consumer loyalty. Interestingly, if product fit uncertainty is only partially eliminated, consumers do not necessarily show differential behavior for different levels of remaining product fit uncertainty. This has important implications for online vendors that consider the implementation of additional means to reduce product fit uncertainty.     

Consequences of customer engagement behavior: when negative Facebook posts have positive effects

Sharing product information has become an integral part of today’s online social networking world. This research study addresses the effects of customer engagement behavior in online social networks on other consumers in order to understand how online social connections impact decision making. We investigate how different variations of a brand-related Facebook post trigger different response reactions. In particular, we analyze under which conditions negative posts can have positive consequences. The results of two online experiments set in a restaurant context suggest a difference when the user knows the restaurant brand. For users who are familiar with the restaurant brand, a positive effect of negative information posted by distant acquaintances is found with regard to the visiting intention of the user. The results of both experiments demonstrate that information posted by a close friend is perceived to be more diagnostic. For users not familiar with the restaurant brand, negative posts from strong ties induce the highest diagnosticity levels.     

The complexity of intersecting finite automata having few final states

The problem of determining whether several finite automata accept a word in common is closely related to the well-studied membership problem in transformation monoids. We raise the issue of limiting the number of final states in the automata intersection problem. For automata with two final states, we show the problem to be \({\oplus}\)L-complete or NP-complete according to whether a nontrivial monoid other than a direct product of cyclic groups of order 2 is allowed in the automata. We further consider idempotent commutative automata and (Abelian, mainly) group automata with one, two, or three final states over a singleton or larger alphabet, elucidating (under the usual hypotheses on complexity classes) the complexity of the intersection nonemptiness and related problems in each case.     

Topology-Aware Multiple Routing Configurations for Fault Tolerant Networking

Real-time services require reliable and fault tolerant communication networks to support their stringent Quality of Service requirements. Multi Topology Routing based IP Fast Re-route (MT-IPFRR) technologies provide seamless forwarding of IP packets during network failures by constructing virtual topologies (VTs) to re-route the disrupted traffic. Multiple Routing Configurations (MRC) is a widely studied MT-IPFRR technique. In this paper, we propose two heuristics, namely mMRC-1 and mMRC-2, to reduce the number of VTs required by the MRC to provide full coverage for single link/node failures, and hence, to decrease its operational complexity. Both heuristics are designed to construct more robust VTs against network partitioning by taking their topological characteristics into consideration. We perform extensive experiments on 3200 topologies with diverse structural properties using our automated topology generation and analysis tool. Numerical results show that the amount of reductions in VT requirements get higher up to 31.84 %, as the networks tend to have more hub nodes whose degree is much higher than the rest of the network.