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.
Opportunistic dissemination is a promising research domain, for more and more applications that need efficient information spreading in one area are emerging in vehicular ad-hoc networks (VANETs). The most important characteristic of vehicular networks is that they do not have a stable framework. The communication between vehicles mostly depends on the unexpected meeting. Some available data dissemination...
According to prior studies, aggressive behavior and some other anti-social personality maybe originate from home environment, peer pressure, video game. Violent video game as one part of a violent culture that many children and adults inhabit, it plays more important role in today society. The social effect of violent video game has been discussed by many scientists concerning the juvenile violence...
Vehicular ad-hoc networks (VANETs) are promising for more and more intelligent transportation applications, where information is disseminated over a group of vehicles. VANETs are characterized for its unstable framework, in which the isolated vehicles communicate with others only when the unexpected meetings occur. As a result, some available data dissemination schemes do not work well in VANETs....
The factorization problem with knowledge of some bits of prime factor p of RSA modulo N is one of the earliest partial key exposure attacks on RSA. The result proposed by Coppersmith is still the best, i.e., when some of p's higher bits is known as ptilde, assume the unknown part of p and q is p0 and q0, respectively (say, p = ptilde + p0, q = + qtilde + q0), if the upper bounds of them, say X and...
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.