38 research outputs found
A Genetic Algorithm for Power-Aware Virtual Machine Allocation in Private Cloud
Energy efficiency has become an important measurement of scheduling algorithm
for private cloud. The challenge is trade-off between minimizing of energy
consumption and satisfying Quality of Service (QoS) (e.g. performance or
resource availability on time for reservation request). We consider resource
needs in context of a private cloud system to provide resources for
applications in teaching and researching. In which users request computing
resources for laboratory classes at start times and non-interrupted duration in
some hours in prior. Many previous works are based on migrating techniques to
move online virtual machines (VMs) from low utilization hosts and turn these
hosts off to reduce energy consumption. However, the techniques for migration
of VMs could not use in our case. In this paper, a genetic algorithm for
power-aware in scheduling of resource allocation (GAPA) has been proposed to
solve the static virtual machine allocation problem (SVMAP). Due to limited
resources (i.e. memory) for executing simulation, we created a workload that
contains a sample of one-day timetable of lab hours in our university. We
evaluate the GAPA and a baseline scheduling algorithm (BFD), which sorts list
of virtual machines in start time (i.e. earliest start time first) and using
best-fit decreasing (i.e. least increased power consumption) algorithm, for
solving the same SVMAP. As a result, the GAPA algorithm obtains total energy
consumption is lower than the baseline algorithm on simulated experimentation.Comment: 10 page
Music-Driven Group Choreography
Music-driven choreography is a challenging problem with a wide variety of
industrial applications. Recently, many methods have been proposed to
synthesize dance motions from music for a single dancer. However, generating
dance motion for a group remains an open problem. In this paper, we present
, a new large-scale dataset for music-driven group dance
generation. Unlike existing datasets that only support single dance, our new
dataset contains group dance videos, hence supporting the study of group
choreography. We propose a semi-autonomous labeling method with humans in the
loop to obtain the 3D ground truth for our dataset. The proposed dataset
consists of 16.7 hours of paired music and 3D motion from in-the-wild videos,
covering 7 dance styles and 16 music genres. We show that naively applying
single dance generation technique to creating group dance motion may lead to
unsatisfactory results, such as inconsistent movements and collisions between
dancers. Based on our new dataset, we propose a new method that takes an input
music sequence and a set of 3D positions of dancers to efficiently produce
multiple group-coherent choreographies. We propose new evaluation metrics for
measuring group dance quality and perform intensive experiments to demonstrate
the effectiveness of our method. Our project facilitates future research on
group dance generation and is available at:
https://aioz-ai.github.io/AIOZ-GDANCE/Comment: accepted in CVPR 202
Reducing Training Time in Cross-Silo Federated Learning using Multigraph Topology
Federated learning is an active research topic since it enables several
participants to jointly train a model without sharing local data. Currently,
cross-silo federated learning is a popular training setting that utilizes a few
hundred reliable data silos with high-speed access links to training a model.
While this approach has been widely applied in real-world scenarios, designing
a robust topology to reduce the training time remains an open problem. In this
paper, we present a new multigraph topology for cross-silo federated learning.
We first construct the multigraph using the overlay graph. We then parse this
multigraph into different simple graphs with isolated nodes. The existence of
isolated nodes allows us to perform model aggregation without waiting for other
nodes, hence effectively reducing the training time. Intensive experiments on
three public datasets show that our proposed method significantly reduces the
training time compared with recent state-of-the-art topologies while
maintaining the accuracy of the learned model. Our code can be found at
https://github.com/aioz-ai/MultigraphFLComment: accepted in ICCV 202
A Multiple Choices Reading Comprehension Corpus for Vietnamese Language Education
Machine reading comprehension has been an interesting and challenging task in
recent years, with the purpose of extracting useful information from texts. To
attain the computer ability to understand the reading text and answer relevant
information, we introduce ViMMRC 2.0 - an extension of the previous ViMMRC for
the task of multiple-choice reading comprehension in Vietnamese Textbooks which
contain the reading articles for students from Grade 1 to Grade 12. This
dataset has 699 reading passages which are prose and poems, and 5,273
questions. The questions in the new dataset are not fixed with four options as
in the previous version. Moreover, the difficulty of questions is increased,
which challenges the models to find the correct choice. The computer must
understand the whole context of the reading passage, the question, and the
content of each choice to extract the right answers. Hence, we propose the
multi-stage approach that combines the multi-step attention network (MAN) with
the natural language inference (NLI) task to enhance the performance of the
reading comprehension model. Then, we compare the proposed methodology with the
baseline BERTology models on the new dataset and the ViMMRC 1.0. Our
multi-stage models achieved 58.81% by Accuracy on the test set, which is 5.34%
better than the highest BERTology models. From the results of the error
analysis, we found the challenge of the reading comprehension models is
understanding the implicit context in texts and linking them together in order
to find the correct answers. Finally, we hope our new dataset will motivate
further research in enhancing the language understanding ability of computers
in the Vietnamese language
Conservation, Exploitation And Use Of The Ginger Family (Zingiberaceae) At The National Genebank In Vietnam
There are 741 accessions in the ginger family such as turmeric, ginger, galangal, and pinecone ginger collections conserved at Plant Resources Center, Vietnam. These collections were highly diverse in the number of accessions and species composition. The results of the Zingiberaceae exploitation shown the G10 ginger variety plants reached around 63.7 - 77.5 cm in height, 400 - 500 g/clumps in fresh weight, 25 - 27 tonnes/ha in fresh yield. The G10 ginger variety contained 4.37% oil, 1.2 mg/kg Zn and 9.31 mg/100g Vitamin C. This G10 ginger variety resistance to leaf spot and green aphids. In addition, the N8 turmeric variety plants reached 130 - 170 cm in height; 880 - 1000 g/clumps in fresh weight and 35 tonnes/ha in yield, curcumin content 6.2 - 6.6%, essential oil contents 2.5 - 2.7%. This turmeric resistance to heat stress, leaf spot, and green aphids. The conserved root and tuber crops at PRC are very diverse both of the amount of sample in collections and species. Conservation and evaluation on root and tuber crops reviewed the promising G10 ginger and N8 turmeric varieties had high yield, good oil content to release for production
On the Out of Distribution Robustness of Foundation Models in Medical Image Segmentation
Constructing a robust model that can effectively generalize to test samples
under distribution shifts remains a significant challenge in the field of
medical imaging. The foundational models for vision and language, pre-trained
on extensive sets of natural image and text data, have emerged as a promising
approach. It showcases impressive learning abilities across different tasks
with the need for only a limited amount of annotated samples. While numerous
techniques have focused on developing better fine-tuning strategies to adapt
these models for specific domains, we instead examine their robustness to
domain shifts in the medical image segmentation task. To this end, we compare
the generalization performance to unseen domains of various pre-trained models
after being fine-tuned on the same in-distribution dataset and show that
foundation-based models enjoy better robustness than other architectures. From
here, we further developed a new Bayesian uncertainty estimation for frozen
models and used them as an indicator to characterize the model's performance on
out-of-distribution (OOD) data, proving particularly beneficial for real-world
applications. Our experiments not only reveal the limitations of current
indicators like accuracy on the line or agreement on the line commonly used in
natural image applications but also emphasize the promise of the introduced
Bayesian uncertainty. Specifically, lower uncertainty predictions usually tend
to higher out-of-distribution (OOD) performance.Comment: Advances in Neural Information Processing Systems (NeurIPS) 2023,
Workshop on robustness of zero/few-shot learning in foundation model
CSA: Thá»±c hà nh nông nghiệp thông minh vá»›i khà háºu ở Việt Nam
During the last five years, Vietnam has been one of the countries most affected by climate change. Severe typhoons, flooding, cold spells, salinity intrusion, and drought have affected agriculture production across the country, from upland to lowland regions. Fortunately for Vietnam, continuous work in developing climate-smart agriculture has been occurring in research organizations and among innovative farmers and entrepreneurs. Application of various CSA practices and technologies to adapt to the impact of climate change in agriculture production have been expanding. However, there is a need to accelerate the scaling process of these practices and technologies in order to ensure growth of agriculture production and food security, increase income of farmers, make farming climate resilient, and contribute to global climate change mitigation. This book aims to provide basic information to researchers, managers, and technicians and extentionists at different levels on what CSA practices and technologies can be up scaled in different locations in Vietnam
TextANIMAR: Text-based 3D Animal Fine-Grained Retrieval
3D object retrieval is an important yet challenging task, which has drawn
more and more attention in recent years. While existing approaches have made
strides in addressing this issue, they are often limited to restricted settings
such as image and sketch queries, which are often unfriendly interactions for
common users. In order to overcome these limitations, this paper presents a
novel SHREC challenge track focusing on text-based fine-grained retrieval of 3D
animal models. Unlike previous SHREC challenge tracks, the proposed task is
considerably more challenging, requiring participants to develop innovative
approaches to tackle the problem of text-based retrieval. Despite the increased
difficulty, we believe that this task has the potential to drive useful
applications in practice and facilitate more intuitive interactions with 3D
objects. Five groups participated in our competition, submitting a total of 114
runs. While the results obtained in our competition are satisfactory, we note
that the challenges presented by this task are far from being fully solved. As
such, we provide insights into potential areas for future research and
improvements. We believe that we can help push the boundaries of 3D object
retrieval and facilitate more user-friendly interactions via vision-language
technologies.Comment: arXiv admin note: text overlap with arXiv:2304.0573