RETRACTED: Studying Sensor Networks and Multicast Algorithms with TACKY

Cao Cao Xu

doi:10.4028/www.scientific.net/AMR.989-994.2093

Paper Titles

Simulation Study of Waveform Variation of Fixed Assets Based on Logical Database Structure
p.2075

The Research of Data Mining Based on Neural Networks
p.2080

RETRACTED: Towards the Simulation of Evolutionary Programming
p.2084

Based on Canny Operator with Regional Growth Combined Research on Accurate Image Segmentation Algorithm
p.2088

RETRACTED: Studying Sensor Networks and Multicast Algorithms with TACKY
p.2093

The Analysis and Realization of Interpreter Language in Nuclear Industry
p.2097

Time Prediction Based on Process Mining Taking Concept Drift into Consideration
p.2101

SBN Constructing Algorithm Based on Extended MEBN
p.2106

A Mobile-Terminal-Oriented and Mobile-Cloud-Computing-Based Localized Scheduling Algorithm
p.2111

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 989-994RETRACTED: Studying Sensor Networks and Multicast...

RETRACTED: Studying Sensor Networks and Multicast Algorithms with TACKY

Retracted:

This paper has been retracted by publisher.
This paper was found to be in violation of the scope and quality criteria. The document is now considered retracted. Due to strong violation, necessary effort should be made to remove all further references to this paper.
We regret any inconvenience this publication might cause you.

Abstract:

Retracted paper: The refinement of gigabit switches is an unproven challenge. In fact, few biologists would disagree with the refinement of lambda calculus, which embodies the intuitive principles of networking. We explore a novel framework for the synthesis of the producer-consumer problem (TACKY), which we use to show that the foremost cooperative algorithm for the synthesis of operating systems by Sun et al. is Turing complete.

By email View Pdf

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

2093-2096

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.989-994.2093

Online since:

July 2014

Authors:

Cao Cao Xu*

Keywords:

Multicast Algorithms, Producer-Consumer Problem, Sensor Networks

Export:

RIS, BibTeX

Permissions:

Creative Commons CC BY 4.0

Citation:

* - Corresponding Author

References

[1] D. Coppersmith and S.Winograd, Matrix multiplication via arithmetic progressions,, J. Symb. Comput., vol. 9, p.251–280, (1990).

DOI: 10.1016/s0747-7171(08)80013-2

Google Scholar

[2] E. A. Dinic, Algorithm for solution of a problem of maximum flow,, Sov. Math.—Dokl., vol. 11, p.1277–1280, (1970).

Google Scholar

[3] J. Dumas, T. Gautier, and C. Pernet, Finite field linear algebra subroutines,, in Proc. Int. Symp. Symbolic and Algebraic Computation(ISSAC), Lille, France, Jul. 2002, p.63–74.

DOI: 10.1145/780506.780515

Google Scholar

[4] J. Edmonds, Minimum partition of a matroid into independent sets,, J.Res. Nat. Bur. Stand. Sect., vol. 869, p.67–72, (1965).

Google Scholar

[5] S. Even and E. Tarjan, Network flow and testing graph connectivity,,SIAM J. Comput., vol. 4, p.507–518, (1975).

DOI: 10.1137/0204043

Google Scholar

[6] T. Ho, D. Karger, R. Koetter, and M. Médard, Network coding from a network flow perspective,, in Proc. IEEE Int. Symp. Information Theory (ISIT), Yokohama, Japan, Jun./Jul. 2003, p.441.

DOI: 10.1109/isit.2003.1228458

Google Scholar

[7] T. Ho, R. Koetter,M.Médard, D. Karger, and M. Effros, The benefits of coding over routing in a randomized setting,, in Proc. IEEE Int. Symp. Information Theory (ISIT), Yokohama, Japan, Jun./Jul. 2003, p.442.

DOI: 10.1109/isit.2003.1228459

Google Scholar

[8] K. Imamura, A method for computing addition tables in GF(p ),, IEEE Trans. Inf. Theory, vol. IT-26, no. 3, p.367–369, May (1980).

Google Scholar

[9] S. Jaggi, P. A. Chou, and K. Jain, Low complexity algebraic multicast network codes,, in Proc. IEEE Int. Symp. Information Theory (ISIT), Yokohama, Japan, Jun./Jul. 2003, p.368.

DOI: 10.1109/isit.2003.1228384

Google Scholar

[10] K. Jain, M. Mahdian, and M. R. Salavatipour, Packing Steiner trees,, in Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, Jan. (2003).

Google Scholar

[11] R. Koetter and M. Médard, Beyond routing: An algebraic approach to network coding,, in Proc. 21st Annu. Joint Conf. IEEE Computer and Communications Societies (INFOCOMM), vol. 1, New York, Jun. 2002, p.122–130.

DOI: 10.1109/infcom.2002.1019253

Google Scholar