查询词典 propose a toast

Hence we first propose a globally optimized random search algorithm and prove its asymptotic global convergence; then to improve its convergence velocity and reduce implementation complexity, we propose a practical sub-optimal random search algorithm and analyze its implementation complexity.

为此本文首先给出了一种用于OFDM符号估计的全局最优随机搜索方法，并证明了其渐进全局收敛特性；同时为了改进全局最优的随机搜索算法的收敛速度和实现复杂度，提出了一种可实现的次优的随机搜索算法，并结合实现分析了所提的次优随机算法的计算复杂度。

You can also choose to propose your own topic . In this case, the project work should be distinct from your thesis work, and you should send us a one-page description of what you propose to do.

你也可以选择自己提出的主题，在这个情况下，专题必须与你的毕业论文不同，并且需预先交给我一页你提议要做题目的描述。

To propose plans for wage adjustment and bonus distribution and important rules and regulations, and refer them to the staff and workers' congress for examination and approval; to propose programmes for the use of the welfare fund and make suggestions regarding such other matters as are important for the well-being and benefits of the staff and workers, and to refer them to the staff and workers' congress for deliberation and decision; and

提出工资调整方案、奖金分配方案和重要的规章制度，提请职工代表大会审查同意。提出福利基金使用方案和其他有关职工生活福利的重大事项的建议，提请职工代表大会审议决定。

We present an efficient approach for generating the correspondence between two homeomorphic 3D polyhedral models. The user can select vertices on the polyhedra to decompose the boundary of each polyhedron into the same number of morphing patches. Further, the user can specify the feature points on the morphing patch pairs to improve the morph. After the morphing patch pairs are be mapped to 2D regular polygons, they are merged and reconstructed to generate a morph. In the main procedures of our approach, we propose an easy mapping method and a foldover-free warping technique. And we also propose a most efficient merging algorithm. The merging can be completed in O.

我们的对应演算法主要的流程架构是(1)设计一套良好的介面提供给使用者在物体表面上点选圈选点；(2)利用最短路径将圈选点作两两相连，以切割勿体表面；(3)利用Relaxation的方式进行摊平的目的；(4)利用Warping技术以增进使用者的便利性，因此无须圈选太多快patch以精确对齐物体的特徵，同时还提供一套自行避免相交情况的演算法以保证不相交；(5)我们研发出一套极快速的merge演算法，其利用最小轮廓涵盖结构而有效地达成区域搜寻与区域merge，因此在效率上达到O；(6)最后藉由Remesh与3D位置资讯的建立，重构出对应的结果整体而言，透过本论文所研发的对应演算法将不用花费太多的执行时间，因此符合经济效益。

The speciality to let several coefficients of S-M algorithm are analyzed;(2) We first propose the nonlinear and adaptive prediction model based on several closest neighbors and extend the method to multistep prediction;(3) We first exploit Empirical Mode Decomposition technology to predict hopping frequency codes, it is namely that a complex time series is decomposed as several Intrinsic Mode Functions easy to prediction, then predict these IMF respectively, at last reconstruct estimated values of the time series;(4) We exploit the above prediction model validate effect while there are omitted data in observed time series and propose the corresponding resolve.

1具体分析了S-M算法中几个参数设置的特点；(2)首次提出了基于邻近点的非线性自适应预测模型，同时将这种算法推广到多步预测；(3)首次采用经验模态分解技术预测跳频码，即将一个复杂难以预测的时间序列分解为几个相对容易预测的本征函数，然后分别预测这些本征函数，最后重构出时间序列的估计值；(4)应用基于邻近点的非线性自适应预测模型验证了观测时间序列存在数据缺损时的预测效果，并提出了相应的解决办法。

As a result, there are no specific advantages of processing signals in frequency domain, and we propose to directly process signals in time domain. By this way, it is observed that in time domain the signal signatures can be arranged into groups of orthogonal components, leading to a very natural group-wise symbol recovery scheme. To realize this figure of merit, we propose a GSC-based receiver, which also takes into account the mitigation of channel mismatch effects caused by the channel temporal variation and the imperfect estimation.

因此，吾人提出直接於时域中处理讯号，於时域中，吾人发现讯号特徵矩阵能够被分为数个拥有正交元素的群组，能自然地被用来设计群组式讯号侦测技术，为了实现此特性吾人提出一个GSC接收机，其能同时抑制通道时间变化与通道估计错误所产生之通道偏差效应。

Furthermore, we propose and implement multilevel circuit partitioner. The achievements of the dissertation are as follows: During the coarsening phase, we propose thecore-sorted heavy-edge matching algorithm and give its details based on the compressed storage format of graph.

本文主要的工作和创新点有以下四个方面：在多水平粗化阶段提出了一种基于核排序的重边匹配算法，给出了基于图压缩存储格式的算法实现细节。

Propose a real-time expanding scheme for UNIX System V. Propose and design a new time-and-priority driven process scheduling strategy, which can unify real-time process, kernel process and time-sharing process for scheduling. Design a new concurrence control strategy for UNIX, which can support priority inheritance. Add the sequential file operations to the UNIX random file system and design a high accuracy clock timer.

对UNIX System V提出了一套实时扩充方案，提出并设计了一种新的基于时间和优先数两者驱动的进程调度策略，对实时进程、核心进程和分时进程统一调度；设计了一种新的允许继承进程优先数的并发控制策略；在UNIX随机文件系统的基础之上扩充了连续文件操作；并且设计了高精度的时钟处理程序。

We propose and analyze an experimental scheme for studying the self-scanning effects of Ce: BaTiO〓 phase conjugator. Then we propose a tunable experimental scheme for P567 laser output using self-scanning effect.

提出了研究Ce：BaTiO〓自扫描特性的实验方案，设计并讨论了利用自扫描效应进行固态P567激光调谐的实现方案。

The study of the ENFES system and its application We propose a two-level structured model which combines and integrates the four knowledge processing methods、the knowledge acquiring methodes、the knowledge inference stratigies and the methodes of knowledge base maintainment are propose and realized for this system.

基于遗传算法和神经网络的模糊专家系统的体系及应用研究我们提出一种基于遗传算法、神经网络的模糊专家系统的层次结构，这种结构可以增强系统的健壮性；讨论了在这种综合集成的系统中知识获取方法、推理策略以及知识库的维护与求精方法。

We are in a good position to meet your requirements.

我们完全可以满足你方的需求。

We are all pervade d with a sense of disaster.

我们普遍有大祸降临的感觉。