ppxscal/embedding_network huggingface dataset:
Constant Connectivity: Just Because You Can Doesn't Mean You Should
Authors: Warren Harrison
Venue: IEEE Software (2005)

The Netcraft annual Web server survey indicates more than 56 million Web servers were active at the end of 2004, and an average of 911,000 new sites are added each month. This doesn't include computers connected to the Internet as clients. Software developers continue to take advantage of this widespread connectivity. If developers can reduce that 56 million to only those systems that really need Internet access, they'd significantly reduce the probability of security holes due to mistakes and oversights. The author urges system architects to evaluate if the system they are designing really needs to be accessible via the Internet. They should ask themselves, Is providing information over the Internet really a core mission for my application, or is it just an "extra feature" that's inexpensive to add? The author also urges network engineers to consider laying two network drops when they run a LAN: one for a secure internal LAN and one for an open LAN connected to the Internet through a firewall.
Message-Passing and Shared-Data Programming Models " Wish vs. Reality
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Typically, only technical arguments like performance, cost or scalability are discussed if programming models and languages on High Performance Computing facilities are under consideration. In this paper, we investigate the impact of human factors such as personal preferences and perceptions, and personal experience on making technical decisions. We have queried a large HPC community of the Sharcnet project in Ontario in regards to general preferences and in regards to detailed usage of language features and programming style. The main result of our study is that ¿ as often claimed in the past but never proven ¿ shared-memory programming models and architectures appear to be the ideal for the majority of users, even if the main architecture of the project is a distributed-memory cluster. However, experience appears to be able to quickly overcome initial difficulties in using message passing.
Parallelization of the NAS Conjugate Gradient Benchmark Using the Global Arrays Shared Memory Programming Model
Authors: Yeliang Zhang, Vinod Tipparaju, Jarek Nieplocha, Salim Hariri
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

The NAS Conjugate Gradient (CG) benchmark is an important scientific kernel used to evaluate machine performance and compare characteristics of different programming models. Global Arrays (GA) toolkit supports a shared memory programming paradigm and offers the programmer control over the distribution and locality that are important for optimizing performance on scalable architectures. In this paper, we describe and compare two different parallelization strategies of the CG benchmark using GA and report performance results on a shared-memory system as well as on a cluster. Performance benefits of using shared memory for irregular/sparse computations have been demonstrated before in the context of the CG benchmark using OpenMP. Similarly, the GA implementation outperforms the standard MPI implementation on shared memory system, in our case the SGI Altix. However, with GA these benefits are extended to distributed memory systems and demonstrated on a Linux cluster with Myrinet.
Multilevel Solvers for Unstructured Surface Meshes
Authors: Burak Aksoylu, Andrei Khodakovsky, Peter Schröder
Venue: SIAM Journal on Scientific Computing (2005)

Parameterization of unstructured surface meshes is of fundamental importance in many applications of digital geometry processing. Such parameterization approaches give rise to large and exceedingly ill-conditioned systems which are difficult or impossible to solve without the use of sophisticated multilevel preconditioning strategies. Since the underlying meshes are very fine to begin with, such multilevel preconditioners require mesh coarsening to build an appropriate hierarchy. In this paper we consider several strategies for the construction of hierarchies using ideas from mesh simplification algorithms used in the computer graphics literature. We introduce two novel hierarchy construction schemes and demonstrate their superior performance when used in conjunction with a multigrid preconditioner.
Combining head tracking and mouse input for a GUI on multiple monitors
Authors: Mark Ashdown, Kenji Oka, Yoichi Sato
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The use of multiple LCD monitors is becoming popular as prices are reduced, but this creates problems for window management and switching between applications. For a single monitor, eye tracking can be combined with the mouse to reduce the amount of mouse movement, but with several monitors the head is moved through a large range of positions and angles which makes eye tracking difficult. We thus use head tracking to switch the mouse pointer between monitors and use the mouse to move within each monitor. In our experiment users required significantly less mouse movement with the tracking system, and preferred using it, although task time actually increased. A graphical prompt (flashing star) prevented the user losing the pointer when switching monitors. We present discussions on our results and ideas for further developments.
How Much Better Are the Most-Prestigious Journals? The Statistics of Academic Publication
Authors: William H. Starbuck
Venue: Organization Science (2005)

Articles in high-prestige journals receive more citations and more applause than articles in less-prestigious journals, but how much more do these articles contribute to knowledge?This article uses a statistical theory of review processes to draw inferences about differences value between articles in more-prestigious versus less-prestigious journals. This analysis indicates that there is much overlap in articles in different prestige strata. Indeed, theory implies that about half of the articles published are not among the best ones submitted to those journals, and some of the manuscripts that belong in the highest-value 20% have the misfortune to elicit rejections from as many as five journals.Some social science departments and business schools strongly emphasize publication in prestigious journals. Although one can draw inferences about an author's average manuscript from the percentage in top-tier journals, the confidence limits for such inferences are wide. A focus on prestigious journals may benefit the most prestigious departments or schools but add randomness to the decisions of departments or schools that are not at the very top. Such a focus may also impede the development of knowledge when mediocre research receives the endorsement of high visibility.
A comparison of concurrent programming and cooperative multithreading under load balancing applications: Research Articles
Authors: Justin T. Maris, Aaron W. Keen, Takashi Ishihara, Ronald A. Olsson
Venue: Concurrency and Computation: Practice Experience (2004)

Two models of thread execution are the general concurrent programming execution model (CP) and the cooperative multithreading execution model (CM). CP provides nondeterministic thread execution where context switches occur arbitrarily. CM provides threads that execute one at a time until they explicitly choose to yield the processor. This paper focuses on a classic application to reveal the advantages and disadvantages of load balancing during thread execution under CP and CM styles; results from a second classic application were similar. These applications are programmed in two different languages (SR and Dynamic C) on different hardware (standard PCs and embedded system controllers). An SR-like run-time system, DesCaRTeS, was developed to provide interprocess communication for the Dynamic C implementations. This paper compares load balancing and non-load balancing implementations; it also compares CP and CM style implementations. The results show that in cases of very high or very low workloads, load balancing slightly hindered performance; and in cases of moderate workload, both SR and Dynamic C implementations of load balancing generally performed well. Further, for these applications, CM style programs outperform CP style programs in some cases, but the opposite occurs in some other cases. This paper also discusses qualitative tradeoffs between CM style programming and CP style programming for these applications. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
Authors: Dragomir Anguelov, Ben Taskar, Vassil Chatalbashev, Daphne Koller, Dinkar Gupta, Geremy Heitz, Andrew Ng
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We address the problem of segmenting 3D scan data into objects or object classes. Our segmentation framework is based on a subclass of Markov Random Fields (MRFs) which support efficient graph-cut inference. The MRF models incorporate a large set of diverse features and enforce the preference that adjacent scan points have the same classification label. We use a recently proposed maximum-margin framework to discriminatively train the model from a set of labeled scans; as a result we automatically learn the relative importance of the features for the segmentation task. Performing graph-cut inference in the trained MRF can then be used to segment new scenes very efficiently. We test our approach on three large-scale datasets produced by different kinds of 3D sensors, showing its applicability to both outdoor and indoor environments containing diverse objects.
Models of non-smooth switches in electrical systems: Research Articles
Authors: Christoph Glocker
Venue: International Journal of Circuit Theory and Applications (2005)

Idealized modelling of diodes, relays and switches in the framework of linear complementarity is introduced. Within the charge approach, the classical electromechanical analogy is extended to passively and actively switching components in electrical circuits. The associated branch relations are expressed in terms of set-valued functions, which allow to formulate the circuit's dynamic behaviour as a differential inclusion. This approach is demonstrated by the example of the DC&ndash;DC buck converter. A difference scheme, known in mechanics as time stepping, is applied for numerical approximation of the evolution problem. The discretized inclusions are formulated as a linear complementarity problem in standard form, which implicitly takes care of all switching events by its solution. State reduction, which requires manipulation of the set-valued branch relations in order to obtain a minimal model, is performed on the example of the buck converter. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Laplace-spectra as fingerprints for shape matching
Authors: Martin Reuter, Franz-Erich Wolter, Niklas Peinecke
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

This paper introduces a method to extract fingerprints of any surface or solid object by taking the eigenvalues of its respective Laplace-Beltrami operator. Using an object's spectrum (i.e. the family of its eigenvalues) as a fingerprint for its shape is motivated by the fact that the related eigenvalues are isometry invariants of the object. Employing the Laplace-Beltrami spectra (not the spectra of the mesh Laplacian) as fingerprints of surfaces and solids is a novel approach in the field of geometric modeling and computer graphics. Those spectra can be calculated for any representation of the geometric object (e.g. NURBS or any parametrized or implicitly represented surface or even for polyhedra). Since the spectrum is an isometry invariant of the respective object this fingerprint is also independent of the spatial position. Additionally the eigenvalues can be normalized so that scaling factors for the geometric object can be obtained easily. Therefore checking if two objects are isometric needs no prior alignment (registration/localization) of the objects, but only a comparison of their spectra. With the help of such fingerprints it is possible to support copyright protection, database retrieval and quality assessment of digital data representing surfaces and solids.
Real World Digital Audio (Real World)
Authors: Peter Kirn
Venue:  (2005)

No matter what part of the musical spectrum you come from-whether you're playing in a band, composing, or DJing-if you're using a computer (or wondering whether you should be), to get the results you want from your digital studio you'll need reliable information. Real World Digital Audio is a comprehensive resource-a book and DVD combo-that offers practical advice on making great music with modern technologies-a valuable reference whatever your musical genre or preferred audio application. You'll learn how digital sound works, and then apply that knowledge to getting your music to sound the way you want. From recording, mixing, and producing CDs, musical scores, and video soundtracks, to performing live with your laptop, this is the definitive guide to the art of creating digital music. Real World Digital Audio will show you how to Choose the right software and hardware to fit your musical direction-and your budget Optimize your setup for maximum recording quality and reliability Choose and strategically place microphones for different recording situations Use loops and grooves to create backing tracks, DJ, and enhance live performances Master MIDI and audio editing techniques to make expressive, polished tracks Create dynamic sounds with audio effects, synthesizers, and soft synths Generate publication-quality notated scores on your desktop Mix, master, and share professional recordings, online music, and video soundtracksThe DVD included with this book is a cross-platform data DVD compatible with both Mac and Windows computers. The DVD contains over two gigabytes of sound content, instruments, and software tools that you can use immediately in your music, and to explore topics in the book. Companion Web site at www.realworlddigitalaudio.com includes interviews with audio professionals, updated information, and more. "Writing about digital audio is like shooting at a moving target. But Peter Kirn has managed to score a bullseye with Real World Digital Audio." -Ernie Rideout, Editor-in-Chief, Keyboard magazine
Using the CVS version management system in a software engineering course
Authors: Jon Beck
Venue: Journal of Computing Sciences in Colleges (2005)

A number of the knowledge areas in the joint ACM IEEE-CS software engineering computing curricula involve learning about or using a version management system. A version management system can also address several important topics in a software engineering course not covered in the computing curricula. Such a system can facilitate the logistics of a team-based software engineering course project to enhance the realism and efficacy of the project. An argument is made for a specific version management system, CVS. Details of how CVS can be configured for use in a software engineering course to achieve these benefits are presented.
Design and integration of a handwritten character recognition system into mobile phones
Authors: Eric Anquetil, François Bouteruche
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

In this paper, we present the conception and the integration of the handwritten character recognition system (RESIFCar) into mobile devices: smartphone and personal digital assistant. Through an industrial collaboration, RESIFCar has been successfully integrated into mobile devices. These mobile phones are today commercialized in Europe. The experience coming from this industrialization shows us the important part of the input interface in the efficiency of the application. More recent works are presented in the last part of this paper. These works focus on the design of a new pen input interface dedicated to the mobile devices.
The computation of word associations: comparing syntagmatic and paradigmatic approaches
Authors: Reinhard Rapp
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

It is shown that basic language processes such as the production of free word associations and the generation of synonyms can be simulated using statistical models that analyze the distribution of words in large text corpora. According to the law of association by contiguity, the acquisition of word associations can be explained by Hebbian learning. The free word associations as produced by subjects on presentation of single stimulus words can thus be predicted by applying first-order statistics to the frequencies of word co-occurrences as observed in texts. The generation of synonyms can also be conducted on co-occurrence data but requires second-order statistics. The reason is that synonyms rarely occur together but appear in similar lexical neighborhoods. Both approaches are systematically compared and are validated on empirical data. It turns out that for both tasks the performance of the statistical system is comparable to the performance of human subjects.
CRL/NMSU: description of the CRL/NMSU systems used for MUC-6
Authors: Jim Cowie
Venue: Proceedings of the 6th conference on Message understanding (1995)

This paper discusses the two CRL named entity recognition systems submitted for MUC-6. The systems are based on entirely different approaches. The first is a data intensive method, which uses human generated patterns. The second uses the training data to develop decision trees which detect the start and end points of names.
Black knight: An autonomous vehicle for competition
Authors: Fernando G. Gonzalez, Richard Andres, David Deal, Frank Goergen, Matt Rhodes, Tim Roberts, Gary Stein, Josh Wilson, Sarah Wong
Venue: Journal of Robotic Systems (2004)

Black Knight, the University of Central Florida's vehicle in the 11th Intelligent Ground Vehicle Competition (IGVC) competed in 2003. Completing in 5th place in the navigational challenge and 10th in the autonomous challenge in its first competition has proven our vehicle to be a strong competitor in this competition. The vehicle has many interesting features that allow it to achieve its success. The vehicle's 300 lb. capacity allows for two onboard full-sized computers and two 12 V marine batteries that power the computers for up to 2 h. The vision system is not a simple reactive system but rather it classifies its view into objects and builds a map of the territory as it learns of its features while traveling. Two transformations and the location data from the GPS and other sensors are used to associate the locations in the image to locations in the map. The operations of the vehicle are modeled after the typical operations of a ship. We have programs that perform the functions of the captain, the helm, the navigator, and the engineer. In addition we have a program performing sensor data fusion from the GPS, compass, and wheel encoder data. The navigation uses an adapted two-dimensional approximate cell decomposition method that satisfies the nonholononic constraints of our vehicle and allows it to find the shortest path to the goal while avoiding all obstacles. &copy; 2004 Wiley Periodicals, Inc.
Disjunction and modular goal-directed proof search
Authors: Matthew Stone
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

This article explores goal-directed proof search in first-order multimodal logic. I focus on a family of modal logics which offer the expressive power to specify modular goals and local assumptions. A modular goal must be proved from designated assumptions; conversely, a local assumption can only be used to prove a designated goal. Indefinite modal specifications can avoid combinatorial interactions among independent ambiguities by making separate goals modular and corresponding disjunctive alternatives local. Such specifications can effectively guarantee that provable goals have short proofs. The key result of this article is to establish a sound and complete goal-directed proof system that actively uses the modularity and locality of modal logic to constrain proof search. In particular, logically independent, local ambiguities will not interact in proof search. The challenge is that, in goal-directed proof, a modal prover cannot simply reason locally, in a module, because modularity is a property of formulas rather than proof problems. The result therefore requires prior proof-theoretic justifications of logic programming to be extended, strengthened, and combined with new proof-theoretic analyses of modal deduction.
A High Resolution Grammatical Model for Face Representation and Sketching
Authors: Zijian Xu, Hong Chen, Song-Chun Zhu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper we present a generative, high resolution face representation which extends the well-known active appearance model (AAM)[5, 6, 7] with two additional layers. (i) One layer refines the global AAM (PCA) model with a dictionary of learned face components to account for the shape and intensity variabilities of eyes, eyebrows, nose and mouth. (ii) The other layer divides the face skin into 9 zones with a learned dictionary of sketch primitives to represent skin marks and wrinkles. This model is no longer of fixed dimensions and is flexible for it can select the diverse representations in the dictionaries of face components and skin features depending on the complexity of the face. The selection is modulated by the grammatical rules through hidden "switch" variables. Our comparison experiments demonstrate that this model can achieve nearly lossless coding of face at high resolution (256 × 256 pixels) with low bits. We also show that the generative model can easily generate cartoon sketches by changing the rendering dictionary. Our face model is aimed at a number of applications including cartoon sketch in non-photorealistic rendering, superresolution in image processing, and low bit face communication in wireless platforms.
RTOS-Centric Hardware/Software Cosimulator for Embedded System Design
Authors: Shinya Honda, Takayuki Wakabayashi, Hiroyuki Tomiyama, Hiroaki Takada
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

This paper presents an RTOS-centric hardware/software cosimulator which we have developed for embedded system design. One of the most remarkable features in our cosimulator is that it has a complete simulation model of an RTOS which is widely used in industry, so that application tasks including RTOS service calls are natively executed on a host computer. Our cosimulator also features cosimulation with functional simulation models of hardware written in C/C++ and cosimulation with HDL simulators. A case study with a JPEG decoder application demonstrates the effectiveness of our cosimulator.