ppxscal/embedding_network huggingface dataset:
Update programming: a safe approach to software maintenance
Authors: Martin Erwig
Venue:  (2006)

Software maintenance accounts for a large portion of the software development cost, particularly the process of updating programs either to adapt for requirement change or to enhance design or efficiency. Currently, program updates are generally performed manually by programmers using text editors. This is an unreliable method because syntax and type errors are easily introduced, not to mention logic and semantic errors. The problem with this method is viewing programs on a low level, namely, as streams of characters. Rather than the textual representation, we propose to view the programs as instances of abstract data types and to update programs through programming updates in update languages. In this dissertation, we first study a specific program update problem, monadification, which is the process of automatic introduction of monads into functional programs. Later we investigate a more general problem of program updates and present an update language. We design a core calculus for the update language as well as its semantics and type system. Finally, we study the problem of generic traversals, which itself is a means of reducing the effort for software maintenance, but also serves as a basis for implementing program updates and other metaprogramming tasks.
Investigating Semantic Web Service Execution Environments: A Comparison between WSMX and OWL-S Tools
Authors: Omair Shafiq, Matthew Moran, Emilia Cimpian, Adrian Mocan, Michal Zaremba, Dieter Fensel
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

The application of semantics in Web Services as Semantic Web Services for dynamic discovery, composition, invocation and monitoring has been very helpful in enabling Enterprise Application Integration and E-Commerce. There are many initiatives that aim to realize the Semantic Web Services to enable effective exploitation of semantic annotations, and two major of them are Web Service Modeling Ontology (WSMO) and Ontology Web Language for Services (OWL-S). Several tools have been developed to realize both the conceptual models i.e. Web Services Execution Environment (WSMX) is the reference implementation for WSMO, on the other side OWL-S reference implementation exists in the form of loose collection of individual tools like OWL-S Editor, OWL-S Matchmaker, OWL-S Virtual Machine, OWL-S IDE, WSDL2OWL-S converter and OWL-S2UDDI converter etc. In this paper, we have conducted a comparison of both the reference implementations to identify similarities and differences between them and to evaluate their potential to become widely accepted implementation recommendations.
Scale detection based on statistical characteristics of edges in the scale space
Authors: N. Eua-Anant
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A study of the behavior of edges in the scale space is presented in this paper. Three statistical parameters, intensity average, root-mean-square, and variance of pixel intensity in edge images are used as the basis for evaluating visual quality of edge images. A parametric family of edge images containing edge information at several scales is used to create the edge statistic curves. It is found that the number of local minima in edge statistic curves is related to the number of scales in an image. This leads to an automated method for detecting scales in an image and a criteria for selecting optimal parameters for a multiscale edge operator.
The Cambridge University spoken document retrieval system
Authors: S. E. Johnson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper describes the spoken document retrieval system that we have been developing and assesses its performance using automatic transcriptions of about 50 hours of broadcast news data. The recognition engine is based on the HTK broadcast news transcription system and the retrieval engine is based on the techniques developed at City University. The retrieval performance over a wide range of speech transcription error rates is presented and a number of recognition error metrics that more accurately reflect the impact of transcription errors on retrieval accuracy are defined and computed. The results demonstrate the importance of high accuracy automatic transcription. The final system is currently being evaluated on the 1998 TREC-7 spoken document retrieval task.
A novel word clustering algorithm based on latent semantic analysis
Authors: J. R. Bellegarda, J. W. Butzberger, Yen-Lu Chow, N. B. Coccaro, D. Naik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A new approach is proposed for the clustering of words in a given vocabulary. The method is based on a paradigm first formulated in the context of information retrieval, called latent semantic analysis. This paradigm leads to a parsimonious vector representation of each word in a suitable vector space, where familiar clustering techniques can be applied. The distance measure selected in this space arises naturally from the problem formulation. Preliminary experiments indicate that, the clusters produced are intuitively satisfactory. Because these clusters are semantic in nature, this approach may prove useful as a complement to conventional class-based statistical language modeling techniques.
Compiler-managed partitioned data caches for low power
Authors: Rajiv Ravindran, Michael Chu, Scott Mahlke
Venue: ACM SIGPLAN Notices (2007)

Set-associative caches are traditionally managed using hardware-based lookup and replacement schemes that have high energy overheads. Ideally, the caching strategy should be tailored to the application's memory needs, thus enabling optimal use of this on-chip storage to maximize performance while minimizing power consumption. However, doing this in hardware alone is difficult due to hardware complexity, high power dissipation, overheads of dynamic discovery of application characteristics, and increased likelihood of making locally optimal decisions. The compiler can instead determine the caching strategy by analyzing the application code and providing hints to the hardware. We propose a hardware/software co-managed partitioned cache architecture in which enhanced load/store instructions are used to control fine-grain data placement within a set of cache partitions. In comparison to traditional partitioning techniques, load and store instructions can individually specify the set of partitions for lookup and replacement. This fine grain control can avoid conflicts, thus providing the performance benefits of highly associative caches, while saving energy by eliminating redundant tag and data array accesses. Using four direct-mapped partitions, we eliminated 25% of the tag checks and recorded an average 15% reduction in the energy-delay product compared to a hardware-managed 4-way set-associative cache.
Low delay multi-level decomposition and quantisation techniques for WI coding
Authors: N. R. Chong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

For efficient coding of speech, it is desirable to separate the slowly and rapidly evolving spectral components to take advantage of their different perceptual qualities. We present a multi-level wavelet decomposition mechanism, using low delay FIR filters, applied to waveform interpolation (WI) coding. The technique overcomes the substantial delay problems encountered by Chong, Burnett, Chicharo and Thomson (see Proc. Int Conf. Acoustics, Speech, Sig. Processing, Seattle, USA, vol. 1., p.513-16, 1998) and identifies a preferred technique for the quantisation of the decomposed surfaces. The phase is shown to be particularly sensitive to the compounding of quantisation errors within the tree-structured transform. The proposed solution involves the use of variable dimension vector quantisation (VDVQ) on separately decomposed magnitude/phase surfaces. This approach provides for coarse or no phase quantisation while maintaining high speech quality. The techniques discussed may also be applied to other transforms and to the quantisation of surfaces in the standard waveform interpolation coder.
Training Database Adequacy Analysis for Learning-Based Super-Resolution
Authors: Isabelle Begin, Frank P. Ferrie
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper explores the possibility of assessing the adequacy of a training database to be used in a learningbased super-resolution process. The Mean Euclidean Distance (MED) function is obtained by averaging the distance between each input patch and its closest candidate in the training database, for a series of blurring kernels used to construct the low-resolution database. The shape of that function is thought to indicate the level of adequacy of the database, thus indicating to the user the potential of success of a learning-based super-resolution algorithm using this database.
Stop Reinventing the Wheel
Authors: Pedro Gama
Venue: IEEE Distributed Systems Online (2007)

A review of Timothy M. O'Brien's "Jakarta Commons Cookbook"
The Wake-Up Problem in MultiHop Radio Networks
Authors: Marek Chrobak, Leszek Ga¸sieniec, Dariusz R. Kowalski
Venue: SIAM Journal on Computing (2006)

We study the problem of waking up a collection of $n$ processors connected by a multihop ad hoc ratio network with unknown topology, no access to a global clock, and no collision detection mechanism available. Each node in the network either wakes up spontaneously or gets activated by receiving a wake-up signal from another node. All active nodes transmit the wake-up signals according to a given protocol $\calW$. The running time of $\calW$ is the number of steps counted from the first spontaneous wake-up until all nodes become activated. We provide two protocols for this problem. The first one is a deterministic protocol with running time $O(n^{5/3}\log n)$. Our protocol is based on a novel concept of a shift-tolerant selector to which we refer as a (radio) synchronizer. The second protocol is randomized, and its expected running time is $O(D \log^2 n)$, where $D$ is the diameter of the network. Subsequently we show how to employ our wake-up protocols to solve two other communication primitives: leader election and clock synchronization.
Language Networks on LiveJournal
Authors: Susan C. Herring, John C. Paolillo, Irene Ramos-Vielba, Inna Kouper, Elijah Wright, Sharon Stoerger, Lois Ann Scheidt, Benjamin Clark
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Language use in 1,000 randomly-selected and 5,025 crawled LiveJournals was analyzed in order to determine the overall language demographics, the robustness of four non-English language networks (Russian, Portuguese, Finnish, and Japanese), and the characteristics of individuals who bridge between different languages on LiveJournal.com. The findings reveal that English dominates globally but not locally, network robustness is determined mostly by population size, and journals that bridge between languages are written by multicultural, multilingual individuals, or else they have broadly accessible content. Implications of these findings for cross-cultural conversation via blogs are considered.
Finding similar files in a large file system
Authors: Udi Manber
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

We present a tool, called sif, for finding all similar files in a large file system. Files are considered similar if they have significant number of common pieces, even if they are very different otherwise. For example, one file may be contained, possibly with some changes, in another file, or a file may be a reorganization of another file. The running time for finding all groups of similar files, even for as little as 25% similarity, is on the order of 500MB to 1GB an hour. The amount of similarity and several other customized parameters can be determined by the user at a post-processing stage, which is very fast. Sif can also be used to very quickly identify all similar files to a query file using a preprocessed index. Application of sif can be found in file management, information collecting (to remove duplicates), program reuse, file synchronization, data compression, and maybe even plagiarism detection.
Ontological Traceability over the Unified Process
Authors: Rodrigo Perozzo Noll, Marcelo Blois Ribeiro
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Traceability refers to the ability to link information in a process chain. This paper proposes the integration of ontologies into the Unified Process (UP) [1] to provide concept-based traceability throughout the software lifecycle. This approach allows the integration of the different models of a software system including business, requirements, analysis and design models in a lower granularity degree than conventional requirements traceability approaches. To assist the designers in creating the ontology and linking concepts to artifacts we provide a tool integrated with an UML modeler.
Self-Configured Fair Queueing
Authors: Jui-Pin Yang
Venue: Simulation (2007)

Many core-stateless mechanisms have been proposed to resolve the scalability problem in the core routers. However, they place considerable reliance on the edge routers or anterior core routers to mark correct flow information in corresponding packets. As a result, the condition of incorrect flow information may severely degrade the fairness among different flows. To achieve the robust fairness, an approximately core-stateless fair sharing mechanism, self-configured fair queuing (SCFQ) is proposed in this paper. This mechanism is mainly composed of two rate estimators; one estimator is used to estimate the arrival rate of the malicious flows that can be adopted to emend the incorrect flow information of the arrival packets. The other one is used to estimate the fair share rate. Computer Simulation is applied to compare the fairness of the SCFQ, core-stateless fair queuing (CSFQ), linear fair sharing estimation (LFSE), deficit round robin (DRR), and first in first out (FIFO). From the simulation results, the SCFQ is capable of supporting much better fairness than that of other compared mechanisms under a variety of traffic conditions. Also, the overhead of the SCFQ is low, so it is very suitable to be deployed in high-speed core routers.
Optoelectronic image processor for multiresolution Gabor filtering
Authors: H. Urey
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

An optoelectronic processor that should allow the implementation of multiresolution Gabor filtering at TV frame rates is described. The system takes the form of a TV camera with modified optics and some simple processing incorporated in the focal-plane detector array. The output of the camera is an array of images, each produced by putting the input image through an angularly-oriented Gabor-type spatial frequency filter and converting the output to baseband. Key elements of the system include: (a) bandpass spatial filtering by pupil modification of an incoherent imaging system, (b) separation of spatial lowpass and spatial bandpass structures by temporal modulation of the bandpass distribution, (c) detection of the temporally modulated distribution by VLSI circuitry in the focal-plane detector array, and (d) multiplexing of multiple spatial bandpass channels in a single smart pixel array.
Learning activities for secondary and post-secondary CS courses
Authors: P. Andrews
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

In an educational environment meant to serve all students, consideration for diverse learning styles ought to be a prerequisite for our classroom presentations. Gifted teachers know it is their concern for each and every student's progress that precedes and makes possible their effectiveness. As most of us are aware, gender and ethnicity data regarding computer science degree recipients, as well as the extremely low numbers of minority and female faculty in this discipline, show an atrocious lack of diversity. We feel teaching methods which encourage and support students with diverse learning styles communicates the commitment and concern that faculty have for all students. It is this extra attention, as much as the actual activities themselves, which may make the difference to a student who is becoming discouraged. As an added benefit, these new approaches also make ideas more accessible to students, in general since concepts presented with a variety of methods increases each student's chance of understanding.
Handling Exceptional Conditions in Mobile Collaborative Applications: An Exploratory Case Study
Authors: Nelio Cacho, Karla Damasceno, Alessandro Garcia, Thais Batista, Frederico Lopes, Carlos Lucena
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Today's maintenance operations highly depend on access to information and team expertise from various locations. To describe and to transmit such information, different hurdles have to be taken, like providing device independent content descriptions, capability dependent adaptations, integration of various reliable I/O modalities or cumbersome environment restrictions. This paper describes an infrastructure for deploying aircraft maintenance procedures to mobile workers, including a multimodal mark-up language, a semantic framework for rich and lightweight clients, and an adaptation methodology. The presented information demonstrates an approach for integrating mobile information systems into aircraft maintenance and could be used for adapting information technology (IT) to other related mobile application domains.
A note on optimal point distributions in [0,1)s
Authors: Gerhard Larcher, Friedrich Pillichshammer
Venue: Journal of Computational and Applied Mathematics (2007)

In this note we determine the infimum of the L"2-, the star- and the extreme discrepancy taken over all 2-element point sets in the s-dimensional unit cube. Moreover we give very good bounds on the infimum of the isotropic discrepancy taken over all (s+1)-element point sets in [0,1)^s.
Integrating Analytical and Simulation Techniques in Multi-Echelon Cyclic Planning
Authors: Yuri Merkuryev, Galina Merkuryeva, Bram Desmet, Eric Jacquet-Lagreze
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The ECLIPS Project "Extended Collaborative Integrated Life Cycle Supply Chain Planning System' is introduced. The discussed project scope focuses on development of concepts and technologies in the domain of supply chain planning and managing at the product maturity phase. The concerned concepts and technologies are based on integrating analytical and simulation techniques in multi-echelon cyclic planning. Analytical techniques are used under conditions of dynamic and deterministic demand. Simulation techniques provide a test environment for analytical solutions and allow modeling and optimising planning decisions under conditions of demand variability and uncertainty.
Utilization of active and cooperative learning in EE courses: three classes and the results
Authors: K. Watson
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Educational researchers confirmed that active learning strategies will result in more retention of subject matter and a deeper comprehension of the concepts covered in a class. In part this is due to the fact that these strategies require that the learner assume more responsibility, during class, for the learning environment. In conjunction with active learning, much interest has been focused on cooperative learning strategies, which require that the students operate in a more cooperative, or team, mode versus the more traditional competitive modes. In this paper three electrical engineering courses at Texas A&M University which incorporated various active and cooperative learning strategies are presented. The information does not deepen the already present research on these strategies. However, it does present detailed examples of the assignments made which utilized active and cooperative learning, the adaptations in student grading procedures which were made, the attitudes of the students during the courses, and a brief follow-up on the students a year after the courses.
Using computers to diagnose computer problems
Authors: Joshua A. Redstone, Michael M. Swift, Brian N. Bershad
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Although computers continue to improve in speed and functionality, they remain difficult to use. Problems frequently occur, and it is hard to find fixes or workarounds. This paper argues for the importance and feasibility of building a global-scale automated problem diagnosis system that captures the natural, although labor intensive, workflow of system diagnosis and repair. The system collects problem symptoms from users' desktops, rather than requiring users to describe their problems to primitive search engines, automatically searches global databases of problem symptoms and fixes, and also allows ordinary users to contribute accurate problem reports in a structured manner.
Re-use or re-invent? Understanding and supporting learning from experience of peers in a product development community
Authors: T. Liang
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

We describe usage patterns of a design information database, and discuss issues of learning and knowledge sharing through socially and technologically mediated interactions in a product design community. In the five years spanning 1994 to 1999, a database of captured design information was made available to students in a graduate level project course at Stanford University. A large amount of database access data was analyzed to discover usage patterns concerning the issue of learning from experience of peers, past and present. The results from quantitative analysis of database access log were augmented by qualitative user interviews, in which several important social issues around the usage of such peer learning systems were exposed.
Motion field estimation by vector rational interpolation for error concealment purposes
Authors: S. Tsekeridou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A study on the use of vector rational interpolation for the estimation of erroneously received motion fields of an MPEG-2 coded video bitstream has been performed. Four different motion vector interpolation schemes have been examined using motion information from available top and bottom adjacent blocks since left or right neighbours are usually lost. The presented interpolation schemes are capable of adapting their behaviour according to neighbouring motion information. Simulation results prove the satisfactory performance of the novel nonlinear interpolation schemes and the success of their application to the concealment of predictively coded frames. The motion vector rational interpolation concealment method proves to be a fast method, thus adequate for real-time applications.