ppxscal/embedding_network huggingface dataset:
Itinerary-Based Access Control for Mobile Tasks in Scientific Workflows
Authors: Zijiang Yang, Shiyong Lu, Ping Yang
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Current scientific workflow models require datasets to be transferred from their source to the hosts where they can be processed. This seriously impedes data-intensive applications. In order to address this limitation, we propose a notion of mobile tasks that can move from their home hosts towards datasets and perform computation on the dataset side. Since a mobile task might migrate across various administrative domains and get executed at multiple hosts, it is critically important to ensure the security of a mobile-task- based workflow system. In this paper, we propose an itinerary-based access control model to ensure the secure migration of mobile tasks.
Weak second-order stochastic Runge-Kutta methods for non-commutative stochastic differential equations
Authors: Yoshio Komori
Venue: Journal of Computational and Applied Mathematics (2007)

A new explicit stochastic Runge-Kutta scheme of weak order 2 is proposed for non-commutative stochastic differential equations (SDEs), which is derivative-free and which attains order 4 for ordinary differential equations. The scheme is directly applicable to Stratonovich SDEs and uses 2m-1 random variables for one step in the m-dimensional Wiener process case. It is compared with other derivative-free and weak second-order schemes in numerical experiments.
Improving usability of information flow security in java
Authors: Scott F. Smith, Mark Thober
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

This paper focuses on improving the usability of information flow type systems. We present a static information flow type inference system for Middleweight Java (MJ) which automatically infers information flow labels, thus avoiding the need for a multitude of program annotations. Additionally, policies need only be specified on IO channels, the critical flow boundary. Our type system includes a high degree of parametric polymorphism, necessary to allow classes to be used in multiple security contexts, and to properly distinguish the security policies of different IO channels. We prove a noninterference property for programs that interactively input and output data. We then describe a mechanism that allows users to define top-level policies, which automatically inserts the security policies at the proper points in the program. This provides the further benefit that whomever is defining the policy does not necessarily need intimate knowledge of the program source
Frame level noise classification in mobile environments
Authors: K. El-Maleh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

Background environmental noises degrade the performance of speech-processing systems (e.g. speech coding, speech recognition). By modifying the processing according to the type of background noise, the performance can be enhanced. This requires noise classification. In this paper, four pattern-recognition frameworks have been used to design noise classification algorithms. Classification is done on a frame-by-frame basis (e.g. once every 20 ms). Five commonly encountered noises in mobile telephony (i.e. car, street, babble, factory, and bus) have been considered in our study. Our experimental results show that the line spectral frequencies (LSFs) are robust features in distinguishing the different classes of noises.
Some structural and geometric properties of two-connected steiner networks
Authors: K. Hvam, L. Reinhardt, P. Winter, M. Zachariasen
Venue: Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65 (2007)

We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survivable communication networks. A SMN decomposes into components that are full Steiner trees. Winter and Zachariasen proved that all cycles in SMNs with Steiner points must have two pairs of consecutive terminals of degree 2. We use this result and the notion of reduced block-bridge trees of Luebke to show that no component in a SMN spans more than approximately one-third of the terminals. Furthermore, we show that no component spans more than two terminals on the boundary of the convex hull of the terminals; such two terminals must in addition be consecutive on the boundary of this convex hull. Algorithmic implications of these results are discussed.
Instant Learning Sound Sensor for Ubiquitous Computing
Authors: Yuya Negishi, Nobuo Kawaguchi
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

We propose a smart sound sensor for ubiquitous computing that can learn and detect events from various sensor information with a time series signal. Using the smart sensor, a developer of a context-aware system and ubiquitous service can easily utilize a real world sound as a context information without a signal processing programming. The signal processing method can be extended for the other sensors such as accelerometer and directional sensor, pressure sensor, etc. By the experiment, we evaluate the feasibility of the instant learning sound sensor.
Modular Synthesis of Discrete Controllers
Authors: Petra Malik, Robi Malik, David Streader, Steve Reeves
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

This paper presents supervisory control theory in a process-algebraic setting, and proposes a way of synthesising modular supervisors that guarantee nonblocking. The framework used includes the possibility of hiding actions which results in nondeterminism. As modularity crucially depends on the process equivalence used, the paper studies possible equivalences and points out that, in order to be consistent with respect to the nonblocking property and to supervisor synthesis, a conflict-preserving equivalence must be used. It applies the results to synthesise nonblocking modular supervisors for a manufacturing system.
The arbitrary Boolean publish/subscribe model: making the case
Authors: Sven Bittner, Annika Hinze
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

In this paper, we present BoP, a content-based publish/subscribe system for arbitrary Boolean subscriptions and advertisements. BoP targets at the time and space-efficient matching of event messages using the wide-spread attribute-value pair event model. In contrast to other content-based publish/subscribe systems focussing on an efficient matching process, BoP internally supports subscriptions and advertisements as arbitrary Boolean expressions. As we will show in this paper, directly handling these representations leads to efficiency benefits for applications using this class of expressions. The support of arbitrary Boolean subscriptions and advertisements requires the introduction of efficient matching and overlapping calculation algorithms, as well as applicable routing optimizations. In this paper, we will outline these solutions that have been integrated into BoP. The evaluation part of this work presents the results of a comparative study of our approaches and recent conjunctive solutions.
WDM Cluster Ring: A Low-Complexity Partitionable Reconfigurable Processor Interconnection Structure
Authors: KHALED A. ALY, PATRICK W. DOWD
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Wavelength selectivity of light sources and fil ters enable reconfigurable and partitionable parallel computer interconnection at low space complexity via wavelength-division multiplexing (WDM). Large scale processor networks can be built by mixing wavelength-division and passive space-division. In a multi-domain WDM network clusters of processors can be assigned ordered wavelength channel sets such that interprocessor communication takes place on a conflict-free point-to-point basis. This paper presents a multi-domain WDM processor interconnec tion structure based on a ring of processor clusters. The cluster ring has a limited space complexity and is easily partitionable into sub-networks, each can be reconfigured to multiple connectivities by appropriately tuning node transceivers. Reconfiguration of arbitrarily-sized sub-networks into grids, binary trees, and multi stage connectivities is demonstrated. The objective is supporting multi-user parallel computing with a relaxed application depen dence on the physical interconnection topology.
A Generic Coordination Architecture as an Enabler for Mobile Collaborative Applications
Authors: Manfred Bortenschlager, Sigi Reich, Gabriele Kotsis
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Recent technological advances in hardware manufacturing and wireless communication systems result in a tremendous increase of heterogeneous computing elements involved in mobile and pervasive environments. Therefore, the complexity of systems supporting mobile collaboration is steadily increasing. To guarantee a certain level of service quality, coordination of this manifold of entities is required. Current approaches in pervasive computing usually address this demand inappropriately and consequently, inhere significant drawbacks when it comes to modularity, reusability, exchangeability, and extensibility of the implicit coordination mechanisms. This work proposes an explicit, generic two-layered coordination architecture which particularly aims at the specific characteristics of mobile and pervasive computing environments necessary for collaborative applications. This architecture comprises (i) the coordination media layer adhering to the decentralised space-based computing paradigm, and (ii) the coordination patterns layer proposing several problem-specific patterns. The idea is to provide a catalogue of reusable coordination patterns similar to the concept of software design patterns.
Morphological/rank neural networks and their adaptive optimal design for image processing
Authors: L. F. C. Pessoa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We formulate a general class of neural network based filters, where each node is a morphological/rank operation. This type of system is computationally efficient since no multiplications are necessary. The introduction of such networks is partially motivated from observations that internal structures of a neuron can generate logic operations. An efficient adaptive optimal design procedure is proposed for these networks, based on the back-propagation algorithm. The procedure is optimal under the LMS criterion. Finally, experimental results are illustrated in problems of noise cancellation, encouraging the use of such class of systems and its training algorithm as important tools for nonlinear signal and image processing.
Implementation of a reliable remote memory pager
Authors: Evangelos P. Markatos, George Dramitinos
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

Traditional operating systems use magnetic disks as paging devices, even though the cost of a disk transfer measured in processor cycles continues to increase. In this paper we explore the use of remote main memory for paging. We describe the design, implementation and evaluation of a pager that uses main memory of remote workstations as a faster-than-disk paging device and provides reliability in case of single workstation failures. Our pager has been implemented as a block device driver linked to the DEC OSF/1 operating system, without any modifications to the kernel code. Using several test applications we measure the performance of remote memory paging over an Ethernet interconnection network and find it to be faster than traditional disk paging. We evaluate the performance of various reliability policies and prove their feasibility even over low bandwidth networks, like Ethernet. We conclude that the benefits of reliable remote memory paging in workstation clusters are significant today and will probably increase in the near future.
A test for detection of local modeling mismatches in shallow water
Authors: G. S. Fostick
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper presents a new, non-parametric test for detecting modeling mismatches in a propagation medium, as shallow water. The test is based on the fact that if there are no model uncertainties, the corresponding modal spectrum of the received signal is strictly band-limited to an a-priori known band. Any mismatches in the assumed model cause the modal spectrum out of this band to be non-zero. To make the test independent of the emitters characteristic we use the generalized likelihood ratio test which uses maximum likelihood estimate of the unknown modal spectrum. We demonstrate the operation of the proposed test by applying it (via computer simulations) to a complex, practical scenario.
A Reliable Component-Based Architecture for E-Mail Filtering
Authors: Wilfried N. Gansterer, Andreas G. K. Janecek, Peter Lechner
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

A three-component architecture for the classification and filtering of unsolicited bulk and commercial e-mail ("spam") is introduced. The first component, an enhanced self-learning variant of greylisting, sets the stage for the following feature extraction and classification components. Through the temporary rejection of selected messages by the greylisting component time becomes available for an "offline" in-depth examination of the e-mail content before the message is accepted and delivered to the final recipient. Within the feature extraction component a set of features for each newly arriving e-mail message is determined. These features are then used for the categorization of a message within the classification engine, which contains the adaptation of a vector space model. Based on this model, an implementation of latent semantic indexing for spam filtering is investigated. The architecture proposed contributes to the goal of minimizing the waste of resources caused by spam and is able to react to high load situations (including DoS attacks) via adaptations in the feature extraction and classification components.
ESCAPE for minorities and women
Authors: A. J. Gentry, W. K. LeBold
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Engineering is becoming more diverse both technically and culturally. Under represented minorities and women are playing an increasing role in the advancement of engineering knowledge. ESCAPE, Engineering Specific Career Advisory Problem Solving Environment, is being developed as an interactive computer program to help students acquire information and knowledge related to engineering and to assist in career decisions. With the conversion of the program from the limited Hypercard environment to the multi platform accessibility via the World Wide Web, the content is being expanded to include information specifically related to minorities and women. Chronological information within the different fields of engineering is included to give a historical context. Documentation regarding the increasing diversity of bachelor master and doctoral recipients and in the engineering workforce demonstrate the changes taking places in engineering education. Organizations such as the Society of Women Engineers (SWE) are included along with membership information. Professional journals in addition to electronic network discussion and mail groups are included with some subscription information. As each school system becomes a node on the World Wide Web, the potential number of engineering students increases. The information on minorities and women will assist students who have never been aware of engineering to consider it as a career and possibly become the next engineer to advance the field of engineering.
Developing freshman-year experience in electrical engineering: primary functions and possible features
Authors: M. Nahvi
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

A typical freshman-year electrical engineering program does not include EE courses or laboratories. Electrical engineering courses in general are not offered until the sophomore year, and even then they seem to be abstractions and mathematics disguised as engineering. For a student who is interested in electrical engineering and intends to practice the profession, this is not encouraging. However, developing a new course sequence for freshman-year experience in electrical engineering which goes beyond promoting the field and motivating students is a challenging task. The task begins with analysis of the problem, study of market forces, determination of goals, evaluation of the existing environment, determination of the value of existing tools and the need for new courseware. The paper discusses some of the above tasks in relation to an on-going activity to develop a sequence of integrated courses and laboratories which would serve as a powerful vehicle for freshman experience in electrical engineering. It summarizes primary functions, possible features, and expected outcome of such an activity which were concluded from a year-long study and deliberation on the subject. The paper then presents, in draft form, what is proposed for a freshman course sequence and its implementation plans. 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
Power-efficient Instruction Encoding Optimization for Embedded Processors
Authors: A. Chattopadhyay, D. Zhang, D. Kammler, E. M. Witte
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The increasing complexity of applications with shortening timeto- market window created a strong research interest towards highperformance and flexible processors. A huge application domain, chiefly consisting of wireless and handheld devices, strongly requires this class of processors to be power-efficient, too. Within this domain, a demanding problem is to determine the instruction encoding of the processor for achieving minimum power consumption in the instruction bus and in the instruction memory. In this paper, a framework for determining power-efficient instruction encoding is presented. We have integrated existing and novel techniques in this framework and have proposed novel heuristic approaches. The framework accepts an existing processor instruction-set and a group of applications. The output, which is an optimized instruction encoding under the constraints of a well-defined cost model, minimizes the power consumption of the instruction bus and the instruction memory. This results in strong reduction of the overall power consumption. Case studies with commercial embedded processors show the effectiveness of this framework.
Four-Dimensional Wavelet Compression of 4-D Medical Images Using Scalable 4-D SBHP
Authors: Ying Liu, William A. Pearlman
Venue: Proceedings of the 2007 Data Compression Conference (2007)

This paper proposes a low-complexity wavelet-based method for progressive lossy-tolossless compression of four dimensional (4-D) medical images. The Subband Block Hierarchial Partitioning (SBHP) algorithm is modified and extended to four dimensions, and applied to every code block independently. The resultant algorithm, 4D-SBHP, efficiently encodes 4D image data by the exploitation of the dependencies in all dimensions, while enabling progressive SNR and resolution decompression. The resolution scalable and lossy-to-lossless performances are empirically investigated. The experimental results show that our 4-D scheme achieves better compression performance on 4-D medical images when compared with 3-D volumetric compression schemes.
Impact of Data Placement on Parallel I/O Systems
Authors: J. B. Sinclair, J. Tang, P. J. Varman, B. R. Iyer
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

The I/O performance of several concurrent external merge jobs sharing a parallel I/O system is studied. The placement of the runs is found to have a significant impact on performance. Placements leading to serialization among jobs were identified and analyzed, and solutions discussed. Contrary to the behavior of a single merge, increasing the buffer size in this situation may actually degrade performance.
Bit Recycling with Prefix Codes
Authors: Danny Dube, Vincent Beaudoin
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Many data compression methods fail to remove all redundancy from a clear-text file partly because they allow it to be encoded into many different compressed files. The compressed files are different in the sense that they are different sequences of bits. However, they are equivalent in the sense that, by decompressing any of them, we recover the clear-text file exactly. The existence of multiple encodings tends to increase the size of the compressed files. One of the causes behind multiplicity is the existence of equivalent messages.
Students' emerging understanding of the command-driven computer algebra system maple in a semester calculus course
Authors: Thomas Edwards
Venue:  (2006)

There are many potential benefits to incorporating CASs into the mathematics classroom; however, the impact of CAS on mathematics education has in many cases, not been as dramatic, as was anticipated. Maple, a command-driven CAS used in many post-secondary schools, was not originally designed for educational use. In order to fully realize the potential benefits of this type of CAS, a better understanding of the process that students go through as they learn to use the software effectively is needed. The purpose of this study was to explore the instrumentation process of students learning to use the command-driven CAS Maple during a semester calculus course. A collective case study was employed to examine students' emerging proficiency with the CAS in an instructional setting that used individual as well as group assignments to assist students in learning the software. Video tapes of students working with the software as they completed interview tasks, audio-tapes of interviews, and students' CAS assignments were analyzed.Many common features of students' instrumentation process were observed. Common obstacles, similar approaches, opportunities of mathematical growth, working styles, the level and nature of proficiency achieved, as well as student attitudes towards the inclusion of Maple in the curriculum are discussed. Implications of these finding for successfully incorporating a command-driven CAS such as Maple are also discussed.