We describe wavelength-routed switching technology for 25-Gbit/s optical packets using a tunable transmitter that monolithically integrates a parallel-ring-resonator tunable laser and an InGaAlAs electro-absorption modulator (EAM). The transmitter provided accurate wavelength tunability with 100-GHz spacing and small output power variation. A 25-Gbit/s burst-mode optical-packet data was encoded onto the laser output by modulating the integrated EAM with a constant voltage swing of 2 V at 45$^{circ}$C. Clear eye openings were observed at the output of the 100 GHz-spaced arrayed-waveguide grating with error-free operation being achieved for all packets. The tunable transmitter is very promising for realizing a high-speed, large-port-count and energy-efficient wavelength-routing switch that enables the forwarding of 100-Gbit/s optical packets.

Electromagnetic scattering problems of canonical 2D structures can be analyzed with a high degree of accuracy by using the point matching method with mode expansion. In this paper, we will extend our previous method to 3D electromagnetic scattering problems and investigate the radar cross section of spherical shells and the computational accuracy.

In this letter, a novel antenna selection (AS) technique is proposed for the downlink of large-scale multi-user multiple input multiple output (MU-MIMO) networks, where a base station (BS) is equipped with large-scale antennas (N) and communicates simultaneously with K(K ≪ N) mobile stations (MSs). In the proposed scheme, the S antennas (S ≤ N) are selected by utilizing the concept of a sliding window. It is shown that the sum-rate of our proposed scheme is comparable to that of the conventional scheme, while the proposed scheme can significantly reduce the complexity of the BS.

A build system converts source code, libraries and other data into executable programs by orchestrating the execution of compilers and other tools. The whole building process is managed by a software build system, such as Make, Ant, CMake, Maven, Scons, and QMake. Many studies have investigated bugs and fixes in several systems, but to our best knowledge, none focused on bugs in build systems. One significant feature of software build systems is that they should work on various platforms, i.e., various operating systems (e.g., Windows, Linux), various development environments (e.g., Eclipse, Visual Studio), and various programming languages (e.g., C, C++, Java, C#), so the study of software build systems deserves special consideration. In this paper, we perform an empirical study on bugs in software build systems. We analyze four software build systems, Ant, Maven, CMake and QMake, which are four typical and widely-used software build systems, and can be used to build Java, C, C++ systems. We investigate their bug database and code repositories, randomly sample a set of bug reports and their fixes (800 bugs reports totally, and 199, 250, 200, and 151 bug reports for Ant, Maven, CMake and QMake, respectively), and manually assign them into various categories. We find that 21.35% of the bugs belong to the external interface category, 18.23% of the bugs belong to the logic category, and 12.86% of the bugs belong to the configuration category. We also investigate the relationship between bug categories and bug severities, bug fixing time, and number of bug comments.

This paper considers uplink interleave division multiple access (IDMA), of which crucial requirement is the proper operability at a very low signal-to-interference-plus-noise power ratio (SINR) range. The primary objectives of this paper are threefold: (1) to demonstrate the achievability of near-capacity performance of bit interleaved coded modulation with iterative detection (BICM-ID) using very low rate single parity check and irregular repetition (SPC-IrR) codes at a very low SINR range, and hence the technique is effective in achieving excellent performance when it is applied for IDMA, (2) to propose a very simple multiuser detection (MUD) technique for the SPC-IrR BICM-ID IDMA which does not incur heavy per-iteration computational burden, and (3) to analyze the impacts of power allocation on the convergence property of MUD as well as on the rate region, by using the extrinsic information transfer (EXIT) chart. The SPC-IrR code parameters are optimized by using the EXIT-constrained binary switching algorithm (EBSA) at a very low SINR range. Simulation results show that the proposed technique can achieve excellent near-capacity performance with the bit error rate (BER) curves exhibiting very sharp threshold, which significantly influences the convergence property of MUD. Furthermore, this paper presents results of the rate region analysis of multiple access channel (MAC) in the cases of equal and unequal power allocation, as well as of a counterpart technique. The results of the MAC rate region analysis show that our proposed technique outperforms the counterpart technique.

This paper proposes a simple and practical scheme to decide the direction of a phased array antenna beam in wireless access systems using Radio-over-Fiber (RoF) technique. The feasibility of the proposed scheme is confirmed by the optical and wireless transmission experiments using 2GHz RoF signals. In addition, two-dimensional steering operation in the millimeter-wave band is demonstrated for targeting future high-speed wireless communication systems. The required system parameters for practical use are also provided by investigating the induced transmission penalties. The proposed detection scheme is applicable to two-dimensional antenna beam steering in the millimeter-wave band by properly designing the fiber length and wavelength variable range.

In conventional networks, service control function and network control function work independently. Therefore, stereotypical services are provided via fixed routes or selected routes in advance. Recently, advanced network services have been provided by assortment of distributed components at low cost. Furthermore, service platform, which unifies componentized network control and service control in order to provide advanced services with flexibility and stability, has attracted attention. In near future, network management system (NMS) is promising, which replies an answer quickly for such advanced service platforms when route setting is requested with some parameters: quality of service (QoS), source and destination addresses, cost (money) and so on. In addition, the NMS is required to provide routes exploiting functions such as path computation element (PCE) actually. This paper proposes scalable network architecture that can quickly reply an answer by pre-computing candidate routes when route setting is requested to a control unit like an Autonomous System (AS). Proposed architecture can manage network resources scalably, and answer the availability of the requested QoS-aware path settings instantaneously for the forthcoming service platform that finds an adequate combination of a server and a route. In the proposed method, hierarchical databases are established to manage the information related to optical network solution and their data are updated at fewer times by discretized states and their boundaries with some margin. Moreover, with multiple and overlapped overlay, it pre-computes multiple candidate routes with different characteristics like available bandwidth and the number of hops, latency, BER (bit error rate), before route set-up request comes. We present simulation results to verify the benefits of our proposed system. Then, we implement its prototype using OpenFlow, and evaluate its effectiveness in the experimental environment.

This paper proposes a so called quasi-linear support vector machine (SVM), which is an SVM with a composite quasi-linear kernel. In the quasi-linear SVM model, the nonlinear separation hyperplane is approximated by multiple local linear models with interpolation. Instead of building multiple local SVM models separately, the quasi-linear SVM realizes the multi local linear model approach in the kernel level. That is, it is built exactly in the same way as a single SVM model, by composing a quasi-linear kernel. A guided partitioning method is proposed to obtain the local partitions for the composition of quasi-linear kernel function. Experiment results on artificial data and benchmark datasets show that the proposed method is effective and improves classification performances.

Coalition Structure Generation (CSG) means partitioning agents into exhaustive and disjoint coalitions so that the sum of values of all the coalitions is maximized. Solving this problem could be facilitated by employing some compact representation schemes, such as marginal contribution network (MC-net). In MC-net, the CSG problem is represented by a set of rules where each rule is associated with a real-valued weights, and the goal is to maximize the sum of weights of rules under some constraints. This naturally leads to a combinatorial optimization problem that could be solved with weighted partial MaxSAT (WPM). In general, WPM deals with only positive weights while the weights involved in a CSG problem could be either positive or negative. With this in mind, in this paper, we propose an extension of WPM to handle negative weights and take advantage of the extended WPM to solve the MC-net-based CSG problem. Specifically, we encode the relations between each pair of agents and reform the MC-net as a set of Boolean formulas. Thus, the CSG problem is encoded as an optimization problem for WPM solvers. Furthermore, we apply this agent relation-based WPM with minor revision to solve the extended CSG problem where the value of a coalition is affected by the formation of other coalitions, a coalition known as externality. Experiments demonstrate that, compared to the previous encoding, our proposed method speeds up the process of solving the CSG problem significantly, as it generates fewer number of Boolean variables and clauses that need to be examined by WPM solver.

Most images obtained with imaging sensors contain Bayer patterns and suffer from blurring caused by the lens. In order to convert a blurred Bayer-patterned image into a viewable image, demosaicing and deblurring are needed. These concepts have been major research areas in digital image processing for several decades. Despite their importance, their performance and efficiency are not satisfactory when considered independently. In this paper, we propose a joint deblurring and demosaicing method in which edge direction and edge strength are estimated in the Bayer domain and then edge adaptive deblurring and edge-oriented interpolation are performed simultaneously from the estimated edge information. Experimental results show that the proposed method produces better image quality than conventional algorithms in both objective and subjective terms.

In this paper, we consider a similarity control problem for plants and specifications, modeled as nondeterministic automata. This problem requires us to synthesize a nondeterministic supervisor such that the supervised plant is simulated by a given specification. We assume that a supervisor can observe not only the event occurrence but also the current state of the plant. First, we derive a necessary and sufficient condition for the existence of a complete supervisor, which is a solution to the similarity control problem. Then, we present a method for synthesizing a maximally permissive similarity enforcing supervisor when the existence condition is satisfied.

In a multi-user multiple-input multiple-output (MU-MIMO) system that adopts zero-forcing (ZF) as a precoder, the best selection is the combination of users who provide the smallest trace of the inverse of the channel auto-correlation matrix. Noting that the trace of the matrix is closely related to the determinant, we search for users that yield the largest determinant of their channel auto-correlation matrix. The proposed technique utilizes the determinant row-exchange criterion (DREC) for computing the determinant-changing ratio, which is generated whenever a user is replaced by one of a group of pre-selected users. Based on the ratio computed by the DREC, the combination of users providing the largest changing ratio is selected. In order to identify the optimal combination, the DREC procedure is repeated until user replacement provides no increase in the determinant. Through computer simulations of four transmit antennas, we show that the bit error rate (BER) per signal-to-noise ratio (SNR) as well as the sum-rate performance provided by the proposed method is comparable to that of the full search method. Furthermore, using the proposed method, a partial replacement of users can be performed easily with a new user who provides the largest determinant.

For next generation planar lightwave circuit (PLC) devices, high function and high-density integration are required as well as downsizing and cost reduction. To realize these needs, high refractive index difference between a core and a clad $(Delta)$ is required. To use PLC for practical applications, silica-based PLC is one of the most attractive candidate. However, degradation of the optical properties and productivity occur when $Delta$ of the core becomes high. Thus, $Delta$ of most of the conventional PLC with GeO$_2$-SiO$_2$ core is designed less than 2.5%. In this paper, we report a silica-based ultra-high $Delta $ PLC with ZrO$_2$-SiO$_2$ core. 5.5%-$Delta$ ZrO$_2$-SiO$_2$ PLC has been realized with low propagation loss and basic characteristics has been confirmed. Potential of chip size reduction of the ZrO$_2$-SiO$_2$ PLC is shown.

This paper proposes a new spectrum sharing scheme which uses one-sided collaboration. In the proposed system, the transmitter of the secondary system relays the primary signal and overlays its own data on the retransmitted primary signal. The results of the theoretical analysis show that the proposed scheme with regenerative relay allows the secondary system to communicate at the same speed as the primary system that disregards the presence of the secondary system.

We study non-malleability of multiple public-key encryption (ME) schemes. The main difference of ME from the threshold public-key encryption schemes is that there is no dealer to share a secret among users; each user can independently choose their own public-keys; and a sender can encrypt a message under ad-hoc multiple public keys of his choice. In this paper we tackle non-malleability of ME. We note that the prior works only consider confidentiality of messages and treat the case that all public keys are chosen by honest users. In the multiple public-key setting, however, some application naturally requires non-malleability of ciphertexts under multiple public keys including malicious users'. Therefore, we study the case and have obtained the following results:·We present three definitions of non-malleability of ME, simulation-based, comparison-based, and indistinguishability-based ones. These definitions can be seen as an analogue of those of non-malleable public-key encryption (PKE) schemes. Interestingly, our definitions are all equivalent even for the “invalid-allowing” relations. We note that the counterparts of PKE are not equivalent for the relations.·The previous strongest security notion for ME, “indistinguishability against strong chosen-ciphertext attacks (sMCCA)” [1], does not imply our notion of non-malleability against chosen-plaintext attacks.·Non-malleability of ME guarantees that the single message indistinguishability-based notion is equivalent to the multiple-message simulation-based notion, which provides designers a fundamental benefit.·We define new, stronger decryption robustness for ME. A non-malleable ME scheme is meaningful in practice if it also has the decryption robustness.·We present a constant ciphertext-size ME scheme (meaning that the length of a ciphertext is independent of the number of public-keys) that is secure in our strongest security notion of non-malleability. Indeed, the ciphertext overhead (i.e., the length of a ciphertext minus that of a plaintext) is the combined length of two group elements plus one hash value, regardless of the number of public keys. Then, the length of the partial decryption of one user consists of only two group elements, regardless of the length of the plaintext.

In data center networks, group communication is currently playing an important role and multicast communications is an effective way to support group communication for large numbers of virtual machines. Layer-2 congestion control named QCN (Quantized Congestion Notification) has been proposed to realize the high reliability required by LAN/SAN integration in data center networking. Our preliminary evaluation in this paper shows that a multicast flow suffers lower throughput than unicast flows when conventional QCN is applied in a naive manner. This is because a sending device receives congestion feedback from multiple locations on a multicast tree and decreases transmission rate accordingly. To counter this throughput degradation of multicast flows, we propose a new Layer 2 congestion control algorithm in multicast environment, Quantized Congestion Notification with Bottleneck Selection (QCN/BS). In QCN/BS, the switch in the worst congestion level is selected and the transmission rate of the sending device is calculated exclusively according to feedback from the selected switch. Simulation results show that when conventional QCN is used, a multicast flow experiences lower and more severely unfair throughput than a unicast flow. The proposed QCN/BS resolves this problem.

An RGB-LED driver with a pulse-skipping-modulation boost converter is proposed to fix the reference voltage for lowering down the circuit complexity. A high-voltage LDO and a bandgap reference circuit are built into the chip. The proposed converter outputs a different voltage in response to a different color of LEDs. The output voltages for driving six red, six green, and six blue LEDs in series are 13.5V, 20V, and 21.5V, respectively. The proposed LDO and bandgap reference circuit work with supply voltages from 8V to 12V. The settling time for changing colors is lower than 300µs, better than the unfixed-reference-voltage methods. The proposed circuit was fabricated by using 0.25-µm BCD 60V technology, and the chip area was 1.9 × 1.7mm2.

The proposed stimulus design for linearity test is embedded in a differential successive approximation register analog-to-digital converter (SAR ADC), i.e. a design for testability (DFT). The proposed DFT is compatible to the pattern generator (PG) and output response analyzer (ORA) with the cost of 12.4-% area of the SAR ADC. The 10-bit SAR ADC prototype is verified in a 0.18-µm CMOS technology and the measured differential nonlinearity (DNL) error is between -0.386 and 0.281 LSB at 1-MS/s.

This paper studies the design of cooperative beamforming (CB) and cooperative jamming (CJ) for the physical layer security of an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. The secrecy rate maximization (SRM) problem of such a network is to maximize the difference of two concave functions, a problem which is non-convex and has no efficient solution. Based on the inner convex approximation (ICA) and semidefinite relaxation (SDR) techniques, we propose two novel low-complexity schemes to design CB and CJ for SRM in the AF network. In the first strategy, relay nodes adopt the CB only to secure transmission. Based on ICA, this design guarantees convergence to a Karush-Kuhn-Tucker (KKT) solution of the SDR of the original problem. In the second strategy, the optimal joint CB and CJ design is studied and the proposed joint design can guarantee convergence to a KKT solution of the original problem. Moreover, in the second strategy, we prove that SDR always has a rank-1 solution for the SRM problem. Simulation results show the superiority of the proposed schemes.

Honeycomb structures are widely used in aerospace industry because of the lightweight and durable properties they provide. Here we propose to use a honeycomb core as the wave guiding structure in Radial Line Slot Antennas (RLSAs). This paper quantifies the propagation characteristics, especially the loss due to the honeycomb. At 32GHz, by choosing the proper cell size, both good isotropy and reasonably low effective dielectric constants are realized with the honeycomb as a spacer in a radial line waveguide. To estimate the material loss factor, several methods are compared and a factor of about 0.014∼0.018dB/mm is predicted and measured. A fabricated 90cm diameter honeycomb RLSA suffers about a 3.5∼5dB loss, which coincides with the estimates using the predicted loss factor.