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.
Dragonfly network is widely used in modern high-performance computing systems. On this network, however, interference caused by network sharing can lead to significant network congestion and degraded performance. In this work, we present a comparative analysis of intra-application interference on applications with nearest neighbor communication, considering various placement strategies. Our results...
High-radix, low-diameter dragonfly networks will be a common choice in next-generation supercomputers. Preliminary studies show that random job placement with adaptive routing should be the rule of thumb to utilize such networks, since it uniformly distributes traffic and alleviates congestion. Nevertheless, in this work we find that while random job placement coupled with adaptive routing is good...
Vehicle identification is one of the frequently studied problems in video surveillance. Commonly, identifying an unknown vehicle object requires a large amount of training instances. Unfortunately, in the large parking scenario, the cost may be prohibitively expensive because of the finitely waiting time from the car owners. In this paper, we show that it is possible to identify a registered vehicle...
Point matching problem seeks the optimal correspondences between two sets of points. However, the matching result often includes some mismatches that decrease the matching precision. In this paper, we propose a fast algorithm to reject mismatches using pair-wise similarity. The intuition of our algorithm is that the matches should be similar with their neighboring matches due to local consistency...
In the Big Data era, the gap between the storage performance and an application's I/O requirement is increasing. I/O congestion caused by concurrent storage accesses from multiple applications is inevitable and severely harms the performance. Conventional approaches either focus on optimizing an application's access pattern individually or handle I/O requests on a low-level storage layer without any...
Trust is the key factor for the sustainable development of whether e-commerce or m-commerce. Since the research on the trust of business-to-consumer m-commerce is a lack at present, this study analyzes concepts and characters of the trust of B2C m-commerce at first. Then it discusses the impact factors from the perspective of trading parties and environment. Finally a hierarchical model for the trust...
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.