ppxscal/embedding_network huggingface dataset:
A Workflow Model for Multi-Channel Applications
Authors: XianQing Wu, Richard Cooper
Venue: Proceedings of the 24th British National Conference on Databases (2007)

Design methodologies for web applications usually specify the functionality using some kind of workflow model, since the processes supported by web sites such as those used for e-commerce and information dissemination can be expressed in terms of the flow of information through the process. We are building a methodology based on a comprehensive and fully integrated model for the specification of multi-channel internet applications, i.e. ones which uses a variety of networked devices to capture and disseminate information. The model encompasses all aspects of the application including not only information management, capture and presentation, but also the implementation and deployment decisions. The part of the model which describes application functionality uses a workflow model in which the workflow process co-ordinates activities by linking presentation containers to presentation components and by linking presentation components by events such as button presses. The paper describes our workflow model and how it fits with the rest of the model.
Finding Structure in Unstructured Processes: The Case for Process Mining
Authors: W. M. P. van der Aalst, C. W. Gunther
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

Today there are many process mining techniques that allow for the automatic construction of process models based on event logs. Unlike synthesis techniques (e.g., based on regions), process mining aims at the discovery of models (e.g., Petri nets) from incomplete information (i.e., only example behavior is given). The more mature process mining techniques perform well on structured processes. However, most of the existing techniques fail miserably when confronted with unstructured processes. This paper attempts to "bring structure to the unstructured" by using an integrated combination of abstraction and clustering techniques. The ultimate goal is to present process models that are understandable by analysts and that lead to improved system/process redesigns.
Supporting Collaboration of Medical Informatics Researchers and Teams
Authors: Vili Podgorelec, Luka Pavlic
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Medical informatics is a highly interdisciplinary field of research, where a great deal of collaboration is needed to achieve efficient solutions. We are witnessing a remarkable proliferation of biomedical knowledge on one side and the revolution of communication technologies on the other. In this manner we may expect that a proper methodology to support collaboration strategies of medical informatics researchers and research teams based on knowledge, should improve the collaboration and the creativity in the field of medical informatics research. Based on the required functionalities of such a system, we propose the semantic web as the underlying technology and explain its use for knowledge sharing both within an organization and inter-organizationally.
Implementing a Distributed Mobile Calculus Using the IMC Framework
Authors: Lorenzo Bettini, Rocco De Nicola, Daniele Falassi, Michele Loreti
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In the last decade, many calculi for modelling distributed mobile code have been proposed. To assess their merits and encourage use, implementations of the calculi have often been proposed. These implementations usually consist of a limited part dealing with mechanisms that are specific of the proposed calculus and of a significantly larger part handling recurrent mechanisms that are common to many calculi. Nevertheless, also the ''classic'' parts are often re-implemented from scratch. In this paper we show how to implement a well established representative of the family of mobile calculi, the distributed @p-calculus, by using a Java middleware (called IMC - Implementing Mobile Calculi) where recurrent mechanisms of distributed and mobile systems are already implemented. By means of the case study, we illustrate a methodology to accelerate the development of prototype implementations while concentrating only on the features that are specific of the calculus under consideration and relying on the common framework for all the recurrent mechanisms like network connections, code mobility, name handling, etc.
Breathing Thorax Simulation based on Pleura Physiology and Rib Kinematics
Authors: Anne-Laure Didier, Pierre-Frederic Villard, Jean-Yves Bayle, Michael Beuve, Behzad Shariat
Venue: Proceedings of the International Conference on Medical Information Visualisation - BioMedical Visualisation (2007)

To monitor a lung mechanical model and then predict tumour motion we proposed a approach based on the pleura physiology. By comparing the predictions to landmarks set by medical experts, we observed better results with regards to the one obtained with approaches found in the literature. Beside, we focus on the rib cage kinematics, which play a significant role in the pleura outer-surface motion and therefore in the lung motion. We proposed a kinematic model of the rib cage based on the finite helical axis method and we show out interesting results.
VoIP Availability and Service Reliability through Software Rejuvenation Policies
Authors: V. P. Koutras, A. N. Platis
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Nowadays Voice over Internet Protocol (VoIP) is becoming an evolutionary technology in telecommunications. In this paper the study is focused on the resources that are allocated for VoIP calls. Resource allocation in a VoIP system and resource degradation when new demands for resources arrive at the system are modeled. To counteract resource degradation and improve availability and service reliability, we propose to perform software rejuvenation.. Moreover, the rate of resource allocation in such a system can be importantly affected by the time that an amount of resources is allocated in order to serve VoIP calls. Hence, we model software rejuvenation in a VoIP system with a semi-Markov process in order to capture the effects of time spent at resource degraded states of the system. Through the stochastic analysis of the system an optimal rejuvenation policy that maximizes system's availability is proposed and furthermore the corresponding reliability levels in means of Mean Time To Failure are derived.
"Kage no Sekai": interactive animation of shadow based on physical action
Authors: Yu Uchida, Mami Naito, Shiho Hirayama
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

"Kage no Sekai" is an interactive content. It makes us able to communicate through the actual shadow with the marvelous creatures; that we can see when we look in the shadow. The world, which we can see when we look in to the shadow of the objects on the table, is making their own world view that we won't usually find out. Users can communicate with the world of shadow by approaching to the space or, by using a shadow made by putting an object or, changing the shadow's shape by moving the object's direction or their own shadow.
Using Signatures of Self-Organisation for Monitoring and Influencing Large Scale Autonomic Systems
Authors: Martin Randles, A. Taleb-Bendiab, Philip Miseldine, David Lamb
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

The complexity of large distributed systems makes the monitoring, necessary for self-governance and autonomic functions, very problematic. Systems will be ordered hierarchically, consisting of systems of systems. Furthermore a system may be constructed from systems that are fundamentally different in topology from itself. This means that a monitoring strategy that is successful in one part of the system will not necessarily perform well in another system sector. This work considers a phase transition through four system topologies, observed to occur in the evolution of many self-organising systems, starting at a regular circular 2-d lattice to a scale-free phase. The best monitoring strategy for a scale-free system is considered with a form of acquaintance monitoring proposed. Thus when a system is observed to be acting in a scale-free manner the most suitable monitoring strategy can be deployed. This paper presents two applications that use the results of this work to monitor and influence distinct layers in network topologies.
Speaker recognition in reverberant enclosures
Authors: P. J. Castellano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper evaluates the effects of room reverberation on two automatic speaker verification (ASV) applications. Reverberation is simulated using an image method. AV is conducted with a multiple binary classifier model. Results are strongly dependent on speaker location, room size and reverberation time. ASV is poor given anechoic training but reverberant test speech. In voice activated security access, speaker locations can be identical for ASV training and testing, eliminating differences between respective impulse responses. Reverberation does not affect ASV even when it renders speech unintelligible. In covert speaker verification, speakers are uncooperative and mobile, thus test room responses unknown. By subjecting training speech to an impulse response corresponding to the centre of the room, ASV is degraded by 5.45 instead of 13.7 percent should anechoic training speech be used. Subjecting training speech to responses corresponding to two room locations does not further improve ASV performance.
Nummsquared 2006a0 explained, including a new well-founded functional foundation for logic, mathematics and computer science
Authors: Samuel Howse
Venue:  (2007)

NummSquared Explained is the thesis version of the comprehensive formal document NummSquared 2006a0 Done Formally, which is available at http://nummist.com/poohbist/. Set theory is the standard foundation for mathematics, but often does not include rules of reduction for function calls. Therefore, for computer science, the untyped lambda calculus or type theory is usually preferred. The untyped lambda calculus (and several improvements on it) make functions fundamental, but suffer from nonterminating reductions and have partially non-classical logics. Type theory is a good foundation for logic, mathematics and computer science, except that, by making both types and functions fundamental, it is more complex than either set theory or the untyped lambda calculus. This document proposes a new foundational formal language called NummSquared that makes only functions fundamental, while simultaneously ensuring that reduction terminates, having a classical logic, and attempting to follow set theory as much as possible. NummSquared builds on earlier works by John von Neumann in 1925 and Roger Bishop Jones in 1998 that have perhaps not received sufficient attention in computer science. A soundness theorem for NummSquared is proved. Usual set theory, the work of Jones, and NummSquared are all well-founded. NummSquared improves upon the works of von Neumann and Jones by having reduction and proof, by supporting computation and reflection, and by having an interpreter called NsGo (work in progress) so the language can be practically used. NummSquared is variable-free. For enhanced reliability, NsGo is an F#/C#. NET assembly that is mostly automatically extracted from a program of the Coq proof assistant. As a possible step toward making formal methods appealing to a wider audience, NummSquared minimizes constraints on the logician, mathematician or programmer. Because of coercion, there are no types, and functions are defined and called without proof, yet reduction terminates. NummSquared supports proofs as desired, but not required.
An open-ended software design project for honors freshmen-basketball statistics
Authors: R. E. Montgomery
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

It is important that engineering courses offer a learning environment that avoids the use of contrived watered down exercises, so that learning is thorough and retention is assured. To that end, a problem based on material already familiar to the students was sought for Freshman Engineering Honors programming classes. One answer is a project in basketball statistics, including data entry, data management, and report generation, that found most students enthusiastic from the day of its assignment. The first part of the project requires students to do the most fundamental activity of all: gain an understanding of the problem they are solving. To accomplish this, they collect basketball statistics, using paper and pencil (forms are provided) for a high school game from videotape. This allows the use of stop action, slow motion, and other electronic aids in their data collection activities. While the first part of the project must be completed by every individual, the remainder is performed by four member project teams, utilized throughout the course to prepare students for the group oriented work place. In Part II, the students design the user interface and data storage, then generate the code, written in the C language, for all parts of the data entry and report generation activities. The result of all this student effort is an improved knowledge of the C language, a great improvement in problem solving skills, and a marked increase in the students' confidence in their ability to incorporate the use of the computer and of programming languages and skills into their everyday work.
Improving application performance through swap compression
Authors: R. Cervera, T. Cortes, Y. Becerra
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

The performance of large applications tends to be poor due to the high overhead added by the swapping mechanism. The same problem may be found in highly-loaded multi-programmed systems where many of the running applications have to use the swap space in order to be able to execute at the same time. Furthermore, those large applications might not be able to run on laptop or home computers as their resources are usually smaller than the ones found in an office system. In this paper, we present a solution to both problems that we have implemented in the Linux kernel. The idea consists of compressing the swapped pages and keeping them in a swap cache whenever possible. We have tested this new mechanism with a set of real applications obtaining a significant performance improvement.
Improved locality for irregular sampling algorithms
Authors: H. G. Feichtinger
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper presents a method for the reconstruction of bandlimited functions from non-uniform samples by means of synthesis functions. We state explicit worst-case estimates which depend on the bandwidth and the sampling density. The proposed reconstruction method uses oversampling to deduce well-localized synthesis functions which improve the locality properties of the reconstruction. As a consequence, the resulting algorithm is suitable for local recovery of bandlimited signals from sufficiently dense local sampling information. The theoretical results are confirmed by numerical examples based on a finite-dimensional model described.
Toward an automated vulnerability comparison of open source IMAP servers
Authors: Chaos Golubitsky
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

The attack surface concept provides a means of discussing the susceptibility of software to as-yet-unknown attacks. A system's attack surface encompasses the methods the system makes available to an attacker, and the system resources which can be used to further an attack. A measurement of the size of the attack surface could be used to compare the security of multiple systems which perform the same function. The Internet Message Access Protocol (IMAP) has been in existence for over a decade. Relative to HTTP or SMTP, IMAP is a niche protocol, but IMAP servers are widely deployed nonetheless. There are three popular open source UNIX IMAP servers - UW-IMAP, Cyrus, and Courier-IMAP - and there has not been a formal security comparison between them. In this paper, I use attack surfaces to compare the relative security risks posed by these three products. I undertake this evaluation in service of two complementary goals: to provide an honest examination of the security postures and risks of the three servers, and to advance the study of attack surfaces by performing an automated attack surface measurement using a methodology based on counting entry and exit points in the code.
On the validation of API execution-sequence to assess the correctness of application upon COTS upgrades deployment
Authors: Anjaneyulu Pasala, Srinivasa Rao, Arnab Dutta Gupta, Srinivas Gunturu
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Various regression test selection strategies have been developed to establish the correctness of software systems upon deployment of COTS upgrades. These strategies recommend a smaller regression test suite to be reexecuted. We present a process that identifies the patch impact on the system and localizes the source of potential errors without executing the system test suite. The impact is analyzed based on verifying the behavior of affected COTS API execution-sequences. An API executionsequence is called affected when one or more of the altered functions of the COTS upgrade are part of COTS API execution-sequence that interfaces with application components. A wrapper-based passive test oracle has been developed to check the correctness of the behavior of these execution-sequences. The changed behavior of these execution-sequences reflects the patch impact. A case study has been conducted and the results are encouraging.
Generalized S transform
Authors: M. D. Adams
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The generalized S transform (GST), a family of reversible integer-to-integer transforms inspired by the S transform, is proposed. This family of transforms is then studied in some detail. For example, the relationship between the GST and lifting scheme is discussed, and the effects of choosing different GST parameters are examined. Some examples of specific transforms in the GST family are also given.
New algorithms for convex set constrained signal reconstruction
Authors: S. Dharanipragada
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The problem of signal reconstruction from linear measurements and convex set constraints is addressed in this paper. The currently popular POCS algorithm suffers from slow convergence and non-unique limits, whereas the recently proposed faster converging Newton algorithm requires projection onto the intersection of convex sets. In this paper, new algorithms, that retain the simplicity of the POCS algorithm, but have increased generality, and superior convergence rates, are presented. Superior convergence rates are achieved by incorporating derivative information using recent results on the differentiability of the projection operator onto a convex set. Efficient implementation of these algorithms using conjugate-gradient iterations for matrix inversion, make them suitable for large-scale problems. Computer simulations demonstrating the effectiveness of these algorithms, are also presented. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Problem solving and student performance in data structures and algorithms
Authors: Donald Chinn, Catherine Spencer, Kristofer Martin
Venue: ACM SIGCSE Bulletin (2007)

Active and problem-based learning environments strive to improve students' problem solving skills. To better understand students' problem solving processes and thus guide the structure and development of such environments, we asked students to solve data structures and algorithms problems and to verbalize their thoughts as they solved them. In this paper, we discuss methodological issues associated with the analysis of their verbalizations. We then analyze and discuss the relationship between statistics that describe students' problem solving process and their performance in the course they were taking at the time, either the data structures or algorithms course.
Strongboxes for electronic commerce
Authors: Thomas Hardjono, Jennifer Seberry
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

As electronic commerce becomes a reality, additional services related to electronic commerce will also emerge. The current paper proposes the provision of electronic strongboxes as an integrated part of the wider electronic commerce. The strongbox concept is introduced as an electronic counterpart of physical strongboxes typically found in large traditional financial institutions, such as banks, having secure vaults or other secure physical storage. The work identifies some requirements of electronic strongboxes both from the functionality perspective and from the security point of view. A simple framework for an electronic strongbox system is also presented.
Challenges with respect to the e-readiness of secondary school teachers in Kwazulu-Natal, South Africa
Authors: Desmond Wesley Govender, Manoj Maharaj
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

In this study the authors investigate the challenges facing the provincial department of education with respect to the e-Readiness of secondary school teachers in the Province of KwaZulu-Natal, South Africa. The study is based on a sample of the secondary schools in the Ethekwini Municipality. The results indicate that any ICT interventions by the provincial Department of Education are bound to fail unless other non-technological interventions are put into place first. We show that where the ICT interventions are needed the most, the teachers are least prepared to receive it. Thus we conclude that instead of making short-term political decisions, the Department must first embark on a medium to long term plan to first make the environment amenable for an ICT intervention. These would include large-scale school upgrading, teacher training and retention plans to keep experienced and qualified teachers within the schooling system.