ppxscal/embedding_network huggingface dataset:
Mixtures of hierarchical topics with Pachinko allocation
Authors: David Mimno, Wei Li, Andrew McCallum
Venue: Proceedings of the 24th international conference on Machine learning (2007)

The four-level pachinko allocation model (PAM) (Li & McCallum, 2006) represents correlations among topics using a DAG structure. It does not, however, represent a nested hierarchy of topics, with some topical word distributions representing the vocabulary that is shared among several more specific topics. This paper presents hierarchical PAM---an enhancement that explicitly represents a topic hierarchy. This model can be seen as combining the advantages of hLDA's topical hierarchy representation with PAM's ability to mix multiple leaves of the topic hierarchy. Experimental results show improvements in likelihood of held-out documents, as well as mutual information between automatically-discovered topics and humangenerated categories such as journals.
Inferring internet denial-of-service activity
Authors: David Moore, Geoffrey M. Voelker, Stefan Savage
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

In this paper, we seek to answer a simple question: "How prevalent are denial-of-service attacks in the Internet today?". Our motivation is to understand quantitatively the nature of the current threat as well as to enable longer-term analyses of trends and recurring patterns of attacks. We present a new technique, called "backscatter analysis", that provides an estimate of worldwide denial-of-service activity. We use this approach on three week-long datasets to assess the number, duration and focus of attacks, and to characterize their behavior. During this period, we observe more than 12,000 attacks against more than 5,000 distinct targets, ranging from well known e-commerce companies such as Amazon and Hotmail to small foreign ISPs and dial-up connections. We believe that our work is the only publically available data quantifying denial-of-service activity in the Internet.
Using mobile code interfaces to control ubiquitous embedded systems
Authors: Kari Kangas, Juha Röning
Venue: Proceedings of the Workshop on Embedded Systems on Workshop on Embedded Systems (1999)

Devices controlled by embedded computers are becoming an integral part of our everyday life, as processor and memory capacities continue to increase while their cost decreases. In some embedded systems, however, the limited input and output capacities are beginning to restrict the design of complex functionality. Furthermore, as wireless communication devices are becoming commonplace even in embedded systems, the communication and interoperation between different systems will be increasingly important in the future. This paper describes a flexible, yet powerful concept that explains how a mobile code can be conveniently utilized by mobile users to control ubiquitous and diverse embedded systems in different environments. Apart from providing flexibility, the concept also aims to keep the embedded systems as simple as possible. We will illustrate the concept by presenting as an example a virtual user interface for a videocassette recorder. We will also discuss the possible benefits and drawbacks of the system. The concept described here can be extended to allow the mobile code to be used as interconnecting "glue" in diverse embedded systems. This glue could connect systems from several manufacturers to create smart environments that can be controlled by a single simple device.
Towards efficient tracking of inertial particles with high-order multidomain methods
Authors: G. B. Jacobs, D. A. Kopriva, F. Mashayek
Venue: Journal of Computational and Applied Mathematics (2007)

This paper develops an efficient particle tracking algorithm to be used in fluid simulations approximated by a high-order multidomain discretization of the Navier-Stokes equations. We discuss how to locate a particle's host subdomain, how to interpolate the flow field to its location, and how to integrate its motion in time. A search algorithm for the nearest subdomain and quadrature point, tuned to a typical quadrilateral isoparametric spectral subdomain, takes advantage of the inverse of the linear blending equation. We show that to compute particle-laden flows, a sixth-order Lagrangian polynomial that uses points solely within a subdomain is sufficiently accurate to interpolate the carrier phase variables to the particle position. Time integration of particles with a lower-order Adams-Bashforth scheme, rather than the fourth-order Runge-Kutta scheme often used for the integration of the carrier phase, increases computational efficiency while maintaining engineering accuracy. We verify the tracking algorithm with numerical tests on a steady channel flow and an unsteady backward-facing step flow.
Head and Neck Cancer Detection in Histopathological Slides
Authors: Mutlu Mete, Xiaowei Xu, Chun-Yang Fan, Gal Shafirstein
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Histopathology, one of the most important routines of all laboratory procedures used in pathology, is critical for the diagnosis of cancer. Experienced pathologists read the histological slides acquired from biopsy specimen in order to outline malignant areas. Recently, in terms of histological image analysis the improvements in imaging techniques led to the discovery of virtual histological slides In this technique, a special microscope scans a glass slide and generates a virtual slide at a resolution of 0.25 ìm/pixel. Output images are of sufficiently high quality to generate immense interest within the research community. Since the recognition of cancer areas are time consuming and error prone, in this paper we describe a new method for automatic squamous cell carcinoma, known as head-neck cancer, detection using very large digital histological slides. The density-based clustering algorithm (DBSCAN) plays a key role in the determination of the corrupted cell nuclei. Using the Support Vector Machine (SVM) Classifier, the experimental results on seven head-neck slides show that the proposed algorithm performed well, obtaining an average of 96% accuracy. The classifier performance is evaluated using the standard precision and recall measures, as well as predictive accuracy.
Leveraging Integrated IS for Competitive Advantage
Authors: Vincenzo Morabito, Marinos Themistocleous
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This research, draws upon an integrative model of IT business value, examines the mediating effect of an "IT organizational assimilation capacity" between IS integration and organization competitive advantage. Using a large-scale sample survey where responses were obtained from CIOs and senior business executives, we provide robust evidence of the "IT organizational assimilation capacity" mediating role. An interesting result of this research shows that the firm size was not found to be of significant influence. The implications of these findings extend the boundary of current literature on the dynamics of IT business value and contribute theory-based conceptual synthesis and empirical evidence to an IT/IS literature.
Statistical behavior of wavelet transmultiplexers in arbitrary synchronization states
Authors: M. J. Lyall
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Wavelet transmultiplexers based on orthogonal perfect reconstruction filter banks can play a role in channel encoding for digital communications. Synchronization of the receive end of the transmultiplexer is needed for reliable communication, imposing certain requirements for acquisition and tracking. Consequently, the response of the transmultiplexer in out-of-synchronization states is of interest in developing ways to acquire and track. We prove that a two-band, J-stage wavelet transmultiplexer based on a perfect reconstructing, orthonormal filter bank maps stationary, uncorrelated white input processes into stationary, zero-mean, uncorrelated white output processes, independent of the synchronization state.
Middleware design optimization of wireless protocols based on the exploitation of dynamic input patterns
Authors: Stylianos Mamagkakis, Dimitrios Soudris, Francky Catthoor
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Today, wireless networks are moving big amounts of data between mobile devices, which have to work in an ubiquitous computing environment, which perpetually changes at run-time (i.e., nodes log on and off, varied user activity, etc.). These changes introduce problems that can not be fully analyzed at design-time and require dynamic (runtime) solutions. These solutions are implemented with the use of run-time resource management at the middleware level for a wide variety of embedded systems. In this paper, we motivate and propose the characterization of the dynamic inputs of wireless protocols (e.g., input to the IEEE 802.11b protocol coming from IPv4 data fragmentation). Thus, through statistical analysis we derive patterns that will guide our optimization process of the middleware for run-time resource management design. We assess the effectiveness of our approach with inputs of 18 real life case studies of wireless networks. Finally, we show up to 81.97% increase in the performance of the proposed design solution compared to the state-of-the-art solutions, without compromising memory footprint or energy consumption.
Distance learning in courses with a laboratory
Authors: K. D. Taylor
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Distance learning has gained in popularity not only as a way to offer instruction in locations without local expertise, but also as a cost-effective method where limited enrolment at one location would not normally warrant offering the course. In engineering technology programs, where most courses have a lab component, distance learning offers many new challenges in course delivery. This paper discusses the authors' experiences with distance learning in two electrical engineering technology courses, each with a lab component. One course offered via the Indiana Higher Education Telecommunication System used one-way video and two-way audio for the lecture. The professor lectured to 16 students locally, and to two remote sites with three and five students, respectively. Each remote site had a lab instructor who was a member of the faculty at that campus, but neither were familiar with the subject matter prior to the course offering. Due to scheduling conflicts, the involvement of the coordinators was different. One instructor had another class to teach during the lecture broadcast, while the other attended the lectures and completed many of the assignments. A second scenario involving distance learning is using video-taped lectures with remote lab instructors. We present two models. In one case, the lab was taught by an instructor who had taught the lab at the originating site. In the other case, the instructor had some knowledge of the material but no experience with the lab exercises. We make suggestions on ways to improve the delivery of both the lecture and local offering of the distance course lab.
Interpreting and Extending an Analytical Battery Model Using an Iterative Computation Method
Authors: Nenggan Zheng, Zhaohui Wu, Man Lin, Qijia Wang
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In this paper, we present an iterative computing method to illustrate the discharge, recovery and charge process of general lithium/lithium-ion batteries. The discharge and recovery processes correspond well to an existing accurate analytical battery model: the RV- W's analytical model, and thus interpret this model algorithmically. Our method also extends R-V-W's model to accommodate the charge process. The work will help the system designers to grasp the characteristics of R-V-W's battery model. Experiments are performed on a variety of load profiles to show the accuracy of the extended model by comparing the predicted charge time with that derived from the DUALFOIL simulations.
A Hierarchical and Distributed Handover Management Approach for Heterogeneous Networking Environments
Authors: Lucian Suciu, Karine Guillouard
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

There is a wide consensus concerning the fact that future networks will follow the All-IP paradigm. However, for accessing these All-IP networks there are myriads of radio options as we have witnessed a rapid development of several wireless technologies, some of them being complementary while others competing in terms of QoS, security or cost. Within this heterogeneous environment we should strive to be "Always Best Connected", anytime, anywhere. Nonetheless, the ABC concept is quite a generic vision as the actors involved in the access selection process may sometimes have contradictory viewpoints. Thus, to meet the goals of the ABC vision, our work concentrates on distributing the handover decision function over multiple entities within networks and the end-terminals; our approach allows the dynamic construction of a handover decision chain in a hierarchical and distributed manner and for each (user, application's flow) 2-tuple; when selecting the "best" access option we take into account comprehensive policies and parameters related to access networks, applications, users and operators.
Information Management for Dynamic Networks
Authors: Kostas Pentikousis, Raffaele Giaffreda, Eleanor Hepworth, Ramon Aguero, Alex Galis
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

The proliferation of mobile devices and the bundling of several network access technologies in a single product have increased considerably the communication environment complexity. There has been a certain drive for allowing end users to be "best-connected" anywhere, anytime, which places an additional set of stringent requirements on the already over-engineered domain of mobile computing. This rapidly increasing computational complexity is reinforced by the mounting number of wirelessly connected mobile devices and, therefore, network solutions are sought after with several self-X properties (self-configuration, - adaptation, and -management, to name a few). Such networks will require services that reliably cater the latest information aiming at simplifying and fostering autonomic decision-making. We introduce the Dynamic Networks Information Service Infrastructure (DNISI), an application of the information service architecture developed in the Ambient Networks project. We present how DNISI supports both enhanced mobility management and context-aware communications in today's pervasive networking environments by providing the means for gathering, correlating, and managing cross-layer and cross-domain information. Finally, we explain how service platform components and end-users applications can benefit in the near-term.
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness
Authors: Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
Venue: Computational Complexity (2006)

We prove that two-party randomized communication complexity satisfies a strong direct product property, so long as the communication lower bound is proved by a "corruption" or "one-sided discrepancy" method over a rectangular distribution. We use this to prove new n ¿(1) lower bounds for 3-player number-on-the-forehead protocols in which the first player speaks once and then the other two players proceed arbitrarily. Using other techniques, we also establish an ¿(n 1/(k¿1)/(k ¿ 1)) lower bound for k-player randomized number-on-the-forehead protocols for the disjointness function in which all messages are broadcast simultaneously. A simple corollary of this is that general randomized number-on-the-forehead protocols require ¿(log n/(k ¿ 1)) bits of communication to compute the disjointness function.
The Internet of Things - Context-based Device Federations
Authors: Andreas Heil, Mirko Knoll, Torben Weis
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Locating physical devices and accessing their functionality in pervasive environments is strongly restricted by their locality. Since there are more and more devices available, waiting to serve users, a simple way is required to access, connect, and most important to locate them in the real world. In this paper we propose an approach to connect and access arbitrary devices by federating them related to their geographical location. This approach allows us to create context-aware federations of devices - the internet of things.
A combined Kalman filter and constant modulus algorithm beamformer for fast-fading channels
Authors: W. Pora
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Beamformers which use only the constant modulus algorithm (CMA) are unable to track properly time-variant signals in fast-fading channels. The Kalman kilter (KF), however, has significant advantage in time-varying channels but needs a training sequence to operate. A combined CMA and KF algorithm is therefore proposed in order to utilise the advantages of both algorithms. The associated stepsize of the combination is also varied in accordance with the magnitude of the output. Simulations are presented to demonstrate the potential of this new approach.
Rejection based on a posteriori probability estimated by MLP with application for Mandarin voice dialer on ASIC
Authors: Lin Zhong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

High performance Mandarin voice dialer is much more difficult than its English counterpart to achieve, especially on inexpensive hardware as ASIC. One way to improve its performance is to incorporate rejecters into the system. In our study, an MLP based postprocessor, an a posteriori probability estimator, is applied after HMM Viterbi recognition. Poor utterances, which are recognized by HMMs but have low a posteriori probability, are then rejected. Rejecting 4.9% of all the testing utterances, the MLP rejector boosts the HMM-based system's single digit accuracy from 97.1% to 99.6% for the Mandarin voice dialer, a ten-syllable speaker independent task. The performance is better than those of rejection based on linear discrimination, anti-digit models or likelihood ratio.
OO development life cycle-a videotaped teaching resource
Authors: I. Tomek
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Object-oriented technology (OOT), a shift of focus from programming concepts towards the software development process have taken hold in both the academic and industrial sectors. This shift and the lack of formal background and practical experience with the new techniques lead to a certain confusion among instructors. A lack of teaching resources to overcome this gap has been identified as one of the main problems in teaching object-oriented technology. To deal with this problem, the authors have prepared a script for creating a mixed-media teaching resource for presenting the OO development life cycle in a simplified but realistic setting, and gathered material for a prototype based on this script. In this paper, they explain their goals, describe their approach, outline the current state of the project and describe what they have learned.
Optimal Routing Algorithms for Generalized de Bruijn Digraphs
Authors: Guoping Liu, Kyungsook Y. Lee
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

Generalized de Bruijn digraph, G_{B}(d,n), was proposed independently by Imase and Itoh, and Reddy, Pradhan and Kuhl to include any number of nodes. Du and Hwang showed that G_{B}(d, n) essentially retains all the nice properties of de Bruijn digraphs, and presented a \left\lceil {\log _d n} \right\rceil -step routing algorithm, where d is the indegree and outdegree, and n is the number of nodes in the graph.
Key evolution-based tamper resistance: a subgroup extension
Authors: Hongxia Jin, Ginger Myles, Jeffrey Lotspiech
Venue: Proceedings of the 2nd ACM symposium on Information, computer and communications security (2007)

The number and magnitude of hostile attacks against software has drastically increased. One class of attacks of particular concern to the software industry is tampering to circumvent protection technologies such as license checks. A variety of hardware- and software-base techniques have been developed to address the issue. These include, but are not limited to, dongles, smartcards, and code obfuscation. In this paper we examine two previously proposed software-based tamper resistance techniques which are both based on the same key evolution mechanism: Event Log-Based and Branch-Based tamper resistance. As proposed the techniques offer many advantages over other software-based algorithms, however, they still suffer from a common limitation. Through our analysis we identify this limitation and propose an extension to the schemes which improves the overall strength.
A Comparative Study on 2D Curvature Estimators
Authors: Simon Hermann, Reinhard Klette
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Curvature is a frequently used property in two-dimensional (2D) shape analysis, directly or for derived features such as corners or convex and concave arcs. This paper presents curvature estimators which follow approaches in differential geometry. Digital-straight segment approximation (as known from digital geometry) is used in those estimators. Results of multigrid experiments are evaluated leading to a comparative performance analysis of several curvature estimators.
Run-Time Support for Optimizations Based on Escape Analysis
Authors: Thomas Kotzmann, Hanspeter Mossenbock
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector when it is not referenced any longer. Under certain conditions, the virtual machine can allocate objects on the stack or eliminate their allocation via scalar replacement. However, even if the dynamic compiler guarantees that the conditions are fulfilled, the optimizations require support by the run-time environment. We implemented a new escape analysis algorithm for Sun Microsystems' Java HotSpotTM VM. The results are used to replace objects with scalar variables, to allocate objects on the stack, and to remove synchronization. This paper deals with the representation of optimized objects in the debugging information and with reallocation and garbage collection support for a safe execution of optimized methods. Assignments to fields of parameters that can refer to both stack and heap objects are associated with an extended write barrier which skips card marking for stack objects. The traversal of objects during garbage collection uses a wrapper that abstracts from stack objects and presents their pointer fields as root pointers to the garbage collector. When a previously compiled and currently executing method must be continued in the interpreter because dynamic class loading invalidates the machine code, execution is suspended and compiler optimizations are undone. Scalar-replaced objects are reallocated on the heap lazily when control returns to the invalidated method, whereas stack-allocated objects must be reallocated immediately before program execution resumes. After reallocation, objects for which synchronization was removed are relocked.