Search

This paper introduces new perspectives on analog design space search. To minimize the time-to-market, this endeavor better cast as constraint satisfaction problem than global optimization defined in prior arts. We incorporate model-based agents, contrasted with model-free learning, to implement a trust-region strategy. As such, simple feed-forward networks can be trained with supervised learning, where the convergence is relatively trivial. Experiment results demonstrate orders of magnitude improvement on search iterations. Additionally, the unprecedented consideration of PVT conditions are accommodated. On circuits with TSMC 5/6nm process, our method achieve performance surpassing human designers. Furthermore, this framework is in production in industrial settings., Comment: 6 pages, 3 figures, 5 tables

In this paper, we present a deep reinforcement learning method for quadcopter bypassing the obstacle on the flying path. In the past study, the algorithm only controls the forward direction about quadcopter. In this letter, we use two functions to control quadcopter. One is quadcopter navigating function. It is based on calculating coordination point and find the straight path to the goal. The other function is collision avoidance function. It is implemented by deep Q-network model. Both two function will output rotating degree, the agent will combine both output and turn direct. Besides, deep Q-network can also make quadcopter fly up and down to bypass the obstacle and arrive at the goal. Our experimental result shows that the collision rate is 14% after 500 flights. Based on this work, we will train more complex sense and transfer model to the real quadcopter., Comment: conference

The magnetic ground state of the quasi-one-dimensional spin-1 antiferromagnetic chain is sensitive to the relative sizes of the single-ion anisotropy ($D$) and the intrachain ($J$) and interchain ($J'$) exchange interactions. The ratios $D/J$ and $J'/J$ dictate the material's placement in one or other of three competing phases: a Haldane gapped phase, a quantum paramagnet and an XY-ordered state, with a quantum critical point at their junction. We have identified [Ni(HF)$_2$(pyz)$_2]$SbF$_6$, where pyz = pyrazine, as a candidate in which this behavior can be explored in detail. Combining neutron scattering (elastic and inelastic) in applied magnetic fields of up to 10~tesla and magnetization measurements in fields of up to 60~tesla with numerical modeling of experimental observables, we are able to obtain accurate values of all of the parameters of the Hamiltonian [$D = 13.3(1)$~K, $J = 10.4(3)$~K and $J' = 1.4(2)$~K], despite the polycrystalline nature of the sample. Density-functional theory calculations result in similar couplings ($J = 9.2$~K, $J' = 1.8$~K) and predict that the majority of the total spin population of resides on the Ni(II) ion, while the remaining spin density is delocalized over both ligand types. The general procedures outlined in this paper permit phase boundaries and quantum-critical points to be explored in anisotropic systems for which single crystals are as yet unavailable.

Suppose F and G are two life distribution functions. It is said that F is more IFRA than G (written by F<_* G) if G^(-1) F(x) is starshaped on (0,infty). In this paper, the problem of testing H_0:F=_* G against H_1:F<_* G and F \neq_* G is considered in both cases when G is known and when G is unknown. We propose a new test based on U-statistics and obtain the asymptotic distribution of the test statistics. The new test is compared with some well known tests in the literature. In addition, we apply our test to a real data set in the context of reliability.

In this paper, it is demonstrated that the DNA-based algorithm [Ho et al. 2005] for solving an instance of the clique problem to any a graph G = (V, E) with n vertices and p edges and its complementary graph G1 = (V, E1) with n vertices and m = (((n*(n-1))/2)-p) edges can be implemented by Hadamard gates, NOT gates, CNOT gates, CCNOT gates, Grover's operators, and quantum measurements on a quantum computer. It is also demonstrated that if Grovers algorithm is employed to accomplish the readout step in the DNA-based algorithm, the quantum implementation of the DNA-based algorithm is equivalent to the oracle work (in the language of Grover's algorithm), that is, the target state labeling preceding Grover,s searching steps. It is shown that one oracle work can be completed with O((2 * n) * (n + 1) * (n + 2) / 3) NOT gates, one CNOT gate and O((4 * m) + (((2 * n) * (n + 1) * (n + 14)) / 6)) CCNOT gates. This is to say that for the quantum implementation of the DNA-based algorithm [Ho et al. 2005] a faster labeling of the target state is attained, which also implies a speedy solution to an instance of the clique problem.

This study investigated the communication styles of 5 mentors in telementoring a class of 33 preservice teachers. Electronic forum was the instrument of communication between the mentors and the students, and a Web-based computer mediated communication system was used to facilitate the instruction in the course. Data collected in an 8-week period resulted in 52 mentors initiating discussion threads and 43 follow-up posts. Analysis of the 5 mentors' 52 initial thread generating posts revealed 4 styles: the direct questioning, context explaining, experience sharing, and greeting styles. It was found that the five mentors most often posted a question in straightforward fashion (direct questioning). Context explaining was also used quite often. On the follow-up posts, it was found that 6 categorical styles exist among the 43 posts: the direct answering, suggesting, agreeing, summarizing, relating, and questioning styles. In this study, the agreeing, the relating, and the direct answering styles were used most often. It seemed that the follow-up posts in these three styles were easier to generate. (Contains 11 references.) (AEF)