检索结果-内蒙古大学图书馆

Improving helpful actions for contingent planning with enforced observations

Journal of computational Information Systems 2013年第7期9卷 2691-2698页

作者： Wei, Wei Ouyang, Dantong Zhao, Xiangfu Zhang, Liming College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China College of Mathematics Physics and Information Engineering Zhejiang Normal University Jinhua 321004 China

We tackle the problem of improving the helpful actions technique for contingent planning. A revision of the heuristic computation that rearranges the relaxed planning graph is proposed, where the unreasonable conformant actions can be excluded from the resulting helpful actions collection and replaced with enforced observation to the belief state. Pruning with the improved helpful actions, we consequently cut all the non-branching plans out of the solution space. Experimental results show that our method brings considerable improvements in both of plan quality and runtime efficiency. Copyright © 2013 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Community mining from complex networks based on loop tightness

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2013年第1期43卷 98-105页

作者： Liu, Da-You Yang, Jian-Ning Yang, Bo Zhao, Xue-Hua Jin, Di College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China School of Computer Science and Engineering Tianjin University Tianjin 300072 China

In this paper, a Loop Tightness Algorithm (LTA) is proposed. First, it finds the network loops and calculates it tightness value quickly. Then, it obtains the communities of the networks based on the tightness values. Finally, it reveals the relationship between the network loops and the community structure. The LTA is tested and validated by means of synthetic networks and real networks.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Field-assisted spin-polarized electron transport through a single quantum well with spin-orbit coupling

引用

Chinese Physics B 2012年第3期21卷 389-394页

作者：丁秀欢张存喜王瑞周运清孔令民 Department of Mathematics Zhejiang Ocean University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Department of Physics Zhejiang Ocean University

We have investigated theoretically the field-driven electron transport through a single-quantum-well semiconductor heterostructure with spin-orbit coupling. The splitting of the asymmetric Fano-type resonance peaks due to the Dresselhaus spin-orbit coupling is found to be highly sensitive to the direction of the incident electron. The splitting of the Fano-type resonance induces the spin-polarization dependent electron current. The location and the line shape of the Fano-type resonance can be controlled by adjusting the energy and the direction of the incident electron, the oscillation frequency, and the amplitude of the external field. These interesting features may be used to devise tunable spin filters and realize pure spin transmission currents.

关键词： Fano resonance Floquet channel spin-orbit coupling

来源：评论

学校读者我要写书评

暂无评论

Fano resonance and wave transmission through a chain structure with an isolated ring composed of defects

引用

Chinese Physics B 2012年第3期21卷 212-217页

作者：张存喜丁秀欢王瑞周运清孔令民 Department of Physics Zhejiang Ocean University Department of Mathematics Zhejiang Ocean University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

We consider a discrete model that describes a linear chain of particles coupled to an isolated ring composed of N defects. This simple system can be regarded as a generalization of the familiar Fano Anderson model. It can be used to model discrete networks of coupled defect modes in photonic crystals and simple waveguide arrays in two-dimensional lattices. The analytical result of the transmission coefficient is obtained, along with the conditions for perfect reflections and transmissions due to either destructive or constructive interferences. Using a simple example, we further investigate the relationship between the resonant frequencies and the number of defects N, and study how to affect the numbers of perfect reflections and transmissions. In addition, we demonstrate how these resonance transmissions and refections can be tuned by one nonlinear defect of the network that possesses a nonlinear Kerr-like response.

关键词： wave transmission Fano resonance defect bistability

来源：评论

学校读者我要写书评

暂无评论

L-priorities Bloom Filter: A New Member of the Bloom Filter Family

引用

International Journal of Automation and computing 2012年第2期9卷 171-176页

作者： Huang-Shui Hu Hong-Wei Zhao Fei Mi College of Computer Science and Technology Jilin University Changchun 130012 PRC Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University Changchun 130012 PRC

A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter （LPBF） as a new member of the Bloom filter （BF） family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.

关键词： Bloom filter bit space matrix false positive L-priorities time and space complexity.

来源：评论

学校读者我要写书评

暂无评论

A parallel scheduling algorithm for reinforcement learning in large state space

引用

Frontiers of Computer Science 2012年第6期6卷 631-646页

作者： Quan LIU Xudong YANG Ling JING Jin LI Jiao LI Institute of Computer Science and Technology Soochow UniversitySuzhou 215006China Department of Computer Science and Technology Nanjing UniversityNanjing 210093China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China

The main challenge in the area of reinforcement learning is scaling up to larger and more complex problems. Aiming at the scaling problem of reinforcement learning, a scalable reinforcement learning method, DCS-SRL, is proposed on the basis of divide-and-conquer strategy, and its convergence is proved. In this method, the learning problem in large state space or continuous state space is decomposed into multiple smaller subproblems. Given a specific learning algorithm, each subproblem can be solved independently with limited available resources. In the end, component solutions can be recombined to obtain the desired result. To ad- dress the question of prioritizing subproblems in the scheduler, a weighted priority scheduling algorithm is proposed. This scheduling algorithm ensures that computation is focused on regions of the problem space which are expected to be maximally productive. To expedite the learning process, a new parallel method, called DCS-SPRL, is derived from combining DCS-SRL with a parallel scheduling architecture. In the DCS-SPRL method, the subproblems will be distributed among processors that have the capacity to work in parallel. The experimental results show that learning based on DCS-SPRL has fast convergence speed and good scalability.

关键词： divide-and-conquer strategy parallel schedule scalability large state space continuous state space

来源：评论

学校读者我要写书评

暂无评论

Learning the structure of dynamic bayesian network with domain knowledge

Learning the structure of dynamic bayesian network with doma...

引用

2012 International Conference on Machine Learning and Cybernetics, ICMLC 2012

作者： Chen, Juan Jia, Haiyang Huang, Yuxiao Liu, Dayou College of Computer Science and Technology Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9781467314855

Dynamic Bayesian Network (DBN) is a graphical model for representing temporal stochastic processes. Learning the structure of DBN is a fundamental step for parameter learning, inference and application. For large scale problem, the structure learning is intractable. In some domains the training data is very limited and noisy, so learning the DBN structure only with training data is impractical. Domain knowledge may improve both the efficiency and the accuracy of the learning algorithm. But usually, the domain knowledge is uncertainty, unclear and even with conflict. This paper presents a novel algorithm for learning the structure of DBN, which consider the data and domain knowledge simultaneously, empirical experiment shows that the proposed algorithm improved the efficiency and the accuracy of the DBN structure learning. © 2012 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Quasi-periodic Solutions of the General Nonlinear Beam Equations

引用

Communications in Mathematical Research 2012年第1期28卷 51-64页

作者： GAO YI-XIAN College of Mathematics and Statistics Northeast Normal University Changchun 130024 Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012

In this paper, one-dimensional （1D） nonlinear beam equations of the form utt - uxx ＋ uxxxx ＋ mu = f （u） with Dirichlet boundary conditions are considered, where the nonlinearity f is an analytic, odd function and f（u） = O（u3）. It is proved that for all m ∈ （0, M＊]  R （M＊ is a fixed large number）, but a set of small Lebesgue measure, the above equations admit small-amplitude quasi-periodic solutions corresponding to finite dimensional invariant tori for an associated infinite dimensional dynamical system. The proof is based on an infinite dimensional KAM theory and a partial Birkhoff normal form technique.

关键词： beam equation KAM theorem quasi-periodic solution partial Birkhoffnormal form

来源：评论

学校读者我要写书评

暂无评论

Algorithmic challenges in structure-based drug design and NMR structural biology

引用

Frontiers of Electrical and Electronic engineering in China 2012年第1期7卷 69-84页

作者： Lincong WANG Shuxue ZOU Yao WANG College of Computer Science and Technology The Joint Center for Systems Biology of Jilin University and the University of Georgia Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineer-ing of Ministry of Education Jilin University Changchun 130012China

The three-dimensional structure of a biomolecule rather than its one-dimensionM sequence determines its biological function. At present, the most accurate structures are derived from experimental data measured mainly by two techniques： X-ray crystallog- raphy and nuclear magnetic resonance （NMR） spec- troscopy. Because neither X-ray crystallography nor NMR spectroscopy could directly measure the positions of atoms in a biomolecule, algorithms must be designed to compute atom coordinates from the data. One salient feature of most NMR structure computation algorithms is their reliance on stochastic search to find the lowest energy conformations that satisfy the experimentally- derived geometric restraints. However, neither the cor- rectness of the stochastic search has been established nor the errors in the output structures could be quantified. Though there exist exact algorithms to compute struc- tures from angular restraints, similar algorithms that use distance restraints remain to be developed. An important application of structures is rational drug design where protein-ligand docking plays a crit- ical role. In fact, various docking programs that place a compound into the binding site of a target protein have been used routinely by medicinal chemists for both lead identification and optimization. Unfortunately, de- spite ongoing methodological advances and some success stories, the performance of current docking algorithms is still data-dependent. These algorithms formulate the docking problem as a match of two sets of feature points. Both the selection of feature points and the search for the best poses with the minimum scores are accomplished through some stochastic search methods. Both the un- certainty in the scoring function and the limited sam- pling space attained by the stochastic search contribute to their failures. Recently, we have developed two novel docking algorithms： a data-driven docking algorithm and a general docking algorithm that does not re

关键词： structure-based drug design （SBDD） vir- tual screening （VC） protein-ligand docking scoring function molecular dynamics （MD） Monte Carlo （MC） simulated annealing （SA） Markov chain Monte Carlo （MCMC） nuclear magnetic resonance （NMR） nuclear Overhauser effect （NOE） residual dipolar couplings （RDCs） chemical shift （CS） inference structure deter- mination （ISD） Bayesian Gibbs sampling probabil- ity distribution functions （PDFs） degrees of freedom （DOF） van der Waals （VDW） root mean square devi- ation （RMSD） manifold Poisson-Boltzmann equation （PBE）

来源：评论

学校读者我要写书评

暂无评论

Speech separation in the vehicle environment based on fastICA algorithm

引用

Journal of Multimedia 2012年第1期7卷 33-40页

作者： Zhang, Jindong Qin, Guihe Liu, Ye College of computer science and technology Jilin University Changchun China Key Laboratory of Symbol Computation Knowledge Engineering of the Ministry of Education Changchun China

The speech interaction in-vehicle was mainly realized by the speech recognition. The human-machine interaction around was usually disturbed by the noise, and the speech received by the receiver was not the original pure speech, so compared to the pure environment, the accuracy of the speech recognition declined so sharply that it could not meet the demand of the practical application of human- machine interaction. So the speech recognition was required to have the strong adaptability and processing capacity to the speech with noise. In this paper, the FastICA algorithm in signal process and statistics was studied and used to separate the driver's speech in the vehicle environment, and realizes the pretreatment in recognizing driver's speech. The effectiveness of the method had been validated in actual vehicle experimental configuration. © 2012 Academy Publisher.

关键词： Speech processing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：