Syfte – Syftet med denna studie är att mäta förväntningar och behov hos deltagare vid ett kommande idrottsevent i Sverige, Öppna Svenska Mästerskapen Triathlon – långdistans (SM). Design/metod/tillvägagångssätt – Mätningen utfördes med hjälp utav två mätinstrument, SERVQUAL för att mäta deltagarnas förväntningar och Kano för att mäta deltagarnas behov. En webbenkät utformades där 103 respondenter svarade. Resultat – Studiens resultat påvisar ett övervägande högt värde av servicekvalitet vid tidigare triathlonevenemang men även höga förväntningar på det kommande tävlingsevenemanget (SM). Resultatet visar därtill att determinanterna materiella ting, tjänstvillighet och empati summerande kan ses som outtalade behov och därav som attraktiva kvaliteter. Determinanterna tillförlitlighet och försäkran kan ses som uttalade behov och kan därav fungera som konkurrensfördelar mot andra tävlingsevenemang. Originalitet/värde – Studiens värde visar sig i hur företag och andra organisationer kan erhålla information och kunskap om sina kunder gällande mätandet av förväntningar och behov för att i framtiden använda detta till att skapa mervärde till sina tjänster. Nyckelord – Mätning, förväntningar, behov, SERVQUAL, Kano / Purpose - The purpose of this paper is to measure expectations and needs of participants at a upcoming triathlon sporting event in Sweden called Öppna Svenska Mästerskapen Triathlon – långdistans (SM). Design/methodology/approach – The measurement was made with the help of two measuring instruments, SERVQUAL for measuring the participants expectations and Kano for measuring the participants needs. An online survey was utilized with a total of 103 respondents. Findings – Results showed an overall high value of service quality at earlier triathlon events but also high expectations on the upcoming event (SM). Results showed that the determinants tangibles, responsiveness and empathy could be seen as summing unspoken needs and thereby as attractive qualities. The determinants reliability and assurance could be seen as spoken needs and which the organizer of the sporting event could use to compete against other organizers. Originality/value – The paper’s importance is demonstrated by how companies and organizers could obtain information and knowledge of the customers regarding measuring expectations and needs in order to create value-added services in the future. Keywords – Measure, expectations, needs, SERVQUAL, Kano

The vector-valued coarea formula provides a relationship between the integral of the Jacobian of a map from high dimensions down to low dimensions with the integral over the measure of the fibers of this map. We explore minimizers of this functional, proving existence using both a variational approach and an approach with currents. Additionally, we consider what properties these minimizers will have and provide examples. Finally, this problem is considered in metric spaces, where a third existence proof is given.

Measures of semantic distance have received a great deal of attention recently in the field of computational lexical semantics. Although techniques for approximating the semantic distance of two concepts have existed for several decades, the introduction of the WordNet lexical database and improvements in corpus analysis have enabled significant improvements in semantic distance measures. <br /><br /> In this study we investigate a special kind of semantic distance, called <em>semantic relatedness</em>. Lexical semantic relatedness measures have proved to be useful for a number of applications, such as word sense disambiguation and real-word spelling error correction. Most relatedness measures rely on the observation that the shortest path between nodes in a semantic network provides a representation of the relationship between two concepts. The strength of relatedness is computed in terms of this path. <br /><br /> This dissertation makes several significant contributions to the study of semantic relatedness. We describe a new measure that calculates semantic relatedness as a function of the shortest path in a semantic network. The proposed measure achieves better results than other standard measures and yet is much simpler than previous models. The proposed measure is shown to achieve a correlation of <em>r</em> = 0. 897 with the judgments of human test subjects using a standard benchmark data set, representing the best performance reported in the literature. We also provide a general formal description for a class of semantic distance measures &mdash; namely, those measures that compute semantic distance from the shortest path in a semantic network. Lastly, we suggest a new methodology for developing path-based semantic distance measures that would limit the possibility of unnecessary complexity in future measures.

Our main objective of this thesis is to measure the conflict risk and then on the basis of this risk allocate the slots for future communication.

Measures of semantic distance have received a great deal of attention recently in the field of computational lexical semantics. Although techniques for approximating the semantic distance of two concepts have existed for several decades, the introduction of the WordNet lexical database and improvements in corpus analysis have enabled significant improvements in semantic distance measures. <br /><br /> In this study we investigate a special kind of semantic distance, called <em>semantic relatedness</em>. Lexical semantic relatedness measures have proved to be useful for a number of applications, such as word sense disambiguation and real-word spelling error correction. Most relatedness measures rely on the observation that the shortest path between nodes in a semantic network provides a representation of the relationship between two concepts. The strength of relatedness is computed in terms of this path. <br /><br /> This dissertation makes several significant contributions to the study of semantic relatedness. We describe a new measure that calculates semantic relatedness as a function of the shortest path in a semantic network. The proposed measure achieves better results than other standard measures and yet is much simpler than previous models. The proposed measure is shown to achieve a correlation of <em>r</em> = 0. 897 with the judgments of human test subjects using a standard benchmark data set, representing the best performance reported in the literature. We also provide a general formal description for a class of semantic distance measures &mdash; namely, those measures that compute semantic distance from the shortest path in a semantic network. Lastly, we suggest a new methodology for developing path-based semantic distance measures that would limit the possibility of unnecessary complexity in future measures.

We prove that if $1 > \alpha > 1/2$, then there exists a probability measure $\mu$ such that the Hausdorff dimension of its support is $\alpha$ and $\mu*\mu$ is a Lipschitz function of class $\alpha-1/2$.

Cable robots are a type of robotic manipulator that has recently attracted interest for large workspace manipulation tasks. Cable robots are relatively simple in form, with multiple cables attached to a mobile platform or end-effector. The end-effector is manipulated by motors that can extend or retract the cables. Cable robots have many desirable characteristics, including low inertial properties, high payload-to-weight ratios, potentially vast workspaces, transportability, ease of disassembly/reassembly, reconfigurability and economical construction and maintenance. However, relatively few analytical tools are available for analyzing and designing these manipulators. This thesis focuses on expanding the existing theoretical framework for the design and analysis of cable robots in two areas: disturbance robustness and workspace generation. Underconstrained cable robots cannot resist arbitrary external disturbances acting on the end-effector. Thus a disturbance robustness measure for general underconstrained single-body and multi-body cable robots is presented. This measure captures the robustness of the manipulator to both static and impulsive disturbances. Additionally, a wrench-based method of analyzing cable robots has been developed and is used to formulate a method of generating the Wrench-Feasible Workspace of cable robots. This workspace consists of the set of all poses of the manipulator where a specified set of wrenches (force/moment combinations) can be exerted. For many applications the Wrench-Feasible Workspace constitutes the set of all usable poses. The concepts of robustness and workspace generation are then combined to introduce a new workspace: the Specified Robustness Workspace. This workspace consists of the set of all poses of the manipulator that meet or exceed a specified robustness value.

NP-hard problems have numerous applications in various fields such as networks, computer systems, circuit design, etc. However, no efficient algorithms have been found for NP-hard problems. It has been commonly believed that no efficient algorithms for NP-hard problems exist, i.e., that P6=NP. Recently, it has been observed that there are parameters much smaller than input sizes in many instances of NP-hard problems in the real world. In the last twenty years, researchers have been interested in developing efficient algorithms, i.e., fixed-parameter tractable algorithms, for those instances with small parameters. Fixed-parameter tractable algorithms can practically find exact solutions to problem instances with small parameters, though those problems are considered intractable in traditional computational theory. In this dissertation, we propose a new approach of algorithm design and analysis: discovering better measures for problems. In particular we use two measures instead of the traditional single measure?input size to design algorithms and analyze their time complexity. For several classical NP-hard problems, we present improved algorithms designed and analyzed with this new approach, First we show that the new approach is extremely powerful for designing fixedparameter tractable algorithms by presenting improved fixed-parameter tractable algorithms for the 3D-matching and 3D-packing problems, the multiway cut problem, the feedback vertex set problems on both directed and undirected graph and the max-leaf problems on both directed and undirected graphs. Most of our algorithms are practical for problem instances with small parameters. Moreover, we show that this new approach is also good for designing exact algorithms (with no parameters) for NP-hard problems by presenting an improved exact algorithm for the well-known satisfiability problem. Our results demonstrate the power of this new approach to algorithm design and analysis for NP-hard problems. In the end, we discuss possible future directions on this new approach and other approaches to algorithm design and analysis.

Recently, lifetime imaging has become a subject of intensive research. Lifetime is an important parameter to understand the dynamics of targeted objects and its applications ranges from fluorescence decay of biological objects to relaxation of semiconductor materials and devices. Many methods, such as time-correlated single photon counting (TCSPC) and phase detection in frequency domain, were developed to measure the characteristic lifetime. These methods are now rather matured and widely applied in various studies. However, these methods are only effective for lifetime longer than 100 picoseconds due to the bandwidth limitation of high-speed electronics. For even faster temporal resolution, novel techniques that do not rely on high-speed electronics will be required. In this study, we are integrating an autocorrelator with a galvo-based laser scanning microscope to enable imaging with very high temporal resolution. The principle and technique of pump-probe is implemented through the autocorrelator. In this way, imaging based pump-probe measurements can be realized. Specifically, we have applied the experimental setup so developed in measuring fluorescent dyes and semiconductor devices.

¡@¡@In recent years, the trends in network communication towards mobile network .Traditional network cannot meet the need of new communication challenge. The 802.11 outperforms other new wireless network technique ¡@¡@In this paper, we assume user have wireless NIC devices with Mobile IPv6 protocol module. We use this model to build an environment and use this environment to design our Mobile IPv6 multicast simulation. We do these for two reasons, (1)To analyze how to use multicast over Mobile IPv6 wireless network. (2)To design an experimentation for multicast over wireless LAN. After we get results of the experimentation, we could know why wireless network does not have better quality than wired LAN. ¡@¡@During our implementation, we have a high latency problem and try to solve it by our program. After our improvement, average latency reduces to 27.77% and miss rate reduces to 33.07%. ¡@¡@Our implementation not only provide some useful information when some one need to build Mobile IPv6 environment but also give a solution for solving handover latency problem.