Search results

At least at extreme levels, error-laden copy produces effects on the evaluation given the message and its source, and on information imparted, but shows no effect on persuasion.

Analyses of the persuasive effects of media exposure outside the laboratory have generally produced negative results. I attribute such nonfindings in part to carelessness regarding the inferential consequences of measurement error and in part to limitations of research design. In an analysis of opinion change during the 1980 presidential campaign, adjusting for measurement error produces several strong media exposure effects, especially for network television news. Adjusting for measurement error also makes preexisting opinions look much more stable, suggesting that the new information absorbed via media exposure must be about three times as distinctive as has generally been supposed in order to account for observed patterns of opinion change.

The two American conceptual artists, Mel Bochner and Robert Barry, invite each of them to reconsider our own relationship with photographic representation and real life by means of photographs that are either 'false' or deficient. The concept of an index, which can be found as a watermark throughout the photoconceptual production, takes the concept of error into contact with the concept of error in the understanding of the works of those two artists. ; Les deux artistes conceptuels américains, Mel Bochner et Robert Barry, nous invitent chacun à leur manière à reconsidérer notre propre relation à la représentation photographique et au réel par le biais de photographies soit « mensongères », soit déficientes. La notion d'index, que l'on retrouve en filigrane à travers l'ensemble de la production photoconceptuelle, prend au contact du concept d'erreur une dimension prépondérante dans la compréhension des oeuvres de ces deux artistes.

The article explores the syndrome invariants of АГ-group of automorphisms of Reed–Solomon codes (RS-codes) that are a joint group of affine and cyclic permutations. The found real invariants are a set of norms of N Г-orbits that make up one or another АГ-orbit. The norms of Г-orbits are vectors with 2 1 Cδ− coordinates from the Galois field, that are determined by all kinds of pairs of components of the error syndromes. In this form, the invariants of the АГ-orbits were cumbersome and difficult to use. Therefore, their replacement by conditional partial invariants is proposed. These quasi-invariants are called norm-projections. Norm-projection uniquely identifies its АГ-orbit and therefore serves as an adequate way for formulating the error correction method by RS-codes based on АГ-orbits. The power of the АГ-orbits is estimated by the value of N2, equal to the square of the length of the RS-code. The search for error vectors in transmitted messages by a new method is reduced to parsing the АГ‑orbits, but actually their norm-projections, with the subsequent search for these errors within a particular АГ-orbit. Therefore, the proposed method works almost N2 times faster than traditional syndrome methods, operating on the basic of the "syndrome – error" principle, that boils down to parsing the entire set of error vectors until a specific vector is found.

This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight. ; This work was supported in part by the European Research Council under Grant 259663, in part by the European Union under the 7th Framework Programme under Grant FP7-PEOPLE-2009-IEF 252663, Grant FP7-PEOPLE-2011-CIG 303633, Grant FP7-PEOPLE-2012-CIG 333680, and Grant FP7-PEOPLE-2013-IEF 329837, and in part by the Spanish Ministry of Economy and Competitiveness under Grant CSD2008-00010, Grant TEC2009-14504-C02-01, Grant TEC2012-38800-C03-01, Grant TEC2012-38800-C03-03, and Grant RYC-2011-08150.

This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight. ; This work has been funded in part by the European Research Council (ERC) under grant agreement 259663; by the European Union under the 7th Framework Programme, grants FP7-PEOPLE-2009-IEF no. 252663, FP7-PEOPLE-2011-CIG no. 303633, FP7-PEOPLE-2012-CIG no. 333680, FP7- PEOPLE-2013-IEF no. 329837; and by the Spanish Ministry of Economy and Competitiveness under grants CSD2008-00010, TEC2009-14504-C02- 01, TEC2012-38800-C03-01, TEC2012-38800-C03-03 and RYC-2011-08150. A. Tauste Campo acknowledges funding from an EPSRC (Engineering and Physical Sciences Research Council, UK) Doctoral Prize Award.

This extended abstract reports about the implementation of the fragmentation and reassembly mechanisms of the SCHC framework for Low Power Wide Area Networks (LPWANs). The project aims to program the methods and routines described in the SCHC standard protocol for the fragmentation and reassembly mechanism while being independent of the LPWAN technology and remaining as an open-source project. The implementation addresses the ACK-on-Error mode, where an acknowledgement message is sent back to the sender device only when lost fragments are detected. Initial tests have been successful using a local communication setting with network sockets. We are currently porting the code to support the Sigfox LPWAN using Google Cloud Platform as a cloud computing service and the Python framework Flask for easy testing. ; Sergio Aguilar, Rafael Vidal and Carles Gomez were funded in part by the Spanish Government through projects TEC2016-79988-P, PID2019-106808RA-I00 (AEI/FEDER, and UE); and the Generalitat de Catalunya Grant 2017 SGR 376. ; Peer Reviewed ; Postprint (published version)

Steganography is the art of concealing security data in media, such as pictures, audio, video, text, and protocols. The objective of this paper is hiding a secret message in a colour image to prevent an attacker from accessing the message. This is important because more people use the Internet all the time and network connections are spread around the world. The hidden secret message uses two general algorithms that are embedded and extracted. This paper proposes a new algorithm to conceal a secret message in a colour image in LSB. This algorithm includes three phases: 1) dividing the colour image into a number of blocks, 2) concealing the secret message, and 3) transmitting the stego-image from the sender in a multiplexer network and receiving it through a demultiplexer network using an electronic workbench. The outcome of the new algorithm demonstrates good efficiency, high security, and robustness and is executed quickly. The system is evaluated through the measurements of mean square error, peak signal-to-noise ratio, correlation, histogram, and capacity.

The results of study of the characteristics of the proposed method [1] for correction of errors arising during information transmission via communication lines are presented. The estimates of the efficiency of search for errors and the performance of an algorithm developed to realize the proposed method using the parity values of binary matrix coordinates are obtained; among these errors are rows, columns, main and auxiliary diagonals, are obtained. We have determined the dependence of algorithm characteristics on the intensity (density) of bit errors in the message obtained after transmission via communication lines and on the size of matrices, into which a transmitted message is divided.The time spent for calculating the parity values of matrix coordinates and for the algorithm used to find transmitted information errors are given. Recommendations on an optimal choice of sizes of binary matrices are presented. It is shown that, when the bit error rate is 10–2 and less, the algorithm detects all the available errors.

"I get this error message: "This field may contain characters that are not allowed. Your summary can contain only Latin characters. Do not include emoji, arrows, hearts, stars, checkboxes, symbols, faces, or bullets. Remove these characters and click Next to continue." However, the description contains no forbidden characters. The description is in "Additional Info.""--