The widespread availability of digital multimedia data has led to a new challenge in digital forensics.Traditional source camera identification algorithms usually rely on various traces in the capturing process.Howeve...The widespread availability of digital multimedia data has led to a new challenge in digital forensics.Traditional source camera identification algorithms usually rely on various traces in the capturing process.However,these traces have become increasingly difficult to extract due to wide availability of various image processing algorithms.Convolutional Neural Networks(CNN)-based algorithms have demonstrated good discriminative capabilities for different brands and even different models of camera devices.However,their performances is not ideal in case of distinguishing between individual devices of the same model,because cameras of the same model typically use the same optical lens,image sensor,and image processing algorithms,that result in minimal overall differences.In this paper,we propose a camera forensics algorithm based on multi-scale feature fusion to address these issues.The proposed algorithm extracts different local features from feature maps of different scales and then fuses them to obtain a comprehensive feature representation.This representation is then fed into a subsequent camera fingerprint classification network.Building upon the Swin-T network,we utilize Transformer Blocks and Graph Convolutional Network(GCN)modules to fuse multi-scale features from different stages of the backbone network.Furthermore,we conduct experiments on established datasets to demonstrate the feasibility and effectiveness of the proposed approach.展开更多
In the past decade, numerical modelling has been increasingly used for simulating the mechanical behaviour of naturally fractured rock masses. In this paper, we introduce new algorithms for spatial and temporal analys...In the past decade, numerical modelling has been increasingly used for simulating the mechanical behaviour of naturally fractured rock masses. In this paper, we introduce new algorithms for spatial and temporal analyses of newly generated fractures and blocks using an integrated discrete fracture network (DFN)-finite-discrete element method (FDEM) (DFN-FDEM) modelling approach. A fracture line calculator and analysis technique (i.e. discrete element method (DEM) fracture analysis, DEMFA) calculates the geometrical aspects of induced fractures using a dilation criterion. The resultant two-dimensional (2D) blocks are then identified and characterised using a graph structure. Block tracking trees allow track of newly generated blocks across timesteps and to analyse progressive breakage of these blocks into smaller blocks. Fracture statistics (number and total length of initial and induced fractures) are then related to the block forming processes to investigate damage evolution. The combination of various proposed methodologies together across various stages of modelling processes provides new insights to investigate the dependency of structure's resistance on the initial fracture configuration.展开更多
A connected graph, whose blocks are all cliques （of possibly varying sizes）, is called a block graph. Let D（G） be its distance matrix. In this note, we prove that the Smith normal form of D（G） is independent of ...A connected graph, whose blocks are all cliques （of possibly varying sizes）, is called a block graph. Let D（G） be its distance matrix. In this note, we prove that the Smith normal form of D（G） is independent of the interconnection way of blocks and give an explicit expression for the Smith normal form in the case that all cliques have the same size, which generalize the results on determinants.展开更多
The backup 2-median problem is a location problem to locate two facilities at vertices with the minimum expected cost where each facility may fail with a given probability. Once a facility fails, the other one takes f...The backup 2-median problem is a location problem to locate two facilities at vertices with the minimum expected cost where each facility may fail with a given probability. Once a facility fails, the other one takes full responsibility for the services. Here we assume that the facilities do not fail simultaneously. In this paper, we consider the backup 2-median problem on block graphs where any two edges in one block have the same length and the lengths of edges on different blocks may be different. By constructing a tree-shaped skeleton of a block graph, we devise an O（n log n q- m）-time algorithm to solve this problem where n and m are the number of vertices and edges, respectively, in the given block graph.展开更多
We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning...We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning results. Based on the critical path and the accumulated slack distances we define,we choose the best position for insertion and do a series of operations incrementally, such as deleting modules, adding modules, and resizing modules quickly. This incremental floorplanning algorithm has a very high speed less than 1μm,which is one of the most important measures in this research. The algorithm preserves the original good performances on area and wire length. It can also supply other tools with good physical estimates for area, wire length, and other performance guidelines.展开更多
基金This work was funded by the National Natural Science Foundation of China(Grant No.62172132)Public Welfare Technology Research Project of Zhejiang Province(Grant No.LGF21F020014)the Opening Project of Key Laboratory of Public Security Information Application Based on Big-Data Architecture,Ministry of Public Security of Zhejiang Police College(Grant No.2021DSJSYS002).
文摘The widespread availability of digital multimedia data has led to a new challenge in digital forensics.Traditional source camera identification algorithms usually rely on various traces in the capturing process.However,these traces have become increasingly difficult to extract due to wide availability of various image processing algorithms.Convolutional Neural Networks(CNN)-based algorithms have demonstrated good discriminative capabilities for different brands and even different models of camera devices.However,their performances is not ideal in case of distinguishing between individual devices of the same model,because cameras of the same model typically use the same optical lens,image sensor,and image processing algorithms,that result in minimal overall differences.In this paper,we propose a camera forensics algorithm based on multi-scale feature fusion to address these issues.The proposed algorithm extracts different local features from feature maps of different scales and then fuses them to obtain a comprehensive feature representation.This representation is then fed into a subsequent camera fingerprint classification network.Building upon the Swin-T network,we utilize Transformer Blocks and Graph Convolutional Network(GCN)modules to fuse multi-scale features from different stages of the backbone network.Furthermore,we conduct experiments on established datasets to demonstrate the feasibility and effectiveness of the proposed approach.
文摘In the past decade, numerical modelling has been increasingly used for simulating the mechanical behaviour of naturally fractured rock masses. In this paper, we introduce new algorithms for spatial and temporal analyses of newly generated fractures and blocks using an integrated discrete fracture network (DFN)-finite-discrete element method (FDEM) (DFN-FDEM) modelling approach. A fracture line calculator and analysis technique (i.e. discrete element method (DEM) fracture analysis, DEMFA) calculates the geometrical aspects of induced fractures using a dilation criterion. The resultant two-dimensional (2D) blocks are then identified and characterised using a graph structure. Block tracking trees allow track of newly generated blocks across timesteps and to analyse progressive breakage of these blocks into smaller blocks. Fracture statistics (number and total length of initial and induced fractures) are then related to the block forming processes to investigate damage evolution. The combination of various proposed methodologies together across various stages of modelling processes provides new insights to investigate the dependency of structure's resistance on the initial fracture configuration.
基金This work was supported by National Natural Science Foundation of China Grant No.60174049Key Project of Education Department of Hubei Province (2001A43007).
基金supported by the National Natural Science Foundation of China(Nos.11501188,11326057,11171102)by Aid program for Science and Technology Innovative Research Team in Higher Educational Institutions of Hunan Province
文摘A connected graph, whose blocks are all cliques （of possibly varying sizes）, is called a block graph. Let D（G） be its distance matrix. In this note, we prove that the Smith normal form of D（G） is independent of the interconnection way of blocks and give an explicit expression for the Smith normal form in the case that all cliques have the same size, which generalize the results on determinants.
基金Supported by the National Natural Science Foundation of China(No.11301475,11126202,11171207)the Nature Science Foundation of Zhejiang Province(No.LQ12A01011)partially supported by The Hong Kong CERG Research Fund PolyU 5515/10H
文摘The backup 2-median problem is a location problem to locate two facilities at vertices with the minimum expected cost where each facility may fail with a given probability. Once a facility fails, the other one takes full responsibility for the services. Here we assume that the facilities do not fail simultaneously. In this paper, we consider the backup 2-median problem on block graphs where any two edges in one block have the same length and the lengths of edges on different blocks may be different. By constructing a tree-shaped skeleton of a block graph, we devise an O（n log n q- m）-time algorithm to solve this problem where n and m are the number of vertices and edges, respectively, in the given block graph.
文摘We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning results. Based on the critical path and the accumulated slack distances we define,we choose the best position for insertion and do a series of operations incrementally, such as deleting modules, adding modules, and resizing modules quickly. This incremental floorplanning algorithm has a very high speed less than 1μm,which is one of the most important measures in this research. The algorithm preserves the original good performances on area and wire length. It can also supply other tools with good physical estimates for area, wire length, and other performance guidelines.
