Degree Level

INFORMATION, COMMUNICATION, AND LANGUAGE (open access)

INFORMATION, COMMUNICATION, AND LANGUAGE

A lecture delivered at Sandia Corp., Albuquerque, N. Mex., June 18, 1958. A discussion of information exchange theory is presented. Semantics in communications are examined, and the use of symbols in thinking and presentaion are discussed in some detail. (J.R.D.)
Date: July 1, 1959
Creator: Hammer, P.C.
Object Type: Report
System: The UNT Digital Library
Information and meaning revisiting Shannon's theory of communication and extending it to address today<U+2019>s technical problems. (open access)

Information and meaning revisiting Shannon's theory of communication and extending it to address today<U+2019>s technical problems.

This paper has three goals. The first is to review Shannon's theory of information and the subsequent advances leading to today's statistics-based text analysis algorithms, showing that the semantics of the text is neglected. The second goal is to propose an extension of Shannon's original model that can take into account semantics, where the 'semantics' of a message is understood in terms of the intended or actual changes on the recipient of a message. The third goal is to propose several lines of research that naturally fall out of the proposed model. Each computational approach to solving some problem rests on an underlying model or set of models that describe how key phenomena in the real world are represented and how they are manipulated. These models are both liberating and constraining. They are liberating in that they suggest a path of development for new tools and algorithms. They are constraining in that they intentionally ignore other potential paths of development. Modern statistical-based text analysis algorithms have a specific intellectual history and set of underlying models rooted in Shannon's theory of communication. For Shannon, language is treated as a stochastic generator of symbol sequences. Shannon himself, subsequently Weaver, and at least …
Date: December 1, 2009
Creator: Bauer, Travis LaDell
Object Type: Report
System: The UNT Digital Library
Note on Zeno's paradox in quantum theory (open access)

Note on Zeno's paradox in quantum theory

A decaying quantum system, if observed very frequently in order to ascertain whether or not it is still undecayed, will not decay at all. The derivation of this effect - known, e.g., as Zeno's paradox - has been criticized recently. It has been argued that measurements performed in a very short time interval, ..delta..t, produce states with a very large energy uncertanty, ..delta..E, and that Zeno's paradox disappears if this is taken into account. By construction of an explicit counterexample it is proved, however, that there is no energy-time uncertainty relation of the required kind; therefore, the criticism mentioned is unjustified.
Date: February 1, 1980
Creator: Kraus, K.
Object Type: Report
System: The UNT Digital Library
Unification of quantum theory and classical physics (open access)

Unification of quantum theory and classical physics

A program is described for unifying quantum theory and classical physics on the basis of the Copenhagen-interpretation idea of external reality and a recently discovered classical part of the electromagnetic field. The program effects an integration of the intuitions of Heisenberg, Bohr, and Einstein.
Date: July 1, 1985
Creator: Stapp, Henry P.
Object Type: Article
System: The UNT Digital Library
Dynamic Theory: a new view of space, time, and matter (open access)

Dynamic Theory: a new view of space, time, and matter

The theory presented represents a different approach toward unification of the various branches of physics. The foundation of the theory rests upon generalizations of the classical laws of thermodynamics, particularly Caratheodory's abstract statement of the second law. These adopted laws are shown to produce, as special cases, current theories such as Einstein's General and Special Relativity, Maxwell's electromagnetism, classical thermodynamics, and quantum principles. In addition to this unification, the theory provides predictions that may be experimentally investigated. Some of the predictions are a limiting rate of mass conversion, reduced pressures in electromagnetically contained plasmas, increased viscous effects in shocked materials, a finite self-energy for a charged particle, and the possible creation of particles with velocities greater than the speed of light. 8 figures.
Date: December 1, 1980
Creator: Williams, P.E.
Object Type: Report
System: The UNT Digital Library
Improving risk communication through interactive training in communication skills (open access)

Improving risk communication through interactive training in communication skills

This paper describes a workshop in communication and public speaking skills recently conducted for a group of public officials whose responsibilities include presenting risk information at public meetings associated with hazardous waste sites. We detail the development and execution of the 2 1/2 day workshop, including the development and integration of a 45-minute video of a simulated public meeting used to illustrate examples of good and bad communication behaviors. The workshop uses a mock public meeting video, participatory video exercises, role-playing, and instructor, and a resource text. This interactive approach to teaching communication skills can help sensitize scientists to the public's understanding of risk and improve scientists' confidence and effectiveness in communicating scientific information. 10 refs., 1 fig.
Date: January 1, 1990
Creator: White, D. A. & White, R. K.
Object Type: Article
System: The UNT Digital Library
A doubly logarithmic communication algorithm for the Completely Connected Optical Communication Parallel Computer (open access)

A doubly logarithmic communication algorithm for the Completely Connected Optical Communication Parallel Computer

In this paper we consider the problem of interprocessor communication on a Completely Connected Optical Communication Parallel Computer (OCPC). The particular problem we study is that of realizing an h-relation. In this problem, each processor has at most h messages to send and at most h messages to receive. It is clear that any 1-relation can be realized in one communication step on an OCPC. However, the best known p-processor OCPC algorithm for realizing an arbitrary h-relation for h > 1 requires {Theta}(h + log p) expected communication steps. (This algorithm is due to Valiant and is based on earlier work of Anderson and Miller.) Valiant`s algorithm is optimal only for h = {Omega}(log p) and it is an open question of Gereb-Graus and Tsantilas whether there is a faster algorithm for h = o(log p). In this paper we answer this question in the affirmative by presenting a {Theta} (h + log log p) communication step algorithm that realizes an arbitrary h-relation on a p-processor OCPC. We show that if h {le} log p then the failure probability can be made as small as p{sup -{alpha}} for any positive constant {alpha}.
Date: January 20, 1993
Creator: Goldberg, L. A.; Jerrum, M.; Leighton, T. & Rao, S.
Object Type: Article
System: The UNT Digital Library
Communication on the Paragon (open access)

Communication on the Paragon

In this note the authors describe the results of some tests of the message-passing performance of the Intel Paragon. These tests have been carried out under both the Intel-supplied OSF/1 operating system with an NX library, and also under an operating system called SUNMOS (Sandia UNM Operating System). For comparison with the previous generation of Intel machines, they have also included the results on the Intel Touchstone Delta. The source code used for these tests is identical for all systems. As a result of these tests, the authors can conclude that SUNMOS demonstrates that the Intel Paragon hardware is capable of very high bandwidth communication, and that the message coprocessor on Paragon nodes can be used to give quite respectable latencies. Further tuning can be expected to yield even better performance.
Date: October 15, 1993
Creator: Greenberg, D.; Maccabe, B.; McCurley, K. S.; Riesen, R. & Wheat, S.
Object Type: Report
System: The UNT Digital Library
Reducing communication inefficiencies for a flexible programming paradigm (open access)

Reducing communication inefficiencies for a flexible programming paradigm

The ACPMAPS system at Fermilab has been upgraded to 50 GF by inserting new CPU modules, based on the Intel i860. This ten-fold increase in power, utilizing the identical communications backbone, places the system in a different realm: The transfer latency and overheads are now greater, relative to the cost of a floating point operation. We explore the consequences for programs written using CANOPY, which relies on low communications latencies. We present techniques for alleviating the efficiency decrease, by coalescing transfers, without abandoning the considerable advantages of the CANOPY paradigm.
Date: November 1, 1992
Creator: Fischler, M.; Gao, M.; Hockney, G.; Isely, M. & Uchima, M.
Object Type: Article
System: The UNT Digital Library
Reducing communication inefficiencies for a flexible programming paradigm (open access)

Reducing communication inefficiencies for a flexible programming paradigm

The ACPMAPS system at Fermilab has been upgraded to 50 GF by inserting new CPU modules, based on the Intel i860. This ten-fold increase in power, utilizing the identical communications backbone, places the system in a different realm: The transfer latency and overheads are now greater, relative to the cost of a floating point operation. We explore the consequences for programs written using CANOPY, which relies on low communications latencies. We present techniques for alleviating the efficiency decrease, by coalescing transfers, without abandoning the considerable advantages of the CANOPY paradigm.
Date: November 1, 1992
Creator: Fischler, M.; Gao, M.; Hockney, G.; Isely, M. & Uchima, M.
Object Type: Article
System: The UNT Digital Library
Critical Connections: Communication for the Future (open access)

Critical Connections: Communication for the Future

The U.S. communication infrastructure is changing rapidly as a result of technological advances, deregulation, and an economic climate that is increasingly competitive. This change is affecting the way in which information is created, processed, transmitted, and provided to individuals and institutions. The report analyzes the implications of new communication technologies for business, politics, culture, and individuals, and suggests possible strategies and options for congressional consideration.
Date: February 1990
Creator: United States. Congress. Office of Technology Assessment.
Object Type: Report
System: The UNT Digital Library
Risk communication in environmental assessment (open access)

Risk communication in environmental assessment

Since the enactment of NEPA and other environmental legislation, the concept of `risk communication` has expanded from simply providing citizens with scientific information about risk to exploring ways of making risk information genuinely meaningful to the public and facilitating public involvement in the very processes whereby risk is analyzed and managed. Contemporary risk communication efforts attempt to find more effective ways of conveying increasingly complex risk information and to develop more democratic and proactive approaches to community involvement, in particular to ensuring the participation of diverse populations in risk decisions. Although considerable progress has been made in a relatively short time, risk communication researchers and practitioners currently face a number of challenges in a time of high expectations, low trust, and low budgets.
Date: August 26, 1996
Creator: Rahm-Crites, L.
Object Type: Report
System: The UNT Digital Library
Communication patterns and allocation strategies. (open access)

Communication patterns and allocation strategies.

Motivated by observations about job runtimes on the CPlant system, we use a trace-driven microsimulator to begin characterizing the performance of different classes of allocation algorithms on jobs with different communication patterns in space-shared parallel systems with mesh topology. We show that relative performance varies considerably with communication pattern. The Paging strategy using the Hilbert space-filling curve and the Best Fit heuristic performed best across several communication patterns.
Date: January 1, 2004
Creator: Leung, Vitus Joseph; Mache, Jens Wolfgang & Bunde, David P.
Object Type: Report
System: The UNT Digital Library
Communication measures to bridge ten millennia. [Contains glossary] (open access)

Communication measures to bridge ten millennia. [Contains glossary]

The Department of Energy created the Human Interference Task Force (HITF) in 1980 to investigate the problems connected with the postclosure, final marking of a filled nuclear waste repository. The task of the HITF is to devise a method of warning future generations not to mine or drill at that site unless they are aware of the consequences of their actions. Since the likelihood of human interference should be minimized for 10,000 years, an effective and long-lasting warning system must be designed. This report is a semiotic analysis of the problem, examining it in terms of the science or theory of messages and symbols. Because of the long period of time involved, the report recommends that a relay system of recoding messages be initiated; that the messages contain a mixture of iconic, indexical, and symbolic elements; and that a high degree of redundancy of messages be employed.
Date: April 1, 1984
Creator: Sebeok, T.A.
Object Type: Report
System: The UNT Digital Library
Collective communication routines in PVM (open access)

Collective communication routines in PVM

The collective communication routines of scatter, gather, and reduce are frequently implemented as part of the native library for parallel architectures. These operations have been implemented in PVM for use among a heterogeneous system of workstations and parallel computers forming a virtual parallel machine. In the case of the Intel Paragon machines, the PVM implementation of the reduce operation utilizes the corresponding native mode library routines whenever possible. This paper describes the implementation of these collective communication routines in PVM including the utilization of the Intel Paragon native mode operations. Performance data is also given comparing the use of the native Intel Paragon collective routines and the PVM implementation on top of these routines on a dedicated Intel Paragon. For our timing results an average latency of 109 {mu}s is incurred using PVM as compared to the native Intel global sum routine. This extra startup is independent of the size of the message being sent and the number of nodes in the group. It is demonstrated that the use of static groups is preferable in time efficiency over the use of dynamic groups.
Date: May 1, 1996
Creator: Donato, J. M. & Geist, G. A.
Object Type: Report
System: The UNT Digital Library
Fiber optic communication links (open access)

Fiber optic communication links

Fiber optics is a new, emerging technology which offers relief from many of the problems which limited past communications links. Its inherent noise immunity and high bandwidth open the door for new designs with greater capabilities. Being a new technology, certain problems can be encountered in specifying and installing a fiber optic link. A general fiber optic system is discussed with emphasis on the advantages and disadvantages. It is not intended to be technical in nature, but a general discussion. Finally, a general purpose prototype Sandia communications link is presented.
Date: January 1, 1980
Creator: Meyer, R. H.
Object Type: Article
System: The UNT Digital Library
Interprocessor communication with memory constraints (open access)

Interprocessor communication with memory constraints

Many parallel applications require periodic redistribution of workloads and associated data. In a distributed memory computer, this redistribution can be difficult if limited memory is available for receiving messages. The authors propose a model for optimizing the exchange of messages under such circumstances which they call the minimum phase remapping problem. They first show that the problem is NP-Complete, and then analyze several methodologies for addressing it. First, they show how the problem can be phrased as an instance of multi-commodity flow. Next, they study a continuous approximation to the problem. They show that this continuous approximation has a solution which requires at most two more phases than the optimal discrete solution, but the question of how to consistently obtain a good discrete solution from the continuous problem remains open. Finally, they devise a simple and practical approximation algorithm for the problem with a bound of 1.5 times the optimal number of phases.
Date: May 30, 2000
Creator: PINAR,ALI & HENDRICKSON,BRUCE A.
Object Type: Article
System: The UNT Digital Library
Interprocessor communication with limited memory (open access)

Interprocessor communication with limited memory

Many parallel applications require periodic redistribution of workloads and associated data. In a distributed memory computer, this redistribution can be difficult if limited memory is available for receiving messages. We propose a model for optimizing the exchange of messages under such circumstances which we call the minimum phase remapping problem. We first show that the problem is NP-Complete, and then analyze several methodologies for addressing it. First, we show how the problem can be phrased as an instance of multi-commodity flow. Next, we study a continuous approximation to the problem. We show that this continuous approximation has a solution which requires at most two more phases than the optimal discrete solution, but the question of how to consistently obtain a good discrete solution from the continuous problem remains open. We also devise simple and practical approximation algorithm for the problem with a bound of 1.5 times the optimal number of phases. We also present an empirical study of variations of our algorithms which indicate that our approaches are quite practical.
Date: May 7, 2003
Creator: Pinar, Ali & Hendrickson, Bruce
Object Type: Article
System: The UNT Digital Library
Communication: From Molecules to Mars (open access)

Communication: From Molecules to Mars

An analysis is made of the energetic, molecular, macromolecular and organizational steps which appear to be essential for the development of a living cell from a nonliving origin. Accepting the current view of the primitive atmosphere of the earth, experimental demonstration for the formation of the fundamental molecules of living organisms (amino acids, fatty acids, purines and pyrimidines) under the influence of available energy sources (ultraviolet light, ionizing radiation and electric discharge) is presented.
Date: August 1, 1962
Creator: Calvin, Melvin
Object Type: Article
System: The UNT Digital Library
Risk communication in environmental restoration programs (open access)

Risk communication in environmental restoration programs

The author advocates adoption of a convergence model in place of the traditional source-receiver model of communication for communicating with members of the public who have a stake in remediation of a nearby site. The source-receiver model conceives of communication as the transmission of a message from a risk management agency (sender) to a target audience of the public (receivers). The underlying theme is that the sender intends to change the perception of the receiver of either the issue or the sender of information. The theme may be appropriate for health campaigns which seek to change public behavior; however, the author draws on her experience at a DOE site undergoing remediation to illustrate why the convergence model is more appropriate in the context of cleanup. This alternative model focuses on the Latin derivation of communication as sharing or making common to many, i.e., as involving a relationship between participants who engage in a process of communication. The focus appears to be consistent with recently issued DOE policy that calls for involving the public in identifying issues and problems and in formulating and evaluating decision alternatives in cleanup. By emphasizing context, process and participants, as opposed to senders and receivers, the …
Date: April 1, 1993
Creator: Bradbury, J.A.
Object Type: Article
System: The UNT Digital Library
Risk communication in environmental restoration programs (open access)

Risk communication in environmental restoration programs

The author advocates adoption of a convergence model in place of the traditional source-receiver model of communication for communicating with members of the public who have a stake in remediation of a nearby site. The source-receiver model conceives of communication as the transmission of a message from a risk management agency (sender) to a target audience of the public (receivers). The underlying theme is that the sender intends to change the perception of the receiver of either the issue or the sender of information. The theme may be appropriate for health campaigns which seek to change public behavior; however, the author draws on her experience at a DOE site undergoing remediation to illustrate why the convergence model is more appropriate in the context of cleanup. This alternative model focuses on the Latin derivation of communication as sharing or making common to many, i.e., as involving a relationship between participants who engage in a process of communication. The focus appears to be consistent with recently issued DOE policy that calls for involving the public in identifying issues and problems and in formulating and evaluating decision alternatives in cleanup. By emphasizing context, process and participants, as opposed to senders and receivers, the …
Date: April 1, 1993
Creator: Bradbury, J. A.
Object Type: Article
System: The UNT Digital Library
Fingerprinting Communication and Computation on HPC Machines (open access)

Fingerprinting Communication and Computation on HPC Machines

How do we identify what is actually running on high-performance computing systems? Names of binaries, dynamic libraries loaded, or other elements in a submission to a batch queue can give clues, but binary names can be changed, and libraries provide limited insight and resolution on the code being run. In this paper, we present a method for&quot;fingerprinting&quot; code running on HPC machines using elements of communication and computation. We then discuss how that fingerprint can be used to determine if the code is consistent with certain other types of codes, what a user usually runs, or what the user requested an allocation to do. In some cases, our techniques enable us to fingerprint HPC codes using runtime MPI data with a high degree of accuracy.
Date: June 2, 2010
Creator: Peisert, Sean
Object Type: Report
System: The UNT Digital Library
Time reversal signal processing for communication. (open access)

Time reversal signal processing for communication.

Time-reversal is a wave focusing technique that makes use of the reciprocity of wireless propagation channels. It works particularly well in a cluttered environment with associated multipath reflection. This technique uses the multipath in the environment to increase focusing ability. Time-reversal can also be used to null signals, either to reduce unintentional interference or to prevent eavesdropping. It does not require controlled geometric placement of the transmit antennas. Unlike existing techniques it can work without line-of-sight. We have explored the performance of time-reversal focusing in a variety of simulated environments. We have also developed new algorithms to simultaneously focus at a location while nulling at an eavesdropper location. We have experimentally verified these techniques in a realistic cluttered environment.
Date: September 1, 2011
Creator: Young, Derek P.; Jacklin, Neil; Punnoose, Ratish J. & Counsil, David T.
Object Type: Report
System: The UNT Digital Library
Independent communication messages: methodology and applications (open access)

Independent communication messages: methodology and applications

Information flowing on communication buses is ordinarily ``non-random`` in the sense that data entities are not equally likely and independent. This is because they have relationships to each other and to physical occurrences to which they may be responding. Random data would convey no information or meaning. From a different viewpoint, there can be applications for creating randomness characteristics, and four of these are described in this paper. Two examples derive from cryptology and the other two from safety. One cryptology application described is the generation of random numbers for use as, for example, keys, hash functions, nonces, and seeds. The other is for inter-message ``padding`` to resist traffic analysis by masking when data are being transmitted and when the channel is conveying no information. One of the safety applications described is the ``unique signal`` approach used in modern nuclear weapon electrical safety. The other is the use of unique signals as non-weapon critical-operation control functions. Both of these safety applications require provisions to help assure randomness characteristics in any inadvertently occurring inputs. In order to satisfy these cryptology and safety needs, communication strategies are described that generate or selectively encourage independent (unrelated) symbols or messages.
Date: September 1, 1997
Creator: Cooper, J.A.
Object Type: Article
System: The UNT Digital Library