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.
Existing algorithms of mining preferred browsing paths just consider the influence of user visiting times, but ignore the accuracy influenced by other factors. In order to solve the problem, an improved algorithm which imports page similarity and support-preference concepts is proposed. Firstly a Web-log-based user access matrix is set up. Then by calculating the angel cosine similarity and support-preference,...
Single-phase pulsewidth modulation rectifiers suffer from ripple power pulsating at twice the line frequency. The ripple power is usually filtered by a bulky capacitor bank or an LC branch, resulting in lower power density. The alternative way is active power decoupling, which uses an active circuit to direct the pulsating power into another energy-storage component. The main dc-link filter capacitor...
This paper examines what affects government credit information systems diffusion. Based on Technology-Organization-Environment framework, Technology Acceptance Model, Innovations Diffusion Theory, and Institutional Theory, we propose a model of affecting government credit information systems diffusion under China E-government circumstance. Data collected from a survey in Shanghai are analyzed with...
Based on canonical cover or minimum cover for functional dependency set F, a data structure MAC is constructed, which facilitates to compute closures of all attributes sets. Using MAC, a fast algorithm of computing closure of an individual set of attributes is improved to efficiently find candidate keys. The improved algorithm of finding candidate keys neednpsilat compute closures of the total subsets...
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.