Narrow Results

Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the results of classical binary analysis, in the sense that all signal changes appearing in binary analysis are also predicted by the simulation. For feedback-free circuits of 1- and 2-input gates, it had been shown that the converse also holds, if wire delays are taken into account. In this paper we generalize this result. First, we prove that, for any feedback-free circuit N of arbitrary gates, there exists an expanded circuit, constructed by adding a number of delays to each wire of N, such that binary analysis of covers transient simulation of N. For this result, the number of delays added to a wire is obtained from the transient simulation. Our second result involves adding only one delay per wire, which leads to the singular circuit of N. This result is restricted to circuits consisting only of gates realizing functions from the set , functions obtained by complementing any number of inputs and/or the output of a function from , and FORKS. The numbers of inputs of the AND, OR and XOR gates are arbitrary, and all functions of two variables are included. We show that binary analysis of such a circuit covers transient simulation of N. We also show that this result cannot be extended to arbitrary gates, if we allow only a constant number of delays per wire.

Dyadic rationals are rationals whose denominator is a power of 2. Dyadic triangles and dyadic polygons are, respectively, defined as the intersections with the dyadic plane of a triangle or polygon in the real plane whose vertices lie in the dyadic plane. The one-dimensional analogs are dyadic intervals. Algebraically, dyadic polygons carry the structure of a commutative, entropic and idempotent algebra under the binary operation of arithmetic mean. In this paper, dyadic intervals and triangles are classified to within affine or algebraic isomorphism, and dyadic polygons are shown to be finitely generated as algebras. The auxiliary results include a form of Pythagoras' theorem for dyadic affine geometry.

We fit Chandra HETGS data obtained for the unusual X-ray binary SS 433. While line strengths and continuum levels hardly change, the jet Doppler shifts show aperiodic variations that probably result from shocks in interactions with the local environment. The X-ray and optical emission line regions are found to be related but not coincident as the optical line emission persists for days while the X-ray emission lines fade in less than 5000 s. The X-ray spectrum of the blueshifted jet shows over two dozen emission lines from plasma at a variety of temperatures. The emission measure distribution derived from the spectrum can be used to test jet cooling models.

In binary systems, the rotation of neutron stars can be spun up by the accreted material, and at the same time the decay of their magnetic fields occur in the accretion phase. As a result, the spin period may arrive at a minimum of about 1.5 ms, corresponding to a bottom value of the magnetic field ~ 10⁸ G. Taking the conditions: (i) initial magnetic field varying from 10¹¹ G to 10¹³ G while setting period as 100 s, (ii) initial period as 1–100 s at B = 5 × 10¹²G, we find that this minimum of spin period seems independent of these initial conditions.

The paper analyzes conditions for preserving the shape properties from the initial data to the limit curves of the binary three-point approximating subdivision scheme. We provide suitable conditions on the initial data utilizing the tension parameter $\omega$, thus the scheme can maintain three important shape properties, namely positivity, monotonicity and convexity in the limit curves. The use of derived conditions is illustrated in few examples, which offers more flexibility in the generation of smooth limit curves endowed with shape preserving properties.

One method to increase classifier accuracy is using Feature Selection (FS). The main idea in the FS is reducing complexity, eliminating irrelevant information, and deleting a subset of input features that either have little information or have no information for prediction. In this paper, three efficient binary methods based on the Symbiotic Organisms Search (SOS) algorithm were presented for solving the FS problem. In the first and second methods, several S_shaped and V_shaped transfer functions were used for the binarization of the SOS, respectively. These methods were called BSOSS and BSOSV. In the third method, two new operators called Binary Mutualism Phase (BMP) and Binary Commensalism Phase (BCP) were presented for binarization of the SOS, named Efficient Binary SOS (EBSOS). The proposed methods were run on 18 standard UCI datasets and compared to the base and important meta-heuristic algorithms. The test results showed that the EBSOS method has the best performance among the three proposed methods for the binarization of the SOS. Finally, the EBSOS method was compared to the Genetic Algorithm (GA), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO) Algorithm, Binary Flower Pollination Algorithm (BFPA), Binary Grey Wolf Optimizer (BGWO) Algorithm, Binary Dragonfly Algorithm (BDA), and Binary Chaotic Crow Search Algorithm (BCCSA). In addition, the EBSOS method was executed on the spam email dataset with the KNN, NB, SVM, and MLP classifiers. The results showed that the EBSOS method has better performance compared to other methods in terms of feature count and accuracy criteria. Furthermore, it was practically evaluated on spam email detection in particular.

It is at present well known that conditions at some massive binary systems allow acceleration of particles and production of the GeV-TeV γ-rays. However, which particles are responsible for this emission and what radiation processes are engaged is at present not completely clear. We discuss what parameters can determine the acceleration process of particles and high energy radiation produced by them within massive binary systems.