In this paper, two new clustering algorithms are proposed for the data with some errors. In any of these algorithms, the error is interpreted as one of decision variables -- called "tolerance" -- of a certain optimization problem like the previously proposed algorithm, but the tolerance is determined based on the opposite criterion to its corresponding previously proposed one. Applying our each algorithm together with its corresponding previously proposed one, a reliability of the clustering result is discussed. Through some numerical experiments, the validity of this paper is discussed.

Reliability-based hybrid ARQ (RB-HARQ) is a kind of incremental-redundancy ARQ recently introduced. In the RB-HARQ, the receiver returns both NAK signal and set of unreliable bit indices if the received sequence is not accepted. Since each unreliable bit index is determined by the bitwise posterior probability, better approximation of that probability becomes crucial as the number of retransmissions increases. Assuming the systematic code for the initial transmission, the proposed RB-HARQ scheme has the following two features: (a) the sender retransmits newly encoded and interleaved parity bits corresponding to the unreliable information bits; (b) the retransmitted parity bits as well as the initial received sequence are put all together to perform the message passing decoding i.e. the suboptimal MAP decoding. Finally, simulation results are shown to evaluate the above two features.

A press-fit connection is a solderless electrical connection technology, which utilizes the mechanical contact force generated between through-holes on a printed circuit board (PCB) and terminals with a width slightly larger than the through-hole diameter. This technology has been widely noted recently as a measure against the "Lead Free Requirement" of materials comprising electric/electronic devices, especially in the area of automobile connector. For the application of this technology to automobile connectors, we have to take into account the severe requirement, such as (1) the adaptation to wider through-hole diameter tolerance range and (2) the establishment of connection reliability for the various PCB surface treatments. As a result, we have determined the minimum and maximum contact forces satisfying the long term connection reliability and designed the terminal shape, which has been refined the N-shape cross section developed before, by using three dimensional finite element methods (FEM). Furthermore, we have developed a new type of hard tin plating on terminals, thus preventing the scraping-off of tin during the insertion process, that could result in a short-circuit on the PCB, for the Organic Solderability Preservative (OSP) treated PCB. The press-fit connector for the automobile airbag Electronic Control Units (ECUs) we developed has been able to transfer to the mass-production phase successfully from August 2005.

We address the problem of routing and wavelength assignment (RWA) considering differentiated reliability (DiR) in WDM mesh networks. The backup resource can be shared by the primary lightpaths. However, both the primary-backup sharing and the different levels of fault tolerance requirement have never been considered together in the literature. In the paper, we consider the dynamic character of the link availability, which is caused by primary-backup sharing. Moreover, the priority of traffic is considered in the paper. The paper focuses on routing under dynamic availability of wavelength resource while the requested reliability of traffic has to be met, using the modified shortest path algorithm. A layered availability model is established based on wavelength layered graph model. Using this model, we propose a new algorithm called dynamic layered availability (DLA) algorithm. We evaluate the performance of the proposed algorithm on the NSFNET.

A test structure to separately analyze the location where the hot-carrier-induced CMOSFET reliability is determined around the center or the isolation-edge along the channel-width was proposed and fabricated. The test structure has four kinds of MOSFETs; [A] and [D] MOSFETs with a short and a long channel-length all over the channel width, respectively, [B] MOSFET with the short and the long channel-length around the center and the both isolation-edges, respectively, and [C] MOSFET with the channel-length regions vice versa to the [B] MOSFET. The time dependent changes of the threshold voltages VT, the saturation currents IS, the linear currents IL and the maximum transconductances β up to 50,000 s were measured. All data for the wide channel-width MOSFETs were almost categorized into three; [A], [B]/[C] and [D]. The [B]/[C] data were well estimated from simple theoretical discussions by the combination of [A] and [D] data, which mean that the reliabilities are nearly the same around the center or the isolation-edge for the CMOSFETs.

Providing data availability in a high performance computing environment is very important, especially in this data-intensive world. Most clusters either equip with RAID (Redundant Array of Independent Disks) devices or use redundant nodes to protect data from loss. However, neither of these can really solve the reliability problem incurred in a striped file system. Striping provides an efficient way to increase I/O throughput both in the distributed and parallel paradigms. But it also reduces the overall reliability of a disk system by N fold, where N is the number of independent disks in the system. Parallel Virtual File System (PVFS) is an open source parallel file system which has been widely used in the Linux environment. Its striping structure is good for performance but provides no fault tolerance. We implement Reliable Parallel File System (RPFS) based on PVFS but with reliability support. Our quantitative analysis shows that MTTF (Mean Time To Failure) of our RPFS is better than that of PVFS. Besides, we propose a parity cache table (PCT) to alleviate the penalty of parity updating. The evaluation of our RPFS shows that its read performance is almost the same as that of PVFS (2% to 13% degradation). As to the write performance, 28% to 45% improvement can be achieved depending on the behavior of the operations.

IEEE802.11b standard provides 1, 2, 5.5, 11 Mbps data rates. These data rates can be made possible by using different modulation techniques: DBPSK, DQPSK, CCK5.5 and CCK11 respectively. Rate adaptation is the process of dynamically selecting a proper modulation scheme depending on channel conditions in order to improve total throughput. Current rate adaptation protocols deal with unicast links rather than multicast. Measuring the received Signal Strength (RSS) of a feedback message (CTS, ACK) to estimate the receiver's link condition, can be one way to do this. A receiver may send its channel condition information to the sender allowing it to adapt its data rate for the following transmission. IEEE802.11 standard however, does not provide feedback messages for MAC layer recovery on multicast frames. This is due to collisions occurring if multicast group members simultaneously initiate a feedback message. Therefore, in order to link adapt multicast, a reliable multicast MAC protocol has to be introduced. In this paper, we propose a Rate Adaptive Multicast (RAM) protocol which provides reliability to WLANs and enhances its throughput by using Rate Adaptation. Further, we evaluate our protocol by throughput analysis and computer simulation. Simulation results suggest that our protocol performs better than related/existing protocols in both throughput as well as reliability.

We propose a new fixed-rate error correction system with a feedback channel. In our system, the receiver transmits a list of positions of unreliable information bits based on the log a-posteriori probability ratios by outputs of a soft-output decoder to the transmitter. This method is just like that of the reliability-based hybrid ARQ scheme. To dynamically select an appropriate interleaving function with feedback information is a key feature of our system. By computer simulations, we show that the performance of a system with a feedback channel is improved by dynamically selecting an appropriate interleaving function.

We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. In this paper, we propose a new method for reducing the time complexity of generating candidate codewords by storing some already generated candidate codewords. Simulation results show that the increase of memory size is small.

This paper discusses distributed checkpointing with logging for practical applications running with limited resources. We present a discrete time model evaluating the total expected overhead per event where the number of available checkpoints that each process can hold is finite. The rollback distance is also bound to some finite interval in many actual applications. Therefore, the recovery overhead for the checkpointing scheme is described by using a truncated geometric distribution as the rollback distance distribution. Although it is difficult to analytically derive the optimal checkpoint interval, which minimizes the total expected overhead, substituting other simple probabilistic distributions instead of the truncated geometric distribution enables us to do this explicitly. Numerical examples obtained through simulations are presented to show that we can achieve almost minimized total overhead by using the new models and analyses.

At present, during the design of sealed electromagnetic relay, the tolerances of design parameters are given with experience. The designer can't provide quantificational reliability index, and the blindness of tolerance distribution also causes unnecessary increase of machining cost. According to the study of electromagnetic force and spring force characteristics of a certain sealed electromagnetic relay with polarized magnetic system, this paper analyzed the influence of main design parameters' tolerances to the tolerance bands of electromagnetic force and spring force characteristics and achieved the strong correlative factors (viz. design parameters) that have obvious effect on tolerance bands of electromagnetic force and spring force characteristics. Then based on the calculation of reliability, the tolerance distribution method of key design parameters was given. This method not only can make the designed product satisfy requirement of reliability, but also reduce the machining cost.

In this paper an analysis of component and system reliability for lattice systems is proposed when component failures are not statistically independent. We deal the case that the failure rate of a component depends on the number of the adjacent failed components. And we discuss the maintainability of the system when a failed component is replaced by a spare component. At first we discuss the approximated reliability of each component. Then we estimate the mean number of failed components. Furthermore, the system reliability is approximated by using the component reliability.

The effects of rapid thermal annealing (RTA) on bias-stress-induced base leakage were investigated in InGaP/GaAs collector-up heterojunction bipolar transistors (C-up HBTs) fabricated with boron ion implantation. C-up HBTs annealed at 700 for 1 s had negligible leakage, while non-annealed C-up HBTs had leakage (with an activation energy, Ea, of 0.17 eV) that exponentially increased with bias time. Because this Ea is almost the same as that of the hole traps (0.25 eV) observed in the InGaP emitters of non-annealed C-up HBTs, we attribute the leakage to hole tunneling from bases to emitters. By reducing the initial trap density using RTA, we stabilized current gain even after 1,030 h of testing at a junction temperature of 210 and a collector current density of 40 kA/cm2.

This paper presents a new built-in current sensor (BICS) that detects defects using the current testing technique in CMOS integrated circuits. The proposed circuit is a negligible impact on the performance of the circuit under test (CUT). In addition, no extra power dissipation and high-speed fault detection are achieved. It can be applicable in deep sub-micron process. The area overhead of the BICS versus the entire chip is about 9.2%. The chip was fabricated with Hynix 0.35 µm standard CMOS technology.

The Reliability-Based Hybrid ARQ (RB-HARQ) scheme, which can be used with error correcting codes using soft-input soft-output (SISO) decoders such as convolutional codes and turbo codes has been proposed. In the RB-HARQ scheme, the error rate performance is improved by selecting the retransmission bits based on Log Likelihood Ratio (LLR) of each bit in the receiver. However, the receiver has to send the bit positions of retransmission bits to the transmitter. Therefore, the RB-HARQ scheme requires a great number of feedback bits. On the other hand, Low Density Parity Check (LDPC) codes are attracting a lot of interest, recently. Because LDPC codes can achieve near Shannon limit performance and be decoded easily compared to turbo code. In this paper, we evaluate the RB-HARQ scheme using LDPC code. Moreover, we propose a RB-HARQ scheme that requires a fewer feedback bits by utilizing a code structure of LDPC code. We refer to the scheme as the RB-HARQ (row base) scheme. We show that the RB-HARQ and RB-HARQ (row base) schemes using LDPC code have better error rate performance than the scheme without ARQ. We also show that the RB-HARQ (row base) scheme has a good trade-off between error rate performance and the number of feedback bits compared to the RB-HARQ scheme.

Temperature-tracking is becoming of paramount importance in modern electronic design automation tools. In this paper, we present a deterministic thermal placement algorithm for standard cell based layout which can lead to a smooth temperature distribution over the die. It is mainly based on Fiduccia-Mattheyses partition scheme and a former substrate thermal model that can convert the known temperature constraints into the corresponding power distribution constraints. Moreover, a kind of force-directed heuristic based on cells' power consumption is introduced in the above process. Experimental results demonstrate a comparatively uniform temperature distribution and show a reduction of the maximal temperature on the die.

In wired networks, broadcast and multicast transmissions can be easily achieved by data link layer (layer 2). Nevertheless, it is a big challenge to safely transfer broadcast or multicast data frames over multihop mobile ad hoc networks (MANETs) due to the high bit error rate, the high collision probability and the lack of acknowledgment. Additionally, most of MANET's routing protocols rely on the broadcast function to exchange essential routing packets between mobile nodes and need the multicast function to make more efficient use of network bandwidth for some particular multimedia applications. From our observations, the efficiency of the unicast/multicast routing protocol of finding the path/tree is highly dependent on supported broadcast schemes of the underlying media access control (MAC) protocol. Therefore, in this paper, we illustrate the uncertain broadcast problem due to no replying acknowledgment from any recipients when mobile nodes deliver broadcast frames in wireless networks. We, then, propose a novel reliable broadcast scheme to solve this problem as well as a reliable multicast scheme to enhance the network utilization in data link layer. Simulation results show that the proposed scheme, which is still compatible with IEEE 802.11 standard, can efficiently minimize the bandwidth consumption as well as propagation delay.

This paper describes an overview of overall carrier-grade Ethernet technologies for next generation wide area Ethernet. In recent years, from access network to metro and core network, we can find many areas where communication services are provided by Ethernet technologies. This comes from the fact that operational efficiency and economical efficiency of Ethernet are far better than that of conventional wide area communication technologies such as SONET and ATM. On the other hand, carrier-grade reliability, operations-administration-maintenance (OAM) and quality of service (QoS) are inferior to SONET and ATM. Various standard schemes in IEEE 802 and ITU-T and vendors' proprietary schemes can leave various approaches to solve these problems. In this paper, the author explains a basic architecture of wide area Ethernet service (Q-in-Q tagging for metro network and Mac-in-Mac encapsulation for core network) at first. Various switch control technologies are then discussed which are deployed or are under evaluation in order to improve (i) reliability (i.e., resiliency) to protect subscribers against network failures, (ii) OAM for providers to perform fault and performance management, and (iii) QoS to guarantee subscriber's service level agreement between a carrier and a subscriber. Finally, a new switching architecture, Global Open Ethernet (GOE), is also introduced as one of promising approaches to realize a next generation carrier-grade Ethernet.

We have proposed Rate-based Multi-path Transmission Control Protocol (R-M/TCP) for improving reliability and performance of data transfer over the Internet by using multiple paths. Congestion control in R-M/TCP is performed in a rate-based and loss-avoidance manner. It attempts to estimate the available bandwidth and the queue length of the used routes in order to fully utilize the bandwidth resources. However, it has been reported that when the used routes' characteristics, i.e. available bandwidth and delay, are much different, R-M/TCP cannot achieve the desired throughput from the routes. This is because R-M/TCP originally transmits data packets in a round-robin manner through the routes. In this paper, therefore, we propose R-M/TCP using Packet Scheduling Algorithm (PSA). Instead of using the round-robin manner, R-M/TCP utilizes PSA that accounts for time-varying bandwidth and delay of each path so that number of data packets arriving in out-of-order at the receiver can be minimized and the desired throughput can be achieved. Quantitative simulations are conducted to show effectiveness of R-M/TCP using PSA.

In this paper, we propose a new software reliability growth model which is the mixture of two exponential reliability growth models, one of which has the reliability growth and the other one does not have the reliability growth after the software is released upon completion of testing phase. The mixture of two such models is characterized by a weighted factor p, which is the proportion of reliability growth part within the model. Firstly, this paper discusses an optimal software release problem with regard to the expected total software cost incurred during the warranty period under the proposed software reliability growth model, which generalizes Kimura, Toyota and Yamada's (1999) model with consideration of the weighted factor. The second main purpose of this paper is to apply the Bayesian approach to the optimal software release policy by assuming the prior distributions for the unknown parameters contained in the proposed software reliability growth model. Some numerical examples are presented for the purpose of comparing the optimal software release policies depending on the choice of parameters by the non-Bayesian and Bayesian methods.