We extend the framework of cost-sensitive classification to mitigate risks of huge costs occurring with low probabilities, and propose an algorithm that achieves this goal. Instead of minimizing the expected cost commonly used in cost-sensitive learning, our algorithm minimizes conditional value-at-risk, also known as expected shortfall, which is considered a good risk metric in the area of financial engineering. The proposed algorithm is a general meta-learning algorithm that can exploit existing example-dependent cost-sensitive learning algorithms, and is capable of dealing with not only alternative actions in ordinary classification tasks, but also allocative actions in resource-allocation type tasks. Experiments on tasks with example-dependent costs show promising results.

Exploiting layer7 context is an effective approach to improving the accuracy of detecting malicious messages in network intrusion detection/prevention systems (NIDS/NIPSs). Layer7 context enables us to inspect message formats and the message exchanged order. Unfortunately, layer7-aware NIDS/NIPSs pose crucial implementation issues because they require full TCP and IP reassembly without losing 1) complete prevention, 2) performance, 3) application transparency, or 4) transport transparency. Complete prevention means that the NIDS/NIPS should prevent malicious messages from reaching target applications. Application transparency means not requiring any modifications to and/or reconfiguration of server and client applications. Transport transparency is not to disrupt the end-to-end semantics of TCP/IP. To the best of our knowledge, none of the existing approaches meet all of these requirements. We have developed an efficient mechanism for layer7-aware NIDS/NIPSs that does meet the above requirements. Our store-through does this by forwarding each out-of-order or IP-fragmented packet immediately after copying the packet even if it has not been checked yet by an NIDS/NIPS sensor. Although the forwarded packet might turn out to be a part of an attack message, the store-through mechanism can successfully defend against the attack by blocking one of the subsequent packets that contain another part of attack message. Testing of a prototype in Linux kernel 2.4.30 demonstrated that the overhead of our mechanism is negligible compared with that of a simple IP forwarder even with the presence of out-of-order and IP-fragmented packets. In addition, the experimental results suggest that the CPU and memory usage incurred by our store-through is not significant.

Owing to simple structure, low cost and high performance, NRD-guide millimeter wave circuits have attracted much attention in recent years. In this paper, a variety of NRD-guide passive components are reviewed with emphasis on design techniques and performance estimation in the 60 GHz frequency band where the license-free advantage is available. The passive components to be discussed here include compact bends, wideband hybrid couplers, practical three-port junctions, versatile E-plane filters, and effective feeding structures for lens antennas. Some of them are employed to construct millimeter wave transceivers. Eye patterns observed at 1.5 Gbps confirm the potential ability of the fabricated NRD-guide transceivers for high bit-rate, wireless applications.

Closed-form expressions for a crosstalk noise amplitude and worst-case delay in capacitively coupled two-line and three-line systems are derived assuming bus lines and other signal lines in a VLSI. Two modes are studied; a case that adjacent lines are driven from the same direction, and the other case that adjacent lines are driven from the opposite direction. Beside, a junction capacitance of a driver MOSFET is considered. The closed-form expressions are useful for circuit designers in an early stage of a VLSI design to give insight to interconnection problems. The expressions are extensively compared and fitted to SPICE simulations. The relative and absolute errors in the crosstalk noise amplitude are within 63.8% and 0.098 E (where E is a supply voltage), respectively. The relative error in the worst-case delay is less than 8.1%.

Congestion in WSN increases the energy dissipation rates of sensor nodes as well as the loss of packets and thereby hinders fair and reliable event detection. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic medium access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control and weighted round robin packet forwarding. We also propose in-node fair packet scheduling to achieve fair event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio even under bursty traffic condition which is good enough for reliable event perception.

In ubiquitous networks, Mobile Nodes (MNs) often suffer from performance degradation due to the following two reasons: (1) reduction of signal strength by the movement of an MN and intervening objects, and (2) radio interference with other WLANs. Therefore, handover initiation based on quick and reliable detection of the deterioration in a wireless link condition arising from the above two reasons is essential for achieving seamless handover. In previous studies, we focused on a handover decision criterion and described the problems related to the two existing decision criteria. Furthermore, we showed the effectiveness of the number of frame retransmissions through simulation experiments. However, a comparison of the signal strength and the number of frame retransmissions could not be examined due to the unreliability of the signal strength in simulations. Therefore, in the present paper, by employing FTP and VoIP applications, we compare the signal strength and the number of frame retransmissions as a handover decision criterion with experiments in terms of (1) and (2) in a real environment. Finally, we clarify the problem of the signal strength in contrast to the effectiveness of the number of frame retransmissions as a handover decision criterion.

In this paper, we consider consecutive burst transmission with burst loss recovery based on Forward Error Correction (FEC) in which redundant data is transmitted with multiple bursts. We propose two burst generation methods: Out-of Burst Generation (OBG) and In-Burst Generation (IBG). The OBG generates a redundant burst from redundant data, while the IBG reconstructs a burst from an original data block and a part of the redundant data. For both methods, the resulting bursts are transmitted consecutively. If some bursts among the bursts are lost at an intermediate node, the lost bursts can be recovered with the redundant data using FEC processing at the destination node. We evaluate by simulation the proposed methods in a uni-directional ring network and NSFNET, and compare the performances of the proposed methods with the extra-offset time method. Numerical examples show that the proposed methods can provide a more reliable transmission than the extra-offset time method for the OBS network where the maximum number of hops is large. Moreover, it is shown that the end-to-end transmission delay for our proposed methods can be decreased by enhancing the FEC processor or by increasing the number of FEC processors.

In this paper we propose a discrete program-size dependent software reliability growth model flexibly describing the software failure-occurrence phenomenon based on a discrete Weibull distribution. We also conduct model comparisons of our discrete SRGM with existing discrete SRGMs by using actual data sets. The program size is one of the important metrics of software complexity. It is known that flexible discrete software reliability growth modeling is difficult due to the mathematical manipulation under a conventional modeling-framework in which the time-dependent behavior of the cumulative number of detected faults is formulated by a difference equation. Our discrete SRGM is developed under an existing unified modeling-framework based on the concept of general order-statistics, and can incorporate the effect of the program size into software reliability assessment. Further, we discuss the method of parameter estimation, and derive software reliability assessment measures of our discrete SRGM. Finally, we show numerical examples of discrete software reliability analysis based on our discrete SRGM by using actual data.

Sensor networks are often deployed in unattended environments, thus leaving these networks vulnerable to false data injection attacks in which an adversary injects forged reports into the network through compromised nodes, with the goal of deceiving the base station or depleting the resources of forwarding nodes. Several research solutions have been recently proposed to detect and drop such forged reports during the forwarding process. Each design can provide the equivalent resilience in terms of node compromising. However, their energy consumption characteristics differ from each other. Thus, employing only a single filtering scheme for a network is not a recommendable strategy in terms of energy saving. In this paper, we propose a fuzzy-based adaptive filtering scheme selection method for energy saving. A fuzzy rule-based system is exploited to choose one of three filtering schemes by considering the false traffic ratio, the security threshold value, distance, and the detection power of the filtering scheme. The adaptive selection of the filtering schemes can conserve energy, and guarantee sufficient resilience.

In this paper, we propose a sequential type-based detection scheme for wireless sensor networks in the case of spatially and temporally identically and independently distributed observations. First, we investigate the optimal sequential detection rule of the proposed scheme, and then with the motivation of reducing the computational complexity of the optimal detection rule, we consider an approximation scheme and derive a suboptimal detection rule. We also compare the performances of the type-based sequential detection scheme with those of the non-sequential type-based detection scheme in terms of both average number of observations and total energy consumption, and determine the region of individual node power where the proposed scheme outperforms the non-sequential scheme. In addition, we show that the approximated detection rule provides the similar results as the optimal detection rule with a significant reduction of the computational complexity, which makes the approximated detection rule useful for real-time applications.

In this paper, a notch-band implemented UWB bandpass filter was proposed. The filter was realized by integrating a full ultra-wideband bandpass filter using broadside coupling structure with a bandstop filter using in-line open stub. The in-line open stub was installed in the removed area in the broadside coupled microstrip conductors, which demonstrated a narrow notch-band performance. The proposed filters were designed based on the electromagnetic simulation and fabricated using a wet etching system. Parameter study of length dependence of the notch-band was carried out. The first resonant frequency of the in-line stub appears when the length is approximately equal to one quarter of the guided wavelength. Based on this fact, the notch-band can be adjusted to almost any specified band in the UWB passband. A three-section notch-band implemented filter demonstrated good characteristics: its full frequency bandwidth form 2.8 GHz to 10.2 GHz, good insertion loss of 0.6 dB and 1.0 dB at the centers of the first and second bands respectively, and flat and small group delay of less than 0.40 ns over main pass band, and a large attenuation stopband about 55 dB at 5.63 GHz. A lowpass filter was also introduced in order to improve the out-band performance, by which the measured results show an excellent attenuation better than 30 dB from 10.4 GHz to 17.8 GHz.

This study presents a class of miniature parallel-coupled bandpass filters with good selectivity and stopband rejection. Capacitive terminations are introduced to the conventional anti-parallel coupled-lines, and lumped-element K-inverters are employed, to achieve both size reduction and spurious suppression. Additionally, the capacitive cross-coupling effect can be introduced to obtain three transmission zeros to enhance the selectivity. Suitable equivalent-circuit models, along with design formulae, are also established. Specifically, via design examples, this work demonstrates the feasibility of proposed filter structures in microstrip configuration. Compared to the conventional parallel-coupled filters, the proposed filters exhibit over 60% size reduction, improved selectivity, and wider stopbands up to four times the center frequency.

A new unified method is proposed to calculate the basic resonator parameters, i.e., the resonant frequency, external Q, unloaded Q and coupling coefficient in the time domain. By exciting the resonator from a weakly coupled external circuit, one can inject only a narrow resonant spectrum from the broad spectrum of the excitation pulse. The resonant frequency is easily counted by the number of zero crossings of the internal field intensity, whereas the Q's are calculated by the decay rate of the field amplitude. The coupling coefficient computed by the energy exchange rate between two resonators completes the new time domain algorithm.

A periodically loaded ultra wideband (UWB) bandpass filter based on the electromagnetic band-gap (EBG) concept is presented. Compact wideband filters with steep transition bands can be designed easily using this novel methodology. Unit cells in the EBG circuit model are realized by capacitive and inductive parallel loading of a transmission line. These unit cells are cascaded to realize bandpass filters whose bandwidth depends on the reactive loading of unit cells. The number of unit cells determines the steepness of the band edges of the filter. The main advantage lies in the fact that the size of unit cells can be small because electrical length of transmission line segments in unit cells can be chosen arbitrarily, hence the final filter structure becomes small in size. A microstrip filter with 60% bandwidth is designed and the physical size is compared with a conventional wideband bandpass filter designed with quarter wavelength admittance inverters.

This paper presents a free access mat consisting of tightly coupled double layered microstrip resonator array to provide an easy access for devices in short range wireless communications. While in a conventional wireless access system the electromagnetic wave is radiated from a device to another through the free space using built-in antennas, the proposed wireless access system uses the free access mat to propagate the wave and the proximate coupling between the waveguide and the devices. The propagation loss in the mat is small, which is demonstrated by numerical simulation for basic elements of the free access mat. We also demonstrate small transmission loss including the coupling loss between dipole antennas and the free access mat. Finally experimental confirmation for all demonstrated characteristics is provided so that the free access mat is effective as a novel waveguide for a short range wireless access systems.

This paper proposes a behavioral level partitioning method for efficient behavioral synthesis from a large sequential program consisting of a set of functions. Our method optimally determines functions to be inlined into the main module and the other functions to be synthesized into sub modules in such a way that the overall datapath is minimized while the complexity of individual modules is lower than a certain level. The partitioning problem is formulated as an integer programming problem. Experimental results show the effectiveness of the proposed method.

We previously proposed a method of sound source and microphone localization. The method estimates the locations of sound sources and microphones from only time differences of arrival between signals picked up by microphones even if all their locations are unknown. However, there is a problem that some estimation results converge to local minimum solutions because this method estimates locations iteratively and the error function has multiple minima. In this paper, we present a new iterative method to solve the local minimum problem. This method achieves accurate estimation by selecting effective initial locations from many random initial locations. The computer simulation and experimental results demonstrate that the presented method eliminates most local minimum solutions. Furthermore, the computational complexity of the presented method is similar to that of the previous method.

This paper proposes new scheduling methods for asynchronous circuits with bundled-data implementations. Since operations in asynchronous circuits start after the completion of a previous operation, this method approximates the set of start times for each operation using the delay of the resources. Next, this method decides on control steps from the approximated sets of start times, which are used in scheduling algorithms. This paper extends two scheduling algorithms used for synchronous circuits so that the approximated sets of start times and the decided control steps are used. Finally, this paper shows the effectiveness of our proposed methods by comparing scheduling results with ones obtained by the original two scheduling algorithms.

A temporal correlation based port combination algorithm that customizes the router design in Network-on-Chip (NoC) is proposed for reconfigurable systems in order to minimize required hardware amount. Given the traffic characteristics of the target application and the expected hardware amount reduction rate, the algorithm automatically makes the port combination plan for the networks. Since the port combination technique has the advantage of almost keeping the topology including two-surface layout, it does not affect the design of the other layer, such as task mapping and scheduling. The algorithm shows much better efficiency than the algorithm without temporal correlation. For the multimedia stream processing application, the algorithm can save 55% of the hardware amount without performance degradation, while the none temporal correlation algorithm suffers from 30% performance loss.

Many devices are expected to be networked with wireless appliances such as radio frequency identification (RFID) tags and wireless sensors, and the number of such appliances will greatly exceed the number of PCs and mobile telephones. This may lead to an essential change in the network architecture. This paper proposes a new network architecture called the appliance defined ubiquitous network (ADUN), in which wireless appliances will be networked without network protocol standards. Radio space information rather than individual appliance signals is carried over the ADUN in the form of a stream with strong privacy/security control. It should be noted that this is different from the architectural principles of the Internet. We discuss a network-appliance interface that is sustainable over a long period, and show that the ADUN overhead will be within the scope of the broadband network in the near future.