Miracle-dz/UniFAR-FTUs huggingface dataset:
How Well Do We Know Our Inner Daredevil? Probing the Relationship Between Self‐Report and Behavioral Measures of Risk Taking

To measure a person's risk-taking tendency, research has relied interchangeably on self-report scales (e.g., “Indicate your likelihood of engaging in the risky behavior”) and more direct measures, such as behavioral tasks (e.g., “Do you accept or reject the risky option? ”). It is currently unclear, however, how the two approaches map upon each other. We examined the relationship between self-report likelihood ratings for risky choice in a monetary gamble task and actual choice, and tested how the relationship is affected by task ambiguity (i.e., when part of the information about risks and benefits is missing) and age. Five hundred participants (aged 19–85 years) were presented with 27 gambles, either in an unambiguous or an ambiguous condition. In a likelihood rating task, participants rated for each gamble the likelihood that they would accept it. In a separate choice task, they were asked to either accept or reject each gamble. Analyses using a signal-detection approach showed that people's likelihood ratings discriminated between accept and reject cases in their choices rather well. However, task ambiguity weakened the association between likelihood ratings and choice. Further, older adults' likelihood ratings anticipated their choices more poorly than younger adults'. We discuss implications of these findings for existing approaches to the study of risk-taking propensity, which have often relied on self-reported risk tendency for ambiguous activities. Copyright © 2016 John Wiley & Sons, Ltd.
A Low-Noise Fractional- ${N}$  Digital Frequency Synthesizer With Implicit Frequency Tripling for mm-Wave Applications

In this paper, we propose a 60-GHz fractional-<inline-formula> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> digital frequency synthesizer aimed at reducing its phase noise (PN) at both the flicker (<inline-formula> <tex-math notation="LaTeX">$1/\! f^{3}$ </tex-math></inline-formula>) and thermal (<inline-formula> <tex-math notation="LaTeX">$1/\! f^{2}$ </tex-math></inline-formula>) regions while minimizing its power consumption. The digitally controlled oscillator (DCO) fundamentally resonates at 20 GHz and co-generates a strong third harmonic at 60 GHz which is extracted to the output while canceling the 20-GHz fundamental. The latter component is fed back to the frequency dividers in an all-digital phase-locked loop for phase detection, which comprises a pair of digital-to-time and time-to-digital converters with <inline-formula> <tex-math notation="LaTeX">$\Sigma \Delta $ </tex-math></inline-formula> dithering to attenuate fractional spurs. The mechanism of flicker noise upconversion to <inline-formula> <tex-math notation="LaTeX">$1/\! f^{3}$ </tex-math></inline-formula> PN in the DCO is investigated, and a reduction technique is proposed. The 28-nm CMOS prototype achieves 213–277-fs rms jitter in the 57.5–67.2-GHz tuning range while consuming only 40 mW. The DCO flicker PN corner is record low at 300–400 kHz.
Anxiety in young people with autism spectrum disorder: Common and autism-related anxiety experiences and their associations with individual characteristics

Anxiety is common in autism spectrum disorder. Many anxiety symptoms in autism spectrum disorder are consistent with Diagnostic and Statistical Manual of Mental Disorders (5th ed.) anxiety disorders (termed “common” anxieties), but others may be qualitatively different, likely relating to autism spectrum disorder traits (herein termed “autism-related” anxieties). To date, few studies have examined both “common” and “autism-related” anxiety experiences in autism spectrum disorder. We explored caregiver-reported Spence Children’s Anxiety Scale-Parent version data from a multi-site (United Kingdom, Singapore, and United States) pooled database of 870 6- to 18-year-old participants with autism spectrum disorder, of whom 287 provided at least one written response to the optional open-ended Spence Children’s Anxiety Scale-Parent item 39 (“Is there anything else your child is afraid of? ”). Responses were thematically coded to explore (a) common and autism-related anxiety presentations and (b) their relationship with young people’s characteristics. Nearly half of the responses were autism-related anxieties (mostly sensory, uncommon, or idiosyncratic specific phobias and worries about change and unpredictability). The other half described additional common anxieties not covered in the original measure (mostly social, weather and environmental disasters, and animals). Caregivers of participants who were more severely affected by autism spectrum disorder symptoms reported more autism-related, as compared to common, additional anxieties. Implications for the assessment and understanding of anxiety in autism are discussed.
GPU Tensor Cores for Fast Arithmetic Reductions

This article proposes a parallel algorithm for computing the arithmetic reduction of <inline-formula><tex-math notation="LaTeX">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href="navarro-ieq1-3011893.gif"/></alternatives></inline-formula> numbers as a set of matrix-multiply accumulate (MMA) operations that are executed simultaneously by GPU tensor cores. The analysis, assuming tensors of size <inline-formula><tex-math notation="LaTeX">$m \times m$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>m</mml:mi><mml:mo>×</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="navarro-ieq2-3011893.gif"/></alternatives></inline-formula>, shows that the proposed algorithm has a parallel running time of <inline-formula><tex-math notation="LaTeX">$T(n)=5 log_{m^2}{n}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>T</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>5</mml:mn><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:msup><mml:mi>m</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:msub><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="navarro-ieq3-3011893.gif"/></alternatives></inline-formula> and a speedup of <inline-formula><tex-math notation="LaTeX">$S=\frac{4}{5} log_{2}{m^2}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>4</mml:mn><mml:mn>5</mml:mn></mml:mfrac><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msup><mml:mi>m</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href="navarro-ieq4-3011893.gif"/></alternatives></inline-formula> over a canonical parallel reduction. Experimental performance results on a Tesla V100 GPU show that the tensor-core based approach is energy efficient and runs up to <inline-formula><tex-math notation="LaTeX">$\sim 3.2 \times$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>∼</mml:mo><mml:mn>3</mml:mn><mml:mo>. </mml:mo><mml:mn>2</mml:mn><mml:mo>×</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="navarro-ieq5-3011893.gif"/></alternatives></inline-formula> and <inline-formula><tex-math notation="LaTeX">$2\times$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>2</mml:mn><mml:mo>×</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="navarro-ieq6-3011893.gif"/></alternatives></inline-formula> faster than a standard GPU-based reduction and Nvidia's CUB library, respectively, while keeping the numerical error below 1 percent with respect to a double precision CPU reduction. The chained design of the algorithm allows a flexible configuration of GPU thread-blocks and the optimal values found through experimentation agree with the theoretical ones. The results obtained in this work show that GPU tensor cores are relevant not only for Deep Learning or Linear Algebra computations, but also for applications that require the acceleration of large summations.
SPARC Levels Modulate the Capacity of Mitomycin to Inhibit the Proliferation of Human Tenon's Capsule Fibroblasts

Purpose To evaluate the role of SPARC in the antiproliferation effect of MMC on human Tenon's fibroblasts (HTF). Method Sixteen PACG patients aged 59 ± 10 years (31–72 years), including 6 males and 10 females, were recruited. Tenon tissue was harvested during filtering surgery. Cell density was evaluated after MMC application with different concentrations and application times, by which the optimized MMC application modality was determined. MMC, si-SPARC, or SPARC protein was used when needed to evaluate the cell densities under different conditions, by which the role of SPARC in MMC-mediated antifibrotic process was identified. Results Considering that the cell densities, as well as SPARC expression on mRNA and protein levels, are relatively stable when the MMC concentration is higher than 0.02% and exposure time longer than 90 s, we chose the MMC application pattern with 0.02% and 90 s as an optimized pattern for the downstream work. Compared to control, the si-SPARC and MMC downregulated the SPARC protein by 91% (P < 0.01) and 65% (P < 0.01) and 65% (P < 0.01) and 65% (P < 0.01) and 65% (P < 0.01) and 65% (P < 0.01) and 65% (P < 0.01) and 65% (P < 0.01) and 65% ( Conclusion This study demonstrates that in HTF, (1) MMC downregulates the expression of SPARC in protein and mRNA levels; (2) SPARC depletion has synergistic effect on the antifibrotic effect of MMC; and (3) reactive oxygen species are the possible mediator in the antifibrotic effect of MMC and si-SPARC.
GCP: Graph Encoder With Content-Planning for Sentence Generation From Knowledge Bases

A knowledge base is a large repository of facts usually represented as triples, each consisting of a subject, a predicate, and an object. The triples together form a graph, i.e., a <italic>knowledge graph</italic>. The triple representation in a knowledge graph offers a simple interface for applications to access the facts. However, this representation is not in a natural language form, which is difficult for humans to understand. We address this problem by proposing a system to translate a set of triples (i.e., a graph) into natural sentences. We take an encoder-decoder based approach. Specifically, we propose a <italic><bold>G</bold>raph encoder with</italic> <bold>C</bold><italic>ontent-</italic><bold>P</bold><italic>lanning capability</italic> (<italic>GCP</italic>) to encode an input graph. GCP not only works as an encoder but also serves as a content-planner by using an entity-order aware topological traversal to encode a graph. This way, GCP can capture the relationships between entities in a knowledge graph as well as providing information regarding the proper entity order for the decoder. Hence, the decoder can generate sentences with a proper entity mention ordering. Experimental results show that GCP achieves improvements over state-of-the-art models by up to <inline-formula><tex-math notation="LaTeX">$3.6\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>3</mml:mn><mml:mo>. </mml:mo><mml:mn>6</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="zhang-ieq1-3118703.gif"/></alternatives></inline-formula>, <inline-formula><tex-math notation="LaTeX">$4.1\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>4</mml:mn><mml:mo>. </mml:mo><mml:mn>1</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="zhang-ieq2-3118703.gif"/></alternatives></inline-formula>, and <inline-formula><tex-math notation="LaTeX">$3.8\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>3</mml:mn><mml:mo>. </mml:mo><mml:mn>8</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="zhang-ieq3-3118703.gif"/></alternatives></inline-formula> in three common metrics BLEU, METEOR, and TER, respectively. The code is available at (<uri>https://github.com/ruizhang-ai/GCP/</uri>)
PROCS: Power Routing and Current Scheduling in Multi-Relay Magnetic MIMO WPT System

Magnetic resonant coupling wireless power transfer (MRC-WPT) enables convenient device-charging. When MIMO MRC-WPT system incorporated with multiple relay components, both relay <italic>On-Off</italic> state (i.e., <italic>power routing</italic>) and TX current (i.e., <italic>current scheduling</italic>) could be adjusted for improving charging efficiency and distance. Previous approaches need the collaboration and feedback from the energy receiver (RX), achieved using side-channels, e.g., Bluetooth, which is time/energy-consuming. In this work we propose, design, and implement a multi-relay MIMO MRC-WPT system, and design an almost optimum joint optimization of <italic>P</italic>ower <italic>RO</italic>uting and <italic>C</italic>urrent <italic>S</italic>cheduling method named <italic>PROCS</italic>, without relying on any feedback from RX. We carefully decompose the joint optimization problem into two subproblems without affecting the overall optimality of the combined solution. For current scheduling subproblem, we propose an almost-optimum RX-feedback independent solution. For power routing subproblem, we first design a greedy algorithm with <inline-formula><tex-math notation="LaTeX">$\frac{1}{2}$</tex-math><alternatives><mml:math><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:math><inline-graphic xlink:href="deng-ieq1-3108482.gif"/></alternatives></inline-formula> approximation ratio, and then design a DQN based method to further improve its effectiveness. We prototype our system and evaluate it with extensive experiments. Our results demonstrate the effectiveness of the proposed algorithms. The achieved power transfer efficiency (PTE) on average is <inline-formula><tex-math notation="LaTeX">$3.2X$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>3</mml:mn><mml:mo>. </mml:mo><mml:mn>2</mml:mn><mml:mi>X</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="deng-ieq2-3108482.gif"/></alternatives></inline-formula>, <inline-formula><tex-math notation="LaTeX">$1.43X$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>1</mml:mn><mml:mo>. </mml:mo><mml:mn>43</mml:mn><mml:mi>X</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="deng-ieq3-3108482.gif"/></alternatives></inline-formula>, <inline-formula><tex-math notation="LaTeX">$1.34X$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>1</mml:mn><mml:mo>. </mml:mo><mml:mn>34</mml:mn><mml:mi>X</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="deng-ieq4-3108482.gif"/></alternatives></inline-formula>, and <inline-formula><tex-math notation="LaTeX">$7.3X$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>7</mml:mn><mml:mo>. </mml:mo><mml:mn>3</mml:mn><mml:mi>X</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="deng-ieq5-3108482.gif"/></alternatives></inline-formula> over the other four strategies: Without relay, with non-adjustable relays, greed based, and shortest-path based ones.
Dynamic Set Similarity Join: An Update Log Based Approach

The set similarity join finds all pairs of similar sets from two collections of sets. It has many real world applications, such as personalized recommendation and community mining. In this paper, we study the problem of computing the similarity join in a dynamic context, where the sets are updated dynamically. This, however, is inefficient with the state-of-the-art join methods, because they usually assume that data collections are static and have to compute the join result from scratch whenever a set is updated. To address this issue, we propose <inline-formula><tex-math notation="LaTeX">${{\sf ALJoin}}$</tex-math><alternatives><mml:math><mml:mi mathvariant="sans-serif">ALJoin</mml:mi></mml:math><inline-graphic xlink:href="yang-ieq1-3126631.gif"/></alternatives></inline-formula>, an adaptive filtering approach that computes the join result incrementally based on the update logs. We first investigate the effect of set updates on the similarity values, and on this basis we propose to build a neighborhood index for each set. The neighborhood index of a specific set consists of any other sets that can be transformed into its similar sets within a threshold number of update operations. <inline-formula><tex-math notation="LaTeX">${{\sf ALJoin}}$</tex-math><alternatives><mml:math><mml:mi mathvariant="sans-serif">ALJoin</mml:mi></mml:math><inline-graphic xlink:href="yang-ieq2-3126631.gif"/></alternatives></inline-formula> then uses this index to effectively identify both similar and dissimilar set pairs based on their update logs. To efficiently build the neighborhood index, we devise several filtering techniques and propose a “lazy-forward” method to reduce the computational cost. In addition, to improve the efficiency on varying workloads, we propose an analytical cost model, and design an online algorithm with performance guarantees to dynamically consolidate the update logs and adapt the neighborhood indexes. We evaluated our method using four real-world datasets. Experimental results show that our approach outperforms existing methods by up to <inline-formula><tex-math notation="LaTeX">$3.7\times$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>3</mml:mn><mml:mo>. </mml:mo><mml:mn>7</mml:mn><mml:mo>×</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="yang-ieq3-3126631.gif"/></alternatives></inline-formula>.
An Example of Code that has Quantum Gain with Two Criteria

1. はじめに 近年,量子情報理論に特有の超加法的量子符号化利得の 実証実験の成功が報告された 。 これは,情報量規準での 量子利得 が得られたことを意味する。 この結果を,信頼 性の高い通信につなげるためには,さらに誤り率を小さくす る必要があるが,従来,情報量規準での利得をもたらす符号 では,誤り率はむしろ劣化してしまうと予想されていた 。 このため,超加法性を示す符号化を行った後,古典的な誤 り訂正符号化を行うことで誤り率の改善を図る,古典-量子 ハイブリッド符号化が提案されている 。 これは 2重の符 号化を行うことになり,その分トータルの符号長は長くなっ てしまう。 しかし,ひとつの符号で超加法性を示すのと同 時に誤り率を減少させるものがあれば,より短い符号長で 量子通信路容量に近い特性を得ることが,期待される。 本 稿では,量子通信路におけるビット誤り率を定義し,誤り率 と情報量の双方の規準で量子利得を有する符号の例を示す。 2. 通信路容量と超加法的量子符号化利得 〈2・1〉 量子通信路と符号長 nの通信路容量 ここで は,古典情報を量子状態によって伝送するモデルを扱う。 {xi|i = 0, 1, · · · , M −1}を送信記号とし,その生起確率を ξiとする。 記号 xiには信号量子状態 ρ̂iが 1対 1に対応し, これを量子測定することにより受信記号 yj が得られる。 一
Online Learning Aided Decentralized Multi-User Task Offloading for Mobile Edge Computing

Mobile edge computing facilitates users to offload computation tasks to edge servers for meeting their stringent delay requirements. Previous works mainly explore task offloading when system-side information is given (e.g., server processing speed, cellular data rate), or centralized offloading under system uncertainty. But both generally fall short of handling task placement involving many coexisting users in an uncertain environment. In this paper, we develop a <italic>multi-user</italic> offloading framework considering <italic>unknown yet stochastic</italic> system-side information to enable a <italic>decentralized user-initiated</italic> service placement under overlapping server coverage. Specifically, we formulate the dynamic task placement as an online multi-user multi-armed bandit process, and propose a decentralized epoch based offloading (DEBO) to optimize user rewards which are subjected under network delay. We consider both cases without and with neighboring edge feedback once users’ tasks are processed, where the latter incorporates system-side information sharing among edge servers for an enhanced task placement. For both cases, we show that DEBO can gradually deduce the optimal user-server assignment during dynamic offloading, thereby achieving a <italic>close-to-optimal</italic> service performance and <italic>tight</italic> <inline-formula><tex-math notation="LaTeX">$O(\log _{2}\! \! T)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mo form="prefix">log</mml:mo><mml:mn>2</mml:mn></mml:msub><mml:mspace width="-0.166667em"/><mml:mspace width="-0.166667em"/><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="ye-ieq1-3275851.gif"/></alternatives></inline-formula> regret. Moreover, we generalize DEBO to various common scenarios such as unknown reward gap, dynamic entering or leaving of clients, and fair reward distribution, while further exploring when users’ offloaded tasks require <italic>heterogeneous</italic> computing resources. Particularly, we accomplish a sub-linear regret for each of these instances. Real measurements based evaluations corroborate the superiority of our offloading schemes over state-of-the-art approaches in optimizing delay-sensitive rewards.
Petrology and geochemistry of Patuxent Range 91501, a clast‐poor impact melt from the L‐chondrite parent body and Lewis Cliff 88663, an L7 chondrite

Abstract— We have performed petrologic and geochemical studies of Patuxent Range (PAT) 91501 and Lewis Cliff (LEW) 88663. PAT 91501, originally classified as an L7 chondrite, is rather a unique, near total impact melt from the L‐chondrite parent body. Lewis Cliff 88663 was originally classified as an “achondrite (? )”, but we find that it is a very weakly shocked L7 chondrite.
A Rigorous Approach to High-Resolution Entropy-Constrained Vector Quantization

The nonnegativity of relative entropy implies that the differential entropy of a random vector X with probability density function (pdf) <inline-formula> <tex-math notation="LaTeX">$f$ </tex-math></inline-formula> is upper bounded by <inline-formula> <tex-math notation="LaTeX">$- {\mathsf {E}}_{}\! \left [{\log g(\text {X})}\right]$ </tex-math></inline-formula> for any arbitrary pdf <inline-formula> <tex-math notation="LaTeX">$g$ </tex-math></inline-formula>. Using this inequality with a cleverly chosen <inline-formula> <tex-math notation="LaTeX">$g$ </tex-math></inline-formula>, we derive a lower bound on the asymptotic excess rate of entropy-constrained vector quantization for <inline-formula> <tex-math notation="LaTeX">$d$ </tex-math></inline-formula>-dimensional sources and <inline-formula> <tex-math notation="LaTeX">$r$ </tex-math></inline-formula>th-power distortion, where the asymptotic excess rate is defined as the difference between the smallest output entropy of a vector quantizer satisfying the distortion constraint and the rate-distortion function in the limit as the distortion tends to zero. Specialized to the one-dimensional case, this lower bound coincides with the asymptotic excess rate achieved by a uniform quantizer, thereby recovering the result by Gish and Pierce that uniform quantizers are asymptotically optimal as the allowed distortion tends to zero. Furthermore, in the one-dimensional case, the derivation of the lower bound reveals a necessary condition for a sequence of quantizers to be asymptotically optimal. This condition implies that any sequence of asymptotically optimal almost-regular quantizers must converge to a uniform quantizer as the distortion tends to zero. While the obtained lower bound itself is not novel, to the best of our knowledge, we present the first rigorous derivation that follows the direct approach by Gish and Pierce without resorting to heuristic high-resolution approximations commonly found in the quantization literature. Furthermore, our derivation holds for all <inline-formula> <tex-math notation="LaTeX">$d$ </tex-math></inline-formula>-dimensional sources having finite differential entropy and whose integer part has finite entropy. In contrast to Gish and Pierce, we do not require additional constraints on the continuity or decay of the source pdf.