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.
Recently, many studies in the literature have been intensified in the scope of mobility services, presenting new technological solutions that can minimize problems, such as traffic congestion and the emission of greenhouse gases resulting from the population growth in large cities. Some services, namely shared services, are mainly dedicated to trying to encourage people to use transport that can be...
In this paper we propose MADBE, a Multi-Agent Digital Business Ecosystem. The purpose of this system is to provide a digital software environment for small organisations where they can interact and collaborate with each other and create new joint ventures. We believe that a multidisciplinary approach based on biology, computer science, and business concepts is necessary to produce an evolutionary...
The multi-agent system is the subject of a stream of research within distributed artificial intelligence. For achieving a solution to a certain global problem, each agent has its own local goal to be fulfilled. When working on a shared goal each agent would like its priorities to be given the most consideration. Unfortunately, many agents' priorities (arising from their own personal goals) will not...
With an increased focus on national security and public safety communications, the US Congress revisited its plan to reclaim television broadcaster frequencies to be reallocated and auctioned by the FCC and it specifically allocated a portion of that spectrum for use by public safety. The FCC was charged with the duty of auctioning this spectrum and licensing it to create a public safety network....
Recently, Lee et al. proposed a remote authentication model of information appliances (RAMIA). Unfortunately, RAMIA has a fatal error that opens the entire home network of information appliances to hackers. In this paper, we propose a new secure remote control model for information appliances (SRCMIA) to fix this error. Besides, our model can also achieve both message authentication and one-time secret...
Several vulnerability analysis techniques in web-based applications detect and report on different types of vulnerabilities. However, no single technique provides a generic technology-independent handling of Web-based vulnerabilities. In this paper we present our experience with and experimental exemplification of using the application vulnerability description language (AVDL) to realize a unified...
As digital resources increasingly growing and the economic benefit of digital intellectual property rights being increasingly important, people has been increasingly emphasis on information security issues brought by the data remnants in storage devices. They try their best to prevent the potential risks. In this paper, we survey comprehensively related technologies, standards and trends of erasure,...
In order to encapsulate data and to convey information more efficiently and more security, a draft frame based on active block ciphers for application layer of Internet which could transmit orange data into semantic security and semantic integrity was designed according to scalable purpose. To different network environment, there were different intelligent choices about block cipher algorithms to...
An algorithm is given for the multi-writer version of the Concurrent Reading While Writing (CRWW) problem. The algorithm solves the problem of allowing simultaneous access to arbitrarily sized shared data without requiring waiting, and hence avoids mutual exclusion. This. demonstrates that a quite complicated concurrent control problem can be solved-without eliminating the efficiency of parallelism...
The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any "random self-reducible" problem has a zero knowledge interactive proof of this sort. The zero knowledge interactive proofs for graph isomorphism, quadratic residuosity, and "knowledge" of discrete logarithms all follow as special cases. Based...
A conflict of multiplicity k occurs when k stations transmit simultaneously to a multiple access channel. As a result, all stations receive feedback indicating whether k is 0, 1, or is ≥ 2. If k = 1 the transmission succeeds, whereas if k ≥ 2 all the transmissions fail. In general, no a priori information about k is available. We present and analyze an algorithm that enables the conflicting stations...
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.