Coordination Sequences Research Articles

On Cayley graphs of {\bb Z}^4.

The generating sets of {\bb Z}^4 have been enumerated which consist of integral four-dimensional vectors with components -1, 0, 1 and allow Cayley graphs without edge intersections in a straight-edge embedding in a four-dimensional Euclidean space. Owing to computational restrictions the valency of enumerated graphs has been fixed to 10. Up to isomorphism 58 graphs have been found and characterized by coordination sequences, shortest cycles and automorphism groups. To compute automorphism groups, a novel strategy is introduced that is based on determining vertex stabilizers from the automorphism group of a sufficiently large finite ball cut out from an infinite graph. Six exceptional, rather `dense' graphs have been identified which are locally isomorphic to a five-dimensional cubic lattice within a ball of radius 10. They could be built by either interconnecting interpenetrated three- or four-dimensional cubic lattices and therefore necessarily contain Hopf links between quadrangular cycles. As a consequence, a local combinatorial isomorphism does not extend to a local isotopy.

Analisis Gangguan Arus Hubung Singkat Trafo Distribusi 48-PT-33-7 Menggunakan ETAP (Studi Kasus Di Perumahan PT. Badak NGL)

The high frequency of short circuit current fault in power grid PT. Badak NGL Bontang in 2017 becomes a serious problem. One of them is the Short Circuit at Distribution Transformer 48-PT-33-7 which resulted in a feeder 48-FDR-33 trip and cut off the power to all connected loads. This research is conducted to know the value of short circuit current fault by manual calculation and compared with the simulation software ETAP 12.6 which made system modeling refers to real network configuration in the field. After that, ETAP conducted simulation and short circuit analysis in transformer 48-PT-33-7. The calculation result is known that the short circuit current value between manual calculation and ETAP simulation is relatively same, ie 553,8 A / 555 A (one phase to ground), 891,47A / 885 A (two phase), 918,16 A / 950 A (two phase to ground), 1029.41 A / 1022 A (three phases). From the simulation also known the coordination sequence of the protection system works properly when the fault occurs. So from these two results indicate that the installed protection system is in accordance with the standard in securing the power grid from short-circuiting current fault.

Coordination sequences of 2-uniform graphs

Abstract Explicit formulas for coordination sequences of all 20 plane 2-uniform graphs are proved. The proof is based on the concept of layer-by-layer growth and on the canonical representation of geodesic chains in terms of special chains called as rays. The method works for a wide class of plane periodic graphs satisfying the following condition: for each sector of layer-by-layer growth there exists a graph vertex that is initial for two rays determining the sector. This generaizes the previous results where it is required that all vertices are initial for all rays.

Denoising and predictive tracking method for the beacon in intersatellite laser communications

In the satellite-to-satellite optical communications, two optical terminals need to keep precise tracking for the beacon each other. However, in the tracking stage, the beacon recognition can be influenced by the star background light, which will result in the decline of tracking precision or the loss of the beacon. To solve these problems, we propose the centroid coordinate sequence fast Fourier transform algorithm, which distinguishes the beacon and the star background light by the frequency feature. Furthermore, for improving the tracking precision, the prediction method for the beacon is also introduced. To study the tracking precision of the algorithm, we simulated the satellite platform vibration. Finally, an experiment was performed to verify the practicability of the algorithm. Compared with the tradition method, the results showed that the prediction accuracy was improved more obviously. When the vibration frequencies are 50 and 80 Hz, the tracking precisions were improved by 58% and 33%, respectively. The new algorithm will be beneficial for improving the tracking precision and maintaining the steady laser link.

Database of open-framework aluminophosphate structures

Open-framework aluminophosphates are an important class of inorganic crystalline compounds because of their rich structural chemistry and diverse properties. We have collected 312 open-framework aluminophosphate crystal structures from published literature and established a database for these structures. For each aluminophosphate structure, we have assigned a unique index code and extracted its key chemical and crystallographic information from the original literature and the associated CIF file, such as the name, chemical formula, extra-framework species, Al/P ratio, space group, and unit cell parameters of the compound. More importantly, we have calculated the topological features for each aluminophosphate framework, including local connectivity, framework dimension, coordination sequences, vertex symbols, topology density, and the largest ring. To help experimental chemists identify their products, we have also calculated theoretical XRD peaks for all aluminophosphate structures. This database will provide important insight into understanding the structural chemistry of open-framework aluminophosphate compounds.

Analysis of the Element's Arrangement Structures in Discrete Numerical Sequences

Paper contains the results of the analysis of the laws of functioning of discrete dynamical systems, as mathematical models of which, using the apparatus of geometric images of automatons, are used numerical sequences which interpreted as sequences of second coordinates of points of geometric images of automatons. The geometric images of the laws of the functioning of the automaton are reduced to numerical sequences and numerical graphs. The problem of constructing an estimate of the complexity of the structures of such sequences is considered. To analyze the structure of sequences, recurrence forms are used that give characteristics of the relative positions of elements in the sequence. The parameters of recurrent forms are considered, which characterize the lengths of the initial segments of sequences determined by recurrence forms of fixed orders, the number of changes of recurrent forms required to determine the entire sequence, the place of change of recurrence forms, etc. All these parameters are systematized into the special spectrum of dynamic parameters used for the recurrent determination of sequences, which is used as a means of constructing estimates of the complexity of sequences. In this paper, it also analyzes return sequences (for example, Fibonacci numbers), for the analysis of the properties of which characteristic sequences are used. The properties of sequences defining approximations of fundamental mathematical constants (number e, pi number, golden ratio, Euler constant, Catalan constant, values of Riemann zeta function, etc.) are studied. Complexity estimates are constructed for characteristic sequences that distinguish numbers with specific properties in a natural series, as well as for characteristic sequences that reflect combinations of the properties of numbers.

RESEARCH ON BROKEN ROAD CONNECTION METHOD AFTER ROAD EXTRACTION FROM HIGH-RESOLUTION REMOTE SENSING IMAGE

Abstract. Aiming at the problem of disconnection after road classification of remote sensing image, this paper proposes an optimization method for broken road connection considering spatial connectivity. The method extracts the road skeleton based on the binarized image after road extraction, and uses the eight neighborhood detection algorithm to find the road breakpoints after road extraction of high-resolution remote sensing image, and removes the isolated points of the road edge according to mathematical morphology filtering. Secondly, use K-means clustering algorithm to search for road breakpoints, and eliminate invalid breakpoints; then, fit the breakpoints of each category through polynomial curves, and record the mathematics of each fitted curve expression; Finally, the coordinate sequences between each kind of breakpoint is calculated according to each fitted polynomial, and the corresponding pixel is filled with the width of the road to realize automatic detection and connection. In this paper, the images after road extraction based on the U-Net network is used to test the method. The results show that the proposed method can better connect the roads formed by road or building shadows. Especially, the single broken road , has a high integrity of the road shape after repairing. The method proposed in this paper has certain reference significance for the classification and repair of linear objects such as roads, power grids and tracks.

Zeolite LTA structure generation by Coordination Sequence and Vertex Symbol

Abstract A graph theory based computational program CVdecoder is proposed that enable us to construct a zeolite LTA structure topology from Coordination Sequence and Vertex Symbol information. During the generation process, a critical size of cluster (graph) denoting as “Minimal Fingerprint Structure (MFS)” is found. The generation process after the MFS formation is no longer requiring more topological information but vertex transitive. The cluster is also smallest characteristic cluster that could only be found in LTA, that may provide a useful view of zeolite polymorph selective nucleation.

A Quantum Image Encryption Method Based on DNACNot

The image is one of the most important means to store information, and is widely used in every aspect of life. However, the characteristics of images enable them to be easily stolen, tampered with, and copied. Researchers have proposed many encryption methods, with most applying only to traditional digital images. There are few encryption methods for quantum images, and quantum image-oriented encryption technology has begun to attract researchers' attention. This study proposes a quantum image encryption method based on DNA Controlled-Not (DNACNot). Based on the quantum image information, encryption parameters are obtained and transferred as part of a chaotic initial key. Two natural DNA sequences are amplified to obtain the DNA coordinate sequence, and a modified chaos game representation is used to modify the DNA coordinate sequence, which is then used to correct the sequence generated by chaos. The resulting sequence is converted to an integer sequence to obtain DNACNot. A controlled-not operation is performed between DNACNot and the quantum image is scrambled by bit-plane to obtain the encrypted image. The encryption method has high security, a good encryption effect, and a large key space. The method can effectively resist exhaustive, statistical, and differential attacks. The algorithm is easy to implement at a low cost. The encryption time of our proposed method is satisfactory, and the method is suitable for real-time encryption. Moreover, the encryption results can be transmitted over the internet and stored in the cloud.

Team Coordination of Team Situation Awareness in Human-Autonomy Teaming

Project Overview Team Situation Awareness (TSA), which is a part of team cognition, is a critical factor that influences team effectiveness. It can be defined as getting the right information from the right person within the right amount of time, in order to overcome an unexpected event (Gorman, Cooke, Pederson, Connor, & DeJoode, 2005). TSA is developed and maintained through team interactions, allowing for the measurement of TSA based on team interaction (Cooke & Gorman, 2009). In the current study, a specific measure, Coordinated Awareness of Situation by Teams (CAST) is used (Cooke & Gorman, 2009). CAST evaluates the effectiveness and efficiency of team interaction under “roadblock” scenarios (Gorman, Cooke, & Winner, 2006). These roadblocks represent novel situations in the task and require effective team communication and coordination. Team members must assess the situation according to their own specialized role and/or resources and coordinate with other team members to overcome each separate roadblock. In this task, effective communication refers to team anticipation. That is, each team member needs to anticipate each other’s needs by pushing information rather than pulling information during the task (Demir, McNeese, & Cooke, 2017). In this study, we examined how pushing and pulling information, and CAST were associated with Team Situation Awareness (TSA) in both Human-Autonomy (HAT) and all-human teams in simulated Remotely Piloted Aircraft System (RPAS) task environment. In this research, we integrated the synthetic agent to the Cognitive Engineering Research on Team Tasks Remotely Piloted Aircraft Systems - Synthetic Task Environment (CERTT-RPAS-STE) which was designed to be both a flexible research platform and a realistic task environment with a view to researching team performance and interaction-based measures of team cognition. In the simulated CERTT testbed, there are three heterogeneous teammates who need to take good photos of each target waypoint by communicating via text-chat: (1) the navigator who creates a dynamic flight plan and provides information about the waypoints, the RPA’s airspeed, and altitude restrictions to the pilot; (2) the pilot, who controls the RPA’s heading, altitude, and airspeed, and negotiates with the photographer in order to take a good photo; and (3) the photographer, who monitors sensor equipment in order to take photographs of target waypoints and sends feedback to the other team members about the quality of the photo. This project aimed to understand how team behaviors and team performance differed between HATs and all-human teams in RPAS operations: (1) the synthetic condition—the pilot role was given to the synthetic teammate, which was an ACT-R based cognitive model (which had a limited interaction ability, see Ball et al., 2010; Demir et al., 2015); (2) the control condition—the pilot was a randomly selected human participant, just like the other two participants; and (3) the experimenter condition—one of the experimenters served as an expert pilot. Experimenter condition utilized a Wizard of Oz paradigm in which a trained experimenter (located in a separate room) used a script to imitate a synthetic teammate and communicated with participants in limited communication behaviors but pushing and pulling information in a timely manner (robust coordination). Method There were 30 teams (10 for each condition): control teams consisted of three participants randomly assigned to each role; synthetic and experimenter teams included two participants randomly assigned to the navigator and photographer roles. The experiment took place over five 40-minute missions, and the goal was to take as many “good” photos of ground targets as possible while avoiding alarms and rule violations. During each mission, teams were presented with “roadblocks” by the introduction of a new, ad hoc target waypoint. We collected several measures, but we focused on: the proportion of roadblocks overcome per mission as an outcome measure of TSA; the CAST which is a coordination sequence of team interaction across the team members (i.e. which team members share with team members their experience during the roadblock); and verbal behaviors such as pushing and pulling information. Results and discussion In this team task, effective teamwork involves anticipating the needs of teammates, which in turn means pushing information before it is requested. However, in addition to anticipation, effective coordination is also needed during roadblocks. HATs demonstrated significantly lower levels of CAST than all-human teams. These results indicate that HATs’ lack of anticipation and coordination resulted in poorer TSA performance. These findings help HATs to grow its coordination and communication methodologies. Finally, future studies might examine the relationships highlighted in this study via nonlinear measures in terms of team stability and flexibility based on their communication and coordination patterns during the novel events. HAT is here to stay but improvements to human-machine interactions must continue if we are to improve team effectiveness.

Analysis of attribute domain for geometrical gesture performed by arm movements

<span>Hand gesture recognition commonly uses a camera to track hand movements and transformed into gesture database by using various computational approaches. Motion tracking utilized to map coordinate point of the subject movement, either in skeletal model or marker tracing. Data from motion trackers usually contains massive coordinate sequences of marker movement. A reliable method is required to select best features and analyze these data. However, the current issue whether the selected features and data presentation are significant for the research or not. This research brings the concept of ontology design for arm gesture recognition systems by utilizing the motion capture system. Ontology is the conceptual structure mainly used to retrieve information by establishing relation in complex data model. The proposed ontology framework is divided into three domains which are knowledge domain, attribute domain and process domain. Knowledge domain holds pre-processed gestural data from motion capture. The attribute domain is that the level where all the attribute elements were presented. This paper shows the analysis of the datasets in attribute domain. The analysis is divided into two parts which is precision measure and ANOVA test. Both analyses are to prove the reliability of datasets in attribute domain. The precision measure is used to remove all the common data for all gesture. A statistical analysis of p-value is lower than 0.01 which means the gestural data are statistically significant to be used for the similarity measure.</span>

Modeling a recurrent, hidden dynamical system using energy minimization and kernel density estimates.

In this paper we develop a kernel density estimation (KDE) approach to modeling and forecasting recurrent trajectories on a suitable manifold. For the purposes of this paper, a trajectory is a sequence of coordinates in a phase space defined by an underlying hidden dynamical system. Our work is inspired by earlier work on the use of KDE to detect shipping anomalies using high-density, high-quality automated information system data as well as our own earlier work in trajectory modeling. We focus specifically on the sparse, noisy trajectory reconstruction problem in which the data are (i) sparsely sampled and (ii) subject to an imperfect observer that introduces noise. Under certain regularity assumptions, we show that the constructed estimator minimizes a specific energy function defined over the trajectory as the number of samples obtained grows.

Embedded Walking Algorithm for Biped Humanoid Robot with 17 Degrees-of-Freedom

The realization of the control algorithm consists of two main stages: planning of a joint coordination sequence and implementation of an embedded walking algorithm in the Arduino Mega 2560 hardware platform. The joint coordination sequence consists of 13 steps in order for the humanoid robot to move forward without falling. The embedded walking algorithm is realized around the operating points of the servo motors. The software is developed in Arduino IDE in C language.

Coordination shells and coordination numbers of the vertex graph of the Ammann-Beenker tiling.

The vertex graph of the Ammann-Beenker tiling is a well-known quasiperiodic graph with an eightfold rotational symmetry. The coordination sequence and coordination shells of this graph are studied. It is proved that there exists a limit growth form for the vertex graph of the Ammann-Beenker tiling. This growth form is an explicitly calculated regular octagon. Moreover, an asymptotic formula for the coordination numbers of the vertex graph of the Ammann-Beenker tiling is also proved.

Detection of the technical-tactical pattern of the scoring actions in judo in the men’s category of –73 kg

ABSTRACTThe scoring actions determine the judoka winner in a combat. The scientific community has studied them, but these studies are especially descriptive. To this end, the purpose of this study is to discover and analyse the technical-tactical patterns of the scoring actions in judo combat. Ninety-one scoring actions were analysed (−73 kg males, Judo World Championship 2017) using different commonly used analysis techniques within the observational methodology: traditional statistical analysis, T-Patterns detection, sequential analysis delays and polar coordinates analysis. The tendency of scoring with leg and arm projections prevails (seoi-otoshi, ouchi-gari, tai-otoshi and uchi-mata). The more efficient technique on the ground was yoko-shiho-gatame. The waza-ari is three times more frequent than the ippon. The actions score mainly during the final stages of combat. The judokas with favourable scores score more points through immobilisations, with scores equal to leg techniques and with scores against sacrificial techniques. It is important to conduct the combat’s initiative because in most the actions, the judoka that scores has no penalties and the one who does not score does. A common pattern is achieving a waza-ari with a direct leg attack technique or a static arm technique.

A New Method for Multipath Filtering in GPS Static High-Precision Positioning.

It is well known that multipath is one of the main sources of errors in GPS static high precision positioning of short baselines. Most algorithms for reducing multipath manipulate the GPS double difference (DD) observation residuals as input signal in GPS signal processing. In the traditional multipath mitigation methods, applying the wavelet transform (WT) to decompose the GPS DD observation residuals for identifying the multipath disturbance cannot effectively filter out the white noise of the high frequency part of the signal, and it is prone to edge effect. In this paper, for extracting multipath, a wavelet packet algorithm based on two-dimensional moving weighted average processing (WP-TD) is proposed. This algorithm can not only effectively filter out the white noise of the high frequency part of the signal, but also weaken the influence of the edge effect. Furthermore, considering the repeatability of multipath error in static positioning, we propose a method for determining the level of wavelet packet decomposition layers which make multipath extraction more effectively. The experimental results show that the corrected positioning accuracy is 14.14% higher than that of the traditional wavelet transform when applying the obtained multipath to DD coordinate sequences for position correction.

The effect of organic cations on the structure of uranyl glutarate complexes

Two novel uranyl glutarate coordination polymers were characterized by single crystal X-ray diffraction and IR spectroscopy. The structure of the first compound with [N(CH3)3(CH2C6H5)]2[(UO2)2(C5H6O4)3]·H2O (1) composition (where C5H6O42− = C3H6(COO−)2 = glt2− are glutarate anions) contains [(UO2)2(glt)3]2− chains with A2Q023 crystallochemical formula (CCF) (A = UO22+, Q02 = C5H6O42−). The second structure with [N(C2H5)4]2[(UO2)3(C5H6O4)4(H2O)2]·2H2O (2) composition contains another type of chains with [(UO2)3(glt)4(H2O)2]2− composition and A3Q024M12 (A = UO22+, Q02 = glt2−, M1 = H2O) CCF. 1D uranyl glutarate complexes in 1 and 2 differ in UO22+:glt2− ratio leading to the different topology. While [(UO2)2(glt)3]2− chains in 1 have a simple “ladder” topology common for uranyl dicarboxylates structures, in 2 [(UO2)3(glt)4(H2O)2]2− units have additional spacing due to the presence of extra uranium atom with different coordination. The topological difference is described in terms of coordination sequences. The analysis of non-covalent interactions in 1 and 2 was done in topos-Intermol program package and the small contribution of π-staking was revealed in 1.

Suite of Organoplatinum(II) Triangular Metallaprism: Aggregation-Induced Emission and Coordination Sequence Induced Emission Tuning.

A series of triangular metallaprisms with a kinetically inert Pt-N bond have been synthesized from the stepwise assembly of a Pt-corner, linear linker 4,4'-bipy (4,4'-bipy = 4,4'-bipyridine) and triangular ligand [tpb or tpt, tpb = tris(4-pyridyl)benzene, tpt = tris(4-pyridyl)triazine]. The use of an unsymmetrical [Pt(HL)]-corner (H2L = 2,6-diphenylpyridine) leads to novel isostructural products. Phenyl rotation at the metal-corners endows these complexes with good aggregation-induced emission (AIE) function, with varied activities across the isostructural complexes. The coordination sequence of electron-deficient ligand tpt also imparts significant influence on the complex emission. These organoplatinum triangular metallaprisms thus provide a good model to study the influence of building blocks and coordination sequence on the luminescence of supramolecules.

Preprocessing of GPS Coordinate Sequence Based on Singular Spectrum Analysis

Since it is inevitable existence of unknown mutation signals, gross error and data missing in the GPS station coordinates, while the nonlinear signals and misalignment are also neglected by means of piecewise linear detection, thus a novel algorithm called jump determination scheme, which is based on singular spectrum analysis (SSA), is proposed here. The results of real data analysis and simulation tests indicate that the SSA-based pre-processing method has properly detected the gross error and recovered the missing data. Meanwhile, owing to taking into account the correlation in the position time series, it can effectively avoid the influence of gross error on the accurate determination of each uncertain jump. In addition, it can retain the intrinsic characteristics in station coordinates, which has vital significance for the gross error detection and missing data recovery. By this new method, even if the missing rate of data reaches 10% or more, we can eliminate the gross error and then obtain complete data with an accuracy of better than 5 mm and 1 cm for the horizontal components and the height component, respectively.

Experimental research on daily deformation monitoring of bridge using BDS/GPS

Multi-constellation will greatly improve the accuracy, completeness, effectiveness and continuity of the Beidou Navigation Satellite System (BDS)/Global Positioning System (GPS) bridge health monitoring. Firstly, the reliability of the monitoring results was ensured by using the dual-base station mode. For the dynamic post-processing mode, the empirical mode decomposition–wavelet transform coupled model was used to reduce the noise of original coordinate sequences. Finally, the self-programmed software was adopted to solve the observation data of 48 consecutive hours and thus analyse the daily deformation characteristics of the bridge. The experiment results show that under the good conditions of the satellite number and their geometric distribution, the monitoring results of the BDS/GPS combination system were in good agreement with the results of the GPS single system and BDS single system. However, in the complex environment of the bridge, especially when the signals were severely affected, the advantages of using the BDS/GPS combination system for deformation monitoring were more obvious.