To see the other types of publications on this topic, follow the link: Coordination compunds.
Journal articles on the topic 'Coordination compunds'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 18 journal articles for your research on the topic 'Coordination compunds.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Kucharska-zoń, Maria, Walter Wojciechowski, and Jerzy Zoń. "Magnetic Properties of Coordination Compunds of 1-Aminólkylphosphonic Acids with Cobat(II)." Phosphorus, Sulfur, and Silicon and the Related Elements 147, no. 1 (January 1, 1999): 461. http://dx.doi.org/10.1080/10426509908053710.
Full text
2
Deilami, Sara. "Online Coordination of Plug-In Electric Vehicles Considering Grid Congestion and Smart Grid Power Quality." Energies 11, no. 9 (August 21, 2018): 2187. http://dx.doi.org/10.3390/en11092187.
Full textAbstract:
This paper first introduces the impacts of battery charger and nonlinear load harmonics on smart grids considering random plug-in of electric vehicles (PEVs) without any coordination. Then, a new centralized nonlinear online maximum sensitivity selection-based charging algorithm (NOL-MSSCA) is proposed for coordinating PEVs that minimizes the costs associated with generation and losses considering network and bus total harmonic distortion (THD). The aim is to first attend the high priority customers and charge their vehicles as quickly as possible while postponing the service to medium and low priority consumers to the off-peak hours, considering network, battery and power quality constraints and harmonics. The vehicles were randomly plugged at different locations during a period of 24 h. The proposed PEV coordination is based on the maximum sensitivity selection (MSS), which is the sensitivity of losses (including fundamental and harmonic losses) with respect to the PEV location (PEV bus). The proposed algorithm uses the decoupled harmonic power flow (DHPF) to model the nonlinear loads (including the PEV chargers) as current harmonic sources and computes the harmonic power losses, harmonic voltages and THD of the smart grid. The MSS vectors are easily determined using the entries of the Jacobian matrix of the DHPF program, which includes the spectrums of all injected harmonics by nonlinear electric vehicle (EV) chargers and nonlinear industrial loads. The sensitivity of the objective function (fundamental and harmonic power losses) to the PEVs were then used to schedule PEVs accordingly. The algorithm successfully controls the network THDv level within the standard limit of 5% for low and moderate PEV penetrations by delaying PEV charging activities. For high PEV penetrations, the installation of passive power filters (PPFs) is suggested to reduce the THDv and manage to fully charge the PEVs. Detailed simulations considering random and coordinated charging were performed on the modified IEEE 23 kV distribution system with 22 low voltage residential networks populated with PEVs that have nonlinear battery chargers. Simulation results are provided without/with filters for different penetration levels of PEVs.
3
Iacopetta, Maurizio. "THE EMERGENCE OF MONEY: A DYNAMIC ANALYSIS." Macroeconomic Dynamics 23, no. 07 (December 18, 2017): 2573–96. http://dx.doi.org/10.1017/s1365100517000815.
Full textAbstract:
This paper studies the role of liquidity in triggering the emergence of money in a Kiyotaki-Wright economy. A novel method computes the dynamic Nash equilibria of the economy by setting up an iteration of the agents' profile of (pure) strategies and of the distribution of commodities across agents. The analysis shows that the evolving state of liquidity can spark the acceptance of a high-cost-storage commodity as money or cause the disappearance of a commodity money. It also reveals the existence of multiple dynamic equilibria with pure strategies. Several simulations clarify how history and the coordination of beliefs matter for the selection of a particular equilibrium.
4
Roijers, Diederik Marijn, Shimon Whiteson, and Frans A. Oliehoek. "Computing Convex Coverage Sets for Faster Multi-objective Coordination." Journal of Artificial Intelligence Research 52 (March 31, 2015): 399–443. http://dx.doi.org/10.1613/jair.4550.
Full textAbstract:
In this article, we propose new algorithms for multi-objective coordination graphs (MO-CoGs). Key to the efficiency of these algorithms is that they compute a convex coverage set (CCS) instead of a Pareto coverage set (PCS). Not only is a CCS a sufficient solution set for a large class of problems, it also has important characteristics that facilitate more efficient solutions. We propose two main algorithms for computing a CCS in MO-CoGs. Convex multi-objective variable elimination (CMOVE) computes a CCS by performing a series of agent eliminations, which can be seen as solving a series of local multi-objective subproblems. Variable elimination linear support (VELS) iteratively identifies the single weight vector, w, that can lead to the maximal possible improvement on a partial CCS and calls variable elimination to solve a scalarized instance of the problem for w. VELS is faster than CMOVE for small and medium numbers of objectives and can compute an ε-approximate CCS in a fraction of the runtime. In addition, we propose variants of these methods that employ AND/OR tree search instead of variable elimination to achieve memory efficiency. We analyze the runtime and space complexities of these methods, prove their correctness, and compare them empirically against a naive baseline and an existing PCS method, both in terms of memory-usage and runtime. Our results show that, by focusing on the CCS, these methods achieve much better scalability in the number of agents than the current state of the art.
5
Ranganathan, Radha, and Kathiravan Kannan. "Enhancing the Selection of Backoff Interval Using Fuzzy Logic over Wireless Ad Hoc Networks." Scientific World Journal 2015 (2015): 1–13. http://dx.doi.org/10.1155/2015/680681.
Full textAbstract:
IEEE 802.11 is the de facto standard for medium access over wireless ad hoc network. The collision avoidance mechanism (i.e., random binary exponential backoff—BEB) of IEEE 802.11 DCF (distributed coordination function) is inefficient and unfair especially under heavy load. In the literature, many algorithms have been proposed to tune the contention window (CW) size. However, these algorithms make every node select its backoff interval between [0, CW] in a random and uniform manner. This randomness is incorporated to avoid collisions among the nodes. But this random backoff interval can change the optimal order and frequency of channel access among competing nodes which results in unfairness and increased delay. In this paper, we propose an algorithm that schedules the medium access in a fair and effective manner. This algorithm enhances IEEE 802.11 DCF with additional level of contention resolution that prioritizes the contending nodes according to its queue length and waiting time. Each node computes its unique backoff interval using fuzzy logic based on the input parameters collected from contending nodes through overhearing. We evaluate our algorithm against IEEE 802.11, GDCF (gentle distributed coordination function) protocols using ns-2.35 simulator and show that our algorithm achieves good performance.
6
Koralewski, Tomasz E., Hsiao-Hsuan Wang, William E. Grant, Michael J. Brewer, Norman C. Elliott, John K. Westbrook, Adrianna Szczepaniec, Allen Knutson, Kristopher L. Giles, and J. P. Michaud. "Integrating Models of Atmospheric Dispersion and Crop-Pest Dynamics: Linking Detection of Local Aphid Infestations to Forecasts of Region-Wide Invasion of Cereal Crops." Annals of the Entomological Society of America 113, no. 2 (February 11, 2020): 79–87. http://dx.doi.org/10.1093/aesa/saz047.
Full textAbstract:
Abstract Invasive airborne insects pose major challenges in natural resource and agriculture management, as they can rapidly spread over large distances and cross physical boundaries. Field monitoring and local management are important tools to prevent and control infestations but require additional coordination to be operative region-wide. Computational modeling techniques have been effective in simulating local population dynamics and in capturing spread of invasive species on a regional scale. We use an integrated ecological model to simulate local and regional infestation dynamics of sugarcane aphids, Melanaphis sacchari (Zehntner) (Hemiptera: Aphididae), on sorghum, Sorghum bicolor (L.) Moench (family Poaceae), in the southern to central Great Plains of the United States. Local dynamics of aphid populations on sorghum are simulated by a spatially explicit, individual-based model, whereas regional aphid migration is simulated by an atmospheric model that computes inert air particle (aphid) transport, dispersion, and deposition. Simulation results indicate timing of initial infestations in the south affects spatiotemporal patterns of infestation throughout the region. Probability of local infestations is a function of both percentage of land occupied by growing sorghum and prevailing winds. Thus, due to availability of sorghum, relatively later dates of initial infestation in the south will probably lead to infestations farther north that become established more quickly following the first appearance of aphids in the south. The model we present, in coordination with field monitoring schemes, could be applied as a forecasting tool in region-wide pest management systems.
7
GODDARD, WAYNE, and PRADIP K. SRIMANI. "SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE." International Journal of Foundations of Computer Science 23, no. 04 (June 2012): 763–77. http://dx.doi.org/10.1142/s0129054112400357.
Full textAbstract:
Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization. We consider the model where there is one designated master node and all other nodes are anonymous and have constant space. Recently, Lee et al. obtained such an algorithm for determining the size of a unidirectional ring. We provide a new algorithm that converges much quicker. This algorithm exploits a token-circulation idea due to Afek and Brown. Disregarding the time for stabilization, our algorithm computes the size of the ring at the master node in O(n log n) time compared to O(n3) steps used in the algorithm by Lee et al. We have also shown that the master node, after determining the size of the ring, can compute the average of observations made at each node in O(n) rounds or O(n2) steps. It seems likely that one should be able to obtain master–slave algorithms for other problems in networks.
8
Zhang, Peixin, Caizhen Zhu, Dongyun Zhang, Qi Qiu, Xiangzhong Ren, and Jianhong Liu. "Molecular dynamic studies on MgO–Al2O3–SiO2 glass-ceramics." Journal of Materials Research 23, no. 11 (November 2008): 2897–908. http://dx.doi.org/10.1557/jmr.2008.0367.
Full textAbstract:
Three sets of original dynamics model parameters for MgO–Al2O3–SiO2 (MAS) system were reported for the first time in this paper; moreover, a new parameter optimization standard was put forward to study three different molecular dynamic models of MAS glass-ceramics. The limitations of the conventional parameter optimization methods were also studied. The results indicate: (i) Born-Mayer-Huggins (BMH) model can be only used to simulate amorphous MAS systems. Furthermore, both static optimization and a dynamics test are necessary; (ii) for structure optimization or macroproperties calculation, high accuracy has been achieved relative to the experimental results by using the core-shell (CS) model; (iii) partialQ model computes at a high speed, about twelve times that of the CS model; (iv) for a bulk system, the partialQ model can be first used to obtain an initial structure rapidly, followed by the CS model for high accuracy calculation. In this way, both accuracy and efficiency are achieved. When the model was used to simulate the cordierite crystal and the amorphous in the cordierite glass-ceramic, the results were consistent with the experiments and the structure data from the ab initio calculation. Simulations on amorphous structures in the cordierite glass-ceramic with various compositions displayed that the bond length or coordination numbers (CN) of Si–O and Al–O remained the same with increasing content of MgO, suggesting no change in the tetrahedral configuration of short-range structure. Although the bond length of Mg–O stays almost the same with the increasing content of MgO, the coordination number increases to a certain extent, and the content of O-bridge in SiO2 glass drops from 100%–60% in pyrope glass.
9
Krumm, John, and Eric Horvitz. "Traffic Updates: Saying a Lot While Revealing a Little." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 986–95. http://dx.doi.org/10.1609/aaai.v33i01.3301986.
Full textAbstract:
Taking speed reports from vehicles is a proven, inexpensive way to infer traffic conditions. However, due to concerns about privacy and bandwidth, not every vehicle occupant may want to transmit data about their location and speed in real time. We show how to drastically reduce the number of transmissions in two ways, both based on a Markov random field for modeling traffic speed and flow. First, we show that a only a small number of vehicles need to report from each location. We give a simple, probabilistic method that lets a group of vehicles decide on which subset will transmit a report, preserving privacy by coordinating without any communication. The second approach computes the potential value of any location’s speed report, emphasizing those reports that will most affect the overall speed inferences, and omitting those that contribute little value. Both methods significantly reduce the amount of communication necessary for accurate speed inferences on a road network.
10
GUO, DAIQI, SHENGZHENG KUAI, WENYU ZHOU, XINYU GUAN, ZHENHUA LIAO, WEIQIANG LIU, and DAPING WANG. "INTERSEGMENTAL COORDINATION IN LOWER EXTREMITIES AND MULTI-SEGMENTAL SPINE DURING DIFFERENT ACTIVITIES OF DAILY LIVING." Journal of Mechanics in Medicine and Biology 17, no. 07 (November 2017): 1740015. http://dx.doi.org/10.1142/s0219519417400152.
Full textAbstract:
Background: Human movement consists of numerous degrees of freedom (DOF). How the nervous system (NS) computes the appropriate command to coordinate these DOFs to finish specific tasks is still hotly debated. One common way to simplify the redundant DOFs is to coordinate multiple DOFs by combining them into units or synergies. The present study aimed to investigate the kinematic complexity of five activities of daily living (ADLs) and to detect the amount of kinematic synergy during every ADL and the relationship of the motion pattern between these ADLs. Method: Twenty-six able-bodied male individuals performed level walking, stair climbing, trunk bending, ipsilateral pick-up and contralateral pick-up in sequence. The segmental excursion of the thorax, upper lumbar, lower lumbar, pelvis, thigh and shank was calculated. Principal component analysis (PCA) was applied to determine the motion pattern of every ADL. Result: In the sagittal plane, trunk bending, ipsilateral pick-up and contralateral pick-up could be simplified by using one principal component (PC) with more than 95% variance accounted for (VAF). In addition, the motion pattern of every PC was similar among the three ADLs. Moreover, the angles between the vectors representing the first PC of the three ADLs were all less than 10[Formula: see text]. Level walking and stair climbing needed at least two PCs to reach 95% VAF. In addition, the motion pattern was different between the two ADLs. Moreover, the angle between the first PC of the two ADLs was around 90[Formula: see text]. In the coronal plane, the five ADLs except contralateral pick-up arrived at 90% VAF with two PCs. The motion pattern and the angle between the first PC both demonstrated larger differences among the five ADLs. Conclusion: Two PCs were essential to represent level walking and stair climbing, indicating a complex control strategy used by the NS. Trunk bending, ipsilateral pick-up and contralateral pick-up could be described with one PC in the sagittal plane, showing a strong coupling and simple motion pattern. In addition, the motion pattern varied considerably among these ADLs. The outcomes of this study can help clinicians to select suitable ADLs for the patients with various joint or disc diseases and to conduct corresponding functional test and rehabilitation.
11
Cortesi, Matteo, Rocco Di Michele, Silvia Fantozzi, Sandro Bartolomei, and Giorgio Gatta. "Arm-Stroke Descriptor Variability during 200-m Front Crawl Swimming." Sensors 21, no. 2 (January 6, 2021): 324. http://dx.doi.org/10.3390/s21020324.
Full textAbstract:
The present study aimed to explore the variability of the arm-stroke temporal descriptors between and within laps during middle-distance swimming event using IMMUs. Eight male swimmers performed a 200-m maximum front-crawl in which the inter-lap and intra-lap variability of velocity, stroke rate, stroke-phases duration and arm-coordination index were measured through five units of IMMU. An algorithm computes the 3D coordinates of the wrist by means the IMMU orientation and the kinematic chain of upper arm biomechanical model, and it recognizes the start events of the four arm-stroke phases. Velocity and stroke rate had a mean value of 1.47 ± 0.10 m·s−1 and 32.94 ± 4.84 cycles·min−1, respectively, and a significant decrease along the 200-m (p < 0.001; η2 = 0.80 and 0.47). The end of each lap showed significantly lower stroke rate compared to the start and the middle segment (p < 0.05; η2 = 0.55). No other significant inter-lap and intra-lap differences were detected. The two main findings are: (i) IMMUs technology can be an effective solution to continuously monitor the temporal descriptors during the swimming trial; (ii) swimmers are able to keep stable their temporal technique descriptors in a middle-distance event, despite the decrease of velocity and stroke rate.
12
Shahsavari, Shahram, Nail Akar, and Babak Hossein Khalaj. "Joint Cell Muting and User Scheduling in Multicell Networks with Temporal Fairness." Wireless Communications and Mobile Computing 2018 (2018): 1–18. http://dx.doi.org/10.1155/2018/4846291.
Full textAbstract:
A semicentralized joint cell muting and user scheduling scheme for interference coordination in a multicell network is proposed under two different temporal fairness criteria. In the proposed scheme, at a decision instant, each base station (BS) in the multicell network employs a cell-level scheduler to nominate one user for each of its inner and outer sections and their available transmission rates to a network-level scheduler which then computes the potential overall transmission rate for each muting pattern. Subsequently, the network-level scheduler selects one pattern to unmute, out of all the available patterns. This decision is shared with all cell-level schedulers which then forward data to one of the two nominated users provided the pattern they reside in was chosen for transmission. Both user and pattern selection decisions are made on a temporal fair basis. Although some pattern sets are easily obtainable from static frequency reuse systems, we propose a general pattern set construction algorithm in this paper. As for the first fairness criterion, all cells are assigned to receive the same temporal share with the ratio between the temporal share of a cell center section and that of the cell edge section being set to a fixed desired value for all cells. The second fairness criterion is based on max-min temporal fairness for which the temporal share of the network-wide worst case user is maximized. Extensive numerical results are provided to validate the effectiveness of the proposed schemes and to study the impact of choice of the pattern set.
13
Elaamery, Badr, Massimo Pesavento, Teresa Aldovini, Nicola Lissandrini, Giulia Michieletto, and Angelo Cenedese. "Model Predictive Control for Cooperative Transportation with Feasibility-Aware Policy." Robotics 10, no. 3 (June 30, 2021): 84. http://dx.doi.org/10.3390/robotics10030084.
Full textAbstract:
The transportation of large payloads can be made possible with Multi-Robot Systems (MRS) implementing cooperative strategies. In this work, we focus on the coordinated MRS trajectory planning task exploiting a Model Predictive Control (MPC) framework addressing both the acting robots and the transported load. In this context, the main challenge is the possible occurrence of a temporary mismatch among agents’ actions with consequent formation errors that can cause severe damage to the carried load. To mitigate this risk, the coordination scheme may leverage a leader–follower approach, in which a hierarchical strategy is in place to trade-off between the task accomplishment and the dynamics and environment constraints. Nonetheless, particularly in narrow spaces or cluttered environments, the leader’s optimal choice may lead to trajectories that are infeasible for the follower and the load. To this aim, we propose a feasibility-aware leader–follower strategy, where the leader computes a reference trajectory, and the follower accounts for its own and the load constraints; moreover, the follower is able to communicate the trajectory infeasibility to the leader, which reacts by temporarily switching to a conservative policy. The consistent MRS co-design is allowed by the MPC formulation, for both the leader and the follower: here, the prediction capability of MPC is key to guarantee a correct and efficient execution of the leader–follower coordinated action. The approach is formally stated and discussed, and a numerical campaign is conducted to validate and assess the proposed scheme, with respect to different scenarios with growing complexity.
14
Wang, Degeng, and Michael Gribskov. "Examining the architecture of cellular computing through a comparative study with a computer." Journal of The Royal Society Interface 2, no. 3 (May 16, 2005): 187–95. http://dx.doi.org/10.1098/rsif.2005.0038.
Full textAbstract:
The computer and the cell both use information embedded in simple coding, the binary software code and the quadruple genomic code, respectively, to support system operations. A comparative examination of their system architecture as well as their information storage and utilization schemes is performed. On top of the code, both systems display a modular, multi-layered architecture, which, in the case of a computer, arises from human engineering efforts through a combination of hardware implementation and software abstraction. Using the computer as a reference system, a simplistic mapping of the architectural components between the two is easily detected. This comparison also reveals that a cell abolishes the software–hardware barrier through genomic encoding for the constituents of the biochemical network, a cell's ‘hardware’ equivalent to the computer central processing unit (CPU). The information loading (gene expression) process acts as a major determinant of the encoded constituent's abundance, which, in turn, often determines the ‘bandwidth’ of a biochemical pathway. Cellular processes are implemented in biochemical pathways in parallel manners. In a computer, on the other hand, the software provides only instructions and data for the CPU. A process represents just sequentially ordered actions by the CPU and only virtual parallelism can be implemented through CPU time-sharing. Whereas process management in a computer may simply mean job scheduling, coordinating pathway bandwidth through the gene expression machinery represents a major process management scheme in a cell. In summary, a cell can be viewed as a super-parallel computer, which computes through controlled hardware composition. While we have, at best, a very fragmented understanding of cellular operation, we have a thorough understanding of the computer throughout the engineering process. The potential utilization of this knowledge to the benefit of systems biology is discussed.
15
Conesa Pastor, Julián F., Mª Socorro García Cascales, Antonio García Martín, and Juan Pedro Solano Martínez. "Un modelo para estimar la distribución de la carga de trabajo del estudiante del horario conjunto = A model to estimate the distribution of the student's work load from the joint schedule." Advances in Building Education 4, no. 3 (December 1, 2020): 48. http://dx.doi.org/10.20868/abe.2020.3.4517.
Full textAbstract:
Una carga de trabajo desigualmente distribuida a lo largo de un semestre es uno de los factores cruciales que afectan el desempeño académico de los estudiantes universitarios. Las cargas de trabajo excesivas o distribuidas de forma desigual pueden dañar significativamente los resultados académicos y, lo que es más importante, determinar el enfoque de aprendizaje adoptado por los estudiantes. La coordinación horizontal tiene como objetivo garantizar una distribución racional de la carga de trabajo a lo largo de un semestre académico. Para ello, la Universidad Politécnica de Cartagena (UPCT) utiliza el 'Cronograma Conjunto', donde se agrupan las actividades planificadas por el profesorado para los diferentes cursos de un determinado grupo y semestre. El objetivo principal de este trabajo es el desarrollo de un modelo que permita evaluar la distribución de la carga de trabajo del estudiante a lo largo de un semestre, utilizando la planificación inicial de actividades recuperada por la facultad. Se han empleado varios enfoques para estimar la carga de trabajo del estudiante. Este trabajo se basa en la encuesta semanal de carga de trabajo realizada para varios cursos en una serie de grados de la UPCT, que ha permitido a los autores cuantificar la carga de trabajo del alumno medio para diferentes tipos de actividades, medir las actividades planificadas y simular el tiempo de carga de trabajo. Distribución de una actividad determinada en función del tiempo disponible para su realización.AbstractAn unevenly distributed workload along a semester is one of the crucial factors that affect the academic performance of university students. Excess or unevenly distributed workloads may significantly harm the academic results and, importantly, determine the learning approach adopted by the students. The horizontal coordination aims at ensuring a rational workload distribution along an academic semester. To achieve this, Universidad Politécnica de Cartagena (UPCT) uses ‘Joint Chronogram’, where the activities planned by the faculty for the different courses in a given group and semester are put together.The main objective of this work is the development of a model that allows for evaluating the student’s workload distribution along a semester, using the initial planning of activities retrieved by the faculty.Several approaches have been employed for estimating the student’s workload. This work is based on the weekly workload survey conducted for several courses in a number of undergraduate degrees at UPCT, which has allowed the authors for quantifying the average student’s workload for different types of activities, for measuring the planned activities and for simulating the workload time distribution of a given activity as a function of the available time for accomplishment.Once the planned activities are introduced into the chronogram for each course, the model computes and represents graphically an average-student’s workload distribution, which depends on the type of activities and their distribution along the semester. This simulation allows for modifying the time-planning of the most critical activities, in agreement with the faculty, in order to ensure a more even workload distribution.
16
Marshall, Ashley N., and Kenneth C. Lam. "READABILITY OF THE DISABLEMENT OF THE PHYSICALLY ACTIVE (DPA) SCALE IN PEDIATRIC ATHLETES." Orthopaedic Journal of Sports Medicine 7, no. 3_suppl (March 1, 2019): 2325967119S0010. http://dx.doi.org/10.1177/2325967119s00108.
Full textAbstract:
Background: The assessment of patient outcomes in pediatric (ie, youth and adolescent) athletes is critical for comprehensive and whole person healthcare. The Disablement of the Physically Active scale (DPA) is a relatively new generic patient-reported outcome measure (PROM) that was designed specifically for athletic and highly functional patient populations. While the DPA has been used to evaluate health-related quality of life (HRQOL) in adults, little is known about its use in pediatric athletes. The selection of PROMs for pediatric athletes presents with unique challenges, particularly regarding the ability of these athletes to effectively understand the instruments to which they are completing. Therefore, the purpose of this study was to examine the readability of the DPA in pediatric athletes through (1) participant-based and (2) computer-based analyses. Methods: Participant-based analysis was utilized to conduct a preliminary investigation into the subjective readability (ie, a participant’s perceived ability to successfully read the material) of the DPA. Participants were youth athletes (n=13, age=8.7±1.3 years) recruited from a local community athletics league. An investigator administered the San Diego Quick Assessment of Reading Ability to determine each participant’s current reading grade level. Participants were then instructed to read each item of the DPA and circle any words that they did not understand. Frequency counts and percentages were determined for each word identified by participants, within each item of the DPA. Computer-based analysis was utilized to assess the objective readability of the DPA. The Flesch Reading Ease (FRE), Flesch-Kincaid Reading Level (FK), and Gunning Fog Index (FOG) scores were calculated for each item of the DPA. FRE scores range from 0 to 100, with lower scores indicating more difficult reading material. The FRE score is converted to an approximate reading level (FK), ranging from pre-primer (<0) to college (>12), with higher reading level indicating more difficult reading material. Similar to the FK formula, the FOG formula computes to an approximate reading grade level associated with the U.S. education system. Summary statistics (mean± standard deviation, median, and range) were used to report scores for each DPA item. We also reported the number (%) of items that exceeded the 5th – 6th grade reading level, which is the maximum recommended threshold for pediatric patients. Results: It was determined that the average reading grade level of the participants was 3±1.4 years. In regards to subjective readability, participants did not understand an average of 22.1% (48.3/219 words) of the entire DPA scale, with a range across items of 3.1% (Pain = 0.15/5 words) to 34.9% (Overall Fitness = 5.2/15 words). There were 40 instances where greater than 50% of the participants did not recognize a word, and seven words throughout the scale that 100% (13/13) of the participants did not understand: endurance, stability, pivoting, coordination, cardiovascular, endurance and colleagues. For objective readability, FRE scores ranged from 5.8 (very confusing) to 119.7 (very easy) across items. The mean and median across all items was 42.4±33.4 (difficult), and 41.4 (difficult), respectively. The FK reading level ranged from -2.8 (pre-primer) to 13.8 (college), with a mean score of 8.8±4.8 and median score of 8.9. The FOG reading level ranged from 1 (1st grade) to 13.8 (college), with a mean score of 9.3±3.8 and median score of 10.5. When considering both the FK and FOG scores, 81.8% (9/11) of the items exceeded the 5th – 6th grade reading level threshold. Conclusions/Significance: These findings indicate that the overall readability of the DPA may not be appropriate for pediatric athletes. Thus, findings using the DPA in pediatric athletes for clinical or research purposes should be interpreted with caution. Future research is warranted to develop a pediatric version of the DPA, utilizing the results of this study for guidance, as no other generic PROM currently exist for assessing HRQOL specifically in youth and adolescent athletes.
17
"Optically active coordination compunds—51. The circular dichroism of fac-tris-(S-alaninato)rhodium(III)." Polyhedron 15, no. 11 (June 1996): 1913. http://dx.doi.org/10.1016/0277-5387(96)84509-8.
Full text
18
Veeramani, Satheeshkumar, and Sreekumar Muthuswamy. "Hybrid type multi-robot path planning of a serial manipulator and SwarmItFIX robots in sheet metal milling process." Complex & Intelligent Systems, August 28, 2021. http://dx.doi.org/10.1007/s40747-021-00499-3.
Full textAbstract:
AbstractThis work investigates on the coordinated locomotion between a ceiling-mounted serial manipulator and two SwarmItFIX robots. The former holds the machining tool as an end effector, and the other two robots act as swarm robotic fixtures in a sheet metal milling process. A novel offline coordination planner which follows the hierarchical based hybrid type decentralized planning strategy has been proposed. Motion of the serial manipulator and SwarmItFIX robots’ coordinated locomotion are divided into three sub-problems, viz, trajectory planning of serial manipulator, task planning of SwarmItFIX robots, and homogenous prioritized multi-robot path planning of SwarmItFIX robots. Mathematical formulation of all the three sub-problems is developed and presented in this paper. A hexagonal segment that fits inside the boundaries of the workspace is considered as the machining trajectory. The tool velocity is assumed to be constant as it improves the quality of machining. The results obtained from the proposed planner is found to be efficient as the task planning module has computed the precise support locations and support duration for the SwarmItFIX robots. The multi-robot path planning module of the planner computes the optimal collision-free paths of SwarmItFIX robots for all goal positions. Finally, trajectories of SwarmItFIX robots are found to be completely in-line with the trajectory of tool center point (TCP) of the serial manipulator.