SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "hsv:(NATURVETENSKAP) hsv:(Data och informationsvetenskap Datateknik) srt2:(2000-2009)"

Sökning: hsv:(NATURVETENSKAP) hsv:(Data och informationsvetenskap Datateknik) > (2000-2009)

  • Resultat 1-10 av 27
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Cappelen, Birgitta, 1962-, et al. (författare)
  • From designing objects to designing fields : from control to freedom
  • 2003
  • Ingår i: Digital Creativity. - 1462-6268 .- 1744-3806. ; 14:2, s. 74-90
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper we want to explore Field as a concept and as a metaphor for understanding interactive systems. By interactive systems we mean both systems and artworks, where the user by interacting changes the course of events. We intend to show why we need new terms and why we consider Field to be a fruitful concept and term. Further we will show how the Field concept changes both our understanding of what we do as designers and composers and how we acknowledge our audience. We will exemplify the design consequences of the Field concept by going through some design considerations we made when designing the audio tactile installation Mufi.
  •  
2.
  • Carlsson, Bengt, et al. (författare)
  • Differences between the iterated prisoner's dilemma and the chicken game under noisy conditions
  • 2002
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
    • The prisoner's dilemma has evolved into a standard game for analyzing the success of cooperative strategies in repeated games. With the aim of investigating the behavior of strategies in some alternative games we analyzed the outcome of iterated games for both the prisoner's dilemma and the chicken game. In the chicken game, mutual defection is punished more strongly than in the prisoner's dilemma, and yields the lowest fitness. We also ran our analyses under different levels of noise. The results reveal a striking difference in the outcome between the games. Iterated chicken game needed more generations to find a winning strategy. It also favored nice, forgiving strategies able to forgive a defection from an opponent. In particular the well-known strategy tit-for-tat has a poor successrate under noisy conditions. The chicken game conditions may be relatively common in other sciences, and therefore we suggest that this game should receive more interest as a cooperative game from researchers within computer science.
  •  
3.
  • Chen, Eric Zhi, 1963- (författare)
  • Constructions of 2-generator quasi-cyclic codes
  • 2006
  • Ingår i: Proceedings of the tenth International Workshop on Algebraic and Combinatorial Coding Theory. - Zvenigorod : Institute of Information Transmission Problems of Russian Academy of Sciences. ; , s. 60-63
  • Konferensbidrag (refereegranskat)
  •  
4.
  • Chen, Eric Zhi, 1963- (författare)
  • Constructions of quasi-cyclic two-weigh codes
  • 2006
  • Ingår i: Proc. of the tenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10). ; , s. 56-59
  • Konferensbidrag (refereegranskat)abstract
    • As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this paper, 2-generator QC codes are studied, and many good 2-generator QC codes are constructed using simplex codes. A computer algorithm is given, and used to find the best possible 2-generator QC codes. Among those 2-generator QC codes constructed, some codes are two-weight codes.
  •  
5.
  • Chen, Eric Zhi, 1963- (författare)
  • Good quasi-cyclic codes derived from irreducible cyclic codes
  • 2005
  • Ingår i: Proceedings of Optimal Codes and Related Topics (OC2005). ; , s. 74-81
  • Konferensbidrag (refereegranskat)abstract
    • As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound on the minimum distance, is also constructed.
  •  
6.
  • Chen, Eric Zhi, 1963- (författare)
  • New constructions of a family of 2-generator quasi-cyclic two-weight codes and related codes
  • 2007
  • Ingår i: Proc. of 2007 IEEE Internat. Symp. on Inform. Theory. - Piscataway, NJ : IEEE. - 9781424413973 ; , s. 2191-2195
  • Konferensbidrag (refereegranskat)abstract
    • Based on cyclic simplex codes, a new construction of a family of two-weight codes is given. These two-weight codes are in a simple 2-generator quasi-cyclic form. Based on this construction, new optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary  [195, 6, 126], [208, 6, 135], [221, 6, 144] codes are thus obtained. It was also shown that some codes that meet the Griesmer bound and thus are optimal. Furthermre, binary  self-complementary codes in a 3-generator quasi-cyclic form,  are also constructed.
  •  
7.
  • Chen, Eric Zhi, 1963- (författare)
  • New constructions of combinatorial designs and related codes
  • 2002
  • Ingår i: Proceedings of the 8th International Workshop on Algebraic coding and Combinatorial Theory (ACCT-VIII). ; , s. 264-267
  • Konferensbidrag (refereegranskat)abstract
    • New constructions of Steiner systems, majority logic decodable codes, and constant weight codes are presented. Comparisons with known results as well as examples are also given.
  •  
8.
  • Chen, Eric Zhi, 1963- (författare)
  • New results on binary quasi-cyclic codes
  • 2000
  • Ingår i: 2000 Ieee International Symposium on Information Theory. - : IEEE conference proceedings. - 0780358570 ; , s. 197-
  • Konferensbidrag (refereegranskat)abstract
    • Twelve new binary quasi-cyclic codes, which improve the lower bounds on minimum distances for binary linear codes, are presented, and a Web database on best-known binary quasi-cyclic codes is constructed for public access.
  •  
9.
  • Chen, Eric Zhi, 1963- (författare)
  • Quasi-cyclic codes derived from cyclic codes
  • 2004
  • Ingår i: Proceedings of Int. Symp. on Information Theory and its Applications (ISITA2004), Parma, Italy. ; , s. 162-165
  • Konferensbidrag (refereegranskat)
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 27

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy