检索结果-南通市图书馆

Chinese Journal of Structural Chemistry 2006年第10期25卷 1260-1264页

作者： WANG ying YAN lian-He School of Chemical Engineering Nanjing University of Science and Technology Nanjing Jiangsu 210094 China

The title compound has been prepared and characterized by elemental analysis, infrared and FT-Raman spectra, and thermal analysis. The crystal and molecular structures of bis（N＇-ethyl-N-piperazinly-carbodithioato-S,S＇） nickel（Ⅱ） complex （Ni（S2CNC4H8NC2H5）2） were determined by X-ray diffraction methods. The crystal crystallizes in the triclinic system, space group PI^- with a = 0.66770（15）, b = 0.85066（12）, c = 0.8973（2） nm,α= 84.97（2）, β =78.71（2）,γ= 80.12（2）°, Mr = 437.34, V= 0.49160（17） nm^3, Z = 1, Dc = 1.477 g/cm^3, F（000） = 230, R = 0.0422 and wR = 0.1290. In the structure, the central Ni atom is coordinated in a slightly distorted square plane by four S atoms from two bidentate S2CNC4H8NC2H5 ligands with the four Ni-S bond distances in the range of 0.22065（10）～0.22076（9） nm. The IR and FT-Raman spectral data are in agreement with the structural data. Thermal analysis indicates that the title compound decomposes completely at the temperature of 799.88℃, leaving NiS.

关键词： crystal structure N-ethylpiperazine nickel complex FT-Raman

List 2-distance Coloring of Planar Graphs with Girth Five

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2022年第3期38卷 540-548页

作者： Yin-dong JIN lian-ying MIAO School of Mathematics China University of Mining and TechnologyXuzhou 221116China

A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most two receive distinct colors.A list assignment of a graph G is a mapping L which assigns to each vertex v a set L(v)of positive *** list 2-distance chromatic number of G denoted byχ_(2)^(l)(G)is the least integer k for which G is list 2-distance *** this paper,we prove that every planar graph with g(G)≥5 and△(G)≥40 is list 2-distance(△(G)+4)-colorable.

关键词： 2-distance coloring list 2-distance coloring girth maximum degree

On the L_p-Dual Mixed Volumes

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2013年第9期29卷 1647-1654页

作者： lian ying CHEN Chang Jian ZHAO Department of Mathematics China Jiliang University

We establish the cyclic inequality for i-th L p-dual mixed volume and Lp-dual Urysohn inequality between p-mean width and Lp-dual quermassintegral. Moreover, the dual isoperimetric inequality for Lp-dual mixed volume ... 详细信息

关键词： Dual mixed volume Lp-dual mixed volume mean width Lp-mean width dual isoperi-metric inequality Lp-dual quermassintegral

Acyclic Edge Coloring of Triangle-free 1-planar Graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2015年第10期31卷 1563-1570页

作者： Wen Yao SONG lian ying MIAO Institute of Mathematics China University of Mining and TechnologyXuzhou

A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G, denoted by X＇a（G）, is the least number of colors such that G has an acyclic edge coloring. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that X＇a（G） ≤△ A（G）＋ 22, if G is a triangle-free 1-planar graph.

关键词： Acyclic chromatic index acyclic edge coloring 1-planar graph

The Distance Coloring of Graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2014年第9期30卷 1579-1587页

作者： lian ying MIAO Yi Zheng FAN Institute of Mathematics China University of Mining and Technology School of Mathematical Sciences Anhui University

Let G be a connected graph with maximum degree △≥ 3. We investigate the upper bound for the chromatic number Xr（G） of the power graph Gr. It was proved that Xr（G） ≤ △ （△-1）r-1/△-2 ＋1 =M ＋ 1, where the equality holds if and only if G is a Moore graph. If G is not a Moore graph, and G satisfies one of the following conditions：（1） G is non-regular, （2） the girth g（G）≤2r - 1, （3） g（G） ≥ 2r＋ 2, and the connectivity k（G） ≥ 3 if r ≥ 3, k（G）≥4 but g（G）〉 6 if r= 2, （4） A is sufficiently larger than a given number only depending on % then Xr（G） ≤ M - 1. By means of the spectral radius λ1（G） of the adjacency matrix of G, it was shown that X2（G） ≤λ1（G）2＋ 1, where the equality holds if and only if G is a star or a Moore graph with diameter 2 and girth 5, and Xr（G）〈 λ1（G）r＋ 1 if ≥ 3.

关键词： Distance coloring power graph spectral radius

Co-design for an SoC embedded network controller

在线全文

学校读者我要写书评

暂无评论

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2006年第4期7卷 591-596页

作者： ZOU lian-ying ZOU Xue-cheng Department of Electronic Science ＆ Technology Huazhong University of Science ＆ Technology Wuhan 430074 China

With the development of Ethernet systems and the growing capacity of modem silicon technology, embedded communication networks are playing an increasingly important role in embedded and safety critical systems. Hardware/software co-design is a methodology for solving design problems in processor based embedded systems. In this work, we implemented a new 1-cycle pipeline microprocessor and a fast Ethemet transceiver and established a low cost, high performance embedded network controller, and designed a TCP/IP stack to access the Intemet. We discussed the hardware/software architecture in the forepart, and then the whole system-on-a-chip on Altera Stratix EP1S25F780C6 device. Using the FPGA environment and SmartBit tester, we tested the system＇s throughput. Our simulation results showed that the maximum throughput of Ethemet packets is up to 7 Mbps, that of UDP packets is up to 5.8 Mbps, and that of TCP packets is up to 3.4 Mbps, which showed that this embedded system can easily transmit basic voice and video signals through Ethemet, and that using only one chip can realize that many electronic devices access to the Intemet directly and get high performance.

关键词： System-on-Chip (SoC) Embedded Microprocessor Network controller TCP/IP Co-design

THE APPLICATION OF COBB-DOUGLAS FUNCTION IN FORECASTING THE DURATION OF INTERNET PUBLIC OPINIONS CAUSED BY THE FAILURE OF PUBLIC POLICIES

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science and Systems Engineering 2018年第5期27卷 632-655页

作者： Xuefan Dong ying lian Ding Li Yijun Liu Institutes of Science and Development Chinese Academy of Sciences Beijing 100090 China University of Chinese Academy of Sciences Beijing 100190 China Institute of Development Southwest University of Finance and Economics Chengdu 610074 China

Gushes of Internet public opinions may trigger unexpected incidents that significantly affectsocial security and stability, especially for ones caused by the failure of public policies. Therefore,forecasting this kind of Interact public opinions is of great significance. The duration could be citedas one of the most direct indicators that can reflect the severity of a specific Internet public opinioncase. Based on this background, this paper aims to find the factors that may affect the duration of Internet public opinions, and accordingly proposes a model that can accurately predict the durationbefore the release of public policies. Specifically, an index system including 8 factors by consideringfour dimensions, namely, object, environment, reality （offline）, and the network （online）, isestablished. In addition, based on the dataset containing 23 typical Internet public opinion casescaused by the failure of public policies, 9 prediction models are gained by applying the multivariatelinear regression model, multivariate nonlinear regression model, and the Cobb-Douglas function.

关键词： Public policy internet public opinion multivariate linear regression model multivariatenonlinear regression model Cobb-Douglas production function

Neighbor Sum Distinguishing Total Coloring of Triangle Free IC-planar Graphs

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2020年第3期36卷 292-304页

作者： Wen Yao SONG Yuan Yuan DUAN lian ying MIAO School of Mathematics and Statistics Zaozhuang UniversityZaozhuang 277160P.R.C hina School of Mathematics China University of Mining and TechnologyXuzhou 221116P.R.C hina

A graph is IC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two crossed edges share no common end-vertex.A proper total-k-coloring of G is called neighbor sum distinguishing if∑_c(u)≠∑_c(v)for each edge uv∈E(G),where∑_c(v)denote the sum of the color of a vertex v and the colors of edges incident with *** least number k needed for such a total coloring of G,denoted byχ∑"is the neighbor sum distinguishing total chromatic *** and Wozniak conjecturedχ∑"(G)≤Δ(G)+3 for any simple graph with maximum degreeΔ(G).By using the famous Combinatorial Nullstellensatz,we prove that above conjecture holds for any triangle free IC-planar graph with△(G)≥***,it holds for any triangle free planar graph withΔ(G)≥6.

关键词： Neighbor sum distinguishing total coloring Combinatorial Nullstellensatz triangle free IC-planar graph maximum degree

List Injective Coloring of Planar Graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2022年第3期38卷 614-626页

作者： Yin-dong JIN lian-ying MIAO School of Mathematics China University of Mining and TechnologyXuzhou 221116China

A k-coloring of a graph G is a mapping c:V(G)→{1,2,···,k}.The coloring c is called injective if any two vertices have a common neighbor get distinct colors.A graph G is injectively k-choosable if for any color list L of admissible colors on V(G)of size k allows an injective coloringφsuch thatφ(v)∈L(v)for each v∈V(G).Letχ;(G),χ;(G)denote the injective chromatic number and injective choosability number of G,*** this paper,we show thatχ;(G)≤△+4 if△≥22 andχ;(G)≤△+5 if△≥15,where G is a triangle-free planar graph and without intersecting 4-cycles.

关键词： planar graph injective coloring list coloring

Power optimization and performance improvement for embedded Ethernet SOC

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2008年第2期15卷 102-106页

作者： ZHENG Zhao-xia ZOU lian-ying GAO Jun Research Center for VLSI and Systems Huazhong University of Science andTechnology Wuhan 430074 China School of Electric and information Engineering Wuhan Institute ofTechnology Wuhan 430074 China

Information appliance is the combination of traditional home appliances and the internet technology. In this article, an Ethernet controller system-on-chip （SOC） solution for information appliances is presented. To achieve high performance, the embedded 8 bits 8051 micro control unit （MCU） is optimized by an independent instruction bus and a data bus. Besides, a two-stage pipeline feature is added. Compared with the existing 8051 core, the enhanced one-cycle MCU offers ten times improvement in instruction execution efficiency. Meanwhile, the performance of media access control （MAC） circuit is greatly improved by adopting various techniques such as direct memory access （DMA） control, paging strategy, etc. To reduce the power consumption, clock gating, low power supply, and multi-working-clock are adopted. Moreover, to achieve rapid data communication in different clock frequency circuits, a simple ping-pong first in first out （FIFO） circuit is realized. The chip is implemented using TSMC 0.25 μm two-poly four-metal mixed signal complementary metal oxide semiconductor （CMOS） technology. Its die area is 4.8 min× 4.6 mm. The test results show that the maximum throughput of Ethernet packets can reach 7 Mb/s while the power consumption is rather low-the working current is just about 200 mA.

关键词： low power technology hardware/software co-design,circular buffer throughput