Log in

Relevant bibliographies by topics / Index coding with restricted information / Journal articles

Journal articles on the topic 'Index coding with restricted information'

To see the other types of publications on this topic, follow the link: Index coding with restricted information.

Author: Grafiati

Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Index coding with restricted information.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Hong, Charles, James Fallon, and Karl Friston. "fMRI Evidence for Default Mode Network Deactivation Associated with Rapid Eye Movements in Sleep." Brain Sciences 11, no. 11 (November 18, 2021): 1528. http://dx.doi.org/10.3390/brainsci11111528.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

Baker, John, Kathryn Berzins, Krysia Canvin, Sarah Kendal, Stella Branthonne-Foster, Judy Wright, Tim McDougall, Barry Goldson, Ian Kellar, and 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, no. 8 (May 2022): 1–180. http://dx.doi.org/10.3310/yvkt5692.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

3

Bar-Yossef, Ziv, Yitzhak Birk, T. S. Jayram, and Tomer Kol. "Index Coding With Side Information." IEEE Transactions on Information Theory 57, no. 3 (March 2011): 1479–94. http://dx.doi.org/10.1109/tit.2010.2103753.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Narayanan, Varun, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani, and Vinod M. Prabhakaran. "Private Index Coding." IEEE Transactions on Information Theory 68, no. 3 (March 2022): 2020–49. http://dx.doi.org/10.1109/tit.2021.3130629.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Natarajan, Lakshmi, Yi Hong, and Emanuele Viterbo. "Lattice Index Coding." IEEE Transactions on Information Theory 61, no. 12 (December 2015): 6505–25. http://dx.doi.org/10.1109/tit.2015.2491924.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lee, Namyoon, Alexandros G. Dimakis, and Robert W. Heath. "Index Coding With Coded Side-Information." IEEE Communications Letters 19, no. 3 (March 2015): 319–22. http://dx.doi.org/10.1109/lcomm.2015.2388477.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kim, Jae-Won, and Jong-Seon No. "Index Coding With Erroneous Side Information." IEEE Transactions on Information Theory 63, no. 12 (December 2017): 7687–97. http://dx.doi.org/10.1109/tit.2017.2756663.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Manoranjan Paul, and Manzur Murshed. "Efficient Pattern Index coding Using Syndrome Coding and Side Information." International Journal of Engineering and Industries 3, no. 3 (September 30, 2012): 1–12. http://dx.doi.org/10.4156/ijei.vol3.issue3.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Pedrosa, Valéria G., and Max H. M. Costa. "Index Coding with Multiple Interpretations." Entropy 24, no. 8 (August 18, 2022): 1149. http://dx.doi.org/10.3390/e24081149.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

10

Li, Min, Lawrence Ong, and Sarah J. Johnson. "Cooperative Multi-Sender Index Coding." IEEE Transactions on Information Theory 65, no. 3 (March 2019): 1725–39. http://dx.doi.org/10.1109/tit.2018.2869161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Papaioannou, Dimitrios, Deedra Nicolet, Xiaoqing Rong-Mullins, Krzysztof Mrózek, Jessica Kohlschmidt, Andrew J. Carroll, Kellie J. Archer, et al. "Prognostic and Biologic Significance of Long Non-Coding RNA (lncRNA) Profiling in Cytogenetically Abnormal Acute Myeloid Leukemia (CA-AML)." Blood 132, Supplement 1 (November 29, 2018): 2767. http://dx.doi.org/10.1182/blood-2018-99-114035.

Full text

Abstract:

Abstract Introduction: Aberrant expression levels of lncRNAs have been shown to independently associate with outcome of younger and older patients (pts) with cytogenetically normal AML. However, the prognostic and biologic significance of lncRNA expression in CA-AML pts have not been extensively studied. Methods: We performed whole transcriptome profiling (RNA-seq) in 469 pts with de novo CA-AML. Cytogenetic analyses were performed in institutional laboratories and the results were reviewed centrally. All pts were treated on frontline Cancer and Leukemia Group B (CALGB)/Alliance protocols. Results: To evaluate the prognostic significance of lncRNA expression in CA-AML, we analyzed RNA-seq data of 469 pts by applying a machine learning algorithm-based approach. As CA-AML pts constitute a heterogeneous group, we first determined which other clinical and molecular parameters were prognostic [i.e., associated with event-free survival (EFS)] in our dataset. Among the parameters tested, the European LeukemiaNet (ELN) Risk Group status and age group [i.e., younger than 60 years (y) or aged 60 y and older] significantly associated with clinical outcome of CA-AML pts. Next, we individually identified each lncRNA that associated with EFS while adjusting for ELN Risk Group and age group. We conducted random forest analyses to select the prognostic lncRNAs, whose combined expression levels could generate an effective outcome predictor for CA-AML pts. For each step of the random forest analyses, a bootstrap technique was applied; a simple random sample of pts was drawn which served as the training set and the out-of-sample pts were used as the independent validation set. We identified 55 prognostic lncRNAs and used their expression levels to separate our CA-AML cohort into a lncRNA low-risk (n=161) and a lncRNA high-risk (n=308) group. With regard to clinical characteristics, pts in the lncRNA low-risk group were younger (P<.001) and had lower platelet counts (P<.001) and higher white blood cell counts (P=.01) than pts in the lncRNA high-risk group. Concerning cytogenetic abnormalities, pts in the low-risk group more often had core-binding factor translocations or inversions (P<.001) and less often complex karyotypes (P<.001) than pts in the high-risk group. Pts in the lncRNA low-risk group had higher complete remission (CR) rates than pts in the high-risk group (91% vs 48%, P<.001). LncRNA low-risk group status also associated with longer disease-free survival (DFS; 5-y rates 49% vs 12%, P<.001), overall survival (OS; 5-y rates: 58% vs 14%, P<.001) and EFS (5-y rates: 45% vs 6%, P<.001). With regard to the accuracy of outcome prediction, the lncRNA risk classification had a C-index of 0.73, which compares favorably with other prognostic classifiers of AML pts. In multivariable analyses, lncRNA low-risk status was an independent marker for higher CR rates, as well as for longer DFS, OS and EFS (P<.001 in all comparisons), after adjusting for other covariates. Finally, we examined the prognostic value of the lncRNA risk classification within the Favorable and Intermediate ELN Groups of our dataset, for which lncRNA risk groups had adequate pt numbers. Among pts in ELN Favorable Group, lncRNA low-risk pts (n=128) had higher CR rates (P=.003) and longer DFS (P<.001), OS (P<.001) and EFS (P<.001) than lncRNA high-risk pts (n=32). Similarly, in the ELN Intermediate Group (n=85), lncRNA low-risk group status (n=28) associated with higher CR rates (P=.01), longer OS (P=.01) and EFS (P=.005) and a trend for longer DFS (P=.08). To gain biological insights, we examined the molecular pathways regulated by the 55 prognostic lncRNAs. To minimize the confounding effects of differences in the concurrent cytogenetic abnormalities, we restricted these analyses to the ELN Favorable Group. We identified approximately 900 transcripts that were differentially expressed between lncRNA low- and high-risk pts. DAVID pathway analyses showed enrichment of genes involved in the processes of phosphorylation, acetylation and RNA-binding. Ingenuity pathway analyses of up-stream regulators identified aberrant activity of homeobox genes such as MEIS1, HOXA9 and HOXA10 in the lncRNA low-risk group and other transcription factors such as MYC, FOSB and JUN in the high-risk group. Conclusion: We conclude that lncRNA profiling provides meaningful prognostic and biologic information in CA-AML pts. Disclosures Kolitz: Magellan Health: Consultancy, Honoraria. Powell:Rafael Pharmaceuticals: Membership on an entity's Board of Directors or advisory committees. Stone:Cornerstone: Consultancy; Astellas: Consultancy; Orsenix: Consultancy; Merck: Consultancy; Celgene: Consultancy, Other: Data and Safety Monitoring Board, Steering Committee; Novartis: Consultancy, Research Funding; Arog: Consultancy, Research Funding; Fujifilm: Consultancy; Ono: Consultancy; Jazz: Consultancy; Sumitomo: Consultancy; Pfizer: Consultancy; Otsuka: Consultancy; Argenx: Other: Data and Safety Monitoring Board; Amgen: Consultancy; AbbVie: Consultancy; Agios: Consultancy, Research Funding. Uy:Curis: Consultancy; GlycoMimetics: Consultancy. Wang:Amgen: Consultancy; Amgen: Consultancy; Pfizer: Consultancy, Membership on an entity's Board of Directors or advisory committees; Novartis: Speakers Bureau; Abbvie: Consultancy, Membership on an entity's Board of Directors or advisory committees; Novartis: Speakers Bureau; Abbvie: Consultancy, Membership on an entity's Board of Directors or advisory committees; Jazz: Speakers Bureau; Pfizer: Consultancy, Membership on an entity's Board of Directors or advisory committees; Jazz: Speakers Bureau. Stock:Jazz Pharmaceuticals: Consultancy.

APA, Harvard, Vancouver, ISO, and other styles

12

Dau, Son Hoang, Vitaly Skachek, and Yeow Meng Chee. "Error Correction for Index Coding With Side Information." IEEE Transactions on Information Theory 59, no. 3 (March 2013): 1517–31. http://dx.doi.org/10.1109/tit.2012.2227674.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Jafar, Syed Ali. "Topological Interference Management Through Index Coding." IEEE Transactions on Information Theory 60, no. 1 (January 2014): 529–68. http://dx.doi.org/10.1109/tit.2013.2285151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Maleki, Hamed, Viveck R. Cadambe, and Syed A. Jafar. "Index Coding—An Interference Alignment Perspective." IEEE Transactions on Information Theory 60, no. 9 (September 2014): 5402–32. http://dx.doi.org/10.1109/tit.2014.2338865.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Liu, Yucheng, Parastoo Sadeghi, Fatemeh Arbabjolfaei, and Young-Han Kim. "Capacity Theorems for Distributed Index Coding." IEEE Transactions on Information Theory 66, no. 8 (August 2020): 4653–80. http://dx.doi.org/10.1109/tit.2020.2977916.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Baker, John, Kathryn Berzins, Krysia Canvin, Iris Benson, Ian Kellar, Judy Wright, Rocio Rodriguez Lopez, Joy Duxbury, Tim Kendall, and Duncan Stewart. "Non-pharmacological interventions to reduce restrictive practices in adult mental health inpatient settings: the COMPARE systematic mapping review." Health Services and Delivery Research 9, no. 5 (February 2021): 1–184. http://dx.doi.org/10.3310/hsdr09050.

Full text

Abstract:

ObjectivesThe study aimed to provide a mapping review of non-pharmacological interventions to reduce restrictive practices in adult mental health inpatient settings; classify intervention components using the behaviour change technique taxonomy; explore evidence of behaviour change techniques and interventions; and identify the behaviour change techniques that show most effectiveness and those that require further testing.BackgroundIncidents involving violence and aggression occur frequently in adult mental health inpatient settings. They often result in restrictive practices such as restraint and seclusion. These practices carry significant risks, including physical and psychological harm to service users and staff, and costs to the NHS. A number of interventions aim to reduce the use of restrictive practices by using behaviour change techniques to modify practice. Some interventions have been evaluated, but effectiveness research is hampered by limited attention to the specific components. The behaviour change technique taxonomy provides a common language with which to specify intervention content.DesignSystematic mapping study and analysis.Data sourcesEnglish-language health and social care research databases, and grey literature, including social media. The databases searched included British Nursing Index (BNI), Cumulative Index to Nursing and Allied Health Literature (CINAHL), Cochrane Central Register of Controlled Trials (CCRCT), Cochrane Database of Systematic Reviews (CDSR), Database of Abstracts of Reviews of Effects (DARE), EMBASE, Health Technology Assessment (HTA) Database, HTA Canadian and International, Ovid MEDLINE®, NHS Economic Evaluation Database (NHS EED), PsycInfo®and PubMed. Databases were searched from 1999 to 2019.Review methodsBroad literature search; identification, description and classification of interventions using the behaviour change technique taxonomy; and quality appraisal of reports. Records of interventions to reduce any form of restrictive practice used with adults in mental health services were retrieved and subject to scrutiny of content, to identify interventions; quality appraisal, using the Mixed Methods Appraisal Tool; and data extraction, regarding whether participants were staff or service users, number of participants, study setting, intervention type, procedures and fidelity. The resulting data set for extraction was guided by the Workgroup for Intervention Development and Evaluation Research, Cochrane and theory coding scheme recommendations. The behaviour change technique taxonomy was applied systematically to each identified intervention. Intervention data were examined for overarching patterns, range and frequency. Overall percentages of behaviour change techniques by behaviour change technique cluster were reported. Procedures used within interventions, for example staff training, were described using the behaviour change technique taxonomy.ResultsThe final data set comprised 221 records reporting 150 interventions, 109 of which had been evaluated. The most common evaluation approach was a non-randomised design. There were six randomised controlled trials. Behaviour change techniques from 14 out of a possible 16 clusters were detected. Behaviour change techniques found in the interventions were most likely to be those that demonstrated statistically significant effects. The most common intervention target was seclusion and restraint reduction. The most common strategy was staff training. Over two-thirds of the behaviour change techniques mapped onto four clusters, that is ‘goals and planning’, ‘antecedents’, ‘shaping knowledge’ and ‘feedback and monitoring’. The number of behaviour change techniques identified per intervention ranged from 1 to 33 (mean 8 techniques).LimitationsMany interventions were poorly described and might have contained additional behaviour change techniques that were not detected. The finding that the evidence was weak restricted the study’s scope for examining behaviour change technique effectiveness. The literature search was restricted to English-language records.ConclusionsStudies on interventions to reduce restrictive practices appear to be diverse and poor. Interventions tend to contain multiple procedures delivered in multiple ways.Future workPrior to future commissioning decisions, further research to enhance the evidence base could help address the urgent need for effective strategies. Testing individual procedures, for example, audit and feedback, could ascertain which are the most effective intervention components. Separate testing of individual components could improve understanding of content and delivery.Study registrationThe study is registered as PROSPERO CRD42018086985.FundingThis project was funded by the National Institute for Health Research (NIHR) Health Services and Delivery Research programme and will be published in full inHealth Services and Delivery Research; Vol. 9, No. 5. See the NIHR Journals Library website for further project information.

APA, Harvard, Vancouver, ISO, and other styles

17

Xin, Huang, Zhen Yu Chen, Hui Liu, and Bo Li. "Study on Secure Coding Based Information Encryption." Applied Mechanics and Materials 443 (October 2013): 551–55. http://dx.doi.org/10.4028/www.scientific.net/amm.443.551.

Full text

Abstract:

Security is one of the major concerns in network coding. Although intrinsic confidential security is provided because different flows of information are mixed, network coding is still vulnerable to modification attack and wiretapping attack if the wire tapper knows the transmission mechanism. In this paper, a kind of encryption scheme is proposed to secure the network. This scheme has such advantages as the number of encryption is small and the wire tappers are not restricted to only part of the transmission links, but all the links are admissible. In general, the number of encryption is only 1/n of traditional encryption, in which n is the degree of one dimension of source message. Whats more, the integrity of network is also checked in every intermediate node which could make the scheme more efficient compared to the sinks detection only.

APA, Harvard, Vancouver, ISO, and other styles

18

Byrne, Eimear, and Marco Calderini. "Error Correction for Index Coding With Coded Side Information." IEEE Transactions on Information Theory 63, no. 6 (June 2017): 3712–28. http://dx.doi.org/10.1109/tit.2017.2687933.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Dau, Son Hoang, Vitaly Skachek, and Yeow Meng Chee. "On the Security of Index Coding With Side Information." IEEE Transactions on Information Theory 58, no. 6 (June 2012): 3975–88. http://dx.doi.org/10.1109/tit.2012.2188777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Haviv, Ishay. "Task-Based Solutions to Embedded Index Coding." IEEE Transactions on Information Theory 66, no. 10 (October 2020): 6144–49. http://dx.doi.org/10.1109/tit.2020.2990822.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Song, Linqi, Christina Fragouli, and Tianchu Zhao. "A Pliable Index Coding Approach to Data Shuffling." IEEE Transactions on Information Theory 66, no. 3 (March 2020): 1333–53. http://dx.doi.org/10.1109/tit.2019.2954338.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Karmoose, Mohammed, Linqi Song, Martina Cardone, and Christina Fragouli. "Privacy in Index Coding: $k$ -Limited-Access Schemes." IEEE Transactions on Information Theory 66, no. 5 (May 2020): 2625–41. http://dx.doi.org/10.1109/tit.2019.2957577.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Arbabjolfaei, Fatemeh, and Young-Han Kim. "Generalized Lexicographic Products and the Index Coding Capacity." IEEE Transactions on Information Theory 66, no. 3 (March 2020): 1520–29. http://dx.doi.org/10.1109/tit.2019.2961919.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Thomas, Anoop, and Balaji Sundar Rajan. "Generalized Index Coding Problem and Discrete Polymatroids." Entropy 22, no. 6 (June 10, 2020): 646. http://dx.doi.org/10.3390/e22060646.

Full text

Abstract:

The connections between index coding and matroid theory have been well studied in the recent past. Index coding solutions were first connected to multi linear representation of matroids. For vector linear index codes, discrete polymatroids, which can be viewed as a generalization of the matroids, were used. The index coding problem has been generalized recently to accommodate receivers that demand functions of messages and possess functions of messages. In this work we explore the connections between generalized index coding and discrete polymatroids. The conditions that need to be satisfied by a representable discrete polymatroid for a generalized index coding problem to have a vector linear solution is established. From a discrete polymatroid, an index coding problem with coded side information is constructed and it is shown that if the index coding problem has a certain optimal length solution then the discrete polymatroid is representable. If the generalized index coding problem is constructed from a matroid, it is shown that the index coding problem has a binary scalar linear solution of optimal length if and only if the matroid is binary representable.

APA, Harvard, Vancouver, ISO, and other styles

25

Thapa, Chandra, Lawrence Ong, Sarah Johnson, and Min Li. "Structural Characteristics of Two-Sender Index Coding." Entropy 21, no. 6 (June 21, 2019): 615. http://dx.doi.org/10.3390/e21060615.

Full text

Abstract:

This paper studies index coding with two senders. In this setup, source messages are distributed among the senders possibly with common messages. In addition, there are multiple receivers, with each receiver having some messages a priori, known as side-information, and requesting one unique message such that each message is requested by only one receiver. Index coding in this setup is called two-sender unicast index coding (TSUIC). The main goal is to find the shortest aggregate normalized codelength, which is expressed as the optimal broadcast rate. In this work, firstly, for a given TSUIC problem, we form three independent sub-problems each consisting of the only subset of the messages, based on whether the messages are available only in one of the senders or in both senders. Then, we express the optimal broadcast rate of the TSUIC problem as a function of the optimal broadcast rates of those independent sub-problems. In this way, we discover the structural characteristics of TSUIC. For the proofs of our results, we utilize confusion graphs and coding techniques used in single-sender index coding. To adapt the confusion graph technique in TSUIC, we introduce a new graph-coloring approach that is different from the normal graph coloring, which we call two-sender graph coloring, and propose a way of grouping the vertices to analyze the number of colors used. We further determine a class of TSUIC instances where a certain type of side-information can be removed without affecting their optimal broadcast rates. Finally, we generalize the results of a class of TSUIC problems to multiple senders.

APA, Harvard, Vancouver, ISO, and other styles

26

Liu, Tang, and Daniela Tuninetti. "Tight Information Theoretic Converse Results for Some Pliable Index Coding Problems." IEEE Transactions on Information Theory 66, no. 5 (May 2020): 2642–57. http://dx.doi.org/10.1109/tit.2019.2947669.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Chen, Wen-Jan, and Wen-Tsung Huang. "VQ indexes compression and information hiding using hybrid lossless index coding." Digital Signal Processing 19, no. 3 (May 2009): 433–43. http://dx.doi.org/10.1016/j.dsp.2008.11.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Wan, Kai, Daniela Tuninetti, and Pablo Piantanida. "An Index Coding Approach to Caching With Uncoded Cache Placement." IEEE Transactions on Information Theory 66, no. 3 (March 2020): 1318–32. http://dx.doi.org/10.1109/tit.2020.2967753.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Ikeda, Takuro, and Okihide Hikosaka. "Positive and Negative Modulation of Motor Response in Primate Superior Colliculus by Reward Expectation." Journal of Neurophysiology 98, no. 6 (December 2007): 3163–70. http://dx.doi.org/10.1152/jn.00975.2007.

Full text

Abstract:

Expectation of reward is crucial for goal-directed behavior of animals. However, little is known about how reward information is used in the brain at the time of action. We investigated this question by recording from single neurons in the macaque superior colliculus (SC) while the animal was performing a memory-guided saccade task with an asymmetrical reward schedule. The SC is an ideal structure to ask this question because it receives inputs from many brain areas including the prefrontal cortex and the basal ganglia where reward information is thought to be encoded and sends motor commands to the brain stem saccade generators. We found two groups of SC neurons that encoded reward information in the presaccadic period: positive reward-coding neurons that showed higher activity when reward was expected and negative reward-coding neurons that showed higher activity when reward was not expected. The positive reward-coding usually started even before a cue for target position was presented, whereas the negative reward-coding was largely restricted to the presaccadic period. The two kinds of reward-coding may be useful for the animal to select an appropriate behavior in a complex environment.

APA, Harvard, Vancouver, ISO, and other styles

30

Zhu, Yongjia, Yuyao He, Ye Fan, and Rugui Yao. "Protection scheme of subcarrier index in OFDM with index modulation aided by LDPC coding." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 39, no. 4 (August 2021): 818–23. http://dx.doi.org/10.1051/jnwpu/20213940818.

Full text

Abstract:

The receiver of OFDM with Index Modulation (OFDM-IM) usually adopts a Log Likelihood Ratio (LLR) detection algorithm based on the activation state of subcarriers. However, the LLR detection algorithm will cause detection errors in subcarrier activation pattern (SAP) or get illegal SAP. Consequently, further errors occur in demodulation, increasing the bit error rate (BER). To solve this problem, we propose the protection scheme of subcarrier index aided by LDPC coding, which reduces the SAP detection errors by encoding the index information bits. On the receiver, the LDPC Coding Aided (LA) detection algorithm is designed, and the formula of LLR of index information bits is derived in detail. Monte Carlo simulation is carried out over multi-path fading channel by MATLAB software. The results show that under the condition that the spectrum efficiency is not lower than the classical OFDM-IM scheme, the proposed protection scheme can obtain a gain of about 5~9 dB when the BER is 10-4, effectively improving the BER performance of OFDM-IM scheme.

APA, Harvard, Vancouver, ISO, and other styles

31

Asadi, Behzad, Lawrence Ong, and Sarah J. Johnson. "On Index Coding in Noisy Broadcast Channels with Receiver Message Side Information." IEEE Communications Letters 18, no. 4 (April 2014): 640–43. http://dx.doi.org/10.1109/lcomm.2014.020414.132589.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Tong, Xiaochong, Chengqi Cheng, Rong Wang, Lu Ding, Yong Zhang, Guangling Lai, Lin Wang, and Bo Chen. "An efficient integer coding index algorithm for multi-scale time information management." Data & Knowledge Engineering 119 (January 2019): 123–38. http://dx.doi.org/10.1016/j.datak.2019.01.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Choi, Sang Won. "Index Coded Automatic Repeat Request (ARQ)." Entropy 22, no. 8 (August 7, 2020): 869. http://dx.doi.org/10.3390/e22080869.

Full text

Abstract:

In this paper, an index-coded Automatic Repeat Request (ARQ) is studied in the perspectives of transmission efficiency and memory overhead. Motivated by reducing significant computational complexity from huge matrix inverse computation of random linear network coding, a near-to-optimal broadcasting scheme, called index-coded Automatic Repeat Request (ARQ) is proposed. The main idea is to consider the principal packet error pattern across all receivers. With the help of coded side information formed by successfully decoded packets associated with the dominant packet error pattern, it is shown that two contradictory performance metrics such as transmission efficiency and transmit (receive) cache memory size for index coding (decoding) can be enhanced with a reasonable trade-off. Specifically, the transmission efficiency of the proposed scheme is proved to be asymptotically optimal, and memory overhead is shown to be asymptotically close to the conventional ARQ scheme. Numerical results also validate the proposed scheme in the sense of memory overhead and transmission efficiency in comparison with the conventional ARQ scheme and the optimal scheme using random linear network coding.

APA, Harvard, Vancouver, ISO, and other styles

34

Proctor, Robert W., and Kim-Phuong L. Vu. "TEC: Integrated view of perception and action or framework for response selection?" Behavioral and Brain Sciences 24, no. 5 (October 2001): 899–900. http://dx.doi.org/10.1017/s0140525x01420103.

Full text

Abstract:

The Theory of Event Coding (TEC) presented in Hommel et al.'s target article provides a useful heuristic framework for stimulating research. Although the authors present TEC as providing a more integrated view of perception and action than classical information processing, TEC is restricted to the stage often called response selection and shares many features with existing theories.

APA, Harvard, Vancouver, ISO, and other styles

35

Zheng, Wei, Long Ye, Jing Ling Wang, and Qin Zhang. "A Research of Intra Prediction Coding with Variance of Prediction Mode Number." Applied Mechanics and Materials 719-720 (January 2015): 1177–83. http://dx.doi.org/10.4028/www.scientific.net/amm.719-720.1177.

Full text

Abstract:

Intra prediction is a key step in H.264/AVC to improve the coding performance with the idea that removing the directional redundancy among neighboring blocks. In order to cover more directional information existed in the image frames, there are usually many prediction modes can be selected in the state-of-the-art coding frameworks, but more bits are also needed to encode the prediction mode index information, then how to achieve the maximum overall bit-rate reduction became a problem. In this paper, 16 kinds of prediction modes are adopted by considering the direction information for 8x8 image blocks. Through calculating the bit-rate both for the mode index and residual image under different number of prediction modes, we obtain the most suitable prediction mode number relatively from the graphs. Experimental results show that, with the increase of prediction mode number, the residual information decreases obviously, and the sum of residual information and prediction mode index information also decreases but levels off after reaching a certain mode number, even has an obviously rising trend.

APA, Harvard, Vancouver, ISO, and other styles

36

Huang, Wentao, and Kechen Zhang. "Approximations of Shannon Mutual Information for Discrete Variables with Applications to Neural Population Coding." Entropy 21, no. 3 (March 4, 2019): 243. http://dx.doi.org/10.3390/e21030243.

Full text

Abstract:

Although Shannon mutual information has been widely used, its effective calculation is often difficult for many practical problems, including those in neural population coding. Asymptotic formulas based on Fisher information sometimes provide accurate approximations to the mutual information but this approach is restricted to continuous variables because the calculation of Fisher information requires derivatives with respect to the encoded variables. In this paper, we consider information-theoretic bounds and approximations of the mutual information based on Kullback-Leibler divergence and Rényi divergence. We propose several information metrics to approximate Shannon mutual information in the context of neural population coding. While our asymptotic formulas all work for discrete variables, one of them has consistent performance and high accuracy regardless of whether the encoded variables are discrete or continuous. We performed numerical simulations and confirmed that our approximation formulas were highly accurate for approximating the mutual information between the stimuli and the responses of a large neural population. These approximation formulas may potentially bring convenience to the applications of information theory to many practical and theoretical problems.

APA, Harvard, Vancouver, ISO, and other styles

37

Committeri, Giorgia, Gaspare Galati, Anne-Lise Paradis, Luigi Pizzamiglio, Alain Berthoz, and Denis LeBihan. "Reference Frames for Spatial Cognition: Different Brain Areas are Involved in Viewer-, Object-, and Landmark-Centered Judgments About Object Location." Journal of Cognitive Neuroscience 16, no. 9 (November 2004): 1517–35. http://dx.doi.org/10.1162/0898929042568550.

Full text

Abstract:

Functional magnetic resonance imaging was used to compare the neural correlates of three different types of spatial coding, which are implicated in crucial cognitive functions of our everyday life, such as visuomotor coordination and orientation in topographical space. By manipulating the requested spatial reference during a task of relative distance estimation, we directly compared viewer-centered, object-centered, and landmark-centered spatial coding of the same realistic 3-D information. Common activation was found in bilateral parietal, occipital, and right frontal premotor regions. The retrosplenial and ventromedial occipital–temporal cortex (and parts of the parietal and occipital cortex) were significantly more activated during the landmark-centered condition. The ventrolateral occipital–temporal cortex was particularly involved in object-centered coding. Results strongly demonstrate that viewer-centered (egocentric) coding is restricted to the dorsal stream and connected frontal regions, whereas a coding centered on external references requires both dorsal and ventral regions, depending on the reference being a movable object or a landmark.

APA, Harvard, Vancouver, ISO, and other styles

38

Vinken, Pia M., Daniela Kröger, Ursula Fehse, Gerd Schmitz, Heike Brock, and Alfred O. Effenberg. "Auditory Coding of Human Movement Kinematics." Multisensory Research 26, no. 6 (2013): 533–52. http://dx.doi.org/10.1163/22134808-00002435.

Full text

Abstract:

Although visual perception is dominant on motor perception, control and learning, auditory information can enhance and modulate perceptual as well as motor processes in a multifaceted manner. During last decades new methods of auditory augmentation had been developed with movement sonification as one of the most recent approaches expanding auditory movement information also to usually mute phases of movement. Despite general evidence on the effectiveness of movement sonification in different fields of applied research there is nearly no empirical proof on how sonification of gross motor human movement should be configured to achieve information rich sound sequences. Such lack of empirical proof is given for (a) the selection of suitable movement features as well as for (b) effective kinetic–acoustical mapping patterns and for (c) the number of regarded dimensions of sonification. In this study we explore the informational content of artificial acoustical kinematics in terms of a kinematic movement sonification using an intermodal discrimination paradigm. In a repeated measure design we analysed discrimination rates of six everyday upper limb actions to evaluate the effectiveness of seven different kinds of kinematic–acoustical mappings as well as short term learning effects. The kinematics of the upper limb actions were calculated based on inertial motion sensor data and transformed into seven different sonifications. Sound sequences were randomly presented to participants and discrimination rates as well as confidence of choice were analysed. Data indicate an instantaneous comprehensibility of the artificial movement acoustics as well as short term learning effects. No differences between different dimensional encodings became evident thus indicating a high efficiency for intermodal pattern discrimination for the acoustically coded velocity distribution of the actions. Taken together movement information related to continuous kinematic parameters can be transformed into the auditory domain. Additionally, pattern based action discrimination is obviously not restricted to the visual modality. Artificial acoustical kinematics might be used to supplement and/or substitute visual motion perception in sports and motor rehabilitation.

APA, Harvard, Vancouver, ISO, and other styles

39

Mazumdar, Arya, Andrew Mcgregor, and Sofya Vorotnikova. "Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate." IEEE Transactions on Information Theory 65, no. 9 (September 2019): 5580–91. http://dx.doi.org/10.1109/tit.2019.2910026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Fresia, Maria, and Giuseppe Caire. "A Linear Encoding Approach to Index Assignment in Lossy Source-Channel Coding." IEEE Transactions on Information Theory 56, no. 3 (March 2010): 1322–44. http://dx.doi.org/10.1109/tit.2009.2039082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Han, Siyu, Yanchun Liang, Ying Li, and Wei Du. "Lncident: A Tool for Rapid Identification of Long Noncoding RNAs Utilizing Sequence Intrinsic Composition and Open Reading Frame Information." International Journal of Genomics 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/9185496.

Full text

Abstract:

More and more studies have demonstrated that long noncoding RNAs (lncRNAs) play critical roles in diversity of biological process and are also associated with various types of disease. How to rapidly identify lncRNAs and messenger RNA is the fundamental step to uncover the function of lncRNAs identification. Here, we present a novel method for rapid identification of lncRNAs utilizing sequence intrinsic composition features and open reading frame information based on support vector machine model, named as Lncident (LncRNAs identification). The 10-fold cross-validation and ROC curve are used to evaluate the performance of Lncident. The main advantage of Lncident is high speed without the loss of accuracy. Compared with the exiting popular tools, Lncident outperforms Coding-Potential Calculator, Coding-Potential Assessment Tool, Coding-Noncoding Index, and PLEK. Lncident is also much faster than Coding-Potential Calculator and Coding-Noncoding Index. Lncident presents an outstanding performance on microorganism, which offers a great application prospect to the analysis of microorganism. In addition, Lncident can be trained by users’ own collected data. Furthermore, R package and web server are simultaneously developed in order to maximize the convenience for the users. The R package “Lncident” can be easily installed on multiple operating system platforms, as long as R is supported.

APA, Harvard, Vancouver, ISO, and other styles

42

Granero-Belinchón, Carlos, Stéphane G. Roux, and Nicolas B. Garnier. "Quantifying Non-Stationarity with Information Theory." Entropy 23, no. 12 (November 30, 2021): 1609. http://dx.doi.org/10.3390/e23121609.

Full text

Abstract:

We introduce an index based on information theory to quantify the stationarity of a stochastic process. The index compares on the one hand the information contained in the increment at the time scale τ of the process at time t with, on the other hand, the extra information in the variable at time t that is not present at time t−τ. By varying the scale τ, the index can explore a full range of scales. We thus obtain a multi-scale quantity that is not restricted to the first two moments of the density distribution, nor to the covariance, but that probes the complete dependences in the process. This index indeed provides a measure of the regularity of the process at a given scale. Not only is this index able to indicate whether a realization of the process is stationary, but its evolution across scales also indicates how rough and non-stationary it is. We show how the index behaves for various synthetic processes proposed to model fluid turbulence, as well as on experimental fluid turbulence measurements.

APA, Harvard, Vancouver, ISO, and other styles

43

BACKES, MICHAEL, and BORIS KÖPF. "Quantifying information flow in cryptographic systems." Mathematical Structures in Computer Science 25, no. 2 (November 10, 2014): 457–79. http://dx.doi.org/10.1017/s0960129513000662.

Full text

Abstract:

We provide a novel definition of quantitative information flow, called transmissible information, that is suitable for reasoning about informational-theoretically secure (or non-cryptographic) systems, as well as about cryptographic systems with their polynomially bounded adversaries, error probabilities, etc. Transmissible information captures deliberate communication between two processes, and it safely over-approximates the quantity of information that a process unintentionally leaks to another process.We show that transmissible information is preserved under universal composability, which constitutes the prevalent cryptographic notion of a secure implementation. This result enables us to lift quantitative bounds of transmissible information from simple ideal functionalities of cryptographic tasks to actual cryptographic systems.We furthermore prove a connection between transmissible information in the unconditional setting and channel capacity, based on the weak converse of Shannon's coding theorem. This connection enables us to compute an upper bound on the transmissible information for a restricted class of protocols, using existing techniques from quantitative information flow.

APA, Harvard, Vancouver, ISO, and other styles

44

Mahmood, Rehan, Zulin Wang, and Qin Huang. "Efficient Quantization with Linear Index Coding for Deep-Space Images." Wireless Communications and Mobile Computing 2018 (October 11, 2018): 1–13. http://dx.doi.org/10.1155/2018/6387214.

Full text

Abstract:

Due to inevitable propagation delay involved in deep-space communication systems, very high cost is associated with the retransmission of erroneous segments. Quantization with linear index coding (QLIC) scheme is known to provide compression along with robust transmission of deep-space images, and thus the likelihood of retransmissions is significantly reduced. This paper aims to improve its spectral efficiency as well as robustness. First, multiple quantization refinement levels per transmitted source block of QLIC are proposed to increase spectral efficiency. Then, iterative multipass decoding is introduced to jointly decode the subsource symbol-planes. It achieves better PSNR of the reconstructed image as compared to the baseline one-pass decoding approach of QLIC.

APA, Harvard, Vancouver, ISO, and other styles

45

Azahari, Abd Rahman. "KENDALA PELESTARIAN OLAHRAGA MASYARAKAT SEBAGAI MATERIAL CULTURE PADA GENERASI MUDA PERKOTAAN: A GROUNDED RESEARCH." CENDEKIA: Journal of Education and Teaching 10, no. 2 (September 3, 2016): 207. http://dx.doi.org/10.30957/cendekia.v10i2.192.

Full text

Abstract:

Abd. Rahman Azahari This study describes constraints affecting social sport as material culture received minor perception for young generation and the sport is left in modern information technology. This study used grounded research emphasizing an indepth data analysis to achieve wise phenomenon. Data were collected using participatory observation and indepth interviews. Two traditional Dayak sports in Central Kalimantan were observed: menyipet (to blow with a pipe) and balago in January to July 2015, involving sport organization heads, cultural heads, sport teachers, coaches, and athletes as informants. Data were analyzed using open coding, axial coding and selective coding from Strauss and Corbin. The study revealed: (1) internal problems include: monotonous rules of the games, no more funs, hard to train, and do not serve to earn money; (2) external problems include: lack of coordination between government offices, limited invitation games, complex government regulation and policy, restricted facilities for traditional sports.

APA, Harvard, Vancouver, ISO, and other styles

46

Ouyang, Qi, Yongbo Lv, Jihui Ma, and Jing Li. "An LSTM-Based Method Considering History and Real-Time Data for Passenger Flow Prediction." Applied Sciences 10, no. 11 (May 29, 2020): 3788. http://dx.doi.org/10.3390/app10113788.

Full text

Abstract:

With the development of big data and deep learning, bus passenger flow prediction considering real-time data becomes possible. Real-time traffic flow prediction helps to grasp real-time passenger flow dynamics, provide early warning for a sudden passenger flow and data support for real-time bus plan changes, and improve the stability of urban transportation systems. To solve the problem of passenger flow prediction considering real-time data, this paper proposes a novel passenger flow prediction network model based on long short-term memory (LSTM) networks. The model includes four parts: feature extraction based on Xgboost model, information coding based on historical data, information coding based on real-time data, and decoding based on a multi-layer neural network. In the feature extraction part, the data dimension is increased by fusing bus data and points of interest to improve the number of parameters and model accuracy. In the historical information coding part, we use the date as the index in the LSTM structure to encode historical data and provide relevant information for prediction; in the real-time data coding part, the daily half-hour time interval is used as the index to encode real-time data and provide real-time prediction information; in the decoding part, the passenger flow data for the next two 30 min interval outputs by decoding all the information. To our best knowledge, it is the first time to real-time information has been taken into consideration in passenger flow prediction based on LSTM. The proposed model can achieve better accuracy compared to the LSTM and other baseline methods.

APA, Harvard, Vancouver, ISO, and other styles

47

Rule, Michael E., Martino Sorbaro, and Matthias H. Hennig. "Optimal Encoding in Stochastic Latent-Variable Models." Entropy 22, no. 7 (June 28, 2020): 714. http://dx.doi.org/10.3390/e22070714.

Full text

Abstract:

In this work we explore encoding strategies learned by statistical models of sensory coding in noisy spiking networks. Early stages of sensory communication in neural systems can be viewed as encoding channels in the information-theoretic sense. However, neural populations face constraints not commonly considered in communications theory. Using restricted Boltzmann machines as a model of sensory encoding, we find that networks with sufficient capacity learn to balance precision and noise-robustness in order to adaptively communicate stimuli with varying information content. Mirroring variability suppression observed in sensory systems, informative stimuli are encoded with high precision, at the cost of more variable responses to frequent, hence less informative stimuli. Curiously, we also find that statistical criticality in the neural population code emerges at model sizes where the input statistics are well captured. These phenomena have well-defined thermodynamic interpretations, and we discuss their connection to prevailing theories of coding and statistical criticality in neural populations.

APA, Harvard, Vancouver, ISO, and other styles

48

Li, Kun Feng, Zi Chun Yang, and Gui Feng Liu. "Non-Probabilistic Structural Reliability Model Based on Ellipsoidal-Bound Model with Restricted Expansion." Advanced Materials Research 230-232 (May 2011): 920–24. http://dx.doi.org/10.4028/www.scientific.net/amr.230-232.920.

Full text

Abstract:

When insufficient data are available, probabilistic reliability method is invalid, but the non-probabilistic reliability method based on I-G (information-gap) model is a valid alternative. The most common I-G model, ellipsoidal-bound model, has been updated in this paper by acquiring information about span restrictions of uncertainty quantities and a corresponding non-probabilistic reliability index was proposed. The method for computing the reliability index was also given. The new model can reveal the influence of the span restriction of uncertainty quantities on structural reliability.

APA, Harvard, Vancouver, ISO, and other styles

49

Zhang, Mingchu. "Common lossless compression algorithms and their error resiliency performance." Applied and Computational Engineering 6, no. 1 (June 14, 2023): 243–56. http://dx.doi.org/10.54254/2755-2721/6/20230778.

Full text

Abstract:

With the development of communication technology and computer technology, many related industries, such as multimedia entertainment, put forward higher requirements for storing and transmitting information data. The research of data compression technology has attracted more and more attention. Therefore, the error resiliency ability of data compression algorithm is particularly important. How to enhance the error resiliency of data compression communication systems has been a hot topic for researchers. This paper mainly introduces the lossless data compression technology and its basic principle and performance index. Two typical lossless compression codes, Huffman and Arithmetic coding are deeply studied, including the principle of coding and the problem of error resiliency. Huffman coding and Arithmetic coding are two very important lossless compression codes widely used. The ability to resist channel error is an important index for data compression in communication. It is of great significance to further improve the channel adaptability of data compression to study the above two kinds of codes and their ability to resist channel error.

APA, Harvard, Vancouver, ISO, and other styles

50

Zhang, Jie, Manzhao Hao, Fei Yang, Wenyuan Liang, Aiping Sun, Chi-Hong Chou, and Ning Lan. "Evaluation of multiple perceptual qualities of transcutaneous electrical nerve stimulation for evoked tactile sensation in forearm amputees." Journal of Neural Engineering 19, no. 2 (April 1, 2022): 026041. http://dx.doi.org/10.1088/1741-2552/ac6062.

Full text

Abstract:

Abstract Objective. Evoked tactile sensation (ETS) elicited by transcutaneous electrical nerve stimulation (TENS) is promising to convey digit-specific sensory information to amputees naturally and non-invasively. Fitting ETS-based sensory feedback to amputees entails customizing coding of multiple sensory information for each stimulation site. This study was to elucidate the consistency of percepts and qualities by TENS at multiple stimulation sites in amputees retaining ETS. Approach. Five transradial amputees with ETS and fourteen able-bodied subjects participated in this study. Surface electrodes with small size (10 mm in diameter) were adopted to fit the restricted projected finger map on the forearm stump of amputees. Effects of stimulus frequency on sensory types were assessed, and the map of perceptual threshold for each sensation was characterized. Sensitivity for vibration and buzz sensations was measured using distinguishable difference in stimulus pulse width. Rapid assessments for modulation ranges of pulse width at fixed amplitude and frequency were developed for coding sensory information. Buzz sensation was demonstrated for location discrimination relating to prosthetic fingers. Main results. Vibration and buzz sensations were consistently evoked at 20 Hz and 50 Hz as dominant sensation types in all amputees and able-bodied subjects. Perceptual thresholds of different sensations followed a similar strength-duration curve relating stimulus amplitude to pulse width. The averaged distinguishable difference in pulse width was 12.84 ± 7.23 μs for vibration and 15.21 ± 6.47 μs for buzz in able-bodied subjects, and 14.91 ± 10.54 μs for vibration and 11.30 ± 3.42 μs for buzz in amputees. Buzz coding strategy enabled five amputees to discriminate contact of individual fingers with an overall accuracy of 77.85%. Significance. The consistency in perceptual qualities of dominant sensations can be exploited for coding multi-modality sensory feedback. A fast protocol of sensory coding is possible for fitting ETS-based, non-invasive sensory feedback to amputees.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!