The structure of intermediate representation (IR) is usually a trade-off between several design considerations in practical compiler systems, and may not be appropriate for expressing the algorithms of some particular...
详细信息
The LACT experiment will construct 32 six-meter aperture imaging atmospheric Cherenkov telescopes at the LHAASO site for in-depth observation of the ultra-high-energy gamma-ray sources discovered by the LHAASO experim...
详细信息
String similarity join(SSJ) is essential for many applications where near-duplicate objects need to be found. This paper targets SSJ with edit distance constraints. The existing algorithms usually adopt the filter-and...
详细信息
String similarity join(SSJ) is essential for many applications where near-duplicate objects need to be found. This paper targets SSJ with edit distance constraints. The existing algorithms usually adopt the filter-andrefine framework. They cannot catch the dissimilarity between string subsets, and do not fully exploit the statistics such as the frequencies of characters. We investigate to develop a partition-based algorithm by using such *** frequency vectors are used to partition datasets into data chunks with dissimilarity between them being caught easily. A novel algorithm is designed to accelerate SSJ via the partitioned data. A new filter is proposed to leverage the statistics to avoid computing edit distances for a noticeable proportion of candidate pairs which survive the existing filters. Our algorithm outperforms alternative methods notably on real datasets.
Stance detection is the view towards a specific target by a given context(***,commercial reviews).Target-related knowledge is often needed to assist stance detection models in understanding the target well and making ...
详细信息
Stance detection is the view towards a specific target by a given context(***,commercial reviews).Target-related knowledge is often needed to assist stance detection models in understanding the target well and making detection ***,prevailing works for knowledge-infused stance detection predominantly incorporate target knowledge from a singular source that lacks knowledge verification in limited domain *** low-resource training data further increase the challenge for the data-driven large models in this *** address those challenges,we propose a collaborative knowledge infusion approach for low-resource stance detection tasks,employing a combination of aligned knowledge enhancement and efficient parameter learning ***,our stance detection approach leverages target background knowledge collaboratively from different knowledge sources with the help of knowledge ***,we also introduce the parameter-efficient collaborative adaptor with a staged optimization algorithm,which collaboratively addresses the challenges associated with low-resource stance detection tasks from both network structure and learning *** assess the effectiveness of our method,we conduct extensive experiments on three public stance detection datasets,including low-resource and cross-target *** results demonstrate significant performance improvements compared to the existing stance detection approaches.
This paper presents a routing protocol based on Global position system (GPS) called GLOR, in which the geographical area is partitioned into some virtual grids, and in each grid a gateway will be elected to take the r...
详细信息
This paper presents a routing protocol based on Global position system (GPS) called GLOR, in which the geographical area is partitioned into some virtual grids, and in each grid a gateway will be elected to take the responsibility of forwarding packets. Each node needs to monitor the status of all gateways in its communication range. When having packets to send, source first gets destination location by a localization procedure, then chooses the gateway closest to destination as the next hop route, and the intermediate gateways choose routes by the same principle. Some mechanisms for source to track destination are proposed which can magnificently improve the adaptability of GLOR to node movement. The simulation results show that: the performance of GLOR is quite insensitive to both network scale and node speed, and as compared with common protocols, GLOR has significantly lower loss rate, average delay and average cost.
Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches ba...
详细信息
Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches based on modified genetic algorithms (GA) for solving these constrained TSPs are presented. Numerical experiments demonstrate that the algorithm for the open route TSP shows its advantages when the open route is required, the algorithm for the end-fixed TSP can deal with route optimization with constraint of fixed ends effectively, and the algorithm for the path-constraint could benefit the traffic problems where some cities cannot be visited from each other.
At present, I/O is the performance bottleneck limiting the speed of computer systems. A large number of I/O operations are synchronous read/write operations of only small data blocks. However, reducing the latency of ...
详细信息
At present, I/O is the performance bottleneck limiting the speed of computer systems. A large number of I/O operations are synchronous read/write operations of only small data blocks. However, reducing the latency of synchronous I/O operation is a non-trivial problem. In this paper, we propose two methods to address this problem. The first method, FastSync, uses a cache disk optimized for write operation via use of a disk-head position prediction algorithm. In this way, disk capacity is traded for synchronous I/O performance. The second method, LND, uses free memory capacity in a network environment as a cache disk for the buffering of synchronous I/O operation. Data integrity in FastSync is ensured by using a data log on the cache disk, whereas in LND, integrity is ensured by the storage in distributed memory of multiple copies of each data block. Both methods succeed in dramatically increasing the performance of synchronous I/O operation. The performance of LND is limited by the network speed, whereas performance of FastSync is determined mostly by the data block size.
The increasingly frequent exchange of performance data in grid systems across heterogeneous platforms requires a uniform 搑epresentation?of various types of performance data. This paper reviews the current related res...
详细信息
The increasingly frequent exchange of performance data in grid systems across heterogeneous platforms requires a uniform 搑epresentation?of various types of performance data. This paper reviews the current related research, considers the defect of existing methods, and proposes a new portable description method: grid performance data description (GPDD) using an extensible markup language (XML)-based grid performance data representation language (XGPDRL). GPDD describes the abstract structure, which has excellent extensibility (all types of performance data can be described in one format), efficiency, and flexibil-ity. XGPDRL defines the grammar of the GPDD performance data representation, and is both extensible and portable. For benchmarking purposes, performance data can be collected during runtime, represented in XGPDRL, and analyzed visually using a browser across heterogeneous platforms. GPDD and XGPDRL can conveniently ensure data comprehension across various platforms, and are very suitable for grid per-formance data representation.
In many models of all-optical routing, a set of communication paths in a network is given, and a wavelength is to be assigned to each path so that paths sharing an edge receive different wavelengths. The goal is to as...
详细信息
In many models of all-optical routing, a set of communication paths in a network is given, and a wavelength is to be assigned to each path so that paths sharing an edge receive different wavelengths. The goal is to assign as few wavelengths as possible, in order to use the optical bandwidth efficiently. If a node of a network contains a wavelength converter,any path that passes through this node may change its wavelength. Having converters at some of the nodes can reduce the number of wavelengths required for routing. This paper presents a wavelength converter with degree 4 and gives a routing algorithm which shows that any routing with load L can be realized with L wavelengths when a node of an all-optical ring hosts such a wavelength converter. It is also proved that 4 is the minimum degree of the converter to reach the full utilization of the available wavelengths if only one node of an all-optical ring hosts a converter.
Recently, resource virtualisation has been proven effective for deploying large-scale IT-infrastructures, such as grids and clouds. However, many studies also indicate that the system's energy-efficiency will be r...
详细信息
暂无评论