| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910702071903321 |
|
|
Autore |
Musser Jonathan W |
|
|
Titolo |
Flood-inundation maps for Sweetwater Creek from above the confluence of Powder Springs Creek to the Interstate 20 bridge, Cobb and Douglas Counties, Georgia [[electronic resource] /] / by Jonathan W. Musser ; prepared in cooperation with Cobb County, Georgia [and] the National Weather Service |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
[Reston, Va.] : , : U.S. Dept. of the Interior, U.S. Geological Survey, , 2012 |
|
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (21 maps) : color+ + 1 pamphlet (v, 10 pages) |
|
|
|
|
|
|
Collana |
|
Scientific investigations map ; ; 3220 |
|
|
|
|
|
|
Soggetti |
|
Floods - Georgia - Sweetwater Creek (Cobb County and Douglas County) |
Maps. |
Sweetwater Creek (Cobb County and Douglas County, Ga.) Maps |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale cartografico a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Title from title screen (viewed Aug. 10, 2012) |
Includes location maps. |
|
|
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (page 10 of pamphlet). |
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910986144003321 |
|
|
Autore |
Chen Yong |
|
|
Titolo |
Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2025.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (1099 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 15161 |
|
|
|
|
|
|
Altri autori (Persone) |
|
GaoXiaofeng |
SunXiaoming <1955-> |
ZhangAn |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Image processing - Digital techniques |
Computer vision |
Data structures (Computer science) |
Information theory |
Computer science - Mathematics |
Discrete mathematics |
Numerical analysis |
Theory of Computation |
Computer Imaging, Vision, Pattern Recognition and Graphics |
Data Structures and Information Theory |
Discrete Mathematics in Computer Science |
Symbolic and Algebraic Manipulation |
Numerical Analysis |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
-- Can the 1.375 approximation ratio of unsigned genomes distances be improved?. -- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths. -- On Extensions of Min-k-Union. -- Sublinear Algorithms for Scheduling with Chain Precedence |
|
|
|
|
|
|
|
|
|
|
|
Constraints. -- Bicriteria approximation algorithms for the unit disk coverage problem. -- Private Neural Network Training with Packed Secret Sharing. -- k-Balanced Biclique Partition on Signed Bipartite Graphs. -- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions. -- On Sorting Signed Permutations by Flanked DCJs. -- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two. -- Relations between monotone complexity measures based on decision tree complexity. -- Minimum sum vertex cover: kernelization and parameterized algorithms. -- Facility location game for maximizing the social satisfaction on a line. -- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. -- MPMD on Two Sources with Lookahead. -- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. -- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. -- 1.6-approximation algorithm for generalized traveling salesman path probem. -- Assortment Planning with Sponsored Products. -- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. -- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems. -- The Complexity of Distance-$r$ Dominating Set Reconfiguration. -- A characterization of uniquely representable two-directional orthogonal ray graphs. -- The complexity of strong confl?ict-free vertex-connection k-colorability. -- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset. -- Bipartite domination in outerplanar graphs. -- Robust Matroid Bandit Optimization against Adversarial Contamination. -- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism. -- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging. -- Maximin Share Allocation under Knapsack Constraint. -- On the Minimum Edge Bisection of Graph. -- Random Schreier graphs as expanders. -- Direct Sum Theorems From Fortification. -- On Sorting by Unsigned Symmetric Reversals. -- Some Results on Critical ($P_5,H$)-free Graphs. -- Single machine lot scheduling to minimize maximum weighted completion time. -- A Quadratic Vertex Kernel for Diamond-free Edge Deletion. -- Graph convexity partizan games. -- Almost optimum $\ell$-covering of $\mathbb{Z}_n$. -- The Communication Complexity of Distributed Maximization. -- Approximately Covering Vertices by Order-5 or Longer Paths. -- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering. -- A Little Aggression Goes a Long Way. -- Monotone Properties of Uncertain Graphs. |
|
|
|
|
|
|
Sommario/riassunto |
|
This three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23–25, 2024. The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing. . |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNISA996691678803316 |
|
|
Autore |
Han Jinguang |
|
|
Titolo |
Information and Communications Security : 27th International Conference, ICICS 2025, Nanjing, China, October 29–31, 2025, Proceedings, Part III / / edited by Jinguang Han, Yang Xiang, Guang Cheng, Willy Susilo, Liquan Chen |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2026 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2026.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (857 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 16219 |
|
|
|
|
|
|
Altri autori (Persone) |
|
XiangYang |
ChengGuang |
SusiloWilly |
ChenLiquan |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
|
|
Soggetti |
|
Data structures (Computer science) |
Information theory |
Database management |
Data mining |
Application software |
Image processing - Digital techniques |
Computer vision |
Cryptography |
Data encryption (Computer science) |
Data Structures and Information Theory |
Database Management |
Data Mining and Knowledge Discovery |
Computer and Information Systems Applications |
Computer Imaging, Vision, Pattern Recognition and Graphics |
Cryptology |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Attack and Defense -- Domain Adaptation for Cross-Device Profiled |
|
|
|
|
|
|
|
|
|
|
|
ML Side-Channel Attacks. -- Find the Clasp of the Chain: Efficiently Locating Cryptographic Procedures in SoC Secure Boot by Semi-automated Side-Channel Analysis. -- Full-phase distributed quantum impossible differential cryptanalysis. -- ProverNG: Efficient Verification of Compositional Masking for Cryptosystem’s Side-Channel Security. -- POWERPOLY: Multilingual Program Analysis with the Aid of WebAssembly. -- Not only spatial, but also spectral: Unnoticeable backdoor attack on 3D point clouds. -- Permutation-Based Cryptanalysis of the SCARF Block Cipher and Its Randomness Evaluation. -- Secure and Scalable TLB Partitioning Against Timing Side-Channel Attacks. -- Security Vulnerabilities in AI-Generated Code: A Large-Scale Analysis of Public GitHub Repositories. -- Vulnerability Analysis. -- Towards Efficient C/C++ Vulnerability Impact Assessment in Package Management Systems. -- AugGP-VD: A smart contract vulnerability detection approach based on augmented graph convolutional networks and pooling. -- VULDA: Source Code Vulnerability Detection via Local Dependency Context Aggregation on Vulnerability-aware Code Mapping Graph. -- KVT-Payload: Knowledge Graph-Enhanced Hierarchical Vulnerability Traffic Payload Generation. -- Construction and Application of Vulnerability Intelligence Ontology under Vulnerability Management Perspective. -- Anomaly Detection. -- Speaker Inference Detection Using Only Text. -- DTGAN: Diverse-Task Generative Adversarial Networks for Intrusion Detection Systems Against Adversarial Examples. -- ConComFND: Leveraging Content and Comment Information for Enhanced Fake News Detection. .-Transferable Adversarial Attacks in Object Detection: Leveraging Ensemble Features and Gradient Variance Minimization. -- VAE-BiLSTM: A Hybrid Model for DeFi Anomaly Detection Combining VAE and BiLSTM. -- FluxSketch: A Sketch-based Solution for Long-Term Fluctuating Key Flow Detection. -- RustGuard: Detecting Rust Data Leak Issues with Context-Sensitive Static Taint Analysis. -- Secure Guard: A Semantic-Based Jailbreak Prompt Detection Framework for Protecting Large Language Models. -- Traffic Classification. -- FCAL: An Asynchronous Federated Contrastive Semi-Supervised Learning Approach for Network Traffic Classification. -- TetheGAN: A GAN-Based Synthetic Mobile Tethering Traffic Generating Framework. -- SPTC: Signature-based Cross-protocol Encrypted Proxy Traffic Classification Approach. -- Multi-modal Datagram Representation with Spatial-Temporal State Space Models and Inter-flow Contrastive Learning for Encrypted Traffic Classification. -- FlowGraphNet: Efficient Malicious Traffic Detection via Graph Construction. -- CascadeGen: A Hybrid GAN-Diffusion Framework for Controllable and Protocol-Compliant Synthetic Network Traffic Generation. -- Steganography and Watermarking. -- Towards High-Capacity Provably Secure Steganography via Cascade Sampling. -- When There Is No Decoder: Removing Watermarks from Stable Diffusion Models in a No-box Setting. -- Robust Reversible Watermarking for 3D Models Based on Auto Diffusion Function. |
|
|
|
|
|
|
Sommario/riassunto |
|
This three-set volume LNCS 16217-16219 constitutes the refereed proceedings of 27th International Conference on Information and Communications Security, ICICS 2025, held in Nanjing, China, during October 29–31, 2025. The 91 full papers presented in this book were carefully selected and reviewed from 357 submissions. The papers are organized in the following topical sections: Part I: Cryptography; Post-quantum Cryptography; Anonymity and Privacy; Authentication and Authorization. Part II: Blockchain and Cryptocurrencies, System and Network Security, Security and Privacy of AI, Machine Learning for Security. Part III: Attack and Defense; Vulnerability Analysis; Anomaly |
|
|
|
|
|
|
|
|
|
|
Detection; Traffic Classification; Steganography and Watermarking. |
|
|
|
|
|
| |