Results 241 to 250 of about 710,179 (294)
Statement on the targeted review of certain existing maximum residue levels of concern for lambda-cyhalothrin. [PDF]
EFSA JEuropean Food Safety Authority (EFSA).
europepmc +1 more source
Blockchain consensus mechanism and method for peer-to-peer electricity trading. [PDF]
Sci RepWang N, Chen Y, Zhai F, Li B.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Efficient secret broadcast in the broadcasting networks
IEEE Communications Letters, 2009One of the basic problems in the broadcasting networks is a secret broadcast problem. The problem is how to securely send a message to the receivers while guaranteeing consistency. Consistency means that each receiver can assure that all of the receivers have received the same message.
Ik Rae Jeong +2 more
openaire +1 more source
Proceedings of the 8th international conference on Intelligent user interfaces - IUI '03, 2003
The work presented in this paper takes a novel approach to the task of providing information to viewers of broadcast news. Instead of considering the broadcast news as the end product, this work uses it as a starting point to dynamically build an information space for the user to explore.
Kevin Livingston +3 more
openaire +1 more source
The work presented in this paper takes a novel approach to the task of providing information to viewers of broadcast news. Instead of considering the broadcast news as the end product, this work uses it as a starting point to dynamically build an information space for the user to explore.
Kevin Livingston +3 more
openaire +1 more source
2008 42nd Asilomar Conference on Signals, Systems and Computers, 2008
We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the degraded multi-receiver wiretap channel where the legitimate receivers exhibit a degradedness order while the ...
Ersen Ekrem, Sennur Ulukus
openaire +1 more source
We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the degraded multi-receiver wiretap channel where the legitimate receivers exhibit a degradedness order while the ...
Ersen Ekrem, Sennur Ulukus
openaire +1 more source
Broadcasting Dignity and Broadcasting Language
HAN-GEUL, 2017이 글의 목적은 방송의 품위와 방송언어의 관계를 규명하는 데 있다. 방송의 품위는 공공성(진실 가치)과 건전성(도덕적 가치)으로 구성된다. 방송의 품위 기준에 따라서 방송언어의 실용적 평가 요소로 여섯 가지 - 공정성, 정확성, 언어 예절, 인권 존중, 선정성, 폭력성-가 제시될 수 있다. 공정성은 방송언어가 공정하고 객관적인가? 정확성은 어문 규정에 맞게 사용되었는가? 언어 예절은 언어 규범에 맞게 사용되었는가? 인권 존중은 차별적인 표현이나 비하 표현을 사용하였는가? 선정성은 성적 표현이 사용되었는가? 폭력성은 폭력적인 언어가 사용되었는가? 방송언어의 실용적 평가 요소를 바탕으로 방송언어의 분석 항목을 설정할 수 있다. 이
openaire +1 more source
1993
[Pra91, Pra92] develop CBS, a CCS-like calculus [Mil89] where processes communicate by broadcasting values along a single channel. These values are hidden or restricted by translation to noise. This paper types CBS and restricts it to processes with a unique response to each input.
openaire +1 more source
[Pra91, Pra92] develop CBS, a CCS-like calculus [Mil89] where processes communicate by broadcasting values along a single channel. These values are hidden or restricted by translation to noise. This paper types CBS and restricts it to processes with a unique response to each input.
openaire +1 more source
Data Broadcasting Solutions for Broadcasters
142nd Technical Conference and Exhibition, 2000With the advent of digital television in the U.S. and worldwide, broadcasters are searching for new opportunities to enhance programming. In addition, many in the industry believe that potential new sources of revenue can be unlocked by providing consumers rich digital content.
openaire +1 more source
Parallel Processing Letters, 1998
In this note, we continue the study of messy broadcasting. We obtain exact values for the messy broadcasting time of complete graphs, paths, cycles, and complete d-ary trees. For hypercubes, we obtain exact values for messy broadcasting time under two of the models and present upper and lower bounds for the third model.
Hovhannes A. Harutyunyan +1 more
openaire +1 more source
In this note, we continue the study of messy broadcasting. We obtain exact values for the messy broadcasting time of complete graphs, paths, cycles, and complete d-ary trees. For hypercubes, we obtain exact values for messy broadcasting time under two of the models and present upper and lower bounds for the third model.
Hovhannes A. Harutyunyan +1 more
openaire +1 more source