ppxscal/embedding_network huggingface dataset:
Mining web navigation patterns based on a mixture of latent variable models
Authors: Bamshad Mobasher
Venue:  (2006)

The discovery and analysis of Web users' browsing patterns is important for gaining insight into their navigational behavior and information needs. Typical Web usage mining techniques, such as clustering of user sessions, or association rule discovery of Web page co-occurrence patterns, cannot capture the latent structures in the observation data. Nor can they quantify the hidden relationships between users' preferences and their observed behavior. This thesis proposes a unified framework to study the quantitative relationships between Web users' hidden preferences and their navigational behaviors from a probabilistic generative perspective. In particular, the framework is based on a mixture of latent variable models where continuous latent dimensions model users' hidden preferences and a discrete mixture variable models distinct user segments. In addition to Web usage data, other knowledge sources such as the Web site content and linkage structure can be useful for interpreting, analyzing and reasoning about navigational patterns. The proposed framework results in a new multi-source integration model, extending the mixture of latent variable models, to seamlessly incorporate multiple knowledge sources and enrich the user models. The extensive experimental results show that this framework is useful in uncovering the underlying user preferences and intentions behind their manifest browsing behavior as well as offering a great advantage in terms of probabilistic inference flexibility. Based on the framework, the thesis also demonstrate several useful applications in Web analytics and business intelligence such as Web user segmentation and automatic personalization.
Decision trees for entity identification: approximation algorithms and hardness results
Authors: Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh Mohania
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities over a fixed set of attributes and a probability distribution over the set of entities that specifies the likelihood of the occurrence of each entity. The goal is to construct a decision tree that identifies each entity unambiguously by testing the attribute values such that the average number of tests is minimized. This classical problem finds such diverse applications as efficient fault detection, species identification in biology, and efficient diagnosis in the field of medicine. Prior work mainly deals with the special case where the input table is binary and the probability distribution over the set of entities is uniform. We study the general problem involving arbitrary input tables and arbitrary probability distributions over the set of entities. We consider a natural greedy algorithm and prove an approximation guarantee of O(rK • log N), where N is the number of entities and K is the maximum number of distinct values of an attribute. The value rK is a suitably defined Ramsey number, which is at most log K. We show that it is NP-hard to approximate the problem within a factor of Ω(log N), even for binary tables (i.e. K=2). Thus, for the case of binary tables, our approximation algorithm is optimal up to constant factors (since r2=2). In addition, our analysis indicates a possible way of resolving a Ramsey-theoretic conjecture by Erdos.
Unsupervised and Semi-Supervised Two-class Support Vector Machines
Authors: Zhao Kun, Tian Ying-jie, Deng Nai-yang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Support VectorMachines have been a dominant learning technique for almost ten years, moreover they have been applied to supervised learning problems. Recently twoclass unsupervised and semi-supervised classification problems based on Bounded C-Support Vector Machines are relaxed to semi-definite programming[7]. In this paper we will present another version to two-class unsupervised and semi-supervised classification problems based on Bounded í-Support Vector Machines, which trained by convex relaxation of the training criterion: find a labeling that yield a maximum margin on the training data. But the problems have difficulty to compute, we will find their semidefinite relaxations that can approximate them well. Experimental results show that our new unsupervised and semisupervised classification algorithms often obtain more accurate results than other unsupervised and semi-supervised methods.
Least squares deconvolution in wavelet domain for 1/f driven LTI systems
Authors: M. I. Izzetoglu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper we propose a least squares deconvolution method in the wavelet domain for linear time-invariant (LTI) systems with 1/f type input signals. We model the output of the system as convolution of the impulse response and the input signal, which exhibits 1/f type spectral behavior. Our aim in solving the deconvolution problem is to estimate a filter which approximates the inverse of the impulse response, so that by applying this filter to the output data we can estimate the input signal. In order to achieve this objective, we use the wavelet transform and its properties for 1/f signals, where the logarithm of the variance of the wavelet coefficients in each stage progresses linearly. We define an error criterion in the wavelet domain whose minimization yields the optimum inverse filter. We present the error minimization algorithm and the simulation results.
REST Eye for the SOA Guy
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2007)

In the debate over whether to follow Representational State Transfer (REST) or a service-oriented architecture (SOA), the middleground can show the way. Vinoski argues that, even if you believe SOA is exactly the right approach for the applications you develop,truly understanding REST can help you build distributed systems that scale and perform better.
Fast Global Illumination for Visualizing Isosurfaces with a 3D Illumination Grid
Authors: David C. Banks, Kevin Beason
Venue: Computing in Science and Engineering (2007)

Users who examine isosurfaces of their 3D data sets generally view them with local illumination because global illumination is too computationally intensive. By storing the precomputed illumination in a texture map, visualization systems can let users sweep through globally illuminated isosurfaces of their data at interactive speeds.
Will code for hardware
Authors: Nathan Laredo
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Linux is gaining a lot more press these days and causing many companies that once ignored requests for Linux drivers to start hunting down people to write drivers for them. There are a lot of developers that are happy not to get paid money, but to get free hardware in exchange for writing drivers. This is also true for other developers who like to port to new platforms. Manufacturers love it. For a small investment in hardware, they can have free Linux drivers to gain access to the growing millions who run Linux, and those people are in growing numbers emailing manufacturers asking for support. Those with support win big. There are countless people who bought bt848-based tv cards after seeing support for them in their kernels, and back in the earliest days, there's no doubt that Linux spurred some sales of WD80x3 NICs and Adaptec 1542 scsi controllers. Stradis decided they needed drivers for Linux because people asked for them. Then, once Linux was supported, they discovered companies willing to commit to orders of 6000 and 10000 units. The development cycle was very short. This talk will discuss the saga behind the development of this MPEG2 decoder driver and what made it so short, the extensions to the Video4Linux API, and many of the problems involved even with complete technical support from the company that designed the hardware. Panasonic also decided they wanted in on Linux, but the contact did not know the first thing about Linux, yet all the same, full specifications for their DVD-RAM drive were sent and a free drive, and in short order, the drive was functional in Linux. This project will be briefly covered as well.
Knowledge discovery-based identification of musical pitches and instruments in polyphonic sounds
Authors: Rory A. Lewis, Xin Zhang, Zbigniew W. Ra
Venue: Engineering Applications of Artificial Intelligence (2007)

Pitch and timber detection methods applicable to monophonic digital signals are common. Conversely, successful detection of multiple pitches and timbers in polyphonic time-invariant music signals remains a challenge. A review of these methods, sometimes called ''Blind Signal Separation'', is presented in this paper. We analyze how musically trained human listeners overcome resonance, noise, and overlapping signals to identify and isolate what instruments are playing and then what pitch each instrument is playing. The part of the instrument and pitch recognition system, presented in this paper, responsible for identifying the dominant instrument from a base signal uses temporal features proposed by Wieczorkowska [Slezak, D., Synak, P., Wieczorkowska, A., Wroblewski, J., 2002. Kdd-based approach to musical instrument sound recognition. Hacid, M.-S., Ras, Z.W., Zighed, D.A., Kodratoff, Y. (Eds.), Foundations of Intelligent Systems. Proceedings of 13th Symposium ISMIS 2002, Lyon, Franc 4519 Berlin, Heidelberg, pp. 28-36.] in addition to the standard 11 MPEG7 features. After retrieving a semantical match for that dominant instrument from the database, it creates a resulting foreign set of features to form a new synthetic basen signal which no longer bears the previously extracted dominant sound. The system may repeat this process until all recognizable dominant instruments are accounted for in the segment. The proposed methodology incorporates Knowledge Discovery, MPEG7 segmentation and Inverse Fourier Transforms.
Taming the complexity of distributed multimedia applications
Authors: Frank Stajano, Rob Walker
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

The Medusa environment for networked multimedia uses Tcl to compose applications out of low-level processing blocks called modules. A medium-sized application such as a two way multistream videophone already uses around one hundred interworking modules, running in parallel on several host machines. This paper shows how we overcome the inherent complexity of such applications: to deal with parallelism we use a multithreaded library hidden behind a single-threaded Tcl interpreter; to build higher order components than the modules we use the object oriented extension [incr Tcl]; and to exploit the variety of available input and output devices we adopt the Model-View-Controller paradigm.
An Enhanced Perimeter Coverage Based Density Control Algorithm for Wireless Sensor Network
Authors: Shao-feng Jiang, Ming-hua Yang, Han-tao Song, Jie-min Wang
Venue: Proceedings of the Third International Conference on Wireless and Mobile Communications (2007)

In wireless sensor network, one of the main design challenges is to obtain long network lifetime by turning off some redundant nodes while maintaining sufficient sensing coverage and connectivity. In this paper, we investigates the criterion to decide whether a sensor is redundant, and propose a improved method to determine if a sensor is completely covered by its neighbors, especially for boundary sensors. Then we propose an enhanced perimeter coverage based density control algorithm (EPCDC) for large scale sensor networks. Experimental results show that our algorithm outperforms the PEAS algorithm and the Jiang's algorithm with respect to the number of offduty sensors needed, thus extend the network lifetime.
The design of video on demand storage servers
Authors: P. Sumari, H. Kamarulhaili
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Video on demand (VOD) is an electronic video-rental services over a computer network. VOD provides a service to users to browse and watch any videos at any time. In such system, the design of video storage server is a challenging task simply because of real time and large volume characteristics possess by the video. The video server especially its storage subsystem component is responsible to deliver different blocks of video simultaneously to support simultaneous streams. The server also responsible to provide a VCR operation: rewind, fast rewind, forward, fast forward and pause. We present a design of video storage server that capable of producing maximum number of simultaneous streams as well as provide VCR operation. A new video layout is proposed for maximum number of simultaneous stream and coping with VCR operations.
Initialization of deformable templates using weighted Gaussian approximations
Authors: G. Park
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Segmentation followed by shape descriptors represents a common and fundamental approach used in many image processing systems. Active contour models have been used for shape description as a promising method. In particular, the deformable template, which is a kind of active contour model, has been used for various shape description problems. But active contour models, including the deformable template model, suffer from some common difficulties. We propose new approaches in which we represent an object using a weighted Gaussian approximation to find the best candidate template and minimize an appropriately designed cost function to deform the template after finding a best fit candidate in the multiscale representation of the image. This framework can be applied to many real-time applications such as object based video coding, and the estimation of facial features in face recognition.
A min-max test for detecting a transient signal
Authors: Chunming Han
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Page's (1954) test is optimal for detecting a permanent change in the distribution, in the sense that it minimizes the average delay to detection given an average distance between false alarms. When used to detect transient signals, however, it in fact becomes the generalized likelihood ratio test (GLRT). Since a GLRT is in almost all cases ad hoc, Page's test used as such cannot be said to be optimal in any explicit sense. The subject of this paper is the development of the min-max test for the detection of a transient.
An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem
Authors: P. Cowling, G. Kendall, Limin Han
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper investigates a genetic algorithm based hyperheuristic (hyper-GA) for scheduling geographically distributed training staff and courses. The aim of the hyper-GA is to evolve a good-quality heuristic for each given instance of the problem and use this to find a solution by applying a suitable ordering from a set of low-level heuristics. Since the user only supplies a number of low-level problem-specific heuristics and an evaluation function, the hyperheuristic can easily be reimplemented for a different type of problem, and we would expect it to be robust across a wide range of problem instances. We show that the problem can be solved successfully by a hyper-GA, presenting results for four versions of the hyper-GA as well as a range of simpler heuristics and applying them to five test data set.
Engineering design for software: on defining the software engineering profession
Authors: J. L. Diaz-Herrera
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Since the mid-1980s, software engineering has been accepted as a formal field of study in academia. Software engineering education is maturing from specialized courses in computer science, to numerous Master's programs, and more recently to the advent of undergraduate as well as PhD programs. What is new today is the widespread impetus from many fronts to consider software development as engineering profession. The notion of whether software development is engineering can be answered in a number of ways. In this paper, the authors look at generally accepted definitions of engineering and show their correspondence or applicability to software development. They demonstrate through a detailed analysis how prominent features that cut across all engineering disciplines are found in software engineering as well. They conclude with a discussion of the educational implications.
Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
Authors: L. D. Popov
Venue: Automation and Remote Control (2007)

Various schemes are considered of the parallel implementation of the branch and bound method, as applied to multiprocessor computing systems (clusters) with the distributed memory. In the language of informal automata, questions are set out of the organization of the exchange of data and signals within the cluster, which afford the asynchronous operation of its processors. Common ideas are illustrated by the example of the classical traveling salesman problem and data of numerical experiments performed on the multiprocessor computing system-100 (MCS-100) are given.
On the Programming Impact ofMulti-Core,Multi-Processor Nodes inMPI Clusters
Authors: Hossein Pourreza, Peter Graham
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

Increasingly, multi-core processors, multi-processor nodes and multi-core, multi-processor nodes are finding their way into compute clusters. Clusters built using such nodes are already quite common and, inevitably, will become more so over time. As with any new technology, however, the potential benefits are seldom as easy to attain as we expect them to be. In this paper, we explore three fundamental issues related to the use of multi-core, multi-processor nodes in compute clusters using MPI: inter-communication (messaging) efficiency, cache effects (in particular processor affinity) and initial process distribution. Based on some initial experiments using a subset of theNAS parallel benchmarks running on a small scale cluster with dual core, dual processor nodes, we report results on the impact of these issues. From these results we attempt to extrapolate some simple, guidelines that are likely to be generally applicable for optimizingMPI code running on clusters with multicore, multi-processor nodes.
Multicore Processors for Science and Engineering
Authors: Pam Frost Gorder
Venue: Computing in Science and Engineering (2007)

Today, practically every new computer has a dual-core (two-CPU) chip, and Intel just launched a quad-core chip with four CPUs. One of 2006's most in-demand holiday gifts was Sony's PlayStation 3, which boasts a "cell" chip with nine CPUs for faster and more realisticvideo gaming. Multicore systems might offer advantages to gamers, but what about researchers? Making the most of multicore systems will require new tools, new algorithms, and a new way of looking at programming.
Beamspace techniques for hot clutter cancellation
Authors: S. M. Kogon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

In airborne radar applications, hot clutter refers to terrain-reflected jammer multipath interference which is spatially distributed throughout the mainbeam and sidelobes of the radar receiver. Most current cancellation methods use a single reference beam to cancel the mainbeam hot clutter interference. However these cancellers are computationally intensive and suffer from blind interval effects due to the size of the temporal window required for effective mitigation. We propose a full beamspace canceller implemented as a generalized sidelobe canceller for hot clutter mitigation. The proposed canceller exploits the spatial nature of the interference by utilizing delayed replicas of the jammer signal at all azimuth angles to significantly reduce the temporal extent of the canceller. By trading off temporal for spatial degrees of freedom, the full beamspace approach is able to drastically reduce the size of the temporal window required, achieving effective cancellation with fewer total degrees of freedom and a significant reduction in the blind interval. Results comparing the proposed full beamspace and the single-beam cancellers are reported using data collected in the Mountaintop program.
Analyzing pre-fetching in large-scale visual simulation
Authors: C.-M. Ng, C.-T. Nguyen, D.-N. Tran, T.-S. Tan
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper studies pre-fetching mechanisms that support walkthroughs of virtual environments with overall data sizes exceeding current core memory capacities of PCs. Specifically, it formulates the pre-fetch problem using motion characteristics of the viewer, the data density of the virtual environment, and the data transfer capability of the disk. It further analyzes two fundamental classes of pre-fetching schemes, which are classified by their uses of certain pre-assigned spatial or temporal thresholds. The analysis is supported and verified by experiments on terrain walkthroughs performed on different configurations of PCs. An interesting finding is the understanding of how the terrain data density supportable is a function of the duration of time allocated to disk-level pre-fetching. On the whole, this paper provides a methodology for analyzing prefetch performance as well as presents insights instrumental in the design and optimization of out-of-core walkthrough systems.
Attribute-Based COTS Product Interoperability Assessment
Authors: Jesal Bhuta, Barry Boehm
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Software systems today are frequently composed from prefabricated commercial components that provide complex functionality and engage in complex interactions. Such projects that utilize multiple commercial-off-the-shelf (COTS) products often confront interoperability conflicts resulting in budget and schedule overruns. These conflicts occur because of the incompatible assumptions made by developers of these products. Identification of such conflicts and planning strategies to resolve them is critical for developing such systems under budget and schedule constraints. Unfortunately, acquiring information to perform interoperability analysis is a time-intensive process. Moreover, increase in the number of COTS products available to fulfill similar functionality leads to hundreds of COTS product combinations, further complicating the COTS interoperability assessment landscape. In this paper we present a set of attributes that can be used to define COTS interoperabilityspecific characteristics. COTS product definitions based on these attributes can be used to perform highlevel and automated interoperability assessment to filter out COTS product combinations whose integration will not be feasible within project constraints. In addition to above stated attributes, we present a tool that can be used to assess COTS-based architectures for interoperability conflicts, reducing the overall effort spent in performing interoperability analysis. Our preliminary experience in using the framework indicates an increase in interoperability assessment productivity by 50% and accuracy by 20%.