Endre søk
Begrens søket
1 - 45 of 45
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Altafini, Claudio
    et al.
    SISSA-ISAS International School for Advanced Studies.
    Speranzon, Alberto
    KTH, Tidigare Institutioner, Signaler, sensorer och system.
    Johansson, Karl Henrik
    KTH, Tidigare Institutioner, Signaler, sensorer och system.
    Hybrid control of a truck and trailer vehicle2002Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2289, s. 21-34Artikkel i tidsskrift (Annet vitenskapelig)
    Abstract [en]

    A hybrid control scheme is proposed for the stabilization of backward driving along simple paths for a miniature vehicle composed of a truck and a two-axle trailer. When reversing, the truck and trailer can be modelled as an unstable nonlinear system with state and input saturations. Due to these constraints the system is impossible to globally stabilize with standard smooth control techniques, since some initial states necessarily lead to that the so called jack-knife locks between the truck and the trailer. The proposed hybrid control method, which combines backward and forward motions, provide a global attractor to the desired reference trajectory. The scheme has been implemented and successfully evaluated on a radio-controlled vehicle. Results from experimental trials are reported.

  • 2.
    Ardelius, John
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster, Programvaru- och datorsystem, SCS.
    Meji­as, B.
    Modeling the performance of ring based DHTs in the presence of network address translators2011Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 6723, s. 15-28Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay networks assume the underlying network to be a complete graph, an assumption that might hold in evaluation environments such as PlanetLab but turns out to be simplistic in practice. In this work we introduce an analytical network model where a fraction of the communication links are unavailable due to NATs. We investigate how the topology induced by the model affects the performance of ring based DHTs. We quantify two main performance issues induced by NATs namely large lookup inconsistencies and increased break-up probability, and suggest how theses issues can be addressed. The model is evaluated using discrete based simulation for a wide range of parameters.

  • 3.
    Aurell, Erik
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Fysik.
    El-Ansary, Sameh
    KTH, Skolan för teknikvetenskap (SCI), Fysik.
    A physics-style approach to scalability of distributed systems2005Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3267, s. 266-272Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Is it possible to treat large scale distributed systems as physical systems? The importance of that question stems from the fact that the behavior of many P2P systems is very complex to analyze analytically, and simulation of scales of interest can be prohibitive. In Physics, however, one is accustomed to reasoning about large systems. The limit of very large systems may actually simplify the analysis. As a first example, we here analyze the effect of the density of populated nodes in an identifier space in a P2P system. We show that while the average path length is approximately given by a function of the number of populated nodes, there is a systematic effect which depends on the density. In other words, the dependence is both on the number of address nodes and the number of populated nodes, but only through their ratio. Interestingly, this effect is negative for finite densities, showing that an amount of randomness somewhat shortens average path length.

  • 4.
    Balliu, Musard
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS.
    Mastroeni, Isabella
    A Weakest Precondition Approach to Robustness2010Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 6340, nr PART 1, s. 261-297Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    With the increasing complexity of information management computer systems, security becomes a real concern. E-government, web-based financial transactions or military and health care information systems are only a few examples where large amount of information can reside on different hosts distributed worldwide. It is clear that any disclosure or corruption of confidential information in these contexts can result fatal. Information flow controls constitute an appealing and promising technology to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted environments still remains an open problem in the area of language-based security. Robustness asserts that an active attacker, who can modify program code in some fixed points (holes), is unable to disclose more private information than a passive attacker, who merely observes unclassified data. In this paper, we extend a method recently proposed for checking declassified non-interference in presence of passive attackers only, in order to check robustness by means of weakest precondition semantics. In particular, this semantics simulates the kind of analysis that can be performed by an attacker, i.e., from public output towards private input. The choice of semantics allows us to distinguish between different attacks models and to characterize the security of applications in different scenarios. Our results are sound to address confidentiality and integrity of software running in untrusted environments where different actors can distrust one another. For instance, a web server can be attacked by a third party in order to steal a session cookie or hijack clients to a fake web page.

  • 5. Clemm, A.
    et al.
    Granville, L. Z.
    Stadler, Rolf
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Managing virtualization of networks and services2015Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 4785Artikkel i tidsskrift (Fagfellevurdert)
  • 6.
    Dam, Mads
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Mikroelektronik och Informationsteknik, IMIT.
    Regular SPKI2005Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3364, s. 134-152Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    SPKI is a certificate-based framework for authorisation in distributed systems. The SPKI framework is extended by an iteration construct, essentially Kleene star, to express constraints on delegation chains. Other possible applications, not explored in the paper, include multidomain network routing path constraints. The main decision problems for the extended language are shown to correspond to regular language membership and containment respectively. To support an efficient decision algorithm in both cases we give a sound and complete inference system for a fragment of the language which is decidable in polynomial time. We finally show how to use the extended syntax to represent constrained delegation in SPKI.

  • 7.
    de Fréin, Ruairí
    Telecommunications Software and Systems Group, Waterford Institute of Technology, Ireland.
    Formal Concept Analysis via Atomic Priming2013Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 7880, s. 92-108Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Formal Concept Analysis (FCA) looks to decompose a matrix of objects-attributes into a set of sparse matrices capturing the underlying structure of a formal context. We propose a Rank Reduction (RR) method to prime approximate FCAs, namely RRFCA. While many existing FCA algorithms are complete, lectic ordering of the lattice may not minimize search/decomposition time. Initially, RRFCA decompositions are not unique or complete; however, a set of good closures with high support is learned quickly, and then, made complete. RRFCA has its novelty in that we propose a new multiplicative two-stage method. First, we describe the theoretical foundations underpinning our RR approach. Second, we provide a representative exemplar, showing how RRFCA can be implemented. Further experiments demonstrate that RRFCA methods are efficient, scalable and yield time-savings. We demonstrate the resulting methods lend themselves to parallelization.

  • 8.
    de Fréin, Ruairí
    Telecommunications Software and Systems Group, Waterford Institute of Technology, Ireland.
    Multilayered, Blocked Formal Concept Analyses for Adaptive Image Compression2014Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 8478, s. 251-267Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Formal Concept Analysis (FCA) decomposes a matrix into a set of sparse matrices capturing its underlying structure. A similar task for real-valued data, transform coding, arises in image compression. Existing cosine transform coding for JPEG image compression uses a fixed, decorrelating transform; however, compression is limited as images rarely consist of pure cosines. The question remains whether an FCA adaptive transform can be applied to image compression. We propose a multi-layer FCA (MFCA) adaptive ordered transform and Sequentially Sifted Linear Programming (SSLP) encoding pair for adaptive image compression. Our hypothesis is that MFCA’s sparse linear codes (closures) for natural scenes, are a complete family of ordered, localized, oriented, bandpass receptive fields, predicted by models of the primary visual cortex. Results on real data demonstrate that adaptive compression is feasible. These initial results may play a role in improving compression rates and extending the applicability of FCA to real-valued data.

  • 9.
    de Fréin, Ruairí
    et al.
    Waterford Institute of Technology, Ireland.
    Xu, Biao
    Waterford Institute of Technology, Ireland.
    Robson, Eric
    Waterford Institute of Technology, Ireland.
    Distributed Formal Concept Analysis Algorithms Based on an Iterative MapReduce Framework2012Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 7278, s. 292-308Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    While many existing formal concept analysis algorithms are efficient, they are typically unsuitable for distributed implementation. Taking the MapReduce (MR) framework as our inspiration we introduce a distributed approach for performing formal concept mining. Our method has its novelty in that we use a light-weight MapReduce runtime called Twister which is better suited to iterative algorithms than recent distributed approaches. First, we describe the theoretical foundations underpinning our distributed formal concept analysis approach. Second, we provide a representative exemplar of how a classic centralized algorithm can be implemented in a distributed fashion using our methodology: we modify Ganter’s classic algorithm by introducing a family of MR⋆ algorithms, namely MRGanter and MRGanter+ where the prefix denotes the algorithm’s lineage. To evaluate the factors that impact distributed algorithm performance, we compare our MR∗ algorithms with the state-of-the-art. Experiments conducted on real datasets demonstrate that MRGanter+ is efficient, scalable and an appealing algorithm for distributed problems.

  • 10. Dowling, Jim
    et al.
    Taïani, F.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface2013Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, s. VII-VIIIArtikkel i tidsskrift (Fagfellevurdert)
  • 11.
    El-Ansary, Sameh
    et al.
    Swedish Institute of Computer Science.
    Onana Alima, Luc
    KTH, Tidigare Institutioner                               , Mikroelektronik och informationsteknik, IMIT.
    Brand, Per
    Swedish Institute of Computer Science.
    Haridi, Seif
    KTH, Tidigare Institutioner                               , Mikroelektronik och informationsteknik, IMIT.
    Efficient broadcast in structured P2P networks2003Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2735, s. 304-314Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N - 1 messages. We emphasize the perception of a class of DHT systems as a form of distributed k-ary search and we take advantage of that perception in constructing a spanning tree that is utilized for efficient broadcasting. We consider broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.

  • 12.
    Fagerström, Daniel
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Spatio-temporal Scale-Spaces2007Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 4485, s. 326-337Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    A family of spatio-temporal scale-spaces suitable for a moving observer is developed. The scale-spaces are required to be time causal for being usable for real time measurements, and to be velocity adapted , i.e. to have Galilean covariance to avoid favoring any particular motion. Furthermore standard scale-space axioms: linearity, positivity, continuity, translation invariance, scaling covariance in space and time, rotational invariance in space and recursivity are used. An infinitesimal criterion for scale-spaces is developed, which simplifies calculations and makes it possible to define scale spaces on bounded regions. We show that there are no temporally causal Galilean scale-spaces that are semigroups acting on space and time, but that there are such scale-spaces that are semigroups acting on space and memory (where the memory is the scale-space). The temporally causal scale-space is a time-recursive process using current input and the scale-space as state, i.e. there is no need for storing earlier input. The diffusion equation acting on the memory with the input signal as boundary condition, is a member of this family of scale spaces and is special in the sense that its generator is local.

  • 13. Fodor, Gabor
    et al.
    Telek, Miklós
    Performance analysis of the uplink of a CDMA cell supporting elastic services2005Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3462, s. 205-216Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We consider a single cell of a multi-service CDMA network, in which some of the service classes are explicit rate controlled. We call these elastic service classes. The instantaneous bit rate of elastic services is dynamically adjusted between a minimum and maximum value such that the system always remains work conserving. We develop a Markov model that allows us to study the impact of such state dependent (dynamic) rate control on the class-wise blocking probabilities and the first two moments of the holding times. We conclude that dynamic (state dependent) rate adjustment decreases the class-wise blocking probabilities and only moderately increases the expectation and the second moment of the time spent in the system.

  • 14. Fodor, Gabor
    et al.
    Telek, Miklós
    Badia, Leonardo
    On the tradeoff between blocking and dropping probabilities in CDMA networks supporting elastic services2006Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3976, s. 954-965Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper is a sequel of previous work, in which we proposed a model and computational technique to calculate the Erlang capacity of a single CDMA cell that supports elastic services. The present paper extends that base model by taking into account two important features of CDMA. First, we capture the impact of soft blocking by modeling the neighbor cell interference as a lognormally distributed random variable. Secondly, we model the impact of the outage by taking into account that in-progress sessions can be dropped with a probability that depends on the current load in the system. We then consider a system with elastic and rigid service classes and analyze the trade-off between the total (soft and hard) blocking probabilities on the one hand and the throughput and the session drop probabilities on the other.

  • 15.
    Frennert, Susanne
    KTH, Skolan för kemi, bioteknologi och hälsa (CBH), Medicinteknik och hälsosystem, Teknisk vårdvetenskap.
    What older people expect of robots: A mixed methods approach2013Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, s. 19-29Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper focuses on how older people in Sweden imagine the potential role of robots in their lives. The data collection involved mixed methods, including focus groups, a workshop, a questionnaire and interviews. The findings obtained and lessons learnt from one method fed into another. In total, 88 older people were involved. The results indicate that the expectations and preconceptions about robots are multi-dimensional and ambivalent. Ambivalence can been seen in the tension between the benefits of having a robot looking after the older people, helping with or carrying out tasks they no longer are able to do, and the parallel attitudes, resilience and relational inequalities that accompany these benefits. The participants perceived that having a robot might be "good for others but not themselves", "good as a machine not a friend" while their relatives and informal caregivers perceived a robot as "not for my relative but for other older people".

  • 16.
    Frintrop, Simone
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    VOCUS: A visual attention system for object detection and goal-directed search2006Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, s. 1-228Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Visual attention is a mechanism in human perception which selects relevant regions from a scene and provides these regions for higher-level processing as object recognition. This enables humans to act effectively in their environment despite the complexity of perceivable sensor data. Computational vision systems face the same problem as humans: there is a large amount of information to be processed and to achieve this efficiently, maybe even in real-time for robotic applications, the order in which a scene is investigated must be determined in an intelligent way. A promising approach is to use computational attention systems that simulate human visual attention. This monograph introduces the biologically motivated computational attention system VOCUS (Visual Object detection with a Computational attention System) that detects regions of interest in images. It operates in two modes, in an exploration mode in which no task is provided, and in a search mode with a specified target. In exploration mode, regions of interest are defined by strong contrasts (e.g., color or intensity contrasts) and by the uniqueness of a feature. For example, a black sheep is salient in a flock of white sheep. In search mode, the system uses previously learned information about a target object to bias the saliency computations with respect to the target. In various experiments, it is shown that the target is on average found with less than three fixations, that usually less than five training images suffice to learn the target information, and that the system is mostly robust with regard to viewpoint changes and illumination variances. Furthermore, we demonstrate how VOCUS profits from additional sensor data: we apply the system to depth and reflectance data from a 3D laser scanner and show the advantages that the laser modes provide. By fusing the data of both modes, we demonstrate how the system is able to consider distinct object properties and how the flexibility of the system increases by considering different data. Finally, the regions of interest provided by VOCUS serve as input to a classifier that recognizes the object in the detected region. We show how and in which cases the classification is sped up and how the detection quality is improved by the attentional front-end. This approach is especially useful if many object classes have to be considered, a frequently occurring situation in robotics. VOCUS provides a powerful approach to improve existing vision systems by concentrating computational resources to regions that are more likely to contain relevant information. The more the complexity and power of vision systems increase in the future, the more they will profit from an attentional front-end like VOCUS.

  • 17.
    Fu, Jing
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Sjödin, Peter
    KTH, Skolan för informations- och kommunikationsteknik (ICT).
    Karlsson, Gunnar
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Traffic Engineering and Routing in IP Networks with Centralized Control2008Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 4982, s. 633-641Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    There have been research initiatives in centralized control recently, which advocatethat the control of an autonomous system (AS) should be performed in acentralized fashion. In this paper, we propose an approach to perform traffic engineeringand routing in networks with centralized control, named LP-redirect.LP-redirect is based on an efficient formulation of linear programming (LP) thatreduces the number of variables and constraints. As LP is not fast enough for runtimerouting, LP-redirect uses a fast scheme to recompute routing paths when anetwork topology changes. The performance evaluation of LP-redirect shows thatit is more efficient in both traffic engineering and computation than an approachusing optimized link weights. In addition, LP-redirect is suitable for runtime trafficengineering and routing.

  • 18. G, Fodor
    On scheduling and interference coordination policies for multicell OFDMA networks2007Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 4479, s. 488-499Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In orthogonal frequency division multiple access systems there is an intimate relationship between the packet scheduler and the inter-cell interference coordination (ICIC) functionalities: they determine the set of frequency channels (sub-carriers) that are used to carry the packets of in-progress sessions. In this paper we build on previous work - in which we compared the so called random and coordinated ICIC policies - and analyze three packet scheduling methods. The performance measures of interest are the session blocking probabilities and the overall throughput. We find that the performance of the so-called Fifty-Fifty and What-It-Wants scheduling policies is improved by coordinated sub-carrier allocation, especially in poor signal-to-noise-and-interference situations. The performance of the All-Or-Nothing scheduler is practically insensitive to the choice of the sub-carrier allocation policy.

  • 19. G, Fodor
    et al.
    K, El-Malki
    D, Partain
    Closing the gap between industry, academia and users: Is there a need for QoS in wireless systems?2005Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3552, s. 375-378Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this short paper we make the point that although there may be a gap between academic and industrial research in the area of quality of service (QoS), this gap can be narrowed. In order for this to happen, it is important that the academic and industrial players jointly make an effort to better understand business drivers and end user needs and analyze how networks are used and how they are likely to evolve. That is, understanding the key drivers (the "why"-s) in the QoS area is the key in bringing academic and industrial research (that aims to answer the "how"-s) closer to each other.

  • 20.
    Gonzalez Prieto, Alberto
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Stadler, Rolf
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Monitoring Flow Aggregates with Controllable Accuracy2007Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 4787, s. 64-75Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper, we show the feasibility of real-time flow monitoringwith controllable accuracy in today’s IP networks. Our approach is based onNetflow and A-GAP. A-GAP is a protocol for continuous monitoring ofnetwork state variables, which are computed from device metrics usingaggregation functions, such as SUM, AVERAGE and MAX. A-GAP isdesigned to achieve a given monitoring accuracy with minimal overhead. AGAPis decentralized and asynchronous to achieve robustness and scalability.The protocol incrementally computes aggregation functions inside the networkand, based on a stochastic model, it dynamically configures local filters thatcontrol the overhead and accuracy. We evaluate a prototype in a testbed of 16commercial routers and provide measurements from a scenario where theprotocol continuously estimates the total number of FTP flows in the network.Local flow metrics are read out from Netflow buffers and aggregated in realtime.We evaluate the prototype for the following criteria. First, the ability toeffectively control the trade off between monitoring accuracy and processingoverhead; second, the ability to accurately predict the distribution of theestimation error ; third, the impact of a sudden change in topology on theperformance of the protocol. The testbed measurements are consistent withsimulation studies we performed for different topologies and network sizes,which proves the feasibility of the protocol design, and, more generally, thefeasibility of effective and efficient real-time flow monitoring in large networkenvironments.

  • 21.
    Gorton, Dan
    KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap.
    IncidentResponseSim: An Agent-Based Simulation Tool for Risk Management of Online Fraud2015Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 9417, s. 172-187Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    IncidentResponseSim is a multi-agent-based simulation tool supporting risk management of online financial services, by performing a risk assessment of the quality of current countermeasures, in the light of the current and emerging threat environment. In this article, we present a set of simulations using incident response trees in combination with a quantitative model for estimating the direct economic consequences. The simulations generate expected fraud, and conditional fraud value at risk, given a specific fraud scenario. Additionally, we present how different trojan strategies result in different conditional fraud value at risk, given the underlying distribution of wealth in the online channel, and different levels of daily transaction limits. Furthermore, we show how these measures can be used together with return on security investment calculations to support decisions about future security investments.

  • 22.
    Hagsand, Olof
    et al.
    KTH, Tidigare Institutioner, Mikroelektronik och informationsteknik, IMIT.
    Más, Ignacio
    KTH, Tidigare Institutioner, Mikroelektronik och informationsteknik, IMIT.
    Marsh, Ian
    Swedish Institute of Computer Science.
    Karlsson, Gunnar
    KTH, Tidigare Institutioner, Mikroelektronik och informationsteknik, IMIT.
    Self-Admission Control for IP Telephony using Early Quality Estimation2004Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3042, s. 381-391Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    If quality of service could be provided at the transport or the application layer, then it might be deployed simply by software upgrades, instead of requiring a complete upgrade of the network infrastructure. In this paper, we propose a self-admission control scheme that does not require any network support or external monitoring schemes. We apply the admission control scheme to IP telephony as it is an important application benefiting from admission control. We predict the quality of the call by observing the packet loss over a short initial period using an in-band probing mechanism. The quality prediction is then used by the application to continue or to abort the call. Using over 9500 global IP telephony measurements, we show that it is possible to accurately predict the quality of a call. Early rejection of sessions has the advantage of saving valuable network resources plus not disturbing the on-going calls.

  • 23.
    Hansen, Kjetil Falkenberg
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Medieteknik och interaktionsdesign, MID. KTH, Skolan för datavetenskap och kommunikation (CSC), Tal, musik och hörsel, TMH, Musikakustik.
    Bresin, Roberto
    KTH, Tidigare Institutioner, Tal, musik och hörsel.
    Analysis of a genuine scratch performance2004Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2915, s. 477-478Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The art form of manipulating vinyl records done by disc jockeys (DJs) is called scratching, and has become very popular since its start in the seventies. Since then turntables are commonly used as expressive musical instruments in several musical genres. This phenomenon has had a serious impact on the instrument-making industry, as the sales of turntables and related equipment have boosted. Despite of this, the acoustics of scratching has been barely studied until now. In this paper, we illustrate the complexity of scratching by measuring the gestures of one DJ during a performance. The analysis of these measurements is important to consider in the design of a scratch model.

  • 24.
    Hansson, Sven Ove
    KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Filosofi och teknikhistoria, Filosofi.
    Deontic diversity2014Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 8554 LNAI, s. 5-18Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    It is commonly assumed that deontic logic concerns "the" logic of normative concepts. However, a close look at actual usage shows that the structural patterns of deontic notions differ between different usages. Some of these differences are difficult to discern in natural language, but may be easier to keep apart with the more precise tools of a formal language. We should use the resources of deontic logic to discover and distinguish between different meanings of the deontic terms in natural language. Some of the ingrained disagreements on postulates in deontic logic may be resolvable if we recognize that the different viewpoints correspond to different meanings of the normative terms of ordinary language.

  • 25.
    Krishnamurthy, Supriya
    et al.
    Swedish Institute of Computer Science.
    El-Ansary, Sameh
    Swedish Institute of Computer Science.
    Aurell, Erik
    KTH, Skolan för teknikvetenskap (SCI), Fysik.
    Haridi, Seif
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Mikroelektronik och Informationsteknik, IMIT.
    A statistical theory of Chord under churn2005Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3640, s. 93-103Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Most earlier studies of DHTs under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we present a complete analytical study of churn using a master-equation- based approach, used traditionally in non-equilibrium statistical mechanics to describe steady-state or transient phenomena. Simulations are used to verify all theoretical predictions. We demonstrate the application of our methodology to the Chord system. For any rate of churn and stabilization rates, and any system size, we accurately predict the fraction of failed or incorrect successor and finger pointers and show how we can use these quantities to predict the performance and consistency of lookups under churn. We also discuss briefly how churn may actually be of different 'types' and the implications this will have for the functioning of DHTs in general.

  • 26. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster (Stängd 20120101), Programvaru- och datorsystem, SCS (Stängd 20120101).
    Linear logic, partial deduction and cooperative problem solving2004Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2990, s. 263-279Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper we present a model of cooperative problem solving (CPS). Linear Logic (LL) is used for encoding agents' states, goals and capabilities. LL theorem proving is applied by each agent to determine whether the particular agent is capable of solving the problem alone. If no individual solution can be constructed, then the agent may start negotiation with other agents in order to find a cooperative solution. Partial deduction in LL is used to derive a possible deal. Finally proofs are generated and plans are extracted from the proofs. The extracted plans determine agents' responsibilities in cooperative solutions.

  • 27. Kungas, Peep
    et al.
    Rao, J
    Matskin, Mihhail
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster (Stängd 20120101), Programvaru- och datorsystem, SCS (Stängd 20120101).
    Symbolic agent negotiation for semantic web service exploitation2004Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3129, s. 458-467Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper presents an architecture and a methodology for agent-based Web service discovery and composition. We assume that Web services are described with declarative specifications like DAML-S. Based on the declarative information about services, symbolic reasoning can be applied while searching for or composing automatically new services. We propose that symbolic agent negotiation could be used for dynamic Web service discovery and composition. Symbolic negotiation, as we consider it here, is a mixture of distributed planning and information exchange. Therefore, by using symbolic negotiation for automated service composition, we support information collection and integration during service composition. The latter aspect has been largely neglected in automated service composition until now.

  • 28.
    Landin, Nils
    et al.
    KTH.
    Romano, Joseph M.
    McMahan, William
    Kuchenbecker, Katherine J.
    Dimensional Reduction of High-Frequency Accelerations for Haptic Rendering2010Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 6192, s. 79-86Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Haptics research has seen several recent efforts at understanding and recreating real vibrations to improve the quality of haptic feedback in both virtual environments and teleoperation. To simplify the modeling process and enable the use of single-axis actuators, these previous efforts have used just one axis of a three-dimensional vibration signal, even though the main vibration mechanoreceptors in the hand are know to detect vibrations in all directions. Furthermore, the fact that these mechanoreceptors are largely insensitive to the direction of high-frequency vibrations points to the existence of a transformation that can reduce three-dimensional high-frequency vibration signals to a one-dimensional signal without appreciable perceptual degradation. After formalizing the requirements for this transformation, this paper describes and compares several candidate methods of varying degrees of sophistication, culminating in a novel frequency-domain solution that performs very well on our chosen metrics.

  • 29.
    Larusdottir, Marta Kristín
    KTH, Skolan för datavetenskap och kommunikation (CSC), Människa-datorinteraktion, MDI (stängd 20111231). Reykjavik University, Iceland .
    Usability evaluation in software development practice2011Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 6943, nr PART 4, s. 430-433Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Brief description of the topic: Usability evaluation is explored by comparing the effectiveness of using different evaluation methods and by studying how usability evaluation is conducted by practitioners.

  • 30.
    Lundqvist, Henrik
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Más Ivars, Ignacio
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Karlsson, Gunnar
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Edge-based Differentiated Services2005Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3552, s. 259-270Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Network quality of service is traditionally thought to be provided by a combination of scheduling in the network nodes to enforce a capacity sharing policy and traffic controls to prevent congestion that could annihilate that policy. The work presented herein is instead based on an end-to-end argument: A capacity sharing policy is enforced by traffic controls in the hosts at the edges of the network, without any scheduling support in the network. Our proposal is to add a feed-forward control at the transport layer to provide a service that is better suited to conversational and streaming applications than the batch-oriented transfer mode provided by TCP. The paper presents the control and its evaluation: We compare the sharing of capacity between traffic classes and study the loss rate seen by admitted streams. The outcome is that the new control adds a distinctly different service to the service offered by TCP for the Internet.

  • 31.
    Marsh, Ian
    et al.
    SICS, Kista, Sweden .
    Grönvall, B.
    SICS, Kista.
    Hammer, F.
    The design and implementation of a quality-based handover trigger2006Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, ISSN 0302-9743, Vol. 3976, s. 580-591Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Wireless connectivity is needed to bring IP-based telephony into serious competition with the existing cellular infrastructure. However it is well known that voice quality problems can occur when used with unlicensed spectrum technologies such as the popular IEEE 802.11 standards. The cellular infrastructure could provide alternative network access should users roam out of 802.11 coverage or if heavy traffic loads are encountered in the 802.11 cell. Therefore, our goal is to design a handover mechanism to switch ongoing calls to the cellular network when the 802.11 network cannot sustain sufficient call quality. We have investigated load and coverage scenarios and designed, implemented and evaluated the performance of an 802.11 quality-based trigger for the handover of voice calls to the cellular network. We show that our predictive solution addresses the coverage problem and evaluate it within a real setting.

  • 32.
    Meijer, Sebastiaan
    et al.
    KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap, Trafik och logistik.
    Verwaart, Tim
    Wageningen University and Research.
    Feasibility of Multi-agent Simulation for the Trust and Tracing Game2005Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3533, nr 1, s. 187-188Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Trust is an important issue in trade. For instance in food trade, market actors have to rely on their trade partner’s quality statements. The roles of trust and deception in supply networks in various cultural and organisational settings are subject of research in the social sciences. The Trust And Tracing game is an instrument for that type of study. It is a game for human players. Conducting experiments is time-consuming and expensive. Furthermore, it is hard to formulate hypotheses and to test effects of parameter changes, as this requires many participants. For these reasons the project reported in this paper investigated the feasibility of multi-agent simulation of the game and delivered a prototype. This paper briefly describes the game and introduces the process composition of the agents. The prototype uses simple, but effective models. The paper concludes with directions for refinement of models for agent behaviour.

  • 33.
    Más, Ignacio
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Karlsson, Gunnar
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    A model for Endpoint Admission Control Based on Packet Loss2008Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 4982, s. 506-517Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Endpoint admission control solutions, based on probing a transmission path, have been proposed to meet quality requirements of audio-visual applications with little support from routers. In this paper we present a mathematical analysis of a probe-based admission control solution, where flows are accepted or rejected based on the packet-loss statistics in the probe stream. The analysis relates both system performance to the design parameters, and the experienced probe packet loss probability to the packet loss probability of accepted flows. The goal is to provide a simple mathematical method to perform network dimensioning for admission control based on end-to-end probing.

  • 34.
    Más Ivars, Ignacio
    et al.
    KTH, Tidigare Institutioner                               , Mikroelektronik och informationsteknik, IMIT.
    Karlsson, Gunnar
    KTH, Tidigare Institutioner                               , Mikroelektronik och informationsteknik, IMIT.
    PBAC: Probe-Based Admission Control2001Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2156, s. 97-109Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Different end-to-end measurement based admission control (MBAC) schemes have recently been proposed to support quality of service for real-time data. All these designs share the idea of decentralizing the admission decision by requiring each end host or gateway to probe the network before sending data. This probing provides certain measurements on the network status that can be used to accept or reject the incoming flow. In this paper, we study a probing procedure to perform an admission decision for a controlled load service (CLS). The admission control offers a reliable upper bound on the packet loss for the new session even with short probing phase durations (e.g. half a second). Our probing mechanism only requires the routers to differentiate between two classes of packets: high priority data and low priority probes. Some simulation results on the performance of the scheme are presented.

  • 35.
    Podobas, Artur
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Brorsson, Mats
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Vlassov, Vladimir
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Exploring heterogeneous scheduling using the task-centric programming model2013Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 7640Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Computer architecture technology is moving towards more heteroge-neous solutions, which will contain a number of processing units with different capabilities that may increase the performance of the system as a whole. How-ever, with increased performance comes increased complexity; complexity that is now barely handled in homogeneous multiprocessing systems. The present study tries to solve a small piece of the heterogeneous puzzle; how can we exploit all system resources in a performance-effective and user-friendly way? Our proposed solution includes a run-time system capable of using a variety of different heterogeneous components while providing the user with the already familiar task-centric programming model interface. Furthermore, when dealing with non-uniform workloads, we show that traditional approaches based on centralized or work-stealing queue algorithms do not work well and propose a scheduling algorithm based on trend analysis to distribute work in a performance-effective way across resources.

  • 36.
    Rathi, Vishwambhar
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.
    Aurell, Erik
    KTH, Skolan för datavetenskap och kommunikation (CSC), Beräkningsbiologi, CB. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Rasmussen, Lars Kildehöj
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Bounds on Threshold of Regular Random k-SAT2010Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 6175, s. 264-277Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We consider the regular model of formula generation in conjunctive normal form (CNF) introduced by Boufkhad et. al. in [6]. In [6], it was shown that the threshold for regular random 2-SAT is equal to unity. Also, upper and lower bound on the threshold for regular random 3-SAT were derived. Using the first moment method, we derive an upper bound on the threshold for regular random k-SAT for any k >= 3 and show that for large k the threshold is upper bounded by 2(k) ln(2). We also derive upper bounds on the threshold for Not-All-Equal (NAE) satisfiability for k >= 3 and show that for large k, the NAE-satisfiability threshold is upper bounded by 2(k-1) ln(2). For both satisfiability and NAE-satisfiability, the obtained upper bound matches with the corresponding bound for the uniform model of formula generation [9, 1]. For the uniform model, in a series of break through papers Achlioptas, Moore, and Peres showed that a careful application of the second moment method yields a significantly better lower bound on threshold as compared to any rigorously proven algorithmic bound [3, I]. The second moment method shows the existence of a satisfying assignment with uniform positive probability (w.u.p.p.). Thanks to the result of Friedgut for uniform model [ 1 0], existence of a satisfying assignment w.u.p.p. translates to existence of a satisfying assignment with high probability (w.h.p.). Thus, the second moment method gives a lower bound on the threshold. As there is no known Friedgut type result for regular random model, we assume that for regular random model existence of a satisfying assignments w.u.p.p. translates to existence of a satisfying assignments w.h.p. We derive the second moment of the number of satisfying assignments for regular random k-SAT for k >= 3. There are two aspects in deriving the lower bound using the second moment method. The first aspect is given any k, numerically evaluate the lower bound on the threshold. The second aspect is to derive the lower bound as a function of k for large enough k. We address the first aspect and evaluate the lower bound on threshold. The numerical evaluation suggests that as k increases the obtained lower bound on the satisfiability threshold of a regular random formula converges to the lower bound obtained for the uniform model. Similarly, we obtain lower bounds on the NAE-satisfiability threshold of the regular random formulas and observe that the obtained lower bound seems to converge to the corresponding lower bound for the uniform model as k increases.

  • 37. Rechert, K.
    et al.
    Meier, K.
    Greschbach, Benjamin
    KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS.
    Wehrle, D.
    Von Suchodoletz, D.
    Assessing location privacy in mobile communication networks2011Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2001, s. 309-324Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper we analyze a class of location disclosure in which location information from individuals is generated in an automated way, i.e. is observed by a ubiquitous infrastructure. Since such information is valuable for both scientific research and commercial use, location information might be passed on to third parties. Users are usually aware neither of the extent of the information disclosure (e.g. by carrying a mobile phone), nor how the collected data is used and by whom. In order to assess the expected privacy risk in terms of the possible extent of exposure, we propose an adversary model and a privacy metric that allow an evaluation of the possible privacy loss by using mobile communication infrastructure. Furthermore, a case study on the privacy effects of using GSM infrastructure was conducted with the goal of analyzing the side effects of using a mobile handset. Based on these results requirements for a privacy-aware mobile handheld device were derived.

  • 38.
    Ryu, Hyung-Keun
    et al.
    Korea Telecom.
    Cho, Jeong-woo
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster, Telekommunikationssystem, TSLab.
    Chong, Song
    KAIST (Korea Advanced Institute of Science and Technology).
    Stabilized Edge-to-Edge Aggregate Flow Control2004Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3042, s. 573-587Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

     In this paper, we present a distributed flow control scheme which achieves weighted max-min fair bandwidth allocation among all source-destination pairs on a per-aggregate basis within its network. The motivation behind the scheme is the absence of per-aggregate flow control in the current Internet, resulting in inability to enforce a certain fairness on source-destination flows. In our scheme, the distributed algorithm to compute weighted max-min fair rates is based on PI control in feedback control theory. We mathematically prove the asymptotic stability of the algorithm in presence of aggregate flows with heterogeneous round-trip delays. Through simulations we demonstrate the effectiveness of the proposed scheme in controlling per-aggregate flows.

  • 39.
    Sallnäs Pysander, Eva-Lotta
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk Analys och Datalogi, NADA.
    Haptic Feedback Increases Perceived Social Presence2010Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 6192, s. 178-185Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Passing an object between two people is a common event that happens in various forms for example when giving someone a cup of coffee. An experimental study is presented where passing objects between two people in a virtual environment with haptic feedback was compared to passing objects in a nonhaptic virtual environment. The aim of the experiment was to investigate if and how added haptic feedback in such an environment affects perceived virtual presence, perceived social presence and perceived task performance. A within subject design was used, were nine pairs of subjects performed a hand off task with six differently sized cubes without audio communication. Results showed that haptic force feedback significantly improved perceived virtual presence, perceived social presence and perceived performance in this experiment.

  • 40. Simic, Slobodan
    et al.
    Johansson, Karl Henrik
    Sastry, S.
    Lygeros, J.
    Towards a geometric theory of hybrid systems2000Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 1790, s. 421-436Artikkel i tidsskrift (Fagfellevurdert)
  • 41.
    Ulriksson, Jenny
    et al.
    Swedish Defense Research Agency, Department of Systems Modeling.
    Moradi, Farshad
    Swedish Defense Research Agency, Department of Systems Modeling.
    Liljeström, Mattias
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk Analys och Datalogi, NADA.
    Montgomerie-Neilson, Nicholas
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk Analys och Datalogi, NADA.
    Building a CSCW infrastructure utilizing an M&S architecture and XML2005Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3675, s. 1-13Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    CSCW applications provide virtual spaces for human-human cooperation. Within Modelling and-Simulation (M&S), CSCW support is highly beneficial but, as in most single-user applications, not natively provided. External support, such as infrastructures for creating or adapting applications for collaborative work, is generally missing in the CSCW community. At the Swedish Defence Research Agency we study the possibilities of defence CSCW, for the primary intention of collaborative M&S. Since most of our M&S, complies with the HLA (a distributed simulation architecture), HLA appeared as a candidate for building a CSCW infrastructure upon. Thus We have designed and developed a prototype of a CSCW infrastructure, based on a combination of HLA and XML. The goal is to provide a foundation for developing CSCW applications, and for adapting existing applications to collaborative work. This paper presents the design and development, and experiments conducted for verifying utilization of HLA and XML for the purpose.

  • 42. Wild, F.
    et al.
    Scott, P.
    Karjalainen, J.
    Helin, K.
    Lind-Kohvakka, S.
    Naeve, Ambjörn
    KTH, Skolan för datavetenskap och kommunikation (CSC), Medieteknik och interaktionsdesign, MID.
    An augmented reality job performance aid for kinaesthetic learning in manufacturing work places2014Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 8719 LNCS, s. 470-475Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Manufacturing - as the name already suggests - is an area where novel ’learning by doing’ approaches can help tackle the skills gap this industry is currently facing at large. Within this contribution, we apply human-centred design methodology to help overcome two significant ’teething problems’ for augmented reality. We propose five use cases for the application of learning technology on- and off-the-job and we show how these use cases can be implemented in an augmented reality based job performance aid, which we subsequently test on a real life story board in the furniture industry.

  • 43.
    Winberg, Fredrik
    KTH, Skolan för datavetenskap och kommunikation (CSC), Människa-datorinteraktion, MDI.
    Supporting Cross-Modal Collaboration: Adding a Social Dimension to Accessibility2006Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 4129, s. 102-110Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper presents a study of cross-modal collaboration, where blind and sighted persons collaboratively solve two different tasks using a prototype that has one auditory and one graphical interface. The results shows the importance of context and the design of tasks for the accessibility of cross-modal collaborative settings, as well as the importance of supporting the participation in a working division of labour.

  • 44. Zhang, Jun
    et al.
    Johansson, Karl Henrik
    Lygeros, John
    Sastry, Shankar
    Dynamical systems revisited: Hybrid systems with Zeno executions2000Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 1790, s. 451-464Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Results from classical dynamical systems are generalized to hybrid dynamical systems. The concept of omega limit set is introduced for hybrid systems and is used to prove new results on invariant sets and stability, where Zeno and non-Zeno hybrid systems can be treated within the same framework. As an example, LaSalle's Invariance Principle is extended to hybrid systems. Zeno hybrid systems are discussed in detail. The omega limit set of a Zeno execution is characterized for classes of hybrid systems.

  • 45.
    Zhong, Yang
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Medieteknik och interaktionsdesign, MID.
    Hedman, Anders
    KTH, Skolan för datavetenskap och kommunikation (CSC), Medieteknik och interaktionsdesign, MID.
    Li, Haibo
    KTH, Skolan för datavetenskap och kommunikation (CSC), Medieteknik och interaktionsdesign, MID.
    How Good Can a Face Identifier Be Without Learning2016Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Constructing discriminative features is an essential issue in developing face recognition algorithms. There are two schools in how features are constructed: hand-crafted features and learned features from data. A clear trend in the face recognition community is to use learned features to replace hand-crafted ones for face recognition, due to the superb performance achieved by learned features through Deep Learning networks. Given the negative aspects of database-dependent solutions, we consider an alternative and demonstrate that, for good generalization performance, developing face recognition algorithms by using handcrafted features is surprisingly promising when the training dataset is small or medium sized. We show how to build such a face identifier with our Block Matching method which leverages the power of the Gabor phase in face images. Although no learning process is involved, empirical results show that the performance of this “designed” identifier is comparable (superior) to state-of-the-art identifiers and even close to Deep Learning approaches.

1 - 45 of 45
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf