ppxscal/embedding_network huggingface dataset:
Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing
Authors: Hisashi Koga, Tetsuo Ishibashi, Toshinori Watanabe
Venue: Knowledge and Information Systems (2007)

The single linkage method is a fundamental agglomerative hierarchical clustering algorithm. This algorithm regards each point as a single cluster initially. In the agglomeration step, it connects a pair of clusters such that the distance between the nearest members is the shortest. This step is repeated until only one cluster remains. The single linkage method can efficiently detect clusters in arbitrary shapes. However, a drawback of this method is a large time complexity of O(n 2), where n represents the number of data points. This time complexity makes this method infeasible for large data. This paper proposes a fast approximation algorithm for the single linkage method. Our algorithm reduces the time complexity to O(nB) by rapidly finding the near clusters to be connected by Locality-Sensitive Hashing, a fast algorithm for the approximate nearest neighbor search. Here, B represents the maximum number of points going into a single hash entry and it practically diminishes to a small constant as compared to n for sufficiently large hash tables. Experimentally, we show that (1) the proposed algorithm obtains clustering results similar to those obtained by the single linkage method and (2) it runs faster for large data than the single linkage method.
Generic construction algorithms for symmetric and asymmetric RVLCs
Authors: Chia-Wei Lin, Yuh-Jue Chuang, Ja-Ling Wu
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

In this paper, we propose several generic algorithms that can construct symmetric and asymmetric reversible variable length codes (RVLC). RVLC, adopted in emerging video coding standards such as MPEG-4 and H.263+, can be used to enhance the corresponding error resilience capability in the presence of transmission bit errors. Experimental results show that the proposed symmetric RVLC algorithm can produce codes with shorter average codeword lengths and shorter maximum codeword lengths. And the proposed asymmetric RVLC algorithms generate codes with either shorter average codeword lengths or shorter maximum codeword lengths, as compared to the existing approaches.
Collaborative learning experience in a freshman materials laboratory exercise
Authors: J. R. Williams
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Freshmen students are often treated as incapable of operating without carefully detailed instructions for many types of laboratory experiences. At Purdue-Kokomo, six different laboratory exercises are provided for our freshmen taking the initial course in Materials and Processing, MET 141. In the past, detailed written laboratory instructions were provided, spelling out exactly how to make the necessary measurements, how to use the equipment, how to convert measurements to the appropriate units, how to define the terms, etc. Almost a full hour was devoted to demonstrating how to use the equipment. Each lab group was visited to see the correct procedures were being used. For the Fall, 1994, semester this author decided to change to a style that includes the concept of self-directed work teams, using team building techniques where possible to enable students who are not well acquainted with each other and from varied backgrounds to work together as a team to solve the laboratory problem. Each group is required to turn in a group lab report for the first lab exercise, with individual reports for the remaining labs. This method allows for the collaborative experience to occur. The instructor arbitrarily selects a leader and the other team members. Selection criteria are arbitrary with an effort to balance each group. Each group is given a separate sample set and a set of equipment necessary to perform the lab. The instructor and technician then maintain a hands-off policy until asked questions by the lab groups. Assistance is provided when asked with respect to verifying measurements, etc., but, the students are required to ask questions that can be answered either "yes" or "no" when trying to determine why results do not seem to be correct. The results of this approach were very encouraging, resulting in better quality laboratory reports, and a clearer understanding of the use of measurement equipment.
Cellular Automata to Simulate Rock Failure
Authors: Mingtian Li, Zhongliang Ru, Junlian He
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Rock fracture process that shows strong nonlinearity and complexity is simulated by cellular automata method. Cellular automata are considered as an efficient method to simulate complex system and study mechanisms of physical phenomena due to their locality and parallelization. In this paper rock samples can be discretized into cell elements that are connected with beam elements. Force and displacement are taken as the basic state variables. Based on equilibrium equations, constitutive equations and deformation equations local rules are attained, which overcomes the shortcoming of arbitrary decision of local rules. Maximum tensile strain criterion and Mohr-Coulomb criterion are introduced to judge the beginning of tensile failure and shearing failure respectively. And based on damage mechanics deformation and strength properties of damaged cell elements are estimated. This model can simulate heterogeneity of rock and crack propagation and coalescence. Finally based on this model fracture process and crack propagation and coalescence are simulated. The simulated results are in good accordance with typical experimental results and it proved that cellular automata method is a promising method to study rock fracture.
Event-Based Monitoring of Open Source Software Projects
Authors: Dindin Wahyudin, A Min Tjoa
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Project management traditionally has a strong focus on human reporting that fits well a tightly coupled form of organization to ensure the quality of project reporting. For loosely coupled forms of organization, such as open source systems (OSS) development projects, there are very few approaches to ensure the quality of project reporting; a promising approach can be to augment human reporting with data analysis based on the communication and state changes in an OSS project. In this paper we propose a concept and an initial measurement approach for event-based monitoring of OSS projects to better understand the actual benefit of tool-supported gathering, correlating and analyzing processes event data from the OSS community as a supplement for traditional software project monitoring data collection. We report on an empirical feasibility study investigating success and risk indicators of five OSS projects listed in the Apache Incubator.
The Master of Software Engineering degree: an integrative engineering discipline
Authors: D. Gustafson, B. Hankley, V. Wallentine
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Software based products are an ever increasing portion of industrial output. However few engineers who produce software have had formal training in the specification, design, implementation, documentation, and maintenance of large software systems. In addition, few have had training in software engineering management and development tools and processes. KSU has implemented a Master of Software Engineering degree program which provides an opportunity for new engineering graduates and practicing engineers to learn state of the art software engineering analysis and processes. The purpose is to provide students a foundation in the software engineering "life cycle", software measurement, software management, software specification, and software validation and verification. In addition to the core courses on software methodology, students are required to take courses in an application area which is reliant on software development. This involves faculty from many engineering and science disciplines who teach these courses and supervise the development of the student's software "portfolio" in the designated engineering or science area. The goal is to integrate the software engineering process into traditional engineering processes.
Exploring the Clinical Notes of Pathology Ordering by Australian General Practitioners: a text mining perspective
Authors: Zoe Yan Zhuang, Rasika Amarasiri, Leonid Churilov, Damminda Alahakoon, Ken Sikaris
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

A massive rise in the number and expenditure of pathology ordering by general practitioners (GPs) concerns the government and attracts various studies with the aim to understand and improve the ordering behavior. In this paper we attempt to understand the reasons for and implications of pathology ordering by general practitioners by applying an unsupervised text mining technique on the clinical notes of the pathology requests obtained from a pathology company in Australia. Pathology requests are clustered into different groups based on the information that is included by the doctors in clinical notes accompanying the requests. Features and patterns of the groups are investigated and analyzed. The novelty of the paper is in using text mining techniques to extract knowledge from unstructured text data in the area of pathology ordering and to understand the reasons for pathology ordering from a doctors' perspective.
TclProp: a data-propagation formula manager for Tcl and Tk
Authors: Sunanda Iyengar, Joseph A. Konstan
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

TclProp is a data propagation formula manager for Tcl and Tk. It supports and enforces one-way declarative relationships among variables. If, for example, we enter the formula A = B + C, whenever B or C changes, A is also updated to reflect the new sum. TclProp also supports triggers -- code to be executed when one of a set of variables changes. And, TclProp includes a mechanism for linking variables to object attributes (e.g., the enabled/disabled status of a button) so these attributes can be used in formulas and triggers. This paper presents an example of how data propagation formulas can simplify programming and presents the design and implementation of TclProp 1.0, an implementation built in Tcl.
An architecture for advanced packet filtering
Authors: Andrew Molitor
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

Packet filtering in routers has been underrated as anything but an adjunct to other network security measures. This paper presents an architecture, and an implementation of it, for packet filtering that addresses many of the perceived problems with packet filtering. Starting from a short discussion of what constitutes a network access policy, the paper makes a case for extremely flexible packet filtering as an integral part of an access policy. After briefly examining a couple of commonly used packet filtering implementations, the paper goes on to describe a more flexible architecture for packet filtering, and gives some examples of how the implementations of this architecture can be used. After a discussion of how the architecture and the implementations better support auditing and assurance procedures for a network access policy, the paper finishes with a description of some of the more architecturally interesting planned future development.
Maintaining the Spatial Relationships of Marine Vessels Using the Kinetic Voronoi Diagram
Authors: Ignacy R. Goralski, Christopher M. Gold
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

In this paper a new type of GIS system for maritime navigation safety is proposed. The system takes advantage of the properties of the kinetic Voronoi diagram (VD), and uses the "Quad-Edge" data structure for the maintenance of the spatial relationships of ships and other navigational objects. The locations of ships are updated in real-time using a standard onboard transponder, and moving-points VD algorithms. These spatial relationships are used for collision detection and avoidance. The system is aimed at tackling the main cause of marine accidents -- human errors -- by providing navigational aid and decision support to mariners. A brief introduction into static and kinematic Voronoi methods is given and is followed by a discussion of different types of GIS systems for marine purposes. The state-of-the-art in maritime safety and its major developments are also covered.
Dynamic C++ classes: a lightweight mechanism to update code in a running program
Authors: Gísli Hjálmtýsson, Robert Gray
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Techniques for dynamically adding new code to a running program already exist in various operating systems, programming languages and runtime environments. Most of these systems have not found their way into common use, however, since they require programmer retraining and invalidate previous software investments. In addition, many of the systems are too high-level for performance-critical applications. This paper presents an implementation of dynamic classes for the C++ language. Dynamic classes allow run-time updates of an executing C++ program at the class level. Our implementation is a lightweight proxy class that exploits only common C++ features and can be compiled with most modern compilers. The proxy supports version updates of existing classes as well as the introduction of new classes. Our language choice and proxy implementation is targeted towards performance-critical applications such as low-level networking in which the use of C++ is already widespread.
Programmed Strategies for Program Verification
Authors: Richard B. Kieburtz
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Plover is an automated property-verifier for Haskell programs that has been under development for the past three years as a component of the Programatica project. In Programatica, predicate definitions and property assertions written in P-logic, a programming logic for Haskell, can be embedded in the text of a Haskell program module. Properties refine the type system of Haskell but cannot be verified by type-checking alone; a more powerful logical verifier is needed. Plover codes the proof rules of P-logic, and additionally, embeds strategies and decision procedures for their application and discharge. It integrates a reduction system that implements a rewriting semantics for Haskell terms with a congruence-closure algorithm that supports reasoning with equality. It employs strategies such as structure splitting and case analysis to explore alternative valuations of expressions of type Bool or other finite data types, but these strategies can lead to exponential growth of terms and must be employed cautiously. Plover itself is written in Stratego, which has proven to be a powerful language tool for implementating a verifier. We discuss the design and implementation of some strategies that enable Plover to comprehend Haskell and verify many valid property assertions.
A Real-Time Network Traffic Profiling System
Authors: Kuai Xu, Feng Wang, Supratik Bhattacharyya, Zhi-Li Zhang
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

This paper presents the design and implementation of a real-time behavior profiling system for high-speed Internet links. The profiling system uses flow-level information from continuous packet or flow monitoring systems, and uses data mining and information-theoretic techniques to automatically discover significant events based on the communication patterns of end-hosts. We demonstrate the operational feasibility of the system by implementing it and performing extensive benchmarking of CPU and memory costs using a variety of packet traces from OC-48 links in an Internet backbone network. To improve the robustness of this system against sudden traffic surges such as those caused by denial of service attacks or worm outbreaks, we propose a simple yet effective filtering algorithm. The proposed algorithm successfully reduces the CPU and memory cost while maintaining high profiling accuracy.
The New Peak-to-Average Power Reduction Algorithm in the OFDM System
Authors: Chau Yun Hsu, Horng Guo Do
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, we proposed a new peak-to-average power reduction (PAPR) algorithm of orthogonal frequency division multiplexing (OFDM) system using block coding scheme and discrete cosine transform (DCT). We are using DCT to concentrate the energy of the original signal into a few coefficients. After the DCT data were fed into the IDFT, the output of signal of OFDM appeared to have uniform distribution. With the newly proposed schemes, that we founded those three important properties, the first property is the PAPR used be reduced by 9.4419 dB for BPSK mapper. The second property is the OFDM signals have capability of noise immunity and of error correction. And the third property is the effect of PAPR reduced can be implement by cascaded different method.
Privacy-Preserving Data Imputation
Authors: Geetha Jagannathan, Rebecca N. Wright
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper, we investigate privacy-preserving data imputation on distributed databases. We present a privacypreserving protocol for filling in missing values using a lazy decision tree imputation algorithm for data that is horizontally partitioned between two parties. The participants of the protocol learn only the imputed values; the computed decision tree is not learned by either party.
Improving Network's Performability Using Parallel Processing
Authors: Mostafa Shaad Zolpirani, Mohammad-Mahdi Bidmeshki, Seyed Ghassem Miremadi
Venue: Proceedings of the Sixth International Conference on Networking (2007)

By occurring failures in computer networks, routing protocols are triggered to update routing and forwarding tables. Because of invalid tables during update-time, transient loop may occur and packet-drop rate and end-to-end delay increase which means that the quality of service decreases. This paper proposes a parallel architecture for a router to recalculate and update routing table. Simulation results show that with dual-processor architecture, this update time could be up to 40% improved, depending on the network topology and the size of tables. This paper also studies the effect of this speed-up on networks' performability, i.e. the ability to deliver services at predefined level. A sample network is studied and the simulation results show that faster updates of routing table, improves network's performability in the presence of failures. Since it may not worth or even be practical to improve all routers in the network, this paper suggests finding bottleneck routers and accelerating them in order to improve the performability of the networks. The simulation results show that by speeding-up the bottleneck routers of the network, instead of all routers, the performability still could be improved.
Tabby: designing of coexisting entertainment content in everyday life by expanding the design of furniture
Authors: Atsuro Ueki, Maiko Kamata, Masa Inakage
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

We investigated the new entertainment content that seamlessly mixed into our everyday life in the coming ubiquitous era. For this purpose, we attempted to expand the possibility of furniture with interactivity. First, we evaluated the entertaining quality of such "coexisting" entertainment as "comfort" and "pleasure" in everyday life and, consequently, we focused attention on the furniture that is the most familiar objects around us and brings comfortableness to our living environment. We constructed the framework of the "coexisting" entertainment content design that consists of "sustention" and "concurrency" being based on the original quality of furniture and then implemented a prototype named Tabby. Tabby is a "coexisting" content that has both the function of a lamp and the entertaining quality of an interactive content. We also examined "Tabby" by SD method and found its possibility of amplifying the pleasure without decreasing the original comfortable quality. In this paper, for revealing the possibility of "coexisting" entertainment content, we describe our design framework and its expanding ability.
Effective Versus Ineffective Communication Behaviors in Virtual Teams
Authors: Daphne M. Dekker
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Critical Incident technique was used to interview 18 professional virtual team workers about their experiences with eflective and inefective communication behaviors of virtual team workers. We clustered the 317 behaviors that we found into 11 categories that are critical for the success or failure of a team andor satisfaction of team members. These categories are discussed, and suggestions are made for future research.
Numerical Simulation of the Combustion of Aluminum Shock-Dispersed-Fuel Charges
Authors: Allen L. Kuhl, Boris Khasainov, John Bell, Vince Beckner
Venue: Proceedings of the HPCMP Users Group Conference (2006)

For many explosives, only a fraction of the chemical energy is released in the detonation. Calorimetry data for TNT from Ornellas[10] shows that when the ambient gas is inert, there is substantially less total energy released than when the ambient gas is air. This data indicates that burning of the explosion byproducts plays a key role in the overall energetics of the system. The basic concept of shock-dispersed fuel (SDF) charges is to directly exploit this idea. More precisely, in an SDF charge a small charge is used to disperse a fuel and create a turbulent environment in which the fuel can mix with ambient air and burn. In our previous work,[1] we considered the afterburning of detonation byproducts from a mixture of TNT and PETN.
Camp REACH: an engineering summer camp for middle school girls
Authors: C. Demetry
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Summary form only as given. Studies indicate that a critical point in the pipeline of women into technological careers is the middle school years, when it is common for girls to lose interest in math and science. In order to address this problem within the Central Massachusetts region, WPI initiated in the summer of 1997 a two-week residential outreach program designed specifically for girls entering the seventh grade. The overall goal of "Camp REACH" is to generate or sustain adolescent girls' interest in engineering and technology and to enhance self-confidence and motivation toward education. The camp program is shaped by a philosophical approach that emphasizes the direct benefit engineers can have on society and the development of technological self-efficacy through successful hands-on tasks. Program activities include a "community service design project" for a customer in the Worcester community, hands-on experiential workshops, field trips, speakers, recreational activities, informational sessions for parents, and follow-up programs during the academic year. Girls interact with a spectrum of role models including women high school students, WPI students and faculty, middle school math and science teachers, and practicing engineers. In this talk, the authors discuss successes and lessons learned from the first camp offering, and formative and preliminary summative evaluation results are presented.