State Generation Method for Humanoid Motion Planning Based on Genetic Algorithm

A new approach to generate the original motion data for humanoid motion planning is presented in this paper. And a state generator is developed based on the genetic algorithm, which enables users to generate various motion states without using any reference motion data. By specifying various types of constraints such as configuration constraints and contact constraints, the state generator can generate stable states that satisfy the constraint conditions for humanoid robots. To deal with the multiple constraints and inverse kinematics, the state generation is finally simplified as a problem of optimizing and searching. In our method, we introduce a convenient mathematic representation for the constraints involved in the state generator, and solve the optimization problem with the genetic algorithm to acquire a desired state. To demonstrate the effectiveness and advantage of the method, a number of motion states are generated according to the requirements of the motion

Beyond Pixels: Exploring Human-Readable SVG Generation for Simple Images with Vision Language Models

In the field of computer graphics, the use of vector graphics, particularly Scalable Vector Graphics (SVG), represents a notable development from traditional pixel-based imagery. SVGs, with their XML-based format, are distinct in their ability to directly and explicitly represent visual elements such as shape, color, and path. This direct representation facilitates a more accurate and logical depiction of graphical elements, enhancing reasoning and interpretability. Recognizing the potential of SVGs, the machine learning community has introduced multiple methods for image vectorization. However, transforming images into SVG format while retaining the relational properties and context of the original scene remains a key challenge. Most vectorization methods often yield SVGs that are overly complex and not easily interpretable. In response to this challenge, we introduce our method, Simple-SVG-Generation (S\textsuperscript{2}VG\textsuperscript{2}). Our method focuses on producing SVGs that are both accurate and simple, aligning with human readability and understanding. With simple images, we evaluate our method with reasoning tasks together with advanced language models, the results show a clear improvement over previous SVG generation methods. We also conducted surveys for human evaluation on the readability of our generated SVGs, the results also favor our methods.Comment: 10 pages, 7 figure

A Quick Framework for Evaluating Worst Robustness of Complex Networks

Robustness is pivotal for comprehending, designing, optimizing, and rehabilitating networks, with simulation attacks being the prevailing evaluation method. Simulation attacks are often time-consuming or even impractical, however, a more crucial yet persistently overlooked drawback is that any attack strategy merely provides a potential paradigm of disintegration. The key concern is: in the worst-case scenario or facing the most severe attacks, what is the limit of robustness, referred to as ``Worst Robustness'', for a given system? Understanding a system's worst robustness is imperative for grasping its reliability limits, accurately evaluating protective capabilities, and determining associated design and security maintenance costs. To address these challenges, we introduce the concept of Most Destruction Attack (MDA) based on the idea of knowledge stacking. MDA is employed to assess the worst robustness of networks, followed by the application of an adapted CNN algorithm for rapid worst robustness prediction. We establish the logical validity of MDA and highlight the exceptional performance of the adapted CNN algorithm in predicting the worst robustness across diverse network topologies, encompassing both model and empirical networks.Comment: 30 pages, 8figures, 4tables,journa

Foundation Model-oriented Robustness: Robust Image Model Evaluation with Pretrained Models

Machine learning has demonstrated remarkable performance over finite datasets, yet whether the scores over the fixed benchmarks can sufficiently indicate the model's performance in the real world is still in discussion. In reality, an ideal robust model will probably behave similarly to the oracle (e.g., the human users), thus a good evaluation protocol is probably to evaluate the models' behaviors in comparison to the oracle. In this paper, we introduce a new robustness measurement that directly measures the image classification model's performance compared with a surrogate oracle (i.e., a foundation model). Besides, we design a simple method that can accomplish the evaluation beyond the scope of the benchmarks. Our method extends the image datasets with new samples that are sufficiently perturbed to be distinct from the ones in the original sets, but are still bounded within the same image-label structure the original test image represents, constrained by a foundation model pretrained with a large amount of samples. As a result, our new method will offer us a new way to evaluate the models' robustness performance, free of limitations of fixed benchmarks or constrained perturbations, although scoped by the power of the oracle. In addition to the evaluation results, we also leverage our generated data to understand the behaviors of the model and our new evaluation strategies

Continual Learning on Dynamic Graphs via Parameter Isolation

Many real-world graph learning tasks require handling dynamic graphs where new nodes and edges emerge. Dynamic graph learning methods commonly suffer from the catastrophic forgetting problem, where knowledge learned for previous graphs is overwritten by updates for new graphs. To alleviate the problem, continual graph learning methods are proposed. However, existing continual graph learning methods aim to learn new patterns and maintain old ones with the same set of parameters of fixed size, and thus face a fundamental tradeoff between both goals. In this paper, we propose Parameter Isolation GNN (PI-GNN) for continual learning on dynamic graphs that circumvents the tradeoff via parameter isolation and expansion. Our motivation lies in that different parameters contribute to learning different graph patterns. Based on the idea, we expand model parameters to continually learn emerging graph patterns. Meanwhile, to effectively preserve knowledge for unaffected patterns, we find parameters that correspond to them via optimization and freeze them to prevent them from being rewritten. Experiments on eight real-world datasets corroborate the effectiveness of PI-GNN compared to state-of-the-art baselines

Research of the size effect on shear strength of metal-plate connector joints in China

According to the reliability theory, the size effect has a great impact on the design value on shear strength of metal-plate connector. But little research has been done. So, based on GB/T50329-2002 of China, firstly, determining the size of metal-plate at different conditions, size effect tests were then conducted on metal-plate connectors composed of a type of Chinese metal-plate and 2# SPF dimension lumber from North America. A total of 125 metal-plate connectors are tested at five angles (90°, 60°T, 120°C, 150°C, 30°T), with Five kinds of widths (50mm，85mm，125mm，150mm，180mm) for each angle. Based on the testing data, fitting curve of size effect is presented, and width-effect parameters are estimated with SPSS(Statistic Package for Social Science). Results indicate that the width effect is significant; shear strength increases with the increase of width, and stays stable after a certain width

Deep Random Vortex Method for Simulation and Inference of Navier-Stokes Equations

Navier-Stokes equations are significant partial differential equations that describe the motion of fluids such as liquids and air. Due to the importance of Navier-Stokes equations, the development on efficient numerical schemes is important for both science and engineer. Recently, with the development of AI techniques, several approaches have been designed to integrate deep neural networks in simulating and inferring the fluid dynamics governed by incompressible Navier-Stokes equations, which can accelerate the simulation or inferring process in a mesh-free and differentiable way. In this paper, we point out that the capability of existing deep Navier-Stokes informed methods is limited to handle non-smooth or fractional equations, which are two critical situations in reality. To this end, we propose the \emph{Deep Random Vortex Method} (DRVM), which combines the neural network with a random vortex dynamics system equivalent to the Navier-Stokes equation. Specifically, the random vortex dynamics motivates a Monte Carlo based loss function for training the neural network, which avoids the calculation of derivatives through auto-differentiation. Therefore, DRVM not only can efficiently solve Navier-Stokes equations involving rough path, non-differentiable initial conditions and fractional operators, but also inherits the mesh-free and differentiable benefits of the deep-learning-based solver. We conduct experiments on the Cauchy problem, parametric solver learning, and the inverse problem of both 2-d and 3-d incompressible Navier-Stokes equations. The proposed method achieves accurate results for simulation and inference of Navier-Stokes equations. Especially for the cases that include singular initial conditions, DRVM significantly outperforms existing PINN method

Factors Influencing Chinese Male\u27s Willingness to Undergo Circumcision: A Cross-Sectional Study in Western China

Background Male circumcision (MC) has been shown to reduce the risk of female to male transmission of HIV. The goal of this survey was to explore the acceptability of MC among the Chinese and to identify factors associated with circumcision preference. Methods A cross-sectional survey was conducted between September 2009 and December 2010. We interviewed 2,219 male community participants, from three high HIV prevalence provinces in western China. A structured questionnaire was used to collect data on MC knowledge, willingness to accept MC, reasons to accept or refuse MC, and sexual behaviors and health. For those who refused MC, a health education intervention providing information on the benefits of circumcision was conducted. We used multiple logistic regression models to identify factors associated with the acceptability of MC. Results Of the respondents (n = 2,219), 44.6% (989/2,219) reported they would accept MC for the following reasons: promotion of female partners\u27 hygiene (60.3%), redundant foreskin (59.4%), prevention of penile cancer (50.2%), enhanced sexual pleasure (41.4%), and protection against HIV and STDs (34.2%). The multivariable logistic regression showed that five factors were associated with MC willingness: long foreskin (OR = 15.98), residing in Xinjiang province (OR = 3.69), being younger than 25 (OR = 1.60), knowing hazards of redundant foreskin (OR = 1.78), and having a friend who underwent circumcision (OR = 1.36). Conclusion The acceptability of male circumcision was high among the general population in China. Our study elucidates the factors associated with circumcision preference and suggests that more health education campaigns about positive health effects are necessary to increase the MC rate in China