285 research outputs found
Supervision Timing Simulation Analysis of Community E-commerce Platform Supply Chain Based on Tripartite Game Model
With the development of network and the popularity of e-commerce, the network service industry has shown strong development potential, and many community e-commerce platforms have emerged as the times require. In order to ensure the profit of the supply chain of community e-commerce platform and supervise whether the suppliers of enterprises and grid station service providers try their best to participate in value co-creation, this paper introduces the delay parameter a of community e-commerce platform, constructs a three-party evolutionary game model of "community e-commerce platform-grid station service provider-supplier", simulates the strategies of each agent with matlab, studies the behaviours of community e-commerce platform under different delay parameters, and concludes that the delay parameter a of community e-commerce platform has a great influence on the timing of community e-commerce platform supervision. Finally, three suggestions are put forward for the supervision of the supply chain of community e-commerce platform: (1) encourage consumers to report; (2) formulate the reward and punishment system for the settled enterprises; (3) formulating a reasonable supervision system
Solitary wave refraction and diffraction by submerged ramps in the presence of ambient current
Plastic Softening Induced by High-Frequency Vibrations Accompanying Uniaxial Tension in Aluminum
Funding: This work was funded by the National Natural Science Foundation of China, Grant No. 11972174 (Jinxing Liu) and Grant No. 11672119 (Jinxing Liu).Peer reviewedPublisher PD
HIGT: Hierarchical Interaction Graph-Transformer for Whole Slide Image Analysis
In computation pathology, the pyramid structure of gigapixel Whole Slide
Images (WSIs) has recently been studied for capturing various information from
individual cell interactions to tissue microenvironments. This hierarchical
structure is believed to be beneficial for cancer diagnosis and prognosis
tasks. However, most previous hierarchical WSI analysis works (1) only
characterize local or global correlations within the WSI pyramids and (2) use
only unidirectional interaction between different resolutions, leading to an
incomplete picture of WSI pyramids. To this end, this paper presents a novel
Hierarchical Interaction Graph-Transformer (i.e., HIGT) for WSI analysis. With
Graph Neural Network and Transformer as the building commons, HIGT can learn
both short-range local information and long-range global representation of the
WSI pyramids. Considering that the information from different resolutions is
complementary and can benefit each other during the learning process, we
further design a novel Bidirectional Interaction block to establish
communication between different levels within the WSI pyramids. Finally, we
aggregate both coarse-grained and fine-grained features learned from different
levels together for slide-level prediction. We evaluate our methods on two
public WSI datasets from TCGA projects, i.e., kidney carcinoma (KICA) and
esophageal carcinoma (ESCA). Experimental results show that our HIGT
outperforms both hierarchical and non-hierarchical state-of-the-art methods on
both tumor subtyping and staging tasks.Comment: Accepted by MICCAI2023; Code is available in
https://github.com/HKU-MedAI/HIG
Rel2Graph: Automated Mapping From Relational Databases to a Unified Property Knowledge Graph
Although a few approaches are proposed to convert relational databases to
graphs, there is a genuine lack of systematic evaluation across a wider
spectrum of databases. Recognising the important issue of query mapping, this
paper proposes an approach Rel2Graph, an automatic knowledge graph construction
(KGC) approach from an arbitrary number of relational databases. Our approach
also supports the mapping of conjunctive SQL queries into pattern-based NoSQL
queries. We evaluate our proposed approach on two widely used relational
database-oriented datasets: Spider and KaggleDBQA benchmarks for semantic
parsing. We employ the execution accuracy (EA) metric to quantify the
proportion of results by executing the NoSQL queries on the property knowledge
graph we construct that aligns with the results of SQL queries performed on
relational databases. Consequently, the counterpart property knowledge graph of
benchmarks with high accuracy and integrity can be ensured. The code and data
will be publicly available. The code and data are available at
github\footnote{https://github.com/nlp-tlp/Rel2Graph}
Towards Practical Non-Adversarial Distribution Alignment via Variational Bounds
Distribution alignment can be used to learn invariant representations with
applications in fairness and robustness. Most prior works resort to adversarial
alignment methods but the resulting minimax problems are unstable and
challenging to optimize. Non-adversarial likelihood-based approaches either
require model invertibility, impose constraints on the latent prior, or lack a
generic framework for alignment. To overcome these limitations, we propose a
non-adversarial VAE-based alignment method that can be applied to any model
pipeline. We develop a set of alignment upper bounds (including a noisy bound)
that have VAE-like objectives but with a different perspective. We carefully
compare our method to prior VAE-based alignment approaches both theoretically
and empirically. Finally, we demonstrate that our novel alignment losses can
replace adversarial losses in standard invariant representation learning
pipelines without modifying the original architectures -- thereby significantly
broadening the applicability of non-adversarial alignment methods
Several Improvements on BKZ Algorithm
Lattice problem such as NTRU problem and LWE problem is widely used as the security
base of post-quantum cryptosystems. And currently doing lattice reduction by BKZ algorithm
is the most efficient way to solve it. In this paper, we give several further improvements
on BKZ algorithm, which can be used for different SVP subroutines base on both enumeration
and sieving. These improvements in combination provide a speed up of in total.
It is significant in concrete attacks. Using these new techniques, we solved the 656 dimensional
ideal lattice challenge in only 380 thread hours (also with a enumeration based SVP subroutine),
much less than the previous records (which costs 4600 thread hours in total). With these
improvements enabled, we can still simulate the new BKZ algorithm easily. One can also use this
simulator to find the blocksize strategy (and the corresponding cost) to make
of the basis (defined in section 5.2) decrease as fast as possible, which means the length of
the first basis vector decrease the fastest if we accept the GSA assumption. It is useful for analyzing
concrete attacks on lattice-based cryptography
- …