Gotowa bibliografia na temat „Index coding with restricted information”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Index coding with restricted information”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Index coding with restricted information"
1
Hong, Charles, James Fallon i Karl Friston. "fMRI Evidence for Default Mode Network Deactivation Associated with Rapid Eye Movements in Sleep". Brain Sciences 11, nr 11 (18.11.2021): 1528. http://dx.doi.org/10.3390/brainsci11111528.
Pełny tekst źródłaStreszczenie:
System-specific brain responses—time-locked to rapid eye movements (REMs) in sleep—are characteristically widespread, with robust and clear activation in the primary visual cortex and other structures involved in multisensory integration. This pattern suggests that REMs underwrite hierarchical processing of visual information in a time-locked manner, where REMs index the generation and scanning of virtual-world models, through multisensory integration in dreaming—as in awake states. Default mode network (DMN) activity increases during rest and reduces during various tasks including visual perception. The implicit anticorrelation between the DMN and task-positive network (TPN)—that persists in REM sleep—prompted us to focus on DMN responses to temporally-precise REM events. We timed REMs during sleep from the video recordings and quantified the neural correlates of REMs—using functional MRI (fMRI)—in 24 independent studies of 11 healthy participants. A reanalysis of these data revealed that the cortical areas exempt from widespread REM-locked brain activation were restricted to the DMN. Furthermore, our analysis revealed a modest temporally-precise REM-locked decrease—phasic deactivation—in key DMN nodes, in a subset of independent studies. These results are consistent with hierarchical predictive coding; namely, permissive deactivation of DMN at the top of the hierarchy (leading to the widespread cortical activation at lower levels; especially the primary visual cortex). Additional findings indicate REM-locked cerebral vasodilation and suggest putative mechanisms for dream forgetting.
2
Baker, John, Kathryn Berzins, Krysia Canvin, Sarah Kendal, Stella Branthonne-Foster, Judy Wright, Tim McDougall, Barry Goldson, Ian Kellar i Joy Duxbury. "Components of interventions to reduce restrictive practices with children and young people in institutional settings: the Contrast systematic mapping review". Health and Social Care Delivery Research 10, nr 8 (maj 2022): 1–180. http://dx.doi.org/10.3310/yvkt5692.
Pełny tekst źródłaStreszczenie:
Background Incidents in which children or young people experience severe distress or harm or cause distress or harm to others occur frequently in children and young people’s institutional settings. These incidents are often managed using restrictive practices, such as restraint, seclusion, sedation or constant observation; however, these also present significant risks of physical and psychological harm to children and young people as well as staff. Numerous interventions aim to reduce the use of restrictive techniques, but research is hampered by limited attention to specific intervention components. The behavior change technique taxonomy may improve reporting by providing a common language for specifying the content and mechanisms of behaviour change. This study aimed to identify, standardise and report the effectiveness of components of interventions to reduce restrictive practices in children and young people’s institutional settings. Objectives To map interventions aimed at reducing restrictive practices in children and young people’s institutional settings internationally, to conduct behaviour change technique analysis of intervention components, to identify process elements, and to explore effectiveness evidence to identify promising behaviour change techniques and compare the results with those found in adult psychiatric inpatient settings in a companion review. Design Systematic mapping review with programme content coding using the behavior change technique taxonomy. Review methods Eleven relevant English-language health and social care research databases 1989–2019 [including Applied Social Sciences Index (ASSIA), Criminal Justice Abstracts, Educational Resources Information Center (ERIC), MEDLINE and PsycInfo®], grey literature and social media were searched during 2019 (updated January 2020). Data extraction, guided by Workgroup for Intervention Development and Evaluation Research (WIDER), Cochrane Library and theory coding scheme recommendations, included intervention characteristics and study design and reporting. Screening and quality appraisal used the Mixed Methods Appraisal Tool. The behavior change technique taxonomy was applied systematically, and interventions were coded for behaviour change technique components. Outcomes data were then related back to these components. Results There were 121 records, including 76 evaluations. Eighty-two interventions, mostly multicomponent, were identified. Evaluation approaches commonly used a non-randomised design. There were no randomised controlled trials. Behaviour change techniques from 14 out of a possible 16 clusters were detected. Four clusters (i.e. goals and planning, antecedents, shaping knowledge, and feedback and monitoring) contained the majority of identified behaviour change techniques and were detected in over half of all interventions. Two clusters (i.e. self-belief and covert learning) contained no identified behaviour change techniques. The most common setting in which behaviour change techniques were found was ‘mental health’. The most common procedure focused on staff training. The two most common behaviour change techniques were instruction on how to perform the behaviour and restructuring the social environment. Promising behaviour change techniques included instruction on how to perform the behaviour, restructuring the social environment, feedback on outcomes of behaviour and problem-solving. Compared with the companion review, service user perspectives were more sparse and there was more interest in trauma-informed approaches. Effectiveness evidence, range of interventions and reporting were broadly similar. Limitations Poor reporting may have prevented detection of some behaviour change techniques. The finding that the evidence was weak restricted the feasibility of examining behaviour change technique effectiveness. Literature searches were restricted to English-language sources. Conclusions This study generated, to our knowledge, the first review of evidence on the content and effectiveness of interventions to reduce restrictive practices in children and young people’s institutional settings. Interventions tend to be complex, reporting is inconsistent and robust evaluation data are limited, but some behaviour change techniques seem promising. Future work Promising behaviour change techniques could be further explored. Better evidence could help address the urgent need for effective strategies. Study registration This study is registered as PROSPERO CRD42019124730. Funding This project was funded by the National Institute for Health and Care Research (NIHR) Health and Social Care Delivery Research programme and will be published in full in Health and Social Care Delivery Research; Vol. 10, No. 8. See the NIHR Journals Library website for further project information.
3
Bar-Yossef, Ziv, Yitzhak Birk, T. S. Jayram i Tomer Kol. "Index Coding With Side Information". IEEE Transactions on Information Theory 57, nr 3 (marzec 2011): 1479–94. http://dx.doi.org/10.1109/tit.2010.2103753.
Pełny tekst źródła
4
Narayanan, Varun, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani i Vinod M. Prabhakaran. "Private Index Coding". IEEE Transactions on Information Theory 68, nr 3 (marzec 2022): 2020–49. http://dx.doi.org/10.1109/tit.2021.3130629.
Pełny tekst źródła
5
Natarajan, Lakshmi, Yi Hong i Emanuele Viterbo. "Lattice Index Coding". IEEE Transactions on Information Theory 61, nr 12 (grudzień 2015): 6505–25. http://dx.doi.org/10.1109/tit.2015.2491924.
Pełny tekst źródła
6
Lee, Namyoon, Alexandros G. Dimakis i Robert W. Heath. "Index Coding With Coded Side-Information". IEEE Communications Letters 19, nr 3 (marzec 2015): 319–22. http://dx.doi.org/10.1109/lcomm.2015.2388477.
Pełny tekst źródła
7
Kim, Jae-Won, i Jong-Seon No. "Index Coding With Erroneous Side Information". IEEE Transactions on Information Theory 63, nr 12 (grudzień 2017): 7687–97. http://dx.doi.org/10.1109/tit.2017.2756663.
Pełny tekst źródła
8
Manoranjan Paul, i Manzur Murshed. "Efficient Pattern Index coding Using Syndrome Coding and Side Information". International Journal of Engineering and Industries 3, nr 3 (30.09.2012): 1–12. http://dx.doi.org/10.4156/ijei.vol3.issue3.1.
Pełny tekst źródła
9
Pedrosa, Valéria G., i Max H. M. Costa. "Index Coding with Multiple Interpretations". Entropy 24, nr 8 (18.08.2022): 1149. http://dx.doi.org/10.3390/e24081149.
Pełny tekst źródłaStreszczenie:
The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to decode their demanded messages with a minimum number of transmissions, referred to as an index code length. The problem of finding the minimum length index code that enables all receivers to correct a specific number of errors has also been studied. This work establishes a connection between index coding and error-correcting codes with multiple interpretations from the tree construction of nested cyclic codes. The notion of multiple interpretations using nested codes is as follows: different data packets are independently encoded, and then combined by addition and transmitted as a single codeword, minimizing the number of channel uses and offering error protection. The resulting packet can be decoded and interpreted in different ways, increasing the error correction capability, depending on the amount of side information available at each receiver. Motivating applications are network downlink transmissions, information retrieval from datacenters, cache management, and sensor networks.
10
Li, Min, Lawrence Ong i Sarah J. Johnson. "Cooperative Multi-Sender Index Coding". IEEE Transactions on Information Theory 65, nr 3 (marzec 2019): 1725–39. http://dx.doi.org/10.1109/tit.2018.2869161.
Pełny tekst źródłaRozprawy doktorskie na temat "Index coding with restricted information"
1
Su, Yong. "Mathematical modeling with applications in high-performance coding". Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1127139848.
Pełny tekst źródłaStreszczenie:
Thesis (Ph. D.)--Ohio State University, 2005.Title from first page of PDF file. Document formatted into pages; contains xiv, 130 p.; also includes graphics (some col.). Includes bibliographical references (p. 125-130). Available online via OhioLINK's ETD Center
2
Wan, Kai. "Limites fondamentales de stockage pour les réseaux de diffusion de liens partagés et les réseaux de combinaison". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS217/document.
Pełny tekst źródłaStreszczenie:
Dans cette thèse, nous avons étudié le problème de cache codée en construisant la connexion entre le problème de cache codée avec placement non-codé et codage d'index, et en tirant parti des résultats de codage d'index pour caractériser les limites fondamentales du problème de cache codée. Nous avons principalement analysé le problème de cache codée dans le modèle de diffusion à liaison partagée et dans les réseaux combinés. Dans la première partie de cette thèse, pour les réseaux de diffusion de liens partagés, nous avons considéré la contrainte que le contenu placé dans les caches est non-codé. Lorsque le contenu du cache est non-codé et que les demandes de l'utilisateur sont révélées, le problème de cache peut être lié à un problème de codage d'index. Nous avons dérivé des limites fondamentales pour le problème de cache en utilisant des outils pour le problème de codage d'index. Nous avons dérivé un nouveau schéma réalisable de codage d'index en base d'un codage de source distribué. Cette borne interne est strictement meilleure que la borne interne du codage composite largement utilisée. Pour le problème de cache centralisée, une borne externe sous la contrainte de placement de cache non-codé est proposée en base de une borne externe “acyclic” de codage d’index. Il est prouvé que cette borne externe est atteinte par le schéma cMAN lorsque le nombre de fichiers n'est pas inférieur au nombre d'utilisateurs, et par le nouveau schéma proposé pour le codage d’index, sinon. Pour le problème de cache décentralisée, cette thèse propose une borne externe sous la contrainte que chaque utilisateur stocke des bits uniformément et indépendamment au hasard. Cette borne externe est atteinte par le schéma dMAN lorsque le nombre de fichiers n'est pas inférieur au nombre d'utilisateurs, et par notre codage d'index proposé autrement. Dans la deuxième partie de cette thèse, nous avons considéré le problème de cache dans les réseaux de relais, où le serveur communique avec les utilisateurs aidés par le cache via certains relais intermédiaires. En raison de la dureté de l'analyse sur les réseaux généraux, nous avons principalement considéré un réseau de relais symétrique bien connu, `réseaux de combinaison’, y compris H relais et binom {H} {r} utilisateurs où chaque utilisateur est connecté à un r-sous-ensemble de relais différent. Nous avons cherché à minimiser la charge de liaison maximale pour les cas les plus défavorables. Nous avons dérivé des bornes externes et internes dans cette thèse. Pour la borne externes, la méthode directe est que chaque fois que nous considérons une coupure de x relais et que la charge totale transmise à ces x relais peut être limitée à l'extérieur par la borne externes du modèle de lien partagé, y compris binom {x} {r} utilisateurs. Nous avons utilisé cette stratégie pour étendre les bornes externes du modèle de lien partagé et la borne externe “acyclic” aux réseaux de combinaison. Dans cette thèse, nous avons également resserré la borne externe “acyclic” dans les réseaux de combinaison en exploitant davantage la topologie du réseau et l'entropie conjointe des diverses variables aléatoires. Pour les schémas réalisables, il existe deux approches, la séparation et la non-séparation. De plus, nous avons étendu nos résultats à des modèles plus généraux, tels que des réseaux combinés où tous les relais et utilisateurs sont équipés par cache, et des systèmes de cache dans des réseaux relais plus généraux. Les résultats d'optimisation ont été donnés sous certaines contraintes et les évaluations numériques ont montré que nos schémas proposés surpassent l'état de l'artIn this thesis, we investigated the coded caching problem by building the connection between coded caching with uncoded placement and index coding, and leveraging the index coding results to characterize the fundamental limits of coded caching problem. We mainly analysed the caching problem in shared-link broadcast model and in combination networks. In the first part of this thesis, for cache-aided shared-link broadcast networks, we considered the constraint that content is placed uncoded within the caches. When the cache contents are uncoded and the user demands are revealed, the caching problem can be connected to an index coding problem. We derived fundamental limits for the caching problem by using tools for the index coding problem. A novel index coding achievable scheme was first derived based on distributed source coding. This inner bound was proved to be strictly better than the widely used “composite (index) coding” inner bound by leveraging the ignored correlation among composites and the non-unique decoding. For the centralized caching problem, an outer bound under the constraint of uncoded cache placement is proposed based on the “acyclic index coding outer bound”. This outer bound is proved to be achieved by the cMAN scheme when the number of files is not less than the number of users, and by the proposed novel index coding achievable scheme otherwise. For the decentralized caching problem, this thesis proposes an outer bound under the constraint that each user stores bits uniformly and independently at random. This outer bound is achieved by dMAN when the number of files is not less than the number of users, and by our proposed novel index coding inner bound otherwise. In the second part of this thesis, we considered the centralized caching problem in two-hop relay networks, where the server communicates with cache-aided users through some intermediate relays. Because of the hardness of analysis on the general networks, we mainly considered a well-known symmetric relay networks, combination networks, including H relays and binom{H}{r} users where each user is connected to a different r-subset of relays. We aimed to minimize the max link-load for the worst cases. We derived outer and inner bounds in this thesis. For the outer bound, the straightforward way is that each time we consider a cut of x relays and the total load transmitted to these x relays could be outer bounded by the outer bound for the shared-link model including binom{x}{r} users. We used this strategy to extend the outer bounds for the shared-link model and the acyclic index coding outer bound to combination networks. In this thesis, we also tightened the extended acyclic index coding outer bound in combination networks by further leveraging the network topology and joint entropy of the various random variables. For the achievable schemes, there are two approaches, separation and non-separation. In the separation approach, we use cMAN cache placement and multicast message generation independent of the network topology. We then deliver cMAN multicast messages based on the network topology. In the non-separation approach, we design the placement and/or the multicast messages on the network topology. We proposed four delivery schemes on separation approach. On non-separation approach, firstly for any uncoded cache placement, we proposed a delivery scheme by generating multicast messages on network topology. Moreover, we also extended our results to more general models, such as combination networks with cache-aided relays and users, and caching systems in more general relay networks. Optimality results were given under some constraints and numerical evaluations showed that our proposed schemes outperform the state-of-the-art
3
Thomas, Anoop. "Index Coding, Error Correcting Index Codes And Matroids". Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5326.
Pełny tekst źródłaStreszczenie:
In the problem of index coding, there is a central source sending messages to a
set of receivers which demand messages over a noiseless broadcast channel. Each
receiver knows a subset of messages which is referred to as side-information. A
backward channel exists between each of the receivers and the source. Receivers
use the reverse channel to communicate the side-information back to the source.
The source uses this side-information to develop encoding schemes so that all the
receivers are satisfied with minimum number of transmissions.
In this work, we consider few problems related to index coding. First, we
consider the informed source coding problem in which the receiver communicates
only the cardinality of the side-information available to it and not the messages
that constitute the side-information. We use l-th Near Maximum Distance Sep-
arable (Near-MDS) codes to construct encoding schemes for the informed source
coding problem. The advantage of using l-th Near-MDS codes is the reduction of
required field size. For certain class of informed source coding problems, we show
that the codes constructed from l`-th Near-MDS codes are optimal under some
field size restrictions.
Links between matroid theory, network coding and index coding problems have
been an active area of research. The generalized index coding problem is a general
version of the conventional index coding problem in which both the source and
receivers possess linear functions of messages. We establish connections between
representation of discrete polymatroids and generalized index coding. We show
that the generalized index coding problem has a vector linear solution if and only
if there exists a representable discrete polymatroid satisfying certain conditions.
Further, from a discrete polymatroid a generalized index coding problem is con-
structed. It is shown that if the generalized index coding problem has a vector linear solution over the binary eld then an associated discrete polymatroid is
representable over the binary eld. For generalized index coding problems con-
structed from matroids, we show that a scalar linear solution to the constructed
problem exists if and only if the matroid is binary representable.
We also consider the index coding with restricted information (ICRI) problem
in which the source must ensure that each receiver will not be able to decode a
certain subset of messages. Interference alignment techniques are used to obtain
results on the ICRI problem. Necessary conditions for the existence of a solution
to the ICRI problem is found. A technique to obtain solutions to the ICRI problem
using contractions corresponding to restrictions is obtained.
Index coding over noisy channels is also considered. Error correcting index
codes are encoding schemes which enable every receiver to correct up to a certain
number of errors in the received message. We allow each receiver to have a di erent
error correcting capability and introduce di erential error correcting index codes to
achieve this. A set of necessary and su cient conditions for a matrix to correspond
to a vector linear di erential index code is found. We establish the link between
vector linear di erential error correcting index codes and discrete polymatroids.
It is shown that a vector linear di erential error correcting index code exists if
and only if there exists a representable discrete polymatroid satisfying certain
conditions.
Lastly, index coding problem over binary symmetric channels is studied. It
is observed that the probability of error at each receiver depends on the index
code used. A condition on the optimal index codes which minimize the maximum
error probability among all the receivers is derived. For a special class of index
coding problems, an algorithm to identify an optimal index code which gives the
best performance in terms of minimal maximum error probability across all the
receivers is provided.
4
Thapa, Chandra. "Graphical approaches to single-sender and two-sender index coding". Thesis, 2018. http://hdl.handle.net/1959.13/1388175.
Pełny tekst źródłaStreszczenie:
Research Doctorate - Doctor of Philosophy (PhD)In index coding, a sender broadcasts messages through a noiseless broadcast channel to multiple receivers, each possessing a subset of the messages a priori, known as side-information. The sender knows the side-information available at each receiver, and uses that information to broadcasts coded messages, called an index code, such that all receivers can decode their requested messages using their side-information and the received index code. The aim is to find an index code with the minimum information bits per received message bits, called the optimal broadcast rate. The index-coding problem is applicable in many real-world contexts such as content-distribution networks (e.g., a network providing video-on-demand services), satellite communications, and distributed storage (e.g., data centers). In this dissertation, we investigate unicast-index-coding (UIC) problems, where each message is requested by only one receiver, each receiver requests only one message and each receiver has a subset of messages except its requested messages in side-information. These problems can be modeled by directed graphs. We apply graph-based approaches to the two types of the UIC problems based on the number of senders, namely single-sender unicast-index-coding (SSUIC) and two-sender unicast-index-coding (TSUIC) problems. In SSUIC, we propose a new scheme, called interlinked-cycle-cover (ICC) scheme, that exploits interlinked-cycle (IC) structures (a form of overlapping cycles that generalizes cliques and cycles) in directed graphs. This scheme provides an upper bound on the optimal broadcast rate for any SSUIC instance, and construct a linear index code. We prove that the ICC scheme is optimal over all linear and non-linear index codes for a class of infinitely many digraphs. We show that the ICC scheme can outperform existing schemes for some SSUIC instances with six receivers. Further, we extend the IC structures and the scheme. We find that the ICC scheme (including the extended scheme) provides the optimal broadcast rates for all message alphabet sizes for all SSUIC instances up to five receivers except eight problems. In TSUIC, firstly, we extend the existing SSUIC graph-based schemes, namely clique-cover, cycle-cover, and local-chromatic-number schemes to TSUIC. Then we investigate the TSUIC problems by its structural characterization. By considering three sub-problems of a TSUIC problem based on whether the receivers' requests are available at only one sender or both senders, we formulate its optimal broadcast rate as a function of the optimal broadcast rates of its three sub-problems. Furthermore, for this formulation, we extend the notion of confusion graphs and graph coloring to TSUIC. We characterize a class of infinitely many TSUIC instances where a certain type of side-information can be removed without affecting their optimal broadcast rates.
5
Jeon, Hyun-Ho. "Enhanced video coding based on video analysis and metadata information". Thesis, 2007. http://hdl.handle.net/1828/194.
Pełny tekst źródłaStreszczenie:
Achieving high compression ratio without significant loss of quality is the main goal of the most standard video coding systems. Since consecutive frames of a general video sequence have high correlations, the temporal redundancy between frames is removed by using motion estimation and motion compensation techniques. In this thesis, we investigate the use of video content information within the video coding system and propose a new video coding approach that can save significant bit-rates of the compressed video. Main units of the proposed coding scheme include the scene analyzer and image interpolator. The scene analyzer at the encoder extracts scene-modeling parameters from input sequences. The image interpolator at the decoder reconstructs the video frames by using the transmitted modeling parameters.
The scene analyzer consists of the camera motion detector and image-matching module. We propose a new camera motion detection method that directly analyzes the 2-D distribution of inter-frame motion fields. Experimental results show that the proposed method provides higher detection accuracy and faster computation time than the 1-D angle histogram-based method. A robust image-matching method that is invariant to scale changes, rotations, and illumination changes has been presented. Invariance to these changes is achieved by adopting mutual information as a measure of similarity and adaptively changing the size and orientation of the local matching windows. To reduce ambiguities of the local matching, a global matching technique has been combined with the local matching.
To evaluate the performance of the proposed coding scheme, we have integrated the camera motion detector, the image-matching module, and the image interpolator with the standard MPEG-4 video codec. We compare our method with the standard MPEG-4 codec in terms of bit rates, computation time, and subjective and objective qualities.
6
Gupta, Anindya. "Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes". Thesis, 2016. http://etd.iisc.ac.in/handle/2005/2999.
Pełny tekst źródłaStreszczenie:
Network coding was introduced as a means to increase throughput in communication networks when compared to routing. Network coding can be used not only to communicate messages from some nodes in the network to other nodes but are also useful when some nodes in a network are interested in computing some functions of information generated at some other nodes. Such a situation arises in sensor networks. In this work, we study three problems in network coding.
First, we consider the functional source coding with side information problem wherein there is one source that generates a set of messages and one receiver which knows some functions of source messages and demands some other functions of source messages. Cognizant of the receiver's side information, the source aims to satisfy the demands of the receiver by making minimum number of coded transmissions over a noiseless channel. We use row-Latin rectangles to obtain optimal codes for a given functional source coding with side information problem. Next, we consider the multiple receiver extension of this problem, called the functional index coding problem, in which there are multiple receivers, each knowing and demanding disjoint sets of functions of source messages. The source broadcasts coded messages, called a functional index code, over a noiseless channel. For a given functional index coding problem, the restrictions the demands of the receivers pose on the code are represented using the generalized exclusive laws and it is shown that a code can be obtained using the confusion graph constructed using these laws. We present bounds on the size of an optimal code based on the parameters of the confusion graph. For the case of noisy broadcast channel, we provide a necessary and sufficient condition that a code must satisfy for correct decoding of desired functions at each receiver and obtain a lower bound on the length of an error-correcting functional index code.
In the second problem, we explore relation between network function computation problems and functional index coding and Metroid representation problems. In a network computation problem, the demands of the sink nodes in a directed acyclic multichip network include functions of the source messages. We show that any network computation problem can be converted into a functional index coding problem and vice versa. We prove that a network code that satisfies all the sink demands in a network computation problem exists if and only if its corresponding functional index coding problem admits a functional index code of a specific length. Next, we establish a relation between network computation problems and representable mastoids. We show that a network computation problem in which the sinks demand linear functions of source messages admits a scalar linear solution if and only if it is matricidal with respect to a representable Metroid whose representation fulfils certain constraints dictated by the network computation problem.
Finally, we study the usage of the sum-product (SP) algorithm for decoding network codes. Though lot of methods to obtain network codes exist, the decoding procedure and complexity have not received much attention. We propose a SP algorithm based decoder for network codes which can be used to decode both linear and nonlinear network codes. We pose the decoding problem at a sink node as a marginalize a product function (MPF) problem over the Boolean smearing and use the SP algorithm on a suitably constructed factor graph to perform decoding. We propose and demonstrate the usage of trace back to reduce the number of operations required to perform SP decoding. The computational complexity of performing SP decoding with and without trace back is obtained. For nonlinear network codes, we define fast decidability of a network code at sinks that demand all the source messages and identify a sufficient condition for the same. Next, for network function computation problems, we present an MPF formulation for function computation at a sink node and use the SP algorithm to obtain the value of the demanded function.
7
Gupta, Anindya. "Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes". Thesis, 2016. http://hdl.handle.net/2005/2999.
Pełny tekst źródłaStreszczenie:
Network coding was introduced as a means to increase throughput in communication networks when compared to routing. Network coding can be used not only to communicate messages from some nodes in the network to other nodes but are also useful when some nodes in a network are interested in computing some functions of information generated at some other nodes. Such a situation arises in sensor networks. In this work, we study three problems in network coding.
First, we consider the functional source coding with side information problem wherein there is one source that generates a set of messages and one receiver which knows some functions of source messages and demands some other functions of source messages. Cognizant of the receiver's side information, the source aims to satisfy the demands of the receiver by making minimum number of coded transmissions over a noiseless channel. We use row-Latin rectangles to obtain optimal codes for a given functional source coding with side information problem. Next, we consider the multiple receiver extension of this problem, called the functional index coding problem, in which there are multiple receivers, each knowing and demanding disjoint sets of functions of source messages. The source broadcasts coded messages, called a functional index code, over a noiseless channel. For a given functional index coding problem, the restrictions the demands of the receivers pose on the code are represented using the generalized exclusive laws and it is shown that a code can be obtained using the confusion graph constructed using these laws. We present bounds on the size of an optimal code based on the parameters of the confusion graph. For the case of noisy broadcast channel, we provide a necessary and sufficient condition that a code must satisfy for correct decoding of desired functions at each receiver and obtain a lower bound on the length of an error-correcting functional index code.
In the second problem, we explore relation between network function computation problems and functional index coding and Metroid representation problems. In a network computation problem, the demands of the sink nodes in a directed acyclic multichip network include functions of the source messages. We show that any network computation problem can be converted into a functional index coding problem and vice versa. We prove that a network code that satisfies all the sink demands in a network computation problem exists if and only if its corresponding functional index coding problem admits a functional index code of a specific length. Next, we establish a relation between network computation problems and representable mastoids. We show that a network computation problem in which the sinks demand linear functions of source messages admits a scalar linear solution if and only if it is matricidal with respect to a representable Metroid whose representation fulfils certain constraints dictated by the network computation problem.
Finally, we study the usage of the sum-product (SP) algorithm for decoding network codes. Though lot of methods to obtain network codes exist, the decoding procedure and complexity have not received much attention. We propose a SP algorithm based decoder for network codes which can be used to decode both linear and nonlinear network codes. We pose the decoding problem at a sink node as a marginalize a product function (MPF) problem over the Boolean smearing and use the SP algorithm on a suitably constructed factor graph to perform decoding. We propose and demonstrate the usage of trace back to reduce the number of operations required to perform SP decoding. The computational complexity of performing SP decoding with and without trace back is obtained. For nonlinear network codes, we define fast decidability of a network code at sinks that demand all the source messages and identify a sufficient condition for the same. Next, for network function computation problems, we present an MPF formulation for function computation at a sink node and use the SP algorithm to obtain the value of the demanded function.
8
Tabatabaei-Yazdi, Seyed. "Design and Analysis of Low Complexity Network Coding Schemes". Thesis, 2011. http://hdl.handle.net/1969.1/128797.
Pełny tekst źródłaStreszczenie:
In classical network information theory, information packets are treated as commodities, and the nodes of the network are only allowed to duplicate and forward the packets. The new paradigm of network coding, which was introduced by Ahlswede et al., states that if the nodes are permitted to combine the information packets and forward a function of them, the throughput of the network can dramatically increase. In this dissertation we focused on the design and analysis of low complexity network coding schemes for different topologies of wired and wireless networks. In the first part we studied the routing capacity of wired networks. We provided a description of the routing capacity region in terms of a finite set of linear inequalities. We next used this result to study the routing capacity region of undirected ring networks for two multimessage scenarios. Finally, we used new network coding bounds to prove the optimality of routing schemes in these two scenarios. In the second part, we studied node-constrained line and star networks. We derived the multiple multicast capacity region of node-constrained line networks based on a low complexity binary linear coding scheme. For star networks, we examined the multiple unicast problem and offered a linear coding scheme. Then we made a connection between the network coding in a node-constrained star network and the problem of index coding with side information. In the third part, we studied the linear deterministic model of relay networks (LDRN). We focused on a unicast session and derived a simple capacity-achieving transmission scheme. We obtained our scheme by a connection to the submodular flow problem through the application of tools from matroid theory and submodular optimization theory. We also offered polynomial-time algorithms for calculating the capacity of the network and the optimal coding scheme. In the final part, we considered the multicasting problem in an LDRN and proposed a new way to construct a coding scheme. Our construction is based on the notion of flow for a unicast session in the third part of this dissertation. We presented randomized and deterministic polynomial-time versions of our algorithm.
9
Chaudhry, Mohammad. "Network Coding in Distributed, Dynamic, and Wireless Environments: Algorithms and Applications". Thesis, 2011. http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10529.
Pełny tekst źródłaStreszczenie:
The network coding is a new paradigm that has been shown to improve throughput, fault tolerance, and other quality of service parameters in communication networks. The basic idea of the network coding techniques is to relish the "mixing" nature of the information flows, i.e., many algebraic operations (e.g., addition, subtraction etc.) can be performed over the data packets. Whereas traditionally information flows are treated as physical commodities (e.g., cars) over which algebraic operations can not be performed. In this dissertation we answer some of the important open questions related to the network coding. Our work can be divided into four major parts.
Firstly, we focus on network code design for the dynamic networks, i.e., the networks with frequently changing topologies and frequently changing sets of users. Examples of such dynamic networks are content distribution networks, peer-to-peer networks, and mobile wireless networks. A change in the network might result in infeasibility of the previously assigned feasible network code, i.e., all the users might not be able to receive their demands. The central problem in the design of a feasible network code is to assign local encoding coefficients for each pair of links in a way that allows every user to decode the required packets. We analyze the problem of maintaining the feasibility of a network code, and provide bounds on the number of modifications required under dynamic settings. We also present distributed algorithms for the network code design, and propose a new path-based assignment of encoding coefficients to construct a feasible network code.
Secondly, we investigate the network coding problems in wireless networks. It has been shown that network coding techniques can significantly increase the overall
throughput of wireless networks by taking advantage of their broadcast nature. In wireless networks each packet transmitted by a device is broadcasted within a certain
area and can be overheard by the neighboring devices. When a device needs to transmit packets, it employs the Index Coding that uses the knowledge of what the device's neighbors have heard in order to reduce the number of transmissions. With the Index Coding, each transmitted packet can be a linear combination of the original packets. The Index Coding problem has been proven to be NP-hard, and NP-hard to approximate. We propose an efficient exact, and several heuristic solutions for the Index Coding problem. Noting that the Index Coding problem is NP-hard to approximate, we look at it from a novel perspective and define the Complementary Index Coding problem, where the objective is to maximize the number of transmissions that are saved by employing coding compared to the solution that does not involve coding. We prove that the Complementary Index Coding problem can be approximated in several cases of practical importance. We investigate both the multiple unicast and multiple multicast scenarios for the Complementary Index Coding problem for computational complexity, and provide polynomial time approximation algorithms.
Thirdly, we consider the problem of accessing large data files stored at multiple locations across a content distribution, peer-to-peer, or massive storage network. Parts of the data can be stored in either original form, or encoded form at multiple network locations. Clients access the parts of the data through simultaneous downloads from several servers across the network. For each link used client has to pay some cost. A client might not be able to access a subset of servers simultaneously due to network restrictions e.g., congestion etc. Furthermore, a subset of the servers might contain correlated data, and accessing such a subset might not increase amount of information at the client. We present a novel efficient polynomial-time solution for this problem that leverages the matroid theory.
Fourthly, we explore applications of the network coding for congestion mitigation and over flow avoidance in the global routing stage of Very Large Scale Integration
(VLSI) physical design. Smaller and smarter devices have resulted in a significant increase in the density of on-chip components, which has given rise to congestion
and over flow as critical issues in on-chip networks. We present novel techniques and algorithms for reducing congestion and minimizing over flows.
Książki na temat "Index coding with restricted information"
1
Arbabjolfaei, Fatemeh, i Young-Han Kim. Fundamentals of Index Coding. Now Publishers, 2018.
Znajdź pełny tekst źródła
2
Fanburg, Jonathan, red. 5210 Pediatric Obesity Clinical Decision Support Chart. Wyd. 2. American Academy of Pediatrics, 2014. http://dx.doi.org/10.1542/9781581108941.
Pełny tekst źródłaStreszczenie:
This convenient flip chart provides child health care professionals practical support and guidance to help improve care and outcomes for overweight youth. Bring your practice the latest ready-to-use tools including *Step-by-step prevention, assessment, and treatment interventions for the overweight and obese child developed by the CDC *15-minute obesity prevention protocol *Hypertension evaluation and management guidelines *Growth charts spanning birth to 20 years of age, including body mass index-for-age percentiles *Blood pressure levels for boys and girls *Coding information for obesity-related health services
3
Hassink, Sandra G., red. 5210 Pediatric Obesity Clinical Decision Support Chart. American Academy of Pediatrics, 2008. http://dx.doi.org/10.1542/9781581104219.
Pełny tekst źródłaStreszczenie:
This convenient flip chart provides child health care professionals practical support and guidance to help improve care and outcomes for overweight youth. "This flip chart is an easy to use general reference for treatment of childhood obesity. The 5210 guidelines are easy to recall for parents and children. The quick access to body-mass index (BMI) and blood pressure charts are useful tools to have in the office." Amanda Jackson, MD, Ochsner Clinic Foundation, Doody's Review. Bring your practice the latest ready-to-use tools including step-by-step prevention, assessment, and treatment interventions for the overweight and obese child developed by the CDC; 15-minute obesity prevention protocol; hypertension evaluation and management guidelines; growth charts spanning birth to age 20 years--including body mass index-for-age percentiles; blood pressure levels for boys and girls; and coding information for obesity-related health services. Adapted from the keep ME healthy flip chart developed by the Maine Center for Public Health and the Maine Chapter of the AAP.
Części książek na temat "Index coding with restricted information"
1
Byrne, Eimear, i Marco Calderini. "Index Coding, Network Coding and Broadcast with Side-Information". W Network Coding and Subspace Designs, 247–93. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70293-3_10.
Pełny tekst źródła
2
Kuckelberg, Alexander. "The Matrix-Index Coding Approach to Efficient Navigation in Persistent Object Stores". W Fundamentals of Information Systems, 99–112. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5137-9_7.
Pełny tekst źródła
3
Chen, Yangjun. "An Efficient and Effective Index Structure for Query Evaluation in Search Engines". W Encyclopedia of Information Science and Technology, Fourth Edition, 7995–8005. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2255-3.ch695.
Pełny tekst źródłaStreszczenie:
In this chapter, we discuss an efficient and effective index mechanism for search engines to support both conjunctive and disjunctive queries. The main idea behind it is to decompose an inverted list into a collection of disjoint sub-lists. We will associate each word with an interval sequence, which is created by applying a kind of tree coding to a trie structure constructed over all the word sequences in a database. Then, attach each interval, instead of a word, with an inverted sub-list. In this way, both set intersection and union can be conducted by performing a series of simple interval containment checks. Experiments have been conducted, which shows that the new index is promising. Also, how to maintain indexes, when inserting or deleting documents, is discussed in great detail.
4
Rahman, Hakikur. "Role of ICT in Establishing E-Government System for Disadvantaged Communities". W Information Communication Technologies, 1482–93. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59904-949-6.ch101.
Pełny tekst źródłaStreszczenie:
Information and communications technologies (ICTs) are playing an increasingly vital role in the daily lives of all communities by revolutionizing their working procedures and rules of governance. ICTs offer a unique opportunity for governing elite to overcome the crisis of representative democracy, as ICT and the Internet empower civil society to play its role more effectively and facilitate the performance of governments’ main function-serving the people who elect them (Misnikov, 2003). In the realm of government, ICT applications are promising to enhance the delivery of public goods and services to common people not only by improving the process and management of government, but also by redefining the age-old traditional concepts. Community networking groups and local government authorities are well placed to campaign for greater inclusion for all members of the community in the information society. Possible areas to target include the provision of technology at low or no cost to groups through community technology centres or out of hours school access. There are many possibilities and local government must take a significant role in these activities (Young, 2000). Information society is based on the effective use and easy access of information and knowledge, while ICT for development (or ICTD) is not restricted to technology itself but focusing on manifold development and diverse manifestations for the people to improve their well-being. ICTD has deep roots in governance, is part of governance and has effects on governance patters and practices at both central and local level. By recognizing these facts, UNDP focuses on technologies to end poverty at WSIS Cyber Summit 2003, and emphasizes on ways that new technologies can help lift more than one billion people out of extreme poverty (UNDP, 2003). Apart from the four Asian IT giants (Korea, Rep., Hong Kong, China, Taiwan, China, and Japan), most of the Asian countries have fallen under the “low access” category of the Digital Access Index. This has also been referred in the WSIS Cyber Summit 2003, until now, limited infrastructure has often been regarded as the main barrier to bridging the digital divide (ITU, 2003). Among the countries with ICT spending as share of their GDP, Sweden, UK, The Netherlands, Denmark, and France (8.63, 7.97, 7.39, 7.19, and 6.57% respectively during 1992-2001) remain at the top (Daveri, 2002, p. 9), while countries like Bangladesh, Greece, Mexico, Niger, and many more remain at the bottom (EC, 2001; ITU, 2003b; Miller, 2001; Piatkowski, 2002). In a similar research it has been found that in terms of average share of ICT spending GDP, New Zealand, Sweden, Australia, USA, and UK (9.3, 8.4, 8.1, 8.1, and 7.8% respectively during 1992-1999) were among the highest (Pohjola, 2002, p. 7), though most of the countries in the Asian and African regions remain below the average of 5%. The disadvantaged communities in the countries staying below average in ICT spending seem to be lagging in forming appropriate information-based economy and eventually fall behind in achieving proper e-government system. The e-government system in those countries need to enhance access to and delivery of government services to benefit people, help strengthen government’s drive toward effective governance and increased transparency, and better management of the country’s social and economic resources for development. The key to e-government is the establishment of a long-term dynamic strategy to fulfill the citizen needs by transforming internal operations. E-government should result in the efficiency and swift delivery and services to citizens, business, government employees and agencies. For citizens and businesses, e-government seems the simplification of procedures and streamlining of different approval processes, while for government employees and agencies, it means the facilitation of cross-agency coordination and collaboration to ensure appropriate and timely decision-making. Thus, e-government demands transformation of government procedures and redefining the process of working with people and activities relating to people. The outcome would be a societal, organizational, and technological change for the government and to its people, with IT as an enabling factor. E-government should concentrate on more efficient delivery of public services, better management of financial, human and public resources and goods at all levels of government, in particular at local level, under conditions of sustainability, participation, interoperability, increased effectiveness and transparency (EU, 2002). ICT brings pertinent sides more closely by prioritizing partnerships between the state, business and civil society. A few East European countries have became economically liberal with the high level of foreign direct investment per capita and at the same time became ICT-advanced regional leaders in terms of economic reform. These countries also present the region’s most vivid examples of partnerships and collaboration. They have clearly manifested the importance of the public-private partnerships, transparent bottom-up strategies, involvement of all stakeholders, total governmental support, capturing economic opportunities, and enabling electronic mediated businesses, responding to the challenges of globalization.
5
Montemurro, Marcelo A. "A Generalization of the Zipf-Mandelbrot Law in Linguistics". W Nonextensive Entropy. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780195159769.003.0025.
Pełny tekst źródłaStreszczenie:
Human language evolved by natural mechanisms into an efficient system capable of coding and transmitting highly structured information [12, 13, 14]. As a remarkable complex system it allows many levels of description across its organizational hierarchy [1, 11, 18]. In this context statistical analysis stands as a valuable tool in order to reveal robust structural patterns that may have resulted from its long evolutionary history. In this chapter we shall address the statistical regularities of human language at its most basic level of description, namely the rank-frequency distribution of words. Around 1932 the philologist George Zipf [6, 19, 20] noted the manifestation of several robust power-law distributions arising in different realms of human activity. Among them, the most striking was undoubtedly the one referring to the distribution of words frequencies in human languages. The best way to introduce Zipf's law for words is by means of a concrete example. Let us take a literary work, say, James Joyce's Ulysses, and perform some basic statistics on it, whic simply consists in counting all the words present in the text and noting how many occurrences each distinct word form has. For this particular text we should arrive at the following numbers: the total number of words N = 268,112, and the number of different word forms V = 28,838. We can now order the list of different words according to decreasing number of occurrences, and we can assign to each word a rank index s equal to its position in the list starting from the most frequent word. Some general features of the rank-ordered list of words can be mentioned at this point. First, the top-rank words are functional components of language devoid of direct meaning, such as the article the and prepositions, for instance. A few ranks down the list, words more related to the contents of the text start to appear.
Streszczenia konferencji na temat "Index coding with restricted information"
1
Thomas, Anoop, i B. Sundar Rajan. "Index Coding with Restricted Information (ICRI) and Interference Alignment". W 2017 IEEE Global Communications Conference (GLOBECOM 2017). IEEE, 2017. http://dx.doi.org/10.1109/glocom.2017.8254152.
Pełny tekst źródła
2
Sadeghi, Parastoo, Fatemeh Arbabjolfaei i Young-Han Kim. "Distributed index coding". W 2016 IEEE Information Theory Workshop (ITW). IEEE, 2016. http://dx.doi.org/10.1109/itw.2016.7606850.
Pełny tekst źródła
3
Porter, Alexandra, i Mary Wootters. "Embedded Index Coding". W 2019 IEEE Information Theory Workshop (ITW). IEEE, 2019. http://dx.doi.org/10.1109/itw44776.2019.8988921.
Pełny tekst źródła
4
Arbabjolfaei, Fatemeh, Bernd Bandemer i Young-Han Kim. "Index coding via random coding". W 2014 Iran Workshop on Communication and Information Theory (IWCIT). IEEE, 2014. http://dx.doi.org/10.1109/iwcit.2014.6842484.
Pełny tekst źródła
5
Tehrani, Arash Saber, Alexandros G. Dimakis i Michael J. Neely. "Bipartite index coding". W 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283853.
Pełny tekst źródła
6
Brahma, Siddhartha, i Christina Fragouli. "Pliable index coding". W 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283912.
Pełny tekst źródła
7
Kao, David T. H., Mohammad Ali Maddah-Aliy i A. Salman Avestimehr. "Blind index coding". W 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282880.
Pełny tekst źródła
8
Mareedu, Vijaya Kumar, i Prasad Krishnan. "Uniprior index coding". W 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8007093.
Pełny tekst źródła
9
Narayanan, Varun, Vinod M. Prabhakaran, Jithin Ravi, Vivek K. Mishra, Bikash K. Dey i Nikhil Karamchandani. "Private Index Coding". W 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437353.
Pełny tekst źródła
10
Liu, Yucheng, Parastoo Sadeghi, Fatemeh Arbabjolfaei i Young-Han Kim. "Simplified Composite Coding for Index Coding". W 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437663.
Pełny tekst źródłaRaporty organizacyjne na temat "Index coding with restricted information"
1
Mirel, Lisa, Cindy Zhang, Christine Cox, Ye Yeats, Félix Suad El Burai i Golden Cordell. Comparative analysis of the National Health and Nutrition Examination Survey public-use and restricted-use linked mortality files. Centers for Disease Control and Prevention (U.S.), maj 2021. http://dx.doi.org/10.15620/cdc:104744.
Pełny tekst źródłaStreszczenie:
"Objectives—Linking national survey data with administrative data sources enables researchers to conduct analyses that would not be possible with each data source alone. Recently, the Data Linkage Program at the National Center for Health Statistics (NCHS) released updated Linked Mortality Files, including the National Health and Nutrition Examination Survey data linked to the National Death Index mortality files. Two versions of the files were released: restricted-use files available through NCHS and Federal Statistical Research Data Centers and public-use files. To reduce the reidentification risk, statistical disclosure limitation methods were applied to the public-use files before they were released. This included limiting the amount of mortality information available and perturbing cause of death and follow-up time for select records. Methods—To assess the comparability of the restricted-use and public-use files, relative hazard ratios for all-cause and cause-specific mortality using Cox proportional hazards models were estimated and compared. Results—The comparative analysis found that the two data files yield similar descriptive and model results. Suggested citation: Mirel LB, Zhang C, Cox CS, Ye Y, El Burai Félix S, Golden C. Comparative analysis of the National Health and Nutrition Examination Survey public-use and restricted-use linked mortality files. National Health Statistics Reports; no 155. Hyattsville, MD: National Center for Health Statistics. 2021. DOI: https://doi.org/10.15620/cdc:104744. CS323656 nhsr155-508.pdf"