ppxscal/embedding_network huggingface dataset:
Multipurpose Parallelism for VLSI Cad on the RP3
Authors: Frederica Darema, Gregory Pfister
Venue: IEEE Design Test (1987)

VLSI CAD application developers need the performance of parallel processing in as general a form as possible. The RP3, whichis being developed at IBM's Research Division, provides such generality. Several CAD applications are among the more than30 applications that have been written in the Epex parallel environment for porting to RP3 when the hardware is complete.Placement by simulated annealing is used here as a significant, deliberately difficult example: its theoretical basis requiresserial execution. In the parallel technique used, deviation from the serial algorithm and temporary errors are allowed formore efficient exploitation of parallelism. The result is a convergence rate as good as the original algorithm, with the possibilityof efficient execution on hundreds of processors.
Using Chemical Cellular Automata in Simulation of Chemical Materials
Authors: Farshad Kyoomarsi, Javad Akbari Torkestani, Pooya Khosravyan Dehkordy, Mohammad Hosseyn Peyravi
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In this paper, we use chemical cellular automata as a new tool to simulation as well as produce of chemical materials such as polymers and analyzing their stability. For this purpose, first we examine the cellular automata and the relevant chemical elements characteristics and then we consider each element as a cell of the cellular automata and finally for designing its cellular automata, we will draw the table of laws related to each experiment and then implement an example to gain a better understanding of the subject.
Significance-Preserving Codebook Using Generic Algorithm
Authors: Chin-Chen Chang, Pei-Yu Lin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Vector quantization (VQ) is an effective mechanism for image data compression. Each image block is replaced with a quantized index to compress the original information; individuals can quickly restore the condensed data to the host ones using this index table. The main merits of VQ lie in fixed compression ratio and fast decompression. The codebook generation is the principal component in a VQ mechanism. A codebook must consist of a set of representative codewords. Hence, how to construct a significant codebook is the primary challenge in designing a VQ mechanism. We propose a novel codebook generation method by adopting the Generic algorithm (GA) to solve optimization problems. Each codeword is considered as a gene, while the codebook is regarded as an individual in the new mechanism. Furthermore, we improve the convergence speed of GA while training a codebook. According to experimental results, the new scheme can provide high- quality codebooks for vector quantization, compared to the well-known LBG algorithm and Ying et al.'s method.
An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines
Authors: D. D. Gajski
Venue: IEEE Transactions on Computers (1981)

A new algorithm for the solution of linear recurrence systems on parallel or pipelined computers is described. Time bounds, speed-up and efficiency for SIMD and MIMD computers with fixed number of arithmetic elements (AE's), as well as for pipelined computers with fixed number of stages per operation, are obtained. The model of each computer is discussed in detail to explain better performance of the pipelined model. A simple modification in the design of AE's for parallel computers makes parallel model superior.
Moving parabolic approximation of point clouds
Authors: Zhouwang Yang, Tae-wan Kim
Venue: Computer-Aided Design (2007)

Using moving parabolic approximations (MPA), we reconstruct an improved point-based model of curve or surface represented as an unorganized point cloud, while also estimating the differential properties of the underlying smooth manifold. We present optimization algorithms to solve these MPA models, and examples which show that our reconstructions of the curve or surface, and estimates of the normals and curvature information, are accurate for precise point clouds and robust in the presence of noise.
An Examination of information technology related users groups
Authors: Russell McMahon
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Information Technology (IT) related users groups are an important way for IT professionals to continue their education, network with other like-minded peers, and to get involved in their IT community. These groups provide a tremendous resource for the community at large in terms of job growth and recruitment of new and young IT professionals. They also serve as a barometer to how the industry is doing and as to what subjects should be covered in the curriculum. This is a resource that has been largely untapped by the educational institutions in the Greater Cincinnati Area. This paper examines the various IT-related organizations at the local level and the value they provide. However, there is no reason as to why this would not apply to any metropolitan area.
Optimization of interactive visual-similarity-based search
Authors: Giang Phuong Nguyen, Marcel Worring
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

At one end of the spectrum, research in interactive content-based retrieval concentrates on machine learning methods for effective use of relevance feedback. On the other end, the information visualization community focuses on effective methods for conveying information to the user. What is lacking is research considering the information visualization and interactive retrieval as truly integrated parts of one content-based search system. In such an integrated system, there are many degrees of freedom like the similarity function, the number of images to display, the image size, different visualization modes, and possible feedback modes. To base the optimal values for all of those on user studies is unfeasible. We therefore develop search scenarios in which tasks and user actions are simulated. From there, the proposed scheme is optimized based on objective constraints and evaluation criteria. In such a manner, the degrees of freedom are reduced and the remaining degrees can be evaluated in user studies. In this article, we present a system that integrates advanced similarity based visualization with active learning. We have performed extensive experimentation on interactive category search with different image collections. The results using the proposed simulation scheme show that indeed the use of advanced visualization and active learning pays off in all of these datasets.
A Data Base For Computer Performance Evaluation
Authors: R. O. Winder
Venue: Computer (1973)

We describe in this paper an RCA Labs team project begun in 1968, with the general goal to predict the performance of new system architectures being considered within RCA for future computers. The cache-system or slave memory idea was the principal subject. However, many other problems have been studied, and the data base that was collected has been found useful in analysis as well as prediction of performance, and in obtaining fundamental data for modelling purposes.
Edge Detection of Images based on Fuzzy Cellular Automata
Authors: Ke Zhang, Zhong Li, Xiao-Ou Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

A new improved edge detection algorithm of images based on cellular automata is presented. This method uses direction information measure and edge order measure as edge characteristic information, uses fuzzy logic to inference these information, processes inference results by anti-fuzzy, gives feedback information to direction information measure matrix, and detects edge by automatic evolution of cellular automata. Finally, experiments are put forward, this algorithm has powerful ability in detection fuzzy edge and exiguous edge, and it is a promising and applied image processing algorithm.
Executing stream joins on the cell processor
Authors: Buǧra Gedik, Philip S. Yu, Rajesh R. Bordawekar
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capacity are ideal matches for executing costly DSMS operators. The recently developed Cell processor is a good example of a heterogeneous multi-core architecture and provides a powerful platform for executing data stream operators with high-performance. On the down side, exploiting the full potential of a multi-core processor like Cell is often challenging, mainly due to the heterogeneous nature of the processing elements, the software managed local memory at the co-processor side, and the unconventional programming model in general. In this paper, we study the problem of scalable execution of windowed stream join operators on multi-core processors, and specifically on the Cell processor. By examining various aspects of join execution flow, we determine the right set of techniques to apply in order to minimize the sequential segments and maximize parallelism. Concretely, we show that basic windows coupled with low-overhead pointer-shifting techniques can be used to achieve efficient join window partitioning, column-oriented join window organization can be used to minimize scattered data transfers, delay-optimized double buffering can be used for effective pipelining, rate-aware batching can be used to balance join throughput and tuple delay, and finally SIMD (single-instruction multiple-data) optimized operator code can be used to exploit data parallelism. Our experimental results show that, following the design guidelines and implementation techniques outlined in this paper, windowed stream joins can achieve high scalability (linear in the number of co-processors) by making efficient use of the extensive hardware parallelism provided by the Cell processor (reaching data processing rates of &ap; 13 GB/sec) and significantly surpass the performance obtained form conventional high-end processors (supporting a combined input stream rate of 2000 tuples/sec using 15 minutes windows and without dropping any tuples, resulting in &ap; 8.3 times higher output rate compared to an SSE implementation on dual 3.2Ghz Intel Xeon).
A Hierarchy of Geometric Forms
Authors: Rida Farouki, John Hinds
Venue: IEEE Computer Graphics and Applications (1985)

This survey of the philosophy underlying the unified parametric polynomial formalism for geometric modling suggests some novel applications and assesses the problems and advantages of the approach.
Multi-modal tracking using texture changes
Authors: Christopher Kemp, Tom Drummond
Venue: Image and Vision Computing (2008)

We present a method for efficiently generating a representation of a multi-modal posterior probability distribution. The technique combines ideas from RANSAC and particle filtering such that the 3D visual tracking problem can be partitioned into two levels, while maintaining multiple hypotheses throughout. A simple texture change-point detector finds multiple hypotheses for the position of image edgels. From these, multiple locations for each scene edge are generated. Finally, we determine the best pose of the whole structure. While the multi-modal representation is strongly related to particle filtering techniques, this approach is driven by data from the image. Hence the resulting system is able to perform robust visual tracking of all six degrees of freedom in real time. Real video sequences are used to compare the complete tracking system to previous systems.
On the Distribution of Sums of Successive Bits of Shift-Register Sequences
Authors: H. F. Jordan
Venue: IEEE Transactions on Computers (1973)

A formula is found for the distribution of the number of ones in a subsequence of a maximal-length shift-register sequence. The formula relates the distribution to the binomial distribution with probability 1/2 with a difference that depends on the structure of the set of linear recurrences satisfied by the sequence. Considerations are discussed that aid in the choice of a shift register to be used in generating an approximately binomially distributed random variable.
A Recommendation Algorithm Combining User Grade-Based Collaborative Filtering and Probabilistic Relational Models
Authors: Ying Gao, Hong Qi, Jie Liu, Dayou Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Collaborative filtering (CF) is a successful technology for building recommender systems. Unfortunately, it suffers from three limitations -- sparsity, scalability and cold start problem. To address these problems, a recommendation algorithm combining user grade-based collaborative filtering and Probabilistic Relational Models (UGCF-PRM) is presented. UGCF-PRM integrates user information, item information and user-item rating data, and uses an adaptive recommendation strategy for each user. In UGCF-PRM a user grade function is defined and a collaborative filtering based on this function is used, which can find neighbors for the target user efficiently. Because of the first-order character of Probabilistic Relational Models, UGCF-PRM can solve the cold start problem. The experiment results on the MovieLens data set show that UGCF-PRM performs better than a pure CF approach in both recommendation quality and recommendation efficiency.
Genetic algorithms for determining fuzzy measures from data
Authors: Wei Wang, Zhenyuan Wang, George J. Klir
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

A synthetic evaluation of a given object in terms of multiple factors that contribute to some feature of the object (quality, performance, etc.) may be regarded as a system with multiple inputs and one output. Traditionally, the output is expressed as the weighted average of the inputs. Unfortunately, this method is severely limited as it cannot capture any inherent relation among the factors involved. This limitation can be overcome by using the Choquet integral or the fuzzy integral with respect to a fuzzy measure that captures the relation among the factors. The crux of this method is to determine the right fuzzy measure. In this paper, we describe an efficient genetic algorithm for constructing a suitable fuzzy measure from relevant input-output data. This algorithm has a broad applicability in various problem areas, such as decision making, cluster analysis, pattern recognition, image and speech processing, and expert systems.
DOIDFH: an Effective Distributed Metadata Management Scheme
Authors: Dan Feng, Juan Wang, Fang Wang, Peng Xia
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Subtree partitioning and hashing are two common techniques used for current distributed metadata management schemes. Subtree partitioning schemes do not evenly distribute workload among metadata server cluster, and a number of metadata need to be migrated to achieve coarse load balancing. Though current hashing schemes evenly distribute workload among metadata server cluster, they eliminate the storage locality of files metadata in the same directory. They also can not effectively deal with some operations such as renaming a directory or accessing a file in the path of a linked directory. A new approach called parent Directory Object IDentifier and Filename Hashing (DOIDFH) metadata management is proposed, which could distribute evenly files metadata among metadata server cluster, as well as partially hold hierarchical locality. It solves effectively the existent problems of current hashing schemes and also takes advantages of them.
Research on Usage Control Model with Delegation Characteristics Based on OM-AM Methodology
Authors: Zhiyong Zhang, Lin Yang, Qingqi Pei, Jianfeng Ma
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

UCONABC is a basic framework of next generation access control policy Usage Control that is composed of Authorization-oBlige-Condition components, but so far it lacks of important delegation characteristic. The paper analyses the behaviors of delegation in UCON based on OM-AM engineering principles, presents a formalized usage control model with delegation features using BNF Extensions, called as UCOND, and further articulates its hybrid architecture based on Client & Server Delegation Reference Monitors and relative key protocol functions. UCOND is an extension model of UCONABC in the aspect of delegation authorization, and it resolves the delegation question of Usage Control Model. Moreover, we specify delegation procedure of an application for Digital Medium Resource Distribution System.
Data Management I
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

For adaptive distributed applications, the computational complexity associated with each computational region varies continuously and dramatically both in space and time throughout the life cycle of the application execution. Consequently, static scheduling techniques are inefficient for such applications. In this paper, we present an autonomic runtime manager (ARM) that uses the application spatial and temporal characteristics as well as resource status as the main criteria to self optimize the execution of distributed applications at runtime. We applied the ARM system to a wildfire simulation and our experimental results show that the performance of the wildfire simulation has been improved by 45% when compared with a static partitioning algorithm. We also evaluate the performance of ARM using two partitioning strategies: natural regions (NR) approach and a graph partitioning approach. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Variation-aware adaptive voltage scaling system
Authors: Mohamed Elgebaly, Manoj Sachdev
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Conventional voltage scaling Systems require a delay margin to maintain a certain level of robustness across all possible device and wire process variations and temperature fluctuations. This margin is required to cover for a possible change in the critical path due to such variations. Moreover, a slower interconnect delay scaling with voltage compared to logic delay can cause the critical path to change from one operating voltage to another. With technology scaling, both process variation and interconnect delay are growing and demanding more margin to guarantee an error-free operation. Such margin is translated into a voltage overhead and a corresponding energy inefficiency. In this paper, a critical path emulator architecture is shown to track the changing critical path at different process splits by probing the actual transistor and wire conditions. Furthermore, voltage scaling characteristics of the actual critical path is closely tracked by programming logic and interconnect delay lines to achieve the same delay combination as the actual critical path. Compared to conventional open-loop and closed-loop systems, the proposed system is up to 39% and 24% more energy efficient, respectively. A 0.18-µm technology test chip is designed to verify the functionality of the proposed system showing critical path tracking of a 16 × 16 bit multiplier.
A new model for video traffic originating from multiplexed MPEG-4 videoconference streams
Authors: Aggelos Lazaris, Polychronis Koutsakis, Michael Paterakis
Venue: Performance Evaluation (2008)

Due to the burstiness of video traffic, video modeling is very important in order to evaluate the performance of future wired and wireless networks. In this paper, we first study the behavior of single MPEG-4 videoconference traces and investigate the possibility of modeling this type of traffic with well-known distributions. Our results show that the Pearson type V distribution is the best fit among all the examined distributions, for all the traces under study. However, the behavior of single videoconference traces can never be perfectly ''captured'' by a distribution generating independently frame sizes according to a declared mean and standard deviation, due to the high autocorrelation of videoconference; therefore none of the fitting attempts can achieve high accuracy. Still, our results on attempting to model single MPEG-4 videoconference sources provide significant insight and help to build a Discrete Autoregressive (DAR(1)) model to ''capture'' the behavior of multiplexed MPEG-4 videoconference movies from VBR coders. Based on our results and on comparisons with other existing approaches, we discuss the contribution of our proposed method to the field.
Benefit-based Data Caching in Ad Hoc Networks
Authors: Bin Tang, Himanshu Gupta, Samir Das
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the accesslatency and bandwidth usage. However, designing efficient distributed caching algorithms is non-trivial when network nodeshave limited memory. In this article, we consider the cache placement problem of minimizing total data access cost in ad hocnetworks with multiple data items and nodes with limited memory capacity. The above optimization problem is known to be NP-hard.Defining benefit as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm thatprovably delivers a solution whose benefit is at least one-fourth (one-half for uniform-size data items) of the optimal benefit.The approximation algorithm is amenable to localized distributed implementation, which is shown via simulations to performclose to the approximation algorithm. Our distributed algorithm naturally extends to networks with mobile nodes. We simulateour distributed algorithm using a network simulator (ns2), and demonstrate that it significantly outperforms another existingcaching technique (by Yin and Cao [30]) in all important performance metrics. The performance differential is particularlylarge in more challenging scenarios, such as higher access frequency and smaller memory.
Qualitative evaluation of health information exchange efforts
Authors: Joan S. Ash, Kenneth P. Guappone
Venue: Journal of Biomedical Informatics (2007)

Because most health information exchange (HIE) initiatives are as yet immature, formative evaluation is recommended so that what is learned through evaluation can be immediately applied to assist in HIE development efforts. Qualitative methods can be especially useful for formative evaluation because they can guide ongoing HIE growth while taking context into consideration. This paper describes important HIE-related research questions and outlines appropriate qualitative research techniques for addressing them.