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.     

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     

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.     

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.     

Conceptualization,measurement, and application of semantic transparency in visual notations

Numerous visual notations are present in technical and business domains. Notations have to be cognitively effective to ease the planning, documentation, and communication of the domains’ concepts. Semantic transparency (ST) is one of the elementary principles that influence notations’ cognitive effectiveness. However, the principle is criticized for not being well defined and challenges arise in the evaluations and applications of ST. Accordingly, this research’s objectives were to answer how the ST principle is defined, operationalized, and evaluated in present notations as well as applied in the design of new notations in ICT and related areas. To meet these objectives, a systematic literature review was conducted with 94 studies passing the selection process criteria. The results reject one of the three aspects, which define semantic transparency, namely “ST is achieved with the use of icons.” Besides, taxonomies of related concepts and research methods, evaluation metrics, and other findings from this study can help to conduct verifiable ST-related experiments and applications, consequently improving the visual vocabularies of notations and effectiveness of the resulting diagrams.

     

Direction prediction for avoiding occlusion in visual surveillance

Occurrence of occlusion while providing visual surveillance leads to anarchy as the track of the subject under motion may be lost. This often results into the failure of the surveillance system. The approach of predicting motion of moving subjects and hence the chances of their mutual occlusion gives an upper hand to surveillance system to take in-time necessary action towards mitigation of loss of track during dynamic occlusion. Direction of motion of a moving subject plays a major role while studying its motion. Direction along with the velocity of a subject in a 3D plane completely describes the motion of any subject. This article proposes a model‘-based approach for direction prediction of a moving subject in a 3D global plane as acquired in a 2D camera plane. The proposed approach uses the eight discrete directions of motion as proposed in and models different directions. The proposed direction prediction method is experimentally verified with six different classifiers, i.e. regression analysis, simple logistic regression, MLP, k-NN, SVM and Bays classifier over existing as well as self-acquired databases. The initial simulation results are motivating as the overall accuracies achieved through different classifiers are of the range of 87–94 \(\%\), which advocates the suitability of the said approach.     

The vehicle routing problem with restricted mixing of deliveries and pickups

The vehicle routing problem with deliveries and pickups is one of the main problems within reverse logistics. This paper focuses on an important assumption that divides the literature on the topic, namely the restriction that all deliveries must be completed before pickups can be made. A generalised model is presented, together with a mathematical formulation and its resolution. The latter is carried out by adopting a suitable implementation of the reactive tabu search metaheuristic. Results show that significant savings can be achieved by allowing a mixture of delivery and pickup loads on-board and yet not incurring delays and driver inconvenience.     

LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGCIust) that builds layers of subgraphs based on this matrix and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure, we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.