293 research outputs found

    Search Efficient Binary Network Embedding

    Full text link
    Traditional network embedding primarily focuses on learning a dense vector representation for each node, which encodes network structure and/or node content information, such that off-the-shelf machine learning algorithms can be easily applied to the vector-format node representations for network analysis. However, the learned dense vector representations are inefficient for large-scale similarity search, which requires to find the nearest neighbor measured by Euclidean distance in a continuous vector space. In this paper, we propose a search efficient binary network embedding algorithm called BinaryNE to learn a sparse binary code for each node, by simultaneously modeling node context relations and node attribute relations through a three-layer neural network. BinaryNE learns binary node representations efficiently through a stochastic gradient descent based online learning algorithm. The learned binary encoding not only reduces memory usage to represent each node, but also allows fast bit-wise comparisons to support much quicker network node search compared to Euclidean distance or other distance measures. Our experiments and comparisons show that BinaryNE not only delivers more than 23 times faster search speed, but also provides comparable or better search quality than traditional continuous vector based network embedding methods

    Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data

    Full text link
    Graph condensation, which reduces the size of a large-scale graph by synthesizing a small-scale condensed graph as its substitution, has immediate benefits for various graph learning tasks. However, existing graph condensation methods rely on the joint optimization of nodes and structures in the condensed graph, and overlook critical issues in effectiveness and generalization ability. In this paper, we advocate a new Structure-Free Graph Condensation paradigm, named SFGC, to distill a large-scale graph into a small-scale graph node set without explicit graph structures, i.e., graph-free data. Our idea is to implicitly encode topology structure information into the node attributes in the synthesized graph-free data, whose topology is reduced to an identity matrix. Specifically, SFGC contains two collaborative components: (1) a training trajectory meta-matching scheme for effectively synthesizing small-scale graph-free data; (2) a graph neural feature score metric for dynamically evaluating the quality of the condensed data. Through training trajectory meta-matching, SFGC aligns the long-term GNN learning behaviors between the large-scale graph and the condensed small-scale graph-free data, ensuring comprehensive and compact transfer of informative knowledge to the graph-free data. Afterward, the underlying condensed graph-free data would be dynamically evaluated with the graph neural feature score, which is a closed-form metric for ensuring the excellent expressiveness of the condensed graph-free data. Extensive experiments verify the superiority of SFGC across different condensation ratios.Comment: Accepted by NeurIPS 202

    Research on deep hole drilling vibration suppression based on magnetorheological fluid damper

    Get PDF
    Based on the working principle of magnetorheological fluid damping, in this paper, a set of squeezing mode Magneto-rheological Fluid (MRF) dampers is designed for drilling vibration suppression in deep hole machines. Elaborate analysis of the correlativity between the dynamic morphology trajectory of the machined hole surface, the vibration of the drilling tool-shaft, and the theoretical derivation of the damping force, is put forward in accordance with the Bingham model and Euler-Bernoulli beam Equation. Simultaneously, the contrast analysis of the vibration suppression effect is carried out through the drilling experiments with and without an MRF damper. In addition, a series of measurements on the vibration characteristics of the drilling shaft, the drilling tool and the guide surface wear patterns, and the machine hole surface are analyzed, respectively. Both the drilling experiments and theory studies have revealed that the strength of the magnetic field changed with the drill shaft at different levels of vibration. The MRF damper could suppress the vibration with nonlinear characteristics initiatively and instantaneously, by variable damping, which can eventually improve the surface roughness. In addition, according to the phenomenon of tool tipping, the breakage of the guide bars and the machine hole surface deduces the condition of the vibration effect objectively

    Dynamic reconfiguration of distribution network considering the uncertainty of distributed generation and loads

    Get PDF
    This study presents a new methodology to perform the distribution network dynamic reconfiguration (DNDR), taking into consideration the stochastic variations of loads and distributed generation (DG) of power. To solve the heavy computational burden that exists in traditional algorithms of the DNDR, this study first establishes the nodal sensitivity models to calculate the nodal variations caused by nodal power variations. Then, the DNDR is executed utilizing a co-evolutionary algorithm with the goal of loss minimization. The stochastic power flow calculations (PFCs) based on the nodal sensitivity are performed in the DNDR to handle the power fluctuations of the DGs and loads. Finally, the modified IEEE 33-bus test system and a practical distribution system are used for simulations. The simulation results validate the quickness and effectiveness of the proposed DNDR method
    • …
    corecore