This paper presents a kind of artificial intelligent system-generalized computing system (GCS for short), and introduces its mathematical description, implement problem and learning problem.
This paper focuses on the design process for reconfigurable architecture. Our contribution focuses on introducing a new temporal partitioning algorithm. Our algorithm is based on typical mathematic flow to solve the t...This paper focuses on the design process for reconfigurable architecture. Our contribution focuses on introducing a new temporal partitioning algorithm. Our algorithm is based on typical mathematic flow to solve the temporal partitioning problem. This algorithm optimizes the transfer of data required between design partitions and the reconfiguration overhead. Results show that our algorithm considerably decreases the communication cost and the latency compared with other well known algorithms.展开更多
Hyperparameter tuning is a key step in developing high-performing machine learning models, but searching large hyperparameter spaces requires extensive computation using standard sequential methods. This work analyzes...Hyperparameter tuning is a key step in developing high-performing machine learning models, but searching large hyperparameter spaces requires extensive computation using standard sequential methods. This work analyzes the performance gains from parallel versus sequential hyperparameter optimization. Using scikit-learn’s Randomized SearchCV, this project tuned a Random Forest classifier for fake news detection via randomized grid search. Setting n_jobs to -1 enabled full parallelization across CPU cores. Results show the parallel implementation achieved over 5× faster CPU times and 3× faster total run times compared to sequential tuning. However, test accuracy slightly dropped from 99.26% sequentially to 99.15% with parallelism, indicating a trade-off between evaluation efficiency and model performance. Still, the significant computational gains allow more extensive hyperparameter exploration within reasonable timeframes, outweighing the small accuracy decrease. Further analysis could better quantify this trade-off across different models, tuning techniques, tasks, and hardware.展开更多
Resource reconstruction algorithms are studied in this paper to solve the problem of resource on-demand allocation and improve the efficiency of resource utilization in virtual computing resource pool. Based on the id...Resource reconstruction algorithms are studied in this paper to solve the problem of resource on-demand allocation and improve the efficiency of resource utilization in virtual computing resource pool. Based on the idea of resource virtualization and the analysis of the resource status transition, the resource allocation process and the necessity of resource reconstruction are presented, l^esource reconstruction algorithms are designed to determine the resource reconstruction types, and it is shown that they can achieve the goal of resource on-demand allocation through three methodologies： resource combination, resource split, and resource random adjustment. The effects that the resource users have on the resource reconstruction results, the deviation between resources and requirements, and the uniformity of resource distribution are studied by three experiments. The experiments show that resource reconstruction has a close relationship with resource requirements, but it is not the same with current distribution of resources. The algorithms can complete the resource adjustment with a lower cost and form the logic resources to match the demands of resource users easily.展开更多
A new simple model of self-driven particles in scale-free networks is introduced to understand the emergence of condensation in the natural world. In the model, at each time step, particles are driven to choose their ...A new simple model of self-driven particles in scale-free networks is introduced to understand the emergence of condensation in the natural world. In the model, at each time step, particles are driven to choose their next habitats according to the particle numbers at both the present habitats and neighbors. It is found that the hub effect results in the condensation. The present numerical results as well as the theoretical analysis of condensation transition show the criterion of condensation. Both simulations and theoretical analysis display that there are three phases for different hopping probabilities δ： non-condensation （δ〈δc）, partial condensation （δc≤ δ〈1）, and complete condensation （δ≥δc＇= 1）, and the mean occupation particle number at the stationary state is also obtained. Moreover, the noise effect on self-driven particles is studied, and it makes particle numbers at nodes tend towards being identical.展开更多
The publication of Tsinghua Science and Technology was started in 1996. Since then, it has been an international academic journal sponsored by Tsinghua University and published bimonthly. This journal aims at presenti...The publication of Tsinghua Science and Technology was started in 1996. Since then, it has been an international academic journal sponsored by Tsinghua University and published bimonthly. This journal aims at presenting the state-of-art scientific achievements in computer science and other IT fields. From 2012, the journal enters into IEEE Xplore Digital Library with the open access mode. In 2015, Tsinghua Science and Technology has been indexed in the Science Citation Index Expanded with IF 1.250.展开更多
文摘This paper presents a kind of artificial intelligent system-generalized computing system (GCS for short), and introduces its mathematical description, implement problem and learning problem.
文摘This paper focuses on the design process for reconfigurable architecture. Our contribution focuses on introducing a new temporal partitioning algorithm. Our algorithm is based on typical mathematic flow to solve the temporal partitioning problem. This algorithm optimizes the transfer of data required between design partitions and the reconfiguration overhead. Results show that our algorithm considerably decreases the communication cost and the latency compared with other well known algorithms.
文摘Hyperparameter tuning is a key step in developing high-performing machine learning models, but searching large hyperparameter spaces requires extensive computation using standard sequential methods. This work analyzes the performance gains from parallel versus sequential hyperparameter optimization. Using scikit-learn’s Randomized SearchCV, this project tuned a Random Forest classifier for fake news detection via randomized grid search. Setting n_jobs to -1 enabled full parallelization across CPU cores. Results show the parallel implementation achieved over 5× faster CPU times and 3× faster total run times compared to sequential tuning. However, test accuracy slightly dropped from 99.26% sequentially to 99.15% with parallelism, indicating a trade-off between evaluation efficiency and model performance. Still, the significant computational gains allow more extensive hyperparameter exploration within reasonable timeframes, outweighing the small accuracy decrease. Further analysis could better quantify this trade-off across different models, tuning techniques, tasks, and hardware.
基金supported by National High Technology Research and Development Program of China (863 Program)(No. 2007AA010305)the Excellent Doctor Degree Dissertation Fund of Xi an University of Technology (No. 102-211007)
文摘Resource reconstruction algorithms are studied in this paper to solve the problem of resource on-demand allocation and improve the efficiency of resource utilization in virtual computing resource pool. Based on the idea of resource virtualization and the analysis of the resource status transition, the resource allocation process and the necessity of resource reconstruction are presented, l^esource reconstruction algorithms are designed to determine the resource reconstruction types, and it is shown that they can achieve the goal of resource on-demand allocation through three methodologies： resource combination, resource split, and resource random adjustment. The effects that the resource users have on the resource reconstruction results, the deviation between resources and requirements, and the uniformity of resource distribution are studied by three experiments. The experiments show that resource reconstruction has a close relationship with resource requirements, but it is not the same with current distribution of resources. The algorithms can complete the resource adjustment with a lower cost and form the logic resources to match the demands of resource users easily.
文摘A new simple model of self-driven particles in scale-free networks is introduced to understand the emergence of condensation in the natural world. In the model, at each time step, particles are driven to choose their next habitats according to the particle numbers at both the present habitats and neighbors. It is found that the hub effect results in the condensation. The present numerical results as well as the theoretical analysis of condensation transition show the criterion of condensation. Both simulations and theoretical analysis display that there are three phases for different hopping probabilities δ： non-condensation （δ〈δc）, partial condensation （δc≤ δ〈1）, and complete condensation （δ≥δc＇= 1）, and the mean occupation particle number at the stationary state is also obtained. Moreover, the noise effect on self-driven particles is studied, and it makes particle numbers at nodes tend towards being identical.
文摘The publication of Tsinghua Science and Technology was started in 1996. Since then, it has been an international academic journal sponsored by Tsinghua University and published bimonthly. This journal aims at presenting the state-of-art scientific achievements in computer science and other IT fields. From 2012, the journal enters into IEEE Xplore Digital Library with the open access mode. In 2015, Tsinghua Science and Technology has been indexed in the Science Citation Index Expanded with IF 1.250.
