Next Issue
Volume 5, September
Previous Issue
Volume 5, March
 
 

Algorithms, Volume 5, Issue 2 (June 2012) – 7 articles , Pages 176-317

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
291 KiB  
Article
An Agent-Based Fuzzy Collaborative Intelligence Approach for Predicting the Price of a Dynamic Random Access Memory (DRAM) Product
by Toly Chen
Algorithms 2012, 5(2), 304-317; https://doi.org/10.3390/a5020304 - 24 May 2012
Cited by 1 | Viewed by 6272
Abstract
Predicting the price of a dynamic random access memory (DRAM) product is a critical task to the manufacturer. However, it is not easy to contend with the uncertainty of the price. In order to effectively predict the price of a DRAM product, an [...] Read more.
Predicting the price of a dynamic random access memory (DRAM) product is a critical task to the manufacturer. However, it is not easy to contend with the uncertainty of the price. In order to effectively predict the price of a DRAM product, an agent-based fuzzy collaborative intelligence approach is proposed in this study. In the agent-based fuzzy collaborative intelligence approach, each agent uses a fuzzy neural network to predict the DRAM price based on its view. The agent then communicates its view and forecasting results to other agents with the aid of an automatic collaboration mechanism. According to the experimental results, the overall performance was improved through the agents’ collaboration. Full article
Show Figures

Figure 1

324 KiB  
Article
Modeling and Performance Analysis to Predict the Behavior of a Divisible Load Application in a Cloud Computing Environment
by Leila Ismail and Liren Zhang
Algorithms 2012, 5(2), 289-303; https://doi.org/10.3390/a5020289 - 11 May 2012
Cited by 7 | Viewed by 4912
Abstract
Cloud computing is an emerging technology where IT resources are virtualized to users as a set of a unified computing resources on a pay per use basis. The resources are dynamically chosen to satisfy a user Service Level Agreement and a required level [...] Read more.
Cloud computing is an emerging technology where IT resources are virtualized to users as a set of a unified computing resources on a pay per use basis. The resources are dynamically chosen to satisfy a user Service Level Agreement and a required level of performance. Divisible load applications occur in many scientific and engineering applications and can easily be mapped to a Cloud using a master-worker pattern. However, those applications pose challenges to obtain the required performance. We model divisible load applications tasks processing on a set of cloud resources. We derive a novel model and formulas for computing the blocking probability in the system. The formulas are useful to analyze and predict the behavior of a divisible load application on a chosen set of resources to satisfy a Service Level Agreement before the implementation phase, thus saving time and platform energy. They are also useful as a dynamic feedback to a cloud scheduler for optimal scheduling. We evaluate the model in a set of illustrative scenarios. Full article
Show Figures

Figure 1

4034 KiB  
Article
Imaginary Cubes and Their Puzzles
by Hideki Tsuiki
Algorithms 2012, 5(2), 273-288; https://doi.org/10.3390/a5020273 - 9 May 2012
Cited by 2 | Viewed by 7928
Abstract
Imaginary cubes are three dimensional objects which have square silhouette projections in three orthogonal ways just as a cube has. In this paper, we study imaginary cubes and present assembly puzzles based on them. We show that there are 16 equivalence classes of [...] Read more.
Imaginary cubes are three dimensional objects which have square silhouette projections in three orthogonal ways just as a cube has. In this paper, we study imaginary cubes and present assembly puzzles based on them. We show that there are 16 equivalence classes of minimal convex imaginary cubes, among whose representatives are a hexagonal bipyramid imaginary cube and a triangular antiprism imaginary cube. Our main puzzle is to put three of the former and six of the latter pieces into a cube-box with an edge length of twice the size of the original cube. Solutions of this puzzle are based on remarkable properties of these two imaginary cubes, in particular, the possibility of tiling 3D Euclidean space. Full article
(This article belongs to the Special Issue Puzzle/Game Algorithms)
Show Figures

Figure 1

117 KiB  
Article
A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem
by Chuzo Iwamoto, Kento Sasaki and Kenichi Morita
Algorithms 2012, 5(2), 261-272; https://doi.org/10.3390/a5020261 - 13 Apr 2012
Cited by 3 | Viewed by 7123
Abstract
A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A string puzzle consists of strings entangled with one or more wooden pieces. We consider the generalized string puzzle problem whose [...] Read more.
A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A string puzzle consists of strings entangled with one or more wooden pieces. We consider the generalized string puzzle problem whose input is the layout of strings and a wooden board with holes embedded in the 3-dimensional Euclidean space. We present a polynomial-time transformation from an arbitrary instance ƒ of the 3SAT problem to a string puzzle s such that ƒ is satisfiable if and only if s is solvable. Therefore, the generalized string puzzle problem is NP-hard. Full article
(This article belongs to the Special Issue Puzzle/Game Algorithms)
Show Figures

Figure 1

555 KiB  
Article
Content Sharing Graphs for Deduplication-Enabled Storage Systems
by Maohua Lu, Cornel Constantinescu and Prasenjit Sarkar
Algorithms 2012, 5(2), 236-260; https://doi.org/10.3390/a5020236 - 10 Apr 2012
Cited by 5 | Viewed by 5808
Abstract
Deduplication in storage systems has gained momentum recently for its capability in reducing data footprint. However, deduplication introduces challenges to storage management as storage objects (e.g., files) are no longer independent from each other due to content sharing between these storage objects. In [...] Read more.
Deduplication in storage systems has gained momentum recently for its capability in reducing data footprint. However, deduplication introduces challenges to storage management as storage objects (e.g., files) are no longer independent from each other due to content sharing between these storage objects. In this paper, we present a graph-based framework to address the challenges of storage management due to deduplication. Specifically, we model content sharing among storage objects by content sharing graphs (CSG), and apply graph-based algorithms to two real-world storage management use cases for deduplication-enabled storage systems. First, a quasi-linear algorithm was developed to partition deduplication domains with a minimal amount of deduplication loss (i.e., data replicated across partitioned domains) in commercial deduplication-enabled storage systems, whereas in general the partitioning problem is NP-complete. For a real-world trace of 3 TB data with 978 GB of removable duplicates, the proposed algorithm can partition the data into 15 balanced partitions with only 54 GB of deduplication loss, that is, a 5% deduplication loss. Second, a quick and accurate method to query the deduplicated size for a subset of objects in deduplicated storage systems was developed. For the same trace of 3 TB data, the optimized graph-based algorithm can complete the query in 2.6 s, which is less than 1% of that of the traditional algorithm based on the deduplication metadata. Full article
(This article belongs to the Special Issue Data Compression, Communication and Processing)
Show Figures

Figure 1

347 KiB  
Article
An Online Algorithm for Lightweight Grammar-Based Compression
by Shirou Maruyama, Hiroshi Sakamoto and Masayuki Takeda
Algorithms 2012, 5(2), 214-235; https://doi.org/10.3390/a5020214 - 10 Apr 2012
Cited by 24 | Viewed by 6848
Abstract
Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deriving a given text uniquely. In this work, we propose an online algorithm for grammar-based compression. Our algorithm guarantees O(log2 n)- approximation ratio for the minimum grammar size, where [...] Read more.
Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deriving a given text uniquely. In this work, we propose an online algorithm for grammar-based compression. Our algorithm guarantees O(log2 n)- approximation ratio for the minimum grammar size, where n is an input size, and it runs in input linear time and output linear space. In addition, we propose a practical encoding, which transforms a restricted CFG into a more compact representation. Experimental results by comparison with standard compressors demonstrate that our algorithm is especially effective for highly repetitive text. Full article
(This article belongs to the Special Issue Data Compression, Communication and Processing)
Show Figures

Figure 1

298 KiB  
Article
Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs
by Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara, Koji Tsuruma, Hiroaki Iwashita and Shin-ichi Minato
Algorithms 2012, 5(2), 176-213; https://doi.org/10.3390/a5020176 - 5 Apr 2012
Cited by 23 | Viewed by 12399
Abstract
Link puzzles involve finding paths or a cycle in a grid that satisfy given local and global properties. This paper proposes algorithms that enumerate solutions and instances of two link puzzles, Slitherlink and Numberlink, by zero-suppressed binary decision diagrams (ZDDs). A ZDD is [...] Read more.
Link puzzles involve finding paths or a cycle in a grid that satisfy given local and global properties. This paper proposes algorithms that enumerate solutions and instances of two link puzzles, Slitherlink and Numberlink, by zero-suppressed binary decision diagrams (ZDDs). A ZDD is a compact data structure for a family of sets provided with a rich family of set operations, by which, for example, one can easily extract a subfamily satisfying a desired property. Thanks to the nature of ZDDs, our algorithms offer a tool to assist users to design instances of those link puzzles. Full article
(This article belongs to the Special Issue Puzzle/Game Algorithms)
Show Figures

Figure 1

Previous Issue
Next Issue
Back to TopTop