Influence of population and exercise protocol characteristics on hemodynamic determinants of post-aerobic exercise hypotension

Due to differences in study populations and protocols, the hemodynamic determinants of post-aerobic exercise hypotension (PAEH) are controversial. This review analyzed the factors that might influence PAEH hemodynamic determinants, through a search on PubMed using the following key words: “postexercise” or “post-exercise” combined with “hypotension”, “blood pressure”, “cardiac output”, and “peripheral vascular resistance”, and “aerobic exercise” combined only with “blood pressure”. Forty-seven studies were selected, and the following characteristics were analyzed: age, gender, training status, body mass index status, blood pressure status, exercise intensity, duration and mode (continuous or interval), time of day, and recovery position. Data analysis showed that 1) most postexercise hypotension cases are due to a reduction in systemic vascular resistance; 2) age, body mass index, and blood pressure status influence postexercise hemodynamics, favoring cardiac output decrease in elderly, overweight, and hypertensive subjects; 3) gender and training status do not have an isolated influence; 4) exercise duration, intensity, and mode also do not affect postexercise hemodynamics; 5) time of day might have an influence, but more data are needed; and 6) recovery in the supine position facilitates systemic vascular resistance decrease. In conclusion, many factors may influence postexercise hypotension hemodynamics, and future studies should directly address these specific influences because different combinations may explain the observed variability in postexercise hemodynamic studies.

Optimization of random amplified polymorphic DNA protocol for molecular identification of Lophius gastrophysus

Lophius gastrophysus has important commercial value in Brazil particularly for foreign trade. In this study, we described the optimization of Random Amplified Polymorphic DNA (RAPD) protocol for identification of L. gastrophysus. Different conditions (annealing temperatures, MgCl concentrations, DNA quantity) were tested to find reproducible and adequate profiles. Amplifications performed with primers A01, ² A02 and A03 generate the best RAPD profiles when the conditions were annealing temperature of 36ºC, 25 ng of DNA quantity and 2.5 mM MgCl2. Exact identification of the species and origin of marine products is necessary and RAPD could be used as an accurate, rapid tool to expose commercial fraud.

Proximity Based Authentication in IoT

IoT consists of essentially thousands of tiny sensor nodes interconnected to the internet, each one of which executes the programmed functions under memory and power limita- tions. The sensor nodes are distributed mainly for gathering data in various situations. IoT envisions the future technologies such as e-health, smart city, auto-mobiles automa- tion, construction sites automation, and smart home. Secure communication of data under memory and energy constraints is major challenge in IoT. Authentication is the first and important phase of secure communication. This study presents a protocol to authenticate resource constraint devices in physical proximity by solely using the shared wireless communication interfaces. This model of authentication only relies on the abundance of ambient radio signals to authenticate in less than a second. To evaluate the designed protocol, SkyMotes are emulated in a network environment simulated by Contiki/COOJA. Results presented during this study proves that this approach is immune against passive and active attacks. An adversary located as near as two meters can be identified in less than a second with minimal expense of energy. Since, only radio device is used as required hardware for the authentication, this technique is scalable and interoperable to heterogeneous nature of IoT.

Validation of ice skating protocol to predict aerobic power in hockey players

Validation ofan Ice Skating Protocol to Predict Aerobic Power in Hockey Players In assessing the physiological capacity of ice hockey players, researchers have often reported the outcomes from different anaerobic skate tests, and the general physical fitness of participants. However, with respect to measuring the aerobic power of ice hockey players, few studies have reported a sport-specific protocol, and currently there is a lack of cohort-specific information describing aerobic power based on evaluations using an on-ice protocol. The Faught Aerobic Skating Test (FAST) uses an on-ice continuous skating protocol to induce a physical stress on a participant's aerobic energy system. The FAST incorporates the principle of increasing workloads at measured time intervals during a continuous skating exercise. Regression analysis was used to determine the estimate of aerobic power within gender and age level. Data were collected on 532 hockey players, (males=384, females=148) ranging in age between 9 and 25 years. Participants completed a laboratory test to measure aerobic power using a modified Bruce protocol, and the on-ice FAST. Regression equations were developed for six male and female, age-specific cohorts separately. The most consistent predictors were weight and final stage completed on the FAST. These results support the application of the FAST to estimate aerobic power among hockey players with R^ values ranging from 0.174 to 0.396 and SEE ranging from 5.65 to 8.58 ml kg' min'' depending on the cohort. Thus we conclude that FAST to be an accurate predictor of aerobic power in age and gender-specific hockey playing cohorts.

Evaluation of a stage II screening protocol for prostate cancer

In 2003, prostate cancer (PCa) is estimated to be the most commonly diagnosed cancer and third leading cause of cancer death in Canada. During PCa population screening, approximately 25% of patients with a normal digital rectal examination (DRE) and intermediate serum prostate specific antigen (PSA) level have PCa. Since all patients typically undergo biopsy, it is expected that approximately 75% of these procedures are unnecessary. The purpose of this study was to compare the degree of efficacy of clinical tests and algorithms in stage II screening for PCa while preventing unnecessary biopsies from occurring. The sample consisted of 201 consecutive men who were suspected of PCa based on the results of a DRE and serum PSA. These men were referred for venipuncture and transrectal ultrasound (TRUS). Clinical tests included TRUS, agespecific reference range PSA (Age-PSA), prostate specific antigen density (PSAD), and free-to-total prostate specific antigen ratio (%fPSA). Clinical results were evaluated individually and within algorithms. Cutoffs of 0.12 and 0.15 ng/ml/cc were employed for PSAD. Cutoffs that would provide a minimum sensitivity of 0.90 and 0.95, respectively were utilized for %fPSA. Statistical analysis included ROC curve analysis, calculated sensitivity (Sens), specificity (Spec), and positive likelihood ratio (LR), with corresponding confidence intervals (Cl). The %fPSA, at a 23% cutoff ({ Sens=0.92; CI, 0.06}, {Spec=0.4l; CI, 0.09}, {LR=1.56; CI, O.ll}), proved to be the most efficacious independent clinical test. The combination of PSAD (cutoff 0.15 ng/ml/cc) and %fPSA (cutoff 23%) ({Sens=0.93; CI, 0.06}, {Spec=0.38; CI, 0.08}, {LR=1.50; CI, 0.10}) was the most efficacious clinical algorithm. This study advocates the use of %fPSA at a cutoff of 23% when screening patients with an intermediate serum PSA and benign DRE.

The effect of a segmental, localized lower limb cooling protocol on muscular strength and balance

The human neuromuscular system is susceptible to changes within the thermal environment. Cold extrinsic temperatures can significantly reduce muscle and nervous system function and communication, which can have consequences for motor performance. A repeated measures design protocol exposed participants to a 12°C cold water immersion (CWI) up to the ankle, knee, and hip to determine the effect that reduced skin and muscle temperature had on balance and strength task execution. Although a linear reduction in the ability to perform balance tasks was seen from the control condition through to the hip CWI, results from the study indicated a significant reduction in dynamic balance (Star Excursion Balance Test reach distance) performance from only the hip CWI (P<0.05). This reduced performance could have been due to an increase in joint stiffness, increased agonist-antagonist co-contraction, and/or reduced isokinetic muscular strength. Reduced physical performance due to cold temperature could negatively impact outdoor recreational athletics.

Key Agreement Against Quantum Adversaries

Key agreement is a cryptographic scenario between two legitimate parties, who need to establish a common secret key over a public authenticated channel, and an eavesdropper who intercepts all their messages in order to learn the secret. We consider query complexity in which we count only the number of evaluations (queries) of a given black-box function, and classical communication channels. Ralph Merkle provided the first unclassified scheme for secure communications over insecure channels. When legitimate parties are willing to ask O(N) queries for some parameter N, any classical eavesdropper needs Omega(N^2) queries before being able to learn their secret, which is is optimal. However, a quantum eavesdropper can break this scheme in O(N) queries. Furthermore, it was conjectured that any scheme, in which legitimate parties are classical, could be broken in O(N) quantum queries. In this thesis, we introduce protocols à la Merkle that fall into two categories. When legitimate parties are restricted to use classical computers, we offer the first secure classical scheme. It requires Omega(N^{13/12}) queries of a quantum eavesdropper to learn the secret. We give another protocol having security of Omega(N^{7/6}) queries. Furthermore, for any k>= 2, we introduce a classical protocol in which legitimate parties establish a secret in O(N) queries while the optimal quantum eavesdropping strategy requires Theta(N^{1/2+k/{k+1}}) queries, approaching Theta(N^{3/2}) when k increases. When legitimate parties are provided with quantum computers, we present two quantum protocols improving on the best known scheme before this work. Furthermore, for any k>= 2, we give a quantum protocol in which legitimate parties establish a secret in O(N) queries while the optimal quantum eavesdropping strategy requires Theta(N^{1+{k}/{k+1}})} queries, approaching Theta(N^{2}) when k increases.

From Classical to Quantum Secret Sharing

Dans ce mémoire, nous nous pencherons tout particulièrement sur une primitive cryptographique connue sous le nom de partage de secret. Nous explorerons autant le domaine classique que le domaine quantique de ces primitives, couronnant notre étude par la présentation d’un nouveau protocole de partage de secret quantique nécessitant un nombre minimal de parts quantiques c.-à-d. une seule part quantique par participant. L’ouverture de notre étude se fera par la présentation dans le chapitre préliminaire d’un survol des notions mathématiques sous-jacentes à la théorie de l’information quantique ayant pour but primaire d’établir la notation utilisée dans ce manuscrit, ainsi que la présentation d’un précis des propriétés mathématique de l’état de Greenberger-Horne-Zeilinger (GHZ) fréquemment utilisé dans les domaines quantiques de la cryptographie et des jeux de la communication. Mais, comme nous l’avons mentionné plus haut, c’est le domaine cryptographique qui restera le point focal de cette étude. Dans le second chapitre, nous nous intéresserons à la théorie des codes correcteurs d’erreurs classiques et quantiques qui seront à leur tour d’extrême importances lors de l’introduction de la théorie quantique du partage de secret dans le chapitre suivant. Dans la première partie du troisième chapitre, nous nous concentrerons sur le domaine classique du partage de secret en présentant un cadre théorique général portant sur la construction de ces primitives illustrant tout au long les concepts introduits par des exemples présentés pour leurs intérêts autant historiques que pédagogiques. Ceci préparera le chemin pour notre exposé sur la théorie quantique du partage de secret qui sera le focus de la seconde partie de ce même chapitre. Nous présenterons alors les théorèmes et définitions les plus généraux connus à date portant sur la construction de ces primitives en portant un intérêt particulier au partage quantique à seuil. Nous montrerons le lien étroit entre la théorie quantique des codes correcteurs d’erreurs et celle du partage de secret. Ce lien est si étroit que l’on considère les codes correcteurs d’erreurs quantiques étaient de plus proches analogues aux partages de secrets quantiques que ne leur étaient les codes de partage de secrets classiques. Finalement, nous présenterons un de nos trois résultats parus dans A. Broadbent, P.-R. Chouha, A. Tapp (2009); un protocole sécuritaire et minimal de partage de secret quantique a seuil (les deux autres résultats dont nous traiterons pas ici portent sur la complexité de la communication et sur la simulation classique de l’état de GHZ).

Simple Low-cost Planar Antenna for Indoor Communication under the Bluetooth Protocol

A single-feed rectangular-ring microstrip antenna is proposed for indoor communication under the Bluetooth protocol. The dimensions of the antenna together with the location of the feed point are optimized through field simulations in order to cover the Bluetooth bandwidth and to avoid linear polarization. The performance and the efficiency of the antenna are illustrated in a real indoor environment

Use of Novel Algorithms MAJE4 and MACJER-320 for Achieving Confidentiality and Message Authentication in SSL & TLS

Extensive use of the Internet coupled with the marvelous growth in e-commerce and m-commerce has created a huge demand for information security. The Secure Socket Layer (SSL) protocol is the most widely used security protocol in the Internet which meets this demand. It provides protection against eaves droppings, tampering and forgery. The cryptographic algorithms RC4 and HMAC have been in use for achieving security services like confidentiality and authentication in the SSL. But recent attacks against RC4 and HMAC have raised questions in the confidence on these algorithms. Hence two novel cryptographic algorithms MAJE4 and MACJER-320 have been proposed as substitutes for them. The focus of this work is to demonstrate the performance of these new algorithms and suggest them as dependable alternatives to satisfy the need of security services in SSL. The performance evaluation has been done by using practical implementation method.

Studies,Design and Development of Network Security Enhancement Services Using Novel Cryptographic Algorithms

Internet today has become a vital part of day to day life, owing to the revolutionary changes it has brought about in various fields. Dependence on the Internet as an information highway and knowledge bank is exponentially increasing so that a going back is beyond imagination. Transfer of critical information is also being carried out through the Internet. This widespread use of the Internet coupled with the tremendous growth in e-commerce and m-commerce has created a vital need for infonnation security.Internet has also become an active field of crackers and intruders. The whole development in this area can become null and void if fool-proof security of the data is not ensured without a chance of being adulterated. It is, hence a challenge before the professional community to develop systems to ensure security of the data sent through the Internet.Stream ciphers, hash functions and message authentication codes play vital roles in providing security services like confidentiality, integrity and authentication of the data sent through the Internet. There are several ·such popular and dependable techniques, which have been in use widely, for quite a long time. This long term exposure makes them vulnerable to successful or near successful attempts for attacks. Hence it is the need of the hour to develop new algorithms with better security.Hence studies were conducted on various types of algorithms being used in this area. Focus was given to identify the properties imparting security at this stage. By making use of a perception derived from these studies, new algorithms were designed. Performances of these algorithms were then studied followed by necessary modifications to yield an improved system consisting of a new stream cipher algorithm MAJE4, a new hash code JERIM- 320 and a new message authentication code MACJER-320. Detailed analysis and comparison with the existing popular schemes were also carried out to establish the security levels.The Secure Socket Layer (SSL) I Transport Layer Security (TLS) protocol is one of the most widely used security protocols in Internet. The cryptographic algorithms RC4 and HMAC have been in use for achieving security services like confidentiality and authentication in the SSL I TLS. But recent attacks on RC4 and HMAC have raised questions about the reliability of these algorithms. Hence MAJE4 and MACJER-320 have been proposed as substitutes for them. Detailed studies on the performance of these new algorithms were carried out; it has been observed that they are dependable alternatives.

Mobility Metric based LEACH-Mobile Protocol

Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol.

Routing protocol enhancement for handling node mobility in wireless sensor networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.