scispace - formally typeset
Search or ask a question
Institution

NEC

CompanyTokyo, Japan
About: NEC is a company organization based out in Tokyo, Japan. It is known for research contribution in the topics: Signal & Layer (electronics). The organization has 33269 authors who have published 57670 publications receiving 835952 citations. The organization is also known as: NEC Corporation & NEC Electronics Corporation.


Papers
More filters
Book ChapterDOI
Martin Hirt1, Kazue Sako2
14 May 2000
TL;DR: The security of the multi-authority voting protocol of Benaloh and Tuinstra is analyzed and it is demonstrated that this protocol is not receiptfree, opposed to what was claimed in the paper and was believed before.
Abstract: Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority voting protocol of Benaloh and Tuinstra and demonstrate that this protocol is not receiptfree, opposed to what was claimed in the paper and was believed before. Furthermore, we propose the first practicable receipt-free voting scheme. Its only physical assumption is the existence of secret one-way communication channels from the authorities to the voters, and due to the public verifiability of the tally, voters only join a single stage of the protocol, realizing the "vote-and-go" concept. The protocol combines the advantages of the receipt-free protocol of Sako and Kilian and of the very efficient protocol of Cramer, Gennaro, and Schoenmakers, with help of designated-verifier proofs of Jakobsson, Sako, and Impagliazzo. Compared to the receipt-free protocol of Sako and Kilian for security parameter l (the number of repetitions in the non-interactive cut-andchoose proofs), the protocol described in this paper realizes an improvement of the total bit complexity by a factor l.

506 citations

Patent
Shimoda Hiroshi1
30 Oct 2003
TL;DR: In this paper, a non-volatile memory device includes a copy area latch circuit for latching information therein, a copy source address latch circuit to read information read from a source source, and write control means for comparing the information latched in the copy areas latch circuit and the copy source addresses latch circuit with each other.
Abstract: A non-volatile semiconductor memory device according to the invention includes a copy area latch circuit for latching information therein, a copy source address latch circuit for latching therein information read from a copy source, and write control means for comparing the information latched in the copy area latch circuit and the information latched in the copy source address latch circuit with each other, and automatically copying data latched in a source area of the copy source to a destination area of a copy destination, the destination area corresponding to the source area, until the information latched in the copy area latch circuit and the information latched in the copy source address latch circuit become coincide with each other following implementation of a newly provided copy command when data is copied from external storage means as a copy source to a non-volatile memory.

492 citations

Journal ArticleDOI
TL;DR: Electron microscope imaging for gadolinium metallofullerenes encapsulating in single-wall carbon nanotubes identifies the single Gd atom encaged in each, and chemical state analysis of Gd atoms suggests evidence for charge transfer from Gd to either a fullerene cage or a nanotube.
Abstract: Electron microscope imaging for gadolinium metallofullerenes encapsulating in single-wall carbon nanotubes [(Gd@C82)n@SWNTs] identifies the single Gd atom encaged in each. The intermolecular distance between Gd@C82 is extremely regular, regarding the chains of Gd@C82 as novel one-dimensional crystals. Chemical state analysis of Gd atoms suggests evidence for charge transfer from Gd to either a fullerene cage or a nanotube. The slopes of the temperature dependence of electric resistance for the mat-like films of (Gd@C82)n@SWNTs and (C60)n@SWNTs are much steeper than that for empty SWNTs, suggesting the electron scattering due to the electrostatic potential from inside fullerenes playing an important role.

465 citations

Proceedings Article
25 Apr 2012
TL;DR: The HULL (High-bandwidth Ultra-Low Latency) architecture is presented to balance two seemingly contradictory goals: near baseline fabric latency and high bandwidth utilization and results show that by sacrificing a small amount of bandwidth, HULL can dramatically reduce average and tail latencies in the data center.
Abstract: Traditional measures of network goodness--goodput, quality of service, fairness--are expressed in terms of bandwidth. Network latency has rarely been a primary concern because delivering the highest level of bandwidth essentially entails driving up latency--at the mean and, especially, at the tail. Recently, however, there has been renewed interest in latency as a primary metric for mainstream applications. In this paper, we present the HULL (High-bandwidth Ultra-Low Latency) architecture to balance two seemingly contradictory goals: near baseline fabric latency and high bandwidth utilization. HULL leaves 'bandwidth headroom' using Phantom Queues that deliver congestion signals before network links are fully utilized and queues form at switches. By capping utilization at less than link capacity, we leave room for latency sensitive traffic to avoid buffering and the associated large delays. At the same time, we use DCTCP, a recently proposed congestion control algorithm, to adaptively respond to congestion and to mitigate the bandwidth penalties which arise from operating in a bufferless fashion. HULL further employs packet pacing to counter burstiness caused by Interrupt Coalescing and Large Send Offloading. Our implementation and simulation results show that by sacrificing a small amount (e.g., 10%) of bandwidth, HULL can dramatically reduce average and tail latencies in the data center.

463 citations

Proceedings ArticleDOI
23 Jul 2002
TL;DR: A new framework for mining product reputations on the Internet is presented, which offers a drastic reduction in the overall cost of reputation analysis over that of conventional survey approaches and supports the discovery of knowledge from the pool of opinions on the web.
Abstract: Knowing the reputations of your own and/or competitors' products is important for marketing and customer relationship management. It is, however, very costly to collect and analyze survey data manually. This paper presents a new framework for mining product reputations on the Internet. It automatically collects people's opinions about target products from Web pages, and it uses text mining techniques to obtain the reputations of those products.On the basis of human-test samples, we generate in advance syntactic and linguistic rules to determine whether any given statement is an opinion or not, as well as whether such any opinion is positive or negative in nature. We first collect statements regarding target products using a general search engine, and then, using the rules, extract opinions from among them and attach three labels to each opinion, labels indicating the positive/negative determination, the product name itself, and an numerical value expressing the degree of system confidence that the statement is, in fact, an opinion. The labeled opinions are then input into an opinion database.The mining of reputations, i.e., the finding of statistically meaningful information included in the database, is then conducted. We specify target categories using label values (such as positive opinions of product A) and perform four types of text mining: extraction of 1) characteristic words, 2) co-occurrence words, 3) typical sentences, for individual target categories, and 4) correspondence analysis among multiple target categories.Actual marketing data is used to demonstrate the validity and effectiveness of the framework, which offers a drastic reduction in the overall cost of reputation analysis over that of conventional survey approaches and supports the discovery of knowledge from the pool of opinions on the web.

452 citations


Authors

Showing all 33297 results

NameH-indexPapersCitations
Pulickel M. Ajayan1761223136241
Xiaodong Wang1351573117552
S. Shankar Sastry12285886155
Sumio Iijima106633101834
Thomas W. Ebbesen9930570789
Kishor S. Trivedi9569836816
Sharad Malik9561537258
Shigeo Ohno9130328104
Adrian Perrig8937453367
Jan M. Rabaey8152536523
C. Lee Giles8053625636
Edward A. Lee7846234620
Otto Zhou7432218968
Katsumi Kaneko7458128619
Guido Groeseneken73107426977
Network Information
Related Institutions (5)
Bell Labs
59.8K papers, 3.1M citations

92% related

Hitachi
101.4K papers, 1.4M citations

92% related

Samsung
163.6K papers, 2M citations

91% related

IBM
253.9K papers, 7.4M citations

91% related

Intel
68.8K papers, 1.6M citations

90% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20238
202220
2021234
2020518
2019952
20181,088