浅谈家用吊扇的调速方法

家用吊扇的核心部分是单相异步电动机,此绕组如图1,有一主绕组(工作绕组)与一串联电容器C的副绕组(启动绕组)相并联.这样做可使二绕组的电流在相位上相差90°,从而形成旋转磁场.转子的转动过程与三相异步电动机相似.     

Fabrication of Dicing-Free Vertical-Structured High-Power GaN-Based Light-Emitting Diodes With Selective Nickel Electroplating and Patterned Laser Liftoff Techniques

Through the use of selective nickel (Ni) electroplating, patterned laser liftoff technique, and surface roughing of the top n-GaN epilayer, a novel process for the fabrication of vertical-structured metal-substrate GaN-based light-emitting diodes (VM-LEDs) to avoid difficulties in Ni substrate dicing and improve device yield was proposed and demonstrated. In conjunction with a sidewall passivation with SiO₂ and keeping the size of epilayer smaller than that of Ni island, a considerable improvement in yield and device performance were shown. As compared to conventional lateral-structured GaN-based LEDs, VM-LEDs show an increase in light output power about 174% at 350 mA with a significant decrease in forward voltage from 3.5 to 3.17 V     

A novel broadcast scheduling strategy using factor graphs and the sum-product algorithm

This paper presents a novel self-organizing distributed algorithm for finding a broadcasting schedule in a packet radio network via only local collaborative interactions among neighboring network stations. Inspired by the huge success of the low density parity check (LDPC) codes in the field of error control coding, we transform the broadcast scheduling problem (BSP) into an LDPC-like problem through a factor graph. In the proposed algorithm, the constraint rules of the BSP are divided into many simple local rules, each of which is enforced by a local processing unit in the factor graph. The soft-information, describing the probability that each station will transmit a data packet, is then efficiently exchanged among the local processing units by using the sum-product algorithm to iteratively optimize the broadcasting schedule. Simulation results indicate that the proposed algorithm performs better than the other existing central-processing algorithms in terms of the channel utilization and the average packet delay. This is true especially when the network scenario is very complex. Furthermore, the proposed algorithm is both low in complexity and completely distributed, which makes it suitable for implementation in practical network applications.     

Controlled Synthesis of Ag2S,Ag2Se,and Ag Nanofibers by Using a General Sacrificial Template and Their Application in Electronic Device Fabrication

Nanofiber bundles of Ag₂S, Ag₂Se, and Ag have been successfully synthesized by making use of Ag₂C₂O₄ template nanofiber bundles, utilizing both anion‐exchange and redox reactions. The obtained bundles were polycrystalline nanofibers composed of nanoparticles in which the precursor morphology was well‐preserved, indicating that Ag₂C₂O₄ nanofiber bundles acted as a general sacrificial template for the synthesis of silver‐based semiconductor and metal nanofibers. Dispersing media and transforming reactants were found to be key factors influencing the chemical transformation in the system. In particular, separate single‐crystalline Ag nanofibers were obtained via a nontemplate route when ascorbic acid was used as a relatively weak reductant. An electrical transfer and switching device was built with the obtained Ag₂S and Ag nanofiber bundles, utilizing the unique ion‐conductor nature of Ag₂S and revealing their potential applications in electronics.     

Structural and Superconducting Property Variations with Nominal Mg Non‐Stoichiometry in MgxB2 and Its Enhancement of Upper Critical Field

By applying a combination of characterisation tools, changes in structural and superconducting properties with nominal Mg non‐stoichiometry in Mg_xB₂ are found. The non‐stoichiometry produces enhanced in‐field critical current densities (J_c's) and upper critical field / irreversibility field (H_c2/H_irr(T)) values. Upper critical fields of ～ 21 T (4.2 K) were obtained in nominal Mg‐deficient samples compared to ～ 17 T (4.2 K) for near‐stoichiometric samples.     

Investigation on Single-Mode–Multimode– Single-Mode Fiber Structure

This paper presents an investigation on a single-mode-multimode-single-mode fiber structure. A one-way guided-mode propagation analysis for the circular symmetry waveguide is employed to model the light propagation and the approximated formulations are derived and evaluated concerning the accuracy. Phase conjunction of the multimode interference within the fiber structure is revealed. A simple way to predict and analyze the spectral response of the structure is presented through the space to wavelength mapping with the derived approximated formulations. The prediction of spectral response is verified numerically and experimentally.     

"单摆"课程小结

课程小结是教学的重要环节，画龙点晴的课程小结可起到梳理要点，迁移知识，归纳总结的作用．课程小结重在概括精炼，条理清晰，有利学生理性认识的形成．现以单摆为例，浅谈一下教学的课程小结，小结可在学生归纳总结的基础上，由教师再做系统的总结．     

3-D MCM封装技术及其应用

介绍了超大规模集成电路（VLSI）用的3-D MCM封装技术的最新发展，重点介绍了3-D MCM封装垂直互连工艺，分析了3-D MCM封装技术的硅效率、复杂程度、热处理、互连密度、系统功率与速度等问题，并对3-D MCM封装的应用作了简要说明。     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.