Computerization of English

Natural languages, when regarded as codes for the transmission of information, are essentially structured like error-detecting or error-correcting codes. This principle has been used to write a program that, by random choice, is capable of constructing several billion different English sentences from a dictionary of less than a hundred unprocessed words. Applications to artificial intelligence and other fields are suggested.     

Comprehension of a Narrative Passage by Elementary School Children as a Function of Listening Rate, Retention Period, and IQ

The purpose of this study was to evaluate differences in comprehension among elementary school children who listened to a narrative passage presented at different rates of expansion or compression, ranging from 78 words per minute (in increments of 50 words per minute) to 428 words per minute. One hundred sixty-two elementary school children from three levels of intelligence comprised the samples. All subjects had mental ages falling in the 9–4 to 11–3 range. The materials used in this study were three standardized listening passages and associated tests. The first two passages were used for training and familiarization purposes; the third passage was used for obtaining criterion data. Multiple choice tests covering the passage contents were used. Two alternate forms of a 28-item test were used with the criterion passage. Immediate and one-week retention data were gathered on each subject. Results of the study indicate that listening rates of 228 to 328 wpm are more efficient for learning and retention than the normal rate of 178 wpm. Subjects with lower IQs performed better at rates which were slower than the most efficient rates for higher IQ subjects. It was further observed that the performance curves obtained in this study display a secondary peak just prior to the final drop in performance at very high listening rates. This study provides evidence that high-speed listening can be an efficient learning medium for elementary school children.     

Cyclically permutable error-correcting codes

In an asynchronous multiplex system a single band of radio frequencies carries many simultaneous conversations, each of which uses a distinguishable train of pulses as a "carrier." To design a good list of allowed pulse trains one is led to a peculiar kind of error-correcting code problem. The encoding sought uses binaryN-tuples (code words) in which most of the digits are zero. In addition the Hamming distances from any given code word to all cyclic permutations of all other code words must exceed a prescribed minimum value. The code words found herein may be generated simply using a shift register.     

On a class of cyclically permutable error-correcting codes

Cyclically permutable codes have error-correcting properties which are invariant under arbitrary cyclic permutation of any of their code words. This paper summarizes the results of an empirical investigation of certain of these codes, which have parameters not covered by a previous paper of E. N. Gilbert.^{1}These codes are thought to be nearly optimal. Estimates of the obtainable number of code words are given. The codes may be suitable for use in certain asynchronous multiplex communication systems.     

Carbon copy

Climate change was a hot enough topic that I wrote about it in this column in 2006, but recent polls show it's no longer a major component of the average person's stress portfolio. Was global warming just another faddish obsession? We can look to language for an answer--new words are the cultural by-products of our preoccupations. And sure enough, while the idea of climate change may be on the back burner, it's clearly on high heat, because new words and phrases are still bubbling up.     

An Image Authentication Method by Grouping Most Significant Bits

In 2011, Chan proposed an image authentication method by producing the parity check bits from pixels whose bits have been rearranged. Due to this rearrangement, the value of the most-significant bit of each tampered pixel can be determined according to its parity check bits. With the help of the most-significant bit of the pixel, the pixel can be recovered by selecting two possible (7, 4) Hamming code words. However, if the distance between two Hamming code words is within a certain range, incorrect selection may occur. Chan's method added one additional bit to indicate the correct one. It is trivial that this may degrade the quality of the authenticated image. In this paper, we group four most-significant bits into different groups to form a mapping codebook and the mapping codebook is used to produce authentication data instead of the (7, 4) Hamming code book. The experimental results show that the proposed method has a greater ability to recover tampered areas.     

Lexical Tones and Word Learning in Mandarin-Speaking Children at Three Years of Age

Unlike Indo-European languages, Mandarin relies heavily on lexical tones to distinguish word identity. Using the intermodal preferential looking paradigm, this study examined 3-year-old Mandarin-speakers' ability to use Mandarin lexical tones in learning new words. Results showed that when children were presented with Tone 2 (rising) and Tone 4 (falling) pairs, children successfully learned both words. However, when children were presented with Tone 2 and Tone 3 (dipping) pairs, they learned the Tone 2 word but not the Tone 3 one. Children were then divided into two groups based on their learning performance on the Tone 3 word. Successful learning of Tone 3 words was observed in the high performers but not in the low performers, who consistently misused Tone 3 as Tone 2. This study showed that Mandarin-speaking 3-year-olds could use lexical tones to learn words under experimental conditions, and that the difficulty of Tone 3 acquisition may be related to its lower level of perceptual distinctiveness compared with other tones.     

Look-ahead coding for input- restricted channels (Corresp.)

A(k/n)code is a uniquely decipherable scheme mapping source words of lengthkinto channel words of lengthn. In a look-ahead code the encoding and/or decoding of a current word may depend on upcoming, as well as past, symbols. Given antheta-ary source, a channel of     

基于视觉与标注相关信息的图像聚类算法

算法首先按视觉相关程度对标注字进行打分,标注字的分值体现了语义一致图像的视觉连贯程度.利用图像语义类别固有的语言描述性,从图像标注中抽取具有明显视觉连贯性的标注字作为图像的语义类别,减少了数据库设计者繁琐的手工编目工作.按标注字信息对图像进行语义分类,提高了图像聚类的语义一致性.对4500幅Corel标注图像的聚类结果证实了算法的有效性.     

Virtual-Reality Test Reveals Hidden Concussion Damage [Update]

Autumn is upon us, and in the United States, so is football season. The players, who deliver jarring hits to one another that often equal the force of car wrecks, are lionized for the ability to, in the words of an old watch commercial, ?take a licking and keep on ticking.? But concussions are not uncommon, and new research shows that even when players are symptom-free and have passed a battery of cognitive-function tests, their brains may not have completely recovered and may still be vulnerable to further injury.     

Vibrating sample method for amplitude and phase measurements withthe acoustic microscope

Describes how the scanning acoustic microscope may be operated in a continuous wave mode. By oscillating the sample by approximately a few hundred angstroms, single frequency amplitude and phase measurements may be obtained with the acoustic microscope. The method should allow very high frequency quantitative operation of the microscope, where conventional pulse echo methods would fail. A system implementation and preliminary results are presented     

Handling OOVWords in Mandarin Spoken Term Detection with an Hierarchical n-Gram Language Model

In this paper, an hierarchical n-gram Language model (LM) combining words and characters is explored to improve the detection of Out-of-vocabulary (OOV) words in Mandarin Spoken term detection (STD). The hierarchical LM is based on a word-level LM, with a character-level LM estimating probabilities of OOV words in a class-based way. The region containing OOV words in the sentence to be decoded is detected with the help of the word-level LM and the probabilities of OOV words are derived from the character-level LM. The implementation of the proposed approach is based on a dynamic decoder. The proposed approach is evaluated in terms of Actual term weighted value (ATWV) on two Mandarin data sets. Experiment results show that more than 10％ relative improvement for OOV word detection is achieved on both sets. In addition, the detection of In-vocabulary (IV) words is barely influenced as well.     

一种领域合成词的抽取方法

构建领域本体的首要任务是获取领域相关的概念,这些概念很多是由常用词典库中没有收录的领域合成词组成,因此抽取领域合成词对于领域本体的构建至关重要.本文基于语言规则和统计技术,提出一种结合改进互信息和语言模板的领域合成词抽取方法.首先利用改进的互信息算法抽取由多字词单位构成的高频次候选领域合成词,在此基础上,利用语言模板匹配抽取低频次候选领域合成词,最后由专家进行检验,得到领域合成词集.实验结果表明,该算法的领域合成词提取准确率达到88.22%,适用于从大规模网页文本中自动高效地抽取领域合成词.     

基于Boot Strapping的中文实体关系自动生成

针对中文信息抽取系统中建立提取事件模板的难点问题，基于Bootstrapping思想。提出一种简单、可行的实体关系自动生成方法，利用由种子词和种子模板组成的知识库建立学习器，采用标量聚类的方法，通过种子模板抽取更多的与种子词相似语义关系的特征词。在此基础上，利用最近邻居的原则。进而生成更多的抽取模板。丰富了知识库，为分析二元实体关系奠定基础，使得生成复杂的消息模板成为可能，同时极大地减轻手工建立模板的复杂度．有利于系统进行移植。     

Weaving a Web of ideas

Engines that search for meaning rather than words will make the Web more manageable. Committees of researchers from around the globe want to make the Web more homogeneous, more data-like, more amenable to computer understanding-and then agents won't have to be so bright. In other words, if Web pages could contain their own semantics-if we had a Semantic Web-software agents wouldn't need to know the meanings behind the words.     

基于随机化视觉词典组和上下文语义信息的目标检索方法

 传统的视觉词典法(Bag of Visual Words,BoVW)具有时间效率低、内存消耗大以及视觉单词同义性和歧义性的问题,且当目标区域所包含的信息不能正确或不足以表达用户检索意图时就得不到理想的检索结果.针对这些问题,本文提出了基于随机化视觉词典组和上下文语义信息的目标检索方法.首先,该方法采用精确欧氏位置敏感哈希(Exact Euclidean Locality Sensitive Hashing,E²LSH)对局部特征点进行聚类,生成一组支持动态扩充的随机化视觉词典组;然后,利用查询目标及其周围的视觉单元构造包含上下文语义信息的目标模型;最后,引入K-L散度(Kullback-Leibler divergence)进行相似性度量完成目标检索.实验结果表明,新方法较好地提高了目标对象的可区分性,有效地提高了检索性能.     

Embedded Checker Architectures for Cyclic and Low-Cost Arithmetic Codes

Code checkers that monitor the outputs of a system can detect both permanent and transient faults. We present two novel architectures of embedded self-testing checkers for low-cost and cyclic arithmetic codes, one based on code word generators and adders, the other based on code word accumulators. In these schemes, the code checker receives all possible code words but one, irrespective of the number of different code words that are produced by the circuit under check (CUC). So any code checker can be employed that is self-testing for all or a particular subset of code words, and the structure of the code checker need not be tailored to the set of code words produced by the CUC. The proposed code word generators and accumulators are built from simple standard hardware structures, counters and end-around-carry adders. They can also be utilized in an off-line BIST environment as pattern generators and test response compactors.     

DNA编码的计算机筛选策略研究

1994年,Adleman提出了使用DNA分子进行计算的模型并通过实验得到了验证,昭示了这一新方法在大规模并行计算和数据存储中使用的广阔前景。然而,至今仍有很多影响其投入实际使用的关键问题未能得到很好地解决,DNA编码问题便是其中之一。文中分析了DNA编码中存在的限制条件,提出了使用计算机筛选DNA编码的思路,并使用计算机筛选出的DNA编码开展了分子生物学实验,旨在提供计算机快速有效筛选DNA编码的方法。     

Design of Embedded Self-Testing Checkers for t-UED and BUED Codes

In this article we present a new method for designing self-testing checkers for t-UED and BUED codes. The main idea of this method is to map words of the considered code to words of a code of the same type in which the value of t or the number of check bits is reduced and repeating this with the obtained words until a parity code is obtained, or to translate the code words into words of a code for which such a mapping is possible. First we consider Borden codes for t = 2 ^k – 1, Bose, and Bose-Lin codes. The mapping operation is realized by averaging weights and check symbol values of the code words. The resulting checkers have a simple and regular structure. This structure is independent on the set of code words that is provided by the circuit under check. The checkers are very well suited for use as embedded checkers since they are self-testing with respect to single stuck-at faults under very weak assumptions. All three checker types can be tested with 2 or 3 code words. We also propose a novel approach to design checkers for Blaum codes that require much less code word tests than existing solutions.     

基于微程序技术的存储控制器的研究和设计

以一个应用于网络与通讯领域的SOC芯片研发项目为背景,设计了SOC芯片上的存储控制器.该存储控制器基于动态微程序控制技术,用RAM阵列来存储控制字,在SOC芯片初始化时由用户写入控制字,在芯片工作时,也可通过系统总线对RAM阵列进行写操作,使控制字能动态地改变.该结构的存储控制器具有高度的灵活性,可灵活地根据SOC芯片外接的存储器类型进行配置,能够与多种类型的存储器实现无缝连接使用.相比仅适用于某类型存储器的控制器,该存储控制器具有较大的应用优势.