Miracle-dz/UniFAR-FTUs huggingface dataset:
Understanding tourist experience through embodiment: The contribution of critical tourism and disability studies

This chapter seeks to understand the tourist experiences of people with disabilities, including the seniors who also constitute the accessible tourism market. Tourism experiences can be viewed through many approaches. The following discussion is situated within the framework of critical theory in tourism studies and critical disability studies theory, both of which focus on ends rather than means, examining social power structures with a commitment to emancipation. The lived experience of the person is the subject matter and within the approaches of critical tourism and critical disability studies, the lived experience is a bodily experience. This chapter examines the embodied experience of those with disabilities within the tourism context. For the purposes of this chapter, the authors take Osborne’s (2000: 51) definition of embodiment where ‘ ‘‘embodiment’’ is used to describe the way in which the bodily bases of individuals’ actions and interactions are socially structured: that is, embodiment is a social as well as natural process’. In this case, embodiment as it relates to disabilities includes mobility, hearing, vision, cognitive/ learning, sensitivity and mental health but, in the developing field of critical disability and tourism studies, the areas most researched are mobility and vision. While it is recognised that disabled/non-disabled subjectivity intersects with other subjectivities such as gender, age, culture, ethnicity, sexuality, economic position etc., a dearth of research in tourism and disability studies (and the word length of this chapter) prevent a discussion of these intersections. Boorstin (1987) in The Lost Art of Travel distinguished between travellers of the past and today’s tourists, noting that ‘until almost the present century, travel abroad was uncomfortable, difficult and expensive’ (p. 80). Indeed, the word travel comes from travail – ‘meaning ‘‘trouble’’, ‘‘work’’
The self-regulation of health and illness behaviour.

b1. Introduction Part One: Foundations of Self-Regulation Theory 2. a Common-Sense Model of Illness Cognition and Behaviour 3. Social Cognition, Self-Regulation of Health and Illness Behaviour 4. Current Issues in the Self-Regulation of Health and Illness Behaviour Part Two: Cognitive Representations of Illness 5. Representations of Chronic Illnesses 6. Representational Beliefs about Psychosomatic Illnesses 7. Cross-Cultural Research on Illness Representations 8. Illness Perceptions of Partners and Caregivers: Impact on the Experiences of the Patient Part Three: Coping Procedures and Appraisal Processes 9. Beliefs about Medications and Treatment: Influences on Adherence and Well-Being 10. Personality Influences on Health-Related Coping and Appraisals 11. Social Factors Influencing Appraisal Processes Part Four: Concrete-Emotional Processes 12. Emotional Distress: Impact on Illness Appraisals and Responses to Health Threats 13. Affect Regulation, Defensive Denial, and Responses to Health Threats 14. Age-Related Changes in Affect Regulation: Impact on Illness-Related Behaviours Part Five: 15. Interventions for Improving Disease Control and recovery 16. Cognitive-Affective Interventions for Facilitating Effective Decision-Making in the Use of Genetic Testing 17. Interventions for Increasing the Use of Cancer Screening Services
Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture

In this paper, we present multi-threaded algorithms for graph coloring suitable to the shared memory programming model. Initially, we describe shared memory implementations to the algorithms widely known in the literature like Jones Plassman graph coloring. Later, we propose new approaches to solve the problem of coloring using mutex locks while making sure that deadlocks do not occur. Using datasets from real world graphs, we evaluate the performance of all these algorithms on the Intel platform. We compare the performance of sequential graph coloring v/s our proposed approaches and analyze the speedup obtained against the existing algorithms from the literature. The results show that the speedup obtained by our proposed algorithms in terms of the time taken for coloring is consequential. We also provide a direction for future work towards improving the performance further in terms of different metrics.
Relationship between phonological abilities and auditory processing in children with developmental dyslexia

Developmental dyslexia is a specific reading disability characterized by difficulty in phoneme-grapheme decoding and in perceiving similar pairs of similar phonemes. The aim of this study was to characterize the performance of dyslexic children in auditory and phonological awareness skills and correlate them on this population. A number of 20 children attending 2nd to 4th grades divided into GI: formed by 10 children with interdisciplinary diagnosis of dyslexia, both genders and aged 8 to 12 years old and GII: formed by 10 good readers, paired according to gender and age with GI. As procedure applied hearing evaluation, auditory processing evaluation and phonological awareness were used. The results revealed statistic significant difference between auditory skills of sequential memory for verbal sounds, speech intelligibility with ipsilateral and contralateral competitive message, dichotic of digits test, and staggered spondaic word test when the GI was compared to GII. The same occurred with the subtests of synthesis, segmentation, manipulation and transposition. The findings of this study evidenced correlation between hearing memory tests, syllabic and phonemic manipulation and association between hearing and phonologic abilities, suggesting that the hearing processes interfere directly in the acoustic aspects perception, temporal and sequential of the sounds for the formation of a stable phonologic representation.
Content-centric Network-Based MANET for Streaming Video Transmission

The content centric network (CCN) is the new communication paradigm conceived for the future Internet. The basic idea of CCN is to use content names as addresses instead of IP-based host addresses. Video streaming services like YouTube represent the most important part of the internet traffic. Recently, the impact of mobility on video streaming over multi-hop wireless networks has become the real challenge for researchers. In this paper we consider CCN as a fundamental driver for mobile ad hoc network (MANET) protocol design. For simulation the CCN approach implemented in ndnSIM has been used. Thus, we propose to extend this architecture to evaluate QoS of video streaming in CCN-based MANET. Through simulations, we investigate the feasibility and the performance of this design. Then we compare the benefits of our proposal routing protocol for CCN-based MANET with the classical routing protocols in MANET. Results show that mobile networks can be made more effective and efficient through CCN Network.
Non-overlapping domain decomposition method and nodal finite element method

The non-overlapping domain decomposition method is an efficient approach for solving time harmonic scattering wave problems. It is used here to reduce large size systems solution to that of several systems of small size and to construct efficient procedures to couple finite element and boundary element methods. The lack of a satisfactory treatment of the so-called cross-points, nodes being shared by more than two domains, prevents one from taking advantage of the simplicity of the standard finite element method and the effectiveness of a domain decomposition procedure at the same time. A new approach overcoming this difficulty is introduced. It mainly consists in keeping a strong coupling at cross-points by enforcing a strong continuity requirement at these points for both trial and the test functions. 1. Introduction. Several methods have been devised in the last couple of years to solve the large size linear systems arising from the discretization of time harmonic scattering problems (see for example [26, 14, 19, 12, 22]). This is primarily because of the oscillatory character of the solution which accordingly requires resorting to very refined meshes. In addition, the lack of strong coercive properties of the underlaying equations, as compared for instance to those occurring in structural mechanics problems, seriously damages the efficiency of the usual solvers. This partly explains why various domain decomposition techniques have been proposed to deal with such a class of problems The aim of this paper is to contribute to this circle of techniques. We devise a new approach for the cross-points, that is, points being shared by more that two subdomains, reducing the domain decomposition procedure to a simple and efficient iterative method for solving the nodal equations. We then show that this method adapts easily to the coupling BEM-FEM algorithm. In addition, we introduce an algorithm called " evanescent modes damping algorithm " [9, 8], in order to suitably treat the evanescent part of the solution and thus improve the convergence of the domain decomposition method. The techniques presented in this paper are described in the framework of the treatment of the Helmholtz equation using the non-overlapping domain decomposition method originally introduced by P.-L. Lions [25] for solutions of the Laplace equation. It was subsequently extended to time harmonic wave propagation problems by B. Després [16, 18]. In this way, we can illustrate the several advantages it owns. It reduces the large size system solution to that of …
Distracted pedestrian sustains orbital fracture while on cell phone

Use of cell phones in the general population has become increasingly commonplace. The distracting effects of cell phones among automobile drivers are well established, and legislation prohibits the use of handheld cell phones while driving in several states. Recent research has focused on the similar distracting effects of cell phones in the pedestrian population. In this report, an older gentleman suffered extensive facial trauma requiring surgery as a direct effect of cell phone use at the time the trauma occurred. This case highlights the role that portable electronic devices can play as a cause of ocular trauma.
Object oriented metrics: precision tools and configurable visualisations

Software metrics are a valuable tool in helping software engineers to develop large, complex software systems. However, it is vital that transparency and precision are maintained at all stages. We contend that without grammars we cannot define metrics rigorously, without transparent and powerful parsing tools we cannot collect data accurately and without flexible configurable visualisation we cannot exploit the full potential of our data. We report the development of JST, a semantic analyser for Java, and show how it is incorporated into our pipeline-based approach to metrics collection and visualisation. We describe a new visualisation, class clusters, which not only demonstrate the data generated by our tools but also illustrate the value of 3D virtual worlds for visualising software metrics.
Inhibition of p38 MAPK-Dependent Excision Repair Cross-Complementing 1 Expression Decreases the DNA Repair Capacity to Sensitize Lung Cancer Cells to Etoposide

Etoposide (VP-16), a topoisomerase II inhibitor, is an effective anticancer drug currently used for the treatment of a wide range of cancers. Excision repair cross-complementary 1 (ERCC1) is a key protein involved in the process of nucleotide excision repair. High level of ERCC1 expression in cancers is associated with resistance to DNA damage-based chemotherapy. In this study, the effects of p38 mitogen-activated protein kinase (MAPK) signal on the ERCC1 expression induced by etoposide in non–small cell lung cancer (NSCLC) cell lines was investigated. Etoposide increased phosphorylated MAPK kinase 3/6 (MKK3/6)-p38 MAPK and ERCC1 protein and mRNA levels in A549 and H1975 cells. Moreover, SB202190, a p38 inhibitor, or knockdown of p38 expression by specific short interfering RNA (siRNA) significantly decreased the etoposide-induced ERCC1 protein levels and DNA repair capacity in etoposide-exposed NSCLC cells. Enhancement of p38 activation by constitutively active MKK6 (MKK6E) increased ERCC1 protein levels. Specific inhibition of ERCC1 by siRNA significantly enhanced the etoposide-induced cytotoxicity and hypoxanthine guanine phosphoribosyltransferase (hprt) gene mutation rate. Moreover, the Hsp90 inhibitor 17-allylamino-17-demethoxygeldanamycin (17-AAG) could decrease the etoposide-induced p38 MAPK-mediated ERCC1 expression and augment the cytotoxic effect and growth inhibition by etopsoside. 17-AAG and etoposide-induced synergistic cytotoxic effect and DNA repair capacity decrease could be abrogated in lung cancer cells with MKK6E or HA-p38 MAPK expression vector transfection. Our results suggest that in human NSCLC cells, ERCC1 is induced by etoposide through the p38 MAPK pathway, and this phenomenon is required for NSCLC survival and resistant DNA damage. Mol Cancer Ther; 11(3); 561–71. ©2011 AACR.
A Lightweight Message Dissemination Strategy for Minimizing Delay in Online Social Networks

Online Social Networks (OSNs) have attracted intensive attention for the reason that they provide users a convenient platform to share ideas, post events, and disseminate messages. Each OSN user commonly owns multiple social applications (Facebook, Google Plus and Twitter, etc.). They enjoy disseminating messages within one particular social application as well as forwarding interesting information to other social applications. In OSNs, some time-insensitive messages (disaster warnings, virus alerts, and search notices, etc.) are badly in need of being disseminated to specific users or applications as soon as possible. However, sudden message dissemination among users is bound to put a significant burden on network resources. Taking the dissemination cost into consideration, we propose a lightweight Message Dissemination strategy for Minimizing Delay in OSNs (MDMD), which first defines the user's activeness according to the switch habit, among different social applications. Furthermore, depending on the activeness, an optimal user within each social application is selected to assist in disseminating the message. Simulation results show that, compared with other dissemination strategies, MDMD achieves the lowest average delay, and lower average hopcounts.
Schema Independence of Learning Algorithms

Learning novel concepts and relations from structured data sets, such as relational databases, is an important problem with many applications in data management and machine learning. It is well established that the same data set may be represented under different schemas due to various reasons, such as efficiency, data quality, and usability. Further, the schema of a database may evolve over time. In this paper, we argue that relational learning algorithms should be schema independent, i.e. they should return basically the same results across various schemas of the same data set. Schema independent relational learning algorithms require less manual tuning and are easier to use over real-world data sets. We formally define and explore this property for different types of relational learning algorithms. We analyze the schema independence of some popular relational learning algorithms both theoretically and empirically. Our results indicate that these algorithms are not generally schema independent and will deliver different results and accuracies or require different amount of training data over different schemas for the same data set.
Facility Location Problem with Different Type of Clients

This paper proposes a new model of facility location problem referred to as k-product uncapacitated facility location problem with multi-type clients. The k-product uncapacitated facility location problem with multi- type clients consists of two set of sites, one is the set of demand points where clients are located and the other is the set of sites where facilities of unlimited capacities can be set up to serve the clients. Each facility can provide only one kind of products. Each client needs to be served by a set of facilities depending on which products it needs. Each facility can be set up only for one of the k products with a non-negative fixed cost determined by the product it is designated to provide. There is also a nonnegative cost of shipping goods between each pair of locations. The problem is to determine the set of facilities to be set up and to find an assignment of each client to a set of facilities so that the sum of the setup costs and the shipping costs is minimized. Under the assumption that the setting costs is zero and the shipping costs are in facilities centered metric space, it is shown that the problem with two kinds of clients is NP-complete. Furthermore a heuristic algorithm with worst case performance ratio not more than 2-1/k is presented for any integer k.
Expansion and Lack Thereof in Randomly Perturbed Graphs

This paper studies the expansion properties of randomly perturbed graphs. These graphs are formed by adding, for example, a random 1-out or very sparse Erdős-Rényi graph to an arbitrary connected graph. The central results show that there exists a constant δ such that when any connected n-vertex base graph G 0 is perturbed by adding a random 1-out then, with high probability, the resulting graph has for all S ⊆ V with . When G 0 is perturbed by adding a random Erdős-Rényi graph, 𝔾 n,ε/n , the expansion of the perturbed graph depends on the structure of the base graph. A necessary condition for the base graph is given under which the resulting graph is an expander with high probability. The proof techniques are also applied to study rapid mixing in the small-worlds graphs described by Watts and Strogatz in [Watts and Strogatz 98] and by Kleinberg in [Kleinberg 00]. Analysis of Kleinberg's model shows that the graph stops being an expander exactly at the point where a decentralized algorithm is effective in constructing a short path. The proofs of expansion rely on a method of summing over subsets of vertices that allows an argument based on the first-moment method to succeed.
Glomerular permeability: a never-ending saga.

the paper by tanner et al. ([27][1]) revisits the critical question of how the intricate glomerular capillary membrane provides such a highly restrictive barrier to macromolecules while still allowing the movement of vast volumes of protein-free fluid ([1][2], [7][3], [13][4], [14][5], [20][6]). In
Focused Static Analyses for the Java Bytecode

Flow sensitive static analyses are often more precise than their flow insensitive counterparts, but much more expensive. To cope with this problem, we defined, some years ago, a watchpoint semantics as an abstract interpretation of a trace semantics. It is not itself a trace semantics, but it lets us specify flow and control sensitive analyses which are focused on a given set of program points only, called watchpoints. This means that the cost of such analyses is proportional to the number of the watchpoints, usually relatively small. We describe here our application of this technique to a complex and unstructured language such as (mono-threaded) Java bytecode, extensively used in the Internet, and we experiment with both an escape and a class analysis of non-trivial programs. We show that the analyses are actually focused and more efficient than traditional, unfocused analyses.
The Time Divide: Work, Family, and Gender Inequality (The Family and Public Policy)

In a panoramic study that draws on diverse sources, Jerry Jacobs and Kathleen Gerson explain why and how time pressures have emerged and what we can do to alleviate them. In contrast to the conventional wisdom that all Americans are overworked, they show that time itself has become a form of social inequality that is dividing Americans in new ways--between the overworked and the underemployed, women and men, parents and non-parents. They piece together a compelling story of the increasing mismatch between our economic system and the needs of American families, sorting out important trends such as the rise of demanding jobs and the emergence of new pressures on dual earner families and single parents. Comparing American workers with their European peers, Jacobs and Gerson also find that policies that are simultaneously family-friendly and gender equitable are not fully realized in any of the countries they examine. As a consequence, they argue that the United States needs to forge a new set of solutions that offer American workers new ways to integrate work and family life.
Rationality Model and Choice Optimization: One Answer to Aumann's "Open Problem" and One Introduction to a New Mathematical Tool

The dynamical process of choice optimization is the realistic starting point of constructing dynamical economics or evolutionary economics. Rationality model is the logical basis for choice optimization. But in fact, as the common theoretical base in modern economics, rationality modeling is a complex problem unsolved. In this paper, a model of natural rationality (R) is introduced, and R is defined as nonlinear function of agent's output benefits (OBS) and input costs (ICS). This mathematical model of natural rationality can be considered as one answer to Aumann's "open problem". On the basis of the rationality model, mathematical model of natural rationality is compared with model of bounded (or incomplete) rationality and unbounded (or complete) rationality, and their relations are analyzed according to the completeness degree of information. At last, the dynamic optimization process of rational choice on the basis of mathematical model of natural rationality is introduced.
Impact of Obesity on Complications of Laparoscopic Simple or Radical Nephrectomy

Objective: To determine the impact of obesity on complications in laparoscopic simple or radical nephrectomy. Patients and Methods: The medical files of 215 patients who underwent laparoscopic simple or radical nephrectomy in our center between 2004 and 2014 were reviewed. A body mass index of 30 kg/m² was used to divide the patients into obese and non-obese groups. Pre-operative data and intra- and post-operative complications were compared between the 2 groups. Results: There were respectively 163 and 52 patients in the non-obese and obese groups, which were comparable in terms of age, sex, and history of surgery. In the obese group, operative specimens were significantly heavier (772 vs. 534 g in the non-obese group; p = 0.005) and durations of surgery was significantly longer (244 vs. 216 minutes; p = 0.003). However no significant differences were found between the 2 groups for duration of hospitalization, surgical conversion, estimated blood loss, or intra- or post-operative complications. Conclusion: Laparoscopic simple or radical nephrectomy is technically feasible in obese patients but the surgery may take more time, notably due to dissection difficulties. Our results showed that the risk of intra- and post-operative complications is not higher in obese patients compared to non-obese patients, except for a possible, but statistically undemonstrated, higher risk of abdominal wall complications, and that the laparoscopic approach should be the preferred technique in patients with high body mass index.