ppxscal/embedding_network huggingface dataset:
Modeling the Clickstream: Implications for Web-Based Advertising Efforts
Authors: Patrali Chatterjee, Donna L. Hoffman, Thomas P. Novak
Venue: Marketing Science (2003)

In this paper, we develop an analytical approach to modeling consumer response to banner ad exposures at a sponsored content Web site that reveals significant heterogeneity in (unobservable) click proneness across consumers. The effect of repeated exposures to banner ads is negative and nonlinear, and the differential effect of each successive ad exposure is initially negative, though nonlinear, and levels off at higher levels of passive ad exposures. Further, significant correlations between session and consumer click proneness and banner exposure sensitivity suggest gains from repeated banner exposures when consumers are less click prone. For a particular number of sessions, more clicks are generated from consumers who revisit over a longer period of time, than for those with the same number of sessions in a relatively shorter timeframe. We also find that consumers are equally likely to click on banner ads placed early or late in navigation path and that exposures have a positive cumulative effect in inducing click-through in future sessions. Our results have implications for online advertising response measurement and dynamic ad placement, and may help guide advertising media placement decisions.
Perpetuality in a named lambda calculus with explicit substitutions
Authors: Eduardo Bonelli
Venue: Mathematical Structures in Computer Science (2001)

We study perpetuality in the calculus of explicit substitutions &lambda;x. A reduction is called perpetual if it preserves the possibility of infinite reduction sequences. We then take a look at applications of this study: an inductive characterization of the &lambda;x-strongly normalizing terms, two perpetual reduction strategies for &lambda;x and finally a proof of strong normalization of a polymorphic lambda calculus with explicit substitutions Fes. To complete the study of Fes, the property of subject reduction is shown to hold by extending type assignments of the typing rules to allow non-pure types (types with possible occurrences of the type substitution operator).
Experiments with random projections for machine learning
Authors: Dmitriy Fradkin, David Madigan
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computational advantages. In this paper we report a number of experiments to evaluate Random Projections in the context of inductive supervised learning. In particular, we compare Random Projections and PCA on a number of different datasets and using different machine learning methods. While we find that the random projection approach predictively underperforms PCA, its computational advantages may make it attractive for certain applications.
On Increasing Subsequences of I.I.D. Samples
Authors: Jean-Dominique Deuschel, Ofer Zeitouni
Venue: Combinatorics, Probability and Computing (1999)

We study the fluctuations, in the large deviations regime, of the longest increasing sub-sequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of the longest increasing subsequence of a random permutation.
Capturing user tests in a multimodal, multidevice informal prototyping tool
Authors: Anoop K. Sinha, James A. Landay
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Interaction designers are increasingly faced with the challenge of creating interfaces that incorporate multiple input modalities, such as pen and speech, and span multiple devices. Few early stage prototyping tools allow non-programmers to prototype these interfaces. Here we describe CrossWeaver, a tool for informally prototyping multimodal, multidevice user interfaces. This tool embodies the informal prototyping paradigm, leaving design representations in an informal, sketched form, and creates a working prototype from these sketches. CrossWeaver allows a user interface designer to sketch storyboard scenes on the computer, specifying simple multimodal command transitions between scenes. The tool also allows scenes to target different output devices. Prototypes can run across multiple standalone devices simultaneously, processing multimodal input from each one. Thus, a designer can visually create a multimodal prototype for a collaborative meeting or classroom application. CrossWeaver captures all of the user interaction when running a test of a prototype. This input log can quickly be viewed visually for the details of the users' multimodal interaction or it can be replayed across all participating devices, giving the designer information to help him or her analyze and iterate on the interface design.
Nonlinear instabilities in computer network dynamics
Authors: Priya Ranjan
Venue:  (2003)

This work studies two types of computer networking models. The primary focus is to understand the different dynamical phenomena observed in practice due to the presence of severe nonlinearities, delays and widely varying operating conditions. The first models considered are of senders running TCP (Transmission Control Protocol) and traffic passing through RED (Random Early Detection) gateways. Building on earlier work, a first order nonlinear discrete-time model is developed for the interaction scenario between transport protocols like TCP and UDP (User Datagram Protocol) and Active Queuing Management schemes like RED. It is shown that the dynamics resulting from the interaction with TCP is consistent with various dynamical behaviors and parameter sensitivities observed in practice. Using bifurcation-theoretic ideas it is shown that TCP-RED type networks may lose their stability through a period doubling bifurcation followed by border collision bifurcations. The nonlinear dependence of the throughput function of TCP-type flows on drop probability is found to be responsible for the period doubling bifurcation, whereas limited buffer space and lack of sufficient damping results in border collision bifurcations. Using the &ldquo;period three implies chaos&rdquo; theorem of Li and Yorke the existence of chaos is proved and the phenomenon is shown to occur as different parameters are varied. Observation of period doubling bifurcation in the model leads to ideas for using feedback control to extend the region of stable operation in the parameter space. Using earlier work on control of period doubling bifurcations, a washout filter based control is proposed. A second class of models studied in this work deals with optimal rate control in networks and are based on the rate-control framework proposed by Kelly. Using the results on delay-differential equation stability, the stability and its lack thereof is studied through an underlying map which arises naturally in time delay systems. An invariance property of this map is used to prove delay-independent stability and to compute bounds on periodic oscillations. In particular, it is shown that the sender's utility and the receiver's price functions, both are responsible for the dynamical behavior of the system. Instability results indicate that the system again loses stability through a period doubling bifurcation resulting in oscillations. These oscillations are well understood in the Mathematics community and are known as &ldquo;slowly oscillating periodic (SOP)&rdquo; orbits. It is also argued that these periodic orbits will be observed in networking and network-based control systems more often.
Ultrathin HfO2films grown on Silicon by atomic layer deposition for advanced gate dielectrics applications
Authors: E. P. Gusev, C. Cabral,  Jr., M. Copel, C. D'Emic, M. Gribelyuk
Venue: Microelectronic Engineering (2003)

We report on growth behavior, structure, thermal stability and electrical properties of ultrathin (<10 nm) hafnium oxide films deposited by atomic layer deposition using sequential exposures of HfCl4 and H2O at 300°C on a bare silicon surface or a thin thermally grown SiO2-based interlayer. Compared to good quality continuous films deposited on SiO2 surfaces, HfO2 deposited on HF-last treated Si surfaces show a non-uniform, island-like morphology and poor electrical properties due to poor nucleation on H-terminated Si. As-deposited films have a significant amorphous component and undergo crystallization to a monoclinic phase above ∼500°C. Crystallization behavior is found to be dependent on film thickness with higher crystallization temperatures for thinner films. HfO2 on an ultrathin SiO2 interlayer shows good electrical properties with gate leakage current reduced by a factor of 103 -104 with respect to conventional SiO2 gate dielectrics which justifies its consideration as a candidate for high-K dielectric for future CMOS devices.
Monadic datalog and the expressive power of languages for Web information extraction
Authors: Georg Gottlob, Christoph Koch
Venue: Journal of the ACM (JACM) (2004)

Research on information extraction from Web pages (wrapping) has seen much activity recently (particularly systems implementations), but little work has been done on formally studying the expressiveness of the formalisms proposed or on the theoretical foundations of wrapping. In this paper, we first study monadic datalog over trees as a wrapping language. We show that this simple language is equivalent to monadic second order logic (MSO) in its ability to specify wrappers. We believe that MSO has the right expressiveness required for Web information extraction and propose MSO as a yardstick for evaluating and comparing wrappers. Along the way, several other results on the complexity of query evaluation and query containment for monadic datalog over trees are established, and a simple normal form for this language is presented. Using the above results, we subsequently study the kernel fragment Elog&minus; of the Elog wrapping language used in the Lixto system (a visual wrapper generator). Curiously, Elog&minus; exactly captures MSO, yet is easier to use. Indeed, programs in this language can be entirely visually specified.
Transitive cycle factorizations and prime parking functions
Authors: Dongsu Kim, Seunghyun Seo
Venue: Journal of Combinatorial Theory Series A (2003)

Minimal transitive cycle factorizations and parking functions are related very closely. Using the correspondence between them, we find a bijection between minimal transitive factorizations of permutations of type (1, n - 1) and prime parking functions of length n.
Auditory, graphical and haptic contact cues for a reach, grasp, and place task in an augmented environment
Authors: Mihaela A. Zahariev, Christine L. MacKenzie
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

An experiment was conducted to investigate how performance of a reach, grasp and place task was influenced by added auditory and graphical cues. The cues were presented at points in the task, specifically when making contact for grasping or placing the object, and were presented in single or in combined modalities. Haptic feedback was present always during physical interaction with the object. The auditory and graphical cues provided enhanced feedback about making contact between hand and object and between object and table. Also, the task was performed with or without vision of hand. Movements were slower without vision of hand. Providing auditory cues clearly facilitated performance, while graphical contact cues had no additional effect. Implications are discussed for various uses of auditory displays in virtual environments.
A decision support methodology for stochastic multi-criteria linear programming using spreadsheets
Authors: David C. Novak, Cliff T. Ragsdale
Venue: Decision Support Systems (2003)

In recent years, tools for solving optimization problems have become widely available through the integration of optimization software (or solvers) with all major spreadsheet packages. These solvers are highly effective on traditional linear programming (LP) problems with known, deterministic parameters. However, thoughtful analysts may rightly question the quality and robustness of optimal solutions to problems where point estimates are substituted for model parameters that are stochastic in nature. Additionally, while many LP problems implicitly involve multiple objectives, current spreadsheet solvers provide no convenient facility for dealing with more than one objective. This paper introduces a decision support methodology for identifying robust solutions to LP problems involving stochastic parameters and multiple criteria using spreadsheets.
Erratum
Authors: Computational Linguistics Staff
Venue: Computational Linguistics (1994)

On page 10 of Mark Johnson's "Computing with Features as Formulae" in Computational Linguistics 20:1, the third sentence of the first paragraph should read "Blackburn et al. (1993) introduce a modal language LT for describing trees decorated with feature structures, whose satisfiability problem is decidable." We regret the error. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Introducing information systems students to research with a structured group project
Authors: Tanya McGill
Venue: Current issues in IT education (2003)

This chapter reports on an approach to getting information systems research students started. The approach involves beginning research students undertaking a structured group research project in which the instructor is an active participant. The major purpose of this group project is to provide a gentle, supportive, structured introduction to information systems research. This approach benefits students by ensuring that they have participated in a complete research project before they have to assume complete responsibility for their first large individual project. The chapter discusses the use of this approach at an Australian university. In general, students have participated well, learning from their own experiences and the experiences of others in the group.
Probabilistic belief logic and its probabilistic aumann semantics
Authors: Zi Ning Cao, Chun Yi Shi
Venue: Journal of Computer Science and Technology (2003)

In this paper, we present a logic system for probabilistic belief named PBL, which expands the language of belief logic by introducing probabilistic belief. Furthermore, we give the probabilistic Aumann semantics of PBL. We also list some valid properties of belief and probabilistic belief, which form the deduction system of PBL. Finally, we prove the soundness and completeness of these properties with respect to probabilistic Aumann semantics.
EDITORIAL
Authors: Leigh Landy
Venue: Organised Sound (2001)

This issue of Organised Sound is devoted to a conference, &lsquo;Music without Walls? Music without Instruments&rsquo;, which took place at De Montfort University, Leicester, UK in June of this year. It was hosted by the university's Music, Technology and Innovation Research Group. As one can easily discover, given the conference's title, the goal of this meeting was to investigate vision and plans for the future. The three-day event included papers, musical events, installations, demonstrations and a plenary. All artists whose pieces were selected for the conference concerts were requested to present vision papers to accompany their performance.
A framework for heading-guided recognition of human activity
Authors: Rómer Rosales, Stan Sclaroff
Venue: Computer Vision and Image Understanding (2003)

A combined 2D, 3D approach is presented that allows for robust tracking of moving people and recognition of actions. It is assumed that the system observes multiple moving objects via a single, uncalibrated video camera. Low-level features are often insufficient for detection, segmentation, and tracking of non-rigid moving objects. Therefore, an improved mechanism is proposed that integrates low-level (image processing), mid-level (recursive 3D trajectory estimation), and high-level (action recognition) processes. A novel extended Kalman filter formulation is used in estimating the relative 3D motion trajectories up to a scale factor. The recursive estimation process provides a prediction and error measure that is exploited in higher-level stages of action recognition. Conversely, higher-level mechanisms provide feedback that allows the system to reliably segment and maintain the tracking of moving objects before, during, and after occlusion. Heading-guided recognition (HGR) is proposed as an efficient method for adaptive classification of activity. The HGR approach is demonstrated using "motion history images" that are then recognized via a mixture-of-Gaussians classifier. The system is tested in recognizing various dynamic human outdoor activities: running, walking, roller blading, and cycling. In addition, experiments with real and synthetic data sets are used to evaluate stability of the trajectory estimator with respect to noise.
Mining Production Data with Neural Network & CART
Authors: Mingkun Li, Shuo Feng, Ishwar K. Sethi, Jason Luciow, Keith Wagner
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

This paper presents the preliminary results of a datamining study of a production line involving hundreds ofvariables related to mechanical, chemical, electrical andmagnetic processes involved in manufacturing coatedglass. The study was performed using two nonlinear,nonparametric approaches, namely neural network andCART, to model the relationship between the qualities ofthe coating and machine readings. Furthermore, neuralnetwork sensitivity analysis and CART variable rankingswere used to gain insight into the coating process. Ourinitial results show the promise of data mining techniquesto improve the production.
A First Look at the Performance of Autonomous Mobile Agents in Dynamic Networks
Authors: Christian Erfurth, Arndt Döhler, Wilhelm Rossak
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Mobile agents can be seen as a new paradigm for distributed computing. At Friedrich Schiller University, we have developed our own mobile agent system, called Tracy. Tracy is implemented in Java 2. One characteristic of mobile agents is their autonomy and pro-activity. We designed a framework on top of Tracy to support our research in this domain. Our framework consists of three modules. The Map Module collects information on the available network of agent servers (agencies). By this means, a mobile agent is able to locate services within the network. Furthermore, the framework provides a route planning module and an optimization module, which minimizes network load respectively transmission time. These modules support a fast and ef.cient navigation through the network, which is an environment with an inherently dynamical behavior. The basis for this project is the Tracy Domain Service, which is a hierarchical arrangement of agent servers that groups agencies into a federation of networked local clusters, so called domains.The focus of the paper is to evaluate the basic concepts and the actual modules of this framework. We made some measurements to characterize the modules' quality and to identify problems. Furthermore, we take a .rst look at the possible performance enhancement of mobile agents which are using the framework.
Strategies of distributed genetic algorithms for three-dimensional bin packing in a sls machine
Authors: Rammohan K. Ragade, Anup Kumar
Venue:  (2003)

This dissertation details the creation of three distributed genetic algorithms used for bin packing in a Selective Laser Sintering (SLS) machine that is used for rapid prototyping. The three different distributed genetic algorithms were implemented: a distributed chromosome, a multiple copy server, and a hybrid. This dissertation demonstrates that using a distributed chromosome implementation reduces the execution time of a genetic algorithm. It also demonstrates that using a hybrid distributed implementation or a multiple copy server implementation produces better fitness values. Both were statistically tested and verified with an experimental design. The space and time complexity was also calculated for the sequential genetic algorithm as well as each of the three distributed genetic algorithm implementations. Several test cases were executed to validate the theoretical time and space complexities with different number of parts packed in the SLS build cylinder. In addition, this dissertation also demonstrates that a hybrid distributed genetic algorithm or a multiple copy server genetic algorithm has less dependence on the value of the probability of crossover and the probability of mutation. This is due to the fact that the hybrid or multiple copy genetic algorithms have the ability to use multiple probability values simultaneously.
Evaluating Semantic Warnings in VoIP Programmable Services with Open Source Environment
Authors: Pattara Leelaprute, Masahide Nakamura, Ken-ichi Matsumoto, Tohru Kikuno
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

The programmable service for Internet telephony (VoIP)allows end-users or third parties to define their own customizedservices. However, it imposes a serious drawbackthat service description created by end-users is likely tocontain problems that are semantically ambiguous or inconsistent.To cope with this problem, we have so far proposedsemantic warnings, which are the guidelines to guaranteethe semantic correctness for the CPL (Call ProcessingLanguage) programmable service environment.In this paper, we evaluate the proposed semantic warningswith practical VoIP system, VOCAL (Vovida OpenCommunication Application Library). In the experiment,the proposed warnings revealed a semantic redundancy ina ready-made feature of VOCAL. It is also shown that customizedfeatures containing the semantic warnings often ledVOCAL to problematic situations. Thus, the proposed warningscan help feature provisioning system to detect semanticflaws in programmable service environment.
A new optimization criterion for generalized discriminant analysis on undersampled problems
Authors: Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

A new optimization criterion for discriminant analysis ispresented. The new criterion extends the optimization criteriaof the classical linear discriminant analysis (LDA) byintroducing the pseudo-inverse when the scatter matricesare singular. It is applicable regardless of the relative sizesof the data dimension and sample size, overcoming a limitationof the classical LDA. Recently, a new algorithm calledLDA/GSVD for structure-preserving dimension reductionhas been introduced, which extends the classical LDA tovery high-dimensional undersampled problems by using thegeneralized singular value decomposition (GSVD). The solutionfrom the LDA/GSVD algorithm is a special case of thesolution for our generalized criterion in this paper, which isalso based on GSVD.We also present an approximate solution for our GSVD-basedsolution, which reduces computational complexity byfinding sub-clusters of each cluster, and using their centroidsto capture the structure of each cluster. This reducedproblem yields much smaller matrices of which the GSVDcan be applied efficiently. Experiments on text data, withup to 7000 dimensions, show that the approximation algorithmproduces results that are close to those produced bythe exact algorithm.