ppxscal/embedding_network huggingface dataset:
What COTS and Software Reuse Teach Us about SOA
Authors: William Anderson
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Many organizations are increasingly looking for techniques that can lead to large-scale (and often dynamic) integration and interoperation of new and existing components, services, or systems. Service- 0riented architecture (SOA) holds great promise as an approach that can facilitate these desires. Over the past decades, organizations have tried various development software reuse approaches, such as commercial off-the-shelf (COTS) based systems, product line engineering, and frames. As we move into this new world of highly interoperable systems, we should take advantage of the lessons taught by the development of these approaches. This paper identifies key lessons from COTS and software reuse that can be applied to SOA.
A theoretical model for time code modulation
Authors: D. Kalogiros
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

The traditional waveform coding techniques for digital communication systems convert the original analog input signal into a digital bit stream using uniform sampling in the time domain, i.e. PCM, DM, ADPCM. We propose the time code modulation (TCM) technique as an alternative coding scheme, where information is extracted from the signal, only at the time instants when necessary. This results in a variable sampling rate, where its mean value is significantly less than the Nyquist rate. In addition we suggest a general theoretical model for TCM and we present simulation results for various implementations of TCM coders and decoders. A theoretical estimation of SNR vs. sampling rate performance is also presented.
IHS: An Integrated Handover Scheme for Heterogeneous Wireless Networks in MIPv6
Authors: Wei Wei, Yihua Lou, Jianbai Wang
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

An integrated handover scheme for heterogeneous wireless networks is proposed, synthesizing MIPv6 horizontal handover and vertical handover. The scheme allows mobile nodes to select target networks and perform handover with the support of network entities. In order to optimize the handover performance of MIPv6, a protocol for horizontal handover and vertical handover is designed for the scheme. Experiments are operated to test the performance of the protocol.
Enhancing game theory with coevolutionary simulation models of honest signalling
Authors: D. Harris, S. Bullock
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Game-theoretic models provide a rigorous mathematical modelling framework, but tractability considerations keep them simple. In contrast, Evolutionary Simulation Models (ESMs) may be complex, but can lack rigour. We demonstrate that careful synthesis of the two techniques provides improved insights into the processes underlying the evolution of cooperative signalling systems.
Text-independent speaker identification
Authors: M. Birnbaum
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We have developed a new approach for speaker identification (SID) that employs fenonic speaker Markov modeling (FSMM). The FSMM is a hidden Markov model whose parameters capture and describe intra-speaker spectral dynamics. FSMM technology has been successfully applied in isolated word recognition and speaker adaptation applications. In this new application of FSMM technology to speaker identification, we have obtained an identification accuracy of 96.9% on the King database using 16 talkers. The results suggest that the FSMM provides a promising model for capturing and identifying speaker-specific characteristics.
A new matrix approach to real FFTs and convolutions of length 2k
Authors: T. Lundy, J. Van Buskirk
Venue: Computing (2007)

A new matrix, scaled odd tail, SOT, is introduced. This new matrix is used to derive real and complex FFT algorithms for lengths n&#x00a0;=&#x00a0;2 k . A compromise is reached between Fourier transform and polynomial transform methods for computing the action of cyclic convolutions. Both of these methods lead to arithmetic operation counts that are better than previously published results. A minor improvement is also demonstrated that enables us to compute the actions of Fermat prime order FFTs in fewer additions than previously available algorithms.
Context modeling of wavelet coefficients in EZW-based lossless image coding
Authors: V. N. Ramaswamy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

The EZW lossless coding framework consists of three stages: (i) a reversible wavelet transform, (ii) an EZW data structure to order the coefficients and (iii) an arithmetic coding using context modeling. In this work, we discuss the various experiments conducted on context modeling of wavelet coefficients for arithmetic coding to optimize the compression efficiency. The context modeling of wavelet coefficients can be classified into two parts: (i) context modeling of significance information and (ii) context modeling of the remaining or residue information. It was observed from our experiments while context modeling of residue helped in achieving considerable compression efficiency, the context modeling of significance information helped only to a modest extent.
Fourier meets möbius: fast subset convolution
Authors: Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We present a fast algorithm for the subset convolution problem:given functions f and g defined on the lattice of subsets of ann-element set n, compute their subset convolution f*g, defined for S⊆ N by [ (f * g)(S) = [T ⊆ S] f(T) g(S/T),,]where addition and multiplication is carried out in an arbitrary ring. Via Möbius transform and inversion, our algorithm evaluates the subset convolution in O(n2 2n) additions and multiplications, substanti y improving upon the straightforward O(3n) algorithm. Specifically, if the input functions have aninteger range [-M,-M+1,...,M], their subset convolution over the ordinary sum--product ring can be computed in Õ(2n log M) time; the notation Õ suppresses polylogarithmic factors.Furthermore, using a standard embedding technique we can compute the subset convolution over the max--sum or min--sum semiring in Õ(2n M) time. To demonstrate the applicability of fast subset convolution, wepresent the first Õ(2k n2 + n m) algorithm for the Steiner tree problem in graphs with n vertices, k terminals, and m edges with bounded integer weights, improving upon the Õ(3kn + 2k n2 + n m) time bound of the classical Dreyfus-Wagner algorithm. We also discuss extensions to recent Õ(2n)-time algorithms for covering and partitioning problems (Björklund and Husfeldt, FOCS 2006; Koivisto, FOCS 2006).
Extended Abstract: Forward-Secure Sequential Aggregate Authentication
Authors: Di Ma, Gene Tsudik
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

Wireless sensors are employed in a wide range of applications. One common feature of many sensor settings is the need to communicate sensed data to some collection point or sink. This communication can be direct (to a mobile collector) or indirect - via other sensors towards a remote sink. In either case, a sensor might not be able to communicate to a sink at will. Instead it might collect data and wait (for a potentially long time) for a signal to upload accumulated data directly. In a hostile setting, a sensor may be compromised and its post-compromise data can be manipulated. One important issue is forward security - how to ensure that precompromise data cannot be manipulated? Since a typical sensor is limited in storage and communication facilities, another issue is how to minimize resource consumption by accumulated data. It turns out that current techniques are insufficient to address both challenges. To this end, we explore the notion of Forward-Secure Sequential Aggregate (FssAgg) authentication Schemes. We consider FssAgg authentication schemes in the contexts of both conventional and public key cryptography and construct a FssAgg MAC scheme and a FssAgg signature scheme, each suitable under different assumptions. This work represents the initial investigation of Forward-Secure Aggregation and, although the proposed schemes are not optimal, we believe it opens a new direction for follow-on research.
Software Engineering Education in China
Authors: Yulin Wang
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

In recent years, China has come up with policies to boost its software industry. The policies emphasize technology innovation, the training of professional talents and service improvement. The government will invest more in the software industry, encourage venture capital, cut taxation on software, and create more channels for software businesses to raise funds.
Integrating network QoS to provide Differentiated Service in a Web server
Authors: V. R. Subramaniam
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

In this paper, we propose an integrated quality of service (QoS) manager (IQM) that determines and enforces the QoS given to HTTP requests that a Web server receives. In order to determine the required QoS, both the identity of the client as well as the URL being accessed should be used. To provide guarantees on round trip delay, it is not sufficient to provide QoS in the network layer or in the server alone. QoS should be monitored and enforced in both these domains and the two managers must communicate and cooperate. Web servers these days are not restricted to doling out static Web documents. The Web server executes some code for each HTTP request. This execution needs some QoS to ensure reasonable response times. The IQM is responsible for doing this. We also explore the importance of network latency in providing all-round QoS to the client. The IQM, we suggest, should be aware of network latency associated with each host and for each DiffServ marking. Based on our experiments, we outline how this marriage between network QoS and application QoS is to be done.
Technology and the Work of Children
Authors: Michael Eisenberg
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

One of the most enduring and marvelous traditions of children's culture has been that of craftwork--the creation of personal, homemade items from everyday materials. Often, this tradition is described as a kind of counterweight to the influence of technology: where technology is associated with (say) the Web, or video games, or robotics, children's crafts by contrast are assumed to be low-tech, somewhat old-fashioned activities. In point of fact, though, children's crafts have always taken advantage of technological advance; and in that sense, the current era is no different. The capabilities of digital media and new tangible materials herald what could be a marvelous reinvigoration of children's crafts. This talk will describe a variety of current projects at the Craft Technology Laboratory at the University of Colorado as an illustration of new possibilities for children's work. The talk will also include a variety of free project ideas for the offering -- ideas that we ourselves haven't undertaken, and may never get to try at all, but that somebody somewhere ought to try..
WinACIF: a telecom IC support tool using Tcl/Tk
Authors: David Karoly, Todd Copeland, David Gardner
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

We discuss our use of Tcl/Tk to provide software support for telecommunications Integrated Circuits (ICs). Our Windows®-based Advanced Computer Interface (WinACIF) program works in concert with reconfigurable hardware based on Field Programmable Gate Arrays (FPGAs) to provide essential coordination in laboratory data collection and analysis of a device under test. WinACIF replaces several MS-DOS® based applications. Whereas the previous implementations suffered from the classic limitations of MS-DOS, WinACIF provides the flexibility and functionality of windowing applications by virtue of its Tcl/Tk roots. Tcl/Tk not only supplies more than ample power to create WinACIF, but also adds the benefit of saving valuable time otherwise spent learning a complex API. Run-time loaded Tcl extensions provide the flexibility to support various devices having diverse interfaces. A single Tcl/Tk script dynamically builds a Graphical User Interface (GUI) based on product configuration data retrieved from a data store. Additionally, we used canvas widgets to provide an intuitive interface. For the engineer who requires control beyond that afforded by our GUI, Tcl serves as WinACIF's command language.
EXECUBE-A New Architecture for Scaleable MPPs
Authors: Peter M. Kogge
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

The EXECUBE chip is a new single part type building block for MPP systems that scales seamlessly from a few chips (with a few hundred mips) to thousands of chips with petaop potential. Further, the chip architecture supports directly both SIMD and MIMD modes of processing, permitting not only the best of both current parallel computing modes but also new modes not possible with more conventional designs. This paper discusses the overall architecture of the EXECUBE chip, the new computational model it represents, some comparisons against the current state of the art, how it might be used for real applications, and some extrapolations into future developments.
Type-safe disks
Authors: Gopalan Sivathanu, Swaminathan Sundararaman, Erez Zadok
Venue: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7 (2006)

We present the notion of a type-safe disk (TSD). Unlike a traditional disk system, a TSD is aware of the pointer relationships between disk blocks that are imposed by higher layers such as the file system. A TSD utilizes this knowledge in two key ways. First, it enables active enforcement of invariants on data access based on the pointer relationships, resulting in better security and integrity. Second, it enables semanticsaware optimizations within the disk system. Through case studies, we demonstrate the benefits of TSDs and show that a TSD presents a simple yet effective general interface to build the next generation of storage systems.
Performance analysis of multi-element antenna array systems under different processing techniques and fading correlation
Authors: Low Tze-Ping, F. Chin, B. Kannan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

We compare three available receiver processing schemes for multi-input multi-output (MIMO) systems. We show that when the transmitter has full knowledge of the channel (closed-loop), all three processing schemes achieve the theoretical limit of the MIMO channel. We also compare the capacity performance of the schemes, with the theoretical capacity limit, when the transmitter is deprived of knowledge about the channel (open-loop). In addition, we investigate the effect of fading correlation on the MIMO channel capacity with respect to a previously measured set of fading correlation coefficients.
2.4 kb/sec compressed domain teleconference bridge with universal transcoder
Authors: R. L. Zinser
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Advanced new technologies, such as cellular-telephone-quality ultra-low-rate speech coders, model domain transcoders, and compressed domain conferencing algorithms provide an opportunity to develop a compressed domain conference bridge system for use in secure, survivable military communications environments. The new conference bridge will allow seamless interoperability with diverse voice terminals and enable full-duplex teleconference operation. Unlike users of half-duplex systems, conferencing participants will be able to talk at the same time and hear the two most relevant simultaneous talkers over a single 2.4 kbit/s connection. This paper describes a system architecture that implements the features mentioned above. Compared to conventional multicast conferencing algorithms, the new system will consume a significantly smaller portion of the satellite resources; for N conference participants, conventional multicast requires N/sup 2/ channels, while the new system will use only 2N channels.
Archipelago: an Island-based file system for highly available and scalable internet services
Authors: Minwen Ji, Edward W. Felten, Randolph Wang, Jaswinder Pal Singh
Venue: Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4 (2000)

Maintaining availability in the face of failures is a critical requirement for Internet services. Existing approaches in cluster-based data storage rely on redundancy to survive a small number of failures, but the system becomes entirely unavailable if more failures occur. We describe an approach that allows a cluster file server to isolate failures so that the system can continue to serve most clients. Our approach is complementary to existing redundancy-based methods: redundancy can mask the first few failures, and failure isolation can take over and maintain availability for the majority of clients if more failures occur. The building blocks of our design are self-contained and load-balanced file servers called islands. The main idea underlying island-based design is the one-island principle: as many operations as possible should involve exactly one island. The one-island principle provides failure isolation because each island can function independently of other islands' failures. It also helps the file system scale with the system and workload sizes because communication and synchronization across islands are reduced. We implemented a prototype island-based file system called Archipelago on a cluster of PCs running Windows NT 4.0 connected by Ethernet. The measurement of micro benchmark shows that Archipelago adds little overhead to NTFS and Win32 RPC performance; while the measurement of operation mixes based on NTFS traces shows a speedup of 15.7 on 16 islands
Assessing maintainability: information theory, metrics and iterative software processes
Authors: Letha H. Etzkorn
Venue:  (2006)

The purpose of this dissertation is to assess maintainability and evolution of object-oriented (OO) software developed using highly iterative or agile software processes with a focus on the utility of information-theory based metrics in this analysis. To do this, we first explored the utility of existing OO metrics and metric suites to assess maintainability in terms of fault-proneness in these types of systems, using statistical models predicting fault-proneness as a basis for the assessment of these metrics. We conclude that existing OO metrics are useful in measuring maintainability in these systems due primarily to the dynamic change in these systems from one version to the next. We examined the utility of information theory-based metrics to assess maintainability in terms of complexity. Finally, we examined maintainability in terms of design instability and degradation. We developed two new information theory-based metrics and empirically showed them to be useful in measuring design instability and degradation in highly iterative or agile software projects.
Perceptive admission control for wireless network quality of service
Authors: Ian D. Chakeres, Elizabeth M. Belding-Royer, Joseph P. Macker
Venue: Ad Hoc Networks (2007)

As wireless networks become more widely used, there is a growing need to support advanced services, such as multimedia streaming and voice over IP. Traditional approaches to guarantee quality of service (QoS) work well only with predictable channel and network access. In wireless mobile networks, where conditions dynamically change as nodes move about the network, a stateless, high level approach is required. Since shared wireless resources are easily over-utilized, the load in the network must be controlled so that an acceptable QoS for real-time applications can be maintained. If minimum real-time requirements are not met, these unusable packets waste scarce bandwidth and hinder other traffic, compounding the problem. To enable high QoS for all admitted traffic, we propose the Perceptive Admission Control (PAC) protocol. PAC monitors the wireless channel and dynamically adapts admission control decisions to enable high network utilization while preventing congestion. Through discussion, simulations and testbed experiments, we demonstrate that PAC ensures low packet loss and delay for all admitted flows.
Multiple frequency harmonics analysis and synthesis of audio signals
Authors: A. Jbira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper we propose a multiple frequency harmonics model for analysis and synthesis of audio signals. The novelty of this model is that a composite sound can be represented by a few number (two or three) of frequency harmonics, each with time-varying fundamental frequency. We present the model and some key issues in tuning it. Results demonstrate that the model is valid and promising. It is convenient for time- and frequency-scale modifications and is of interest for low bit rate audio coding.
Interaction Analysis of Heterogeneous Monitoring Data for Autonomic Problem Determination
Authors: Mohammad A. Munawar, Kevin Quan, Paul A. S. Ward
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Autonomic systems require continuous self-monitoring to ensure correct operation. Available monitoring data exists in a variety of formats, including log files, performance counters, traces, and state and configuration parameters. Such heterogeneity, together with the extremely large volume of data that could be collected, makes analysis very complex. To allow for more-effective problem determination, there is a need for a comprehensive integration of management data. In addition, monitoring should be adaptive to the current perceived operation of the system. In this paper we present an architecture to meet the above goals. We leverage an open-source XML-based format for data integration and describe an approach to automatically adjust monitoring for diagnosis when anomalies are detected. We have implemented a partial prototype using an Eclipse-based open- source platform. We show the effectiveness of our prototype based on fault-injection experiments. We also study issues of disparity of data formats, information overload, scalability, and automated problem determination.