D3-brane from D-instantons in the hybrid formalism of superstring

A Dp-brane can be regarded as a configuration of infinitely many D(p-2k)-branes in bosonic string. We will show this property of D-branes in the superstring case using the hybrid formalism. It is convenient to study the boundary state for such D-branes to study such property between D-branes. We show that the boundary state for a D3-brane in a constant self-dual gauge field background can be expressed in terms of the boundary state for D-instantons in the hybrid formalism.Comment: 10 pages, minor corrections, reference adde

Recreating Humorous Split Compound Errors in Swedish by Using Grammaticality

Proceedings of the 16th Nordic Conference of Computational Linguistics NODALIDA-2007. Editors: Joakim Nivre, Heiki-Jaan Kaalep, Kadri Muischnek and Mare Koit. University of Tartu, Tartu, 2007. ISBN 978-9985-4-0513-0 (online) ISBN 978-9985-4-0514-7 (CD-ROM) pp. 389-393

An Approach for Chinese-Japanese Named Entity Equivalents Extraction Using Inductive Learning and Hanzi-Kanji Mapping Table

Named Entity Translation Equivalents extraction plays a critical role in machine translation (MT) and cross language information retrieval (CLIR). Traditional methods are often based on large-scale parallel or comparable corpora. However, the applicability of these studies is constrained, mainly because of the scarcity of parallel corpora of the required scale, especially for language pairs of Chinese and Japanese. In this paper, we propose a method considering the characteristics of Chinese and Japanese to automatically extract the Chinese-Japanese Named Entity (NE) translation equivalents based on inductive learning (IL) from monolingual corpora. The method adopts the Chinese Hanzi and Japanese Kanji Mapping Table (HKMT) to calculate the similarity of the NE instances between Japanese and Chinese. Then, we use IL to obtain partial translation rules for NEs by extracting the different parts from high similarity NE instances in Chinese and Japanese. In the end, the feedback processing updates the Chinese and Japanese NE entity similarity and rule sets. Experimental results show that our simple, efficient method, which overcomes the insufficiency of the traditional methods, which are severely dependent on bilingual resource. Compared with other methods, our method combines the language features of Chinese and Japanese with IL for automatically extracting NE pairs. Our use of a weak correlation bilingual text sets and minimal additional knowledge to extract NE pairs effectively reduces the cost of building the corpus and the need for additional knowledge. Our method may help to build a large-scale Chinese-Japanese NE translation dictionary using mono-lingual corpora

Naturalness of an Utterance Based on the Automatically Retrieved Commonsense

In this research we investigated user’s behavior while facing a system coping with common knowledge about keywords and compared it with not only classic word-spotting method but also with random text-mining. We show how even a simple implementation of our idea can enrich the conversation and increase the naturalness of computer’s utterances. Our results show that even very commonsensical utterances are more natural than classic approaches and also methods we developed to make a conversation more interesting. For arousing opinion exchange during the session, we will also briefly introduce our idea of combining latest NLP achievements into one holistic system where the main engine we want to base on commonsense processing and affective computing.

A design for testability study on a high performance automatic gain control circuit.

A comprehensive testability study on a commercial automatic gain control circuit is presented which aims to identify design for testability (DfT) modifications to both reduce production test cost and improve test quality. A fault simulation strategy based on layout extracted faults has been used to support the study. The paper proposes a number of DfT modifications at the layout, schematic and system levels together with testability. Guidelines that may well have generic applicability. Proposals for using the modifications to achieve partial self test are made and estimates of achieved fault coverage and quality levels presente

Possible Usage of Sentiment Analysis for Calculating Vectors of Felific Calculus

Abstract-In this paper we introduce an algorithm for affective reasoning based on Bentham's Felific Calculus known also as the hedonic calculus. Knowledge recquired for the task is retrived from a blog corpus by means of sentiment analysis on sentences containing an action or state input. This approach allows a machine to gather information on how usually other people feel when something happens, why people did it and what could happen after the act. Such knowledge is important for understanding actions of others, and for acquiring emphatic skills by a machine. In addition to emotion categorization of Nakamura, we introduce two lexicons based on McDougall's instinct classification and Kohlbergian stages of moral development, then show some basic efficiency of the retrieved knowledge