Filamentary Superconductivity in Semiconducting Policrystalline ZrSe<Subscript>2</Subscript> Compound with Zr Vacancies

Z r S e ₂ is a band semiconductor studied long time ago. It has interesting electronic properties, and because its layer structure can be intercalated with different atoms to change some of the physical properties. In this investigation, we found that Zr deficiencies alter the semiconducting behavior and the compound can be turned into a superconductor. In this paper, we report our studies related to this discovery. The decreasing of the number of Zr atoms in small proportion according to the formula Zr _x Se₂, where x is varied from about 8.1 to 8.6 K, changing the semiconducting behavior to a superconductor with transition temperatures ranging between 7.8 and 8.5 K, is depending on the deficiencies. Outside of those ranges, the compound behaves as semiconducting with the properties already known. In our experiments, we found that this new superconductor has only a very small fraction of superconducting material determined by magnetic measurements with applied magnetic field of 10 Oe. Our conclusions is that superconductivity is filamentary. However, in one studied sample, the fraction was about 10.2 %, whereas in others is only about 1% or less. We determined the superconducting characteristics; the critical fieldsthat indicate a type 2 superonductor with Ginzburg-Landau κ parameter of the order about 2.7. The synthesis procedure is quite normal following the conventional solid state reaction. In this paper, included are the electronic characteristics, transition temperature, and evolution with temperature of the critical fields.     

Accuracy vs Efficiency Trade-offs in Optical Flow Algorithms

There have been two thrusts in the development of optical flow algorithms. One has emphasized higher accuracy; the other faster implementation. These two thrusts, however, have been independently pursued, without addressing the accuracy vs efficiency trade-offs. Although the accuracy–efficiency characteristic is algorithm dependent, an understanding of a general pattern is crucial in evaluating an algorithm as far as real-world tasks are concerned, which often pose various performance requirements. This paper addresses many implementation issues that have often been neglected in previous research, including temporal filtering of the output stream, algorithms' flexibility, and robustness to noise, subsampling, etc. Their impacts on accuracy and/or efficiency are emphasized. We present a survey of different approaches toward the goal of higher performance and present experimental studies on accuracy vs efficiency trade-offs. A detailed analysis of how this trade-off affects algorithm design is manifested in a case study involving two state-of-the-art optical flow algorithms: a gradient and a correlation-based method. The goal of this paper is to bridge the gap between the accuracy- and the efficiency-oriented approaches.     

A PDE method for patchwise approximation of large polygon meshes

Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (CT) data, often result in large polygon meshes which require substantial storage for their handling, and normally have only one fixed level of detail (LOD). This can often be an obstacle for efficient data exchange and interactive work with such objects. We propose to replace such large polygon meshes with a relatively small set of coefficients of the patchwise partial differential equation (PDE) function representation. With this model, the approximations of the original shapes can be rendered with any desired resolution at interactive rates. Our approach can directly work with any common 3D reconstruction pipeline, which we demonstrate by applying it to a large reconstructed medical data set with irregular geometry.     

On the minimum of a positive polynomial over the standard simplex

We present a new positive lower bound for the minimum value taken by a polynomial P$P$ with integer coefficients in k$k$ variables over the standard simplex of R^k${\mathbb{R}}^k$, assuming that P$P$ is positive on the simplex. This bound depends only on the number of variables k$k$, the degree d$d$ and the bitsize τ$\tau$ of the coefficients of P$P$ and improves all the previous bounds for arbitrary polynomials which are positive over the simplex.     

Aligned texture map creation for pose invariant face recognition

In last years, Face recognition based on 3D techniques is an emergent technology which has demonstrated better results than conventional 2D approaches. Using texture (180° multi-view image) and depth maps is supposed to increase the robustness towards the two main challenges in Face Recognition: Pose and illumination. Nevertheless, 3D data should be acquired under highly controlled conditions and in most cases depends on the collaboration of the subject to be recognized. Thus, in applications such as surveillance or control access points, this kind of 3D data may not be available during the recognition process. This leads to a new paradigm using some mixed 2D-3D face recognition systems where 3D data is used in the training but either 2D or 3D information can be used in the recognition depending on the scenario. Following this concept, where only part of the information (partial concept) is used in the recognition, a novel method is presented in this work. This has been called Partial Principal Component Analysis (P²CA) since they fuse the Partial concept with the fundamentals of the well known PCA algorithm. This strategy has been proven to be very robust in pose variation scenarios showing that the 3D training process retains all the spatial information of the face while the 2D picture effectively recovers the face information from the available data. Furthermore, in this work, a novel approach for the automatic creation of 180° aligned cylindrical projected face images using nine different views is presented. These face images are created by using a cylindrical approximation for the real object surface. The alignment is done by applying first a global 2D affine transformation of the image, and afterward a local transformation of the desired face features using a triangle mesh. This local alignment allows a closer look to the feature properties and not the differences. Finally, these aligned face images are used for training a pose invariant face recognition approach (P²CA).     

Distributed evolutionary multi-objective mesh-partitioning algorithm for parallel finite element computations

Majority of the mesh-partitioning algorithms attempt to optimise the interprocessor communications, while balancing the computational load among the processors. However, it is desirable to simultaneously optimise the submesh aspect ratios in order to significantly improve the convergence characteristics of the domain decomposition based Preconditioned-conjugate-gradient algorithms, being used extensively in the state-of-the-art parallel finite element codes. Keeping this in view, a new distributed multi-objective mesh-partitioning algorithm using evolutionary computing techniques is proposed in this paper. Effectiveness of the proposed distributed mesh-partitioning algorithm is demonstrated by solving several unstructured meshes of practical-engineering problems and also benchmark problems.     

ILP-assisted de novo drug design

The accurate and early detection of epileptic seizures in continuous electroencephalographic (EEG) data has a growing role in the management of patients with epilepsy. Early detection allows for therapy to be delivered at the start of seizures and for caregivers to be notified promptly about potentially debilitating events. The challenge to detecting epileptic seizures, however, is that seizure morphologies exhibit considerable inter-patient and intra-patient variability. While recent work has looked at addressing the issue of variations across different patients (inter-patient variability) and described patient-specific methodologies for seizure detection, there are no examples of systems that can simultaneously address the challenges of inter-patient and intra-patient variations in seizure morphology. In our study, we address this complete goal and describe a multi-task learning approach that trains a classifier to perform well across many kinds of seizures rather than potentially overfitting to the most common seizure types. Our approach increases the generalizability of seizure detection systems and improves the tradeoff between latency and sensitivity versus false positive rates. When compared against the standard approach on the CHB–MIT multi-channel scalp EEG data, our proposed method improved discrimination between seizure and non-seizure EEG for almost 83 % of the patients while reducing false positives on nearly 70 % of the patients studied.     

Predicting user’s preferences using neural networks and psychology models

In this paper we describe a new model suitable for optimization problems with explicitly unknown optimization functions using user’s preferences. The model addresses an ability to learn not known optimization functions thus perform also a learning of user’s preferences. The model consists of neural networks using fuzzy membership functions and interactive evolutionary algorithms in the process of learning. Fuzzy membership functions of basic human values and their priorities were prepared by utilizing Schwartz’s model of basic human values (achievement, benevolence, conformity, hedonism, power, security, self-direction, stimulation, tradition and universalism). The quality of the model was tested on “the most attractive font face problem” and it was evaluated using the following criteria: a speed of optimal parameters computation, a precision of achieved results, Wilcoxon signed rank test and a similarity of letter images. The results qualify the developed model as very usable in user’s preference modeling.     

A novel model for arc territory design: promoting Eulerian districts

The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region. This problem arises in numerous applications such as postal delivery, meter readings, winter gritting, road maintenance, and municipal solid waste collection. An integer linear programming model is proposed where a novel set of node parity constraints to favor Eulerian districts is introduced. Series of instances were solved to assess the impact of these parity constraints on the objective function and deadhead distance. Networks with up to 401 nodes and 764 edges were successfully solved. The model is useful at a tactical level as it can be used to promote workload balance, compactness, deadhead distance reduction and parity in districts.     

Delivering public value through open government data initiatives in a Smart City context

By using ICT in an innovative way, governments can improve the delivery of services and interaction with stakeholders. Open data is a way to help public organizations became more open and improve interaction with stakeholders. This paper aims to identify what are the public values enhancements acquired on smart city environment that discloses open data. We propose a conceptual model to analyze the smart city initiative. We contextualized the model taking a smart city domain by analyzing three related-initiatives that comprises open data in a smart city case carried at Rio de Janeiro Operations Center (COR) in Brazil by seven deep-interviewees directly involved - from inside and outside – in this case. The findings reveal evidences that open data initiatives contribute to enhance the delivery of public value in smart city contexts.