ppxscal/embedding_network huggingface dataset:
Design projects for digital and process control courses
Authors: G. Beauchamp-Baez
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Design projects for two advanced undergraduate control courses: process instrumentation and control engineering; and digital control, are discussed. Projects emphasize practical as well as theoretical aspects of design and implementation of control system loops. Projects of the process control course emphasize implementation aspects such as sensors, signal conditioning and transmission, actuators and PID controller tuning. Projects of the digital control course emphasize theoretical aspects such as modeling, linear analysis, digital controller design and closed loop system performance simulation as well as practical aspects such as actual implementation of digital controllers using a digital computer. The programs MATLAB and Simulink are used to analyze the system, design controllers and simulate controller performance. The program LabVIEW is used to facilitate the implementation of controllers. These projects help students to understand theoretical and practical aspects of control systems and serve as active learning tools that accomplish a lot more than can be accomplished in the classroom and even with design projects whose performance are only simulated in a computer.
Permanent web publishing
Authors: David S. H. Rosenthal, Vicky Reich
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

LOCKSS (Lots Of Copies Keep Stuff Safe) is a prototype of a system to preserve access to scientific journals published on the Web. It is a majority-voting fault-tolerant system that, unlike normal systems, has far more replicas than would be required just to survive the anticipated failures. We are exploring techniques that exploit the surplus of replicas to permit a much looser form of coordination between them than conventional fault-tolerant technology would require.
A Trust-enabled P2P Recommender System
Authors: Georgios Pitsilis, Lindsay Marshall
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

In this paper we present a trust-oriented method that can be used when building P2P recommender systems. We discuss its benefits in comparison to centralized solutions, its requirements, its pitfalls and how these can be overcome. We base the formation of trust on evidential reasoning and designed with ease of adoption by existing infrastructures in mind. The paper includes a first analysis of performance based on a simulation used to investigate the impact on scalability and thus show the applicability of the protocol
Cross-layer algorithms for mobile wireless networks
Authors: Bharat Bhargava, Michael Zoltowski
Venue:  (2006)

Cross-layer design for mobile wireless networks is becoming increasingly important. This is due to the limited wireless resources, dynamic network topology, and the different quality of service requirements of applications. How to enable various data applications on the resource-limited wireless networks under dynamic environments is the focus of this dissertation. Cross-layer design is employed such that different layers cooperate in an organized and optimal or sub-optimal way. Several cross-layer algorithms and protocols are proposed and investigated for different mobile wireless networks, including cross-layer rate and error control algorithms for real-time data transmission over error-prone wireless links, cross-layer overlay searching protocol for wireless mesh networks, efficient and reliable cross-layer data broadcast algorithms for wireless personal area networks or sensor networks, and cross-layer analysis of the capacity of any-size wireless ad hoc networks with application to ultra wideband ad hoc networks.
A model of best practices for project management strategies in an administrative computing system implementation in higher education
Authors: John Scigliano
Venue:  (2007)

The purpose in this research was to investigate the use of project management best practices in an enterprise resource planning (ERP) implementation in higher education. ERP packages are well known information systems in support of all functional areas of an academic institution. However their successful implementation has not only eluded the private sector but the non-profit sector as well. Specifically higher education institutions are different because of their structure of administration and academics. This collegial structure based on academic self governance is unique and therefore poses additional issues. Furthermore, proven project management methodologies and best practices have also by-passed higher education.The critical success factors (CSF) for ERP implementations were found in the literature. The combination of project management best practices and these CSFs presented an opportunity for forming a best practice model for academic institutions to follow. A survey was administered via the web to gather information from higher educational institutions to see if they not only used these factors but followed any project management methodologies. Analysis showed that those institutions that followed project management best practices, and instituted factors that were needed for successful implementations, indeed had a successful implementation. This research also produced a model for academic institutions to follow in their administrative computing implementations.
Signal modeling and parameter estimation for 1/f processes using scale stationary models
Authors: B. Yazici
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In our previous work, we proposed two classes of self-similar models for 1/f processes which we referred to as scale stationary and p-self similar models. We introduced a new mathematical framework and several new concepts, such as periodicity, autocorrelation, and spectral density function to analyze scale stationary and p-self similar processes. In particular, we introduced a family of finite parameter scale stationary models, similar in spirit to ARMA models by which any scale stationary processes can be approximated. In this work, we utilized the framework of scale stationary processes and introduced novel methods of 1/f signal modeling and parameter estimation techniques. These include a sampling theorem, a mathematically consistent estimator for the self-similarity parameter, an unbiased estimator for the scale autocorrelation function and a maximum likelihood estimator for scale stationary autoregressive models. Results from our study suggest that scale stationary processes provide a powerful framework for practical 1/f signal processing problems.
Pulse-diverse radar waveform design for accurate joint estimation of time delay and Doppler shift
Authors: Wing-Kit Chung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A pulse train of diversely compressed pulses may produce better Doppler-delay resolution than a similar pulse train of identically compressed pulses by reducing the total ambiguity and being more flexible in distributing that reduced ambiguity. This work investigates the design of such a pulse-diverse waveform under a design criterion constraining the allowable sidelobe height in the composite ambiguity function. A genetic algorithm is used to design the pulse modulation parameters for frequency shift keying (FSK) pulse modulation and joint frequency-phase shift keying (FSK-PSK) pulse modulation. Simulation studies verify the superior Doppler-delay resolution and interference rejection capability of these pulse-diverse modulation schemes. 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
Active Data: Supporting the Grid Data Life Cycle
Authors: Tim Ho, David Abramson
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Scientific applications often involve computation intensive workflows and may generate large amount of derived data. In this paper we consider a life cycle, which starts when the data is first generated, and tracks its progress through replication, distribution, deletion and possible re-computation. We describe the design and implementation of an infrastructure, called Active Data, which combines existing Grid middleware to support the scientific data lifecycle in a platformneutral environment.
B-Cell Algorithm as a Parallel Approach to Optimization of Moving Peaks Benchmark Tasks
Authors: Krzysztof Trojanowski
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Efficiency of the B-Cell algorithm applied to one of the well-known test-case generators, the Moving Peaks Benchmark (MPB) is a subject of study presented in this paper. We especially focused on the family of fitness landscapes generated by scenario 2 of the MPB. All of them represent the class of randomly changing environments. Some properties of the algorithm as well as the properties of the environments created by the generator MPB are discussed. A side effect of modification of one of the control parameters and its influence on the offline error measure is presented.
Extremal results for rooted minor problems
Authors: Leif K. Jørgensen, Ken-Ichi Kawarabayashi
Venue: Journal of Graph Theory (2007)

In this article, we consider the following problem. Given four distinct vertices v1,v2,v3,v4. How many edges guarantee the existence of seven connected disjoint subgraphs Xi for i&thinsp;=&thinsp;1,&hellip;, 7 such that Xj contains vj for j&thinsp;=&thinsp;1, 2, 3, 4 and for j&thinsp;=&thinsp;1, 2, 3, 4, Xj has a neighbor to each Xk with k&thinsp;=&thinsp;5, 6, 7. This is the so called &ldquo;rooted K3, 4-minor problem.&rdquo; There are only few known results on rooted minor problems, for example, [15,6]. In this article, we prove that a 4-connected graph with n vertices and at least 5n&thinsp;-&thinsp;14 edges has a rooted K3,4-minor. In the proof we use a lemma on graphs with 9 vertices, proved by computer search. We also consider the similar problems concerning rooted K3,3-minor problem, and rooted K3,2-minor problem. More precisely, the first theorem says that if G is 3-connected and e(G)&thinsp;&ge;&thinsp;4|G|&thinsp;-&thinsp;9 then G has a rooted K3,3-minor, and the second theorem says that if G is 2-connected and e(G)&thinsp;&ge;&thinsp;13&#x002F;5|G|&thinsp;-&thinsp;17&#x002F;5 then G has a rooted K3,2-minor. In the second case, the extremal function for the number of edges is best possible. These results are then used in the proof of our forthcoming articles [7,8]. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 191&ndash;207, 2007
Modular Checkpointing for Atomicity
Authors: Lukasz Ziarek, Philip Schatz, Suresh Jagannathan
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execution in multi-threaded code is not obvious, however. For a thread to correctly re-execute a region of code, it must ensure that all other threads which have witnessed its unwanted effects within that region are also reverted to a meaningful earlier state. If not done properly, data inconsistencies and other undesirable behavior may result. However, automatically determining what constitutes a consistent global checkpoint is not straightforward since thread interactions are a dynamic property of the program. In this paper, we present a safe and efficient checkpointing mechanism for Concurrent ML (CML) that can be used to recover from transient faults. We introduce a new linguistic abstraction called stabilizers that permits the specification of per-thread monitors and the restoration of globally consistent checkpoints. Global states are computed through lightweight monitoring of communication events among threads (e.g. message-passing operations or updates to shared variables). Our checkpointing abstraction provides atomicity and isolation guarantees during state restoration ensuring restored global states are safe. Our experimental results on several realistic, multithreaded, server-style CML applications, including a web server and a windowing toolkit, show that the overheads to use stabilizers are small, and lead us to conclude that they are a viable mechanism for defining safe checkpoints in concurrent functional programs. Our experiments conclude with a case study illustrating how to build open nested transactions from our checkpointing mechanism.
Energy-efficient, utility accrual real-time scheduling
Authors: Binoy Ravindran
Venue:  (2005)

In this dissertation, we consider timeliness and energy optimization in battery-powered, mobile embedded real-time systems. We focus on real-time systems that operate in environments with dynamically uncertain properties, including context-dependent activity execution times and arbitrary activity arrival patterns. We consider an application model where activities are subject to time/utility function (or TUF) time constraints, mutual exclusion constraints on concurrent sharing of non-CPU resources, timeliness requirements including assurances on individual activity timeliness behavior, and system-level energy consumption requirements including a non-exhaustable energy budget. To account for uncertainties in activity properties in dynamic systems, we stochastically describe activity execution demands, and describe activity arrival behaviors using the uni-modal arbitrary arrival model, which allows unbounded arrival frequencies. We consider the scheduling optimality criteria of: (1) probabilistically satisfying lower bounds on individual activities' maximal timeliness utilities, and (2) maximizing system-level energy efficiency, while ensuring that the system's energy consumption never exhausts the energy budget and resource mutual exclusion constraints are satisfied. For this multi-criteria scheduling problem, we present a DVS (dynamic voltage scaling)-based, real-time scheduling algorithm called the Energy-Bounded Utility Accrual Algorithm (or EBUA). Since the scheduling problem is NP -hard, EBUA heuristically (and dynamically) allocates CPU cycles to activities, computes activity schedules, and scales CPU voltage and frequency with a polynomial-time cost. If activities' cumulative execution demands exceed the available CPU time or may exhaust the system's energy budget, the algorithm defers and rejects jobs in a controlled fashion, minimizing system-level energy consumption and maximizing total accrued utility. We analytically establish several properties of EBUA. We prove that the algorithm never exhausts the specified energy budget. Further, we establish EBUA's timeliness optimality during under-loads, freedom from deadlocks, and correctness in mutually exclusive resource sharing. In particular, we prove that the algorithm's timeliness behavior subsumes the optimal timeliness behavior of deadline scheduling as a special case, and identify the conditions under which lower bounds on individual activity utilities are satisfied. In addition, we upper bound the time needed for mutually exclusively accessing shared resources under EBUA. We conduct experimental studies by simulating the algorithm on the DVS-enabled AMD k6 processor model, and by implementing it on QNX Neutrino 6.2.1 RTOS. Our experimental results validate our analytical results. Further, they confirm EBUA's superiority over other energy-efficient real-time scheduling algorithms on timeliness and energy consumption behaviors.
Assessing the Quality of Automatically Built Network Representations
Authors: Lionel Eyraud-Dubois, Martin Quinson
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

In order to efficiently use Grid resources, users or middlewares must use some network information, and in particular some knowledge of the platform network. As such knowledge is usually not available, one must use tools which automatically build a topological network model through some measurements. Our aim is to define a methodology to assess the quality of these network model building tools, and to apply this methodology to representatives of the main classes of model builders. Using this approach, we show that none of the main existing techniques build models that enable to accurately predict the running time of simple application kernels for actual platforms.
The Effects of Case Mix on Hospital Costs and Revenues for Medicare Patients in California
Authors: Keon-Hyung Lee
Venue: Journal of Medical Systems (2007)

Hospital competition and managed care have negatively affected hospital profitability. In the current turbulent health care environment in the U.S., hospitals in California have argued that the rate of increase in hospital costs is faster than the rate of increase in hospital revenues. By employing Medicare case mix indexes (CMIs) as a primary policy variable, this study found that the coefficients for CMIs in hospital costs for Medicare patients were smaller than those in hospital revenues in the years of 1986, 1989 and 1998. However, the coefficients for CMIs in hospital costs for Medicare patients were greater than those in hospital revenues in the years of 1992 and 1995. Although there were some differences between the coefficients for CMIs in hospital costs and revenues for Medicare patients, those differences found to be statistically insignificant. In spite of claims on behalf of Californian hospitals, the rate of increase in hospital costs for Medicare patients had not been greater than that of hospital revenues for Medicare patients.
Performance and Reliability of Tree-Structured Grid Services Considering Data Dependence and Failure Correlation
Authors: Yuan-Shun Dai, Gregory Levitin, Kishor S. Trivedi
Venue: IEEE Transactions on Computers (2007)

Grid computing is a newly emerging technology aimed at large-scale resource sharing and global-area collaboration. It is the next step in the evolution of parallel and distributed computing. Due to the largeness and complexity of the grid system, its performance and reliability are difficult to model, analyze, and evaluate. This paper presents a model that relaxes some assumptions made in prior research on distributed systems that were inappropriate for grid computing. The paper proposes a virtual tree-structured model of the grid service. This model simplifies the physical structure of a grid service, allows service performance (execution time) to be efficiently evaluated, and takes into account data dependence and failure correlation. Based on the model, an algorithm for evaluating the grid service time distribution and the service reliability indices is suggested. The algorithm is based on Graph theory and probability theory. Illustrative examples and a real case study of the BioGrid are presented.
Data Dissemination in Wireless Sensor Networks Using Software Agents
Authors: Haroon Malik, Elhadi Shakshuki
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

This paper presents an agent based system to increase the life time of node in Wireless Sensor Networks. In wireless sensor network nodes deployment of nodes is random and on large scale. This kind of deployment gives birth to massive sensory data which is redundant in nature. Routing of such kind of unnecessary data not only saturates network resources, but also consumes immense nodes energy. We unadulterated our efforts to enhance the node life time in sensor network by introducing mobile agents. Mobile agents are used to reduce the communication cost, especially over low bandwidth links, by moving the processing function to the data rather than bringing the data to a central processor (sink). Toward this end, we propose our agent based directed diffusion approach. Furthermore, to have better understanding in evaluating the performance of both approaches, we present detailed analytical model of data dissemination for both. The results of our simulation show that agent based directed diffusion provides better performance than directed diffusion in terms of energy consumption and bandwidth saturation.
On-line Bayesian speaker adaptation using tree-structured transformation and robust priors
Authors: Shaojun Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper presents new results by using our previously proposed on-line Bayesian learning approach for affine transformation parameter estimation in speaker adaptation. The on-line Bayesian learning technique allows updating parameter estimates after each utterance and it can accommodate flexible forms of transformation functions as well as prior probability density functions. We show through experimental results the robustness of heavy tailed priors to mismatch in prior density estimation. We also show that by properly choosing the transformation matrices and depths of hierarchical trees, recognition performance improved significantly.
3rd IEEE/IFIP Workshop on End-to-End Monitoring Techniques and Services
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

In order to satisfy and maintain service level agreements (SLAs), which demand high network availability and good network health, ISPs have started instrumenting their networks with network measurement infrastructures (NMIs) that are composed of dedicated measurement servers. Active measurements are frequently used in NMIs to regularly monitor network health and analyze the experience of end-user application traffic traversing the network. However, active measurements initiated by measurement servers need to be regulated. Unregulated active measurement traffic can cause an unpredictable negative impact on the actual application traffic. Also, running simultaneous conflicting active measurements on measurement servers could result in misleading reports of network performance. In this paper, we describe our active measurements scheduling framework called "OnTimeMeasure" that allows ISPs to regulate the amount of active measurement traffic injected into the network and also prevents conflicts in ongoing active measurements between measurement servers. OnTimeMeasure provides a simple scripting language interface to specify various measurement requirements such as physical topology of measurement server clusters, periodicity of the measurements, and properties of measurement tools. For a given measurement requirements script, OnTimeMeasure uses an efficient heuristic bin-packing algorithm to generate measurement timetables for orchestrating active measurements for a network involving multiple measurement servers, each hosting multiple measurement tools.
Operator-driven Peer-to-Peer Service Platform for Mobile Environments (Invited Talk)
Authors: Wolfgang Kellerer
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Peer-to-Peer (P2P) technology is regarded as being disruptive for traditional fixed and mobile operators. However, it can also be considered as an opportunity for new ways of service provisioning.
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications
Authors: Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

We present a highly efficient method for proving correctness of computations while preserving secrecy of the input values. This is done in an Evaluator-Prover model which can also be realized by a secure processor. We describe an application to secure auctions.