ppxscal/embedding_network huggingface dataset:
Genericity - a "Missing in Action" Key to Software Simplification and Reuse
Authors: Stan Jarzabek
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

In controlled lab experiments and industrial projects, we observed 50%-90% rates of repetitions that deliberately recurred in newly developed, well-designed programs. Most often, recurring program structures represented an important concept from software requirements or design spaces. Repetitions increased conceptual complexity and physical size of programs, and also signified unexploited reuse opportunities. Despite potential benefits, avoiding or explicating repetitions with conventional programming techniques was either impossible or would require developers to compromise other important design goals. We believe these problems are common in many program situations. We hypothesize that they have their roots in much similarity that is inherent in software, and not strong enough generic design mechanisms to represent repetitions in a unified, generic way. We discuss mixed-strategy approach that strengthens generic design capabilities of conventional programming techniques with help of a generative meta-programming technique.
Traffic classification using clustering algorithms
Authors: Jeffrey Erman, Martin Arlitt, Anirban Mahanti
Venue: Proceedings of the 2006 SIGCOMM workshop on Mining network data (2006)

Classification of network traffic using port-based or payload-based analysis is becoming increasingly difficult with many peer-to-peer (P2P) applications using dynamic port numbers, masquerading techniques, and encryption to avoid detection. An alternative approach is to classify traffic by exploiting the distinctive characteristics of applications when they communicate on a network. We pursue this latter approach and demonstrate how cluster analysis can be used to effectively identify groups of traffic that are similar using only transport layer statistics. Our work considers two unsupervised clustering algorithms, namely K-Means and DBSCAN, that have previously not been used for network traffic classification. We evaluate these two algorithms and compare them to the previously used AutoClass algorithm, using empirical Internet traces. The experimental results show that both K-Means and DBSCAN work very well and much more quickly then AutoClass. Our results indicate that although DBSCAN has lower accuracy compared to K-Means and AutoClass, DBSCAN produces better clusters.
An Integrated Environment for Audio Recording, Editing, and Retrieval
Authors: Stephen V. Rice, Stephen M. Bailey
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

FindSounds Palette integrates audio recording, editing, and retrieval with advances in audio visualization and content-based queries of local and remote sound collections.
Convergence of BP Algorithm with Variable Learning Rates for FNN Training
Authors: Hongmei Shao, Wei Wu
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

Convergence results are presented for the batch backpropagation algorithm with variable learning rates for training feedforward neural networks with a hidden layer. The monotonicity of the error function in the training iteration is also proved.
Experiences with an object-oriented, multi-stage language
Authors: Gregory Neverov, Paul Roe
Venue: Science of Computer Programming (2006)

Metaphor is a multi-stage programming language extension to an imperative, object-oriented language in the style of C# or Java. This paper discusses some issues we faced when applying multi-stage language design concepts to an imperative base language and run-time environment. The issues range from dealing with pervasive references and open code to garbage collection and implementing cross-stage persistence.
Binding energy calculation of excitonic trions in spherical quantum dots with the quantum adiabatic theorem
Authors: S. Baskoutas, A. F. Terzis
Venue: Microelectronic Engineering (2005)

The stability of the charged excitons X^+ and X^- as a function of the spherical quantum dot radius R and also as a function of the effective mass ratio @s is studied with a formulation of the Hartree-Fock approximation using a calculation method which is based on the quantum adiabatic theorem. Our results indicate that the binding energies of X^+ and X^- are different except for @s=1, the difference reduces as the ratio @s increases, the binding energy of X^+ is higher than that of X^-, the binding energy of both charged excitons decreases as the mass ratio @s increases and there is a critical mass ratio @s"c, such that for @s>@s"c the complex is unstable. Furthermore, studying the behavior of both charged excitons as a function of the dot radius for @s=0.8, we found that both charged excitons are unstable.
A New Intelligent Traffic Shaper for High Speed Networks
Authors: Iman Shames, Nima Najmaei, Mohammad Zamani, A. A. Safavi
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

In this paper, a new intelligent traffic shaper is proposed to obtain a reasonable utilization of bandwidth while preventing traffic overload in other part of the network and as a result, reducing total number of packet dropping in the whole network. This approach trains an intelligent agent to learn an appropriate value for token generation rate of a Token Bucket at various states of the network. This method shows satisfactory results in simulations from the aspects of keeping dropping probability low while injecting as many packets as possible into the network by minimization of used buffer size at each router in order to keep the delay occurred by packets waiting in long buffers to be sent, as small as possible.
A peer-to-peer on-demand streaming service and its performance evaluation
Authors: Yang Guo, Kyoungwon Suh, J. Kurose, D. Towsley
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Providing on-demand video streaming service over the Internet is a challenging task. In this paper, we propose DirectStream, a directory based peer-to-peer video streaming service that efficiently and cost-effectively provides video on-demand service with VCR operation support. We analytically and experimentally examine the system performance, and show that the proposed scheme can significantly reduce the workload posed on the server, and that it scales extremely well as the popularity of the video increases even if participating clients behave non-cooperatively. We propose a QoS parent selection algorithm to construct the appropriate peer-to-peer networks, and discuss how to provide continuous playback in the face of clients' early departures. Our study suggests that peer-to-peer networking is a promising technique to address scalability in on-demand streaming service.
Snow on silk: layering NodeOS functionality on conventional operating systems
Authors: Nadia Shalaby, Yitzchak Gottlieb, Mike Wawrzoniak, Larry Peterson
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

Transferring active networking technology from the research arena to everyday deployment on desktop and edge router nodes, requires a NodeOS design that simultaneously meets three goals: (1) be embedded within a wide-spread, open source operating system; (2) allow non-active applications and regular operating system operation to proceed in a regular manner, unhindered by the active networking component; (3) offer performance competitive with that of networking stacks of general purpose operating systems. Previous NodeOS systems, Bowman, Janos, AMP and Scout, only partially addressed these goals. Our contribution lies in the design and implementation of such a system, a NodeOS within the Linux kernel, and the demonstration of competitive performance for medium and larger packet sizes. The underlying approach to our NodeOS design is to provide a mapping from the existing system components and interfaces, to ones we architected for incorporating the active networking functionality. We also illustrate how such an interface-focused design easily renders to the deployment of other networking architectures, such as peer-to-peer networks and extensible routers.
On Key Assignment for Hierarchical Access Control
Authors: Jason Crampton, Keith Martin, Peter Wild
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

A key assignment scheme is a cryptographic technique for implementing an information flow policy, sometimes known as hierarchical access control. All the research to date on key assignment schemes has focused on particular encryption techniques rather than an analysis of what features are required of such a scheme. To remedy this we propose a family of generic key assignment schemes and compare their respective advantages. We note that every scheme in the literature is simply an instance of one of our generic schemes. We then conduct an analysis of the Akl-Taylor scheme and propose a number of improvements. We also demonstrate that many of the criticisms that have been made of this scheme in respect of key udpates are unfounded. Finally, exploiting the deeper understanding we have acquired of key assignment schemes, we introduce a technique for exploiting the respective advantages of different schemes.
Robust People Tracking with Global Trajectory Optimization
Authors: Jerome Berclaz, Francois Fleuret, Pascal Fua
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Given three or four synchronized videos taken at eye level and from different angles, we show that we can effectively use dynamic programming to accurately follow up to six individuals across thousands of frames in spite of significant occlusions. In addition, we also derive metrically accurate trajectories for each one of them. Our main contribution is to show that multi-person tracking can be reliably achieved by processing individual trajectories separately over long sequences, provided that a reasonable heuristic is used to rank these individuals and avoid confusing them with one another. In this way, we achieve robustness by finding optimal trajectories over many frames while avoiding the combinatorial explosion that would result from simultaneously dealing with all the individuals.
Integration of semantic-based bipartite graph representation and mutual refinement strategy for biomedical literature clustering
Authors: Illhoi Yoo, Xiaohua Hu, Il-Yeol Song
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

We introduce a novel document clustering approach that overcomes those problems by combining a semantic-based bipartite graph representation and a mutual refinement strategy. The primary contributions of this paper are the following. First, we introduce a new representation of documents using a bipartite graph between documents and co-occurrence concepts in the documents. Second, we show how to enhance clustering quality by applying the mutual refinement strategy to the initial clustering results. Third, through the experiments on MEDLINE documents, we show that our integrated method significantly enhances cluster quality and clustering reliability compared to existing clustering methods. Our approach improves on the average 29.5 cluster quality and 26.3 clustering reliability, in terms of misclassification index, over Bisecting K-means with the best parameters.
A pen-based paperless environment for annotating and marking student assignments
Authors: Beryl Plimmer, Paul Mason
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

A paperless environment for annotating student assignments is appealing to teachers and students. However, to do this, while retaining the richness and ease of annotating the work with a red pen, has not been possible until recently.This project presents an annotation problem that requires digital annotation, and additionally functionality to properly support the user requirements to move efficiently between assignments, and simultaneously annotate and record marks for the assignment.With Penmarked, our prototype system, the teacher is able to annotate a digital document with a stylus and at the same time write scores which are recognized and saved into both the student's document and a standard file format. The evaluation suggests that Penmarked is a viable alternative to both paper and existing paperless environments.
Matrix-geometric algorithms for stochastic fluid flows
Authors: Soohan Ahn, V. Ramaswami
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

This paper surveys the algorithms for steady state and transient analyses of stochastic fluid flow models developed by the authors and conveniently brings together the disparate set of results reported in papers strewn across a variety of journals. A discussion is provided of some additional care that is needed while implementing the algorithms to take care of the fact that the transient distributions may have atoms of non-negligible size.
3D Object Reconstruction Using Geometric Computing
Authors: Philip C. Igwe George K. Knopf
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

Fragmented objects are encountered in a variety of diverse engineering and scientific fields including industrial inspection, customized medical prosthesis design, forensic science, paleontology, and archaeology. The arbitrarily broken pieces must be reassembled and new material often added to complete the process of shape reconstruction. To prevent physical damage of the pieces during reconstruction and enhance shape visualization scientists have begun to exploit 3D data acquisition and graphical modeling tools. An algorithm for enabling free-form shape reconstruction from digitized data of fragmented pieces is described in this paper. The method exploits the topological structure and learning algorithm of a 3D self-organizing feature map (SOFM). The lattice of the SOFM is a spherical mesh that maintains the relative connectivity of the neighboring nodes as it transforms under external forces. The weight nodes of the lattice represent vertices of the constituent elements in the facetted surface model. The technique is illustrated by reconstructing two clay objects with closed geometries from several fragmented parts.
Least p/sup th/ power design of complex FIR 2-D filters using the complex Newton method
Authors: T. J. Abatzoglou, A. G. Jaffer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

A design of 2-D complex FIR filters is proposed by minimizing the p/sup th/ power norm used to measure the deviation of the FIR filter response from a desired filter response. The solution of this problem cannot be obtained in closed form except for p=2; for arbitrary p>2 the authors present an approach which treats the problem from a complex variable point of view. An iterative scheme is described based on the complex Newton method to find the solution. It has the feature that, starting with p=2, the value of p is increased after each iteration. Because the objective function is convex any local extremum is the global minimum. Convergence can be attained after a moderate number of iterations. A characterization theorem for factorization of 2-D FIR filters in terms of 1D filters is derived. This has strong implications for large order 2-D filter design. Two filter design examples are included.
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
Authors: Songting Chen, Hua-Gang Li, Junichi Tatemura, Wang-Pin Hsiung, Divyakant Agrawal, K. Selçuk Candan
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Tree pattern matching is one of the most fundamental tasks for XML query processing. Holistic twig query processing techniques [4, 16] have been developed to minimize the intermediate results, namely, those root-to-leaf path matches that are not in the final twig results. However, useless path matches cannot be completely avoided, especially when there is a parent-child relationship in the twig query. Furthermore, existing approaches do not consider the fact that in practice, in order to process XPath or XQuery statements, a more powerful form of twig queries, namely, Generalized-Tree-Pattern (GTP) [8] queries, is required. Most existing works on processing GTP queries generally calls for costly post-processing for eliminating redundant data and/or grouping of the matching results.In this paper, we first propose a novel hierarchical stack encoding scheme to compactly represent the twig results. We introduce Twig2Stack, a bottom-up algorithm for processing twig queries based on this encoding scheme. Then we show how to efficiently enumerate the query results from the encodings for a given GTP query. To our knowledge, this is the first GTP matching solution that avoids any post path-join, sort, duplicate elimination and grouping operations. Extensive performance studies on various data sets and queries show that the proposed Twig2Stack algorithm not only has better twig query processing performance than state-of-the-art algorithms, but is also capable of efficiently processing the more complex GTP queries.
NoSQ: Store-Load Communication without a Store Queue
Authors: Tingting Sha, Milo M. K. Martin, Amir Roth
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

This paper presents NoSQ (short for No Store Queue), a microarchitecture that performs store-load communication without a store queue and without executing stores in the outof- order engine. NoSQ implements store-load communication using speculative memory bypassing (SMB), the dynamic short-circuiting of DEF-store-load-USE chains to DEF-USE chains. Whereas previous proposals used SMB as an opportunistic complement to conventional store queue-based forwarding, NoSQ uses SMB as a store queue replacement. NoSQ relies on two supporting mechanisms. The first is an advanced store-load bypassing predictor that for a given dynamic load can predict whether that load will bypass and the identity of the communicating store. The second is an efficient verification mechanism for both bypassed and nonbpyassed loads using in-order load re-execution with an SMBaware store vulnerability window (SVW) filter. The primary benefit of NoSQ is a simple, fast datapath that does not contain store-load forwarding hardware; all loads get their values either from the data cache or from the register file. Experiments show that this simpler designdespite being more speculativeslightly outperforms a conventional storequeue based design on most benchmarks (by 2% on average).
Omni-Directional Camera Networks and Data Fusion for Vehicle Tracking in an Indoor Parking Lot
Authors: Jung-Ming Wang, Ching-Ting Tsai, Shen Cherng, Sei-Wang Chen
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

A fixed single camera is not sufficient for monitoring a wide area. More cameras can be used, but a problem with integrating all of them will arise. In this paper, a monitoring system to detect and track moving objects in an indoor environment using multiple omni-directional cameras is proposed. Objects captured from different cameras can be integrated automatically, and we can add more cameras to enlarge the monitoring range without changing the system architecture. Such a system is currently being applied to a model of a parking lot for detecting the paths of vehicles.
Exploring genomic medicine using integrative biology
Authors: Isaac Kohane
Venue:  (2005)

Instead of focusing on the cell, or the genotype, or on any single measurement modality, using integrative biology allows us to think holistically and horizontally. A disease like diabetes can lead to myocardial infarction, nephropathy, and neuropathy; to study diabetes in genomic medicine would require reasoning from a disease to all its various complications to the genome and back. I am studying the process of intersecting nearly-comprehensive data sets in molecular biology, across three representative modalities (microarrays, RNAi and quantitative trait loci) out of the more than 30 available today. This is difficult because the semantics and context of each experiment performed becomes more important, necessitating a detailed knowledge about the biological domain. I addressed this problem by using all public microarray data from NIH, unifying 50 million expression measurements with standard gene identifiers and representing the experimental context of each using the Unified Medical Language System, a vocabulary of over 1 million concepts. I created an automated system to join data sets related by experimental context. I evaluated this system by finding genes significantly involved in multiple experiments directly and indirectly related to diabetes and adipogenesis and found genes known to be involved in these diseases and processes. As a model first step into integrative biology, I then took known quantitative trait loci in the rat involved in glucose metabolism and build an expert system to explain possible biological mechanisms for these genetic data using the modeled genomic data. The system I have created can link diseases from the ICD-9 billing code level down to the genetic, genomic, and molecular level. In a sense, this is the first automated system built to study the new field of genomic medicine. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Direct Adaptive Fuzzy Control with Less Restrictions on the Control Gain
Authors: Phi Anh Phan, Timothy J. Gale
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In the adaptive fuzzy and neural network control field, there are two basic configurations: direct and indirect. It is well known that the direct configuration needs more restrictions on the control gain than the indirect configuration. In this paper, we propose a direct adaptive fuzzy controller with less restrictions on the control gain. Using an extension of the universal approximation theorem, we show that the only required constraint on the control gain is that its sign is known. We also show that using the approximation error estimator enhances performance. Finally, application to an inverted pendulum demonstrates the effectiveness of the proposed controller.
CARMUL: concurrent automatic recording for multimedia lecture
Authors: Y. Kameda, S. Nishiguchi, M. Minoh
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

An advanced multimedia lecture recording system is presented in this paper. The purpose of our system is to capture multimodal information that can be received only when lectures are being held in a classroom where a teacher and students share the same time and space. The system captures not only hand-writings and slide switching intervals but also audio and video of the people with their spatial location information. These recorded media will be served to users in distance learning process. We designed the system so that it does not interfere with classes. It can archive lectures while they hold classes on regular basis and generate a multimedia archive automatically. Teachers are neither asked to remain at a certain place nor wired with devices they would have to put on. We have implemented our approach and our lecture archive system currently works for six classes per week, since October, 2002.