GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Hindawi Limited ; 2021
    In:  Scientific Programming Vol. 2021 ( 2021-7-30), p. 1-7
    In: Scientific Programming, Hindawi Limited, Vol. 2021 ( 2021-7-30), p. 1-7
    Abstract: Traditional physical education methods are unable to meet this requirement due to the practical nature of sports skill teaching. As a result, as the times demanded, the flipped classroom based on neural network technology arose. It has the potential to not only promote the modernization of physical education but also to ensure that it has a positive educational impact. This is a mode of instruction. Furthermore, colleges and universities are increasingly focusing on college students’ overall quality development. A method for predicting college students’ sports performance using a particle swarm optimization neural network is proposed to accurately predict sports performance and provide a reliable analysis basis for the establishment of sports teaching goals. Neural networks are used in the model. The particle swarm optimization algorithm optimizes the variance and weights of the neural network to improve the accuracy of college students’ sports performance predicted by the neural network by updating the particle position and speed through the two extreme values of individual extreme values and global extreme values. Teachers always play the role of the facilitator and helper in the teaching process, which realizes the transformation of teachers’ and students’ self-positioning, allows students to better play the lead role, and stimulates students’ interest in learning.
    Type of Medium: Online Resource
    ISSN: 1875-919X , 1058-9244
    RVK:
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2021
    detail.hit.zdb_id: 2070004-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Wiley ; 2017
    In:  Concurrency and Computation: Practice and Experience Vol. 29, No. 18 ( 2017-09-25)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 29, No. 18 ( 2017-09-25)
    Abstract: Utilization of cloud computing resources has made a fast growth in e‐business. Business and government agencies often need to handle large volume of service requests, the so‐called instance‐intensive business processes in a constrained period. On‐time completion for instance‐intensive business processes within the constrained time is a very important issue. In the past few years, traditional optimal task scheduling has been well researched and proven to be a nondeterministic polynomial (NP) time–complete problem. So many heuristic and metaheuristic algorithms are put forward to solve the issue with near‐optimal solutions. However, most of them just treat a single workflow instance as a multistep task without considering that steps within a task can be different types of activities. To explain multistep features of business workflows, a typical motivating instance‐intensive business example of security exchange and a multistep scheduling model for business workflows are introduced in this paper. Then our near‐optimal dynamic priority scheduling (DPS) strategy is proposed on the basis of the idea of Min‐Min heuristic algorithm and greedy philosophy. Compared to the first come first served and constrained Min‐Min by makespan and standard deviation, DPS can make a more optimized choice in each round of scheduling towards overall outcome. To show the effectiveness of DPS, theoretical minimum execution time (MET theory ) is used as a benchmark for evaluation based on simulation. The results show that the ratios between MET theory and DPS are more than 98.5% by scheduling different orders of magnitude tasks from 1000 to 1 000 000. In particular, the ratio between MET theory and DPS is nearly 99.9% with 1 000 000 tasks, which means that our DPS can get the near‐optimal result when scheduling large number of tasks.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2017
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2022
    In:  IEEE Transactions on Computers Vol. 71, No. 7 ( 2022-7-1), p. 1564-1574
    In: IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers (IEEE), Vol. 71, No. 7 ( 2022-7-1), p. 1564-1574
    Type of Medium: Online Resource
    ISSN: 0018-9340 , 1557-9956 , 2326-3814
    RVK:
    RVK:
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2022
    detail.hit.zdb_id: 1473005-4
    detail.hit.zdb_id: 218504-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Elsevier BV ; 2012
    In:  Information Sciences Vol. 185, No. 1 ( 2012-2), p. 78-99
    In: Information Sciences, Elsevier BV, Vol. 185, No. 1 ( 2012-2), p. 78-99
    Type of Medium: Online Resource
    ISSN: 0020-0255
    RVK:
    Language: English
    Publisher: Elsevier BV
    Publication Date: 2012
    detail.hit.zdb_id: 218760-7
    detail.hit.zdb_id: 1478990-5
    SSG: 24,1
    SSG: 7,11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...