对《法规语病例析》的几点补正

本文对本刊 1 999年第 4期发表的《法规语病例析》一文作一些补充和辩正。

高职院校“建设工程法规”课程思政的探索与实践——以工程造价专业为例

为落实加强党对职业教育工作的全面领导,实现职业技能和职业精神培养高度融合的要求,“建设工程法规”课程的教学内容决定了教师必须承担起学生法治精神培养等思想政治教育的任务,积极探索课程思政开展的具体方式方法,落实立德树人根本任务。针对高职院校工程造价专业,对“建设工程法规”的思政入课实践方法和教学设计展开探索,基于互动教学,列举主要章节思政元素如何与知识和技能相结合,实现职业能力和职业素质双融合培养。

从《法规汇编》看中国电信业的发展

打开前不久出版的、厚厚的《中华人民共和国信息产业法规汇编）简称《法规汇编》跳入眼帘的不仅仅是那密密麻麻的、一个个带有文号的国务院、信息产业部的文件，更主要的是从这些文件的字里行间，看到了中国电信业改革发展的历史画卷。此画卷虽看不到刀光剑影的激战，闻不到战火硝烟的气味，却映射出中国电信业改革发展那不寻常的历程和脉络。

Vehicle routing optimization algorithm based on time windows and dynamic demand

To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.

Regulatory Impact Assessment of the EU Digital Market Surveillance and Chinese Response Plan

As a data protection legislation with the dual objectives of market regulation and government supervision,the EU General Data Protection Regulation(GDPR)is designed to promote the cultivation of a market for data ele⁃ments and to regulate the data processing subjects'behaviour.The civil legal norms to participate in the data market regulation are introduced,and a right-protected mode with the obligation norms of data controllers as the core is started by GDPR.However,from the perspective of GDPR's global enforcement effectiveness,as an export-orientated global standard and protection framework,the power regulation model of the EU's single digital market is facing the in⁃novative incentives of data market expansion and the tension of human rights protection.A more modest and moderate data governance regulation model has been opened by a new round of the EU digital market regulation.The legal sce⁃narios transition and digital platforms regulation more fit the regulatory demand and development goals of global digital economy development.The EU's determination to enhance the global digital market share and competitiveness is dem⁃onstrated.For China,the impact and security risks of the new round should be evaluated carefully,drawing on the ex⁃perience of the technical standpoint and institutional framework and regulatory rules of the EU digital market regula⁃tion,providing the regulatory models and Chinese solutions to respond to the EU digital market regulation,and enhanc⁃ing Chinese institutional discourse and rule-making leadership in the global digital economy.

和制汉语法律新名词在近代中国的翻译与传播--以清末民初若干法律辞书收录的词条为例

近代中文法律新名词多从日语翻译而来,且大多直接借用和制汉语的书写形式,其辗转形成的轨迹是西方法律词语的跨语际实践过程。清朝末年及民国初年的法律辞书编纂之于现代汉语法律译名的形成及变迁的意义在于,作为时代语言的记录者,它们在内容上较为真实客观地反映了西方法律词语传入中国时的最初汉语形态。法律辞书是法律译名在现代法学话语体系中获得合法性的证据或证明。研究近代史上法律辞书编纂、法律译名的中国化及新旧法律名词之间的冲突问题,对消解今日辞书中法律译名的不统一和失范问题,仍具借鉴价值。

A NEW MODEL AND SOLUTION FOR TRANSPORTATION PROBLEM

Transportation problem has many real world applications, it can be solved by linear programming model, but in most time the model exists more for less paradox, this paper considers the reasons for the paradox and search the way to eliminate the phenomenon. First this paper formulates a loose constrained linear programming model for the transportation problem, and gives the definition of the paradox which exists in it, some preliminary notions and one example is also given. Then it gives a table based algorithm for the loose constrained model, the steps of the algorithm and example will follow. The examples show that: (1) It is not a contradictory that transportation problem exists more for less paradox. (2) The loose constrained model is better used in practice for its less total cost. (3) The algorithm is easy to calculate, to study and highly speed to convergence. Finally, comparied with other ways it shows that the loose constrained model can thoroughly eliminate the paradox.

THREE-DIMENSIONAL TRAJECTORY OPTIMIZATION WITH DIRECT METHOD

The principle of direct method used in optimal control problem is introduced. Details of applying this method to flight trajectory generation are presented including calculation of velocity and controls histories. And capabilities of flight and propulsion systems are considered also. Combined with digital terrain map technique, the direct method is applied to the three dimensional trajectory optimization for low altitude penetration, and simplex algorithm is used to solve the parameters in optimization. For the small number of parameters, the trajectory can be optimized in real time on board.

An Efficient Approach to Rules-Based Optical Proximity Correction

A new approach for rules-based optical proximity correction is presented.The discussion addresses on how to select and construct more concise and practical rules-base as well as how to apply that rules-base.Based on those ideas,several primary rules are suggested.The v-support vector regression method is used to generate a mathematical expression according to rule data.It enables to make correction according to any given rules parameters.Experimental results demonstrate applying rules calculated from the expression match well with that from the rule table.

Application Comparison of Association Rules and C4.5 Rules in Land Evaluation

Association rules and C4.5 rules can overcome the shortage of the traditional land evaluation methods and improve the intelligibility and efficiency of the land evaluation knowledge.In order to compare these two kinds of classification rules in the application,two fuzzy classifiers were established by combining with fuzzy decision algorithm especially based on Second General Soil Survey of Guangdong Province.The results of experiments demonstrated that the fuzzy classifier based on association rules obtain a higher accuracy rate,but with more complex calculation process and more computational overhead;the fuzzy classifier based on C4.5 rules obtain a slightly lower accuracy,but with fast computation and simpler calculation.

Measuring technical efficiency of Chinese nonferrous metals enterprises on a background of industry consolidation

Since 2009, Chinese nonferrous metals industry has been carried out industry consolidation with strong support by the central government. This work examined technical efficiency of Chinese nonferrous metals firms and its change during the period of 2007 and 2011. Based on financial data from nonferrous metals listed companies, technical efficiency of nonferrous metal minerals mining firms and nonferrous metal smelting, pressing and processing firms was estimated respectively using the data envelopment analysis （DEA） method. It was found that, in both sectors, number of pure technical and scale inefficient firms dominated over efficient ones. Overall, their technical and scale efficiency tended to be very low after 2009. In particular, efficiency scores of nonferrous metal smelting, pressing and processing firms fluctuated greatly during the research period. And a limited number of large leading firms were able to maintain 100% efficiency score in the industry, while efficiency of most of other leading firms has declined since 2009.

Path Planning Algorithm for Car-like Robot and Its Application

The problem of path planning is studied for t he case for a mobile robot moving in a known environment. An aggressive algorith m using a description of the obstacles based on a neural network is proposed. Th e algorithm allows to construct an optimal path which is piecewise linear with c hanging directions of the obstacles and the calculation speed for the proposed a lgorithm is comparatively fast. Simulation results and an application to a car_l ike robot 'Khepera' show the effectiveness of the proposed algorithm.

More efficient ontology matching algorithm for integrating heterogeneous web resources

To improve the performance of the ontology matching process, a more efficient ontology matching algorithm, which can effectively eliminate unnecessary operations of matching entities, is proposed. By the theoretical analysis and proof, a set of matching rules are summarized for depicting inherent relations among matching results of entities. Based on these rules, the proposed algorithm can reuse the matching results of two entities to directly determine the matching results of their adjacent entities. Thereby, redundant operations of matching adjacent entities can be avoided, which can improve the performance of the whole matching process. The experimental results show that, compared with related algorithms, the proposed algorithm has high matching accuracy and can remarkably reduce the consuming time of the whole matching process. So, the proposed algorithm is more competent for the large-scale ontology matching which often occurs in the practical heterogeneous web resources integration project.

A Modified Algorithm for Nonliear Integer Programming

Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.

违宪审查制度起步

刚刚修订的法规备案审查工作程序向建立违宪审查制度迈出了重要的一步，但前路依然山重水复。

备考物业管理师的策略及方法

作为物业人对＂贵在坚持＂体会最深,太多的事例证明成功更多的是源于不放弃。因此,要用永不言弃、持之以恒的心态来面对困难。

METHOD FOR BRIDGE BEARING CAPACITY ASSESSMENT BASED ON ANALYTIC HIERARCHY PROCESS

By analyzing the existing methods for the bridge bearing capacity assessment, an analytic hierarchy pro cess estimation model with a variable weight and fuzzy description is proposed based on the nondestructive infor mation. Considering the actual strength, the bearing capacity is first calculated from its design state, and then modified based on the detection information. The modification includes the section reduction and the structure deterioration. The section reduction involves the concrete section and the steel cross-section reduction. The structure deterioration is decided by six factors, i.e. , the concrete surface damage, the actual concrete strength, the steel corrosion electric potential, the chloride ion content, the carbonization depth, and the protective layer depth. The initial weight of each factor is calculated by the expert judgment matrix using an analytic hierarchy process. The consistency approximation and the error transfer theory are used. Then, the variable weight is in- troduced to expand the influences of factors in the worse state. Finally, an actual bridge is taken as an example to verify the proposed method. Results show that the estimated capacity agrees well with that of the load test, thus the method is objective and credible

HIERARCHICAL ITERATIVE GA FOR OPTIMIZATION OF THE PLAN IN COAL MINE CONSTRUCTION

In coal mine construction,to make the optimal plan of complete sets of equipment needs to set up a mixed integer nonlinear programming model,which has many variables and more complicated parameters to set.The problem could hardly be solved using general methods.In this paper a new genetic approach—the hierarchical iterative genetic algorithm (HIGA) was designed to solve it and a satisfactory solution was obtained.

New rank learning algorithm

To overcome the limitation that complex data types with noun attributes cannot be processed by rank learning algorithms, a new rank learning algorithm is designed. In the learning algorithm based on the decision tree, the splitting rule of the decision tree is revised with a new definition of rank impurity. A new rank learning algorithm, which can be intuitively explained, is obtained and its theoretical basis is provided. The experimental results show that in the aspect of average rank loss, the ranking tree algorithm outperforms perception ranking and ordinal regression algorithms and it also has a faster convergence speed. The rank learning algorithm based on the decision tree is able to process categorical data and select relative features.