读史札记数则

一、交州之名与实西汉末平帝时,秉政的王莽奏请:'汉家地广二帝三王,凡十(三)[二]州,州名及界多不应经。……汉家廓地辽远,州牧行部,远者三万余里,不可为九。谨以经义正十二州名分界,以应正始。'~①王莽泥古,一切制度要以经义为本,州部之制同样如此,故提出'以经义正十二州名'。

张柏然先生学术轶事数则

2017年5月26日是一个令人悲痛的日子,我的恩师张柏然先生不幸离世,驾鹤西游。当天上午我去江苏省人民医院看望先生,他还如往日一般,意识清醒,挥手跟我打招呼。没想到,我中午刚刚回去不久,就传来先生辞世的噩耗。惊闻这一晴天霹雳,我和妻子呆坐在办公室,半天没有缓过神来。跟随张虹师姐护送恩师骨灰回武进时,或许受老家话的刺激,

梅开梨园氍毹称王 戏摄影片银幕争光——忆电影《生死恨》往事数则

沪上徐园第二任主人徐凌云之孙徐希博,因家族关系白小与海派京昆界大师及电影界人士交往甚密。本文为徐希博对有关电影《生死恨》的相关人物及往事的回忆,由臧增嘉先生代为整理。

Several Classes of Two-weight or Three-weight Linear Codes and Their Applications

Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].

Normalized edge detection, and the horizontal extent and depth of geophysical anomalies

Edge detection is an image processing technique for finding the boundaries of objects within images. It is typically used to interpret gravity and magnetic data, and find the horizontal boundaries of geological bodies. Large deviations between model and true edges are common because of the interference of depth and errors in computing the derivatives; thus, edge detection methods cannot provide information about the depth of the source. To simultaneously obtain the horizontal extent and depth of geophysical anomalies, we use normalized edge detection filters, which normalize the edge detection function at different depths, and the maxima that correspond to the location of the source. The errors between model and actual edges are minimized as the depth of the source decreases and the normalized edge detection method recognizes the extent of the source based on the maxima, allowing for reliable model results. We demonstrate the applicability of the normalized edge detection filters in defining the horizontal extent and depth using synthetic and actual aeromagnetic data.

Irregular seismic data reconstruction based on exponential threshold model of POCS method

Irregular seismic data causes problems with multi-trace processing algorithms and degrades processing quality. We introduce the Projection onto Convex Sets （POCS） based image restoration method into the seismic data reconstruction field to interpolate irregularly missing traces. For entire dead traces, we transfer the POCS iteration reconstruction process from the time to frequency domain to save computational cost because forward and reverse Fourier time transforms are not needed. In each iteration, the selection threshold parameter is important for reconstruction efficiency. In this paper, we designed two types of threshold models to reconstruct irregularly missing seismic data. The experimental results show that an exponential threshold can greatly reduce iterations and improve reconstruction efficiency compared to a linear threshold for the same reconstruction result. We also analyze the anti- noise and anti-alias ability of the POCS reconstruction method. Finally, theoretical model tests and real data examples indicate that the proposed method is efficient and applicable.

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.

An amplitude suppression method based on the decibel criterion

To suppress the strong noise in seismic data with wide range of amplitudes, commonly used methods often yield unsatisfactory denoising results owing to inappropriate thresholds and require parametric testing as well as iterations to achieve the anticipated results. To overcome these problems, a data-driven strong amplitude suppression method based on the decibel criterion in the wavelet domain （ISANA） is proposed. The method determines the denoising threshold based on the decibel criterion and statistically analyzes the amplitude index rather than the abnormally high amplitudes. The method distinguishes the frequency band distributions of the valid signals in the time-frequency domain based on the wavelet transformation and then calculates thresholds in selected time windows, eventually achieving frequency-divided noise attenuation for better denoising. Simulations based on theoretical and real-world data verify the adaptability and low dependence of the method on the size of the time window. The method suppresses noise without energy loss in the signals.

THEORETICAL INVESTIGATION ON HEAT TRANSFER CHARACTERISTICS WITH ROTATING THERMAL SOURCE

By reduction to one dimensional, periodic as well as rotating pulse heat sources, investigation on heat transfer characteristics with rotating body is carried out. Similar to the fluid flow, a new set of dimensionless numbers, namely quasi-Peclet numbers Pe 1, Pe 2 and Biot number Bi composed of angular velocity ω , thermophysical parameter, and geometry size are proposed, and applied to the dimensionless equations. Simulation result shows that it plays a decisive role in the process of the heat transfer. However, more important is that the numerical simulation depicts the difference between microcosmic and macroscopic structures of the temperature distribution, and reveals the influence of the relative relation of the dimensionless criterion numbers upon heat transfer characteristics.

Classification methods of association rules with linguistic terms

A partition of intervals method is adopted in current classification based on associations (CBA), but this method cannot reflect the actual distribution of data and exists the problem of sharp boundary problem. The classification system based on the longest association rules with linguistic terms is discussed, and the shortcoming of this classification system is analyzed. Then, the classification system based on the short association rules with linguistic terms is presented. The example shows that the accuracy of the classification system based on the association rules with linguistic terms is better than two popular classification methods: C4.5 and CBA.

An analysis method of topological relations between Snort rules

It is difficult to knowall the relations between Snort rules. To deal with this problem, the topological relations between Snort rules are classified based on the set theory, and a method for calculating the topological relations between Snort rules is proposed. In the existing methods for analyzing the relations of Snort rules, the relations are usually determined only according to the header information of the Snort rules. Without considering the actions of Snort rules, the proposed method improves upon the existing methods and it can classify and calculate the topological relations between Snort rules according to both headers and options information of Snort rules. In addition, the proposed method is implemented by the functional language Haskell. The experimental results showthat the topological relations between Snort rules can be calculated rapidly and effectively. The proposed method also provides an important basis for conflict detection in the succeeding Snort rules.

MINER RULE CONSIDERING FUZZINESS OF STRESS DAMAGE UNDER DIFFERENT LOAD SEQUENCES

Since the traditional Miner rule ignores the influence of the load sequence on the fatigue life, the fuzzy rules are used to analyze the fuzziness of the fatigue damage caused by the stress nearby the fatigue limit under different load sequences. The improved fuzzy Miner rule can reflect the influence of the load sequence on the fatigue life. Results of the example show that the prediction error can be reduced from 61.6% to 21.7%.

Extrapolated Tikhonov method and inversion of 3D density images of gravity data

Tikhonov regularization（TR） method has played a very important role in the gravity data and magnetic data process. In this paper, the Tikhonov regularization method with respect to the inversion of gravity data is discussed. and the extrapolated TR method（EXTR） is introduced to improve the fitting error. Furthermore, the effect of the parameters in the EXTR method on the fitting error, number of iterations, and inversion results are discussed in details. The computation results using a synthetic model with the same and different densities indicated that. compared with the TR method, the EXTR method not only achieves the a priori fitting error level set by the interpreter but also increases the fitting precision, although it increases the computation time and number of iterations. And the EXTR inversion results are more compact than the TR inversion results, which are more divergent. The range of the inversion data is closer to the default range of the model parameters, and the model features and default model density distribution agree well.

Fast FP-Growth for association rule mining

In this paper, we propose an efficient algorithm, called FFP-Growth (shortfor fast FP-Growth) , to mine frequent itemsets. Similar to FP-Growth, FFP-Growth searches theFP-tree in the bottom-up order, but need not construct conditional pattern bases and sub-FP-trees,thus, saving a substantial amount of time and space, and the FP-tree created by it is much smallerthan that created by TD-FP-Growth, hence improving efficiency. At the same time, FFP-Growth can beeasily extended for reducing the search space as TD-FP-Growth (M) and TD-FP-Growth (C). Experimentalresults show that the algorithm of this paper is effective and efficient.

3D density inversion of gravity gradient data using the extrapolated Tikhonov regularization

We use the extrapolated Tikhonov regularization to deal with the ill-posed problem of 3D density inversion of gravity gradient data. The use of regularization parameters in the proposed method reduces the deviations between calculated and observed data. We also use the depth weighting function based on the eigenvector of gravity gradient tensor to eliminate undesired effects owing to the fast attenuation of the position function. Model data suggest that the extrapolated Tikhonov regularization in conjunction with the depth weighting function can effectively recover the 3D distribution of density anomalies. We conduct density inversion of gravity gradient data from the Australia Kauring test site and compare the inversion results with the published research results. The proposed inversion method can be used to obtain the 3D density distribution of underground anomalies.

The Similarity Transformation of Regularizing Functionals and Simularity Property of Their Fourier Transformations

Let and denote respectively the functionswhere λ≥1, The author discusses the similarity transformation of the regularizing functionals of these functions and the similar property of their Fourier transformation.

Monotonicity of the tail dependence for multivariate t-copula

This paper considers the upper orthant and extremal tail dependence indices for multivariate t-copula. Where, the multivariate t-copula is defined under a correlation structure. The explicit representations of the tail dependence parameters are deduced since the copula of continuous variables is invariant under strictly increasing transformation about the random variables, which are more simple than those obtained in previous research. Then, the local monotonicity of these indices about the correlation coefficient is discussed, and it is concluded that the upper extremal dependence index increases with the correlation coefficient, but the monotonicity of the upper orthant tail dependence index is complex. Some simulations are performed by the Monte Carlo method to verify the obtained results, which are found to be satisfactory. Meanwhile, it is concluded that the obtained conclusions can be extended to any distribution family in which the generating random variable has a regularly varying distribution.

Super-resolution reconstruction for license plate images of moving vehicles

A novel reconstruction method to improve the recognition of license plate texts of moving vehicles in real traffic videos is proposed, which fuses complimentary information among low resolution （LR） images to yield a high resolution （HR） image. Based on the regularization super-resolution （SR） reconstruction schemes, this paper first introduces a residual gradient （RG） term as a new regularization term to improve the quality of the reconstructed image. Moreover, L1 norm is used to measure the residual data （RD） term and the RG term in order to improve the robustness of the proposed method. Finally, the steepest descent method is exploited to solve the energy functional. Simulated and real acquired video sequence experiments show the effectiveness and practicability of the proposed method and demonstrate its superiority over the bi-cubic interpolation and discontinuity adaptive Markov random field （DAMRF） SR method in both signal to noise ratios （SNR） and visual effects.

Comments and Research on Proofs of Chain Rule

In this paper we point out that the proofs of Chain Rule in many intensively used textbooks are not strict an construct anexa mple of a composite function f(u) which is differentiable with respects t o the independednt variable u, but is not differentiable with respect to the dependent variable u=g(x). A strict proof of Chain Rule is presented. Incon sistency of the form and content of Chain Rule is disclosed.

One-parameter quasi-filled function algorithm for nonlinear integer programming

A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the pro- posed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algo- rithm.