The automated design of analog circuits presents a significant challenge due to the complexity of circuit topology and parameter selection. Traditional evolutionary algorithms, such as Genetic Programming (GP), have s...
详细信息
In this paper, we introduce an innovative approach to weakly supervised medical image segmentation with box annotations. Different from the previous methods which simply utilize a single conventional network with the ...
详细信息
As advanced technology nodes enter the nanometer era, the complexity of integrated circuit design is increasing, and the proportion of bus in the net is also increasing. The bus routing has become a key factor affecti...
详细信息
As advanced technology nodes enter the nanometer era, the complexity of integrated circuit design is increasing, and the proportion of bus in the net is also increasing. The bus routing has become a key factor affecting the performance of the chip. In addition, the existing research does not distinguish between bus and non-bus in the complete global routing process, which directly leads to the expansion of bus deviation and the degradation of chip performance. In order to solve these problems, we propose a high-quality and efficient bus-aware global router, which includes the following key strategies: By introducing the routing density graph, we propose a routing model that can simultaneously consider the routability of non-bus and the deviation value of bus;A dynamic routing resource adjustment algorithm is proposed to optimize the bus deviation and wirelength simultaneously, which can effectively reduce the bus deviation;We propose a layer assignment algorithm consider deviation to significantly reduce the bus deviation of the 3D routing solution;And a depth-first search (DFS)-based algorithm is proposed to obtain multiple routing solutions, from which the routing result with the lowest deviation is selected. Experimental results show that the proposed algorithms can effectively reduce bus deviation compared with the existing algorithms, so as to obtain high-quality 2D and 3D routing solutions considering bus deviation.
Motivated by the settings where sensing the entire tensor is infeasible, this paper proposes a novel tensor compressed sensing model, where measurements are only obtained from sensing each lateral slice via mutually i...
Among the most vital organs that protect the body of a human from the external environment is the skin. Early skin illness identification is essential for reducing mortality because it prevents skin cancer, and any ot...
详细信息
GPT is a large language model (LLM) derived from natural language processing that can generate a human-like text using machine learning. However, these models raise questions about authenticity and reliability of mate...
详细信息
In many different sectors, the safety and dependability of welded structures are crucially dependent on the accurate identification of weld defects. To address this, we present a novel method for categorizing weld def...
详细信息
Prediction sets capture uncertainty by predicting sets of labels rather than individual labels, enabling downstream decisions to conservatively account for all plausible outcomes. Conformal inference algorithms constr...
详细信息
Individuals who are deaf often utilize sign language for communication. In Sign Language, the symbols or motions are arranged grammatically. Every motion is referred to as a sign. Indian Sign Language Recognition usin...
详细信息
Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive su...
详细信息
Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.
暂无评论