Context-driven reconciliation in ontology integration

In order to solve the semantic irreconcilable problems caused by contextual differences during the process of ontology integration, a context-driven reconciliation mechanism is proposed. The mechanism is based on the previous work about a context-based formalism-Context-SHOIQ （D ＋ ） DL, which is used for explicitly representing context of ontology by adopting the description logic and the category theory. The formalism is extended by adding four migration rules （InclusionRule, SelectionRule, PreferenceRule, and MappingRule）, that are used to specify what should be imported into the IntegrativeContext, and three related contextual integration operations of increasing interoperability （import, partial reconciliation, and full reconciliation）. While not exhaustive, the mechanism is sufficient for solving the five types of semantic irreconcilable problems that are discussed, and favors integration of ontologies from one context to another.

The Conflict and Reconciliation between the Two Societies——An Interpretation of the Novel "I Heard the Owl Call my Name" by Margaret Craven

For a long time Indians have remained a mystery to people not only in America but also in other parts of the world.The little that is known about them certainly makes people want to know a great deal more. Indian's unique culture,customs and values are exciting the immense interest of all. Under such circumstances the novel"! Heard the Owl Call My Name"written by Margaret Craven achieves much popularity and captures great attention of all. The focus of this paper is on the cultural conflict and reconciliation between Indians and the non-native people.

NONLINEAR DATA RECONCILIATION METHOD BASED ON KERNEL PRINCIPAL COMPONENT ANALYSIS

In the industrial process situation, principal component analysis (PCA) is ageneral method in data reconciliation. However, PCA sometime is unfeasible to nonlinear featureanalysis and limited in application to nonlinear industrial process. Kernel PCA (KPCA) is extensionof PCA and can be used for nonlinear feature analysis. A nonlinear data reconciliation method basedon KPCA is proposed. The basic idea of this method is that firstly original data are mapped to highdimensional feature space by nonlinear function, and PCA is implemented in the feature space. Thennonlinear feature analysis is implemented and data are reconstructed by using the kernel. The datareconciliation method based on KPCA is applied to ternary distillation column. Simulation resultsshow that this method can filter the noise in measurements of nonlinear process and reconciliateddata can represent the true information of nonlinear process.

Proactive reconciliation as a tool for integrating mining and milling operations

Historically, reconciliation has been viewed as a quality test of model estimates as well as a powerful tool for detecting and correcting problems in all stages of mine operations from resource estimation to metal production. If used correctly, reconciliation helps to better predict the life of mine(LOM), improves the adherence of production plans to the respective budget, and allows for effective control of the mining and milling processes. However, the accuracy of reconciliation results requires that all input data must be generated in accordance with the principles of sampling correctness. Furthermore, complete reconciliation systems can become extremely complex and must be carefully analyzed in order to provide realistic and helpful conclusions. Based on these concepts, this paper presents a successful proactive reconciliation system applied to a copper and gold mine in Brazil for monitoring and integrating mining and milling operations.

A Novel Robust Nonlinear Dynamic Data Reconciliation

Outlier in one variable will smear the estimation of other measurements in data reconciliation （DR）. In this article, a novel robust method is proposed for nonlinear dynamic data reconciliation, to reduce the influence of outliers on the result of DR. This method introduces a penalty function matrix in a conventional least-square objective function, to assign small weights for outliers and large weights for normal measurements. To avoid the loss of data information, element-wise Mahalanobis distance is proposed, as an improvement on vector-wise distance, to construct a penalty function matrix. The correlation of measurement error is also considered in this article. The method introduces the robust statistical theory into conventional least square estimator by constructing the penalty weight matrix and gets not only good robustness but also simple calculation. Simulation of a continuous stirred tank reactor, verifies the effectiveness of the proposed algorithm.

An NT-MT Combined Method for Gross Error Detection and Data Reconciliation

An NT-MT combined method based on nodal test (NT) and measurement test (MT) is developed for gross error detection and data reconciliation for industrial application. The NT-MT combined method makes use of both NT and MT tests and this combination helps to overcome the defects in the respective methods. It also avoids any artificial manipulation and eliminates the huge combinatorial problem that is created in the combined method based on the nodal test in the case of more than one gross error for a large process system. Serial compensation strategy is also used to avoid the decrease of the coefficient matrix rank during the computation of the proposed method. Simulation results show that the proposed method is very effective and possesses good performance.

A New Method to Solve Robust Data Reconciliation in Nonlinear Process

Data reconciliation is an effective technique for providing accurate and consistent value for chemical process. However, the presence of gross errors can severely bias the reconciled results. Robust estimators can significantly reduce the effect of gross errors and yield less-biased results. In this article, a new method is proposed to solve the robust data reconciliation problem of nonlinear chemical process. By using several technologies including linearization method, penalty function, virtual observation equation, and equivalent weights method, the robust data reconciliation problem can be transformed into least squares estimator problem which leads to the convenience in computation. Simulation results in a nonlinear chemical process demonstrate the efficiency of the proposed method.

Spherical reconciliation for a continuous-variable quantum key distribution

Information reconciliation is a significant step for a continuous-variable quantum key distribution（CV-QKD） system.We propose a reconciliation method that allows two authorized parties to extract a consistent and secure binary key in a CV-QKD protocol,which is based on Gaussian-modulated coherent states and homodyne detection.This method named spherical reconciliation is based on spherical quantization and non-binary low-density parity-check（LDPC） codes.With the suitable signal-to-noise ratio（SNR） and code rate of non-binary LDPC codes,spherical reconciliation algorithm has a high efficiency and can extend the transmission distance of CV-QKD.

Performance of an Improved One-Way Error Reconciliation Protocol Based on Key Redistribution

In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protocol by data simulation. The relationship between the error correction capability and the key generation efficiency of three kinds of Hamming code are demonstrated. The simulation results indicate that when the initial error rates are （0,1.5%], （1.5,4%], and （4,11%], using the Hamming （31,26）, （15,11）, and （7,4） codes to correct the error, respectively, the key generation rate will be maximized. Based on this, we propose a modified one-way error reconciliation protocol which employs a mixed Hamming code concatenation scheme. The error correction capability and key generation rate are verified through data simulation. Using the parameters of the posterior distribution based on the tested data, a simple method for estimating the bit error rate （BER） with a given confidence interval is estimated. The simulation results show that when the initial bit error rate is 10.00%, after 7 rounds of error correction, the error bits are eliminated completely, and the key generation rate is 10.36%; the BER expectation is 2.96×10^-10, and when the confidence is 95% the corresponding BER upper limit is 2.17×10^-9. By comparison, for the single （7,4） Hamming code error reconciliation scheme at a confidence of 95%,the key generation rate is only 6.09%, while the BER expectation is 5.92x 10＂9, with a BER upper limit of 4.34×10^-8. Hence, our improved protocol is much better than the original one.

Practical security of continuous-variable quantum key distribution under finite-dimensional effect of multi-dimensional reconciliation

The well-known multi-dimensional reconciliation is an effective method used in the continuous-variable quantum key distribution in the long-distance and the low signal-to-noise-ratio scenarios.The virtual channel employed to exchange data is generally established by using a finite-dimensional rotation in the reconciliation procedure.In this paper,we found that the finite dimension of the multi-dimensional reconciliation inevitably leads to the mismatch of the signal-to-noise-ratio between the quantum channel and the virtual channel,which may be called the finite-dimension effect.Such an effect results in an overestimation on the secret key rate,and subsequently induces vital practical security loopholes.

A Modified Outlier Detection Method in Dynamic Data Reconciliation

Data reconciliation technology can decrease the level of corruption of process data due to measurement noise, but the presence of outliers caused by process peaks or unmeasured disturbances will smear the reconciled results. Based on the analysis of limitation of conventional outlier detection algorithms, a modified outlier detection method in dynamic data reconciliation (DDR) is proposed in this paper. In the modified method, the outliers of each variable are distinguished individually and the weight is modified accordingly. Therefore, the modified method can use more information of normal data, and can efficiently decrease the effect of outliers. Simulation of a continuous stirred tank reactor (CSTR) process verifies the effectiveness of the proposed algorithm.

Reconciliation for CV-QKD using globally-coupled LDPC codes

Reconciliation is a necessary step in postprocessing of continuous-variable quantum key distribution(CV-QKD)system.We use globally coupled low-density parity-check(GC-LDPC)codes in reconciliation to extract a precise secret key from the raw keys over the authenticated classical public channel between two users.GC-LDPC codes have excellent performance over both the additive Gaussian white noise and binary-erasure channels.The reconciliation based on GC-LDPC codes can improve the reconciliation efficiency to 95.42% and reduce the frame error rate to 3.25×10^-3.Using distillation,the decoding speed can achieve 23.8 Mbits/s and decrease the cost of memory.Given decoding speed and low memory usage,this makes the proposed reconciliation method viable approach for high-speed CV-QKD system.

Toward Efficient Quantum Key Distribution Reconciliation

In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low-Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability.

Retrospection of the Rationality and the Feasibility of the Criminal Reconciliation System

In a criminal procedure,if the offender and the victim negotiate to solve the criminal case in the way of confession,compensation and apology,the specialized agency terminate the criminal responsibility investigation of the offender or give lighter punishment to the offender.This form of case treatment method is defined as criminal reconciliation.[1](P191)The system dated from 70s of last century when a reconciliation experiment of‘Victim-Offender’appeared in Ontario,Canada.After that,the method was introduced to America and some European countries.The practice of the method in western countries attached the attention of Chinese law society,and some regions has made legal attempts.However the author hold the view that the criminal reconciliation lacks enough rationality and feasibility,so that it shocks the basic principle of the existing criminal law,corrodes the social psychological basis of the law,and aggravates the judicial corruption.The method has theoretic defects,and it should not be promoted in current judicial practice.

Failed Reconciliation in The Narrow Road to the Deep North

The Narrow Road to the Deep North,a novel composed by Richard Flanagan,a well-known Australian contemporary nov⁃elist,depicts a grand political picture of Australia,from the lens of individual’s psyche.The domination of the official history en⁃courages forgetting as a way to deal with the painful history,the Burma camp in the novel,while the minorities,who rise up,fighting against the imposed official history by constructing the counter memory,are trapped in the identity confusion.Literature is used by both the perpetrators and the survivors as means to pursuing for reconciliation but both failed for the perpetrators use it as a way of forgetting which contributes to the prevailing unforgiveness in the novel,and further contributes the victims’failed reconciliation.

Sino-Japanese Relations:Understanding and Promoting

The unfolding debate in China over relations with Japan has held the limelight with the participation of academics and netizens—a welcome phenomenon highlighting strong public interest in the issue. What merits our concern, however, is the flood of emotional outbursts mixed up with penetrating, expert comments.

Reflection on the Sharp Contrast between Europe and Asia on Postwar Reconciliation

The year 2015 marks the 70thAnniversary of Victory of World Anti-Fascist War and Chinese People’s Resistance against Japanese Aggression.The occasion reminds people to draw lessons from WWII,and the sharp contrast between Europe and Asia on postwar reconciliation calls for deep reflection.People must keep a vigilant watch on the right-wing tendency of Japan.Much still needs to be done to maintain peace in the world.

Mutual Trust—Key to Sino-Japanese Amity

Drift marked China-Japan ties in most part of the 1990s, accompanied with wild swings. The last decade of the 20th century witnessed the commemoration of the 20th anniversary(1972-1992)of diplomatic normalization, the 50th anniversary(1945-1995)of the victory of the War of Resistance Against Japanese Aggression, the furor over the "No War decision" in Japan, and the shock waves from the reorientation of Japan-U. S. relationship in 1996 and the revision of the