Relevant bibliographies by topics / Cycle stealing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Cycle stealing'

Author: Grafiati
Published: 4 June 2021
Last updated: 26 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cycle stealing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Cycle stealing"

1

Osogami, Takayuki, Mor Harchol-Balter, and Alan Scheller-Wolf. "Analysis of cycle stealing with switching cost." ACM SIGMETRICS Performance Evaluation Review 31, no. 1 (2003): 184–95. http://dx.doi.org/10.1145/885651.781050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jiang, Bo, Philippe Nain, and Don Towsley. "Covert Cycle Stealing in a Single FIFO Server." ACM Transactions on Modeling and Performance Evaluation of Computing Systems 6, no. 2 (2021): 1–33. http://dx.doi.org/10.1145/3462774.

Full text
Abstract:
Consider a setting where Willie generates a Poisson stream of jobs and routes them to a single server that follows the first-in first-out discipline. Suppose there is an adversary Alice, who desires to receive service without being detected. We ask the question: What is the number of jobs that she can receive covertly, i.e., without being detected by Willie? In the case where both Willie and Alice jobs have exponential service times with respective rates μ 1 and μ 2 , we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles: over n busy periods, she can achieve a covert throughput, measured by the expected number of jobs covertly inserted, of O (√ n ) when μ 1 < 2 μ 2 , O (√ n log n ) when μ 1 = 2μ 2 , and O ( n μ 2 /μ 1 ) when μ 1 > 2μ 2 . When both Willie and Alice jobs have general service times, we establish an upper bound for the number of jobs Alice can execute covertly. This bound is related to the Fisher information. More general insertion policies are also discussed.
APA, Harvard, Vancouver, ISO, and other styles
3

Osogami, Takayuki, Mor Harchol-Balter, and Alan Scheller-Wolf. "Analysis of cycle stealing with switching times and thresholds." Performance Evaluation 61, no. 4 (2005): 347–69. http://dx.doi.org/10.1016/j.peva.2004.09.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Halang, Wolfgang A. "On methods for direct memory access without cycle stealing." Microprocessing and Microprogramming 17, no. 5 (1986): 277–83. http://dx.doi.org/10.1016/0165-6074(86)90003-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kotani, Y., F. Ino, and K. Hagihara. "A Resource Selection System for Cycle Stealing in GPU Grids." Journal of Grid Computing 6, no. 4 (2008): 399–416. http://dx.doi.org/10.1007/s10723-008-9099-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Forshaw, Matthew, A. Stephen McGough, and Nigel Thomas. "Energy-efficient Checkpointing in High-throughput Cycle-stealing Distributed Systems." Electronic Notes in Theoretical Computer Science 310 (January 2015): 65–90. http://dx.doi.org/10.1016/j.entcs.2014.12.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bradley, Jeremy T., Matthew Forshaw, Anton Stefanek, and Nigel Thomas. "Time-inhomogeneous Population Models of a Cycle-Stealing Distributed System." Electronic Notes in Theoretical Computer Science 318 (November 2015): 5–17. http://dx.doi.org/10.1016/j.entcs.2015.10.016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gupta, Ankur, and Lalit K. Awasthi. "A Containment-Based Security Model for Cycle-Stealing P2P Applications." Information Security Journal: A Global Perspective 19, no. 4 (2010): 191–203. http://dx.doi.org/10.1080/19393551003762207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bhatt, S. N., F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg. "On optimal strategies for cycle-stealing in networks of workstations." IEEE Transactions on Computers 46, no. 5 (1997): 545–57. http://dx.doi.org/10.1109/12.589220.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rosenberg, Arnold L. "Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations." Journal of Parallel and Distributed Computing 59, no. 1 (1999): 31–53. http://dx.doi.org/10.1006/jpdc.1999.1564.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Cycle stealing"

1

Robertson, Calum Stewart. "Parallel data mining on cycle stealing networks." Thesis, Queensland University of Technology, 2004. https://eprints.qut.edu.au/15970/1/Calum_Robertson_Thesis.pdf.

Full text
Abstract:
In a world where electronic databases are used to store ever-increasing quantities of data it is becoming harder to mine useful information from them. Therefore there is a need for a highly scalable parallel architecture capable of handling the ever-increasing complexity of data mining problems. A cycle stealing network is one possible scalable solution to this problem. A cycle stealing network allows users to donate their idle cycles to form a virtual supercomputer by connecting multiple machines via a network. This research aims to establish whether cycle stealing networks, specifically the G2 system developed at the Queensland University of Technology, are viable for large scale data mining problems. The computationally intensive sequence mining, feature selection and functional dependency mining problems are deliberately chosen to test the usefulness and scalability of G2. Tests have shown that G2 is highly scalable where the ratio of computation to communication is approximately known. However for combinatorial problems where computation times are difficult or impossible to predict, and communication costs can be unpredictable, G2 often provides little or no speedup. This research demonstrates that existing sequence mining and functional dependency mining techniques are not suited to a client-server style cycle stealing network like G2. However the feature selection is well suited to G2, and a new sequence mining algorithm offers comparable performance to other existing, non-cycle stealing, parallel sequence mining algorithms. Furthermore new functional dependency mining algorithms offer substantial benefit over existing serial algorithms.
APA, Harvard, Vancouver, ISO, and other styles
2

Robertson, Calum Stewart. "Parallel Data Mining On Cycle Stealing Networks." Queensland University of Technology, 2004. http://eprints.qut.edu.au/15970/.

Full text
Abstract:
In a world where electronic databases are used to store ever-increasing quantities of data it is becoming harder to mine useful information from them. Therefore there is a need for a highly scalable parallel architecture capable of handling the ever-increasing complexity of data mining problems. A cycle stealing network is one possible scalable solution to this problem. A cycle stealing network allows users to donate their idle cycles to form a virtual supercomputer by connecting multiple machines via a network. This research aims to establish whether cycle stealing networks, specifically the G2 system developed at the Queensland University of Technology, are viable for large scale data mining problems. The computationally intensive sequence mining, feature selection and functional dependency mining problems are deliberately chosen to test the usefulness and scalability of G2. Tests have shown that G2 is highly scalable where the ratio of computation to communication is approximately known. However for combinatorial problems where computation times are difficult or impossible to predict, and communication costs can be unpredictable, G2 often provides little or no speedup. This research demonstrates that existing sequence mining and functional dependency mining techniques are not suited to a client-server style cycle stealing network like G2. However the feature selection is well suited to G2, and a new sequence mining algorithm offers comparable performance to other existing, non-cycle stealing, parallel sequence mining algorithms. Furthermore new functional dependency mining algorithms offer substantial benefit over existing serial algorithms.
APA, Harvard, Vancouver, ISO, and other styles
3

Mason, Richard S. "A framework for fully decentralised cycle stealing." Thesis, Queensland University of Technology, 2007. https://eprints.qut.edu.au/26039/1/Richard_Mason_Thesis.pdf.

Full text
Abstract:
Ordinary desktop computers continue to obtain ever more resources – in-creased processing power, memory, network speed and bandwidth – yet these resources spend much of their time underutilised. Cycle stealing frameworks harness these resources so they can be used for high-performance computing. Traditionally cycle stealing systems have used client-server based architectures which place significant limits on their ability to scale and the range of applica-tions they can support. By applying a fully decentralised network model to cycle stealing the limits of centralised models can be overcome. Using decentralised networks in this manner presents some difficulties which have not been encountered in their previous uses. Generally decentralised ap-plications do not require any significant fault tolerance guarantees. High-performance computing on the other hand requires very stringent guarantees to ensure correct results are obtained. Unfortunately mechanisms developed for traditional high-performance computing cannot be simply translated because of their reliance on a reliable storage mechanism. In the highly dynamic world of P2P computing this reliable storage is not available. As part of this research a fault tolerance system has been created which provides considerable reliability without the need for a persistent storage. As well as increased scalability, fully decentralised networks offer the ability for volunteers to communicate directly. This ability provides the possibility of supporting applications whose tasks require direct, message passing style communication. Previous cycle stealing systems have only supported embarrassingly parallel applications and applications with limited forms of communication so a new programming model has been developed which can support this style of communication within a cycle stealing context. In this thesis I present a fully decentralised cycle stealing framework. The framework addresses the problems of providing a reliable fault tolerance sys-tem and supporting direct communication between parallel tasks. The thesis includes a programming model for developing cycle stealing applications with direct inter-process communication and methods for optimising object locality on decentralised networks.
APA, Harvard, Vancouver, ISO, and other styles
4

Mason, Richard S. "A framework for fully decentralised cycle stealing." Queensland University of Technology, 2007. http://eprints.qut.edu.au/26039/.

Full text
Abstract:
Ordinary desktop computers continue to obtain ever more resources – in-creased processing power, memory, network speed and bandwidth – yet these resources spend much of their time underutilised. Cycle stealing frameworks harness these resources so they can be used for high-performance computing. Traditionally cycle stealing systems have used client-server based architectures which place significant limits on their ability to scale and the range of applica-tions they can support. By applying a fully decentralised network model to cycle stealing the limits of centralised models can be overcome. Using decentralised networks in this manner presents some difficulties which have not been encountered in their previous uses. Generally decentralised ap-plications do not require any significant fault tolerance guarantees. High-performance computing on the other hand requires very stringent guarantees to ensure correct results are obtained. Unfortunately mechanisms developed for traditional high-performance computing cannot be simply translated because of their reliance on a reliable storage mechanism. In the highly dynamic world of P2P computing this reliable storage is not available. As part of this research a fault tolerance system has been created which provides considerable reliability without the need for a persistent storage. As well as increased scalability, fully decentralised networks offer the ability for volunteers to communicate directly. This ability provides the possibility of supporting applications whose tasks require direct, message passing style communication. Previous cycle stealing systems have only supported embarrassingly parallel applications and applications with limited forms of communication so a new programming model has been developed which can support this style of communication within a cycle stealing context. In this thesis I present a fully decentralised cycle stealing framework. The framework addresses the problems of providing a reliable fault tolerance sys-tem and supporting direct communication between parallel tasks. The thesis includes a programming model for developing cycle stealing applications with direct inter-process communication and methods for optimising object locality on decentralised networks.
APA, Harvard, Vancouver, ISO, and other styles
5

Sumitomo, Jiro. "A programming model and performance model for cycle stealing." Thesis, Queensland University of Technology, 2006. https://eprints.qut.edu.au/16320/1/Jiro_Sumitomo.pdf.

Full text
Abstract:
This work describes a programming model and performance model for cycle stealing on the Internet. Cycle stealing is the use of otherwise idle computers to perform work, and promises high performance computing at relatively low cost. The Internet, being the largest pool of potentially idle computers, is an obvious target for cycle stealing. However, computers connected to the Internet are often protected by firewalls, preventing point-to-point communication between them. The fluctuating avail-ability of computers for cycle stealing as they move in and out of an idle state, combined with the restricted communication of the Internet environment, means that programming models and abstractions suitable for programming supercom-puters and clusters are not ideal. Therefore, I have created a programming model for cycle stealing which reflects the types of parallel applications that are suitable for execution using idle computers connected to the Internet. The model is de-signed for use by non-expert parallel programmers, and I will show how it simpli-fies the development of cycle stealing applications, enabling rapid application de-velopment, and straightforward porting of existing sequential applications. This simple to use programming model, combined with the low cost of cycle stealing, improves the accessibility of high performance computing to non-traditional us-ers of supercomputers and clusters. Deployment on the Internet, and the need to navigate through firewalls, suggests a web based framework using common web protocols, web servers and web browsers. Part of this work investigates the feasibility of web based approaches to cycle stealing, from the setup of a cycle stealing system, application development and deployment, and connection of potentially idle computers. I designed and implemented a cycle stealing framework, deployable on the web, to meet expec-tations of performance, reliability, ease of use and safety. Existing cycle stealing frameworks emphasise the need for applications to be de-composed into a set of jobs that execute for a long period, that is, a job should have a computation time sufficient to justify its communication cost. However, there are no tools available for users to determine what an appropriate computa-tion time might be, given a job's data communication requirements. To date, de-ciding the granularity of jobs has been a matter of intuition. Therefore, a user may experience uncertainty as to the benefit of cycle stealing for their particular application, especially if the applications will have relatively short-lived jobs. Based on performance analysis of my framework, I have developed an analytical model and simulator, which can be used to predict, and help to optimise, the per-formance of user applications, and show the feasibility of executing a particular application using the cycle stealing framework.
APA, Harvard, Vancouver, ISO, and other styles
6

Sumitomo, Jiro. "A programming model and performance model for cycle stealing." Queensland University of Technology, 2006. http://eprints.qut.edu.au/16320/.

Full text
Abstract:
This work describes a programming model and performance model for cycle stealing on the Internet. Cycle stealing is the use of otherwise idle computers to perform work, and promises high performance computing at relatively low cost. The Internet, being the largest pool of potentially idle computers, is an obvious target for cycle stealing. However, computers connected to the Internet are often protected by firewalls, preventing point-to-point communication between them. The fluctuating avail-ability of computers for cycle stealing as they move in and out of an idle state, combined with the restricted communication of the Internet environment, means that programming models and abstractions suitable for programming supercom-puters and clusters are not ideal. Therefore, I have created a programming model for cycle stealing which reflects the types of parallel applications that are suitable for execution using idle computers connected to the Internet. The model is de-signed for use by non-expert parallel programmers, and I will show how it simpli-fies the development of cycle stealing applications, enabling rapid application de-velopment, and straightforward porting of existing sequential applications. This simple to use programming model, combined with the low cost of cycle stealing, improves the accessibility of high performance computing to non-traditional us-ers of supercomputers and clusters. Deployment on the Internet, and the need to navigate through firewalls, suggests a web based framework using common web protocols, web servers and web browsers. Part of this work investigates the feasibility of web based approaches to cycle stealing, from the setup of a cycle stealing system, application development and deployment, and connection of potentially idle computers. I designed and implemented a cycle stealing framework, deployable on the web, to meet expec-tations of performance, reliability, ease of use and safety. Existing cycle stealing frameworks emphasise the need for applications to be de-composed into a set of jobs that execute for a long period, that is, a job should have a computation time sufficient to justify its communication cost. However, there are no tools available for users to determine what an appropriate computa-tion time might be, given a job's data communication requirements. To date, de-ciding the granularity of jobs has been a matter of intuition. Therefore, a user may experience uncertainty as to the benefit of cycle stealing for their particular application, especially if the applications will have relatively short-lived jobs. Based on performance analysis of my framework, I have developed an analytical model and simulator, which can be used to predict, and help to optimise, the per-formance of user applications, and show the feasibility of executing a particular application using the cycle stealing framework.
APA, Harvard, Vancouver, ISO, and other styles
7

Tai, Chin-Chung, and 戴誌中. "A Cycle-Stealing Technique for Pipelined Instruction Decompression System for Embedded Microprocessors." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/82601726338967749751.

Full text
Abstract:
碩士<br>國立高雄應用科技大學<br>電子與資訊工程研究所碩士班<br>95<br>In this paper, we propose a high performance code compression and decompression system. At first, according to the branch instruction of ARM. We distinguish direct instructions and indirect instructions from instruction of ARM. Then we demarcate the basic block defined in the machine code, and then calculate the appearance probability of all basic block. Then we use Huffman algorithm to compress each section, and achieve a better compression ratio. However before the processor execution, it must go through the decompression circuit to restore the machine code. So in our decompression portion, we proposed a pipeline with back-up for flushing (PBF) technique to avoid the loss of efficiency. We designed a Huffman Decoder within decompression system, and proposed a cycle –stealing technique to improve the time delay, and we designed a decompression system suit to pipeline. Because of improvement of performance, it must waste approximately 2.3% compression ratio. In experimental results, the average compression ratio is about 40%~43%.The hardware cost deceased about 35%, and faster than our previous version.
APA, Harvard, Vancouver, ISO, and other styles
8

Chu, Ching-Hua, and 朱慶華. "A New Cycle-Stealing with Interrupt Handling Technique for Pipelined Instruction Decompression System in Embedded Microprocessors." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/19290974358050293400.

Full text
Abstract:
碩士<br>國立高雄應用科技大學<br>電子與資訊工程研究所碩士班<br>96<br>In this thesis, we propose a high performance code compression and decompression system. At first, according to the branch instruction of ARM. We distinguish direct instructions and indirect instructions from instruction of ARM. Then we demarcate the basic block defined in the machine code, and then calculate the appearance probability of all basic block. Then we use Huffman algorithm to compress each section, and achieve a better compression ratio. We designed a new Huffman decoder in decompression system, and proposed a new cycle –stealing technique to improve the time delay, and we designed a decompression system that can provide exception handling. We provide two stacks to hold the two instructions early. When ARM wants to return from the exception, the system can get through these two registers directive. Because of the improvement of performance, it must waste approximately 2.3% of compression ratio. In experimental results, the average compression ratio is about 40%~43% while the hardware cost deceased about 25%, and this system can provide exception handling.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Cycle stealing"

1

Oxley, Mat. Stealing speed: The biggest spy game in motorsport history. Haynes North America Inc, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Oxley, Mat. Stealing speed: The biggest spy scandal in motorsport history. Haynes, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Olsen, Charlotte. Stop Anxiety: Special Edition - Two Books - End the Cycle of Anxiety and Panic Attacks from Stealing Your Freedom and Opportunities. Workable Plans Anyone Can Implement Quickly to See Results. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Cycle stealing"

1

Kelly, P. H. J., S. Pelagatti, and M. Rossiter. "Instant-Access Cycle-Stealing for Parallel Applications Requiring Interactive Response." In Euro-Par 2002 Parallel Processing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45706-2_122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kotani, Yuki, Fumihiko Ino, and Kenichi Hagihara. "A Resource Selection Method for Cycle Stealing in the GPU Grid." In Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11942634_79.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Antony, Robert J. "The Laboring Poor and Banditry." In Unruly People. Hong Kong University Press, 2016. http://dx.doi.org/10.5790/hongkong/9789888208951.003.0007.

Full text
Abstract:
While the archival records reveal little about the psychology of criminals and criminality, they do shed important light on the identities and personal backgrounds of bandits. In Chapter 7 the author examines the social composition of members of bandit gangs and sworn brotherhoods: age, marital status, geographic mobility, and occupations. Significantly, and contrary to the usual interpretation of banditry in the scholarly literature, the evidence from Guangdong demonstrates that banditry was not merely an occupation of younger men but also of older, more mature adults, many of whom were married with families. Most convicted bandits and brotherhood members came from China’s laboring poor, those individuals who were highly mobile, lived on the fringe of respectable society, and earned only a subsistence living. The fact that such a large number of bandits and brotherhood members were mature working family men suggests that they turned to crime in times of desperation or as a necessary supplement to honest work. Unemployment and chronic underemployment, the author maintains, forced many among the working poor to commit crime; stealing became an important, though normally only occasional, part of their livelihoods and life cycles.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cycle stealing"

1

Harchol-Balter, Mor, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, and Mark S. Squillante. "Cycle stealing under immediate dispatch task assignment." In the fifteenth annual ACM symposium. ACM Press, 2003. http://dx.doi.org/10.1145/777412.777462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Osogami, Takayuki, Mor Harchol-Balter, and Alan Scheller-Wolf. "Analysis of cycle stealing with switching cost." In the 2003 ACM SIGMETRICS international conference. ACM Press, 2003. http://dx.doi.org/10.1145/781027.781050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kyung Dong Ryu and J. K. Hollingsworth. "Fine-Grain Cycle Stealing for Networks of Workstations." In SC98 - High Performance Networking and Computing Conference. IEEE, 1998. http://dx.doi.org/10.1109/sc.1998.10011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ryu, Kyung Dong, Jeffrey K. Hollingsworth, and Peter J. Keleher. "Mechanisms and policies for supporting fine-grained cycle stealing." In the 13th international conference. ACM Press, 1999. http://dx.doi.org/10.1145/305138.305170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Jwo-An, Yung-Chou Tsai, Tay-Jyi Lin, and Yarsun Hsu. "Cycle Stealing and Channel Management for On-Chip Networks." In 2008 10th IEEE International Conference on High Performance Computing and Communications (HPCC). IEEE, 2008. http://dx.doi.org/10.1109/hpcc.2008.60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Widorek, Rafal, and Cezary Worek. "Sequential cycle stealing — A novel control method dedicated for resonant converters." In 2015 17th European Conference on Power Electronics and Applications (EPE'15 ECCE-Europe). IEEE, 2015. http://dx.doi.org/10.1109/epe.2015.7309358.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

"On Energy-efficient Checkpointing in High-throughput Cycle-stealing Distributed Systems." In 3rd International Conference on Smart Grids and Green IT Systems. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004958302620267.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ryu, Kyung D., Jeffrey K. Hollingsworth, and Peter J. Keleher. "Efficient network and I/O throttling for fine-grain cycle stealing." In the 2001 ACM/IEEE conference. ACM Press, 2001. http://dx.doi.org/10.1145/582034.582037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jeang, Yuan-Long, Tzuu-shaang Wey, Hung-Yu Wang, Chih-Chung Tai, and Ching-Hua Chu. "A Cycle-Stealing Technique for Pipelined Instruction Decompression System for Embedded Microprocessors." In Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007). IEEE, 2007. http://dx.doi.org/10.1109/icicic.2007.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Jeang, Yuan-Long, Tzuu-Shaang Wey, Hung-Yu Wang, and Ching-Hua Chu. "A New Cycle-Stealing Technique for Pipelined Instruction Decompression System for Microprocessors." In 2008 3rd International Conference on Innovative Computing Information and Control. IEEE, 2008. http://dx.doi.org/10.1109/icicic.2008.57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography