ppxscal/embedding_network huggingface dataset:
An object-oriented, apprenticeship approach to data structures using simulation
Authors: O. Astrachan
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Object-oriented methods and programming are increasingly being used in the second (CS 2) data structures course in Computer Science. As this course migrates to an object-oriented approach, students and instructors must be given material to support a unified and application-oriented course. In this paper we report on modules developed for what we term an Applied Apprenticeship Approach to the CS 2 course using an object-oriented framework.
Challenges and Interesting Research Directions in Associative Classification
Authors: Fadi Thabtah
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Utilising association rule discovery methods to construct classification systems in data mining is known as associative classification. In the last few years, associative classification algorithms such as CBA, CMAR and MMAC showed experimentally that they generate more accurate classifiers than traditional classification approaches such as decision trees and rule induction. However, there is room to improve further the performance and/or the outcome quality of these algorithms. This paper highlights new research directions within associative classification approach, which could improve solution quality and performance and also minimise drawbacks and limitations. We discuss potential research areas such as incremental learning, noise in test data sets, exponential growth of rules and many others.
Pose-Oblivious Shape Signature
Authors: Ran Gal, Ariel Shamir, Daniel Cohen-Or
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

A 3D shape signature is a compact representation for some essence of a shape. Shape signatures are commonly utilized as a fast indexing mechanism for shape retrieval. Effective shape signatures capture some global geometric properties which are scale, translation, and rotation invariant. In this paper, we introduce an effective shape signature which is also pose-oblivious. This means that the signature is also insensitive to transformations which change the pose of a 3D shape such as skeletal articulations. Although some topology-based matching methods can be considered pose-oblivious as well, our new signature retains the simplicity and speed of signature indexing. Moreover, contrary to topology-based methods, the new signature is also insensitive to the topology change of the shape, allowing us to match similar shapes with different genus. Our shape signature is a 2D histogram which is a combination of the distribution of two scalar functions defined on the boundary surface of the 3D shape. The first is a definition of a novel function called the local-diameter function. This function measures the diameter of the 3D shape in the neighborhood of each vertex. The histogram of this function is an informative measure of the shape which is insensitive to pose changes. The second is the centricity function that measures the average geodesic distance from one vertex to all other vertices on the mesh. We evaluate and compare a number of methods for measuring the similarity between two signatures, and demonstrate the effectiveness of our pose-oblivious shape signature within a 3D search engine application for different databases containing hundreds of models.
Application of MUSIC to arrays with multiple invariances
Authors: A. L. Swindlehurst
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper describes generalizations of the MUSIC and root-MUSIC algorithms for direction of arrival (DOA) estimation to arrays composed of multiple translated subarrays. The advantage of these new approaches is that the DOAs can be estimated using either a one-dimensional search or by rooting a polynomial, as opposed to a multidimensional search as required by the multiple invariance (MI)-ESPRIT algorithm. While MI-MUSIC and root-MI-MUSIC are not statistically efficient like MI-ESPRIT, they do perform better than a single invariance implementation of ESPRIT, and are thus better suited for finding the initial conditions required by the MI-ESPRIT search.
CHOP6: A DHT Routing Mechanism Considering Proximity
Authors: Shouta Morimoto, Fumio Teraoka
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

This paper proposes a DHT routing mechanism called CHOP6. CHOP6 takes proximity into account by using the properties of the IPv6 address format. CHOP6 introduces the 64-bit node ID, in which the lower part is the IPv6 global routing prefix. By examining the node ID, it is possible to roughly estimate the proximity to the node. Similar to Chord, CHOP6 uses the finger table. In CHOP6, the finger table entry holds more than one candidate nodes. When sending a query, the source node estimates the proximity to the candidate nodes by examining the node IDs if the RTT to the nodes is unknown. CHOP6 was implemented in Java on FreeBSD. The measured results showed that the time to get data in CHOP6 is less than that in Chord and the number of the messages necessary to maintain routing information in CHOP6 is also less than that in Chord.
Virtual circuit laboratory
Authors: H. Hodge
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

We present the rationale, implementation and performance features of a virtual lab environment for an electronic circuits course. The primary purpose of the tool is to provide an environment that mimics some of the failure modes of a real lab, which aids the student in learning debugging techniques. The tool is implemented as a Java application.
Proximity and Software Programming: IT Outsourcing and the Local Market
Authors: Ashish Arora, Chris Forman
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We examine the question of which services are tradable within a concrete setting: the outsourcing of IT services across a broad cross-section of establishments in the US. We analyze outsourcing decisions from 52,191 establishments with over 100 employees at the end of 2002, for two types of IT services: programming and design and hosting. Supply of programming and design services are more sensitive to increases in local market demand than are providers of hosting services, and the probability of outsourcing programming and design is increasing the local supply of outsourcing, but the outsourcing of hosting is not. This suggests that hosting services are more tradable than programming and design, and there is some irreducible non-tradable or "local" component to programming and design services.
Achieving higher receiver satisfaction using multicast-favored bandwidth allocation protocols
Authors: Ali Zilouchian, Mohammad Ilyas
Venue:  (2006)

In recent years, many protocols for efficient Multicasting have been proposed. However, many of the Internet Service Providers (ISPs) are reluctant to use multicastenabled routers in their networks. To provide such incentives, new protocols are needed to improve the quality of their services. The challenge is to find a compromise between allocating Bandwidth (BW) among different flows in a fair manner, and favoring multicast sessions over unicast sessions. In addition, the overall higher level of receiver satisfaction should be achieved. In this dissertation, we propose three new innovative protocols to favor multicast sessions over unicast sessions. Multicast Favored BW Allocation-Logarithmic (MFBA-Log) and Multicast Favored BW Allocation-Linear (MFBA-Lin) protocols allocate BW proportional to the number of down stream receivers. The proposed Multicast Reserved BW Allocation (MRBA) protocol allocates part of the BW in the links only to multicast sessions. Simulation results show the increase in the overall level of Receiver Satisfaction in the network.
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Venue: ACM International Conference Proceeding Series; Vol. 233 (2007)

The Inaugural International Conference on Distributed Event-Based Systems (DEBS) held in 2007 at the University of Toronto followed on the success of the previous five editions of the DEBS workshops held from 2002 to 2006 in companion with major conferences such as ICDCS, ICSE, and SIGMOD/PODS. The DEBS conference in 2007 was organized in cooperation with USENIX, the IEEE and the IEEE Computer Society, and ACM SIGMOD and ACM SIGSOFT. The objectives of the DEBS conference series are to provide a forum dedicated to the dissemination of original research, the discussion of practical insights, and the reporting on relevant experience relating to event-based computing that was previously scattered across several scientific and professional communities. The conference series aims at providing a forum for academia and industry to exchange ideas, for example, through industry papers and software demo papers. The DEBS series started as the amalgamation of two workshops independently proposed to the ICDCS 2001 conference organizing committee. One workshop was proposed by two research teams as a joint effort from Darmstadt University of Technology in Germany and University of Cambridge in England. The second workshop was proposed by a research team from University of Toronto. These two workshops joined efforts and started the DEBS series at ICDCS in Vienna in 2001. Event-based systems and event processing have been established in industry and research for many years. They are now gaining increasing momentum as witnessed by current efforts in areas including complex event processing, eventdriven architectures, business process management and modeling, Grid computing, Web service standardization efforts, and message-oriented middleware. DEBS intends to serve as a focal point to this vital, fast-growing community. The interdisciplinary scope of DEBS '07 included the design, the implementation, the deployment, and the evaluation of distributed event-based systems platforms and architectures for emerging computing environments. The conference discussed research on event processing in the context of peer-to-peer systems and under mobility, highlighted event processing concepts and models, presented security aspects of event-based systems, reported on event-driven business applications, and discussed novel routing and matching algorithms for event dissemination in distributed systems. The program of the conference included five invited keynote presentations, research paper presentations, industry and short paper presentations, a software demonstration and poster reception, and a panel. The technical conference program was assembled by an international program committee in a double-blind review process, with each submission receiving at least three reviews. A total of 74 papers were submitted to the conference, among which 14 full papers, 2 industry papers, and 10 short papers, 3 software demonstration papers, and 3 poster papers were selected for the technical program.
Investigation Multi-State System Reliability by Structure Function
Authors: Elena Zaitseva, Vitaly Levashenko
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Multi-State System is a mathematical model that is used in reliability analysis to present a system with some level of working efficiency. A structure function allows to describe behavior of system reliability depending on the efficiency of its components unambiguously. There are a lot of estimates of a Multi-State System on the basic of structure function. Dynamic Reliability Indices belong to these estimates and characterize the changes of Multi-State System reliability caused by changes in components efficiency. These indices are computed based on structure function and Logical Differential Calculus. The method of Dynamic Reliability Indices calculation is considered in this paper and is compared with another methods to evaluate Multi-State System reliability. Path (cut) method, method of Dynamic Reliability Indices calculation and method based on the Lower (Upper) Boundary Points are examined in particular.
Detection of slow-motion replay segments in sports video for highlights generation
Authors: H. Pan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We present a novel method for generating sports video summary highlights. Specifically, our method localizes semantically important events in sport programs by detecting slow motion replays of these events, and then generates highlights of these events at multiple levels. In our method, a hidden Markov model (HMM) is used to model slow motion replays, and an inference algorithm is introduced which computes the probability of a slow motion replay segment, and localizes the boundaries of the segment as well. An effective new feature is used in our HMM, based on a moving measure of the number of zero-crossings and the amplitudes of variations over time of video field differences. Furthermore, the method is capable of filtering out slow motion play segments in commercials. As compared with existing methods for video event detection, our method is more generic (ie, domain independent), and has the ability to capture inherently important events.
DFM/DFY: should you trust the surgeon or the family doctor?
Authors: Marco Casale-Rossi, Andrzej Strojwas, Rob Aitken, Antun Domic, Carlo Guardiani, Philippe Magarshack, Douglas Pattullo, Joseph Sawicki
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Everybody agrees that curing DFM/DFY issues is of paramount importance at 65 nanometers and beyond. Unfortunately, there is disagreement about how and when to cure them. "Surgeons" suggest a GDSII-centered approach, potentially invasive, while "family doctors" recommend a more pervasive approach, starting from RTL. As in real life, "surgery" and "medicine" represent two different schools of thought in the DFM/DFY arena. Both involve risks. This panel will examine these two approaches from high-level design all the way to manufacturing. We have assembled a set of panelists that represent a broad cross-section of semiconductor industry. Although there is general agreement among the panelists that both approaches are necessary and that prevention is the best way to proceed, they also acknowledge that the surgery may be unavoidable in such "hazardous" conditions as state-of-the-art technologies. However, as always, "the devil is in the details," and the diverse approaches to DFM presented below should make this panel quite interesting. We are also counting on the feedback from the IC design community to assess if these approaches are sufficient and practical enough to deal with the "health hazards." We are looking forward to an exciting discussion that will challenge our esteemed panelists.
Democratising change
Authors: Francesco Garibaldo
Venue: AI Society (2007)

In the cases of deep-seated changes in the capitalistic economies, starting from the first Industrial Revolution, we can choose a pessimistic hypothesis such as that of Polanyi (The great transformation. Rinehart, NY, 1944). In other words, a systematic dismantling of the previous structures and the economic and social customs, with the serious social and human crisis, or the slightly more &#x201c;optimistic&#x201d; one of Perez (Technological revolutions and financial capital: the dynamic of bubbles and golden ages. Edward Elgar, Cheltenham, 2002), for which, in the recurring 50-year cycles of innovation, a 4-phase sequence is realised (irruption, frenzy, synergy and maturity) of which frenzy, i.e. &#x201c;when financial capital takes over&#x201d; and there is &#x201c;a time of speculation, corruption and unashamed (even widely celebrated) love of wealth&#x201d;, leads, through a turning point, to a new one: &#x201c;The unsustainable structural tension that builds up in the economy and society&#x201d; can lead to &#x201c;a regulation (...) to put order in financial markets and to move towards full market expansion and greater social cohesion&#x201d;; it should be noted that Perez emphasises that this is a possibility and not a certainty. What is evident for social science is that in periods of deep and revolutionary changes, as to the economic dimension, of capitalistic societies, since the first Industrial Revolution, the economic process of change is more and more unfettered of any social, political, administrative and cultural effective regulation; all the dimensions of everyone&#x2019;s life, both private and public, are driven by the demands coming from the economic and financial realm; a divorce between economic institutions and society at large that is a lack of legitimatisation and democratic control on their lives by people becomes the rule. It happened in the 1880s, 1920s and 1990s and this is the actual situation of our societies; that is why many researchers and also financial and popular magazines are stricken by an historical comparison such as this one: &#x201c;It has been a great time to be a capitalist. All around the world, profits have been rising as a percentage of gross domestic product. According to Goldman Sachs, the profit share of US GDP in the first quarter of this year was an all-time high. HSBC says 2005 was the best year for UK profits since records began&#x201d;. (Financial Times, July 29, July 30, 2006). The journalist is aware of the consequences of the situation and he adds: &#x201c;High profits and the extreme wealth they usually imply can be extremely unpopular (...). It is easy to assume that the liberalising processes of the past 20&#x00a0;years are irreversible. But such reforms have little bedrock support; they have been effectively imposed on many countries by economic elites.&#x201d; This is the starting point of this article: the role of economic elites and the crisis of legitimacy of democratic regimes.
Global and task effects in information-seeking among software engineers
Authors: Allen E. Milewski
Venue: Empirical Software Engineering (2007)

Information-seeking strategies were explored in software engineers. A complex interaction of task and geographic differences was revealed. There is a general tendency across software engineers to favor non-social sources, such as documentation, for tasks where the goal is to seek factual information. More social sources are preferred when seeking information to diagnostic, problem-solving questions. Within this effect, some geographic variations assert themselves in a way that might partly be interpreted in terms of national cultural differences in Individualism vs. Collectivism. Implications of geographic differences in information-seeking for collaboration within global software development teams are discussed.
Acoustic source direction by hemisphere sampling
Authors: S. T. Birchfield
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

A method for estimating the direction to a sound source, using a compact array of microphones, is presented. For each pair of microphones, the signals are prefiltered and correlated. Rather than taking the peak of the correlation vectors as estimates for the time delay between the microphones, all the correlation vectors are accumulated in a common coordinate system, namely a unit hemisphere centered on the microphone array. The maximum cell in the hemisphere then indicates the azimuthal and elevation angles to the source. Unlike previous techniques, this algorithm is applicable to arbitrary microphone configurations, handles more than two microphone pairs, and has no blind spots. Experiments demonstrate significantly increased robustness to noise, compared with previous techniques.
Outage Probability and Percentage of Cell Area for OFDMA Cellular Systems with Sectoring
Authors: M. A. Nasr, Heba A. Shaban, W. H. Tranter
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Orthogonal Frequency Division Multiplexing (OFDM) is an important candidate for fourth generation cellular systems that support high data rates. Performance of OFDM systems is sensitive to non-perfect frequency synchronization, which leads to frequency offsets and a consequent degradation in system performance. In cellular systems, there is a tradeoff between link quality and capacity; both are controlled by cell cluster size. Smaller cluster sizes gain higher capacity, yet they cause an increase in cochannel interference, which degrades the system outage probability performance. Moreover, a key technique for reducing co-channel interference is sectoring, where a single OMNI directional antenna is replaced by multiple directional antennas. In this paper, the performance of OFDMA cellular systems with sectoring is investigated aided with extensive simulations. System performance is evaluated through the investigation of system outage probability and percentage of cell area for various system configurations namely, various cluster sizes, sectoring factors and frequency offsets.
Semantic passage segmentation based on sentence topics for question answering
Authors: Hyo-Jung Oh, Sung Hyon Myaeng, Myung-Gil Jang
Venue: Information Sciences: an International Journal (2007)

We propose a semantic passage segmentation method for a Question Answering (QA) system. We define a semantic passage as sentences grouped by semantic coherence, determined by the topic assigned to individual sentences. Topic assignments are done by a sentence classifier based on a statistical classification technique, Maximum Entropy (ME), combined with multiple linguistic features. We ran experiments to evaluate the proposed method and its impact on application tasks, passage retrieval and template-filling for question answering. The experimental result shows that our semantic passage retrieval method using topic matching is more useful than fixed length passage retrieval. With the template-filling task used for information extraction in the QA system, the value of the sentence topic assignment method was reinforced.
A blind, fast and robust method for geographical data watermarking
Authors: Cyril Bazin, Jean-Marie Le Bars, Jacques Madelaine
Venue: Proceedings of the 2nd ACM symposium on Information, computer and communications security (2007)

The aim of this paper is to propose an efficient digital water-marking algorithm on geographical data. Our algorithm is fast, blind and robust. Thus, the original data is not needed in order to prove the authorship of the document and the watermark is resiliant against many transformations applied on the document. The method we propose is based on a modification of parts of the data selected upon local criterias and a secret key. The local criterias use topological properties of a Delaunay mesh build on the original map. The local modifications of parts of the document introduce a statistical slant inside the document. The detection algorithm is a simple detection of this slant. Experimental results illustrate the resiliance of the algorithm against different tranformations such as rotation, translation, data shuffling and cropping.
The draw-bot: a project for teaching software engineering
Authors: M. V. Mohrenschildt
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The authors present a course project which was successfully used to teach software design principles to third year computer engineering students. The goal of the project is to program a robot to trace a shortest path through a maze. The students, organized in teams of five, have to follow the classical steps of software development and prepare interface, design and testing documents. Having a project that requires controlling a device to complete a clear task generates enthusiasm in the students and helps them to understand the principles taught in the course.