运通卡(American Express)英文缩写为AMEX,它是世界上最容易辨认的信用卡之一。美国运通卡、维萨卡、万事达卡都是世界上最受欢迎的信用卡,它们之间除了一些共同点之外,更多的是拥有各自独特的特色。 自1958年发行第一张运通卡以来,迄今为止运通已在68个国家和地区以49种货币发行了运通卡,构建了全球最大的自成体系的特约商户网络,并拥有超过6000万名的优质持卡人群体。成立于1850年的运通公司,最初的业务是提供快递服务。随着业务的不断发展,运通于1891年率先推出旅行支票,主要面向经常旅行的高端客户。可以说,运通服务于高端客户的历史长达百年,积累了丰富的服务经验和庞大的优质客户群体。现还有牡丹运通卡、招行运通卡、中信美国运通卡 、长城美国运通卡 、民生运通卡 。运通卡(American Express)可在ATM机上操作。
Evaluating user-facing AI applications remains a central challenge, especially in open-ended domains such as travel planning, clinical note generation, or dialogue. The gold standard is user feedback (e.g., thumbs up/down) or behavioral signals (e.g., retention), but these are often scarce in prototypes and research projects, or too-slow to use for system optimization. We present **AutoMetrics**, a framework for synthesizing evaluation metrics under low-data constraints. AutoMetrics combines retrieval from **MetricBank**, a collection of 48 metrics we curate, with automatically generated LLM-as-a-Judge criteria informed by lightweight human feedback. These metrics are composed via regression to maximize correlation with human signal. AutoMetrics takes you from expensive measures to interpretable automatic metrics. Across 5 diverse tasks, AutoMetrics improves Kendall correlation with human ratings by up to 33.4% over LLM-as-a-Judge while requiring fewer than 100 feedback points. We show that AutoMetrics can be used as a proxy reward to equal effect as a verifiable reward. We release the full AutoMetrics toolkit and MetricBank to accelerate adaptive evaluation of LLM applications.
Migration of legacy COBOL programs to Java requires extensive testing to ensure correct functionality. This effort is often complicated by the lack of test data and the difficulty of validating all corner cases. In this paper we propose a novel agentic test-synthesis method, the "Locksmith Loop," which is initiated by preparing two runtime environments: the COBOL source and the generated Java target are each instrumented with mocks and executed off-mainframe on commodity hardware, then an iterative agentic loop performs Witness Search over input mocks to penetrate program branches, followed by parity-preserving mutations. When routing boundaries are reached, an analyzer identifies a Locked Paragraph: a condition preventing deeper exploration. Across three COBOL-Java case studies, spanning two open-source programs and one internal production-like COBOL program and ranging from 430 to 4,114 source lines, Locksmith consistently improved coverage beyond input-search plateaus, reaching nearly complete coverage on the two open-source programs and 91.90
Large language models (LLMs) are becoming useful in many domains due to their impressive abilities that arise from large training datasets and large model sizes. However, research on LLM-based approaches to document inconsistency detection is relatively limited. We address this gap by investigating evidence extraction capabilties of LLMs for document inconsistency detection. To this end, we introduce new comprehensive evidence-extraction metrics and a redact-and-retry framework with constrained filtering that substantially improves evidence extraction performance over other prompting methods. We support our approach with strong experimental results and release a new semi-synthetic dataset for evaluating evidence extraction.
Federated Learning (FL) trains a global model across decentralized clients while preserving data privacy, but at scale it is vulnerable to malicious updates. Byzantine-resilient aggregation methods such as MultiKrum score gradients against their nearest neighbors and can miss malicious updates that preserve the statistical properties of honest ones. We propose a quantum annealing approach that reformulates client selection as a Quadratic Unconstrained Binary Optimization (QUBO) problem, encoding pairwise distances into a cost function solved by quantum annealers (QA). Unlike MultiKrum's greedy per-client scoring, the QUBO formulation jointly optimizes over all subsets to find the mutually closest group of m clients. At small scale (15 clients), QUBO outperforms MultiKrum on the most challenging Byzantine attacks: e.g., Advanced LIE is detected with 95.11
This study delves into applying blockchain technology to maximize trust and efficiency when it comes to the process of verifying insurance claims, in health and motor car insurance markets in this case. Through the application of a permissioned blockchain network, the study proves how blockchain transparency and decentralization can facilitate processing claims yet maintain data integrity and minimize fraud. Four core algorithms—Blockchain Consensus, Smart Contracts, Fraud Detection, and Claim Validation—were developed and implemented. The tests registered a reduction of 30