Skill UI

Automates clustering workflows on supplied datasets with K-means, DBSCAN, or hierarchical algorithms, handling preprocessing, validation, metrics, and visualizations to expose groupings and anomalies.

Arboreto infers gene regulatory networks from bulk or single-cell RNA-seq data using scalable GRNBoost2 and GENIE3 algorithms, letting researchers filter transcription-factor targets, run distributed Dask jobs, and export ranked links for downstream analysis.

This skill analyzes DNS query logs to detect sophisticated threats such as data exfiltration via DNS tunneling, Domain Generation Algorithm (DGA) usage, and covert Command and Control (C2) channels. It utilizes advanced techniques like entropy analysis, query volume anomaly detection, and subdomain length analysis within SIEM platforms, helping SOC teams identify threats that bypass traditional network security controls.

Create, analyze, and visualize complex networks in Python with NetworkX 3.x. Build graphs from data, run algorithms like shortest paths, PageRank and centrality, detect communities, generate synthetic networks, and read/write GraphML, JSON or edge-list files.

This comprehensive skill guides researchers through the submission process for the Chinese Journal of Management Science. It covers the journal's core academic positioning (operations research, decision analysis, complex systems), required methodological rigor (model setting, algorithms, proofs), structural guidelines, and essential formatting checks. It helps authors assess manuscript fit and identify common rejection risks before official submission.

A comprehensive framework for analyzing and presenting algorithmic contributions in academic papers. It guides users beyond mere computational speed, requiring rigorous proof of complexity (Big O), convergence (rate and conditions), or approximation bounds (rho). Essential for optimizing and validating complex computational models in scientific fields.

This guide outlines the rigorous analytical methodology required for Operations Research (OR) manuscripts. It instructs users on selecting the appropriate mathematical machinery—such as duality, dynamic programming, convergence analysis, or concentration inequalities—to establish provable guarantees, approximation factors, and algorithmic complexity. It ensures that claims are backed by rigorous proofs, moving beyond mere heuristics.

NetworkX is a powerful Python package designed for creating, manipulating, and analyzing complex networks and graphs. It supports various graph types (Directed, Undirected, MultiGraphs) and provides extensive functionality for graph algorithms, including shortest path calculation, centrality measures (like PageRank), community detection, and connectivity checks. Users can generate synthetic networks, read/write data from multiple formats (GraphML, CSV, Pandas), and visualize results using Matplotlib. Ideal for social network analysis, biological research, and system modeling.

JurisRank is a computational tool that analyzes citation networks of Argentine Supreme Court (CSJN) jurisprudence using a peer-reviewed PageRank algorithm with temporal decay. It measures the jurisprudential authority of legal precedents, allowing users to rank competing cases by influence, trace the evolution of legal doctrine, and detect potential constitutional drift. Ideal for intensive legal research, due diligence, and academic analysis of legal trends in Argentina.