In this paper, we propose a machine learning-based method of multi-document summarization integrating sentence extraction with bunsetsu elimination. We employ Support Vector Machines for both of the modules used. To evaluate the effect of bunsetsu elimination, we participated in the multi-document summarization task at TSC-2 by the following two approaches: (1) sentence extraction only, and (2) sentence extraction + bunsetsu elimination. The results of subjective evaluation at TSC-2 show that both approaches are superior to the Lead-based method from the viewpoint of information coverage. In addition, we made extracts from given abstracts to quantitatively examine the effectiveness of bunsetsu elimination. The experimental results showed that our bunsetsu elimination makes summaries more informative. Moreover, we found that extraction based on SVMs trained by short extracts are better than the Lead-based method, but that SVMs trained by long extracts are not.

In most cases of distributed memory computations, node programs are executed on processors according to the owner computes rule. However, owner computes rule is not best suited for irregular application codes. In irregular application codes, use of indirection in accessing left hand side array makes it difficult to partition the loop iterations, and because of use of indirection in accessing right hand side elements, we may reduce total communication by using heuristics other than owner computes rule. In this paper, we propose a communication cost reduction computes rule for irregular loop partitioning, called least communication computes rule. We partition a loop iteration to a processor on which the minimal communication cost is ensured when executing that iteration. Then, after all iterations are partitioned into various processors, we give global vs. local data transformation rule, indirection arrays remapping and communication optimization methods. The experimental results show that, in most cases, our approaches achieved better performance than other loop partitioning rules.

Optical Character Reader (OCR) incorrect recognition is a serious problem when searching for OCR-scanned documents in databases such as digital libraries. In order to reduce costs, this paper proposes fuzzy retrieval methods for English text containing errors in the recognized text without correcting the errors manually. The proposed methods generate multiple search terms for each input query term based on probabilistic automata which reflect both error-occurrence probabilities and character-connection probabilities. Experimental results of test-set retrieval indicate that one of the proposed methods improves the recall rate from 95.96% to 98.15% at the cost of a decrease in precision from 100.00% to 96.01% with 20 expanded search terms.

Forked checkpointing scheme is proposed to achieve low checkpoint overhead. When a process wants to take a checkpoint in the forked checkpointing scheme, it creates a child process and continues its normal computation. Two recovery models can be used for forked checkpointing when the parent process fails before the child process establishes the checkpoint. One is the pessimistic recovery model where the recovery process rolls back to the previous checkpoint state. The other is the optimistic recovery model where a recovery process waits for the checkpoint to be established by the child process. In this paper, we present the recovery models for forked checkpointing by deriving the expected execution time of a process with and without checkpointing and also show that the expected recovery time of the optimistic recovery model is smaller than that of the pessimistic recovery model.

Power control error is well known for its negative effects on CDMA system capacity. In this Letter, an analytical model is developed to estimate the uplink capacity for a SIR-based power controlled CDMA cellular system. The voice capacity reduction due to power control error is numerically examined with this model.

We present a new approach to the loop scheduling problem, which excels previous solutions in two important aspects: The resource constraints are formulated using flow graphs, and the initiation interval λ is treated as a rational variable. The approach supports heterogeneous processor architectures and pipelined functional units, and the Integer Linear Programming implementation produces an optimum loop schedule, whereby a minimum λ is achieved. Our flow graph model facilitates the cyclic binding of loop operations to functional units. Compared to previous research results, the solution can provide faster loop schedules and a significant reduction of the problem complexity and solution time.

This paper proposes a novel CMOS built-in current sensor (BICS) for on-line current testing. Proposed BICS detects abnormal current in circuit under test (CUT) and makes a Pass/Fail signal through comparison between the CUT current and the duplicated inverter current. This circuit consists of two current-to-voltage conversion transistors, a full swing generator, a voltage comparator, and an inverter block. It requires 16 transistors. Since this BICS does not require the extra clock, the added extra pin is only one output pin. Furthermore, the BICS does not require test mode selection. Therefore the BICS can be applied to on-line current testing. The validity and effectiveness are verified through the HSPICE simulation of circuits with defects. When the CUT is an 8 8 parallel multiplier, the area overhead of the BICS is about 4.34%.

In this paper, we evaluate the performance of pilot channel-aided channel estimation for multicarrier direct-sequence (DS) code division multiple access (CDMA) communication system as proposed by Kondo and Milstein . We consider a multicarrier DS-CDMA system with different number of pilot and data channels. We investigate the optimum number of pilot channels for various coherence bandwidths and different number of subchannels. Keeping the total transmit bandwidth fixed, an optimum number of total subchannels and pilot channels exists under specific channel environment and transmitted energy. As the number of pilot channels increases, more accurate channel estimation is possible but the number of data channels decreases resulting a smaller diversity gain. We show that there is a tradeoff between the number of pilot channels and data subchannels, thereby requiring differing numbers of optimum pilot channels according to channel conditions.

Mechanisms used for results merging are very important for distributed search systems. They are to select the most relevant documents retrieved by different servers and put them on the top of the list returned to the end user. There are several approaches to solve key problems of this task such as eliminating duplicates and ranking results combined. But it is still not clear how to achieve this. We use the clustering technique to divide retrieved results into several groups and a metric on the base of the vector space model to arrange items inside each group. Preliminary tests were conducted using the OASIS system and several collections of real Internet data. They showed relatively superior results when compared to the neural network clustering and LSI calculation. Proposed mechanisms can be applied to metasearch systems and to distributed search systems as well because such mechanisms do not require any special information except standard de facto data received from servers.

In this letter, we propose a robust IFDD scheme employing an interference canceller, which is used for mitigating interferences from the transmitting signal instead of complex filter bank to reduce the complexity, for the OFDM system using feedback information. According to simulation results, the proposed IFDD OFDM system does not show significant performance degradation but maintains the robustness against the fast time-varying multipath channel, while the TDD OFDM system estimating feedback information from receiving block makes serious performance degradation.

A reduced complexity multiple-input multiple-output (MIMO) equalizer with ordered successive interference cancellation (OSIC) is proposed for combating intersymbol interference (ISI) and cochannel interference (CCI) over frequency-selective multipath channels. It is developed as a reduced-rank realization of the conventional MMSE decision feedback equalizer (DFE). In particular, the MMSE weight vectors at each stage of OSIC are computed based on the generalized sidelobe canceller (GSC) technique and reduced-rank processing is incorporated by using the conjugate gradient (CG) algorithm for reduced complexity implementation. The CG algorithm leads to a best low-rank representation of the GSC blocking matrix via an iterative procedure, which in turn gives a reduced-rank equalizer weight vector achieving the best compromise between ISI and CCI suppression. With the dominating interference successfully cancelled at each stage of OSIC, the number of iterations required for the convergence of the CG algorithm decreases accordingly for the desired signal. Computer simulations demonstrate that the proposed reduced-rank MIMO DFE can achieve nearly the same performance as the full-rank MIMO MMSE DFE with an effective rank much lower than the dimension of the signal-plus-interference subspace.

Co-containing ferrite thin-film/Mn-Zn ferrite thin-film double-layered perpendicular media were prepared using reactive ECR sputtering and magnetron sputtering methods, and their magnetic and structural properties and recording characteristics were studied. The Mn-Zn ferrite thin-film backlayer had saturation magnetization of 3.5 kG and coercivity of 60 Oe. Reproduced voltage for the Co-containing ferrite thin-film/Mn-Zn ferrite thin-film double-layered medium was about twice of that for the Co-containing ferrite single-layer medium.

A minimum feedback node set in a graph is a minimum node subset whose deletion makes the graph acyclic. Its detection in a dependency graph is important to recover from a deadlock configuration. A livelock configuration is also avoidable if a check point is set in each node in the minimum feedback node set. Hence, its detection is very important to establish dependable network systems. In this letter, we give a minimum feedback node set in a trivalent Cayley graph. Assuming that each word has n bits, for any node, we can judge if it is included in the set or not in constant time.

A framework is described for a peer-to-peer information exchange system, and a collaborative information retrieval (IR) scheme for the system is proposed. The aims of the system include smooth knowledge and information management to activate organizations or communities. Conventional server-centric systems are weak because they create information-providing bottlenecks. Accordingly, the proposed framework targets the collaborative inter-working of personal repositories that accumulate per-user information, and accept and service requests. Issues concerning the framework are addressed. One issue is the retrieval of information from another's personal repository; the retrieval criteria of a system are tightly personalized for its user. The system is assumed to employ a vector space model with a concept-base as its IR mechanism. The vector space on one system is very different from that on another system. Another issue is the automated control of the information-providing criteria. This paper presents solutions to the first problem. To achieve IR that provides satisfactory results to a user requiring information from another's personal repository, we need vector space equalization to compensate for the differences in the vector spaces of the personal repositories. The paper presents a vector space equalization scheme, the automated relevance feedback scheme, that compensates the differences in the vector spaces of the personal repositories. We implement the scheme as a system and evaluate its performance using documents on the Internet.

We investigate the statistical features of both random- and chaos-based FM timing signals to ascertain their applicability to digital circuits and systems. To achieve such a goal, we consider both the case of single- and two-phase logic and characterize the random variable representing, respectively, the time lag between two subsequent rising edges or between two consecutive zero-crossing points of the modulated timing signal. In particular, we determine its probability density and compute its mean value and variance for cases which are relevant for reducing Electromagnetic emissions. Finally, we address the possible problems of performance degradation in a digital system driven by a modulated timing signal and to cope with this we give some guidelines for the proper choice of the statistical properties of the modulating signals.

Many cooperated web cache systems and protocols have been proposed. These systems, however, require expensive resources, such as external bandwidth and CPU power or storage of a proxy, while inducing hefty administrative costs to achieve adequate client population growth. Moreover, a scalability problem in the cache server management still exists. This paper suggests peer-to-peer client-clustering. The client-cluster provides a proxy cache with backup storage which is comprised of the residual resources of the clients. We use DHT based peer-to-peer lookup protocol to manage the client-cluster. With the natural characteristics of this protocol, the client-cluster is self-organizing, fault-tolerant, well-balanced and scalable. Additionally, we propose the Backward ICP which is used to communicate between the proxy cache and the client-cluster, to reduce the overhead of the object replication and to use the resources more efficiently. We examine the performance of the client-cluster via a trace driven simulation and demonstrate effective enhancement of the proxy cache performance.

In this paper, we develop an image-based tracking algorithm of multiple vehicles performing effective detection and tracking of moving objects under adverse environmental conditions. In particular, we employ low cost commercial off-the-shelf IR or CCD image sensor for generating continuous images of multiple moving vehicles. The motion in image sequences is first detected by adaptive background estimation and then tracked by Kalman filtering with the attribute information being updated by data association. Upon applying a modified Retinex procedure as preprocessing to reduce the illumination effects, we proceed with a two-step tracking algorithm. The first step achieves blob grouping and then judicially selects the true targets for tracking using data association through information registration. In the second stage, all blobs detected go through a validation for screening as well as for occlusion reasoning, and those found pertinent to the real object survive to become the 'Object' state for stable tracking. The results of representative tests confirm its effectiveness in vehicle tracking under both daylight and nighttime conditions while resolving occlusions.

Described here is an automatic text summarization system for Japanese newspaper articles on sassho-jiken (murders and bodily harms). We extract the pieces of information from a text, inter-connect them to represent the scenes and participants involved in the sassho-jiken, and finally produce a summary by generating sentences from the information extracted. An experiment and its evaluation show that, while a limitation being imposed on the domain, our method works well in depicting important information from the newspaper articles and the summaries produced are better in adequacy and readability than those obtained by extracting sentences.

A new type of compact one dimension (1-D) microstrip photonic bandgap (PBG) structure for filter is presented. A miniature semiconductor-based structure band-stop filter with four cells is simulated, fabricated, and measured. Agreement between the experimental and simulation results has been achieved. The filter with four proposed PBG structure exhibits deep (about -60 dB) and steep (about 40 dB/GHz) stop-band characteristics. It also has less loss and ripples in the pass-band. The period of the PBG lattice is about 0.2 λe (λe, guiding wavelength at the center frequency of stop-band), or 0.068 λ0 (λ0 wavelength in air), and the filter is very compact and much easier for fabrication and realization in MIC and MMIC.

Cochannel interference and multipath propagation reduce the performance of mobile communication systems. Multi-input MLSE with whitening processing can mitigate the influence of the interference and provide path diversity gain. In conventional considerations, however, the required complexity rapidly rises with the number of array elements. In this paper, we propose multi-input MLSE that whitens error signals in the signal space by using a multibeam adaptive array. This scheme can reduce the computational load of multi-input MLSE than the conventional type when using a large-element array. The results of an analysis show that the proposed type is equivalent to conventional one in the sense of the metric and provides less computational complexity.