الأحد، 8 يونيو 2008



Feedback
Beyond ML
Full text
Ps (58 KB)
Source
ACM Computing Surveys (CSUR) archiveVolume 28 , Issue 4es (December 1996) table of contentsSpecial issue: position statements on strategic directions in computing research
Article No. 172
Year of Publication: 1996
ISSN:0360-0300
Author
John Reynolds
Carnegie Mellon University
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1, Downloads (12 Months): 29, Citation Count: 0
Additional Information:
references collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/242224.242447What is a DOI?
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

Feedback
Higher-order concurrent programs with finite communication topology (extended abstract)
Full text
Pdf (1.09 MB)
Source
Annual Symposium on Principles of Programming Languages archiveProceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
Portland, Oregon, United States
Pages: 84 - 97
Year of Publication: 1994
ISBN:0-89791-636-0
Authors
Hanne Riis Nielson
Computer Science Department, Aarhus University, Denmark
Flemming Nielson
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1, Downloads (12 Months): 11, Citation Count: 27
Additional Information:
abstract references cited by index terms collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/174675.174538What is a DOI?
ABSTRACT
Concurrent ML (CML) is an extension of the functional language Standard ML(SML) with primitives for the dynamic creation of processes and channels and for the communication of values over channels. Because of the powerful abstraction mechanisms the communication topology of a given program may be very complex and therefore an efficient implementation may be facilitated by knowledge of the topology. This paper presents an analysis for determining when a bounded number of processes and channels will be generated. The analysis proceeds in two stages. First we extend a polymorphic type system for SML to deduce not only the type of CML programs but also their communication behaviour expressed as terms in a new process algebra. Next we develop an analysis that given the communication behaviour predicts the number of processes and channels required during the execution of the CML program. The correctness of the analysis is proved using a subject reduction property for the type system.

Feedback
The definition of Standard ML


Source
Pages: 101
Year of Publication: 1990
ISBN:0-262-63132-6
Authors
Robin Milner
Univ. of Edinburgh, Edinburgh, Scotland, UK
Mads Tofte
Nsukka Univ., Nigeria
Robert Harper
Carnegie Mellon Univ., Pittsburgh, PA
Publisher
MIT Press Cambridge, MA, USA
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 248
Additional Information:
cited by index terms review collaborative colleagues
Tools and Actions:
Review this Book Save this Book to a Binder Display Formats: BibTex EndNote ACM Ref
CITED BY 248

Alan Finlay , Lloyd Allison, Technical correspondence: a correction to the denotational semantics for the Prolog of Nicholson and Foo, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.1, p.206-208, Jan. 1993

Stephen Edwards , Luciano Lavagno , Edward A. Lee , Alberto Sangiovanni-Vincentelli, Design of embedded systems: formal models, validation, and synthesis, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001

Lujo Bauer , Andrew W. Appel , Edward W. Felten, Mechanisms for secure modular programming in Java, Software—Practice & Experience, v.33 n.5, p.461-480, 25 April 2003

Robert Harper , Peter Lee, Research in programming languages for composability, safety, and performance, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996

Bruce J. McAdam, BigTypes in ML (poster), ACM SIGPLAN Notices, v.32 n.8, p.316, Aug. 1997

Riccardo Pucella, Review of proof, language, and interaction: essays in honour of Robin Milner edited by Plotkin, Stirling and Tofte, ACM SIGACT News, v.32 n.1, March 2001


Feedback
A parallel Lisp language PaiLisp and its kernel specification
Source
Proceedings of the US/Japan workshop on Parallel Lisp on Parallel Lisp: languages and systems table of contents
Sendai, Japan
Pages: 58 - 100
Year of Publication: 1990
ISBN:0-387-52782-6
Authors
T. Ito
M. Matsui
Publisher
Springer-Verlag New York, Inc. New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 7
Additional Information:
cited by index terms collaborative colleagues
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
CITED BY 7

Simon Marlow , Simon Peyton Jones , Andrew Moran , John Reppy, Asynchronous exceptions in Haskell, ACM SIGPLAN Notices, v.36 n.5, p.274-285, May 2001

Luc Moreau, The semantics of Scheme with future, ACM SIGPLAN Notices, v.31 n.6, p.146-156, June 15, 1996

Christian Queinnec, Locality, causality and continuations, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.91-102, July-Sept. 1994

John Greiner , Guy E. Blelloch, A provably time-efficient parallel implementation of full speculation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.309-321, January 21-24, 1996, St. Petersburg Beach, Florida, United States

Susumu Nishimura , Atsushi Ohori, Parallel functional programming on recursively defined data via data-parallel recursion, Journal of Functional Programming, v.9 n.4, p.427-462, July 1999

John Greiner , Guy E. Blelloch, A provably time-efficient parallel implementation of full speculation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.2, p.240-285, March 1999

Luc Moreau, A Syntactic Theory of Dynamic Binding, Higher-Order and Symbolic Computation, v.11 n.3, p.233-279, 1998
INDEX TERMS
Primary Classification: I. Computing Methodologies I.2 ARTIFICIAL INTELLIGENCE I.2.5 Programming Languages and Software Nouns: PaiLisp
Additional Classification: C. Computer Systems Organization C.1 PROCESSOR ARCHITECTURES C.1.3 Other Architecture Styles Subjects: Data-flow architectures D. Software D.1 PROGRAMMING TECHNIQUES D.2 SOFTWARE ENGINEERING D.3 PROGRAMMING LANGUAGES D.3.2 Language Classifications Nouns: SCHEME D.3.3 Language Constructs and Features Subjects: Procedures, functions, and subroutines I. Computing Methodologies I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION I.2 ARTIFICIAL INTELLIGENCE
General Terms: Algorithms, Design, Experimentation, Languages, Performance
Collaborative Colleagues:
T. Ito: colleagues
M. Matsui: colleagues


Feedback
Asynchronous exceptions in Haskell
Full text
Pdf (1.47 MB)
Source
ACM SIGPLAN Notices archiveVolume 36 , Issue 5 (May 2001) table of contents
Pages: 274 - 285
Year of Publication: 2001
ISSN:0362-1340 Also published in ...
Authors
Simon Marlow
Microsoft Research, Cambridge
Simon Peyton Jones
Microsoft Research, Cambridge
Andrew Moran
Oregon Graduate Institute
John Reppy
Bell Labs, Lucent Technologies
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7, Downloads (12 Months): 73, Citation Count: 10
Additional Information:
abstract references cited by index terms collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/381694.378858What is a DOI?
ABSTRACT
Asynchronous exceptions, such as timeouts are important for robust, modular programs, but are extremely difficult to program with — so much so that most programming languages either heavily restrict them or ban them altogether. We extend our earlier work, in which we added synchronous exceptions to Haskell, to support asynchronous exceptions too. Our design introduces scoped combinators for blocking and unblocking asynchronous interrupts, along with a somewhat surprising semantics for operations that can suspend. Uniquely, we also give a formal semantics for our system.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Joe Armstrong , Robert Virding , Claes Wikström , Mike Williams, Concurrent programming in ERLANG (2nd ed.), Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1996

2
Ken Arnold , James Gosling, The Java programming language (2nd ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, 1998

3
Paul S. Barth , Rishiyur S. Nikhil , Arvind Nikhil, M-structures: extending a parallel, non-strict, functional language with state, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.538-568, June 1991, Cambridge, Massachusetts, United States


Feedback
Concurrent programming in ERLANG (2nd ed.)


Source
Pages: 351
Year of Publication: 1996
ISBN:0-13-508301-X
Authors
Robert Virding
Ericsson Telecommunications Systems Labs, A¨lvsjo¨, Sweden
Claes Wikström
Ericsson Telecommunications Systems Labs, A¨lvsjo¨, Sweden
Mike Williams
Ericsson Telecommunications Systems Labs, A¨lvsjo¨, Sweden
Editors
Joe Armstrong
Ericsson Telecommunications Systems Labs, A¨lvsjo¨, Sweden
Publisher
Prentice Hall International (UK) Ltd. Hertfordshire, UK, UK
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 91
Additional Information:
cited by index terms review collaborative colleagues
Tools and Actions:
Review this Book Save this Book to a Binder Display Formats: BibTex EndNote ACM Ref
CITED BY 91

John Hughes , Lars Pareto, Recursion and dynamic data-structures in bounded space: towards embedded ML programming, ACM SIGPLAN Notices, v.34 n.9, p.70-81, Sept. 1999

Peter Sewell , James J. Leifer , Keith Wansbrough , Francesco Zappa Nardelli , Mair Allen-Williams , Pierre Habouzit , Viktor Vafeiadis, Acute: high-level programming language design for distributed computation, ACM SIGPLAN Notices, v.40 n.9, September 2005

Peter Van Roy , Joe Armstrong , Matthew Flatt , Boris Magnusson, The role of language paradigms in teaching programming, ACM SIGCSE Bulletin, v.35 n.1, p.269-270, January 2003

Feedback
Dynamic software updating
Full text
Pdf (1.44 MB)
Source
ACM SIGPLAN Notices archiveVolume 36 , Issue 5 (May 2001) table of contents
Pages: 13 - 23
Year of Publication: 2001
ISSN:0362-1340 Also published in ...
Authors
Michael Hicks
Computer and Information Science Department, University of Pennsylvania
Jonathan T. Moore
Computer and Information Science Department, University of Pennsylvania
Scott Nettles
Electrical and Computer Engineering Department, University of Texas at Austin
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4, Downloads (12 Months): 39, Citation Count: 24
Additional Information:
abstract references cited by index terms collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/381694.378798What is a DOI?
ABSTRACT
Many important applications must run continuously and without interruption, yet must be changed to fix bugs or upgrade functionality. No prior general-purpose methodology for dynamic updating achieves a practical balance between flexibility, robustness, low overhead, and ease of use.
We present a new approach for C-like languages that provides type-safe dynamic updating of native code in an extremely flexible manner (code, data, and types may be updated, at programmer-determined times) and permits the use of automated tools to aid the programmer in the updating process. Our system is based on dynamic patches that both contain the updated code and the code needed to transition from the old version to the new. A novel aspect of our patches is that they consist of verifiable native code (e.g. Proof-Carrying Code [17] or Typed Assembly Language [16]), which is native code accompanied by annotations that allow on-line verification of the code's safety. We discuss how patches are generated mostly automatically, how they are applied using dynamic-linking technology, and how code is compiled to make it updateable.
To concretely illustrate our system, we have implemented a dynamically-updateable web server, FlashEd. We discuss our experience building and maintaining FlashEd. Performance experiments show that for FlashEd, the overhead due to updating is typically less than 1%.


Feedback
Gamma system: continuous evolution of software after deployment
Full text
Pdf (142 KB)
Source
ACM SIGSOFT Software Engineering Notes archiveVolume 27 , Issue 4 (July 2002) table of contents
SESSION: Faults and failure analysis table of contents
Pages: 65 - 69
Year of Publication: 2002
ISSN:0163-5948 Also published in ...
Authors
Alessandro Orso
Georgia Institute of Technology
Donglin Liang
Georgia Institute of Technology
Mary Jean Harrold
Georgia Institute of Technology
Richard Lipton
Georgia Institute of Technology
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4, Downloads (12 Months): 40, Citation Count: 17
Additional Information:
abstract references cited by collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/566171.566182What is a DOI?
ABSTRACT
In this paper, we present the GAMMA system, which facilitates remote monitoring of deployed software using a new approach that exploits the opportunities presented by a software product being used by many users connected through a network. GAMMA splits monitoring tasks across different instances of the software, so that partial information can be collected from different users by means of light-weight instrumentation, and integrated to gather the overall monitoring information. This system enables software producers (1) to perform continuous, minimally intrusive analyses of their software's behavior, and (2) to use the information thus gathered to improve and evolve their software.


Feedback
Watermarking algorithm based on a human visual model
Source
Signal Processing archiveVolume 66 , Issue 3 (May 1998) table of contents
Pages: 319 - 335
Year of Publication: 1998
ISSN:0165-1684
Authors
J. F. Delaigle
C. De Vleeschouwer
B. Macq
Publisher
Elsevier North-Holland, Inc. Amsterdam, The Netherlands, The Netherlands
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 7
Additional Information:
cited by index terms collaborative colleagues
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
10.1016/S0165-1684(98)00013-9
CITED BY 7

Ingemar J. Cox , Matt L. Miller, Facilitating watermark insertion by preprocessing media, EURASIP Journal on Applied Signal Processing, v.2004 n.1, p.2081-2092, 1 January 2004

Xinshan Zhu , Yong Gao , Yan Zhu, Image-adaptive watermarking based on perceptually shaping watermark blockwise, Proceedings of the 2006 ACM Symposium on Information, computer and communications security, March 21-24, 2006, Taipei, Taiwan

Changsheng Xu , Namunu C. Maddage , Xi Shao , Qi Tian, Content-adaptive digital music watermarking based on music structure analysis, ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP), v.3 n.1, p.1-es, February 2007

G. Rouvroy , F.-X. Standaert , F. Lefèbvre , J.-J. Quisquater , B. Macq , J.-D. Legat, Reconfigurable hardware solutions for the digital rights management of digital cinema, Proceedings of the 4th ACM workshop on Digital rights management, p.40-53, October 25-25, 2004, Washington DC, USA

Asifullah Khan , Anwar M. Mirza , Abdul Majid, Intelligent perceptual shaping of a digital watermark: Exploiting Characteristics of human visual system, International Journal of Knowledge-based and Intelligent Engineering Systems, v.10 n.3, p.213-223, July 2006

George Voyatzis , Ionnis Pitas, Protecting Digital-Image Copyrights: A Framework, IEEE Computer Graphics and Applications, v.19 n.1, p.18-24, January 1999

Florent Autrusseau , Patrick Le Callet, A robust image watermarking technique based on quantization noise visibility thresholds, Signal Processing, v.87 n.6, p.1363-1383, June, 2007
INDEX TERMS
Primary Classification: H. Information Systems H.1 MODELS AND PRINCIPLES
Additional Classification: C. Computer Systems Organization C.3 SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS Subjects: Signal processing systems G. Mathematics of Computing G.4 MATHEMATICAL SOFTWARE Subjects: Algorithm design and analysis I. Computing Methodologies I.2 ARTIFICIAL INTELLIGENCE I.2.0 General Subjects: Cognitive simulation I.5 PATTERN RECOGNITION I.5.4 Applications Subjects: Signal processing K. Computing Milieux K.5 LEGAL ASPECTS OF COMPUTING K.5.1 Hardware/Software Protection Subjects: Copyrights
General Terms: Algorithms, Design, Human Factors, Legal Aspects, Measurement, Performance, Theory
Keywords: copyright, digital picture watermarking, human vision system model, masking, spread spectrum
Collaborative Colleagues:
J. F. Delaigle: colleagues
C. De Vleeschouwer: colleagues
B. Macq: colleagues

Feedback
Facilitating watermark insertion by preprocessing media
Full text
Pdf (447 KB)
Source
EURASIP Journal on Applied Signal Processing archiveVolume 2004 , Issue 1 (January 2004) table of contents
Pages: 2081 - 2092
Year of Publication: 2004
ISSN:1110-8657
Authors
Ingemar J. Cox
Departments of Computer Science and Electronic and Electrical Engineering, University College London, Martlesham Heath, Ipswish, Suffolk, UK
Matt L. Miller
NEC Research Institute, Princeton, NJ
Publisher
Hindawi Publishing Corp. New York, NY, United States
Bibliometrics
Downloads (6 Weeks): 4, Downloads (12 Months): 6, Citation Count: 0
Additional Information:
abstract references index terms collaborative colleagues
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
10.1155/S1110865704403072
ABSTRACT
There are several watermarking applications that require the deployment of a very large number of watermark embedders. These applications often have severe budgetary constraints that limit the computation resources that are available. Under these circumstances, only simple embedding algorithms can be deployed, which have limited performance. In order to improve performance, we propose preprocessing the original media. It is envisaged that this preprocessing occurs during content creation and has no budgetary or computational constraints. Preprocessing combined with simple embedding creates a watermarked Work, the performance of which exceeds that of simple embedding alone. However, this performance improvement is obtained without any increase in the computational complexity of the embedder. Rather, the additional computational burden is shifted to the preprocessing stage. A simple example of this procedure is described and experimental results confirm our assertions.

Feedback
Approximate Reasoning in MAS: Rough Set Approach
Full text
Pdf (109 KB)
Source
Web Intelligence archiveProceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence table of contents
Pages 12-18
Year of Publication: 2006
ISBN:0-7695-2747-7
Author
Andrzej Skowron
Warsaw University, Poland
Publisher
IEEE Computer Society Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 10, Downloads (12 Months): 137, Citation Count: 0
Additional Information:
abstract references index terms collaborative colleagues
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
10.1109/WI.2006.43
ABSTRACT
In modeling multiagent systems for real-life problems, techniques for approximate reasoning about vague concepts and dependencies (ARVCD) are necessary. We discuss an approach to approximate reasoning based on rough sets. In particular, we present a number of basic concepts such as approximation spaces, concept approximation, rough inclusion, construction of information granules in calculi of information granules, and perception logic. The approach to ARVCD is illustrated by examples relative to interactions of agents, ontology approximation, adaptive hierarchical learning of compound concepts and skills, behavioral pattern identification, planning, conflict analysis and negotiations, and perception-based reasoning.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
[1] Rough Set Exploration System (RSES). Available at: logic.mimuw.edu.pl/~rses.

2
[2] R. M. Axelrod. The Complexity of Cooperation. Princeton University Press, Princeton, NJ, 1997.

3
[3] J. Bazan. The Road simulator. Available at: logic.mimuw.edu.pl/~bazan/simulator.

4
[4] J. Bazan, P. Kruczek, S. Bazan-Socha, A. Skowron, and J. J. Pietrzyk. Automatic planning of treatment of infants with respiratory failure through rough set modeling. In Proceedings of RSCTC'2006, LNAI. Springer, Heidelberg, 2006. to be published.

5
[5] J. Bazan, P. Kruczek, S. Bazan-Socha, A. Skowron, and J. J. Pietrzyk. Risk pattern identification in the treatment of infants with respiratory failure through rough set modeling. In Proceedings of IPMU'2006, Paris, France, July 2-7, 2006, pages 2650-2657. Éditions E. D. K., Paris, 2006.

6
[6] J. Bazan, A. Skowron, and R. Swiniarski. Rough sets and vague concept approximation: From sample approximation to adaptive learning. Transactions on Rough Sets V: LNCS Journal Subline, Springer, Heidleberg, LNCS 4100:39-62, 2006.

7
[7] J. G. Bazan, J. F. Peters, and A. Skowron. Behavioral pattern identification through rough set modelling. In Slezak et al. [57], pages 688-697.

8
[8] J. G. Bazan and A. Skowron. Classifiers based on approximate reasoning schemes. In Dunin-Keplicz et al. [19], pages 191-202.

9
Sven Behnke, Hierarchical Neural Networks for Image Interpretation (Lecture Notes in Computer Science), Springer-Verlag New York, Inc., Secaucus, NJ, 2003

10
Eric Bonabeau , Marco Dorigo , Guy Theraulaz, Swarm intelligence: from natural to artificial systems, Oxford University Press, Inc., New York, NY, 1999

11
[11] L. Breiman. Statistical modeling: The two cultures. Statistical Science, 16(3):199-231, 2001.

12
[12] F. Brown. Boolean Reasoning. Kluwer Academic Publishers, Dordrecht, 1990.

13
Nicholas L. Cassimatis, A cognitive substrate for achieving human-level intelligence, AI Magazine, v.27 n.2, p.45-56, July 2006

14
Nicholas Cassimatis , Erik T. Mueller , Patrick Henry Winston, Achieving human-level intelligence through integrated systems and research: introduction to this special issue, AI Magazine, v.27 n.2, p.12-14, July 2006
15
Anand Desai, Introduction, Communications of the ACM, v.48 n.5, May 2005 [doi>10.1145/1060710.1060736]

16
[16] T. G. Dietterich. Hierarchical reinforcement learning with the MAXQ value function decomposition. Artificial Intelligence , 13(5):227-303, 2000.

17
Patrick Doherty , Witold Lukaszewicz , Andrzej Skowron , Andrzej Szalas, Knowledge Representation Techniques (Studies in Fuzziness and Soft Computing), Springer-Verlag New York, Inc., Secaucus, NJ, 2006

18
Richard O. Duda , Peter E. Hart , David G. Stork, Pattern Classification (2nd Edition), Wiley-Interscience, 2000

19
Barbara Dunin-Keplicz , Andrzej Jankowski , Andrzej Skowron , Marcin Szczuka, Monitoring, Security, and Rescue Techniques in Multiagent Systems (Advances in Soft Computing), Springer-Verlag New York, Inc., Secaucus, NJ, 2005

20
[20] M. Fahle and T. Poggio. Perceptual Learning. The MIT Press, Cambridge, MA, 2002.

21
Kenneth D. Forbus , Thomas R. Hinrichs, Companion cognitive systems: a step toward human-level AI, AI Magazine, v.27 n.2, p.83-95, July 2006

22
Richard Granger, Engines of the brain: the computational instruction set of human cognition, AI Magazine, v.27 n.2, p.15-32, July 2006

23
[23] G. Frege. Grundgesetzen der Arithmetik, 2. Verlag von Hermann Pohle, Jena, 1903.

24
[24] J. Friedman, T. Hastie, and R. Tibshirani. The Elements of Statistical Learning: Data Mining, Inference, and Prediction . Springer, Heidelberg, 2001.

25
Murray Gell-Mann, The quark and the jaguar: adventures in the simple and the complex, W. H. Freeman & Co., New York, NY, 1995

26
Dana Nau , Malik Ghallab , Paolo Traverso, Automated Planning: Theory & Practice, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2004

27
[27] A. Jankowski and A. Skowron. A wistech paradigm for intelligent systems. Transactions on Rough Sets VI: LNCS Journal Subline, Springer, Heidleberg, LNCS, 2007. to be published.

28
[28] L. P. Kaelbling, M. L. Littman, and A. W. Moore. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4:227-303, 1996.

29
Sarit Kraus, Strategic negotiation in multiagent environments, MIT Press, Cambridge, MA, 2001

30
Pat Langley, Cognitive architectures and general intelligent systems, AI Magazine, v.27 n.2, p.33-44, July 2006

31
[31] S. Lesniewski. Grungzüge eines neuen Systems der Grundlagen der Mathematik. Fundamenta Mathematicae, 14:1- 81, 1929.

32
Autonomous agents and multi-agent systems: explorations in learning, self-organization and adaptive computation, World Scientific Publishing Co., Inc., River Edge, NJ, 2001

33
Jiming Liu , XiaoLong Jin , Kwok Ching Tsui, Autonomy Oriented Computing: From Problem Solving to Complex Systems Modeling (Multiagent Systems, Artificial Societies, and Simulated Organizations), Springer-Verlag New York, Inc., Secaucus, NJ, 2004

34
[34] M. Luck, P. McBurney, and C. Preist. Agent Technology. Enabling Next Generation Computing: A Roadmap for Agent Based Computing. AgentLink, 2003.

35
[35] J. ¿ukasiewicz. Die logischen Grundlagen der Wahrscheinlichkeitsrechnung, Kraków 1913. In L. Borkowski, editor, Jan ¿ukasiewicz - Selected Works, pages 16-63. North Holland & Polish Scientific Publishers, Amsterdam, London, Warsaw, 1970.

36
Elizabeth Amy Mcgovern , Andrew G. Barto, Autonomous discovery of temporal abstractions from interaction with an environment, University of Massachusetts Amherst, 2002

37
[37] R. Miikkulainen, J. A. Bednar, Y. Choe, and J. Sirosh. Computational Maps in the Visual Cortex. Springer, Hiedelberg, 2005.

38
[38] H. S. Nguyen. Approximate boolean reasoning: Foundations and applications in data mining. In J. F. Peters and A. Skowron, editors, Transactions on Rough Sets V: Journal Subline, volume 4100 of Lecture Notes in Computer Science , pages 344-523. Springer, Heidelberg, 2006.

39
[39] H. S. Nguyen, J. Bazan, A. Skowron, and S. H. Nguyen. Layered learning for concept synthesis. Transactions on Rough Sets I: LNCS Journal Subline, Springer, Heidleberg, LNCS 3100:187-208, 2004.

40
[40] S. H. Nguyen, T. T. Nguyen, and H. S. Nguyen. Rough set approach to sunspot classification. In Slezak et al. [57], pages 263-272.

41
[41] T. T. Nguyen and A. Skowron. Rough set approach to domain knowledge approximation. In G. Wang, Q. Liu, Y. Yao, and A. Skowron, editors, Proceedings of the 9-th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC'2003), Chongqing, China, Oct 19-22, 2003, volume 2639 of LNCS, pages 221- 228. Springer, Heidelberg.

42
Lech Polkowski , Sankar K. Pal , Andrzej Skowron, Rough-Neuro-Computing: Techniques for Computing with Words, Springer-Verlag New York, Inc., Secaucus, NJ, 2002

43
Zdzislaw Pawlak, Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Norwell, MA, 1992

44
[44] Z. Pawlak and A. Skowron. Rough sets and boolean reasoning. Information Sciences, 2006. to be published.

45
[45] Z. Pawlak and A. Skowron. Rough sets: Some extensions. Information Sciences, 2006. to be published.

46
[46] Z. Pawlak and A. Skowron. Rudiments of rough sets. Information Sciences, 2006. to be published.

47
[47] T. Poggio and S. Smale. The mathematics of learning: Dealing with data. Notices of the AMS, 50(5):537-544, 2003.

48
[48] L. Polkowski and A. Skowron. Rough mereology: A new paradigm for approximate reasoning. International Journal of Approximate Reasoning, 15(4):333-365, 1996.

49
[49] H. Rasiowa. Algebraic models of logics. Warsaw University, Warsaw, 2001.

50
Craig Schlenoff , Jim Albus , Elena Messina , Anthony J. Barbera , Raj Madhavan , Stephen Balakrisky, Using 4D/RCS to address AI knowledge integration, AI Magazine, v.27 n.2, p.71-82, July 2006

51
[51] A. Skowron. Rough sets in KDD (plenary talk). In Z. Shi, B. Faltings, and M. Musen, editors, 16-th World Computer Congress (IFIP'2000): Proceedings of Conference on Intelligent Information Processing (IIP'2000), pages 1-14. Publishing House of Electronic Industry, Beijing, 2000.

52
[52] A. Skowron. Perception logic in intelligent systems. In S. Blair et al, editor, Proceedings of the 8th Joint Conference on Information Sciences (JCIS 2005), July 21-26, 2005, Salt Lake City, Utah, USA, pages 1-5. X-CD Technologies: A Conference & Management Company, ISBN 0-9707890-3- 3, Toronto, Ontario, Canada, 2005.

53
Andrzej Skowron, Rough Sets and Vague Concepts, Fundamenta Informaticae, v.64 n.1-4, p.417-431, January 2005

54
[54] A. Skowron. Rough sets in perception-based computing (keynote talk). In S. K. Pal, S. Bandoyopadhay, and S. Biswas, editors, First International Conference on Pattern Recognition and Machine Intelligence (PReMI'05) December 18-22, 2005, Indian Statistical Institute, Kolkata, volume 3776 of LNCS, pages 21-29, Heidelberg, 2005. Springer.

55
[55] A. Skowron and J. Stepaniuk. Information granules and rough-neural computing. In Pal et al. [42], pages 43-84.

56
Andrzej Skowron , Jarosław Stepaniuk , James Peters , Roman Swiniarski, Calculi of Approximation Spaces, Fundamenta Informaticae, v.72 n.1-3, p.363-378, January 2006

57
Dominik Slezak , JingTao Yao , James F. Peters , Wojciech Ziarko , Xiaohua Hu, Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing: 10th International Conference, RSFDGrC 2005, Regina, Canada, August 31 - September 2, 2005, ... / Lecture Notes in Artificial Intelligence), Springer-Verlag New York, Inc., Secaucus, NJ, 2005

58
Peter Stone, Layered Learning in Multiagent Systems: A Winning Approach to Robotic Soccer, MIT Press, Cambridge, MA, 2000

59
Richard S. Sutton , Andrew G. Barto, Introduction to Reinforcement Learning, MIT Press, Cambridge, MA, 1998

60
William Swartout , Jonathan Gratch , Randall W. Hill , Eduard Hovy , Stacy Marsella , Jeff Rickel , David Traum, Toward virtual humans, AI Magazine, v.27 n.2, p.96-108, July 2006

61
[61] K. Sycara. Multiagent systems. AI Magazine, pages 79-92, Summer 1998.

62
[62] C. Urmson, J. Anhalt, M. Clark, T. Galatali, J. P. Gonzalez, J. Gowdy, A. Gutierrez, S. Harbaugh, M. Johnson-Roberson, H. Kato, P. L. Koon, K. Peterson, B. K. Smith, S. Spiker, E. Tryzelaar, and W. R. L. Whittaker. High speed navigation of unrehearsed terrain: Red team technology for grand challenge 2004. Technical Report CMU-RI-TR-04-37, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, June 2004.

63
[63] W. Van Wezel, R. Jorna, and A. Meystel. Planning in Intelligent Systems: Aspects, Motivations, and Methods. John Wiley & Sons, Hoboken, New Jersey, 2006.

64
[64] V. Vapnik. Statistical Learning Theory. John Wiley & Sons, New York, NY, 1998.

65
[65] L. A. Zadeh. Fuzzy sets. Information and Control, 8:338- 353, 1965.
INDEX TERMS
Primary Classification: I. Computing Methodologies I.2 ARTIFICIAL INTELLIGENCE I.2.4 Knowledge Representation Formalisms and Methods
Additional Classification: I. Computing Methodologies I.2 ARTIFICIAL INTELLIGENCE I.2.11 Distributed Artificial Intelligence Subjects: Multiagent systems I.2.3 Deduction and Theorem Proving

Feedback
Channel sharing scheme for packet-switched cellular networks
Full text
Pdf (2.53 MB)
Source
Wireless Networks archiveVolume 11 , Issue 6 (November 2005) table of contents
Pages: 661 - 676
Year of Publication: 2005
ISSN:1022-0038
Authors
Suresh Kalyanasundaram
Motorola India Electronics Limited, Bagmane Tech Park, C. V. Raman Nagar Post, Bangalore, India
Junyi Li
Flarion Technologies, Bedminster One, Bedminster, NJ
Edwin K. P. Chong
Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO
Ness B. Shroff
School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN
Publisher
Kluwer Academic Publishers Hingham, MA, USA
Bibliometrics
Downloads (6 Weeks): 3, Downloads (12 Months): 27, Citation Count: 0
Additional Information:
abstract references index terms collaborative colleagues
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
10.1007/s11276-005-3521-x
ABSTRACT
In this paper, we study an approach for sharing channels to improve network utilization in packet-switched cellular networks. Our scheme exploits unused resources in neighboring cells without the need for global coordination. We formulate a minimax approach to Optimizing the allocation of channels in this sharing scheme. We develop a measurement-based distributed algorithm to achieve this objective and study its convergence. We illustrate, via simulation results, that the distributed channel sharing scheme performs significantly better than the fixed channel scheme over a wide variety of traffic conditions.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
[1] C.-J. Chang, P.-C. Huang and T.-T. Su, Channel borrowing scheme in a cellular radio system with guard channels and finite queues, in: IEEE International Communications Conference vol. 2, Dallas, TX (1996) pp. 1168-1172.

2
[2] V.F. Dem'yanov and V.N. Malozemov, Introduction to Minimax (John Wiley and Sons, 1974).

3
[3] D.J. Goodman and S.X. Wei, Efficiency of packet reservation multiple access, IEEE Transactions on Vehicular Technology 40(1) (1991) 170-176.

4
[4] H. Jiang and S. Rappaport, CBWL: A new channel assignment and sharing method for cellular communication systems, IEEE Transactions on Vehicular Technology 43(2) (1994) 313-322.

5
[5] H. Jiang and S. Rappaport, A channel borrowing scheme for TDMA cellular communications systems, in: IEEE Vehicular Technology Conference 1, Chicago, IL (1995) pp. 97-101.

6
Hua Jiang , Stephen S. Rappaport, Prioritized channel borrowing without locking: a channel sharing strategy for cellular communications, IEEE/ACM Transactions on Networking (TON), v.4 n.2, p.163-172, April 1996 [doi>10.1109/90.490744]

7
[7] S. Kalyanasundaram, J. Li, E.K.P. Chong and N.B. Shroff, Channel sharing scheme for packet-switched cellular networks, in: IEEE INFOCOM'99 New York (March 1999) pp. 609-616.

8
[8] I. Katzela and M. Naghshineh, Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey, IEEE Personal Communications Magazine (June 1996) pp. 10-31.

9
A Channel Sharing Scheme to Improve System Capacity in Wireless Cellular Networks, Proceedings of the Third IEEE Symposium on Computers & Communications, p.700, June 30-July 02, 1998

10
[10] J. Li, N.B. Shroff and E.K.P. Chong, A study of a channel sharing scheme in wireless cellular networks including handoffs, in: IEEE INFOCOM '99 New York (March 1999) pp. 1179-1186.

11
Junyi Li , Ness B. Shroff , Edwin K. P. Chong, A new localized channel sharing scheme for cellular networks, Wireless Networks, v.5 n.6, p.503-517, 1999 [doi>10.1023/A:1019196321628 ]

12
[12] S.Tekinay and B. Jabbari, Handover and channel assignment in mobile cellular networks, IEEE Communications Magazine 29(11) (1991) 42-46.

13
Chengzhong Xu , Chenzhong Xu , Francis C. Lau, Load Balancing in Parallel Computers: Theory and Practice, Kluwer Academic Publishers, Norwell, MA, 1997

14
[14] K.L. Yeung and T.-S.P. Yum, Cell group decoupling analysis of a dynamic channel assignment strategy in microcellular radio systems, IEEE Transactions on Communications 43(2-4) (1995) 1289-1292.

15
[15] M. Zhang and T.-S. Yum, Comparisons of channel assignment strategies in cellular mobile telephone systems, IEEE Transactions on Vehicular Technology 38(4) (1989) 211-215.
INDEX TERMS
Primary Classification: C. Computer Systems Organization C.2 COMPUTER-COMMUNICATION NETWORKS C.2.5 Local and Wide-Area Networks Subjects: Access schemes
Additional Classification: C. Computer Systems Organization C.2 COMPUTER-COMMUNICATION NETWORKS C.2.1 Network Architecture and Design Subjects: Packet-switching networks; Wireless communication C.2.3 Network Operations Subjects: Network management E. Data E.4 CODING AND INFORMATION THEORY Subjects: Formal models of communication F. Theory of Computation F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY F.2.2 Nonnumerical Algorithms and Problems Subjects: Sequencing and scheduling
General Terms: Algorithms, Design, Management
Keywords: cellular networks, channel sharing, convergence, distributed algorithm, minimax problem, packet switching
Collaborative Colleagues:
Suresh Kalyanasundaram: colleagues
Junyi Li: colleagues
Edwin K. P. Chong: colleagues
Ness B. Shroff: colleagues