http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An Intelligent Input/Output System for Real-time Simulation
Jinshu, Su,Yizheng, Gao 대한전자공학회 1992 HICEC:Harbin International Conference on Electroni Vol.1 No.1
The intelligent I/O processing system and general interface become more and more important for hardware-in-the-loop simulation system. In the paper, an intelligent I/O processing system for real-time simulation is dicussed in detail. Case study show this system being flexible and effictive.
Jiankun Dong,Wenzhao Shi,Jinshu Liu,Shaofeng Lu,Hongjuan Zhou,Shanshan Cui,Manyan Zhang,Guoxin Su 한국섬유공학회 2023 Fibers and polymers Vol.24 No.9
Polyurethane phase change materials (PUPCMs) have been extensively applied in smart textiles and wearable electronic devices because of their excellent energy storage capacity. To realize the flexibility of PUPCMs for certain deformation and compact contact with objects, suitable support structures have been chosen to prepare polyurethane phase change composites (PUFPCCs) with energy storage capacity and device-level flexibility. In this work, PUPCM was prepared by the prepolymer method with polyethylene glycol (PEG) as the soft segment, 4,4-dicyclohexylmethane diisocyanate (HMDI) and 1,2-hexanediol as the hard segment. And polyurethane-based adhesives (PUA) were chosen to provide a support structure for PUFPCCs by physically blending and casting with prepared PUPCM. PUFPCCs showed good flexibility attributed to the film-forming performance of polyurethane-based adhesive in the composites. The chemical structure, crystallization properties, phase transformation properties and thermal stability of the prepared PUPCM and PUFPCCs were investigated via Fourier transform infrared spectroscopy (FT-IR), 1H NMR spectroscopy, X-ray diffraction (XRD), polarizing optical microscope (POM), differential scanning calorimetry (DSC) and thermogravimetric (TG) analysis respectively. The phase change temperature of PUFPCCs ranged from 36 to 40 ℃. The maximum enthalpy value of PUFPCCs was up to 40 J/g for daily application. Moreover, the thermal stability of PUPCM was improved attribute to the support structure of PUA in PUFPCCs. Therefore, the prepared PUFPCCs have great potential for application in flexible wearable devices due to their excellent flexibility, suitable phase transition temperature close to human body temperature, high enthalpy value and improved thermal stability.
Assessing Resilience of Inter-Domain Routing System under Regional Failures
( Yujing Liu ),( Wei Peng ),( Jinshu Su ),( Zhilin Wang ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.4
Inter-domain routing is the most critical function of the Internet. The routing system is a logical network relying on the physical infrastructure with geographical characteristics. Nature disasters or disruptive accidents such as earthquakes, cable cuts and power outages could cause regional failures which fail down geographically co-located network nodes and links, therefore, affect the resilience of inter-domain routing system. This paper presents a model for regional failures in inter-domain routing system called REFER for the first time. Based on REFER, the resilience of the inter-domain routing system could be evaluated on a finer level of the Internet, considering different routing policies of intra-domain and inter-domain routing systems. Under this model, we perform simulations on an empirical topology of the Internet with geographical characteristics to simulate a regional failure locating at a city with important IXP (Internet eXchange Point). Results indicate that the Internet is robust under a city-level regional failure. The reachability is almost the same after the failure, and the reroutings occur at the edge of the Internet, hardly affecting the core of inter-domain routing system.
PSSRC : A Web Service Registration Cloud Based on Structured P2P and Semantics
He, Qian,Zhao, Baokang,Chang, Liang,Su, Jinshu,You, Ilsun IGI Global 2016 International journal of data warehousing and mini Vol.12 No.2
<P>The Universal Description, Discovery and Integration (UDDI) registry is widely used for organizing Web services in the Internet, but it cannot meet the requirement of organizing massive Web services in the cloud computing environment. In this paper, a Web service registration cloud based on structured P2P and semantics (PSSRC) is presented. On the one hand, PSSRC works on a structured P2P overlay which is organized by using Pastry in multiple registration nodes, where each registration node is composed of seven modules namely system configuration, schedule and distribution, P2P communication, access and control, UDDI, resources monitoring, and semantic process. On the other hand, a semantic ontology database named WordNet is used to process semantic queries in PSSRC. PSSRC inherits the advantage of UDDI in that the registration and discovery of Web services are transparent to Web services providers. Furthermore, it is shown by experiment that the capacity of PSSRC can be extended dynamically, and both semantic queries and large scalable accesses are well supported.</P>
Assessing the Vulnerability of Network Topologies under Large-Scale Regional Failures
Wei Peng,Zimu Li,Yujing Liu,Jinshu Su 한국통신학회 2012 Journal of communications and networks Vol.14 No.4
Natural disasters often lead to regional failures that can cause network nodes and links co-located in a large geographical area to fail. Novel approaches are required to assess the network vulnerability under such regional failures. In this paper, we investigate the vulnerability of networks by considering the geometric properties of regional failures and network nodes. To evaluate the criticality of node locations and determine the critical areas in a network, we propose the concept of α-critical-distance with a given failure impact ratio α, and we formulate two optimization problems based on the concept. By analyzing the geometric properties of the problems, we show that although finding critical nodes or links in a pure graph is a NP-complete problem, the problem of finding critical areas has polynomial time complexity. We propose two algorithms to deal with these problems and analyze their time complexities. Using real city-level Internet topology data, we conducted experiments to compute the α-critical-distances for different networks. The computational results demonstrate the differences in vulnerability of different networks. The results also indicate that the critical area of a network can be estimated by limiting failure centers on the locations of network nodes. Additionally, we find that with the same impact ratio α, the topologies examined have larger α-critical-distances when the network performance is measured using the giant component size instead of the other two metrics. Similar results are obtained when the network performance is measured using the average two terminal reliability and the network efficiency, although computation of the former entails less time complexity than that of the latter.
Assessing the Vulnerability of Network Topologies under Large-Scale Regional Failures
Peng, Wei,Li, Zimu,Liu, Yujing,Su, Jinshu The Korea Institute of Information and Commucation 2012 Journal of communications and networks Vol.14 No.4
Natural disasters often lead to regional failures that can cause network nodes and links co-located in a large geographical area to fail. Novel approaches are required to assess the network vulnerability under such regional failures. In this paper, we investigate the vulnerability of networks by considering the geometric properties of regional failures and network nodes. To evaluate the criticality of node locations and determine the critical areas in a network, we propose the concept of ${\alpha}$-critical-distance with a given failure impact ratio ${\alpha}$, and we formulate two optimization problems based on the concept. By analyzing the geometric properties of the problems, we show that although finding critical nodes or links in a pure graph is a NP-complete problem, the problem of finding critical areas has polynomial time complexity. We propose two algorithms to deal with these problems and analyze their time complexities. Using real city-level Internet topology data, we conducted experiments to compute the ${\alpha}$-critical-distances for different networks. The computational results demonstrate the differences in vulnerability of different networks. The results also indicate that the critical area of a network can be estimated by limiting failure centers on the locations of network nodes. Additionally, we find that with the same impact ratio ${\alpha}$, the topologies examined have larger ${\alpha}$-critical-distances when the network performance is measured using the giant component size instead of the other two metrics. Similar results are obtained when the network performance is measured using the average two terminal reliability and the network efficiency, although computation of the former entails less time complexity than that of the latter.