ppxscal/embedding_network huggingface dataset:
High Fidelity Methods and Physics for UAV Flow Regimes
Authors: Reid Melville, Miguel Visbal, Raymond Gordnier
Venue: Proceedings of the 2004 Users Group Conference (2004)

Planned Air Force Unmanned Air Vehicles (UAVs) will be limited by highly nonlinear flow regimes, so an advanced simulation capability has been applied to this class of problems. The proposed paper will document several large-scale computational studies and efforts to validate and to extend the solver capability.
Transformation from population codes to firing rate codes by learning: Neural representation of smooth pursuit eye movements
Authors: Shinya Taguchi, Hiromitsu Tabata, Tomohiro Shibata, Mitsuo Kawato
Venue: Systems and Computers in Japan (2004)

It has been reported that not only the information related to retinal slip but also the non-visual information were population-coded in the middle temporal (MT) area and the medial superior temporal (MST) area during smooth pursuit eye movements. On the other hand, it has been also reported that the information related to motor signals to generate eye movements were firing rate-coded in the Purkinje cells in the cerebellum. Here, we propose a computational model of smooth pursuit that includes various temporal patterns of neural firing in the MT&sol;MST areas and synaptic plasticity in the cerebellar cortex. We show that the signals to generate smooth pursuit eye movements could be extracted from the signals population-coded in the cerebral cortex by means of the synaptic plasticity in the cerebellar cortex. Our results indicate that the transformation from population codes to firing rate-codes occurs in the cerebellum during smooth pursuit eye movements &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 79&ndash;88, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10322
User strategies for handling information tasks in webcasts
Authors: Christine Dufour, Elaine G. Toms, Jonathan Lewis, Ron Baecker
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Webcast systems support real-time webcasting, and may also support access to the stored webcasts. Yet, research rarely examines issues concerning the interface to webcast systems, another form of multimedia system. This paper focuses specifically on how stored webcasts are re-used. Sixteen participants performed three typical information tasks using ePresence, a webcasting system that handles both live and stored video, and contains several tools: a video window, a timeline of the webcast, slides used by the presenter, and a moderator-generated table of contents, that facilitate user access to the intellectual content of a stored video. Use takes place at the level of the webcast, and our analysis assessed user interactivity. The results showed that different types of tasks need different strategies and tools.
A survey course on computer audio
Authors: Stephen V. Rice
Venue: Journal of Computing Sciences in Colleges (2005)

A new one-semester course for graduate students introduces them to the field of computer audio from a computer science perspective. Students gain an understanding of sound, speech, and music and their digital representation and processing in computer software. Programming assignments provide hands-on experience in playing, recording, mixing, synthesizing, and analyzing audio. Class lectures present algorithms and techniques for compression, watermarking, synthesis, sonification, pitch and beat detection, audio fingerprinting, speech and speaker recognition, and audio retrieval.
Regression Analysis of Ozone Data
Authors: M. Abdollahian, R. Foroughi
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

The objective of this paper is to apply multiple regression techniques to ozone data in order to predict next day ozone levels. Examination of several possible contributing factors, showed that Wind speed, Mixing height where the complex chemical reactions that produce ozone take place, current and predicted next day temperatures and current ozone concentration are influential on the next day ozone concentration levels. These variables were then considered as explanatory variables in regression models. Subsequently, diagnostics tests and statistics including R-square residual analysis and Durbin-Watson Statistic were applied in order to select the best fitted model and finally thebest prediction model was found using Mean Absolute Percentage Error (MAPE) and Mean Absolute Deviation (MAD) as predictive criteria.
FastPlace: an analytical placer for mixed-mode designs
Authors: Natarajan Viswanathan, Min Pan, Chris Chong-Nuen Chu
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Modern designs often contain a combination of a large number of standard cells and macro blocks. Traditionally large macro blocks are handled at the floorplanning level, after which their positions are fixed. The standard cells are then handled during the placement level. Current designs can have hundreds of large and medium sized macro blocks and a large number of standard cells. As a result, traditional floorplanning techniques cannot scale to this problem, both in terms of runtime and solution quality. Hence a technique is required to simultaneously handle this combination of placeable objects.In this paper, we present a combined placement and floorplanning approach for mixed-mode placement. We extend the efficient analytical placement algorithm FastPlace by integrating a simulated annealing based floorplanner to solve the global placement problem for mixed-mode designs. We also present an efficient and effective detailed placement algorithm to improve the wirelength of the global placement solution based on a greedy swapping heuristic.
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
Authors: Luis Gouveia, Thomas L. Magnanti, Cristina Requejo
Venue: Networks (2004)

In a previous article, using underlying graph theoretical properties, Gouveia and Magnanti &lpar;2003&rpar; described several network flow-based formulations for diameter-constrained tree problems. Their computational results showed that, even with several enhancements, models for situations when the tree diameter D is odd proved to be more difficult to solve than those when D is even. In this article we provide an alternative modeling approach for the situation when D is odd. The approach views the diameter-constrained minimum spanning tree as being composed of a variant of a directed spanning tree &lpar;from an artificial root node&rpar; together with two constrained paths, a shortest and a longest path, from the root node to any node in the tree. We also show how to view the feasible set of the linear programming relaxation of the new formulation as the intersection of two integer polyhedra, a so-called triangle-tree polyhedron and a constrained path polyhedron. This characterization improves upon a model of Gouveia and Magnanti &lpar;2003&rpar; whose linear programming relaxation feasible set is the intersection of three rather than two integer polyhedra. The linear programming gaps for the tightened model are very small, typically less than 0.5&percnt;, and are usually one third to one tenth of the gaps of the best previous model described in Gouveia and Magnanti &lpar;2003&rpar;. Moreover, using the new model, we have been able to solve large Euclidean problem instances that are not solvable by the previous approaches. &copy; 2004 Wiley Periodicals, Inc.
LSH forest: self-tuning indexes for similarity search
Authors: Mayank Bawa, Tyson Condie, Prasanna Ganesan
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of settings: Web search engines desire fast, parallel, main-memory-based indexes for similarity search on text data; database systems desire disk-based similarity indexes for high-dimensional data, including text and images; peer-to-peer systems desire distributed similarity indexes with low communication cost. We propose an indexing scheme called LSH Forest which is applicable in all the above contexts. Our index uses the well-known technique of locality-sensitive hashing (LSH), but improves upon previous designs by (a) eliminating the different data-dependent parameters for which LSH must be constantly hand-tuned, and (b) improving on LSH's performance guarantees for skewed data distributions while retaining the same storage and query overhead. We show how to construct this index in main memory, on disk, in parallel systems, and in peer-to-peer systems. We evaluate the design with experiments on multiple text corpora and demonstrate both the self-tuning nature and the superior performance of LSH Forest.
Lollio: side effects in linear logic programming
Authors: Todd Johnson
Venue: Journal of Computing Sciences in Colleges (2005)

Lollio extends the linear logic programming language Lolli. Lolli is itself an extension of Lambda-Prolog. Lollio improves upon Lolli by adding a monad type for input and output, thereby partitioning code that generates side effects from the purely logical core of the language.
Scaling link-based similarity search
Authors: Dániel Fogaras, Balázs Rácz
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed architecture. The similarity of multi-step neighborhoods of vertices are numerically evaluated by similarity functions including SimRank [20], a recursive refinement of cocitation; PSimRank, a novel variant with better theoretical characteristics; and the Jaccard coefficient, extended to multi-step neighborhoods. Our methods are presented in a general framework of Monte Carlo similarity search algorithms that precompute an index database of random fingerprints, and at query time, similarities are estimated from the fingerprints. The performance and quality of the methods were tested on the Stanford Webbase [19] graph of 80M pages by comparing our scores to similarities extracted from the ODP directory [26]. Our experimental results suggest that the hyperlink structure of vertices within four to five steps provide more adequate information for similarity search than single-step neighborhoods.
Mixed Discontinuous Galerkin Methods for Darcy Flow
Authors: F. Brezzi, T. J. R. Hughes, L. D. Marini, A. Masud
Venue: Journal of Scientific Computing (2005)

We consider a family of mixed finite element discretizations of the Darcy flow equations using totally discontinuous elements (both for the pressure and the flux variable). Instead of using a jump stabilization as it is usually done for discontinuos Galerkin (DG) methods (see e.g. D.N. Arnold et al. SIAM J. Numer. Anal.39, 1749--1779 (2002) and B. Cockburn, G.E. Karniadakis and C.-W. Shu, DG methods: Theory, computation and applications, (Springer, Berlin, 2000) and the references therein) we use the stabilization introduced in A. Masud and T.J.R. Hughes, Meth. Appl. Mech. Eng.191, 4341--4370 (2002) and T.J.R. Hughes, A. Masud, and J. Wan, (in preparation). We show that such stabilization works for discontinuous elements as well, provided both the pressure and the flux are approximated by local polynomials of degree ¿ 1, without any need for additional jump terms. Surprisingly enough, after the elimination of the flux variable, the stabilization of A. Masud and T.J.R. Hughes, Meth. Appl. Mech. Eng.191, 4341--4370 (2002) and T.J.R. Hughes, A. Masud, and J. Wan, (in preparation) turns out to be in some cases a sort of jump stabilization itself, and in other cases a stable combination of two originally unstable DG methods (namely, Bassi-Rebay F. Bassi and S. Rebay, Proceedings of the Conference ``Numerical methods for fluid dynamics V'`, Clarendon Press, Oxford (1995) and Baumann--Oden Comput. Meth. Appl. Mech. Eng.175, 311--341 (1999).
Code available for boundary-value problems
Authors: James W. Daniel, Andrew J. Martin
Venue: ACM SIGNUM Newsletter (1976)

In a series of well-known papers, Victor Pereyra and colleagues have developed the deferred-correction of divided-difference methods for the numerical solution of two-point boundary-value problems both for first-order systems and for second-order scalar equations. As a first step on the road similarly to developing deferred-correction of collocation methods, we have studied Pereyra's code IDCBVP for the second-order case in detail; since most of Pereyra's effort has been directed toward first-order systems, it is not surprising that we were able to improve IDCBVP considerably. Such effort seems worthwhile since experience indicates that for efficiency one should solve second-order problems as second-order problems rather than as first-order systems. Our resulting code NUMIDC is efficient, accurate, reliable, and seems to compare favorably with competing codes on appropriate problems.
Moving Cast Shadow Detection from a Gaussian Mixture Shadow Model
Authors: Nicolas Martel-Brisson, Andre Zaccarin
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Moving cast shadows are a major concern for foreground detection algorithms. Processing of foreground images in surveillance applications typically requires that such shadows have been identified and removed from the detected foreground. This paper presents a novel pixel-based statistical approach to model moving cast shadows of non-uniform and varying intensity. This approach uses the Gaussian mixture model (GMM) learning ability to build statistical models describing moving cast shadows on surfaces. This statistical modeling can deal with scenes with complex and time-varying illumination, and prevent false detection in regions where shadows cannot be detected. Gaussian mixture shadow models (GMSM) are automatically constructed and updated over time, are easily added to a GMM architecture for foreground detection, and require only a small number of parameters. Results obtained with different scene types show the robustness of the approach.
Ibis: a flexible and efficient Java-based Grid programming environment: Research Articles
Authors: Rob V. van Nieuwpoort, Jason Maassen, Gosia Wrzesińska, Rutger F. H. Hofman, Ceriel J. H. Jacobs, Thilo Kielmann, Henri E. Bal
Venue: Concurrency and Computation: Practice Experience (2005)

In computational Grids, performance-hungry applications need to simultaneously tap the computational power of multiple, dynamically available sites. The crux of designing Grid programming environments stems exactly from the dynamic availability of compute cycles: Grid programming environments (a) need to be portable to run on as many sites as possible, (b) they need to be flexible to cope with different network protocols and dynamically changing groups of compute nodes, while (c) they need to provide efficient (local) communication that enables high-performance computing in the first place. Existing programming environments are either portable (Java), or flexible (Jini, Java Remote Method Invocation or (RMI)), or they are highly efficient (Message Passing Interface). No system combines all three properties that are necessary for Grid computing. In this paper, we present Ibis, a new programming environment that combines Java's &lsquo;run everywhere&rsquo; portability both with flexible treatment of dynamically available networks and processor pools, and with highly efficient, object-based communication. Ibis can transfer Java objects very efficiently by combining streaming object serialization with a zero-copy protocol. Using RMI as a simple test case, we show that Ibis outperforms existing RMI implementations, achieving up to nine times higher throughputs with trees of objects. Copyright &copy; 2005 John Wiley & Sons, Ltd.
System on a FPGA Virtual Concatenation
Authors: Sakir Sezer, Eimear Stewart, Marc Carson, Claire Greenwood
Venue: Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2001)

This paper presents the study and implementation of a novel architecture for a virtual concatenation circuit using the NIOS soft core embedded processor on a FPGA (APEX). The architecture is optimised for rapid adaptation of the virtual concatenation core by exploiting the reconfigurable properties of the FPGA technology and the programmable properties of embedded processors. This synergy provides a hardware efficient implementation of hitless re-configuration of transmission paths and the rapid adaptation of the architecture for a wide range of data transmission products to keep pace with product and standard migrations.
Modelling and performance analysis of the distributed scheduler in IEEE 802.16 mesh mode
Authors: Min Cao, Wenchao Ma, Qian Zhang, Xiaodong Wang, Wenwu Zhu
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

To meet the needs of wireless broadband access, the IEEE 802.16 protocol for wireless metropolitan networks (WirelessMAN) has been recently standardized. The medium access control (MAC) layer of the IEEE 802.16 has point-to-multipoint (PMP) mode and mesh mode. Previous works on the IEEE 802.16 have primarily focused on the PMP mode. In the mesh mode, all nodes are organized in an ad hoc fashion and use a pseudo-random function to calculate their transmission time based on the scheduling information of the two-hop neighbors. In this paper, we develop a stochastic model for the distributed scheduler of the mesh mode. With this model, we analyze the scheduler performance under various conditions, and the analytical results match very well with the ns-2 simulation results. The analytical model developed in this paper is instrumental in optimizing the IEEE 802.16 mesh mode system performance. To the best of our knowledge, this work is the first one theoretically investigating the IEEE 802.16 mesh mode scheduling performance.
UMass/Hughes: description of the CIRCUS system used for MUC-5
Authors: W. Lehnert, J. McCarthy, S. Soderland, E. Riloff, C. Cardie, J. Peterson, F. Feng, C. Dolan, S. Goldman
Venue: Proceedings of the 5th conference on Message understanding (1993)

The primary goal of our effort is the development of robust and portable language processing capabilities for information extraction applications. The system under evaluation here is based on language processing components that have demonstrated strong performance capabilities in previous evaluations [Lehnert et al. 1992a]. Having demonstrated the general viability of these techniques, we are now concentrating on the practicality of our technology by creating trainable system components to replace hand-coded data and manually-engineered software.
On culture in a world-wide information society: toward the knowledge society - the challenge
Authors: Alfredo M. Ronchi, Lynn Thiesmeyer, Antonella Quacchia, Georges Mihajes, Katsuhiro Onoda, Ranjit Makkuni
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Starting from more then ten years of experience and achievements in online cultural content, the panel aims to provide a comprehensive view on controversial issues, or unsolved problems, both in the WWW and Cultural community to stimulate lively, thoughtful, and sometimes provocative discussions. Panelists will outline the relevance of digital collections of intangible heritage and endangered archives and discuss the following topics: the "global" Web vs. the preservation of "local" cultural identities, cultural diversities and their relevance in delivering web based services, preservation & future of digital memories, Web-based development and sustainability models. We expect the panelists to actively engage the audience and help them broaden their understanding of the issues. URL: <http://www.medicif.org/Events/MEDICI_events/WWW2005/default.htm.
Working Session: Textual Views of Source Code to Support Comprehension
Authors: Anthony Cox, Michael L. Collard
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Source code can be viewed in many ways, with each view facilitating access to different information contained within the code. In this working session, we will explore the role that marked-up textual views can provide in support of software comprehension and maintenance. Text has the advantages of being easily communicated, effectively manipulated with existing tools, and highly scalable. Furthermore, marked-up text models may improve comprehension by expressing information directly within the context of maintainers' focus . the source code they are manipulating. This session intends to explore the expressibility of marked-up text and its applicability in support of program comprehension tasks. Topics will include: the roles these models fulfill, their limitations, their combination, and the exploration of future research directions.
Adobe Photoshop CS X: Photographers' Guide
Authors: David D. Busch
Venue:  (2005)

Coverage includes- David D. Busch has been demystifying arcane computer and imaging technology since the early 1980s. However, he had a successful career as a professional photographer for a decade before he sat down at the keyboard of his first personal computer. Busch has worked as a newspaper photographer, done commercial studio and portrait work, shot weddings, and roved the United States and Europe as a photojournalist. His articles on photography and image editing have appeared in magazines as diverse as Popular Photography and Imaging, Petersen's PhotoGraphic, The Rangefinder, and The Professional Photographer, as well as computer magazines such as Macworld and Computer Shopper. He's currently reviewing digital cameras for CNet. Explores image editing in Photoshop from a professional photographer's perspective, combining Photoshop and photography in a meaningful way. Perfect for getting up to speed on the latest features of Adobe Photoshop CS2. Guides readers through reproducing professional-looking camera effects. Written for camera buffs, both digital and conventional, and business people who want to go beyond point-and-click snapshooting to explore the enriching world of photography. Clear, easy to understand and full of color images that clearly illustrate the lessons.
Modeling and improving selection in cascading pull-down menus using Fitts' law, the steering law and force fields
Authors: David Ahlström
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Selecting a menu item in a cascading pull-down menu is a frequent but time consuming and complex GUI task. This paper describes an approach aimed to support the user during selection in cascading pull-down menus when using an indirect pointing device. By enhancing such a cascading pull-down menu with "force fields", the cursor is attracted toward a certain direction, e.g. toward the right hand side within a menu item, which opens up a sub-menu, making the cursor steering task easier and faster. The experiment described here shows that the force fields can decrease selection times, on average by 18%, when a mouse, a track point, or touch pad is used as input device. The results also suggest that selection times in cascading pull-down menus can be modeled using a combination of Fitts' law and the steering law. The proposed model proved to hold for all three devices, in both standard and in enhanced cascading pull-down menus, with correlations better than r2=0.90.