Search

HD 69479/80 is a composite‐spectrum binary whose components are a late‐G giant and an early‐A dwarf. The orbit has a period of only 91 days (which seems short for a system containing a cool giant with a radius of ∼13 solar radii), and a very small, but probably significantly non‐zero, eccentricity. We separated the component spectra by a procedure of spectral subtraction, using a standard single giant spectrum as a template, and found the closest match to the spectrum of the cool component to be that of 15 Cyg (G8 III). We measured the radial velocity of the secondary component from each uncovered spectrum, solved the SB2 orbit for the system, and derived a mass ratio m1/m2 of 1.318. Fitting synthetic spectra to the spectra of the secondary component indicated a Teff of 9250 K, log g = 3.75, and a rotational velocity of ∼90 km s−1. We determined the difference in absolute magnitude, δV, between the component stars to be 1.07 mag, the late‐type component being the brighter; we could thence calculate radii and luminosities for both components, plot their H–R diagram positions, and fit evolutionary tracks. The best‐fitting tracks indicated masses of 2.9 M⊙ for the giant and 2.2 M⊙ for the dwarf, which was fully in keeping with the mass ratio given by the SB2 orbit. The track for the dwarf star confirms that this component has begun to evolve away from the ZAMS. Fitting the corresponding isochrone to those H–R diagram positions indicated a log (age) of the system of approximately 8.60 Gyr since the cool star evolved from the ZAMS, which is a little younger than the ages deduced for many cool giants. We also detected the λ 6707‐Å lithium line in the spectrum of the giant component, thus adding to the evidence that it is near the start of its primary ascent of the red‐giant branch. [ABSTRACT FROM AUTHOR]

The article discusses the most-cited researches in history. Topics include topics of papers and citations that has allowed them to reach the top the most cited research like Bioinformatics, Phylogenetics and Statistics, a chart showing the top 10 most cited researches and information on the first systematic effort to track citations the Science Citation Index (SCI).

The systematic study of planar semimodular lattices started in 2007 with a series of papers by G. Gr¨atzer and E. Knapp. These lattices have connections with group theory and geometry. A planar semimodular lattice L is slim if M3 it is not a sublattice of L. In his 2016 monograph, “The Congruences of a Finite Lattice, A Proof-by-Picture Approach”, the second author asked for a characterization of congruence lattices of slim, planar, semimodular lattices. In addition to distributivity, both authors have previously found specific properties of these congruence lattices. In this paper, we present a new property, the Three-pendant Three-crown Property. The proof is based on the first author’s papers: 2014 (multifork extensions), 2017 (C1-diagrams), and a recent paper (lamps), introducing the tools we need. [ABSTRACT FROM AUTHOR]

Remembering the changing innovation supplanting the customary idea of paying not through money but rather by plastic denomination (credit and platinum cards), this exploration was embraced to consider the mindfulness and utilization of plastic coinage among the buyers. The subject that was thus decided for this examination is "The Impost of the Utilization of plastic denomination: A comfort or a melancholy". The example was chosen by the Stratified Random Sampling Method and comprised of purchasers including understudies, working experts, government authorities, house producers and senior nationals. The specimen size chose was 200. It was found that shoppers favor plastic coinage over paper coinage and the real advantage that the card gives to the clients is the accommodation and openness. The significant issue as indicated by them is the expanded value-based expenses and superfluous conventions to secure the cards from the budgetary foundations. They felt that the fate of plastic coinage is brilliant and as indicated by them, the following thing to come through innovation would be the utilization of advanced marks. [ABSTRACT FROM AUTHOR]

In this paper, we discuss spectrum and energy of Arithmetic function signed graphs with respect to an arithmetical function and present some results. [ABSTRACT FROM AUTHOR]

The article presents an introduction on history of the journal "Annals of Hepatology", charts and diagrams about geographical distribution of papers and articles published in journal, and lists the top papers on non-alcoholic fatty liver disease, importance of redox state, and Hepatocellular carcinoma

The accurate prediction of sea surface temperature (SST) is the basis for our understanding of local and global climate characteristics. At present, the existing sea temperature prediction methods fail to take full advantage of the potential spatial dependence between variables. Among them, graph neural networks (GNNs) modeled on the relationships between variables can better deal with space–time dependency issues. However, most of the current graph neural networks are applied to data that already have a good graph structure, while in SST data, the dependency relationship between spatial points needs to be excavated rather than existing as prior knowledge. In order to predict SST more accurately and break through the bottleneck of existing SST prediction methods, we urgently need to develop an adaptive SST prediction method that is independent of predefined graph structures and can take full advantage of the real temporal and spatial correlations hidden indata sets. Therefore, this paper presents a graph neural network model designed specifically for space–time sequence prediction that can automatically learn the relationships between variables and model them. The model automatically extracts the dependencies between sea temperature multi-variates by embedding the nodes of the adaptive graph learning module, so that the fine-grained spatial correlations hidden in the sequence data can be accurately captured. Figure learning modules, graph convolution modules, and time convolution modules are integrated into a unified end-to-end framework for learning. Experiments were carried out on the Bohai Sea surface temperature data set and the South China Sea surface temperature data set, and the results show that the model presented in this paper is significantly better than other sea temperature model predictions in two remote-sensing sea temperature data sets and the surface temperature of the South China Sea is easier to predict than the surface temperature of the Bohai Sea. [ABSTRACT FROM AUTHOR]

The article talks of the editorial board of the magazine inviting abstracts on nuclear future 2016 for publication in Volume 12 of the magazine and charts the theme for papers including radioactive waste disposal, submission deadlines, issue dates, and provisional themes for the year 2017.

Purpose – Constant changes in the environment seem to have become the biggest challenge of a modern enterprise, which emphasizes the constant need to integrate the enterprise into its changing environment. Aiming at eliminating the integration challenges, EA is proposed as a solution. The purpose of this paper is to survey and analyse the available literature on determining the role of EA in EI and also to identify gaps and state-of-the-art in research. Design/methodology/approach – This paper presents a systematic mapping study that found 50 papers in the intersection of EA and EI, these papers were surveyed, analysed, and classified with respect to research focus, research method, and paper type. Findings – Based on the analyses of the final 50 articles, the authors realized that “EA framework” is the dominating research focus of these studies. “Evaluation research” is recognized as the most common paper type in this area. However, “Experience paper” was a rare paper type in this research domain. “Constructive research” and “Case study/multiple case studies” are widely applied as the research method. “Survey”, “Delphi study” and “Grounded theory” are the least employed research methods. The conclusion was that there is a need for empirical research in this area. After analysing the articles based on their publication year, the authors also noticed a significant growth between 2004 and 2010. After 2010 the number of publications had a downward trend. Originality/value – To the knowledge of the authors, this study is the first systematic literature study regarding the role of EA in EI. There are several systematic literature reviews about the EA or EI separately but none of them has addressed the specific realm of the research. Hence, the goal of this study is to provide a map of existing literature to enable improvement of the practice with the known research results and to identify gaps for future research. [ABSTRACT FROM AUTHOR]

Few-shot knowledge graph reasoning is a research focus in the field of knowledge graph reasoning. At present, in order to expand the application scope of knowledge graphs, a large number of researchers are devoted to the study of the multi-shot knowledge graph model. However, as far as we know, the knowledge graph contains a large number of missing relations and entities, and there are not many reference examples at the time of training. In this paper, our goal is to be able to infer the correct entity given a few training instances, or even only one training instance is available. Therefore, we propose an adaptive attentional network for few-shot relational learning of knowledge graphs, extracting knowledge based on traditional embedding methods, using the Transformer mechanism and hierarchical attention mechanism to obtain hidden attributes of entities, and then using a noise checker to filter out unreasonable candidate entities. Our model produces large performance improvements on the NELL-One dataset. [ABSTRACT FROM AUTHOR]

In this article, the author discusses the significance of pre-publication peer review for a medical journal and offers tips on how to review a paper for the periodical. Topics discussed include an approach to review a research paper by first reading the abstract, the purpose of the introduction and the importance of figures and graphs in providing data in a better manner than only in text or tables.

For two classical Cepheids, CEa Cas and CEb Cas, members of the open cluster NGC 7790, we have constructed diagrams spanning a time interval of 125 years. The diagrams have the shape of parabolas, which has allowed us for the first time to determine the quadratic light elements and to calculate the rates of evolutionary changes in their periods: s yr for CEa Cas and s yr for CEb Cas, in agreement with the theoretical calculations for the second and third crossings of the instability strip, respectively. The pulsation stability test proposed by Lombard and Koen has confirmed that the changes in the periods are real. [ABSTRACT FROM AUTHOR]

Copyright of Cahiers de Topologie et Geometrie Differentielle Categoriques is the property of Andree C. EHRESMANN and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Let G = (V , E) be a simple, connected graph of order n and size m. Then, G = (V , E) is said to be edge (m , k) -choosable, if there exists a collection of subsets of the edge set, { S k (e) : e ∈ E (G) } of cardinality k , such that S k (e 1) ∩ S k (e 2) = ∅ , whenever e 1 and e 2 are incident. This paper initiates a study on edge (m , k) -choosability of certain fundamental classes of graphs and determines the maximum value of k , for which the given graph G is edge (m , k) -choosable. Also, in this paper, the relation between edge choice number and other graph theoretic parameters is discussed and we have given a conjecture on the relation between edge choice number and matching number of a graph. [ABSTRACT FROM AUTHOR]

The symmetric division deg (SDD) index is among the 148 discrete Adriatic indices that were developed about a decade ago. Motivated by the success of the SDD index, Ghorbani et al. in a recent paper proposed the inverse version of this index and called it the inverse symmetric division deg (ISDD) index. In the aforementioned paper, the graphs possessing the maximum and minimum ISDD index over the set of all tree graphs having the given order were found. The present paper addresses the problem of finding the graphs having the largest and smallest ISDD index from the set of all connected unicyclic graphs having the specified order. [ABSTRACT FROM AUTHOR]

The concept of topology defined on a set can be extended to the field of graph theory by defining the notion of graph topologies on graphs where we consider a collection of subgraphs of a graph G in such a way that this collection satisfies the three conditions stated similarly to that of the three axioms of point-set topology. This paper discusses an introduction and basic concepts to the graph topology. A subgraph of G is said to be open if it is in the graph topology TG. The paper also introduces the concept of the closed graph and the closure of graph topology in graph topological space using the ideas of decomposition-complement and neighborhood-complement. [ABSTRACT FROM AUTHOR]

This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension of a rank-metric code with given specified Ferrers diagram shape and rank distance. While the conjecture in its generality is wide open, several cases have been established in the literature. This paper contributes further cases of Ferrers diagrams and ranks for which the conjecture holds true. In addition, the proportion of maximal Ferrers diagram codes within the space of all rank-metric codes with the same shape and dimension is investigated. Special attention is being paid to MRD codes. It is shown that for growing field size the limiting proportion depends highly on the Ferrers diagram. For instance, for $[m\times 2]$ -MRD codes with rank 2 this limiting proportion is close to $1/e$. [ABSTRACT FROM AUTHOR]

A transient and static hybrid-triggered active clamp is proposed in this paper. By skillfully incorporating different detection mechanisms, the proposed clamp achieves enhanced static electrical overstress protection capability over the transient one. Furthermore, the proposed clamp achieves improved electrostatic discharge reaction speed in both human body model and charged device model events over the static one. Moreover, the superior transient-noise immunity of the proposed clamp over traditional transient ones is essentially revealed in this paper. The proposed clamp is successfully verified in a 65-nm bulk CMOS process. In addition, the design flexibility of the proposed clamp for other processes is also deeply discussed in this paper. [ABSTRACT FROM PUBLISHER]

In recent years, graph neural network algorithm (GNN) for graph semi-supervised classification has made great progress. However, in the task of node classification, the neighborhood size is often difficult to expand. The propagation of nodes always only considers the nearest neighbor nodes. Some algorithms usually approximately classify by message passing between direct (single-hop) neighbors. This paper proposes a simple and effective method, named Graph Mixed Random Network Based on PageRank (PMRGNN) to solve the above problems. In PMRGNN, we design a PageRank-based random propagation strategy for data augmentation. Then, two feature extractors are used in combination to supplement the mutual information between features. Finally, a graph regularization term is designed, which can find more useful information for classification results from neighbor nodes to improve the performance of the model. Experimental results on graph benchmark datasets show that the method of this paper outperforms several recently proposed GNN baselines on the semi-supervised node classification. In the research of over-smoothing and generalization, PMRGNN always maintains better performance. In classification visualization, it is more intuitive than other classification methods. [ABSTRACT FROM AUTHOR]

Knowledge Graph has attracted a wide range of attention in the field of recommendation, which is usually applied as auxiliary information to solve the problem of data sparsity. However, most recommendation models cannot effectively mine the associations between the items to be recommended and the entities in the Knowledge Graph. In this paper, we propose CAKR, a knowledge graph recommendation method based on the cross attention unit, which is similar to MKR, a multi-task feature learning general framework that uses knowledge graph embedding tasks to assist recommendation tasks. Specifically, we design a new method to optimize the feature interaction between the items and the corresponding entities in the Knowledge Graph and propose a feature cross-unit combined with the attention mechanism to enhance the recommendation effect. Through extensive experiments on the public datasets of movies, books, and music, we prove that CAKR is better than MKR and other knowledge graph recommendation methods so that the new feature cross-unit designed in this paper is effective in improving the accuracy of the recommendation system. [ABSTRACT FROM AUTHOR]

Graph neural networks are graph-based deep learning technologies that have attracted significant attention from researchers because of their powerful performance. Heterogeneous graph-based graph neural networks focus on the heterogeneity of the nodes and links in a graph. This is more effective at preserving semantic knowledge when representing data interactions in real-world graph structures. Unfortunately, most heterogeneous graph neural networks tend to transform heterogeneous graphs into homogeneous graphs when using meta-paths for representation learning. This paper therefore presents a novel motif-based hierarchical heterogeneous graph attention network algorithm, MBHAN, that addresses this problem by incorporating a hierarchical dual attention mechanism at the node-level and motif-level. Node-level attention aims to learn the importance between a node and its neighboring nodes within its corresponding motif. Motif-level attention is capable of learning the importance of different motifs in the heterogeneous graph. In view of the different vector space features of different types of nodes in heterogeneous graphs, MBHAN also aggregates the features of different types of nodes, so that they can jointly participate in downstream tasks after passing through segregated independent shallow neural networks. MBHAN's superior network representation learning capability has been validated by extensive experiments on two real-world datasets. [ABSTRACT FROM AUTHOR]

Unsupervised spectral feature selection (USFS) methods could output interpretable and discriminative results by embedding a Laplacian regularizer in the framework of sparse feature selection to keep the local similarity of the training samples. To do this, USFS methods usually construct the Laplacian matrix using either a general-graph or a hyper-graph on the original data. Usually, a general-graph could measure the relationship between two samples while a hyper-graph could measure the relationship among no less than two samples. Obviously, the general-graph is a special case of the hyper-graph and the hyper-graph may capture more complex structure of samples than the general graph. However, in previous USFS methods, the construction of the Laplacian matrix is separated from the process of feature selection. Moreover, the original data usually contain noise. Each of them makes difficult to output reliable feature selection models. In this paper, we propose a novel feature selection method by dynamically constructing a hyper-graph based Laplacian matrix in the framework of sparse feature selection. Experimental results on real datasets showed that our proposed method outperformed the state-of-the-art methods in terms of both clustering and segmentation tasks. [ABSTRACT FROM AUTHOR]

Commentaries are presented on Ye et al. [1]'s paper, where the authors investigated the performance of heat transfer in evaporator under the case that the parameters of the heat source and temperature of pinch point were identified. They utilized the graphical method of temperature-heat (T-Q) diagram analysis. Also, they utilized the entransy principle in their analysis. Commentaries show the reality that the graphical method of T-Q diagram analysis belongs to Professor Adrian Bejan, who first proposed it in 1977. In addition, many instances in the literature are given to indicate disputes for the entransy principle by oppositionists of "entransy" from various countries. [ABSTRACT FROM AUTHOR]

Self-tracking receivers have been suggested for satellite and mobile communication applications. In this paper, we propose and demonstrate an array receiver (Rx) architecture based on phase-locked loops. The system is capable of automatically tracking a moving source and providing direction-of-arrival (DOA) estimates calculated from array signal phase differences. After deriving the system transfer functions, we show a digital implementation of the receiver and experimentally prove its phase detection capability. In combination with an eight-element linear array and analog front ends, we build a hybrid receiver and demonstrate its DOA estimation performance in static and dynamic outdoor setups. This paper gives the details about theoretic principles, implementation concept, and realization of the proposed receiver. We demonstrate DOA errors below 4° and show the reproducibility of the results. Using dynamic experiments, we verify the tracking ability of the system, which makes it applicable to retrodirective antennas. [ABSTRACT FROM PUBLISHER]

Water Sources Diagram (WSD) has proved to be one of the most efficient methods to reduce industrial freshwater consumption and to provide a minimum amount of wastewater to be treated. Different types of industry have been benefited from the use of this technique, which resulted in great savings in the design of the effluent treatment systems. Among the successful case studies, we mention herein applications in systems with wastewater treatment, thermal and water plants' integration, oil refineries, petrochemicals, batch processes, pulp and paper plants, and textile plants. The degree of WSD maturity motivated researchers to not only improve WSD algorithms, but also extend the concept of the Sources Diagram to Source/Sink types of process. This paper presents a background of WSD progress as well as insights into future perspectives using the Sources Diagrams' concept. [ABSTRACT FROM AUTHOR]

In 2011, Beeler and Hoilman introduced the peg solitaire on graphs. The peg solitaire on a connected graph is a one-player combinatorial game starting with exactly one hole in a vertex and pegs in all other vertices and removing all pegs but exactly one by a sequence of jumps; for a path x y z , if there are pegs in x and y and exists a hole in z , then x can jump over y into z , and after that, the peg in y is removed. A problem of interest in the game is to characterize solvable (respectively, freely solvable) graphs, where a graph is solvable (respectively, freely solvable) if for some (respectively, any) vertex s , starting with a hole s , a terminal state consisting of a single peg can be obtained from the starting state by a sequence of jumps. In this paper, we consider the peg solitaire on graphs with large maximum degree. In particular, we show the necessary and sufficient condition for a graph with large maximum degree to be solvable in terms of the number of pendant vertices adjacent to a vertex of maximum degree. It is a notable point that this paper deals with a question of Beeler and Walvoort whether a non-solvable condition of trees can be extended to other graphs. [ABSTRACT FROM AUTHOR]

The path energy is a recently conceived variant of graph energy, equal to the sum of the absolute values of the eigenvalues of the path matrix [Shikare et. al, 2018]. Two graphs having equal path energy are said to be path-equienergetic. All trees of same order are mutually path-equienergetic. Members of a large class of connected regular graphs of same order and degree are mutually path-equienergetic. In this paper, we construct other types of path-equienergetic graphs and explore their spectral properties. [ABSTRACT FROM AUTHOR]

Existing approaches to indoor environmental quality in single-family residential buildings have been described, identifying their optimal preferred parameters for maintaining a human-healthy environment. The energy requirements for maintaining basic building systems (lighting, cooking, heating, ventilation, cooling) have been analyzed. Passive and active sources of energy production have been analyzed, prosumer buildings have been considered, and methods of obtaining maximum energy in winter periods and avoiding overheating of the building in summer periods have been discussed. Process schemes of using active shadow structures as an integral element with other systems acquiring energy from RES in single-family residential buildings have been presented. Architectural aspects of the use of energy-active shadow structures in residential buildings (single – family houses) have been presented together with alternative solutions. This paper presents process diagrams of the use of energy-active shadow integrated with other renewable energy sources used in single-family buildings, such as: BIPV, PVT and heat pumps, benefiting indoor environmental quality. Architectural considerations for the use of energy-active shadow structures in single-family homes have been presented along with alternative solutions. The purpose of this paper is to present a concept (especially effective in the summer) for an additional way to harvest electricity from energy-active shadows in single-family houses. [ABSTRACT FROM AUTHOR]

For a graph G, a spanning subgraph F of G is called a {P2,P5}-factor if every component of F is isomorphic to P2 or P5, where Pi denotes the path of order i. A graph G is called a ({P2,P5},k)-factor critical graph if G-V' contains a {P2,P5}-factor for any V' ⊆V(G) with |V'| = k. A graph G is called a ({P2,P5},m)- factor deleted graph if G-E' has a {P2,P5}-factor for any E' ⊆ E(G) with |E'| = m. The degree sum of G is defined by σr+1(G) = ... min X⊆V(G) n S x'X dG(x): X is an independent set of r+1 vertices }. In this paper, using degree sum conditions, we demonstrate that (i) G is a ({P2,P5},k)-factor critical graph if σr+1(G) > >(3n+4k-2)(r+1) 7 and ≥(G) = k+r; (ii) G is a ({P2,P5},m)-factor deleted graph if σ2+1(G) > (3n+2m-2)(r+1) 7 and ≥(G) = 5m 4 +r. [ABSTRACT FROM AUTHOR]

The article presents several charts concerning interdisciplinary science research, including a chart measuring the level of interdisciplinarity various fields are, the percentage of interdisciplinary papers published in 10 nations, and a citation analysis of interdisciplinary research over time.

In the last two years, many chaotic or hyperchaotic systems with megastability have been reported in the literature. The reported systems with megastability are mostly developed from their dynamic equations without any reference to the physical systems. In this paper, the dynamics of a single-link manipulator is considered to observe the existence of interesting dynamical behaviors. When the considered dynamical system is excited with (a) periodically forced input or (b) quasi-periodically forced input, it indicates the existence of megastability. This paper reports megastability in a physical dynamical system with infinitely many equilibria. The considered system has other dynamical behaviors like chaotic, quasi-periodic and periodic. These behaviors are analyzed using Lyapunov spectrum, bifurcation diagram and phase plots. The simulation results reveal that the objectives of the paper are achieved successfully. [ABSTRACT FROM AUTHOR]

Unified Modeling Language (UML) is the effective standard for modeling object-oriented software systems. However, the ambiguity of semantics and the absence of consistency among UML diagrams lead to lack of precisely defining the requirements of a system. On the other hand, formal methods are techniques and tools use the mathematical notations, and they involve the precise syntax and semantics of the unambiguous software requirements specification. It applied in early stages of Software Development Life Cycle (SDLC). Therefore, an integrated between UML specification and formal specification is required to reduce the requirements' ambiguity and error, and to improve the quality and security of software systems. This paper proposes an approach involves the combining UML use-case diagram and activity diagrams with Z language for formalization of Library Management System (LMS). The focus of this paper is on consistency between the UML diagrams to Z Schema, and then verified by using the Z / EVEs tool. [ABSTRACT FROM AUTHOR]

Charts are presented including the number of submissions received, status of manuscripts, and distribution of papers among co-editors.