Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35

ISE: An Integrated Search Environment. The manual

Integrated Search Environment (ISE), a software package that implements hierarchical searches with meta-control, is described in this manual. ISE is a collection of problem-independent routines to support solving searches. Mainly, these routines are core routines for solving a search problem and they handle the control of searches and maintain the statistics related to searches. By separating the problem-dependent and problem-independent components in ISE, new search methods based on a combination of existing methods can be developed by coding a single master control program. Further, new applications solved by searches can be developed by coding the problem-dependent parts and reusing the problem-independent parts already developed. Potential users of ISE are designers of new application solvers and new search algorithms, and users of experimental application solvers and search algorithms. The ISE is designed to be user-friendly and information rich. In this manual, the organization of ISE is described and several experiments carried out on ISE are also described.

Chu, Lon-Chan↗

Enabling cooperative adaptive cruise control on strings of vehicles with heterogeneous dynamics and powertrains

Recent studies have shown that positive impact of Cooperative Adaptive Cruise Control (CACC) can only be guaranteed as market penetration rate increases. Removing the string homogeneity constraint is essential to encourage widespread adoption. In this work, a hierarchical architecture is proposed to enable CACC on vehicles with not only mixed dynamics but also different powertrain types. A low-level layer deals with the vehicle and powertrain dynamics to provide accurate and consistent reference speed tracking response. The high-level layer uses: (1) a Linear Parameter Varying feedback system to provide loop stability, robustness and enforce a variable time gap policy and (2) a feedforward system that processes Vehicle-to-Vehicle information to enhance string stability and response bandwidth, by dealing with the string heterogeneity. A gap management strategy is built on top of the CACC architecture to handle gap setting changes or cut-in/out situations, via a dynamics constrained time gap trajectory planning algorithm. We report the proposed work has been designed, developed and validated on three different real passenger vehicles on public highways and test tracks, showing the potential of the proposed algorithm to enable robust string stable CACC, despite the different dynamics and powertrains considered.

33 ADVANCED PROPULSION SYSTEMS↗

Geometric remapping of particle distributions in the Discrete Element Model for Sea Ice (DEMSI v0.0)

Abstract. A new sea ice dynamical core, the Discrete Element Model for Sea Ice (DEMSI), is under development for use in coupled Earth system models. DEMSI is based on the discrete element method, which models collections of ice floes as interacting Lagrangian particles. In basin-scale sea ice simulations the Lagrangian motion results in significant convergence and ridging, which requires periodic remapping of sea ice variables from a deformed particle configuration back to an undeformed initial distribution. At the resolution required for Earth system models we cannot resolve individual sea ice floes, so we adopt the sub-grid-scale thickness distribution used in continuum sea ice models. This choice leads to a series of hierarchical tracers depending on ice fractional area or concentration that must be remapped consistently. The circular discrete elements employed in DEMSI help improve the computational efficiency at the cost of increased complexity in the effective element area definitions for sea ice cover that are required for the accurate enforcement of conservation. An additional challenge is the accurate remapping of element values along the ice edge, the location of which varies due to the Lagrangian motion of the particles. In this paper we describe a particle-to-particle remapping approach based on well-established geometric remapping ideas that enforces conservation, bounds preservation, and compatibility between associated tracer quantities, while also robustly managing remapping at the ice edge. One element of the remapping algorithm is a novel optimization-based flux correction that enforces concentration bounds in the case of nonuniform motion. We demonstrate the accuracy and utility of the algorithm in a series of numerical test cases.

58 GEOSCIENCES↗

Co-Optimization of Velocity and Charge-Depletion for Plug-In Hybrid Electric Vehicles: Accounting for Acceleration and Jerk Constraints

Abstract Recent advances in vehicle connectivity and automation technologies promote advanced control algorithms that co-optimize the longitudinal dynamics and powertrain operation of hybrid electric vehicles. Typically, a sequential optimization with the vehicle dynamics optimized followed by powertrain optimization is adopted to manage a number of complexities such as the inherent mixed-integer nature of the hybrid powertrain, the numerous state and control variables, the differing time scales of vehicle and powertrain subsystems, time-varying state constraints, and large horizon lengths. Instead, we solve the offline optimization problem in a centralize manner assuming exact knowledge of the lead vehicle's position over the entire trip by applying a discrete-time single shooting-based numerical approach, Discrete Mixed-Integer Shooting (DMIS), including a linearly increasing computational complexity to the problem horizon. In particular, the hierarchical problem structure is exploited to decompose the computationally intensive Hamiltonian minimization step into a set of low-dimensional optimizations. DMIS allows us to compute the direct fuel minimization problem including the vehicle and powertrain dynamics in a centralized manner to its full horizon while systematically tuning weighting factors that penalize passenger discomfort. For the first time, this study reveals that practically implemented sequential optimization exhibits similar fuel optimality as co-optimization when a certain level of passenger comfort is required.

Automation & Control Systems↗

Development of a knoweledge-based system for validating finite element models

The finite element modeling of an airframe structure requires knowledge of general purpose programs such as NASTRAN as well as a detailed understanding of the airframe structure. Due to the sophistication of general purpose programs such as NASTRAN, a substantial investment in time and effort is required to gain expertise in using them effectively. This paper describes the development of an expert system used in the validation of NASTRAN based finite element models. Experts in the NASTRAN based finite element modeling of airframe structures were interviewed to document, understand, and represent their knowledge and reasoning in the expert system. Finite element stress analysis and internal loads reports generated by the experts were reviewed to determine expert resolution of problem areas. As a result, areas requiring expert assistance in the modeling of the airframe structures were identified. The finite element input data is represented as a set of 'facts'. A rule based representation is used to code the expert knowledge. A hierarchical set of rules are applied. The expert system first acts as an intelligent front end to insure that all the prerequisites needed to perform the analysis are present. This includes material properties, boundary conditions, and connectivity information. The next step examines if incompatible sets of elements are connected. The succeeding step examines if the specific airframe component is modeled by the appropriate set of elements. The next and final step examines if the airframe members used are adequate to represent the anticipated state of stress. The expert system is designed to inform the user the severity of the error, the likely consequence and possible remedial action. The shell used in the development of the expert system is CLIPS. CLIPS contains a forward chaining inference engine based on the Rete algorithm. CLIPS may be implemented on most personal computers as well as mini computers and mainframes. The approach taken is general and can be implemented using commercially available expert system shells.

Munir, N. I.↗

Generating Real-Time Robotics Control Software from SysML

In this paper, we outline an approach for autogenerating real-time robotics control code from hierarchical state machines and hardware configurations encoded in Systems Modeling Language (SysML). We propose a software architecture that provides an abstract SysML layer with access to device state information and a set of primitive device commands, such as move actuator and release brake, allowing a user to build up a complete functional state machine directly in SysML. The SysML diagram is then exported to a standard SCXML file format and subsequently used to auto-generate hardware control code. Once this architecture is in place, the only explicit code elements that need to be written are the primitive device commands, which can be easily unit tested and reused across different systems. The motivation for this work was the need for a test bed that enables the rapid prototyping of mechanisms and control algorithms for a spacecraft that could ultimately be used for preparing Martian rock samples for their return to Earth. To this end, our software system was also designed to allow for the run-time specification of the hardware layout in SysML, with the hardware-level control functions kept agnostic to the specific parameters or communication bus of any particular device. Further, we outline a system for specifying both the state machine and hardware configuration in the MagicDraw IDE in such a way that the system can be simulated before any code is generated. The resultant software system is easy to debug, understand, and allows users to choose how much information is encoded as a visual or text-based representation.

Godart, Peter↗

Piecewise-Constant-Model-Based Interior Tomography Applied to Dentin Tubules

Dentin is a hierarchically structured biomineralized composite material, and dentin’s tubules are difficult to study in situ. Nano-CT provides the requisite resolution, but the field of view typically contains only a few tubules. Using a plate-like specimen allows reconstruction of a volume containing specific tubules from a number of truncated projections typically collected over an angular range of about 140°, which is practically accessible. Classical computed tomography (CT) theory cannot exactly reconstruct an object only from truncated projections, needless to say a limited angular range. Recently, interior tomography was developed to reconstruct a region-of-interest (ROI) from truncated data in a theoretically exact fashion via the total variation (TV) minimization under the condition that the ROI is piecewise constant. In this paper, we employ a TV minimization interior tomography algorithm to reconstruct interior microstructures in dentin from truncated projections over a limited angular range. Compared to the filtered backprojection (FBP) reconstruction, our reconstruction method reduces noise and suppresses artifacts. Volume rendering confirms the merits of our method in terms of preserving the interior microstructure of the dentin specimen.

59 BASIC BIOLOGICAL SCIENCES↗

U.S. IMERG Status

The U.S. Science Team’s Integrated Multi-satellitE Retrievals for the Global Precipitation Measurement (GPM) mission (IMERG) product provides estimates of surface precipitation rate and related information on a global 0.1° half-hour grid. It is run three times at increasingly longer latency and higher information input to serve different communities. This presentation will briefly summarize the major upgrades included in Version 07. The Goddard Profiling (GPROF) algorithm (applied to passive microwave sensor data from the GPM virtual constellation) and the Combined Radar-Radiometer Algorithm (CORRA) that provide input to IMERG V07 are both improved, and the new Precipitation Estimation from Remotely Sensed Information Using Artificial Neural Networks–Dynamic Infrared Rain Rate (PDIR) algorithm is being applied to infrared data, which employs an additional, warmer infrared temperature threshold than the previous infrared scheme and a deep neural network. V07 has improved bias performance as a result of calibrations that now employ the entire swath widths of CORRA and GPROF GPM Microwave Imager precipitation estimates. As well, time continuity in precipitation features is improved as a result of changes to the Kalman filter that approximately preserve the local histogram of precipitation rates (Scheme for Histogram Adjustment with Ranked Precipitation Estimates in the Neighborhood, or SHARPEN), and that better account for differences in sensor performance. A long-standing bug in the geolocation that shifted grid values 0.1° to the east in the latitude band 70°N-S has been corrected. Other changes in V07 include a hierarchical selection among motion vector sources to address deficiencies in the precipitation propagation near orography, an update to the precipitation phase specification for improved consistency with current inputs, and a renewed effort to implement climatological gauge adjustment to the near-real-time Runs. Early evaluations of V07 IMERG show interesting behavior across the TRMM orbit boost that is highly relevant to the planned orbit boost for the GPM Core observatory.

GPM↗

Decision-Tree Formulation With Order-1 Lateral Execution

A compact symbolic formulation enables mapping of an arbitrarily complex decision tree of a certain type into a highly computationally efficient multidimensional software object. The type of decision trees to which this formulation applies is that known in the art as the Boolean class of balanced decision trees. Parallel lateral slices of an object created by means of this formulation can be executed in constant time considerably less time than would otherwise be required. Decision trees of various forms are incorporated into almost all large software systems. A decision tree is a way of hierarchically solving a problem, proceeding through a set of true/false responses to a conclusion. By definition, a decision tree has a tree-like structure, wherein each internal node denotes a test on an attribute, each branch from an internal node represents an outcome of a test, and leaf nodes represent classes or class distributions that, in turn represent possible conclusions. The drawback of decision trees is that execution of them can be computationally expensive (and, hence, time-consuming) because each non-leaf node must be examined to determine whether to progress deeper into a tree structure or to examine an alternative. The present formulation was conceived as an efficient means of representing a decision tree and executing it in as little time as possible. The formulation involves the use of a set of symbolic algorithms to transform a decision tree into a multi-dimensional object, the rank of which equals the number of lateral non-leaf nodes. The tree can then be executed in constant time by means of an order-one table lookup. The sequence of operations performed by the algorithms is summarized as follows: 1. Determination of whether the tree under consideration can be encoded by means of this formulation. 2. Extraction of decision variables. 3. Symbolic optimization of the decision tree to minimize its form. 4. Expansion and transformation of all nested conjunctive-disjunctive paths to a flattened conjunctive form composed only of equality checks when possible. If each reduced conjunctive form contains only equality checks and all of these forms use the same variables, then the decision tree can be reduced to an order-one operation through a table lookup. The speedup to order one is accomplished by distributing each decision variable over a surface of a multidimensional object by mapping the equality constant to an index

James, Mark↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Time Acceleration Methods for Advection on the Cubed Sphere

Climate simulation will not grow to the ultrascale without new algorithms to overcome the scalability barriers blocking existing implementations. Until recently, climate simulations concentrated on the question of whether the climate is changing. The emphasis is now shifting to impact assessments, mitigation and adaptation strategies, and regional details. Such studies will require significant increases in spatial resolution and model complexity while maintaining adequate throughput. The barrier to progress is the resulting decrease in time step without increasing single-thread performance. In this paper we demonstrate how to overcome this time barrier for the first standard test defined for the shallow-water equations on a sphere. This paper explains how combining a multiwavelet discontinuous Galerkin method with exact linear part time-evolution schemes can overcome the time barrier for advection equations on a sphere. The discontinuous Galerkin method is a high-order method that is conservative, flexible, and scalable. The addition of multiwavelets to discontinuous Galerkin provides a hierarchical scale structure that can be exploited to improve computational efficiency in both the spatial and temporal dimensions. Exact linear part time-evolution schemes are explicit schemes that remain stable for implicit-size time steps.

54 ENVIRONMENTAL SCIENCES↗

Prediction of softening kinetics and recrystallization texture in non-isothermally annealed bulged tubes using CPFEM and CA models

A hierarchically coupled cellular automata (CA) model, crystal plasticity finite element method (CPFEM), and thermal finite element (FE) model is developed to predict the softening kinetics of the bulged steel tube during non-isothermal annealing. Through the developed model, the kinetics of softening mechanisms including static recovery (SRV) and static recrystallization (SRX), as well as the recrystallization texture are predicted. Later, the Johnson-Mehl-Avrami-Kohnogorov (JMAK) model based on the predicted SRX data is developed to interpret the recrystallization behavior of the material. To perform this study, diverse experimental tests including tube hydroforming (THF), annealing, uniaxial tensile test, hardness test, as well as microstructure observations through optical microscopy and Electron Backscatter Diffraction (EBSD) tests on steel tube are performed. The obtained experimental data are utilized to calibrate and verify the implemented CPFEM model for simulation of THF process, thermal FE model for prediction of the local temperature over annealing time, and CA algorithm for modeling of the softening kinetics and texture evolution throughout the annealing process. The study shows that the predicted deformation characteristics, softening kinetics, recrystallization texture and temperature profile during non-isothermal annealing are in good agreement with experimental data. During the annealing process, a total of four stages for the kinetics of softening mechanisms is observed: No softening; SRV only; SRV dominant; and SRX dominant. During the progress of SRX, the behavior of recrystallization is abruptly changed, confirming that two different mechanisms are controlling the kinetics of transformation.

36 MATERIALS SCIENCE↗

Evaluating lightweight unsupervised online IDS for masquerade attacks in CAN

Vehicular controller area networks (CANs) are susceptible to masquerade attacks by malicious adversaries. In masquerade attacks, adversaries silence a targeted ID and then send malicious frames with forged content at the expected timing of benign frames. As masquerade attacks could seriously harm vehicle functionality and are the stealthiest attacks to detect in CAN, recent work has devoted attention to compare frameworks for detecting masquerade attacks in CAN. However, most existing works report offline evaluations using CAN logs already collected using simulations that do not comply with the domain’s real-time constraints. Here we contribute to advance the state of the art by presenting a comparative evaluation of four different non-deep learning (DL)-based unsupervised online intrusion detection systems (IDS) for masquerade attacks in CAN. Our approach differs from existing comparative evaluations in that we analyze the effect of controlling streaming data conditions in a sliding window setting. In doing so, we use realistic masquerade attacks being replayed from the ROAD dataset. We show that although evaluated IDS are not effective at detecting every attack type, the method that relies on detecting changes in the hierarchical structure of clusters of time series produces the best results at the expense of higher computational overhead. We discuss limitations, open challenges, and how the evaluated methods can be used for practical unsupervised online CAN IDS for masquerade attacks.

Anomaly detection↗

SAM-FS: LSC's New Solaris-Based Storage Management Product

SAM-FS is a full featured hierarchical storage management (HSM) device that operates as a file system on Solaris-based machines. The SAM-FS file system provides the user with all of the standard UNIX system utilities and calls, and adds some new commands, i.e. archive, release, stage, sls, sfind, and a family of maintenance commands. The system also offers enhancements such as high performance virtual disk read and write, control of the disk through an extent array, and the ability to dynamically allocate block size. SAM-FS provides 'archive sets' which are groupings of data to be copied to secondary storage. In practice, as soon as a file is written to disk, SAM-FS will make copies onto secondary media. SAM-FS is a scalable storage management system. The system can manage millions of files per system, though this is limited today by the speed of UNIX and its utilities. In the future, a new search algorithm will be implemented that will remove logical and performance restrictions on the number of files managed.

Angell, Kent↗

IMAGING THE ALGOL TRIPLE SYSTEM IN THE H BAND WITH THE CHARA INTERFEROMETER

Algol ({beta} Per) is an extensively studied hierarchical triple system whose inner pair is a prototype semi-detached binary with mass transfer occurring from the sub-giant secondary to the main-sequence primary. We present here the results of our Algol observations made between 2006 and 2010 at the CHARA interferometer with the Michigan Infrared Combiner in the H-band. The use of four telescopes with long baselines allows us to achieve better than 0.5 mas resolution and to unambiguously resolve the three stars. The inner and outer orbital elements, as well as the angular sizes and mass ratios for the three components, are determined independently from previous studies. We report a significantly improved orbit for the inner stellar pair with the consequence of a 15% change in the primary mass compared with previous studies. We also determine the mutual inclination of the orbits to be much closer to perpendicularity than previously established. State-of-the-art image reconstruction algorithms are used to image the full triple system. In particular an image sequence of 55 distinct phases of the inner pair orbit is reconstructed, clearly showing the Roche-lobe-filling secondary revolving around the primary, with several epochs corresponding to the primary and secondary eclipses.

79 ASTRONOMY AND ASTROPHYSICS↗

Determining the Bayesian optimal sampling strategy in a hierarchical system.

Consider a classic hierarchy tree as a basic model of a 'system-of-systems' network, where each node represents a component system (which may itself consist of a set of sub-systems). For this general composite system, we present a technique for computing the optimal testing strategy, which is based on Bayesian decision analysis. In previous work, we developed a Bayesian approach for computing the distribution of the reliability of a system-of-systems structure that uses test data and prior information. This allows for the determination of both an estimate of the reliability and a quantification of confidence in the estimate. Improving the accuracy of the reliability estimate and increasing the corresponding confidence require the collection of additional data. However, testing all possible sub-systems may not be cost-effective, feasible, or even necessary to achieve an improvement in the reliability estimate. To address this sampling issue, we formulate a Bayesian methodology that systematically determines the optimal sampling strategy under specified constraints and costs that will maximally improve the reliability estimate of the composite system, e.g., by reducing the variance of the reliability distribution. This methodology involves calculating the 'Bayes risk of a decision rule' for each available sampling strategy, where risk quantifies the relative effect that each sampling strategy could have on the reliability estimate. A general numerical algorithm is developed and tested using an example multicomponent system. The results show that the procedure scales linearly with the number of components available for testing.

99 GENERAL AND MISCELLANEOUS↗

Using galaxy pairs to investigate the three-point correlation function in the squeezed limit

We investigate the three-point correlation function (3PCF) in the squeezed limit by considering galaxy pairs as discrete objects and cross-correlating them with the galaxy field. We develop an efficient algorithm using fast Fourier transforms to compute such cross-correlations and their associated pair-galaxy bias bp, g and the squeezed 3PCF coefficient Qeff. We implement our method using N-body cosmological simulations and a fiducial halo occupation distribution (HOD) and present the results in both the real space and redshift space. In real space, we observe a peak in b p, g and Q eff at pair separation of ~2 Mpc, attributed to the fact that galaxy pairs at 2 Mpc separation trace the most massive dark matter haloes. We also see strong anisotropy in the b p, g and Qeff signals that track the large-scale filamentary structure. In redshift space, both the 2 Mpc peak and the anisotropy are significantly smeared out along the line of sight due to finger-of-God effect. In both the real space and redshift space, the squeezed 3PCF shows a factor of 2 variation, contradicting the hierarchical ansatz, but offering rich information on the galaxy-halo connection. Thus, we explore the possibility of using the squeezed 3PCF to constrain the HOD. When we compare two simple HOD models that are closely matched in their projected two-point correlation function (2PCF), we do not yet see a strong variation in the 3PCF that is clearly disentangled from variations in the projected 2PCF. Nevertheless, we propose that more complicated HOD models, e.g. those incorporating assembly bias, can break degeneracies in the 2PCF and show a distinguishable squeezed 3PCF signal.

79 ASTRONOMY AND ASTROPHYSICS↗