Total Coloring of G×Pn and G×Cn

It is proved that if G is a (△+1)-colorable graph, so are the graphs G×Pn and C×Cn, where Pn and Cn are respectively the path and cycle with n vertices, and △ the maximum edge degree of the graph. The exact chromatic numbers of the product graphs Pr1×Pr1×...×Prn× and C3k×C2m1×C2m2×...×C2mn are also presented. Thus the total coloring conjecture is proved to be true for many other graphs.     

The k-Diameter of a Kind of Circulant Graph

The terminology and notion in this paper are similar to Ref.[1], all graphs discussed here are finite and simple. The diameter d(G) of a graph G is the maximal distance between pairs of vertices of G. The connectivity of G is the minimum number of vertices needed to be removed in order to disconnect the graph. When a network is modeled as a graph,a vertex represents a node of processor (or a station) and an edge between two vertices is the link (or connection) between those two processors. I…     

Application of Rollout Strategy to Test Points Selection for Integer-Coded Fault Wise Table

Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.     

PGSLM: Edge-Enabled Probabilistic Graph Structure Learning Model for Traffic Forecasting in Internet of Vehicles

With the rapid development of the 5G communications, the edge intelligence enables Internet of Vehicles(IoV) to provide traffic forecasting to alleviate traffic congestion and improve quality of experience of users simultaneously. To enhance the forecasting performance, a novel edge-enabled probabilistic graph structure learning model(PGSLM) is proposed,which learns the graph structure and parameters by the edge sensing information and discrete probability distribution on the edges of the traffi...     

应用于60-GHz无线通信的全差分锁相环频率综合器

A 40-GHz phase-locked loop(PLL) frequency synthesizer for 60-GHz wireless communication applications is presented. The electrical characteristics of the passive components in the VCO and LO buffers are accurately extracted with an electromagnetic simulator HFSS. A differential tuning technique is utilized in the voltage controlled oscillator(VCO) to achieve higher common-mode noise rejection and better phase noise performance. The VCO and the divider chain are powered by a 1.0 V supply while the phase-frequency detector(PFD)and the charge pump(CP) are powered by a 2.5 V supply to improve the linearity. The measurement results show that the total frequency locking range of the frequency synthesizer is from 37 to 41 GHz, and the phase noise from a 40 GHz carrier is –97.2 d Bc/Hz at 1 MHz offset. Implemented in 65 nm CMOS, the synthesizer consumes a DC power of 62 m W, including all the buffers.     

STATE SPACE TREE METHOD AND EXACT DECOMPOSITION ALGORITHM FOR FINDING NETWORK OVERALL RELIABILITY

First,the state space tree method for finding communication network overall re-liability is presented.It directly generates one disjoint tree multilevel polynomial of a networkgraph.Its advantages are smaller computational effort(its computing time complexity is O(en_l),where e is the number of edges and n_l is the number of leaves)and shorter resulting expression.Second,based on it an exact decomposition algorithm for finding communication network overallreliability is presented by applying the hypergraph theory.If we use it to carry out the m-timedecomposition of a network graph,the communication network scale which can be analyzed by acomputer can be extended to m-fold.     

A Kernel PCA Shape Prior and Edge Based MRF Image Segmentation

We introduce both shape prior and edge information to Markov random field (MRF) to segment target of interest in images.Kernel Principal component analysis (PCA) is performed on a set of training shapes to obtain statistical shape representation.Edges are extracted directly from images.Both of them are added to the MRF energy function and the integrated energy function is minimized by graph cuts.An alignment procedure is presented to deal with variations between the target object and shape templates.Edge information makes the influence of inaccurate shape alignment not too severe,and brings result smoother.The experiments indicate that shape and edge play important roles for complete and robust foreground segmentation.     

一款应用于生物传感器的1.2V-600nW 12bit 2kS/s的增量型模数转换器

This paper presents an ultra-low power incremental ADC for biosensor interface circuits.The ADC consists of a resettable second-order delta–sigma(°/ modulator core and a resettable decimation filter.Several techniques are adopted to minimize its power consumption.A feedforward path is introduced to the modulator core to relax the signal swing and linearity requirement of the integrators.A correlated-double-sampling(CDS)technique is applied to reject the offset and 1/f noise,thereby removing the integrator leakage and relaxing the gain requirement of the OTA.A simple double-tailed inverter-based fully differential OTA using a thick-oxide CMOS is proposed to operate in the subthreshold region to fulfill both an ultra-low power and a large output swing at 1.2 V supply.The signal addition before the comparator in the feedforward architecture is performed in the current domain instead of the voltage domain to minimize the capacitive load to the integrators.The capacitors used in this design are of customized metal–oxide–metal(MOM) type to reach the minimum capacitance set by the k T =C noise limit.Fabricated with a 1P6 M 0.18 m CMOS technology,the presented incremental ADC consumes600 n W at 2 k S/s from a 1.2 V supply,and achieves 68.3 d B signal to noise and distortion ratio(SNDR) at the Nyquist frequency and an FOM of 0.14 p J/conversion step.The core area is 100120 m2.     

Practical algorithms for tornado codes

Tornado codes have been used in the error control of data transmission in IP network. The efficiency of this erasure codes is critically affected by the short cycles in its bipartite graph. To remove this effect, two algorithms are introduced： （1） while generating the graph, the cycle eliminating algorithm is used to reduce the number of the short cycles in it; （2） in the decoding algorithm, cycles that are inevitably in the graph are used to remove decoding efficiency degradation. The simulation results show that they have a better performance than that of general tornado codes.     

k-Diameter of Circulant Graph with Degree 3

Parameters k-distance and k-diameter are extension of the distance and the diameter in graph theory. In this paper, the k-distance dk （x,y） between the any vertices x and y is first obtained in a connected circulant graph G with order n （n is even） and degree 3 by removing some vertices from the neighbour set of the x. Then, the k-diameters of the connected circulant graphs with order n and degree 3 are given by using the k-diameter dk （x,y）.     

Dimensionality Reduction for Hyperspectral Data Based on Sample-Dependent Repulsion Graph Regularized Auto-encoder

To achieve high classification accuracy of hyperspectral data, a dimensionality reduction algorithm called Sample-dependent repulsion graph regularized auto-encoder (SRGAE) is proposed. Based on the sample-dependent graph, by applying the repulsion force to the samples from different classes but nearby, a sampledependent repulsion graph is built to make the samples from the same class will be projected to samples that are close-by and the samples from different classes will be projected to samples that are far away. The sampledependent repulsion graph can avoid the neighborhood parameter selection problem existing in the nearest neighborhood graph. By integrating advantages of deep learning and graph regularization technique, the SRGAE can maintain the learned deep features are consistent with the inherent manifold structure of the original hyperspectral data. Experimental results on two real hyperspectral data show that, when compared with some popular dimensionality reduction algorithms, the proposed SRGAE can yield higher classification accuracy.     

Design and Fabrication of Hybrid Piezomotor Applied in Precision Positioning Devices

The motor＇s configuration is designed and the dynamic analysis equations based on its simplified model are deduced. A testing system utilizing grating is set up to test this new motor, and the theoretical movement principle for the motor is proved by experiments. The pulse waveforms are applied to drive the motor to move in steps. The motor has a displacement resolution of 10 nm and a maximum velocity of 0.6 mm/ s. It can drive a 200 g slider whose range is 20 mm. A one-dimensional precision positioning platform is fabricated by using the new hybrid piezoelectric motor. The prototype is made up of two servomotors and two piezoelectric motors, which are controlled automatically by a computer. The positioning range of the platform is 10 cm.     

Operators of Approximations and Approximate Power Set Spaces

The concept of a rough set was introduced by Pawlak in 1982[1]. Studies of rough set theory may be divided into two classes, operator-oriented and set-oriented views[2, 3]. The operator-oriented view interprets lower and upper approximations as a pair of unary set-theoretic operators on the power of the universe. While the set-oriented view thinks there are no standard set-theoretic operators, so the rough set theory is an extension of classical set algebra. The two views are relative to moda…     

Analysis of an improved Lyot depolarizer in terms of the multi-beam superposition treatment

In order to study the depolarization properties of an improved Lyot depolarizer with monochromatic light, the theory of multi-beam superposition is adopted. The dependences of degree of depolarization (D) on vibration azimuth angle (VAA) and total retardation (TR) are analyzed. The results show that D is ideal for any VAA when TR is δ=(N+1/2)π (N is an integer) on the basis of wedge angle large enough. And when δ=Nπ, VAA makes the most significant impact on D. When δ is assigned to the other values, the impact on D made by VAA is between the former two. Using a 405 nm semiconductor laser, experiments for measuring D of the sample with wedge angle of 6° are conducted. The theo-retical results are well verified by experiments. D is over 98.8% when TR is nearly δ=(N+1/2)π by changing the incident angle.     

Optimal Test Points Selection Based on Multi-Objective Genetic Algorithm

A new approach to select anoptimal set of test points is proposed. The described method uses fault-wise table and multi-objective genetic algorithm to find the optimal set of test points. First, the fault-wise table is constructed whose entries are measurements associated with faults and test points. The selection of optimal test points is transformed to the selection of the columns that isolate the rows of the table. Then, four objectives are described according to practical test requirements. The multi-objective genetic algorithm is explained. Finally, the presented approach is illustrated by a practical example. The results indicate that the proposed method can efficiently and accurately find the optimal set of test points and is practical for large scale systems.     

ON THE ANALYSIS OF SWITCHED CAPACITOR NETWORKS USING EQUIVALENT NETWORKS IN THE z-DOMAIN

The approach using the equivalent networks in the z-domain to analyze switched capacitor(SC)networks is very attractive.The proposed analysis method in this paper permits calculationof the frequency response of SC networks by means of the signal flow graph(SFG).In the first placethe equivalent network is derived by applying a group of basic building blocks which are obtained underthe consideration of generality and practicability.At the same time some specified transformationsare proposed,with which the basic building blocks can be greatly expanded to fit into direct use.Thesetransformations are also found to be useful in designing SC filters.The application of the well-knownSFG facilitates the derivation of discrete transfer functions.Furthermore the sensitivity of SC net-work can be calculated with a simple topological formula.The whole work can be done by inspec-tion;this is the highlight.     

Improved Algorithm for Solving Discrete Logarithm Problem by Expanding Factor

The discrete logarithm problem(DLP)is to find a solution n such that g^n=h in a finite cyclic group G=,where h∈G.The DLP is the security foundation of many cryptosystems,such as RSA.We propose a method to improve Pollard’s kangaroo algorithm,which is the classic algorithm for solving the DLP.In the proposed algorithm,the large integer multiplications are reduced by controlling whether to perform large integer multiplication.To control the process,the tools of expanding factor and jumping distance are introduced.The expanding factor is an indicator used to measure the probability of collision.Large integer multiplication is performed if the value of the expanding factor is greater than the given bound.The improved algorithm requires an average of(1.633+o(1))q(1/2)times of the large integer multiplications.In experiments,the average large integer multiplication times is approximately(1.5+o(1))q(1/2).     

THE ANALYSIS METHOD OF THE SETS OF BRANCHES BASED ON INDEPENDENT LOOPS IN THE ELECTRIC NETWORK

The matrix D describing relations of the loops to the nodes in the graph and also the setsof branches based on the independent loops and their matrix Q are defined.The theorem in whichthe product of the loop-node matrix D multiplied by the incidence matrix A_a is equal to matrix Qis put forward and proved.The admittance matrix Y_(lc) of the sets of the branches is defined and it isassumed that the vector V_(lc) of voltage of the sets of branches to be a calculative quantity.The equa-tion of the sets of branches is derived and the analysis method of the sets of branches based on theindependent loops in the electric network is presented.     

一种高可靠性、低功耗单节锂电池保护电路

A single lithium-ion battery protection circuit with high reliability and low power consumption is proposed.The protection circuit has high reliability because the voltage and current of the battery are controlled in a safe range.The protection circuit can immediately activate a protective function when the voltage and current of the battery are beyond the safe range.In order to reduce the circuit’s power consumption,a sleep state control circuit is developed.Additionally,the output frequency of the ring oscillation can be adjusted continuously and precisely by the charging capacitors and the constant-current source.The proposed protection circuit is fabricated in a 0.5 m mixed-signal CMOS process.The measured reference voltage is 1.19 V,the overvoltage is 4.2 V and the undervoltage is 2.2 V.The total power is about 9 W.     

Codec Negotiation Technologies for 3G

The different formats of codec stream carried in the radio access network and the core network make the double speech encoding/decoding necessary, which degrades the speech quality. Accordingly, codec negotiation technologies are necessary for unifying encoding/ decoding in the whole process. Transcoder Free Operation (TrFO), Tandem Free Operation (TFO), and network quality deciding technology are the leading codec negotiation technologies. The TrFO is a mechanism for optimum selection during the establishment of a call. It tries to establish connection between User Equipment (UE) without Transcoder (TC). Its successful fulfillment enables the efficient utilization of bandwidth. The TFO, a standby technology of TrFO, is the negotiation technology of an in-band codec. With it, the user codec stream is free from the compression and decompression by the voice codec, and the quality of voice can accordingly be improved. The network-quantity deciding technology adopts G.711 or G.729 flexibly according to the number of accessed calls. This allows the access of new calls while won’t increase the load of network too much.