Query：
学者姓名：姚仰光
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
The polarization state of transmitted light is linked to liquid crystal (LC) molecular distribution. The dynamic behavior of a twisted nematic LC molecule is measured with a home-built 10 kHz snapshot polarimeter. Only the transient molecule rotations are observed when the external voltage changes, and the molecules return to their original orientations quickly even when high voltage is applied. Our observations cannot be attributed to the traditional electro-optic effect. The invalidation of the static external field indicates the shielding effect of redistributing impurity ions in an LC cell.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ma, Jing , Xu, Canhua , Yao, Yangguang . Real-time observation of liquid crystal molecular directions based on a snapshot polarimeter [J]. | CHINESE OPTICS LETTERS , 2017 , 15 (6) . |
| MLA | Ma, Jing 等. "Real-time observation of liquid crystal molecular directions based on a snapshot polarimeter" . | CHINESE OPTICS LETTERS 15 . 6 (2017) . |
| APA | Ma, Jing , Xu, Canhua , Yao, Yangguang . Real-time observation of liquid crystal molecular directions based on a snapshot polarimeter . | CHINESE OPTICS LETTERS , 2017 , 15 (6) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
We present a method of single-shot polarization state measurement based on a birefringent crystal wedge. The phase delay and amplitude angle of detected light are encoded into two groups of fringes through the interference in a crystal wedge and further decoded by fringe position locations. This method has the merit of real-time measurement, a compact set-up and simple calibration. The principle, set-up, calibration and error analysis are presented in details. In the end, a single-shot measurement set-up with 80 kHz temporal resolution is demonstrated to investigate the molecule dynamic behaviour in a TN liquid crystal under a rectangular voltage.
Keyword ：
birefringent crystal wedge birefringent crystal wedge interference fringe interference fringe Light polarization measurement Light polarization measurement real-time measurement real-time measurement
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ma, Jing , Pei, Liyan , Xu, Canhua et al. Real-time polarization state measurement based on a birefringent crystal wedge [J]. | JOURNAL OF MODERN OPTICS , 2016 , 63 (21) : 2291-2297 . |
| MLA | Ma, Jing et al. "Real-time polarization state measurement based on a birefringent crystal wedge" . | JOURNAL OF MODERN OPTICS 63 . 21 (2016) : 2291-2297 . |
| APA | Ma, Jing , Pei, Liyan , Xu, Canhua , Yao, Yangguang . Real-time polarization state measurement based on a birefringent crystal wedge . | JOURNAL OF MODERN OPTICS , 2016 , 63 (21) , 2291-2297 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
本发明涉及信号采集技术领域，特别是一种利用低频采集卡采集脉冲信号的方法，将采集卡上的n路采集信道配置为k路全频率采集信道和n-k路分频率采集信道，当需要采集脉冲信号时，在一段时间间隔t中，将采集卡的最大采样频率全部分配给所述k路全频率采集信道中的s路，循环┌k/s┐次，完成k路全频率采集信道中所有脉冲信号的采集，其中，s≥1，┌k/s┐表示对k/s的值向上取整；如果采集的是普通低频信号，则将最大采样频率分配给n-k路分频率采集信道，采集所述n-k路分频率采集信道中的普通低频信号。该方法不仅可以采集较高频率信号尤其是脉冲信号，而且节省资源，投入成本小，使用效果好。
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 汪璟玢 , 董书暕 , 姚仰光 . 利用低频采集卡采集脉冲信号的方法 : CN201310346011.0[P]. | 2013/8/10 . |
| MLA | 汪璟玢 et al. "利用低频采集卡采集脉冲信号的方法" : CN201310346011.0. | 2013/8/10 . |
| APA | 汪璟玢 , 董书暕 , 姚仰光 . 利用低频采集卡采集脉冲信号的方法 : CN201310346011.0. | 2013/8/10 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A depth-first search (DFS) algorithm requires much less memory than breadth-first search (BFS) one. However, the former doesn't guarantee to find the shortest path in the VLSI (Very Large Integration Circuits) wire routing when the latter does. To remedy the shortcoming of DFS, this paper attempts to improve the DFS algorithm for VLSI wire routing by introducing a method of pruning and iterative deepening. This method guarantees to find all of the existing shortest paths with the same length in the VLSI wire routing to provide the wire routing designers more options for optimal designs.
Keyword ：
Depth-first search Depth-first search Iterative deepening Iterative deepening Pruning Pruning Shortest paths Shortest paths Wire routing Wire routing
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Deng, Xinguo , Yao, Yangguang , Chen, Jiarui . Improving Depth-First Search Algorithm of VLSI Wire Routing with Pruning and Iterative Deepening [C] . 2011 : 100-, . |
| MLA | Deng, Xinguo et al. "Improving Depth-First Search Algorithm of VLSI Wire Routing with Pruning and Iterative Deepening" . (2011) : 100-, . |
| APA | Deng, Xinguo , Yao, Yangguang , Chen, Jiarui . Improving Depth-First Search Algorithm of VLSI Wire Routing with Pruning and Iterative Deepening . (2011) : 100-, . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A depth-first search (DFS) algorithm requires much less memory than breadth-first search (BFS) one. However, the former doesn't guarantee to find the shortest path in the VLSI (Very Large Integration Circuits) wire routing when the latter does. To remedy the shortcoming of DFS, this paper attempts to improve the DFS algorithm for VLSI wire routing by introducing a method of pruning and iterative deepening. This method guarantees to find all of the existing shortest paths with the same length in the VLSI wire routing to provide the wire routing designers more options for optimal designs. © 2011 Springer-Verlag.
Keyword ：
Artificial intelligence Artificial intelligence Graph theory Graph theory Iterative methods Iterative methods Routing algorithms Routing algorithms VLSI circuits VLSI circuits Wire Wire
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Deng, Xinguo , Yao, Yangguang , Chen, Jiarui . Improving depth-first search algorithm of VLSI wire routing with pruning and iterative deepening [C] . 2011 : 100-107 . |
| MLA | Deng, Xinguo et al. "Improving depth-first search algorithm of VLSI wire routing with pruning and iterative deepening" . (2011) : 100-107 . |
| APA | Deng, Xinguo , Yao, Yangguang , Chen, Jiarui . Improving depth-first search algorithm of VLSI wire routing with pruning and iterative deepening . (2011) : 100-107 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A breadth-first search (BFS) algorithm usually needs less time but consumes more computer memory space than a depth-first search (DFS) algorithm to find the shortest path between two nodes. This paper attempts to combine BFS with DFS algorithms to find all shortest paths in the VLSI (Very Large Integration Circuits) wire routing. BFS is used to compute the shortest distance between every position and the start one. DFS is used to traverse all shortest paths in the course of backtracking from the end position to the start one. The effectiveness of the method is proved by the theoretical analysis and the experiment results. © 2010 IEEE.
Keyword ：
Graph theory Graph theory Routing algorithms Routing algorithms VLSI circuits VLSI circuits Wire Wire
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Deng, Xinguo , Yao, Yangguang , Chen, Jia et al. Combining breadth-first with depth-first search algorithms for VLSI wire routing [C] . 2010 : V6482-V6486 . |
| MLA | Deng, Xinguo et al. "Combining breadth-first with depth-first search algorithms for VLSI wire routing" . (2010) : V6482-V6486 . |
| APA | Deng, Xinguo , Yao, Yangguang , Chen, Jia , Lin, Yufeng . Combining breadth-first with depth-first search algorithms for VLSI wire routing . (2010) : V6482-V6486 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
本文在分析计算机控制的简单流程的基础上,给出了具有一定通用性和灵活性的流程模型.该模型利用XML的丰富表达能力和扩展功能,设计了流程的永久性保存机制;在流程的数据结构设计中,设计模式的使用使得流程模型中各个模块形成了松散耦合的结构,易于流程模型的开发和维护.
Keyword ：
XML XML 设计模式 设计模式
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 姚仰光 , 邓新国 . 基于模式的简单流程控制模型 [J]. | 福建电脑 , 2009 , 25 (9) : 114-115 . |
| MLA | 姚仰光 et al. "基于模式的简单流程控制模型" . | 福建电脑 25 . 9 (2009) : 114-115 . |
| APA | 姚仰光 , 邓新国 . 基于模式的简单流程控制模型 . | 福建电脑 , 2009 , 25 (9) , 114-115 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
