Entropy最新文献_第4页

High-Dimensional Linear Preference Model. 高维线性偏好模型。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-11 DOI: 10.3390/e28091012

Gil Ariel, Omer Peleg

{"title":"High-Dimensional Linear Preference Model.","authors":"Gil Ariel, Omer Peleg","doi":"10.3390/e28091012","DOIUrl":"10.3390/e28091012","url":null,"abstract":"Multiple-criteria decision analysis (MCDA) is a branch of operations research concerned with choices based on several quantifiable factors. Here, we focus on high-dimensional markets, in which each available product is described by a large number of features. Taking a probabilistic approach, we define a market as a collection of alternatives in a decision-making scenario governed by a linear utility function. Analytic approximations for the market share and its moments are derived in the limit of a large population and a large number of measured features. We identify a single parameter, termed the degree of subjectivity, that places markets on a continuous spectrum ranging from fully objective to fully subjective. At an intermediate value, the market is competitive in the sense that it maximizes the entropy of the market-share distribution. Empirical analysis of several real markets indicates that they can indeed be classified by this parameter, yielding predictable decision patterns and a unified, relative measure of competitiveness across markets. Simulations involving non-linear utility functions and a trained machine-learning classifier provide preliminary evidence that similar behavior may also arise beyond the linear model, suggesting that the degree of subjectivity may be useful as a diagnostic in some broader multi-feature decision problems.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605934/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Color Image Encryption Scheme Using an Enhanced One-Dimensional Chaotic Map and Adaptive DNA Encoding. 基于增强的一维混沌映射和自适应DNA编码的彩色图像加密方案。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-11 DOI: 10.3390/e28091015

Jie Jiang, Liyuan Jiao, Yanchun Liang, Adriano Tavares, Lidong Wang

{"title":"A Color Image Encryption Scheme Using an Enhanced One-Dimensional Chaotic Map and Adaptive DNA Encoding.","authors":"Jie Jiang, Liyuan Jiao, Yanchun Liang, Adriano Tavares, Lidong Wang","doi":"10.3390/e28091015","DOIUrl":"10.3390/e28091015","url":null,"abstract":"Secure transmission and storage of color images remain challenging tasks due to strong inter-pixel correlations and high data volume. This work proposes a one-dimensional sine-tent-logistic-exponential map (STLEM) equipped with numerical boundary correction rules to mitigate finite-precision numerical degradation so as to enhance the unpredictability of chaos-driven cryptosystems. We benchmark STLEM against classic logistic, tent, and sine maps via Lyapunov exponents, autocorrelation, approximate entropy, permutation entropy, Lempel-Ziv complexity, and Kolmogorov-Sinai entropy. Bifurcation diagrams, the 0-1 test, and NIST statistical tests are further adopted to characterize its chaotic dynamics and randomness. Comparative results verify that STLEM achieves improved dynamical complexity and randomness performance. Built upon the proposed STLEM, this paper constructs a color-image encryption scheme that employs a 256-bit master key and two groups of chaotic parameters to produce key-related chaotic sequences. The cryptosystem integrates dynamic edge expansion, chaotic permutation, position-dependent adaptive DNA encoding, DNA-domain chained diffusion, and two successive row-column permutation phases. HMAC-SHA-256 is utilized to generate plaintext-aware initial conditions and perform ciphertext authentication prior to decryption. Experimental validations demonstrate complete plaintext recovery under valid secret inputs, while authentication rejects invalid keys and tampered ciphertexts. Ciphered images exhibit high information entropy, negligible adjacent-pixel correlations, and satisfactory number of pixel change rate (NPCR) and unified average changing intensity (UACI) metrics. Benefiting from a sufficiently large key space and O(MNlog(MN)) computational complexity, the proposed scheme is resilient against brute-force attacks and well suited for secure color-image communication scenarios, rather than acting as a general-purpose replacement for standard block ciphers.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605838/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Localized Covariant Quantities Appear to Underlie Quantum Circuits. 局域协变量似乎是量子电路的基础。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-09 DOI: 10.3390/e28091007

Ken Wharton, Roderick Sutherland, Titus Amza, James Saslow

{"title":"Localized Covariant Quantities Appear to Underlie Quantum Circuits.","authors":"Ken Wharton, Roderick Sutherland, Titus Amza, James Saslow","doi":"10.3390/e28091007","DOIUrl":"10.3390/e28091007","url":null,"abstract":"Although entangled state vectors cannot be fully described in terms of variables localized in space and time, any given entanglement experiment can be built from basic quantum circuit components with well-defined locations. We analyze such quantum circuits and present evidence that the local weak values comprise a covariant tensor associated with each individual qubit. Even if the state is massively entangled, these tensors do not evolve or collapse when other qubits are measured or pass through distant circuit elements. They can therefore be viewed from different reference frames without contradiction. Furthermore, their evolution through any circuit always obeys covariant dynamical rules. Weak values are subject to both past and future constraints, so the covariant quantities can only be determined by considering the entire circuit \"all-at-once\", as in action principles, incorporating the future measurement basis to avoid the standard no-go theorems. Because these results hold for a set of universal quantum gates, this work lends support to the claim that any quantum circuit can be assigned a realistic, lower-level description compatible with our understanding of classical spacetime.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605307/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149058892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Complexity of Social Networks. 社交网络的复杂性。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-09 DOI: 10.3390/e28091008

Zi-Ke Zhang, Junming Huang, Xiaoke Xu, Quanhui Liu

引用次数: 0

Quantum Nonseparability Without Nonlocality: A ψ-Ontic Holistic Account of Entangled Measurement. 无非定域的量子不可分性：纠缠测量的一个ψ-Ontic整体解释。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-09 DOI: 10.3390/e28091009

Everett X Wang

{"title":"Quantum Nonseparability Without Nonlocality: A ψ-Ontic Holistic Account of Entangled Measurement.","authors":"Everett X Wang","doi":"10.3390/e28091009","DOIUrl":"10.3390/e28091009","url":null,"abstract":"The standard interpretation of quantum measurement on entangled systems holds that measuring one particle nonlocally collapses the wavefunction of its spacelike-separated partner. We argue that this conclusion rests on a false presupposition: that subsystems of entangled systems possess independent ontic states. If the global wavefunction is the sole ontic object (ψ-ontic holism), then for entangled systems, there is no \"state of B\" to be affected by measurement at A. Measurement is a local dynamical process-concretely modeled by continuous spontaneous localization-that destroys one local wavefunction component at the measurement site; the global state factorizes as a consequence, and subsystem ontology emerges for the first time. The transition of the distant particle's reduced density matrix from mixed to pure reflects this emergence of separability, not a physical change at the distant location. The framework satisfies no-signaling and embraces the contextuality required by the Kochen-Specker and GHZ theorems. We are explicit about its relation to Bell's theorem: Bell local causality (factorizability) fails, as it must in any empirically adequate theory, but the failure is confined to outcome independence and is identified with the nonseparability of the global ontic state, while parameter independence-and with it the locality of the dynamics-holds exactly. Decoherence provides the mechanism by which the global wavefunction factorizes and classical separability emerges. The apparent nonlocality of quantum mechanics is thus reinterpreted as nonseparability: the fundamental ontology is holistic, but the dynamics are local.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605582/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Improved Differential Cryptanalysis of the Ultra-Lightweight Block Cipher PICO. 超轻量分组密码PICO的改进差分密码分析。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-08 DOI: 10.3390/e28091006

Yu Wang, Zhuofeng Liang, Ting Fan, Tao Zhou

{"title":"Improved Differential Cryptanalysis of the Ultra-Lightweight Block Cipher PICO.","authors":"Yu Wang, Zhuofeng Liang, Ting Fan, Tao Zhou","doi":"10.3390/e28091006","DOIUrl":"10.3390/e28091006","url":null,"abstract":"PICO is an ultra-lightweight substitution-permutation network block cipher designed for resource-constrained devices such as Internet of Things terminals and edge agents. For fixed endpoints, summing the characteristic probabilities over an enumerated finite weight window gives a verifiable lower bound on the differential probability. We use a PICO-specific workflow that combines mixed-integer linear programming bounds on active substitution boxes, exact-weight Boolean satisfiability search, optional Matsui pruning, and fixed-endpoint enumeration. For the selected endpoints, enumeration over W=63,…,76 and W=66,…,79 gives finite-window lower bounds of 2-59.95 and 2-61.95 for 21 and 22 rounds, respectively. We prepend two rounds and append three rounds to the 21-round differential distinguisher. The resulting 26-round analysis is an analytical equivalent-round-key filtering-and-ranking procedure for a 108-bit tuple. The verified 21-round finite-window probability input is a factor of 20.8032≈1.745 larger than the previously reported input, increasing the expected right-tuple support at fixed S under the analytical accounting. For the illustrative choice S=242, the analytical resources are D=262 chosen plaintexts, a normalized substitution-box filtering workload of T=2100.11 equivalent 26-round encryptions, and M=262 stored plaintext-ciphertext records. This setting is not tied to a demonstrated success probability and does not establish an equal-success complexity advantage over prior work.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605666/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Aftershock Production in Mean Field Avalanche Models with Static Fields. 静态场平均场雪崩模型的余震产生。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-08 DOI: 10.3390/e28091003

Jordi Baró

{"title":"Aftershock Production in Mean Field Avalanche Models with Static Fields.","authors":"Jordi Baró","doi":"10.3390/e28091003","DOIUrl":"10.3390/e28091003","url":null,"abstract":"Advanced seismic hazard assessment frameworks rely on stochastic models which include aftershock production in the form of branching or self-exciting point processes. Such empirical constructs are based on debated statistical laws observed across catalogs of natural seismicity, which lack a derivation from first principles. Here, we derive the statistics of aftershock production in a generalized mean-field model of avalanche dynamics with static random thresholds and bimodal relaxation. The number of direct aftershocks is statistically characterized as a renewal counting process accounting for Borel-distributed refractory intervals. At the large-number limit, the expected number of aftershocks is proportional to the size of the parent event with a characteristic scale linearly depending only on the branching parameter governing refractory intervals, whereas the variance follows a distinct parabolic dependence with the same parameter. This model provides a rationale for the overdispersion in aftershock production observed in field data with respect to the Poissonian offspring numbers of standard Hawkes models, but it cannot explain the ubiquity of self-similar aftershock production found in catalogs and lab experiments.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605626/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

TF-STNet: A Time-Frequency Dual-Branch Spatiotemporal Network for NWP-to-Station Bias Correction. TF-STNet：用于NWP-to-Station偏置校正的时频双支路时空网络。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-08 DOI: 10.3390/e28091004

Zhao Wang, Shuai Chen, Yunbo Yang, Bo Wang, Bihe Xu, Yangliao Geng

{"title":"TF-STNet: A Time-Frequency Dual-Branch Spatiotemporal Network for NWP-to-Station Bias Correction.","authors":"Zhao Wang, Shuai Chen, Yunbo Yang, Bo Wang, Bihe Xu, Yangliao Geng","doi":"10.3390/e28091004","DOIUrl":"10.3390/e28091004","url":null,"abstract":"Accurate station-scale weather forecasts support renewable-energy and transportation operations, yet gridded numerical weather prediction (NWP) is affected by representativeness errors and regional biases when transferred to irregularly distributed stations. We propose TF-STNet, a time-frequency dual-branch spatiotemporal network for NWP-to-station bias correction. A station-centered K-nearest-neighbor (KNN) operator retains multiple local NWP trajectories. The time-domain pathway separately encodes recent observations and future NWP, aligns them over the forecast horizon using gated dilated causal convolutions, and propagates lead-resolved states through a coordinate-conditioned directed station graph. The frequency-domain pathway learns spectral weights and applies separate attention to amplitude and phase across neighboring NWP cells. Prediction-level fusion combines the two station forecasts by variable, station, and lead time. The evaluation uses hourly data for wind speed, pressure, relative humidity, and temperature from 455 stations in Hebei, Shandong, Fujian, and Sichuan. Across five independent runs on 16 region-variable tasks, TF-STNet achieves the lowest mean absolute error (MAE) in 15 tasks and the highest Pearson correlation coefficient (PCC) in 15 tasks; its pressure MAE reduction relative to the strongest learned comparator ranges from 16.2% to 57.4% across the four regions. It has lower MAE than raw NWP in seven of eight high-wind or rapid-change event tests and than simple pressure model-output-statistics corrections in all four regions. The Shandong-temperature task and the Hebei-high-wind case illustrate the limits of the present point-forecast formulation.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605018/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Category-Native Solomonoff Approximation: From Algorithmic Geometry to Kernels, Operators, and Induction. 范畴原生Solomonoff近似：从算法几何到核、算子和归纳法。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-08 DOI: 10.3390/e28091005

Boumediene Hamzi, Marcus Hutter

{"title":"Category-Native Solomonoff Approximation: From Algorithmic Geometry to Kernels, Operators, and Induction.","authors":"Boumediene Hamzi, Marcus Hutter","doi":"10.3390/e28091005","DOIUrl":"10.3390/e28091005","url":null,"abstract":"Solomonoff induction mixes all computable explanations with description-length weights, but it is incomputable. This theory-and-position paper argues that practical approximation must be category-native: one should first declare the mathematical category in which a computable shadow will live, then use that category's native comparison functional, complexity code, and inductive object. The proposal is not an omnibus theorem asserting that all categories are equivalent. It is a research architecture that separates comparison, representation, and prediction and makes the information lost by each projection explicit. The metric-measure branch supplies the developed realization. Compression data define an empirical Solomonoff space; Gromov-Wasserstein (GW) distance supplies relational distortion; minimum description length (MDL) controls candidate complexity; and distance-to-kernel embedding produces a positive-semidefinite predictor. For finite or countable coded classes, we prove existence and stability results, a held-out validation oracle inequality, a Kolmogorov-Solomonoff kernel unification, conditional empirical-GW consistency, and a coding-redundancy bound. Stronger learning-oracle statements remain conditional on marked/predictive selection, candidate-family adequacy, and kernel stability. Topological, Banach/Barron, graph, tree, and operator branches are presented as a constructional and testable research programme, with their maturity stated explicitly.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605386/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Budget-Prioritized Dynamic Regrouping for Edge Federated Services Under Workload Drift and Privacy-Budget Constraints. 工作负载漂移和隐私预算约束下边缘联邦服务预算优先动态重组。

IF 2.1 3区物理与天体物理

Entropy Pub Date : 2026-09-07 DOI: 10.3390/e28091000

Li Zhao, Long Chen, Zhongyi Chen

{"title":"Budget-Prioritized Dynamic Regrouping for Edge Federated Services Under Workload Drift and Privacy-Budget Constraints.","authors":"Li Zhao, Long Chen, Zhongyi Chen","doi":"10.3390/e28091000","DOIUrl":"10.3390/e28091000","url":null,"abstract":"Federated learning enables model training in edge and distributed service environments without directly sharing raw data. In long-running edge federated services, fixed collaboration structures may become inefficient under workload drift, whereas frequent regrouping can incur migration overhead, group churn, and additional privacy-budget consumption. This paper studies budget-prioritized dynamic regrouping under workload drift, privacy-budget constraints, and migration or reconfiguration cost. We formulate a dynamic regrouping problem that jointly captures workload pressure, remaining privacy budget, service utility, and regrouping cost. We propose Budget-Prioritized Dynamic Regrouping (BP-DR), a triggered local method that evaluates single-node candidate operations and commits at most one regrouping operation per time slot. A candidate is accepted only when it is privacy-budget feasible and its utility improvement exceeds a threshold combining an anti-oscillation margin, migration or reconfiguration cost, and privacy-budget opportunity cost. We derive this trigger from a one-step local comparison and establish its monotonicity with respect to migration or reconfiguration cost and remaining privacy budget. Trace-driven experiments based on Alibaba Cluster Trace 2018 show that BP-DR maintains competitive migration-adjusted utility while controlling regrouping activity across dynamic and stress-test settings. FLamby Fed-Heart-Disease validation further shows similar learning performance across the compared methods while demonstrating the integration of BP-DR with group-aware federated training.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 9","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13605417/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0