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.
The grouping problem is critical in collaborative learning (CL) because of the complexity and difficulty in adequate grouping, based on various grouping criteria and numerous learners. Previous studies have paid attention to certain research questions, and the consideration for a number of learner characteristics has arisen. Such a multi-objective grouping problem is with conflicting grouping objectives,...
Performance bugs are programming errors that slow down program execution. While existing techniques can detect various types of performance bugs, a crucial and practical aspect of performance bugs has not received the attention it deserves: how likely are developers to fix a performance bug? In practice, fixing a performance bug can have both benefits and drawbacks, and developers fix a performance...
We study hash-based identification protocols in RFID systems which obtain privacy against active adversaries who can perform compromised attacks. Here, an active adversary can track a tag via successful or unsuccessful identifications with legal or illegal readers. In IEEE Transactions on Parallel and Distributed Systems, Alomair, Clark, Cuellar and Poovendran propose a novel hash-based RFID identification...
In this paper we introduce puncturing techniques to produce high-rate π-rotation low-density parity-check (LDPC) codes. The techniques rely on symmetry considerations to maintain simple description and to achieve excellent performance. We also extend the bounds on the minimum d2 for the high-rate codes.
Constant composition codes arise from applications in powerline communication and balanced scheduling in frequency hopping. Binary constant weight codes and permutation codes are special types of constant composition codes. In ISIT 2009, Chang and Wu proposed a method to construct constant composition codes through distance-increasing mappings from binary vectors to quaternary constant composition...
We study the problem how to construct an RFID mutual authentication protocol between tags and readers. Juels (in Journal on Selected Areas in Communications, 2006) proposed an open question which asks whether there exists a fully privacy-preserving RFID authentication protocol in which the time complexity of a successful authentication phase can be done in sub-linear time o(n) where n is the number...
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.