Factorizations of the complete graph into C-5-factors and 1-factors

In this paper, we show that K-10n can be factored into alpha C-5-factors and beta 1-factors for all non-negative integers alpha and beta satisfying 2alpha + beta = 10(n) - 1.

A ten-year follow-up of human leptospirosis in Uruguay: an unresolved health problem

Leptospira spp. are delicate bacteria that cannot be studied by usual microbiological methods. They cause leptospirosis, a zoonotic disease transmitted to humans through infected urine of wild or domestic animals. We studied the incidence of this disease in the Uruguayan population, its epidemiologic and clinical features, and compared diagnostic techniques. After examining 6,778 suspect cases, we estimated that about 15 infections/100,000 inhabitants occurred yearly, affecting mainly young male rural workers. Awareness about leptospirosis has grown among health professionals, and its lethality has consequently decreased. Bovine infections were probably the principal source of human disease. Rainfall volumes and floods were major factors of varying incidence. Most patients had fever, asthenia, myalgias or cephalalgia, with at least one additional abnormal clinical feature. 30-40% of confirmed cases presented abdominal signs and symptoms, conjunctival suffusion and altered renal or urinary function. Jaundice was more frequent in patients aged > 40 years. Clinical infections followed an acute pattern and their usual outcome was complete recovery. Laboratory diagnosis was based on indirect micro-agglutination standard technique (MAT). Second serum samples were difficult to obtain, often impairing completion of diagnosis. Immunofluorescence was useful as a screening test and for early detection of probable infections.

A taxonomy for the flexible job shop scheduling problem

This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have been developed to obtain good solutions in reasonable time for FSJPs with different objective functions and constraints, no study which systematically reviews the FJSP literature has been encountered. In the proposed taxonomy, the type of study, type of problem, objective, methodology, data characteristics, and benchmarking are the main categories. In order to verify the proposed taxonomy, a variety of papers from the literature are classified. Using this classification, several inferences are drawn and gaps in the FJSP literature are specified. With the proposed taxonomy, the aim is to develop a framework for a broad view of the FJSP literature and construct a basis for future studies.

Complete nucleotide sequence analysis of a Brazilian dengue virus type 2 strain

In the last decade, dengue fever (DF) in Brazil has been recognized as an important public health problem, and an increasing number of dengue haemorrhagic fever (DHF) cases have been reported since the introduction of dengue virus type 2 (DEN-2) into the country in 1990. In order to analyze the complete genome sequence of a DEN-2 Brazilian strain (BR64022/98), we designed primers to amplify contiguous segments of approximately 500 base pairs across the entire sequence of the viral genome. Twenty fragments amplified by reverse transcriptase-PCR were cloned, and the complete nucleotide and the deduced amino acid sequences were determined. This constitutes the first complete genetic characterization of a DEN-2 strain from Brazil. All amino acid changes differentiating strains related to the Asian/American-Asian genotype were observed in BR64022/98, indicating the Asiatic origin of the strain.

Construction and characterisation of a complete reverse genetics system of dengue virus type 3

Dengue virulence and fitness are important factors that determine disease outcome. However, dengue virus (DENV) molecular biology and pathogenesis are not completely elucidated. New insights on those mechanisms have been facilitated by the development of reverse genetic systems in the past decades. Unfortunately, instability of flavivirus genomes cloned in Escherichia coli has been a major problem in these systems. Here, we describe the development of a complete reverse genetics system, based on the construction of an infectious clone and replicon for a low passage DENV-3 genotype III of a clinical isolate. Both constructs were assembled into a newly designed yeast- E. coli shuttle vector by homologous recombination technique and propagated in yeast to prevent any possible genome instability in E. coli . RNA transcripts derived from the infectious clone are infectious upon transfection into BHK-21 cells even after repeated passages of the plasmid in yeast. Transcript-derived DENV-3 exhibited growth kinetics, focus formation size comparable to original DENV-3 in mosquito C6/36 cell culture. In vitro characterisation of DENV-3 replicon confirmed its identity and ability to replicate transiently in BHK-21 cells. The reverse genetics system reported here is a valuable tool that will facilitate further molecular studies in DENV replication, virus attenuation and pathogenesis.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Peer-reviewed

Complete Analysis of Configuration Rules to Guarantee Reliable Network Security Policies

Peer-reviewed

Surgical treatment of hamstring injuries and disorders – the clinical spectrum from chronic tendinopathy to complete rupture

Hamstring muscle injuries and tendon disorders are common, especially in sports. They can be severe and difficult to treat, often resulting in impaired athletic performance and long rehabilitation times. Previous studies considering treatment of these problems are scarce. The current study was designed to investigate the effect of surgery on different types of hamstring muscle injuries and on proximal hamstring tendinopathy. In addition, we wanted to study the typical histopathological findings relating to proximal hamstring tendinopathy. In the study of complete (all three muscles torn) proximal hamstring avulsions (41 patients), our results showed that early operative treatment gives significantly better results than late surgery, and is therefore recommended. Despite this, considerable improvement of symptoms could also be achieved in chronic cases. In the study of partial (one or two muscles torn) proximal hamstring tears (47 patients), we observed that these injuries can cause significant functional deficit and impaired performance in athletes. The main finding was that after surgical repair most of the patients were able to return to their pre-injury level of sports. In the study of distal hamstring tears (18 patients), the results showed that surgical treatment had a good effect in the majority of these cases. In proximal hamstring tendinopathy, the main problem is pain which limits sports. In this study (90 patients), we found that after unsuccessful conservative treatment, surgery was a good treatment option resulting in full return to sports in most cases. In tendinopathic hamstring tendons, the morphological changes of tendinosis were largely identical to those previously described in other common (e.g. Achilles and patellar) tendinopathies. In chronic proximal hamstring avulsions, and also in reoperations, a large defect between distally retracted tendons and the ischial tuberosity may occasionally prevent anatomic reinsertion. We have described a reconstruction method using fascia lata autograft augmentation to be used in these most challenging repairs. This technique was utilized in the treatment of five patients, with encouraging results.

The knapsack problem approach in solving partial hedging problems of options

En option är ett finansiellt kontrakt som ger dess innehavare en rättighet (men medför ingen skyldighet) att sälja eller köpa någonting (till exempel en aktie) till eller från säljaren av optionen till ett visst pris vid en bestämd tidpunkt i framtiden. Den som säljer optionen binder sig till att gå med på denna framtida transaktion ifall optionsinnehavaren längre fram bestämmer sig för att inlösa optionen. Säljaren av optionen åtar sig alltså en risk av att den framtida transaktion som optionsinnehavaren kan tvinga honom att göra visar sig vara ofördelaktig för honom. Frågan om hur säljaren kan skydda sig mot denna risk leder till intressanta optimeringsproblem, där målet är att hitta en optimal skyddsstrategi under vissa givna villkor. Sådana optimeringsproblem har studerats mycket inom finansiell matematik. Avhandlingen "The knapsack problem approach in solving partial hedging problems of options" inför en ytterligare synpunkt till denna diskussion: I en relativt enkel (ändlig och komplett) marknadsmodell kan nämligen vissa partiella skyddsproblem beskrivas som så kallade kappsäcksproblem. De sistnämnda är välkända inom en gren av matematik som heter operationsanalys. I avhandlingen visas hur skyddsproblem som tidigare lösts på andra sätt kan alternativt lösas med hjälp av metoder som utvecklats för kappsäcksproblem. Förfarandet tillämpas även på helt nya skyddsproblem i samband med så kallade amerikanska optioner.

Motivational model of problem drinking for men and women /

This thesis tested a path model of the relationships of reasons for drinking and reasons for limiting drinking with consumption of alcohol and drinking problems. It was hypothesized that reasons for drinking would be composed of positively and negatively reinforcing reasons, and that reasons for limiting drinking would be composed of personal and social reasons. Problem drinking was operationalized as consisting of two factors, consumption and drinking problems, with a positive relationship between the two. It was predicted that positively and negatively reinforcing reasons for drinking would be associated with heavier consumption and, in turn, more drinking problems, through level of consumption. Negatively reinforcing reasons were also predicted to be associated with drinking problems directly, independent of level of consumption. It was hypothesized that reasons for limiting drinking would be associated with lower levels of consumption and would be related to fewer drinking problems, through level of consumption. Finally, among women, reasons for limiting drinking were expected to be associated with drinking problems directly, independent of level of consumption. The sample, was taken from the second phase of the Niagara Young Aduh Health Study, a community sample of young adult men and women. Measurement models of reasons for drinking, reasons for limiting drinking, and problem drinking were tested using Confirmatory Factor Analysis. After adequate fit of each measurement model was obtained, the complete structural model, with all hypothesized paths, was tested for goodness of fit. Cross-group equality constraints were imposed on all models to test for gender differences. The results provided evidence supporting the hypothesized structure of reasons for drinking and problem drinking. A single factor model of reasons for limiting drinking was used in the analyses because a two-factor model was inadequate. Support was obtained for the structural model. For example, the resuhs revealed independent influences of Positively Reinforcing Reasons for Drinking, Negatively Reinforcing Reasons for Drinking, and Reasons for Limiting Drinking on consumption. In addition. Negatively Reinforcing Reasons helped to account for Drinking Problems independent of the amount of alcohol consumed. Although an additional path from Reasons for Limiting Drinking to Drinking Problems was hypothesized for women, it was of marginal significance and did not improve the model's fit. As a result, no sex differences in the model were found. This may be a result of the convergence of drinking patterns for men and women. Furthermore, it is suggested that gender differences may only be found in clinical samples of problem drinkers, where the relative level of consumption for women and men is similar.

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

The role of schizotypy and creativity in a group problem-solving task

The well-studied link between psychotic traits and creativity is a subject of much debate. The present study investigated the extent to which schizotypic personality traits - as measured by O-LIFE (Oxford-Liverpool Inventory of Feelings and Experiences) - equip healthy individuals to engage as groups in everyday tasks. From a sample of 69 students, eight groups of four participants - comprised of high, medium, or low-schizotypy individuals - were assembled to work as a team to complete a creative problem-solving task. Predictably, high scorers on the O-LIFE formulated a greater number of strategies to solve the task, indicative of creative divergent thinking. However, for task success (as measured by time taken to complete the problem) an inverted U shaped pattern emerged, whereby high and low-schizotypy groups were consistently faster than medium schizotypy groups. Intriguing data emerged concerning leadership within the groups, and other tangential findings relating to anxiety, competition and motivation were explored. These findings challenge the traditional cliche that psychotic personality traits are linearly related to creative performance, and suggest that the nature of the problem determines which thinking styles are optimally equipped to solve it. (C) 2009 Elsevier Ltd. All rights reserved.

Ω-results for Beurling's zeta function and lower bounds for the generalised Dirichlet divisor problem

In this paper we study generalised prime systems for which the integer counting function NP(x) is asymptotically well behaved, in the sense that NP(x)=ρx+O(xβ), where ρ is a positive constant and . For such systems, the associated zeta function ζP(s) is holomorphic for . We prove that for , for any ε>0, and also for ε=0 for all such σ except possibly one value. The Dirichlet divisor problem for generalised integers concerns the size of the error term in NkP(x)−Ress=1(ζPk(s)xs/s), which is O(xθ) for some θ<1. Letting αk denote the infimum of such θ, we show that .

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.