D.c. conduction studies on thermally evaporated neodymium oxide thin films

Aluminium-neodymium oxide-aluminium thin film capacitors have been prepared by thermal evaporation and the d.c. conduction properties of these films have been studied. The thicknesses of the films have been determined by a multiple beam interferometer. The current-voltage power-law dependence showed that the conduction in these films is space-charge limited. The linear dependence of the current density on the square root of the applied field confirmed the exponential trap distribution. The trap density has been found to be of the order of 10²⁶ m^–3. It has also been observed that the Schottky type of conduction is predominant in the high-field region and the height of the Schottky barrier has been determined. It is seen that the conduction mechanism is an activated process with the activation energy decreasing with increasing field.     

Contribution a l'etude du polymorphisme de Ga2S3: Structure cristalline de Mn0,23Ga1,85S3

The Mn_0.23Ga_1.85S₃ phase belongs to the solid solution $\text{ф}{}_0$, stable at low temperature in the Ga₂S₃MnS system. It is hexagonal superstructure of the wurtzite, with the Ga₂S₃α′ type ($\text{a}\text{= 6.397}\text{A}\text{?}$; $\text{c}\text{= 18.027}\text{A}\text{?}$Z = 6; space groupe P6₁ or P6₅). Its crystal structure has been refined by the least squares method to a final R = 0.06 with 323 independant reflections. This structure is closely related to Ga₂S₃ α described by Hahn and Frank, and differs only by the partial occupation of the vacant metal site of Ga₂S₃ by Mn atoms in statistical disorder.     

Formal techniques for performance analysis: blending SAN and PEPA

In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, and the potential for reduction in the Markov process. Such careful comparison of modelling techniques allows us to appreciate the strengths and weaknesses of different approaches, and facilitates cross-fertilization between them. In the present case we take a characteristic of one formalism, functional rates in Stochastic Automata Networks, and introduce it to the other formalism, Performance Evaluation Process Algebra. We investigate the benefits of this cross-fertilization, particularly from the perspectives of Markov process generation and reduction.     

Modal Kalman filtering based impedance relaying

An algorithm is presented for computer distance relaying. It is based on modal Kalman filtering (MKF) to estimate fundamental phasors, MKF exploits all the measurement information available from a three-phase line and is founded on enhanced models of the electromagnetic transients noise. To support the modeling of noise for different faults, a study of nontrivial electrical networks with accurate electromagnetic transients modeling is made for 400 kV transmission lines. MKF fits the behavior of the different modal noise for the Clarke phasors, but it is invariant for each type of fault, assuring robustness and minimum error variance. To computer distance, Clarke αB phasors are transformed to +/- symmetrical components, and then a well-known expression is used to computer the positive impedance. Statistical analysis if presented to assess observation time versus estimation accuracy for the different types of line faults     

A General Reliable Quadratic Form: An Extension of Affine Arithmetic

In this article, a new extension of affine arithmetic is introduced. This technique is based on a quadratic form named general quadratic form. We focus here on the computation of reliable bounds of a function over a hypercube by using this new tool. Some properties of first quadratic functions and then polynomial ones are reported. In order to show the efficiency of such a method, ten polynomial global optimization problems are presented and solved by using an interval branch-and-bound based algorithm. The work of the first author was also supported by the Laboratoire de Mathématiques Appliquées CNRS–FRE 2570, Université de Pau et des Pays de l'Adour, France, and by the Laboratoire d'Electrotechnique et d'Electronique Industrielle CNRS–UMR5828, Group EM³, INPT–ENSEEIHT.     

Network regression with predictive clustering trees

Network data describe entities represented by nodes, which may be connected with (related to) each other by edges. Many network datasets are characterized by a form of autocorrelation, where the value of a variable at a given node depends on the values of variables at the nodes it is connected with. This phenomenon is a direct violation of the assumption that data are independently and identically distributed. At the same time, it offers an unique opportunity to improve the performance of predictive models on network data, as inferences about one entity can be used to improve inferences about related entities. Regression inference in network data is a challenging task. While many approaches for network classification exist, there are very few approaches for network regression. In this paper, we propose a data mining algorithm, called NCLUS, that explicitly considers autocorrelation when building regression models from network data. The algorithm is based on the concept of predictive clustering trees (PCTs) that can be used for clustering, prediction and multi-target prediction, including multi-target regression and multi-target classification. We evaluate our approach on several real world problems of network regression, coming from the areas of social and spatial networks. Empirical results show that our algorithm performs better than PCTs learned by completely disregarding network information, as well as PCTs that are tailored for spatial data, but do not take autocorrelation into account, and a variety of other existing approaches.     

A general approach for multi-oriented text line extraction of handwritten documents

The multi-orientation occurs frequently in ancient handwritten documents, where the writers try to update a document by adding some annotations in the margins. Due to the margin narrowness, this gives rise to lines in different directions and orientations. Document recognition needs to find the lines everywhere they are written whatever their orientation. This is why we propose in this paper a new approach allowing us to extract the multi-oriented lines in scanned documents. Because of the multi-orientation of lines and their dispersion in the page, we use an image meshing allowing us to progressively and locally determine the lines. Once the meshing is established, the orientation is determined using the Wigner–Ville distribution on the projection histogram profile. This local orientation is then enlarged to limit the orientation in the neighborhood. Afterward, the text lines are extracted locally in each zone basing on the follow-up of the orientation lines and the proximity of connected components. Finally, the connected components that overlap and touch in adjacent lines are separated. The morphology analysis of the terminal letters of Arabic words is here considered. The proposed approach has been experimented on 100 documents reaching an accuracy of about 98.6%.     

Comportement chaotique des filtres récursifs adaptatifs: application à la compression des signaux téléphoniques

Adaptive filtering gives simple iterative methods for extracting a useful signal by linearly filtering an observation correlated with this useful signal. When the observation contains past values of the filter output—as is the case for a recursive structure— the adaptive filter is a non linear operator which can generate complex behaviours even though adaptation is a standard derivative of the gradient algorithm. Such behaviours are observed in a particular case : theArma adaptive prediction with a sinusoidal input. A slow adaptation speed involves a quasi-periodic behaviour due to the locally unstable character of the predictor. This phenomenon called selfstabilization persists as the adaptation speed increases. Its study is more complicated : the behaviour becomes chaotic. As an illustration, the digitization of telephone signals throughArma adaptive prediction shows the necessity of controlling the qualitative behaviour of the adaptive filtering solutions.     

分布式PACS通信服务中间层构造方法研究

基于目前分布式PACS中存在的问题,提出一个通信服务中间层的构造方法,分别进行了基于设计模式通信框架的构造、DICOM图像互操作和分布式PACS可复用构件的研究.通信服务中间层的构造不仅提高了分布式PACS在网络异构环境中的可移植性、可扩展性以及相关QoS性能,还满足了PACS今后发展中提出的较高的互连互操作性的要求.     

Silicon neuron: digital hardware implementation of the quartic model

This paper presents an FPGA implementation of the quartic neuron model. This approach uses digital computation to emulate individual neuron behavior. We implemented the neuron model using fixed-point arithmetic operation. The neuron model’s computations are performed in arithmetic pipelines. It was designed in VHDL language and simulated prior to mapping in the FPGA. We show that the proposed FPGA implementation of the quartic neuron model can emulate the electrophysiological activities in various types of cortical neurons and is capable of producing a variety of different behaviors, with diversity similar to that of neuronal cells. The neuron family of this digital neuron can be modified by appropriately adjusting the neuron model’s parameters.