Sökresultat

Filtyp

Din sökning på "*" gav 531336 sökträffar

Energy Efficient Cellular Strategy: Virtual Cell Based Recoverable Sleeping Mode

Global warming has drawn more and more attention from ICT industries to reduce the energy consumption of mobile cellular network recently. Lots of techniques to make the energy efficiency network, e.g. making the cell with low load switch off, have been proposed but less research on how to offer the Quality of Service(QoS) guarantee to the users which were connected to the off cell. Due to this fa

Arbetslös igår, sjukskriven idag; morgondagens förtidspensionär?

In Sweden there is a covariance between long-term illness and unemployment - when the unemployment is high usually the absence due to long-term illness is low, and vice versa. In the paper this covariance is analyzed, as well as unemployed long-term ill often is ending up with an early retirement pension.

Analysis and selection of control variables and structures for the Open Plate Reactor

In this paper the choices of control variables and control structures are investigated for the Open Plate Reactor. Since the process design is very flexible, it allows many different control structures and variables and it may be non-trivial to find the most suitable choice. Analysis with the Relative Gain Array indicates that the flexible process configuration of the OPR enables a decentralized c

Doctoral student supervisor or project leader – or both?

Doctoral education in the fields of medicine and health sciences is often deeply integrated with the research of departments and of individual researchers. Although this arrangement undoubtedly comes with many benefits it could also be expected to raise challenges for doctoral student learning and supervision. Here I report on findings from workshops for research supervisors at a large Swedish med

Automatic discovery of feature sets for dependency parsing

This paper describes a search procedure to discover optimal feature sets for dependency parsers. The search applies to the shift–reduce algorithm and the feature sets are extracted from the parser configuration. The initial feature is limited to the first word in the input queue. Then, the procedure uses a set of rules founded on the assumption that topological neighbors of significant features in