ppxscal/embedding_network huggingface dataset:
A Survey of Multi-Projector Tiled Display Wall Construction
Authors: Chao Li, Hai Lin, Jiaoying Shi
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Recently, the graphics processing capabilities of graphics systems have improved a lot, and more and more information must be presented to the users. While the display resolution of monitors is still what it is 20 years ago, and becomes the bottleneck of visualization. This leads to recent interest in the research for high-resolution displays. One great solution is to use multiple projectors tiled together to form a large logical display wall and provide high display resolutions and large physical display sizes. This paper presents a survey of the construction process of these kinds of multi-projector tiled display wall systems. The hardware construction problem is first explored. And then we describe the two most important problems of multi-projector tiled display wall systems, i.e. geometric calibration and photometric calibration of projectors. Various algorithms are addressed and compared. Lastly, a introduction of the high resolution image generation via distributed rendering is presented.
An Efficient Design and Implementation for Grid Advanced Information Service
Authors: Minyeol Lim, Eui-Nam Huh
Venue: The Journal of Supercomputing (2005)

Grid information service is an indispensable component for Grid computing, by which all types of Grid resources are virtually integrated and their information can be efficiently managed and accessed. Furthermore, the efficiency of Grid computing is dependent on the functionalities supported by Grid information service. At present, the Grid information service of Globus toolkitTM 3, an Index service, supports a few basic functions such as service data population, subscription, and lookup.In this paper, we propose an information service component of MoredreamTM which we refer to as GAIS (Grid Advanced Information Service), for providing more plentiful resource information and advanced functionalities in order to satisfy the requirements for various applications in the K*Grid computing environment characterized by both high performance and high throughput computing. In particular, GAIS includes interfaces and functionalities for dynamic VO management, peer-to-peer communication, and service categorization. In addition, our resource-monitoring tool reduces the monitoring overhead and maintains accuracy of events by detecting effective resource changes and collecting events at the kernel level, respectively. Consequently, we anticipate that our Grid information service will be broadly utilized through improved service qualities.
Buffer performance modeling in the context of unclustered index accesses with non-uniform access pattern
Authors: Kjetil Nørvåg
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

Cost models are powerful tools for analyzing algorithms, and important in cost-based query optimization. With increasing amounts of main memory available, it is important to include buffer performance in the models. In this paper, we describe and validate (1) buffer models for fine-granularity caching in buffers with locking, and (2) a buffer model for nodes in multiway-tree indexes in the context of unclustered accesses and non-uniform access patterns. The validations show a high accuracy of the models. In future self-tuning database systems, the importance of such models will be even higher than today, and the models presented in this paper should be ideally suited for use in these applications.
Optimising Noisy Objective Functions
Authors: David W. Bulger, H. Edwin Romeijn
Venue: Journal of Global Optimization (2005)

This discussion paper considers the use of stochastic algorithms for solving global optimisation problems in which function evaluations are subject to random noise. An idea is outlined for discussion at the forthcoming Stochastic Global Optimisation 2001 workshop in Hanmer in June; we propose that a noisy version of pure random search be studied.
Crosscutting techniques in program specification and analysis
Authors: Patrick Lam, Viktor Kuncak, Martin Rinard
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

We present three aspect-oriented constructs (formats, scopes, and defaults) that, in combination with a specification language based on abstract sets of objects, enable the modular application of multiple arbitrarily precise (and therefore arbitrarily unscalable) analyses to scalably verify data structure consistency properties in sizable programs. Formats use a form of field introduction to group together the declarations of all of the fields that together comprise a given data structure. Scopes and defaults enable the developer to state certain data structure consistency properties once in a single specification construct that cuts across the preconditions and postconditions of the procedures in the system. Standard approaches, in contrast, scatter and duplicate such properties across the preconditions and postconditions. We have implemented a prototype implementation, specification, analysis, and verification system based on these constructs and used this system to successfully verify a range of data structure consistency properties in several programs.Most previous research in the field of aspect-oriented programming has focused on the use of aspect-oriented concepts in design and implementation. Our experience indicates that aspect-oriented concepts can also be extremely useful for specification, analysis, and verification.
UXnet: making connections
Authors: Whitney Quesenbery, Richard Anderson, Beth Mazur
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This position paper for the CHI2005 Development Consortium describes the vision that led to the formation of the User Experience Network (UXnet) and cross-disciplinary needs it addresses, for individual practitioners and for the ongoing development of the field as a whole.
Software Project Management and Quality Engineering Practices for Complex, Coupled Multiphysics, Massively Parallel Computational Simulations: Lessons Learned From ASCI
Authors: D. E. Post, R. P. Kendall
Venue: International Journal of High Performance Computing Applications (2004)

Many institutions are now developing large-scale, complex, coupled multiphysics computational simulations for massively parallel platforms for the simulation of the performance of nuclear weapons and certification of the stockpile, and for research in climate and weather prediction, magnetic and inertial fusion energy, environmental systems, astrophysics, aerodynamic design, combustion, biological and biochemical systems, and other areas. The successful development of these simulations is aided by attention to sound software project management and software engineering. We have developed "lessons learned" from a set of code projects that the Department of Energy National Nuclear Security Agency has sponsored to develop nuclear weapons simulations over the last 50 years. We find that some, but not all, of the software project management and development practices (rather than processes) commonly employed for non-technical software add value to the development of scientific software and we identify those that we judge add value. Another key finding, consistent with general software industry experience, is that the optimal project schedule and resource level are solely determined by the requirements once the requirements are fixed.
Hybrid Necessary Principle
Authors: Mauro Garavello, Benedetto Piccoli
Venue: SIAM Journal on Control and Optimization (2005)

We consider a hybrid control system and general optimal control problems for this system. We suppose that the switching strategy imposes restrictions on control sets and we provide necessary conditions for an optimal hybrid trajectory, stating a hybrid necessary principle (HNP). Our result generalizes various necessary principles available in the literature.
Developing the Requirements Discipline: Software vs. Systems
Authors: Regina Gonzales
Venue: IEEE Software (2005)

Despite their cultural differences, software engineering and systems engineering communities can learn from each other. For the requirements engineering discipline to continue to develop, the two communities must engage in dialogue with each other and find influences in other disciplines.
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Authors: T. Ravindra Babu, M. Narasimha Murty, V. K. Agrawal
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base learning algorithm to find corresponding weak hypothesis by adapting to the error rates of the individual weak hypotheses. A large, complex handwritten data is under study. A repeated use of weak learner on the huge data results in large amount of processing time. In view of this, instead of using the entire training data for learning, we propose to use only prototypes. Further, in the current work, the base learner consists of a nearest neighbour classifier that employs prototypes generated using "leader" clustering algorithm. The leader algorithm is a single pass algorithm and is linear in terms of time as well as computation complexity. The prototype set alone is used as training data. In the process of developing an algorithm, domain knowledge of the Handwritten data, which is under study, is made use of. With the fusion of clustering, prototype selection, AdaBoost and Nearest Neighbour classifier, a very high classification accuracy, which is better than reported earlier on the considered data, is obtained in less number of iterations. The procedure integrates clustering outcome in terms of prototypes with boosting.
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
Authors: Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

A distribution X over binary strings of length n has min-entropy k if every string has probability at most 2-k in X. We say that X is a δ-source if its rate k⁄n is at least δ.We give the following new explicit instructions (namely, poly(n)- time computable functions) of deterministicextractors, dispersers and related objects. All work for any fixed rate δ>0. No previous explicit construction was known for either of these, for any δ‹1⁄2. The first two constitute major progress to very long-standing open problems. Bipartite Ramsey f1: (0,1)n)2 →0,1, such that for any two independent δ-sources X1, X2 we have f1(X1,X2) = 0,1 This implies a new explicit construction of 2N-vertex bipartite graphs where no induced Nδ by Nδ subgraph is complete or empty. Multiple source extraction f2: (0,1n)3→0,1 such that for any three independent δ-sources X1,X2,X3 we have that f2(X1,X2,X3) is (o(1)-close to being) an unbiased random bit. Constant seed condenser2 f3: n →(0,1m)c, such that for any δ-source X, one of the c output distributions f3(X)i, is a 0.9-source over 0,1m. Here c is a constant depending only on δ.Subspace Ramsey f4: 0,1n→0,1 such that for any affine-δ-source3 X we have f4(X)= 0,1.The constructions are quite involved and use as building blocks other new and known gadgets. But we can point out two important themes which recur in these constructions. One is that gadgets which were designed to work with independent inputs, sometimes perform well enough with correlated, high entropy inputs. The second is using the input to (introspectively) find high entropy regions within itself.
Reconcile art and culture on the web
Authors: Francis Rousseaux, Alain Bonardi
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In this paper, we show how the practice of buying CDs surreptitiously conditions our musical activities, and how the practice of classifying a priori, making changes one at a time, structured by buying and the notion of genre, will disappear, as develops an ad-hoc organization of auditory samples, centered on prototypes and similarity. This movement is a proof of the loss of importance of the instantiation of CD marketing categories. Thus appears similarity-based calculus, acting on considerable masses of samples, which continuously change the balance of the man-machine dialogue, in an appeal started again and again to compare information. We also show how some artistic creations which rely heavily on computers, especially in the domain of inter-media theater, proceed in the same way, masking instantiation and developing the calculation of the similarity of the comedian's expressive faces. Art and culture are linked in processes that take advantage of their massive digitalization.
Combining Neural Network and Genetic Algorithm for Prediction of Lung Sounds
Authors: İnan Güler, Hüseyin Polat, Uçman Ergün
Venue: Journal of Medical Systems (2005)

Recognition of lung sounds is an important goal in pulmonary medicine. In this work, we present a study for neural networks--genetic algorithm approach intended to aid in lung sound classification. Lung sound was captured from the chest wall of The subjects with different pulmonary diseases and also from the healthy subjects. Sound intervals with duration of 15--20 s were sampled from subjects. From each interval, full breath cycles were selected. Of each selected breath cycle, a 256-point Fourier Power Spectrum Density (PSD) was calculated. Total of 129 data values calculated by the spectral analysis are selected by genetic algorithm and applied to neural network. Multilayer perceptron (MLP) neural network employing backpropagation training algorithm was used to predict the presence or absence of adventitious sounds (wheeze and crackle). We used genetic algorithms to search for optimal structure and training parameters of neural network for a better predicting of lung sounds. This application resulted in designing of optimum network structure and, hence reducing the processing load and time.
Failure Resilient Heterogeneous Parallel Computing Across Multidomain Clusters
Authors: Dawid Kurzyniec, Vaidy Sunderam
Venue: International Journal of High Performance Computing Applications (2005)

We propose lightweight middleware solutions that facilitate and simplify the execution of failure-resilient Message Passing Interface (MPI) programs across multidomain clusters. The system described in this paper leverages H2O, a distributed metacomputing framework, to route MPI message passing across heterogeneous aggregates located in different administrative or network domains. MPI communication is aided by a specially written H2O pluglet; messages that are destined for remote sites are intercepted and transparently forwarded to their final destinations. We demonstrate that the proposed technique is indeed effective in enabling communication by MPI programs across distinct clusters and across firewalls. Only marginally lowered performance was observed in our tests, and we believe the substantially increased functionality would compensate for this overhead in most situations. In addition to enabling multicluster communications, we note that with the increasing size and distribution of metacomputing environments, fault tolerance aspects become critically important. We argue that the fault tolerance model proposed by FT-MPI fits well in geographically distributed environments, even though its current implementation is confined to a single administrative domain. We describe extensions to overcome these limitations by combining FT-MPI with the H2O framework. Our holistic approach allows users to run fault-tolerant MPI programs on heterogeneous, geographically distributed shared machines, without sacrificing performance and with minimal involvement of resource providers.
Practical Information-flow Control in Web-Based Information Systems
Authors: Peng Li, Steve Zdancewic
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

This paper presents a practical application of language-based information-flow control, namely, a domain-specific web scripting language designed for interfacing with databases. The primary goal is to provide strong enforcement of confidentiality and integrity policies: confidential data can be released only in permitted ways and trustworthy data must result from expected computations or conform to expected patterns. Such security policies are specified in the database layer and statically enforced for the rest of the system in an end-to-end fashion. In contrast with existing web-scripting languages, which provide only ad hoc mechanisms for information security, the scripting language described here uses principles based on the well-studied techniques in information-flow type systems. However, because web scripts often need to down-grade confidential data and manipulated untrusted user input, they require practical and convenient ways of down-grading secure data. To achieve this goal, the language allows safe downgrading according to downgrading policies specified by the programmer. This novel, pattern-based approach provides a practical instance of recent work on delimited release and relaxed noninterference and extends that work by accounting for integrity policies.
Traffic-based Load Balance for Scalable Network Emulation
Authors: Xin Liu, Andrew A. Chien
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed applications and middleware. Achieving load balance in emulation is difficult because of irregular network structure and unpredictable network traffic. We formulate load balance as a graph partitioning problem and apply classical graph partitioning algorithms to it. The primary challenge in this approach is how to extract useful information from the network emulation and present it to the graph partitioning algorithms in a way that reflects the load balance requirement in the original emulation problem. Using a large-scale network emulation system called MaSSF, we explore three approaches for partitioning, based on purely static topology information (TOP), combining topology and application placement information (PLACE), and combining topology and application profile data (PROFILE). These studies show that exploiting static topology and application placement information can achieve reasonable load balance, but a profile-based approach further improves load balance for even large scale network emulation. In our experiments, PROFILE improves load balance by 50% to 66% and emulation time is reduced up to 50% compared to purely static topology-based approaches.
Postgres-R(SI): Combining Replica Control with Concurrency Control Based on Snapshot Isolation
Authors: Shuqing Wu, Bettina Kemme
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Replicating data over a cluster of workstations is a powerful tool to increase performance, and provide fault-tolerance for demanding database applications. The big challenge in such systems is to combine replica control (keeping the copies consistent) with concurrency control. Most of the research so far has focused on providing the traditional correctness criteria serializability. However, more and more database systems, e.g., Oracle and PostgreSQL, use multi-version concurrency control providing the isolation level snapshot isolation. In this paper, we present Postgres-R(SI), an extension of PostgreSQL offering transparent replication. Our replication tool is designed to work smoothly with PostgreSQLýs concurrency control providing snapshot isolation for the entire replicated system. We present a detailed description of the replica control algorithm, and how it is combined with PostgreSQLýs concurrency control component. Furthermore, we discuss some challenges we encountered when implementing the protocol. Our performance analysis based on the TPC-W benchmark shows that this approach exhibits excellent performance for real-life applications even if they are update intensive.
iPhoto 5 for Mac OS X: Visual QuickStart Guide (Visual Quickstart Guides)
Authors: Adam Engst
Venue:  (2005)

Owning a digital camera makes it easy to snap tons of photos. But once you import them from your camera to your computer, it's organizing, editing, and printing those digital photos that can cause you headaches. What to do with the piles of digital photos you're suddenly amassing? Enter iPhoto 5. Included on all new Macs, iPhoto 5 is a significant update to Apple's photo-editing component of its revolutionary iLife '05 suite.Aside from organizing, sharing, and editing digital photos, iPhoto lets you create stunning slideshows, assemble photo albums, and burn your images to DVD, to name a few features. Written by longtime Macintosh authority and best-selling author Adam Engst, this smart, thoughtful guide ensures you make the most of it. Using simple, step-by-step instructions accompanied by copious screenshots, this book tackles all that's old and new in iPhoto 5. With the help of Adam's sharp advice and insightful instruction, you'll learn the ins and outs of using iPhoto both separately and in tandem with the other iLife apps--adding GarageBand-created tracks to your slideshows, using iPhoto slide shows in iDVD and iMovie projects, and more. Best of all, you'll discover all of iPhoto's newest (and coolest) features: creating softcover photo books in multiple sizes, using iPhoto's advanced editing tools to sharpen and clean up your photos, searching for images with iPhoto's spiffy new search tools, importing photos shot in RAW format, creating cinematic slideshows, and much more. With this book, you'll soon be shooting, organizing, and sharing your digital photos with ease.
Structure generation and performance comparison of elliptic Gm-C filters: Research Articles
Authors: Slawomir Koziel, Stanislaw Szczepanski, Rolf Schaumann
Venue: International Journal of Circuit Theory and Applications (2004)

Starting from a set of matrices describing a general Gm-C filter topology, a procedure is developed for generating structures of lowpass filters. As the matrices and the filter topologies have a one-to-one correspondence, an algebraic method is used to identify filter topologies with desired properties, here, transfer functions with finite j&omega;-axis transmission zeros, specifically elliptic filters. Sensitivity expressions for these structures are derived and a performance comparison based on a set of chosen criteria is made. For a specified elliptic transfer function, filters with only grounded capacitors and those containing also floating capacitors emerge as alternative realizations, as are filters with a single input and those with distributed inputs. For third-order functions, a detailed comparison is performed of leapfrog (LF) and inverse follow-the-leader-feedback (IFLF), the most popular special cases, and of topologies that have also floating capacitors (LFf, IFLFf), as well as of a novel configuration that uses also distributed inputs (DIf) and leads to a reduced element count. Design guidelines and restrictions are given, which follow from the derived results with focus on the circuits' sensitivity performance and other properties important for IC implementation. Copyright &copy; 2004 John Wiley & Sons, Ltd.