ppxscal/embedding_network huggingface dataset:
Concert/C: a language for distributed programming
Authors: Joshua S. Auerbach, Arthur P. Goldberg, Germán S. Goldszmidt, Ajei S. Gopal, Mark T. Kennedy, Josyula R. Rao, James R. Russell
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate processes, connect them together, and communicate among them. It supports transparent remote function calls (RPC) and asynchronous messages. Interprocess communications interfaces are typed in Concert/C, and type correctness is checked at compile time wherever possible, otherwise at runtime. All C data types, including complex data structures containing pointers and aliases, can be transmitted in RPCs. Concert/C programs run on a heterogeneous set of machine architectures and operating systems and communicate over multiple RPC and messaging protocols. The current Concert/C implementation runs on AIX 3.2, SunOS 4.1, Solaris 2.2 and OS/2 2.1, and communicates over Sun RPC, OSF/DCE and UDP multicast. Several groups inside and outside IBM are actively using Concert/C, and it is available via anonymous ftp from software.watson.ibm.com:/pub/concert.
An Adaptive and Non Linear Technique for Enhancement of Extremely High Contrast Images
Authors: Saibabu Arigela, K. Vijayan Asari
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

In night time surveillance, there is a possibility of having extremely bright and dark regions in some image frames of a video sequence. A novel non linear image enhancement algorithm for digital images captured under such extremely non-uniform lighting conditions is proposed in this paper. The new technique constitutes three processes viz. adaptive intensity enhancement, contrast enhancement and color restoration. Adaptive intensity enhancement uses a specifically designed nonlinear transfer function which is capable of reducing the intensity of bright regions and at the same time enhancing the intensity of dark regions. Contrast enhancement tunes the intensity of each pixels magnitude based on its surrounding pixels. Finally, a linear color restoration process based on the chromatic information of the input image frame is applied to convert the enhanced intensity image back to a color image.
Pedestrian Navigation Systems: a Case Study of Deep Personalization
Authors: Xiangkui Yao, Stephen Fickas
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Requirements Engineering (RE) focuses on obtaining the user goals and environmental constraints of a proposed system. In traditional RE, users are treated as a consumer-class: what holds for one member is assumed to hold for the rest. Personalization comes through providing options that a user can set at runtime to tailor features of the system to his or her personal preferences. In our work, we take up the personalization issue in more detail. In particular, we believe that some systems require a "deep personalization" that includes knowledge of an individual user's skills and limitations. In some cases, these skills and limitations might not be self-aware, i.e., a user cannot accurately self-reflect on his or her skills and weaknesses. In this paper, we will demonstrate the notion of deep personalization in the domain of personal navigation systems. We find this an interesting domain for several reasons: (1) There is a domain theory of navigation skills that draws from both Cartography and Psychology. (2) There are individual differences in navigation skills. (3) An individual user may not be self-aware of his or her skills. (4) If a system is delivered that does not match the skills of the user, it may be less than effective, and at worst, abandoned.
Computer Recollections: Events, Humor, and Happenings
Authors: Walter F. Bauer
Venue: IEEE Annals of the History of Computing (2007)

Recollections of Walter Bauer's career, which he began as operations director at Ramo-Woolridge, and which primarily involved Informatics, which he cofounded. Numerous anecdotes about early computers, notably involving IBM, CDC, and Univac, are recounted.
Future management of spectrum
Authors: S. Olafsson, B. Glover, M. Nekovee
Venue: BT Technology Journal (2007)

As the heterogeneity of wireless access technologies increases, dynamic allocation and utilisation of spectrum become ever more important. The traditional rigid allocation of spectrum for technology-specific usage is not suitable for the increasingly dynamic demand driven by the continuous emergence of technologies providing new services with different quality of service requirements. New spectrum management techniques and increasingly flexible spectrum usage rights are therefore called for. We discuss the limitations of present spectrum management techniques and explore some new alternatives including spectrum trading and opportunistic spectrum access.
Subject metadata enrichment using statistical topic models
Authors: David Newman, Kat Hagedorn, Chaitanya Chemudugunta, Padhraic Smyth
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Creating a collection of metadata records from disparate and diverse sources often results in uneven, unreliable and variable quality subject metadata. Having uniform, consistent and enriched subject metadata allows users to more easily discover material, browse the collection, and limit keyword search results by subject. We demonstrate how statistical topic models are useful for subject metadata enrichment. We describe some of the challenges of metadata enrichment on a huge scale (10 million metadata records from 700 repositories in the OAIster Digital Library) when the metadata is highly heterogeneous (metadata about images and text, and both cultural heritage material and scientific literature). We show how to improve the quality of the enriched metadata, using both manual and statistical modeling techniques. Finally, we discuss some of the challenges of the production environment, and demonstrate the value of the enriched metadata in a prototype portal.
A teaching and evaluation tool for adaptive signal processing using Java
Authors: M. Harteneck
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A teaching and evaluation tool for adaptive algorithms using the Java platform is presented. The tool has been developed for use in teaching adaptive signal processing and gives the students the facility to observe a comprehensive set of algorithms executing in the time, frequency and z-domain, vary any parameter and thereby augment the traditional learning process. Another key aim in the development was to provide a simple tool so that the feasibility of adaptive algorithms for a particular problem can be evaluated quickly. The Java platform has been chosen for this task since it is possible to run the tool on any computer system (e.g. Unix, Windows, Linux) using a Java virtual machine via the World Wide Web.
State driven software installation for windows NT
Authors: Martin Sjölin
Venue: Proceedings of the 2nd conference on Large Installation System Administration of Windows NT - Volume 2 (1999)

We have implemented a state driven installation mechanism to simplify the installation of software under Windows NT. We have a "central configuration database" which defines the target the state of the machines, e.g. a declarative definition instead of an operational definition. We describe the procedure used to install the packages and some related issues concerning software delivery: software configuration: and the the actual software installation for workstations components and user components. Partial details of our implementation of System V packaging is included in the Appendix.
Distributed Information Measurement and Control System for Research and Education in Physics
Authors: S. A. Kiprushkin, N. A. Korolev, S. Yu. Kurskov
Venue: Proceedings of the Second International Conference on Systems (2007)

The present paper is devoted to the distributed information measurement and control system for support of research and education with remote access to informational and instrumental resources within the Intranet/Internet networks. The authors created the software and hardware of remote access and control described herein. This system is characterized by the network integration of computer-based research equipment for the natural sciences. It provides multiple access to such resources in the networks functioning on the basis of TCP/IP protocol stack. The access to physical equipment is realized through the interface servers (CÀÌÀC, GPIB), the server providing access to MCS-196 microcontrollers, Ethernet device server, and the communication server, which integrates the equipment servers into uniform information system. The system is used for making research task solutions in optical spectroscopy, as well as for supporting educational process at the Department of Physics and Engineering of Petrozavodsk State University.
Single channel separation using linear time varying filters: separability of non-stationary stochastic signals
Authors: J. R. Hopgood
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Separability of signal mixtures given only one mixture observation is defined as the identification of the accuracy to which the signals can be separated. The paper shows that when signals are separated using the generalised Wiener filter, the degree of separability can be deduced from the filter structure. To identify this structure, the processes are represented on an arbitrary spectral domain, and a sufficient solution to the Wiener filter is obtained. The filter is composed of a term independent of the signal values, corresponding to regions in the spectral domain where the desired signal components are not distorted by interfering noise components, and a term dependent on the signal correlations, corresponding to the region where components overlap. An example of determining perfect separability of modulated random signals is given.
How does the memory work? By timed-arc Petri nets
Authors: F. L. Pelayo, F. Cuartero, V. Valero, M. L. Pelayo
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

In this paper we use the graphical formalism timed-arc Petri nets to specify cognitive systems. In addition to the usual characteristics of this formalism, this timed extension of PNs features the possibility of capturing the facts of enabling/disabling a transition as a consequence of the time elapsed. This feature is useful to represent systems where the delays can strongly modify the state, such as the memorization process. In order to illustrate the suitability of this model we formally represent a cognitive model of the memory. This process includes the appropriate characteristics to show the advantages of having a very natural conception of concurrency as well as, how time can elapse and sometimes go beyond the threshold which determines if a perception goes into the long-term memory or not. The memory structure/working assumed can be better studied in Squire et al. (1993), Solso (1999), and Wang and Wang (2002).
Matrix orthogonal polynomials whose derivatives are also orthogonal
Authors: M. J. Cantero, L. Moral, L. Velázquez
Venue: Journal of Approximation Theory (2007)

In this paper we prove some characterizations of the matrix orthogonal polynomials whose derivatives are also orthogonal, which generalize other known ones in the scalar case. In particular, we prove that the corresponding orthogonality matrix functional is characterized by a Pearson-type equation with two matrix polynomials of degree not greater than 2 and 1. The proofs are given for a general sequence of matrix orthogonal polynomials, not necessarily associated with a hermitian functional. We give several examples of non-diagonalizable positive definite weight matrices satisfying a Pearson-type equation, which show that the previous results are non-trivial even in the positive definite case. A detailed analysis is made for the class of matrix functionals which satisfy a Pearson-type equation whose polynomial of degree not greater than 2 is scalar. We characterize the Pearson-type equations of this kind that yield a sequence of matrix orthogonal polynomials, and we prove that these matrix orthogonal polynomials satisfy a second order differential equation even in the non-hermitian case. Finally, we prove and improve a conjecture of Duran and Grunbaum concerning the triviality of this class in the positive definite case, while some examples show the non-triviality for hermitian functionals which are not positive definite.
Speaker adaptation with autonomous model complexity control by MDL principle
Authors: K. Shinoda
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

A speaker adaptation method for continuous density HMMs, which performs well for any amount of data for adaptation, is proposed. This method estimates shift parameters for the means of Gaussian mixture components in the HMM. Each shift parameter is shared by more than one Gaussian components. Many sets of shift parameters with various degree of sharing are prepared, and the set with the appropriate complexity for the gives amount of data is selected using minimum description length (MDL) principle. Unlike previous similar works, the proposed method needs no control parameters for selecting models. A series of 5000-word recognition experiments have demonstrated the effectiveness of this new method.
Nonlinear and Frequency Analysis of the Weather in Bialystok
Authors: Jaroslaw Kilon, Aida Saeed-Baginska, Jerzy Sienkiewicz, Romuald Mosdorf
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

This work presents the use of nonlinear analysis for the daily meteorological data from Bialystok, Poland. The analysis is based both on daily temperature and rainfall fluctuation data. The data for the period of 43 years (1964-2006) have been analyzed. The temperature and rainfall fluctuation frequency in Bialystok has been analyzed using Fourier transform and the wavelet power spectrum, as well as fractal analysis, including attractor reconstruction, calculation of the correlation dimension and the largest Lyapunov exponent. The analysis allows us to identify short, medium and long-term cycles both for the temperature and rainfall data. As a result of attractor reconstruction made on the temperature data the 3D torus was obtained. It has been shown, that the correlation dimension D2 as well as the largest Lyapunov exponent varies in time. The parameters mentioned above increase rapidly in years when more medium-term cycles of temperature fluctuation are identified. The maximum period of the believable weather forecast has been also shown. It varies from 5 to 20 days in the analyzed years.
Evaluation of Interconnection Networks Using Full-System Simulators: Lessons Learned
Authors: Javier Navaridas, Fco. Javier Ridruejo, Jose Miguel-Alonso
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

In this paper we show the difficulties encountered when performing full system simulation of a distributed memory parallel system. To illustrate the problem, we have chosen a workbench that evaluates the impact on application performance of some simple congestion-control mechanism that can be implemented in the interconnection network. Applications of choice are some of those included in the NAS Parallel Benchmarks. Running a full-system, execution-driven simulation that combines Simics with an interconnection network simulator, we observe some unexpected, negative interactions of overlapping congestion control techniques implemented at the network level and at the host level. Each MPI implementation uses a different protocol stack, and some of them work without TCP. We compare and contrast results obtained with MPICH, LA-MPI and LAM..
A telephone-based directory assistance system adaptively trained using minimum classification error/generalized probabilistic descent
Authors: E. McDermott
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

The minimum classification error/generalized probabilistic descent (MCE/GPD) framework has been applied to several recognizer frameworks, such as hidden Markov models, prototype based systems, and systems based on artificial neural networks. However, to our knowledge, the MCE/CPD framework has not yet been applied to a working online speech recognition system in a realistic application environment. We describe the application of MCE/GPD to a telephone-based multi-speaker speech recognition system that accepts spoken Japanese names and forwards calls to any of up to 400 staff members. Points of interest include the automatic collection and labeling of new training data and the use of MCE/GPD training to improve recognizer performance.
Gridifying IBM's Generic Log Adapter to Speed-Up the Processing of Log Data
Authors: Claudi Paniagua, Fatos Xhafa, Thanasis Daradoumis
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Problem determination in today's computing environments consumes between 30 and 70% of an organization's IT resources and represents from one third to one half of their total cost of ownership. The first step to cutting down costs and to enable autonomic computing systems is to have all parts of the system report status in a common log data format and semantics. The Generic Log Adapter (GLA) is a generic parsing engine shipped with the IBM's Autonomic Computing Toolkit that has been conceived to convert proprietary log data into a standard log data event-based format in real time. However, in order to provide generic support for parsing the majority of today's unstructured log data formats the GLA makes heavy use of regular expressions that incur in performance limitations. Current approaches proposed to increase GLA's performance have revolved around fine-tuning the set of regular expressions used to configure the GLA for a particular log data format or writing specific parsing code. In this work we propose a very new approach consisting in transparently parallelizing the GLA by taking advantage of its internal architecture and the fact that structuring log data is a task that lends itself very well to parallelization. We present a master-worker strategy that "gridifies" the GLA efficiently in a completely transparent way for the user.
Using Synthetic-Perturbation Techniques for Tuning Shared Memory Programs
Authors: Robert Snelick, Joseph Jaja, Raghu Kacker, Gordon Lyon
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

The Synthetic-Perturbation Tuning (SPT) methodology is base d on compirical approach that introduces artificial delays into the MIMD program and captures the effects of such delays by using the modrn branch statistics called design of experiments.
Yield-aware placement optimization
Authors: P. Azzoni, M. Bertoletti, N. Dragone, F. Fummi, C. Guardiani, W. Vendraminetto
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In this paper we describe a methodology addressing the issue of avoiding yield hazardous cell abutments during placement. This is made possible by accurate characterization of the yield penalty associated with particular cell-to-cell interactions. Of course characterizing all possible cell abutments in a library of 600+ cells is impractical. We will describe some simple heuristics that attempt to resolve the cell abutment pre-characterization complexity. Finally we will show a possible implementation of the proposed yield-aware placement optimization methodology and demonstrate the potential of cell interaction penalty characterization for a 90nm design test case.
Zero Cost Test Point Insertion Technique for Structured ASICs
Authors: Rajamani Sethuram, Seongmoon Wang, Srimat T. Chakradhar, Michael L. Bushnell
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We show different ways in which unused multiplexers (MUXes) and scan flip-flops (flops) in a structured application specific integrated chip (SA) design can be re-configured to insert test points to drastically reduce test volume and test generation time. We convert unused hardware in SAs into: (a) conventional control points, (b) complete test points, (c) pseudocontrol points or (d) inversion test points. Since only unused hardware is used, the proposed test point insertion (TPI) technique does not entail any extra hardware overhead. Test points are inserted using timing information, so they do not degrade performance. We also present novel gain functions that quantify the reduction in test volume and automatic test pattern generation (ATPG) time due to TPI and are used as heuristics to guide the selection of signal lines for inserting test points. Experimental results clearly demonstrate the effectiveness and scalability of the proposed technique. Using very little unused hardware and TPI run time, we reduced ATPG time by up to 63.1% and test data volume by up to 64.5% while also achieving a near 100% fault efficiency for very large industrial designs.
Improved indexing for distributed virtual university
Authors: V. Pantovic
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Many disciplines have been changed through the use of the Internet. Education being among those that suffer the most radical changes. In the project Virtual School of Energoprojekt Group we made a prototype implementation with distributed mobile agents. The role of the mobile agent layer in the entire virtual university framework is to provide support for information retrieval from the Internet. Major enhancements of the proposed architecture of our solution involve traditional indexing which is enriched by inclusion of an extended thesaurus. This extended thesaurus is updated by mobile agents by finding useful content on accessible servers. On the servers not allowing access of mobile agents, standard search engines are used and the results of such standard search are analysed by software agents and added to the thesaurus.
Liapunov-Schmidt Reduction and Continuation for Nonlinear Schro&uml;dinger Equations
Authors: S.-L. Chang, C.-S. Chien, B.-W. Jeng
Venue: SIAM Journal on Scientific Computing (2007)

We study the bifurcation scenario of nonlinear Schro&uml;dinger equations (NLS). The Liapunov-Schmidt reduction is applied to show that the simple bifurcations of a single NLS are pitchfork. The pitchfork bifurcation can be subcritical or supercritical, depending on the coefficient of the cubic term we choose. We also describe numerical methods so that the Liapunov-Schmidt reduction can effectively handle a corank-2 bifurcation point. Next, we apply numerical continuation methods to trace solution curves and surfaces of the NLS, where the system is discretized by the centered difference approximations. Numerical results on two- and three-dimensional $M$-coupled NLS are reported, where the physical properties such as the effect of trapping potentials, isotropic and nonisotropic trapping potentials, mass conservation constraints, and strong and weak repulsive interactions are considered in our numerical experiments.