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.
Identifying tractable classes of constraint satisfaction problems (CSPs) has been studied over the past two decades, and is now a very active research domain. Recently, some works have shown the interest of these tractable classes from a different viewpoint. For example, it is known that if there is no broken triangle on each two values of a given variable in an arc-consistent binary CSP, then this...
This study aims to address how change agents assist engineering instructors in adopting new curriculum. During a two-day workshop, 16 mechanics of materials instructors from community colleges and universities around the Pacific Northwest developed hands-on activities and models that they later implemented in their classrooms. Five additional instructors became interested in the materials developed...
As the maker movement has introduced children and adults to learning by making, researchers have begun to explore different approaches to learning by making and ways that participants take up new fabrication techniques. This work examines instruction in a making activity as a way to scaffold learning in a making activity. University students are introduced to a new-to-them fabrication technique using...
In this paper, we present a new digital hologram compression scheme using the Fresnelet transform and its multiresolutional decomposition properties. A digital hologram is locally divided to several sub-holograms and they are decomposed by the Fresnelet transform into subbands in the type of quad-tree. Among the subbands, the ones that have similar frequency bandwidth are combined into a sequence...
We consider a communication scenario in which the channel undergoes two different classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is modeled by the concept of arbitrarily varying wiretap channels (AVWCs), in which the channel varies from one channel use to the other in an unknown and arbitrary manner. It has been shown that uncorrelated codes fail to...
Two polar coding schemes are proposed for the degraded broadcast channel under different reliability and secrecy requirements. In these settings, the transmitter wishes to send multiple messages to a set of legitimate receivers keeping them masked from a set of eavesdroppers, and individual channels are assumed to gradually degrade in such a way that each legitimate receiver has a better channel than...
This paper considers a problem of highly compressing the data called “Digital-Ink” which is a sequence of position data sampled from the traced curve at a sampling rate. We here suppose that a set of digital-ink is measured and stored as two-dimensional position data by electronic device (e.g. smart-phone and pen-tablet PC, etc.). Then, we develop a method of digital-ink compression using B-spline...
In this paper, we present our prototype system which supports coding of mapping-enhanced SPARQLoid queries for users by providing recommendation mechanisms for both vocabularies and endpoints. Our prototype system aims for reducing the cost for eliciting appropriate ontology mappings and the mapped vocabularies. Furthermore, to make the recommendation of vocabularies and endpoints be widely covered,...
Motivated by applications of distributed storage systems to key-value stores, recently, the multi-version coding problem was proposed to store data that is frequently being updated in a distributed storage system. In particular, in multi-version coding, it is desired to store the data consistently, that is, even if all servers do not receive the data updates simultaneously, the decoder can recover...
In the setting where a data set in ℝD consists of samples from a probability measure ρ concentrated on or near an unknown d-dimensional set M, with D large but d ≪ D, we consider two sets of problems: geometric approximation of M and regression of a function ƒ on M. In the first case we construct multiscale low-dimensional empirical approximations ofM, which are adaptive whenMhas geometric regularity...
This paper shows that the slope at each corner point of the capacity region of the general broadcast channel coincides with that of the randomized time division (hence the Marton) inner bound and the Nair-El Gamal (as well as the Körner-Marton) outer bound. We then show that the optimal superposition coding inner bound by Bandemer, El Gamal, and Kim can be simplified to the convex closure of the union...
The problem of finite-blocklength lossy compression is considered. Motivated by troubling behavior of the rate expressions under an excess-distortion probability constraint, we define the mean excess distortion criterion. We evaluate the asymptotic performance of various settings under this criterion, and show that sharp and insightful rate bounds can be derived.
We consider a setup in which Alice selects a pdf ƒ from a set of prescribed pdfs P and sends a prefix-free codeword W to Bob in order to allow him to generate a single instance of the random variable X ∼ ƒ. We describe a universal coding scheme for this setup and establish an upper bound on the expected codeword length when the pdf ƒ is bounded, orthogonally concave (which includes quasiconcave pdf),...
We develop a polar coding scheme for empirical coordination in a two-node network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction. In the case of non-causal encoding and decoding, we show that polar codes achieve the best known inner bound for the empirical coordination region, provided that a vanishing rate of common randomness...
The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a private (non-confidential) message to User 2. The secrecy-capacity region is characterized by showing that certain inner and outer bounds coincide and that the boundary...
Caching is an effective way to reduce peak-hour network traffic congestion by storing some contents at user's local cache. Maddah-Ali and Niesen (MAN) initiated a fundamental study of caching systems by proposing a scheme (with uncoded cache placement and linear network coding delivery) that is provably optimal to within a factor 4.7. In this paper, when the cache contents and the user demands are...
Algebraic-geometric (AG) codes have long been considered as a possible candidate to replace Reed-Solomon (RS) codes. However, their decoding remains complex and infeasible to implement. Addressing this challenge, our paper proposes a low-complexity Chase (LCC) decoding algorithm for the most popular class of AG codes - Hermitian codes. The LCC decoding is realised by formulating decoding test-vectors,...
We consider the problem of finding the capacity of noisy networks under the presence of Byzantine adversaries, modeled by a joint compound channel and arbitrarily varying channel (AVC) model. This extends our earlier work which considers these models only in isolation. The motivation for this setup is that typically the adversary first selects an arbitrary subset of edges from the network and then...
This paper presents finite-length performance analysis for wireless super-dense networks comprising two multiway relays (SDN-2MWR) to support full data-exchange among massive number of users/devices over Rayleigh fading channels. In practice, finite-length analysis is important since the networks should serve users/devices with low latency indicated by short number of time-slots. Due to the nature...
In this paper, we improve a computational conceptof logic-based consensus among agents that has been introducedrecently. A consensus is defined as a non-contradictoryfragment of the information conveyed by various agents suchthat this fragment does not logically conflict with any agent. In this study, we introduce an additional requirement to theconcept of consensus to avoid some paradoxical consensuses...
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.