ppxscal/embedding_network huggingface dataset:
A Framework for Scheduling Image Processing Applications in MedioGRID
Authors: Marcela S. Boboila, George V. Iordache, Florin Pop, Valentin Cristea
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

This paper presents a scheduling framework that is configured for, and used in MedioGRID, a system for real-time processing of satellite images, operating in a Grid environment. Our work addresses the problem of scheduling various computationally intensive and data intensive applications that are required for extracting information from satellite images. The proposed solution allows mapping of image processing applications onto available MedioGRID resources. The scheduling is done at the level of groups of concurrent applications. It demonstrates a very good behavior for scheduling and executing groups of applications, while also achieving a near-optimal utilization of the MedioGRID resources.
Minimizing search errors due to delayed bigrams in real-time speech recognition systems
Authors: M. Woszczyna
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

When building applications from large vocabulary speech recognition systems, a certain amount of search errors due to pruning often has to be accepted in order to obtain the required speed. We tackle the problems resulting from aggressive pruning strategies as typically applied in large vocabulary systems to achieve close to real-time performance. We consider a typical scenario of a two pass Viterbi search with the first pass being organized as a phoneme (allophone) tree. For such a tree organized lexicon, there are two possibilities to use a bigram language model: either by building tree copies or by using so-called delayed bigrams. Since copying trees turns out to be too expensive for real time applications we basically refer to delayed bigrams, discuss their drastic influence on the word accuracy and show how to alleviate the disastrous effect of delayed bigrams under aggressive pruning.
Towards a resilient operating system for wireless sensor networks
Authors: Hyoseung Kim, Hojung Cha
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Active research has recently been conducted on large scale wireless sensor networks, especially network management and maintenance, but the technique for managing application errors on MMU-less sensor node devices has not been seriously considered. This paper presents a resilient operating system mechanism for wireless sensor networks. The proposed mechanism separates the kernel from the user execution area via dual mode operation, and the access violation of applications is controlled by static/dynamic code checking. The experiment results on a common sensor node show that the proposed mechanisms effectively protect the system from errant applications.
A structured low-rank wavelet solver for the Ornstein-Zernike integral equation
Authors: M. V. Fedorov, H. -J. Flad, G. N. Chuev, L. Grasedyck, B. N. Khoromskij
Venue: Computing (2007)

In this article, we present a new structured wavelet algorithm to solve the Ornstein-Zernike integral equation for simple liquids. This algorithm is based on the discrete wavelet transform of radial distribution functions and different low-rank approximations of the obtained convolution matrices. The fundamental properties of wavelet bases such as the interpolation properties and orthogonality are employed to improve the convergence and speed of the algorithm. In order to solve the integral equation we have applied a combined scheme in which the coarse part of the solution is calculated by the use of wavelets and Newton-Raphson algorithm, while the fine part is solved by the direct iteration. Tests have indicated that the proposed procedure is more effective than the conventional method based on hybrid algorithms.
Resolution for Max-SAT
Authors: María Luisa Bonet, Jordi Levy, Felip Manyà
Venue: Artificial Intelligence (2007)

Max-SAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolution-like calculus for Max-SAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof we derive an exact algorithm for Max-SAT and a time upper bound. We also define a weighted Max-SAT resolution-like rule, and show how to adapt the soundness and completeness proofs of the Max-SAT rule to the weighted Max-SAT rule. Finally, we give several particular Max-SAT problems that require an exponential number of steps of our Max-SAT rule to obtain the minimal number of unsatisfied clauses of the combinatorial principle. These results are based on the corresponding resolution lower bounds for those particular problems.
Cloneable JVM: a new approach to start isolated java applications faster
Authors: Kiyokuni Kawachiya, Kazunori Ogata, Daniel Silva, Tamiya Onodera, Hideaki Komatsu, Toshio Nakatani
Venue: Proceedings of the 3rd international conference on Virtual execution environments (2007)

Java has been successful particularly for writing applications in the server environment. However, isolation of multiple applications hasnot been efficiently achieved in Java. Many customers require that their applications are guarded by independent OS processes, but starting a Java application with a new process results in a long sequence of initializations being repeated each time. To date, there has been no way to quickly start a new Java application as an isolated OS process. In this paper, we propose a new isolation approach called Cloneable JVM to eliminate this startup overhead in Java. The key idea is to createa new Java application by copying, or cloning, the already-initialized image of the primary JVM process. Since the clone is already initialized, it can begin actual operations immediately as a new isolated process. This cloning abstraction can support new scenarios for Java, such as user isolation and transaction isolation. We implemented a prototype of the Cloneable JVM by modifying a production JVM on Linux, which provides a new API for cloning constructed on the Isolate API defined in JSR 121. Using this cloning API, several Java applications, including a large production J2EE application server, we remodified to demonstrate the isolation scenarios. Evaluations using these prototypes showed that new ready-to-serve Java applications can start up as a new process in less than 5 seconds, which is 4 to 170 times faster than starting these applications from scratch.
Direct and inverse problems of high-viscosity fluid dynamics
Authors: A. I. Korotkii, I. A. Tsepelev
Venue: Automation and Remote Control (2007)

Methods and algorithms of numerical simulation for three-dimensional thermal-convective motions of the inhomogeneous high-viscosity incompressible fluid in the direct and inverse time are described. In contrast to the direct-time problem, the inverse-time problem is ill-posed; to solve it, one of the variants of the quasi-reversibility method is used. The main attention is focused on the organization of effective computing processes on parallel-action computers. As an example, simulation results of the inverse problem of restoration of development history of thermal mantle plumes are given.
Learning by game-building: a novel approach to theoretical computer science education
Authors: Laura Korte, Stuart Anderson, Helen Pain, Judith Good
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

This paper describes an innovative method for teaching modelling skills in theoretical computer science (e.g. finite state automata, Turing machines). Students acquire a new modelling skill by completing a game-building assignment in which there is a direct and transparent mapping between the game that the student is building and the model in the framework they are trying to master. Through this constructionist approach, the student not only learns by doing, which potentially contributes to understanding, but there is also a significant element of personalization and choice present, which has the potential to increase both motivation and performance.
Simultaneous Component and Clustering Models for Three-way Data: Within and Between Approaches
Authors: Maurizio Vichi, Roberto Rocci, Henk A. L. Kiers
Venue: Journal of Classification (2007)

In this paper two techniques for units clustering and factorial dimensionality reduction of variables and occasions of a three-mode data set are discussed. These techniques can be seen as the simultaneous version of two procedures based on the sequential application of k-means and Tucker2 algorithms and vice versa. The two techniques, T3Clus and 3Fk-means, have been compared theoretically and empirically by a simulation study. In the latter, it has been noted that neither T3Clus nor 3Fk-means outperforms the other in every case. From these results rises the idea to combine the two techniques in a unique general model, named CT3Clus, having T3Clus and 3Fk-means as special cases. A simulation study follows to show the effectiveness of the proposal.
A Dynamic Attribute-Based Load Shedding Scheme for Data Stream Management Systems
Authors: Amit Ahuja, Yiu-Kai Ng
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

A data stream being transmitted over a network channel with capacity less than the data transmission rate of the data stream causes sequential network problems. In this paper, we present a new approach for shedding less-informative attribute data from a data stream to maintain a data transmission rate less than the network channel capacity1. A scheme for shedding attributes and their data, instead of tuples, becomes imperative in data stream load shedding, since shedding a complete tuple would lead to shedding informative attribute data along with less-informative attribute data in the tuple. Our load shedding approach handles intra-stream, as well as interstream, load shedding such that the former sheds less-informative attribute data in a single data stream, whereas the latter sheds less-informative attribute data from multiple streams. Our load shedding approach, (i) handles wide range of data streams in different application domains, and (ii) is dynamic in nature.
Foundational certification of data-flow analyses
Authors: Maria Joao Frade, Ando Saabas, Tarmo Uustalu
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Data-flow analyses, such as live variables analysis, available expressions analysis etc., are usefully specifiable as type systems. These are sound and, in the case of distributive analysis frameworks, complete wrt. appropriate natural semantics on abstract properties. Applications include certification of analyses and "optimization" of functional correctness proofs alongside programs. On the example of live variables analysis, we show that analysis type systems are applied versions of more foundational Hoare logics describing either the same abstract property semantics as the type system (liveness states) or a more concrete natural semantics on transition traces of a suitable kind (future defs and uses). The rules of the type system are derivable in the Hoare logic for the abstract property semantics and those in turn in the Hoare logic for the transition trace semantics. This reduction of the burden of trusting the certification vehicle can be compared to foundational proof-carrying code, where general-purpose program logics are preferred to special-purpose type systems and universal logic to program logics. We also look at conditional liveness analysis to see that the same foundational development is also possible for conditional data-flow analyses proceeding from type systems for combined "standard state and abstract property semantics.
A socratic ask system: helping educators provide a socratic tutor for learners
Authors: Christopher K. Riesbeck
Venue:  (2006)

An important role an educator can play in a learning environment is making learners aware of issues, nuances, and problems through Socratic questioning. Prior research has shown the potential of Socratic dialogue for increasing reflection and learning. Providing sufficient Socratic mentoring is a challenge in courses with large enrollments. To address that problem, I designed and studied a mentoring system called Socratic ASK (Sask). Experienced educators design Web-based mentors, called Sask Mentors, with a provided Web-based authoring tool. Mentors are designed to augment educators' mentoring by providing more access and exposure to their Socratic dialogue. The Mentor interface is designed to facilitate a Socratic conversation with learners, including encouraging them to reflect on their learning task and express their own hypotheses. Educators can also link Mentor utterances to display any Web content, including video clips or simulations. Data from a quasi-experimental study in a Biomedical Engineering laboratory course show that increasing the amount of available Socratic mentors in a learning activity by using a Sask Mentor called the Dialysis Mentor fostered observed problematization and Task-Situated Reflection from students (in stages of the lesson the software was designed to handle). Dialysis Mentor usage had no significant effect on a delayed assessment of learning except for students who scored above the median on a pre-test. However, Dialysis Mentor usage had a large negative effect on an immediate assessment of learning. Qualitative analysis of students' and mentors' dialogue revealed both the Dialysis Mentor's and the Sask System architecture's educationally beneficial features and opportunities for improvement, including the possible need for dynamic cognitive modeling found in Intelligent Tutoring Systems without making the authoring process too burdensome or resource intensive for educators. This work has important implications for the usefulness of simple Socratic software mentors. It provides a basic theoretical framework for fostering problematization and Task-Situated Reflection through Socratic dialogue as well as software that can be used to refine the framework.
A dossier driven persistent objects facility
Authors: Robert Mecklenburg, Charles Clark, Gary Lindstrom, Benny Yih
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

We describe the design and implementation of a persistent object storage facility based on a dossier driven approach. Objects are characterized by dossiers which describe both their language defined and "extra-linguistic" properties. These dossiers are generated by a C++ preprocessor in concert with an augmented, but completely C++ compatible, class description language. The design places very few burdens on the application programmer and can be used without altering the data member layout of application objects or inheriting from special classes. The storage format is kept simple to allow the use of a variety of data storage backends. In addition, these dossiers can be used to implement (or augment) a run-time typing facility compatible with the proposed ANSI C++ standard. Finally, by providing a generic object to byte stream conversion the persistent object facility can also be used in conjunction with an interprocess communication facility to provide object-level communication between processes.
An AS engineering degree program via ALN
Authors: J. Sener
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

In the Fall 1997 semester, Northern Virginia Community College (NVCC), through its Extended Learning Institute (ELI), is offering what is to our knowledge the first Associate in Science (AS) engineering degree available via distance education to home-based learners in the US. Funded largely by grants from the Alfred P. Sloan Foundation during the past four years, NVCC/ELI has developed the engineering, mathematics, chemistry and physics courses required to offer a complete AS engineering degree program. This paper describes how NVCC/ELI has incorporated asynchronous learning networks (ALNs) into its math, science, and engineering courses and highlights some of the issues involved in developing ALNs for home-based community college students.
DSN 2007 Workshops
Authors: Christof Fetzer
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Workshops at DSN provide a forum for a group of participants (typically 20 to 50 in size) to interact and exchange opinions on topics related to any of the many facets of dependable systems and networks. We welcome participation by professionals from a range of diverse backgrounds who can contribute to advancing the technology and understanding of the workshop subject.
A projection method to generate anaglyph stereo images
Authors: E. Dubois
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

An anaglyph image allows the perception of depth when observed through colored glasses such as the familiar red/blue glasses. Although the method is very old, the techniques used to generate anaglyph images are very empirical. This paper describes a projection method to generate anaglyph stereoscopic images using the spectral absorption curves of the glasses, the spectral density functions of the display primaries and the colorimetric properties of the human observer.
Feature matching and target recognition in synthetic aperture radar imagery
Authors: R. Meth
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

An approach for target matching in synthetic aperture radar (SAR) imagery is presented. The method is feature based where feature points in a target candidate are matched against those from an exemplar database. Matching is formulated as a non-linear optimization problem that encourages matches while minimizing the distance between the matched features. The formulation allows for missing, spurious and shifted feature points. A non-linear function is used to convexify the search space to enhance the search for the minimum objective cost. Extensions are presented for the use of two different feature types in the matching. Registration of the images is computed during the matching process in an iterative manner. Matching results are presented for simulated XPATCH and real MSTAR SAR target imagery.
The development and integration of a distributed 3D FFT for a cluster of workstations
Authors: Christopher E. Cramer, John A. Board
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

In this paper, the authors discuss the steps taken in the formulation of a parallel 3D FFT with good scalability on a cluster of fast workstations connected via commodity 100 Mb/s ethernet. The motivation for this work is to improve the performance and scalability of the Distributed Particle Mesh Ewald (DPME) N-body solver. Scalability issues in the FFT and DPME as an application are presented separately. Also discussed are scalability issues related to the networking hardware used in the cluster. Results indicate that the existence of a parallel FFT significantly improves performance in DPME from a maximum of 5 processors to at least 24 processors on a cluster of workstations. This has an associated increase in speedup from 4 to 12 times faster than the serial version.
Decomposition of superimposed waveforms using the cross time frequency transform
Authors: P. Bonato
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The identification of the timing of the discharges of groups of muscle fibers (motor units) is of utmost importance in research into the strategies employed by the central nervous system in producing muscle force as well as in the clinical diagnosis of neuromuscular diseases. The process involves the recognition of unique shapes (action potentials) contributed by different motor units at random times throughout a muscle contraction. This paper addresses a specific aspect, of the identification process: the decomposition of the compound signal when the action potentials of two or more motor units are superimposed. We propose a cross-time-frequency-based procedure to identify which two (out of a previously identified collection of waveforms) are included in a superposition. The procedure also determines the relative delay of the two waveforms.
Improving software practice through education: Challenges and future trends
Authors: Timothy C. Lethbridge, Jorge Diaz-Herrera, Richard J. Jr. LeBlanc, J. Barrie Thompson
Venue: 2007 Future of Software Engineering (2007)

We argue that the software engineering (SE) community could have a significant impact on the future of the discipline by focusing its efforts on improving the education of software engineers. There are some bright spots such as the various projects to codify knowledge, and the development of undergraduate SE programs. However, there remain several key challenges, each of which is addressed in this paper: The challenges are 1) making programs attractive to students, 2) focusing education appropriately, 3) communicating industrial reality more effectively, 4) defining curricula that are forward-looking, 5) providing education for existing practitioners, 6) making SE education more evidencebased, 7) ensuring that SE educators have the necessary background, and 8) raising the prestige and quality of SE educational research. For each challenge, we provide action items and open research questions.
Teaching AJAX in web-centric courses
Authors: Chrisina Draganova, Vassil Vassilev
Venue: ACM SIGCSE Bulletin (2007)

Asynchronous JavaScript and XML (AJAX) is a web development technique for building responsive web applications behaving in a similar fashion to traditional desktop applications. This poster illustrates ideas for teaching the AJAX technique in web-centric courses based on the experience of implementing these ideas at London Metropolitan University and provides links to resources appropriate for use in laboratorial work.
Multi-level design teams: a success story?
Authors: J. Clayton
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

A study of student team evolution, performance and strident satisfaction was completed in a novel, vertically-integrated materials science and engineering design course that included mixed sophomore, junior and senior teams. This course explored a new learning model where students at different grade levels worked together to solve small design problems. The course included simple analysis-oriented quizzes and team-based design projects. Each team had members spanning grade levels. In addition, teams were given guidelines for team functioning and recordkeeping, and were evaluated on performance in these areas. The impact of the vertically-integrated student team experiences was evaluated by means of a questionnaire administered before and after the experience. Questionnaire responses were evaluated and statistically significant results are reported.