The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The test application time of a core may decrease as the bandwidth of its test wrapper increases. Since the total bandwidth of a TAM is fixed, there is a need to properly determine the bandwidth of each test wrapper for minimizing the total test application time. Based on this observation, in this paper, we propose an integer linear programming (ILP) approach to perform the simultaneous application...
Automatic segmentation of fiber bundles can be beneficial to quantitative analysis on neuropsychiatric diseases. Previous clustering methods for fiber segmentation typically specify the number of clusters in advance or rely on prior knowledge. In this paper, we develop a new segmentation algorithm based on density-peaks clustering, in which the number of clusters can arise intuitively. This clustering...
The Telematics is the integration of telecommunication and informatics. It is also known as ICT (Information and Communications Technology). The application trends of Telematics is to establish a user friendly vehicle communication environment to merge the information for the traffic safety, road navigation, remote business, and A/V entertainment, etc. In the future, a portable Telematics system which...
LPI is not efficient in time and memory which makes it difficult to be applied to very large data set. We propose a optimal algorithm called FLPI. FLPI decomposes the LPI problem as a graph embedding problem plus a regularized least squares problem. Such modification avoids eigen decomposition of dense matrices and can significantly reduce both time and memory cost in computation. Moreover, with a...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.