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.
In the airline industry, a Passenger Name Record (PNR) stores the travel itinerary of an individual or group of passengers travelling together. A PNR always contains all the flight information regarding each segment of a journey, and may contain additional important information such as nationality, gender and age of the passengers. From a commercial point of view, these passenger attributes are of...
It is difficult to keep consistent source code. Unintended inconsistencies occur unless we recognize all the code fragments that need to modify in a given bug fix or functional addition. Before modifying source code, keyword-based search tools like grep or code clone detection tools can be used to prevent code fragments from being overlooked. However, once inconsistencies occur in the source code,...
Constraints provide an effective means for the high-level modeling and reasoning of various problems. In particular, soft constraints are useful since they treat over-constrained problems that naturally arise in real-life applications. Therefore, researchers have been exploring frameworks for soft constraints. The framework of semiring-based constraint satisfaction problems (CSPs) can express many...
The development of signal processing and coding techniques for magnetic recording channels has taken place in an environment of escalating demand for higher data transfer rates and storage density. The error probability of many magnetic-recording systems may be characterized in terms of the differences between the sequences that may be recorded. In fact, the bit-error rate is often dominated by a...
In lambda-grid networks, data files are stored on file servers as replicas, and those replicas are downloaded in parallel to reduce downloading time. However, parallel downloading raises the blocking probability of lightpath establishments because parallel downloading wastes many wavelength resources. To resolve this problem, we propose a parallel downloading scheme with network coding which encodes...
In introductory undergraduate courses on digital systems, students have difficulty understanding the state concept. We expect that students have subtle, persistent misconceptions about state because it is an abstract concept and has nuanced meanings in different disciplines as well as colloquial English. To learn how students conceive of state in digital logic, we interviewed undergraduates in computer...
Peer dynamics (departure or failure) in peer-to-peer (P2P) networks disrupts the downloading process to the peers. Previous works on fault resilience include peer selection and overlay topology organization. Random network coding based on the generation concept is a practical approach to implement network coding for data networks in general. If we model the generations as blocks distributed by a seed...
Digital technology has become a central element of how students learn and engineers work. This paper presents findings from a naturally occurring quasi-experiment that compares the design experience of two sophomore-level engineering design teams and their use of technology. Both teams met regularly during normal class hours, but outside of class one team exclusively used technology for collaboration...
Previously, the authors investigated the use of design notebooks as indicators of student participation in team activities. It was demonstrated that design notebooks are a good indicator of teamwork practices. The motivation of this study is to enhance creativity in capstone design. In order to effectively enhance creativity, tools have to be developed to map it. Here an attempt was made to differentiate...
An English text steganographic algorithm is presented that can be applied to plain text as information is embedded by modifying the orders of adjacent character pairs within the words. Matrix encoding is applied for higher embedding efficiency, and the algorithm is proposed to be used in online chat for better concealment. Experiments demonstrated the proposed method has favorable imperceptibility...
Music segmentation is a key issue in music information retrieval (MIR) as it provides an insight into the structure of a composition. Based on structural information, several tasks related to MIR such as searching and browsing large music collections, visualizing musical structure, lyric alignment, and music summarization can be further improved.Various approaches are available to achieve an appropriate...
A remarkable paper by Claude Shannon published in 1948, that introduced the modern and meaningful way of thinking about communication of information, had a formidable impact on technology and on the emergence of the information era. At the same time it spawned the Information Theory Society of the IEEE that has carried the torch of Shannon's ideas and continues to push the frontiers of the fundamental...
RFID is core technology in the area of ubiquitous computing. Identify the objects begin with the reader's query to the tag attached to the subject. When multiple tags exist in the reader's interrogation zone, these tags simultaneously respond to the reader's query, resulting in collision. In RFID system, the reader needs the anti-collision algorithm which can quickly identify all the tags in the interrogation...
We consider the two-user broadcast erasure channel where feedback in the form of ack messages is fed back to the transmitter. We provide an upper bound to the capacity region of this system. We then present two algorithms whose rate region (information bits per transmitted bit) becomes arbitrarily close to the upper bound for large packet sizes. The first algorithm relies on random coding techniques...
The random network coding approach is an effective technique for linear network coding, however it is highly susceptible to errors and adversarial attacks. Recently Kotter and Kschischang introduced the operator channel, where the inputs and outputs are subspaces of a given vector space, showing that this is a natural transmission model in noncoherent random network coding. A suitable metric, defined...
The performance analysis of random linear network codes is important both theoretically and for its applications. In this paper, we derive improved upper bounds for the failure probability of random linear network codes and analyze the limiting behavior as the field size goes to infinity. Unlike the previously reported bounds, the new bound is shown to be tight as the field size |F| goes to infinity.
In video stream transmission over unreliable networks, the loss of a packet may result in an entire video frame, which may consequently cause severe degradation of all subsequent frames. To solve the problem, based on prediction, presented in this paper is a new pre- and post processing method with flexible redundancy insertion between descriptions for frame-based multiple description code. The simulation...
This paper presents a novel approach to network coding for distribution of large files. Instead of the usual approach of splitting packets into disjoint classes (also known as generations) we propose the use of overlapping classes. The overlapping allows the decoder to alternate between Gaussian elimination and back substitution, simultaneously boosting the performance and reducing the decoding complexity...
We investigate transmission of information in a network in the presence of an adversary that can eavesdrop k channels and inject d errors into the network at the same time. We propose a deterministic construction of a secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all the sink nodes which protecting the information from eavesdropping and contamination...
Over acyclic networks, it is well known that the global encoding kernels are uniquely determined by the local encoding kernels. But it is not in the case over cyclic networks. To study this problem, we employ matrix power series to describe the encoding kernels. This arrangement not only makes the physical meaning explicitly, but also makes it easy to obtain the conditions of determining the global...
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.