I-WAP: an intelligent WAP site management system

The popularity regarding wireless communications is such that more and more WAP sites have been developed with wireless markup language (WML). Meanwhile, to translate hypertext markup language (HTML) pages into proper WML ones becomes imperative since it is difficult for WAP users to read most contents designed for PC users via their mobile phone screens. However, for those sites that have been maintained with hypertext markup language (HTML), considerable time and manpower costs will be incurred to rebuild them with WML. In this paper, we propose an intelligent WAP site management system to cope with these problems. With the help of the intelligent management system, the original contents of HTML Web sites can be automatically translated to proper WAP content in an efficient way. As a consequence, the costs associated with maintaining WAP sites could be significantly reduced. The management system also allows the system manager to define the relevance of numerals and keywords for removing unimportant or meaningless contents. The original contents will be reduced and reorganized to fit the size of mobile phone screens, thus reducing the communication cost and enhancing readability. Numerical results gained through various experiments have evinced the effective performance of the WAP management system.     

Multi-Channel Assignment Schemes and Handoff Study in CDMA Cellular Systems

The CDMA system promisingly provides more capacity than AMPS. However, providing multi-channels for a CDMA system is requisite for satisfying the demand of capacity. In this paper, three schemes of multi-channel assignment are proposed. Based on computer simulation, performance measures, e.g. blocking probabilities, the overall capacity, the capacity of each channel, and the number of re-accesses, are obtained. Since the same frequency channel may be assigned to two adjacent cells, the effect of soft handoff is also considered. Numerical results demonstrate that scheme 3 (i.e., the random re-selection scheme) performs the best of the proposed three schemes because it provides the highest system capacity while keeping the cost of accessing channels (i.e., in terms of number of channel accesses) to a minimum.     

Comprehensive study on a novel bidirectional tunnelingprogram/erase NOR-type (BiNOR) 3-D flash memory cell

In this paper a recently proposed bidirectional tunneling program/erase (P/E) NOR-type (BiNOR) flash memory is extensively investigated. With the designated localized p-well structure, uniform Fowler-Nordheim (FN) tunneling is first fulfilled for both program and erase operations in NOR-type array architecture to facilitate low power applications. The BiNOR flash memory guarantees excellent tunnel oxide reliability and is provided with fast random access capability. Furthermore, a three-dimensional (3D) current path in addition to the conventional two-dimensional (2D) conduction is proven to improve the read performance. The BiNOR flash memory is thus promising for low-power, high-speed, and high-reliability nonvolatile memory applications     

Thermally Controlled,Patterned Graphene Transfer Printing for Transparent and Wearable Electronic/Optoelectronic System

Graphene has been highlighted as a platform material in transparent electronics and optoelectronics, including flexible and stretchable ones, due to its unique properties such as optical transparency, mechanical softness, ultrathin thickness, and high carrier mobility. Despite huge research efforts for graphene‐based electronic/optoelectronic devices, there are remaining challenges in terms of their seamless integration, such as the high‐quality contact formation, precise alignment of micrometer‐scale patterns, and control of interfacial‐adhesion/local‐resistance. Here, a thermally controlled transfer printing technique that allows multiple patterned‐graphene transfers at desired locations is presented. Using the thermal‐expansion mismatch between the viscoelastic sacrificial layer and the elastic stamp, a “heating and cooling” process precisely positions patterned graphene layers on various substrates, including graphene prepatterns, hydrophilic surfaces, and superhydrophobic surfaces, with high transfer yields. A detailed theoretical analysis of underlying physics/mechanics of this approach is also described. The proposed transfer printing successfully integrates graphene‐based stretchable sensors, actuators, light‐emitting diodes, and other electronics in one platform, paving the way toward transparent and wearable multifunctional electronic systems.     

A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

During the last decade, a plentiful number of active queue management schemes have been proposed, but their main objectives are simply allocating the buffer resource to all flows evenly, or protecting responsive flows from being degraded by unresponsive flows. However, the sending rates of the responsive flows can be determined diversely, and not all unresponsive flows have aggressively high sending rates. Furthermore, it is rational to reserve a portion of the buffer resource for certain privileged traffic. Grounded by these evidences, in this paper, we present a resilient active queue management algorithm, named Prior‐Core‐based Buffer Allocation considering diverse congestion control algorithms, fair‐unresponsive flows, and some privileged traffic. Our approach is based on stochastic cooperative game theory, where the payoffs yielded by cooperation are described by random variables, and the core is defined only over the distribution of these random payoffs; the core in this situation is called the prior‐core. As a result, it is shown that our buffer allocation, yielded by the prior‐core, achieves completely fair allocation for those flows whose requirement does not exceed the fair‐share regardless of the responsiveness, whereas aggressive flows are restricted according to availability of the buffer; all these are verified through ns‐2 simulation experiments. Copyright © 2014 John Wiley & Sons, Ltd.     

Layout Driven Selection and Chaining of Partial Scan Flip-Flops

In an era of sub-micron technology, routing is becoming a dominant factor in area, timing, and power consumption. In this paper, we study the problem of selection and chaining of scan flip-flops with the objective of achieving minimum routing area overhead. Most of previous work on partial scan has put emphasis on selecting as few scan flip-flops as possible to break all cycles in S-graph. However, the flip-flops that break more cycles are often the ones that have more fanins and fanouts. The area adjacent to these nodes is often crowded in layout. Such selections will cause layout congestion and increase the number of tracks to chain the scan flip-flops. To take layout information into consideration, we propose a matching-based algorithm to solve the problem. First, an initial placement will be performed before scan flip-flops are selected. Then, iteratively, a matching-based algorithm taking the current layout into account is proposed to select and chain the scan flip-flops. Experimental results show that, on the average, our algorithm can reduce 8.1% area overhead as compared with the previously proposed methods that do not utilize the layout information in flip-flop selection.     

Output probability from a general combinational network

In this paper, we present the method which calculates the probability of the output of a general combinational network being 1, when the probabilities is given for each input being 1. Also we present the method which derives the output probability expression in terms of a given set of input probabilities.The method is based on a basic probability axiom and Binary Decision Diagrams. A Boolean function for a combinational network is transformed into a Binary Decision Diagram and the output probability expression is derived from it. Therefore a derivation of the output probability for a combinational network can be straightforward. Some examples are showed that the method using Binary Decision Diagrams is simple and efficient. We can see a variation of the output probability for a combinational network according to the given set of input probabilities.     

Cavity length and absorption dependent longitudinal beat in iodine photodissociation laser

As the cavity length of the iodine photodissociation laser (iodine PDL) is varied, the number of neighboring coherent modes increases and the time-dependent mode-competition effect gives rise to typical changes in the pulse shape. The ratio of the number of all coherent modes to that of all oscillating modes is found to be as high as 80 percent when the cavity length is 450 cm. The frequency width in which the neighboring modes are coherent is approximately 0.1 GHz for all cavity lengths used. The effect of a BDN absorber placed in the cavity is distinct in the shorter cavities.     

Grain Size Control of Tetragonal Zirconia Polycrystals Using the Space Charge Concept

Grain growth kinetics and grain-boundary segregation of 12Ce-TZP and 2Y-TZP, containing divalent to pentavalent cationic dopants, were studied. In all cases, normal grain growth follwing the parabolic growth relation was observed at higher temperatures. The mobility of grain boundaries was suppressed by the addition of divalent and trivalent cations, unchanged or enhanced by the addition of tetravalent and pentavalent cations. Larger cations have a stronger effect in suppressing grain growth. From ESCA, AES, and STEM analysis of the near grain-boundary regions, it is further concluded that only divalent and trivalent cations segregate. These observations can be satisfactorily rationalized using the space charge concept and the model of impurity drag.