Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Heap overflow is one of the most widely exploited vulnerabilities, with a large number of heap overflow instances reported every year. It is important to decide whether a crash caused by heap overflow can be turned into an exploit. Efficient and effective assessment of exploitability of crashes facilitates to identify severe vulnerabilities and thus prioritize resources. In this paper, we propose...
Considering the consistency of instance level, we come up with a Holistic Data Instance Matching Approach (HIMA). Firstly, we measure the similarity of instances with the algorithm of string distances. HIMA makes use of the clustering algorithm, which it can handle, a large scale of data source holistically. In addition, we use the keyword extracting method, which is based on the maximum entropy model,...
Using data cube to analysis historical fact data online more faster than Ad-Hoc queries, but it need very large external storage. In DSMS (Data Stream Management System), due to capacity of memory is much smaller than disk, we meet even more problem in analyzing stream data by in-memory StreamCube. So, we compress StreamCube to gain more information about stream data in certain storage. We implement...
Considering that travel routing costs change with time against the background of reverse logistics, this paper presents the time dependent vehicle routing problem of simultaneous delivery and pick-up (TD-VRPSDP), and establishes the mixed integer programming model of TD-VRPSDP. The pheromone updating strategy based on rank-based ant colony system and max-min ant system algorithm are used for solving...
In demand of high-speed differential data communication, the common mode filter is usually presented. The new common mode filter demonstrated in this paper is designed by edge-coupled differential pairs. By using double loops routing structure, the coupling inductance is increased. To achieve sufficient common mode noise suppression while introducing minimal signal insertion loss, the full-wave time...
In order to quickly determine and control the chaotic oscillation in supply chain system, to enhance the prediction accuracy of supply chain demand, and ensure the stability of supply chain systems, using fuzzy neural networks based on chaotic time series, sub-phase space is rebuilt by the demand time-series of supply chain system. Calculating the phase-space saturated embedding dimension and the...
An ontology is a explicit formal specification of a shared conceptualization. The application of Ontology in Component, Web Service, Ubiquitous Computing are now popular research topics. The Ontology technology is mainly applied in the semantic reform of the interface layer but not the implementation layer which makes the pre-process work be very large for the componentpsilas consumer. In this paper,...
Data stream has attracted many researchers from various communities (network, database and data mining). There are a variety of techniques for solving the similarity matching in time series datasets. However, subsequence matching over data stream, finding those subsequences which are similar to a query sequence in a progressive and real-time fashion, is a challenging and novel problem due to the high...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.