Processing of EEG Signals for Study of Coupling in Brain Regions for Eyes Open and Eyes Closed Conditions

This paper deals with processing the EEG signals obtained from 16 spatially arranged electrodes to measure coupling or synchrony between the frontal, parietal, occipital and temporal lobes of the cerebrum under the eyes open and eyes closed conditions. This synchrony was measured using magnitude squared coherence, Short Time Fourier Transform and wavelet based coherences. We found a pattern in the time-frequency coherence as we moved from the nasion to the inion of the subject's head. The coherence pattern obtained from the wavelet approach was found to be far more capable of picking up peaks in coherence with respect to frequency when compared to the regular Fourier based coherence. We detected high synchrony between frontal polar electrodes that is missing in coherence plots between other electrode pairs. The study has potential applications in healthcare.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

A Simple Label Switching Algorithm for Semisupervised Structural SVMs

In structured output learning, obtaining labeled data for real-world applications is usually costly, while unlabeled examples are available in abundance. Semisupervised structured classification deals with a small number of labeled examples and a large number of unlabeled structured data. In this work, we consider semisupervised structural support vector machines with domain constraints. The optimization problem, which in general is not convex, contains the loss terms associated with the labeled and unlabeled examples, along with the domain constraints. We propose a simple optimization approach that alternates between solving a supervised learning problem and a constraint matching problem. Solving the constraint matching problem is difficult for structured prediction, and we propose an efficient and effective label switching method to solve it. The alternating optimization is carried out within a deterministic annealing framework, which helps in effective constraint matching and avoiding poor local minima, which are not very useful. The algorithm is simple and easy to implement. Further, it is suitable for any structured output learning problem where exact inference is available. Experiments on benchmark sequence labeling data sets and a natural language parsing data set show that the proposed approach, though simple, achieves comparable generalization performance.

A Voltage Space Vector Diagram Formed by Nineteen Concentric Dodecagons for Medium-Voltage Induction Motor Drive

In this paper, a multilevel dodecagonal voltage space vector structure with nineteen concentric dodecagons is proposed for the first time. This space vector structure is achieved by cascading two sets of asymmetric three-level inverters with isolated H-bridges on either side of an open-end winding induction motor. The dodecagonal structure is made possible by proper selection of dc link voltages and switching states of the inverters. The proposed scheme retains all the advantages of multilevel topologies as well as the advantages of dodecagonal voltage space vector structure. In addition to that, a generic and simple method for calculation of pulsewidth modulation timings using only sampled reference values (v(alpha) and v(beta)) is proposed. This enables the scheme to be used for any closed-loop application such as vector control. In addition, a new method of switching technique is proposed, which ensures minimum switching while eliminating the fifth-and seventh-order harmonics and suppressing the eleventh and thirteenth harmonics, eliminating the need for bulky filters. The motor phase voltage is a 24-stepped wave-form for the entire modulation range thereby reducing the number of switchings of the individual inverter modules. Experimental results for steady-state operation, transient operation, including start-up have been presented and the results of fast Fourier transform analysis is also presented for validating the proposed concept.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Tight triangulations of closed 3-manifolds

A triangulation of a closed 2-manifold is tight with respect to a field of characteristic two if and only if it is neighbourly; and it is tight with respect to a field of odd characteristic if and only if it is neighbourly and orientable. No such characterization of tightness was previously known for higher dimensional manifolds. In this paper, we prove that a triangulation of a closed 3-manifold is tight with respect to a field of odd characteristic if and only if it is neighbourly, orientable and stacked. In consequence, the Kuhnel-Lutz conjecture is valid in dimension three for fields of odd characteristic. Next let F be a field of characteristic two. It is known that, in this case, any neighbourly and stacked triangulation of a closed 3-manifold is F-tight. For closed, triangulated 3-manifolds with at most 71 vertices or with first Betti number at most 188, we show that the converse is true. But the possibility of the existence of an F-tight, non-stacked triangulation on a larger number of vertices remains open. We prove the following upper bound theorem on such triangulations. If an F-tight triangulation of a closed 3-manifold has n vertices and first Betti number beta(1), then (n - 4) (617n - 3861) <= 15444 beta(1). Equality holds here if and only if all the vertex links of the triangulation are connected sums of boundary complexes of icosahedra. (C) 2015 Elsevier Ltd. All rights reserved.

Asymptotic behavior and interpretation of virtual states: The effects of confinement and of basis sets

A real-space high order finite difference method is used to analyze the effect of spherical domain size on the Hartree-Fock (and density functional theory) virtual eigenstates. We show the domain size dependence of both positive and negative virtual eigenvalues of the Hartree-Fock equations for small molecules. We demonstrate that positive states behave like a particle in spherical well and show how they approach zero. For the negative eigenstates, we show that large domains are needed to get the correct eigenvalues. We compare our results to those of Gaussian basis sets and draw some conclusions for real-space, basis-sets, and plane-waves calculations. (C) 2016 AIP Publishing LLC.

Spallation analysis with a closed trans-scale formulation damage evolution

A closed, trans-scale formulation of damage evolution based on the statistical microdamage mechanics is summarized in this paper. The dynamic function of damage bridges the mesoscopic and macroscopic evolution of damage. The spallation in an aluminium plate is studied with this formulation. It is found that the damage evolution is governed by several dimensionless parameters, i.e., imposed Deborah numbers De* and De, Mach number M and damage number S. In particular, the most critical mode of the macroscopic damage evolution, i.e., the damage localization, is deter-mined by Deborah number De+. Deborah number De* reflects the coupling and competition between the macroscopic loading and the microdamage growth. Therefore, our results reveal the multi-scale nature of spallation. In fact, the damage localization results from the nonlinearity of the microdamage growth. In addition, the dependence of the damage rate on imposed Deborah numbers De* and De, Mach number M and damage number S is discussed.

A novel, sensitive potentiometric hydrocarbon sensor for high-vacuum applications.

A potentiometric device based on interfacing a solid electrolyte oxygen ion conductor with a thin platinum film acts as a robust, reproducible sensor for the detection of hydrocarbons in high- or ultrahigh-vacuum environments. Sensitivities in the order of approximately 5 x 10(-10) mbar are achievable under open circuit conditions, with good selectivity for discrimination between n-butane on one hand and toluene, n-octane, n-hexane, and 1-butene on the other hand. The sensor's sensitivity may be tuned by operating under constant current (closed circuit) conditions; injection of anodic current is also a very effective means of restoring a clean sensing surface at any desired point. XPS data and potentiometric measurements confirm the proposed mode of sensing action: the steady-state coverage of Oa, which sets the potential of the Pt sensing electrode, is determined by the partial pressure and dissociative sticking probability of the impinging hydrocarbon. The principles established here provide the basis for a viable, inherently flexible, and promising means for the sensitive and selective detection of hydrocarbons under demanding conditions.

Numerical Solutions for the Transient Flow in the Homogenous Closed Circle Reservoirs

There are many fault block fields in China. A fault block field consists of fault pools. The small fault pools can be viewed as the closed circle reservoirs in some case. In order to know the pressure change of the developed formation and provide the formation data for developing the fault block fields reasonably, the transient flow should be researched. In this paper, we use the automatic mesh generation technology and the finite element method to solve the transient flow problem for the well located in the closed circle reservoir, especially for the well located in an arbitrary position in the closed circle reservoir. The pressure diffusion process is visualized and the well-location factor concept is first proposed in this paper. The typical curves of pressure vs time for the well with different well-location factors are presented. By comparing numerical results with the analytical solutions of the well located in the center of the closed circle reservoir, the numerical method is verified.

Turbulence modeling for flows around convex features giving rapid eddy distortion

Reynolds averaged Navier-Stokes model performances in the stagnation and wake regions for turbulent flows with relatively large Lagrangian length scales (generally larger than the scale of geometrical features) approaching small cylinders (both square and circular) is explored. The effective cylinder (or wire) diameter based Reynolds number, ReW ≤ 2.5 × 103. The following turbulence models are considered: a mixing-length; standard Spalart and Allmaras (SA) and streamline curvature (and rotation) corrected SA (SARC); Secundov's νt-92; Secundov et al.'s two equation νt-L; Wolfshtein's k-l model; the Explicit Algebraic Stress Model (EASM) of Abid et al.; the cubic model of Craft et al.; various linear k-ε models including those with wall distance based damping functions; Menter SST, k-ω and Spalding's LVEL model. The use of differential equation distance functions (Poisson and Hamilton-Jacobi equation based) for palliative turbulence modeling purposes is explored. The performance of SA with these distance functions is also considered in the sharp convex geometry region of an airfoil trailing edge. For the cylinder, with ReW ≈ 2.5 × 103 the mixing length and k-l models give strong turbulence production in the wake region. However, in agreement with eddy viscosity estimates, the LVEL and Secundov νt-92 models show relatively little cylinder influence on turbulence. On the other hand, two equation models (as does the one equation SA) suggest the cylinder gives a strong turbulence deficit in the wake region. Also, for SA, an order or magnitude cylinder diameter decrease from ReW = 2500 to 250 surprisingly strengthens the cylinder's disruptive influence. Importantly, results for ReW ≪ 250 are virtually identical to those for ReW = 250 i.e. no matter how small the cylinder/wire its influence does not, as it should, vanish. Similar tests for the Launder-Sharma k-ε, Menter SST and k-ω show, in accordance with physical reality, the cylinder's influence diminishing albeit slowly with size. Results suggest distance functions palliate the SA model's erroneous trait and improve its predictive performance in wire wake regions. Also, results suggest that, along the stagnation line, such functions improve the SA, mixing length, k-l and LVEL results. For the airfoil, with SA, the larger Poisson distance function increases the wake region turbulence levels by just under 5%. © 2007 Elsevier Inc. All rights reserved.

Practical Criterion for Universal Laws and Practical Methods for Construction of Co-variance Sets

给出相对论力学中普遍定律的实用判别法和协变集的实用构造法,还给出实现非普遍定律的“可导出性”的一种实用方法．

Normally closed microgrippers based on diamond-like carbon/Ni bimorph and diamond-like carbon/metal/polymer trimorph structures

Multi-finger, normally-closed microgrippers made from a bilayer of a metal and diamond-like carbon (DLC) or a trilayer of a polymer, metal and DLC have been analysed, simulated and fabricated. Temperatures of ∼700 K are necessary to open Ni/DLC bimorph structures. Microgrippers made from an SU8/DLC bilayer or SU8/Al/DLC trilayer have also been fabricated, and fully closed microcages with diameters of ∑40 μm have been obtained. Using SU8 reduces the opening temperature of these devices to only ∼400 K.