“Algorithm Design and Analysis”is not only one of the important courses in the undergraduate teaching of computer science and technology but also a key part of computer professional skills.In recent years,with the r...“Algorithm Design and Analysis”is not only one of the important courses in the undergraduate teaching of computer science and technology but also a key part of computer professional skills.In recent years,with the rise and widespread application of big language models,many teaching reform plans have been produced to promote the quality and efficiency of teaching.This paper studies how to refer to software development professional skills standards,investigates the knowledge points of“Algorithm Design and Analysis”courses in other educational institutions,uses cutting-edge core technology big language models to drive the improvement of teaching evaluation methods,improves teaching efficiency,and carries out reforms and practices in teaching content for undergraduate students in computer science.展开更多
In this paper, a Web-based Mechanical Design and A na lysis Framework (WMDAF) is proposed. This WMADF allows designers to develop web -based computer aided programs in a systematic way during the collaborative mec han...In this paper, a Web-based Mechanical Design and A na lysis Framework (WMDAF) is proposed. This WMADF allows designers to develop web -based computer aided programs in a systematic way during the collaborative mec hanical system design and analysis process. This system is based on an emerg ing web-based Content Management System (CMS) called eXtended Object Oriented P ortal System (XOOPS). Due to the Open Source Status of the XOOPS CMS, programs d eveloped with this framework can be further customized to satisfy the demands of the user. To introduce the use of this framework, this paper exams three differ ent types of mechanical design and analysis problems. First, a repetitive design consideration and calculation process is transferred into WMADF programs to gai n efficiency for wired collaborative team. Second, the considered product solid model is created directly through the use of XOOPS program and Microsoft Compone nt Object Model (COM) instances. To the end of the paper, an example linked with ANSYS is used to indicate the possible application of this framework.展开更多
Here,a novel Au Wedge-enhanced Raman spectroscopy(WERS)substrate is proposed.The electric field enhancement factor and the effective mode field radius with varying geometry parameters are investigated.The proper excit...Here,a novel Au Wedge-enhanced Raman spectroscopy(WERS)substrate is proposed.The electric field enhancement factor and the effective mode field radius with varying geometry parameters are investigated.The proper excitation wavelength 633 nm is obtained.The practical application of WERS substrate is discussed.The Au WERS not only can provide a continuous extremely highly localized electric field as surface-enhanced Raman scattering(SERS)hotspots,but also can offer 10 orders of magnitude of SERS enhancement factor.The corresponding results reveal that WERS substrate will be widely applied in optics,biology,chemistry and other fields.展开更多
A flat-top interleaver,in which a mirror on one arm of the Michelson interferomefer is replaced by a G-T resonator,is proposed.In the interleaver,the parameters including the channel spacing of 50 GHz,ripple less than...A flat-top interleaver,in which a mirror on one arm of the Michelson interferomefer is replaced by a G-T resonator,is proposed.In the interleaver,the parameters including the channel spacing of 50 GHz,ripple less than 0.05 dB,-0.5 dB passband of 43 GHz(86% of the spacing),-30 dB stopband of 42 GHz(84% of the spacing),and a channel isolation higher than 40 dB,are achieved.展开更多
We theoretically demonstrate the imaging properties of a complex two-dimensional(2D) face-centered square lattice photonic crystal(PC) made from germanium cylinders in air background. The finitedifference time-domain(...We theoretically demonstrate the imaging properties of a complex two-dimensional(2D) face-centered square lattice photonic crystal(PC) made from germanium cylinders in air background. The finitedifference time-domain(FDTD) method is employed to calculate the band structure and simulate image construction. The band diagram of the complex structure is significantly compressed. Negative refraction occurs in the second energy band with negative phase velocity at a frequency of 0.228(2πc/a), which is lower than results from previous studies. Lower negative refraction frequency leads to higher image resolution. Numerical results show that the spatial resolution of the system reaches 0.7296λ, which is lower than the incident wavelength.展开更多
A compact optical flip-flop with a directional coupler has been designed and analyzed. Using a narrow gap directional coupler, we have predicted the device length could be reduced down to 500μm from 1300μm.
Parity–time(PT) symmetry has been demonstrated in the frame of classic optics. Its applications in laser science have resulted in unconventional control and manipulation of resonant modes. PT-symmetric periodic circu...Parity–time(PT) symmetry has been demonstrated in the frame of classic optics. Its applications in laser science have resulted in unconventional control and manipulation of resonant modes. PT-symmetric periodic circular Bragg lasers were previously proposed. Analyses with a transfer-matrix method have shown their superior properties of reduced threshold and enhanced modal discrimination between the radial modes. However, the properties of the azimuthal modes were not analyzed, which restricts further development of circular Bragg lasers. Here, we adopt the coupled-mode theory to design and analyze chirped circular Bragg lasers with radial PT symmetry. The new structures possess more versatile modal control with further enhanced modal discrimination between the azimuthal modes. We also analyze azimuthally modulated circular Bragg lasers with radial PT symmetry, which are shown to achieve even higher modal discrimination.展开更多
During this decade,many countries have experienced natural and accidental disasters,such as typhoons,floods,earthquakes,and nuclear plant accidents,causing catastrophic damage to infrastructures.Since the end of 2019,...During this decade,many countries have experienced natural and accidental disasters,such as typhoons,floods,earthquakes,and nuclear plant accidents,causing catastrophic damage to infrastructures.Since the end of 2019,all countries of the world are struggling with the COVID-19 and pursuing countermeasures,including inoculation of vaccine,and changes in our lifestyle and social structures.All these experiences have made the residents in the affected regions keenly aware of the need for new infrastructures that are resilient and autonomous,so that vital lifelines are secured during calamities.A paradigm shift has been taking place toward reorganizing the energy social service management in many countries,including Japan,by effective use of sustainable energy and new supply schemes.However,such new power sources and supply schemes would affect the power grid through intermittency of power output and the deterioration of power quality and service.Therefore,new social infrastructures and novel management systems to supply energy and social service will be required.In this paper,user-friendly design,operation and control assist tools for resilient microgrids and autonomous communities are proposed and applied to the standard microgrid to verify its effectiveness and performance.展开更多
With the development and implementation of performance-based earthquake engineering,harmonization of performance levels between structural and nonstructural components becomes vital. Even if the structural components ...With the development and implementation of performance-based earthquake engineering,harmonization of performance levels between structural and nonstructural components becomes vital. Even if the structural components of a building achieve a continuous or immediate occupancy performance level after a seismic event,failure of architectural,mechanical or electrical components can lower the performance level of the entire building system. This reduction in performance caused by the vulnerability of nonstructural components has been observed during recent earthquakes worldwide. Moreover,nonstructural damage has limited the functionality of critical facilities,such as hospitals,following major seismic events. The investment in nonstructural components and building contents is far greater than that of structural components and framing. Therefore,it is not surprising that in many past earthquakes,losses from damage to nonstructural components have exceeded losses from structural damage. Furthermore,the failure of nonstructural components can become a safety hazard or can hamper the safe movement of occupants evacuating buildings,or of rescue workers entering buildings. In comparison to structural components and systems,there is relatively limited information on the seismic design of nonstructural components. Basic research work in this area has been sparse,and the available codes and guidelines are usually,for the most part,based on past experiences,engineering judgment and intuition,rather than on objective experimental and analytical results. Often,design engineers are forced to start almost from square one after each earthquake event: to observe what went wrong and to try to prevent repetitions. This is a consequence of the empirical nature of current seismic regulations and guidelines for nonstructural components. This review paper summarizes current knowledge on the seismic design and analysis of nonstructural building components,identifying major knowledge gaps that will need to be filled by future research. Furthermore,considering recent trends in earthquake engineering,the paper explores how performance-based seismic design might be conceived for nonstructural components,drawing on recent developments made in the field of seismic design and hinting at the specific considerations required for nonstructural components.展开更多
An eight-node solid-beam element based on absolute nodal coordinate formulation(ANCF)which uses cubic interpolation at the longitudinal direction and linear at the transverse direction is proposed.The element can accu...An eight-node solid-beam element based on absolute nodal coordinate formulation(ANCF)which uses cubic interpolation at the longitudinal direction and linear at the transverse direction is proposed.The element can accurately discretize the geometry represented by the Bézier volume with the same basis function order.The continuity property of the proposed beam element is verified.Advantages of the proposed element can be found in the application of leaf spring modeling.The parabolically varying thickness of the leaf can be accurately described.Components in leaf spring such as the spring eye and the rubber bushing can be assembled efficiently since the proposed element can be connected at any direction.The ANCF reference node is used to represent the rigid components and the revolute joints in the vehicle suspension system.Static I-shaped cross-section cantilever beam and flexible pendulum model are used to test the accuracy and dynamic performance of the proposed solid-beam element.The leaf spring model shows the flexibility of the element in modeling the complex mechanical system and the balance between the accuracy and the efficiency.展开更多
Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with s...Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.展开更多
In the K-means clustering algorithm, each data point is uniquely placed into one category. The clustering quality is heavily dependent on the initial cluster centroid. Different initializations can yield varied result...In the K-means clustering algorithm, each data point is uniquely placed into one category. The clustering quality is heavily dependent on the initial cluster centroid. Different initializations can yield varied results; local adjustment cannot save the clustering result from poor local optima. If there is an anomaly in a cluster, it will seriously affect the cluster mean value. The K-means clustering algorithm is only suitable for clusters with convex shapes. We therefore propose a novel clustering algorithm CARDBK—＂centroid all rank distance（CARD）＂ which means that all centroids are sorted by distance value from one point and ＂BK＂ are the initials of ＂batch K-means＂—in which one point not only modifies a cluster centroid nearest to this point but also modifies multiple clusters centroids adjacent to this point, and the degree of influence of a point on a cluster centroid depends on the distance value between this point and the other nearer cluster centroids. Experimental results showed that our CARDBK algorithm outperformed other algorithms when tested on a number of different data sets based on the following performance indexes： entropy, purity, F1 value, Rand index and normalized mutual information（NMI）. Our algorithm manifested to be more stable, linearly scalable and faster.展开更多
Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic nois...Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic noise level of measuring instruments.This leads to the need for multiple measurements with subsequent statistical processing.In this paper,the digital algorithms are proposed for the automatic measurement of the JJ parameters by IVC.These algorithms make it possible to implement multiple measurements and check these JJ parameters in an automatic mode with the required accuracy.The complete sufficient statistics are used to minimize the root-mean-square error of parameter measurement.A sequence of current pulses with slow rising and falling edges is used to drive JJ,and synchronous current and voltage readings at JJ are used to realize measurement algorithms.The algorithm performance is estimated through computer simulations.The significant advantage of the proposed algorithms is the independence from current source noise and intrinsic noise of current and voltage meters,as well as the simple implementation in automatic digital measuring systems.The proposed algorithms can be used to control JJ parameters during mass production of superconducting integrated circuits,which will improve the production efficiency and product quality.展开更多
Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interco...Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interconnect architecture,we propose a time-multiplexed routing algorithm that can actively identify qualified nets and schedule them to multiplexable wires.We validate the algorithm by using the router to implement 20 benchmark circuits to time-multiplexed FPGAs.We achieve a 38%smaller minimum channel width and 3.8%smaller circuit critical path delay compared with the state-of-the-art architecture router when a wire can be time-multiplexed six times in a cycle.展开更多
The bipartite Star<sub>123</sub>-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star<sub>123</su...The bipartite Star<sub>123</sub>-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star<sub>123</sub>-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star<sub>123</sub>, P<sub>7</sub>-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.展开更多
The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit desi...The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.展开更多
Focusing on the ordinal scheduling problem on a parallel machine system, we discuss the background of ordinal scheduling and the motivation of ordinal algorithms. In addition, for the ordinal scheduling problem on ide...Focusing on the ordinal scheduling problem on a parallel machine system, we discuss the background of ordinal scheduling and the motivation of ordinal algorithms. In addition, for the ordinal scheduling problem on identical parallel machines with the objective to maximize the minimum machine load, we then give two asymptotically optimal algorithm classes which have worst-case ratios very close to the upper bound of the problem for any given m. These results greatly improve the results proposed by He Yong and Tan Zhiyi in 2002.展开更多
A special case of the bottleneck Steiner tree problem in the Euclidean plane was considered in this paper. The problem has applications in the design of wireless communication networks, multifacility location, VLSI ro...A special case of the bottleneck Steiner tree problem in the Euclidean plane was considered in this paper. The problem has applications in the design of wireless communication networks, multifacility location, VLSI routing and network routing. For the special case which requires that there should be no edge connecting any two Steiner points in the optimal solution, a 3-restricted Steiner tree can be found indicating the existence of the performance ratio root2. In this paper, the special case of the problem is proved to be NP-hard and cannot be approximated within ratio root2. First a simple polynomial time approximation algorithm with performance ratio root3 is presented. Then based on this algorithm and the existence of the 3-restricted Steiner tree, a polynomial time approximation algorithm with performance ratio-root2 + epsilon is proposed, for any epsilon > 0.展开更多
This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT a...This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems, The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio. Computer-aided proof technique is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.展开更多
In this paper we consider a link-unreliable remote monitoring scenario where the monitoring center is geographically located far away from the region of the deployed sensor network,and sensing data by the sensors in t...In this paper we consider a link-unreliable remote monitoring scenario where the monitoring center is geographically located far away from the region of the deployed sensor network,and sensing data by the sensors in the network will be transferred to the remote monitoring center through a third party telecommunication service.A cost associated with this service will be incurred,which will be determined by the number of gateways employed and the cumulative volume of data successfully received within a specified monitoring period.For this scenario,we first formulate a novel constrained optimization problem with an objective to minimize the service cost while a pre-defined network throughput is guaranteed.We refer to this problem as the throughput guaranteed service cost minimization problem and prove that it is NP-complete.We then propose a heuristic for it.The key ingredients of the heuristic include identifying gateways and finding an energy-efficient forest of routing trees rooted at the gateways.We also perform theoretical analysis on the solution obtained.Finally,we conduct experiments by simulations to evaluate the performance of the proposed algorithm.Experimental results demonstrate the proposed algorithm outperforms other algorithms in terms of both the service cost and the network lifetime.展开更多
基金supported by Harbin Engineering University’s 2021 Education Reform Project“How to Make Computer Theory Teaching Serve Employment”(Grant No.JG2021B0609).
文摘“Algorithm Design and Analysis”is not only one of the important courses in the undergraduate teaching of computer science and technology but also a key part of computer professional skills.In recent years,with the rise and widespread application of big language models,many teaching reform plans have been produced to promote the quality and efficiency of teaching.This paper studies how to refer to software development professional skills standards,investigates the knowledge points of“Algorithm Design and Analysis”courses in other educational institutions,uses cutting-edge core technology big language models to drive the improvement of teaching evaluation methods,improves teaching efficiency,and carries out reforms and practices in teaching content for undergraduate students in computer science.
文摘In this paper, a Web-based Mechanical Design and A na lysis Framework (WMDAF) is proposed. This WMADF allows designers to develop web -based computer aided programs in a systematic way during the collaborative mec hanical system design and analysis process. This system is based on an emerg ing web-based Content Management System (CMS) called eXtended Object Oriented P ortal System (XOOPS). Due to the Open Source Status of the XOOPS CMS, programs d eveloped with this framework can be further customized to satisfy the demands of the user. To introduce the use of this framework, this paper exams three differ ent types of mechanical design and analysis problems. First, a repetitive design consideration and calculation process is transferred into WMADF programs to gai n efficiency for wired collaborative team. Second, the considered product solid model is created directly through the use of XOOPS program and Microsoft Compone nt Object Model (COM) instances. To the end of the paper, an example linked with ANSYS is used to indicate the possible application of this framework.
基金supported by the National Natural Science Foundation of China(No.61905100)the Fundamental Research Funds for the Central Universities(No.lzujbky-2020-65)。
文摘Here,a novel Au Wedge-enhanced Raman spectroscopy(WERS)substrate is proposed.The electric field enhancement factor and the effective mode field radius with varying geometry parameters are investigated.The proper excitation wavelength 633 nm is obtained.The practical application of WERS substrate is discussed.The Au WERS not only can provide a continuous extremely highly localized electric field as surface-enhanced Raman scattering(SERS)hotspots,but also can offer 10 orders of magnitude of SERS enhancement factor.The corresponding results reveal that WERS substrate will be widely applied in optics,biology,chemistry and other fields.
基金supported by the Program for New Century Excellent Talents in Fujian Province of China,(Grant No.X07204)the Key Scientific and Technical Innovation Project of Xiamen University (Grant No.K70007)the Science and Technology Projectof Education Department of Fujian Province of China (Grant No.JA08138)
文摘A flat-top interleaver,in which a mirror on one arm of the Michelson interferomefer is replaced by a G-T resonator,is proposed.In the interleaver,the parameters including the channel spacing of 50 GHz,ripple less than 0.05 dB,-0.5 dB passband of 43 GHz(86% of the spacing),-30 dB stopband of 42 GHz(84% of the spacing),and a channel isolation higher than 40 dB,are achieved.
文摘We theoretically demonstrate the imaging properties of a complex two-dimensional(2D) face-centered square lattice photonic crystal(PC) made from germanium cylinders in air background. The finitedifference time-domain(FDTD) method is employed to calculate the band structure and simulate image construction. The band diagram of the complex structure is significantly compressed. Negative refraction occurs in the second energy band with negative phase velocity at a frequency of 0.228(2πc/a), which is lower than results from previous studies. Lower negative refraction frequency leads to higher image resolution. Numerical results show that the spatial resolution of the system reaches 0.7296λ, which is lower than the incident wavelength.
文摘A compact optical flip-flop with a directional coupler has been designed and analyzed. Using a narrow gap directional coupler, we have predicted the device length could be reduced down to 500μm from 1300μm.
基金Hong Kong Research Grants Council Early Career Scheme(24208915)National Natural Science Foundation of China(NSFC)Research Grants Council of Hong Kong Joint Research Scheme(N_CUHK415/15)
文摘Parity–time(PT) symmetry has been demonstrated in the frame of classic optics. Its applications in laser science have resulted in unconventional control and manipulation of resonant modes. PT-symmetric periodic circular Bragg lasers were previously proposed. Analyses with a transfer-matrix method have shown their superior properties of reduced threshold and enhanced modal discrimination between the radial modes. However, the properties of the azimuthal modes were not analyzed, which restricts further development of circular Bragg lasers. Here, we adopt the coupled-mode theory to design and analyze chirped circular Bragg lasers with radial PT symmetry. The new structures possess more versatile modal control with further enhanced modal discrimination between the azimuthal modes. We also analyze azimuthally modulated circular Bragg lasers with radial PT symmetry, which are shown to achieve even higher modal discrimination.
文摘During this decade,many countries have experienced natural and accidental disasters,such as typhoons,floods,earthquakes,and nuclear plant accidents,causing catastrophic damage to infrastructures.Since the end of 2019,all countries of the world are struggling with the COVID-19 and pursuing countermeasures,including inoculation of vaccine,and changes in our lifestyle and social structures.All these experiences have made the residents in the affected regions keenly aware of the need for new infrastructures that are resilient and autonomous,so that vital lifelines are secured during calamities.A paradigm shift has been taking place toward reorganizing the energy social service management in many countries,including Japan,by effective use of sustainable energy and new supply schemes.However,such new power sources and supply schemes would affect the power grid through intermittency of power output and the deterioration of power quality and service.Therefore,new social infrastructures and novel management systems to supply energy and social service will be required.In this paper,user-friendly design,operation and control assist tools for resilient microgrids and autonomous communities are proposed and applied to the standard microgrid to verify its effectiveness and performance.
文摘With the development and implementation of performance-based earthquake engineering,harmonization of performance levels between structural and nonstructural components becomes vital. Even if the structural components of a building achieve a continuous or immediate occupancy performance level after a seismic event,failure of architectural,mechanical or electrical components can lower the performance level of the entire building system. This reduction in performance caused by the vulnerability of nonstructural components has been observed during recent earthquakes worldwide. Moreover,nonstructural damage has limited the functionality of critical facilities,such as hospitals,following major seismic events. The investment in nonstructural components and building contents is far greater than that of structural components and framing. Therefore,it is not surprising that in many past earthquakes,losses from damage to nonstructural components have exceeded losses from structural damage. Furthermore,the failure of nonstructural components can become a safety hazard or can hamper the safe movement of occupants evacuating buildings,or of rescue workers entering buildings. In comparison to structural components and systems,there is relatively limited information on the seismic design of nonstructural components. Basic research work in this area has been sparse,and the available codes and guidelines are usually,for the most part,based on past experiences,engineering judgment and intuition,rather than on objective experimental and analytical results. Often,design engineers are forced to start almost from square one after each earthquake event: to observe what went wrong and to try to prevent repetitions. This is a consequence of the empirical nature of current seismic regulations and guidelines for nonstructural components. This review paper summarizes current knowledge on the seismic design and analysis of nonstructural building components,identifying major knowledge gaps that will need to be filled by future research. Furthermore,considering recent trends in earthquake engineering,the paper explores how performance-based seismic design might be conceived for nonstructural components,drawing on recent developments made in the field of seismic design and hinting at the specific considerations required for nonstructural components.
基金supported by the National Natural Science Foundation of China(Grant No.11802072)Key Project of Science and Technology of Hu'nan Province(Grant No.2018GK1040).
文摘An eight-node solid-beam element based on absolute nodal coordinate formulation(ANCF)which uses cubic interpolation at the longitudinal direction and linear at the transverse direction is proposed.The element can accurately discretize the geometry represented by the Bézier volume with the same basis function order.The continuity property of the proposed beam element is verified.Advantages of the proposed element can be found in the application of leaf spring modeling.The parabolically varying thickness of the leaf can be accurately described.Components in leaf spring such as the spring eye and the rubber bushing can be assembled efficiently since the proposed element can be connected at any direction.The ANCF reference node is used to represent the rigid components and the revolute joints in the vehicle suspension system.Static I-shaped cross-section cantilever beam and flexible pendulum model are used to test the accuracy and dynamic performance of the proposed solid-beam element.The leaf spring model shows the flexibility of the element in modeling the complex mechanical system and the balance between the accuracy and the efficiency.
基金This work was supported by the Serbian Ministry of Science and Education(project TR-32022)by companies Telekom Srbija and Informatika.
文摘Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.
基金Supported by the Social Science Foundation of Shaanxi Province of China(2018P03)the Humanities and Social Sciences Research Youth Fund Project of Ministry of Education of China(13YJCZH251)
文摘In the K-means clustering algorithm, each data point is uniquely placed into one category. The clustering quality is heavily dependent on the initial cluster centroid. Different initializations can yield varied results; local adjustment cannot save the clustering result from poor local optima. If there is an anomaly in a cluster, it will seriously affect the cluster mean value. The K-means clustering algorithm is only suitable for clusters with convex shapes. We therefore propose a novel clustering algorithm CARDBK—＂centroid all rank distance（CARD）＂ which means that all centroids are sorted by distance value from one point and ＂BK＂ are the initials of ＂batch K-means＂—in which one point not only modifies a cluster centroid nearest to this point but also modifies multiple clusters centroids adjacent to this point, and the degree of influence of a point on a cluster centroid depends on the distance value between this point and the other nearer cluster centroids. Experimental results showed that our CARDBK algorithm outperformed other algorithms when tested on a number of different data sets based on the following performance indexes： entropy, purity, F1 value, Rand index and normalized mutual information（NMI）. Our algorithm manifested to be more stable, linearly scalable and faster.
基金the Ministry of Science and Higher Education of the Russian Federation under Grant No.FSUN-2023-0007.
文摘Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic noise level of measuring instruments.This leads to the need for multiple measurements with subsequent statistical processing.In this paper,the digital algorithms are proposed for the automatic measurement of the JJ parameters by IVC.These algorithms make it possible to implement multiple measurements and check these JJ parameters in an automatic mode with the required accuracy.The complete sufficient statistics are used to minimize the root-mean-square error of parameter measurement.A sequence of current pulses with slow rising and falling edges is used to drive JJ,and synchronous current and voltage readings at JJ are used to realize measurement algorithms.The algorithm performance is estimated through computer simulations.The significant advantage of the proposed algorithms is the independence from current source noise and intrinsic noise of current and voltage meters,as well as the simple implementation in automatic digital measuring systems.The proposed algorithms can be used to control JJ parameters during mass production of superconducting integrated circuits,which will improve the production efficiency and product quality.
文摘Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interconnect architecture,we propose a time-multiplexed routing algorithm that can actively identify qualified nets and schedule them to multiplexable wires.We validate the algorithm by using the router to implement 20 benchmark circuits to time-multiplexed FPGAs.We achieve a 38%smaller minimum channel width and 3.8%smaller circuit critical path delay compared with the state-of-the-art architecture router when a wire can be time-multiplexed six times in a cycle.
文摘The bipartite Star<sub>123</sub>-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star<sub>123</sub>-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star<sub>123</sub>, P<sub>7</sub>-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.
文摘The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.
文摘Focusing on the ordinal scheduling problem on a parallel machine system, we discuss the background of ordinal scheduling and the motivation of ordinal algorithms. In addition, for the ordinal scheduling problem on identical parallel machines with the objective to maximize the minimum machine load, we then give two asymptotically optimal algorithm classes which have worst-case ratios very close to the upper bound of the problem for any given m. These results greatly improve the results proposed by He Yong and Tan Zhiyi in 2002.
文摘A special case of the bottleneck Steiner tree problem in the Euclidean plane was considered in this paper. The problem has applications in the design of wireless communication networks, multifacility location, VLSI routing and network routing. For the special case which requires that there should be no edge connecting any two Steiner points in the optimal solution, a 3-restricted Steiner tree can be found indicating the existence of the performance ratio root2. In this paper, the special case of the problem is proved to be NP-hard and cannot be approximated within ratio root2. First a simple polynomial time approximation algorithm with performance ratio root3 is presented. Then based on this algorithm and the existence of the 3-restricted Steiner tree, a polynomial time approximation algorithm with performance ratio-root2 + epsilon is proposed, for any epsilon > 0.
基金the National Natural Science Foundation of China(10301028,60021201)A preliminary version of this paper appeared in the proceedings of the 1st International Conference on Algorithmic Applications in Management,Lecture Notes in Computer Science 3521
文摘This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems, The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio. Computer-aided proof technique is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.
文摘In this paper we consider a link-unreliable remote monitoring scenario where the monitoring center is geographically located far away from the region of the deployed sensor network,and sensing data by the sensors in the network will be transferred to the remote monitoring center through a third party telecommunication service.A cost associated with this service will be incurred,which will be determined by the number of gateways employed and the cumulative volume of data successfully received within a specified monitoring period.For this scenario,we first formulate a novel constrained optimization problem with an objective to minimize the service cost while a pre-defined network throughput is guaranteed.We refer to this problem as the throughput guaranteed service cost minimization problem and prove that it is NP-complete.We then propose a heuristic for it.The key ingredients of the heuristic include identifying gateways and finding an energy-efficient forest of routing trees rooted at the gateways.We also perform theoretical analysis on the solution obtained.Finally,we conduct experiments by simulations to evaluate the performance of the proposed algorithm.Experimental results demonstrate the proposed algorithm outperforms other algorithms in terms of both the service cost and the network lifetime.
