ppxscal/embedding_network huggingface dataset:
Analysis of low rank transform domain adaptive filtering algorithm
Authors: B. Raghothaman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper analyzes an SVD-based low rank transform domain adaptive filtering algorithm and proves that it performs better than the normalized LMS. The method extracts an under-determined solution from an overdetermined least squares problem, using a part of the unitary transformation formed by the right singular vectors of the data matrix. The aim is to get as close to the solution of an overdetermined system as possible, using an under-determined system. Previous work based on the same framework, but with the DFT as the transformation, has shown considerable improvement in performance over conventional time domain methods like NLMS and affine projection. The analysis of the SVD-based variant helps us to understand the convergence behavior of the DFT-based low complexity method. We prove that the SVD-based method gives a lower residual than NLMS. Simulations confirm the theoretical results.
Kerberos plus RSA for world wide web security
Authors: Don Davis
Venue: Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1 (1995)

We show how to use Kerberos to enable its clients to interact securely with non-Kerberized World Wide Web servers. That is, our protocol does not require that the Web server be a member of a Kerberos realm, and also does not rely on time-synchronization between the participants. In our protocol, the Kerberos client uses the Web server's public-key certificate to gain cryptographic credentials that conform to public-key authentication standards, and to SHTTP. The client does not perform any public-key encryptions. Further, the client is well-protected from a man-in-the-middle attack that weakens SSL. Our protocol conforms to the current specifications for the Kerberos protocol and for the Secure Hypertext Transfer Protocol.
Generalized adaptive polyphase algorithm
Authors: U. Iyer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The polyphase (PPS) algorithm discussed by Iyer et al. (see Proc. ICASSP, 1994) offers a very attractive solution to the identification of very long impulse responses. It provides a perfect parallel decomposition in the transform domain and yields alias free spectral estimates. Its speed of convergence however is limited by a need for excitation at points spaced uniformly over the entire frequency axis. This paper proposes to generalize PPS based on some a priori knowledge of the spectral distribution of the signal. Using rotations and dilations PPS can zoom in on the spectral range of interest and provide good estimates at a fast rate. Finally, we present a generalized form for sub-band decomposition of multirate systems, which would form an ideal platform for developing parallel algorithms in the frequency domain.
Minitrack: IT Adoption, Implementation, Use and Evaluation in Healthcare
Authors: Ton Spil, Ken Trimmer, Cynthia LeRouge, Carla Wiggins
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This minitrack focuses on the role of adoption, implementation, use and evaluation factors and the interaction of these factors at various levels for healthcare system success. Successful innovation with information technology (IT) in healthcare continues to challenge research and practice. Information Technology is seen as an enabler of change in healthcare organizations but (information) technology adoption decisions in healthcare are complex because of the uncertainty of benefits and the rate of change of technology. On a system-level, reimbursement structures, regulations, inter-organizational concerns, and the existence of standards may have an explanatory role. On an organizational level, the previous strategic choices, strategic priorities, size and location of the organization, information assurance, and many other factors may play a role. On a project level, resources, project management, etc. plays a role. Many studies also concentrate on the crucial level of the user at an individual level. It is wise to consider individual related success determinants such as relevance, attitude, requirements and resources. Yet, on this level, we need to learn more about the identification of different adoptercategories in practice and about the role that IT has for various work processes that it may simultaneously touch upon.
Direction-time transmission for fast fading vector channel
Authors: Hang Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Transmit diversity and space-time coding have received a lot of attention in previous years. We propose a direction-time transmit scheme for a fast block fading channel which exploits the parametric structure of the time-varying vector channel. Specular propagation and local scattering are assumed at the base-station and mobile station respectively. The partial channel knowledge needed for the transmit design includes: the number of specular paths, path direction vectors and length of the coherent interval. Transmission matrix codewords are formed according to this partial channel information such that multiple channels are induced and symbols are spread over different transmission directions. Diversity gain and blind channel estimation are achieved simultaneously at the mobile station through equalization.
Automatic feedback-directed object inlining in the java hotspot™ virtual machine
Authors: Christian Wimmer, Hanspeter Mössenböck
Venue: Proceedings of the 3rd international conference on Virtual execution environments (2007)

Object inlining is an optimization that embeds certain referenced objects into their referencing object. It reduces the costs of field accesses by eliminating unnecessary field loads. The order of objects in the heap is changed in such a way that objects that are accessed together are placed next to each other in memory so that their offset is fixed, i.e. the objects are colocated. This allows field loads to be replaced by address arithmetic. We implemented this optimization for Sun Microsystems' Java HotSpot™ VM. The analysis is performed automatically at run time, requires no actions on the part of the programmer and supports dynamic class loading. We use read barriers to detect the most frequently accessed fields that are worth being optimized. To safely eliminate a field load, the colocation of the object that holds the field and the object that is referenced by the field must be guaranteed. Two preconditions must be satisfied for a field before it is optimized: the objects must be allocated together, and the field must not be overwritten later. These preconditions are checked by the just-in-time compiler to avoid a global data flow analysis. The garbage collector ensures that groups of colocated objects are not split: it copies groups as a whole to their new locations. The evaluation shows that our dynamic approach successfully identifies and optimizes frequently accessed fields for several benchmarks. The improved peak performance of 9% in average for SPECjvm98 (with a maximum speedup of 51%) justifies the startup overhead of 3% in average (with a maximum slowdown of 11%) that is caused mainly by the read barriers and the additional compilation of methods.
India: a Case of Fragile Wireless Service and Technology Adoption?
Authors: L-F Pau, J. Motiwalla
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Wireless penetration and the Indian economy have grown significantly over the past few years, but how robust and sustainable is the adoption of wireless services and products? Several papers have discussed India as a wireless service and product market, and sometimes tried to assess quantitative attributes thereof. The present paper aims instead at looking, from a management point of view, at the unique underlying evolution processes, bottlenecks and risks.
Design of 2-D filters composed of low-order systems
Authors: A. Saidi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this paper, we introduce a new analytic approach to the design and analysis of 2-D systems composed of low-order systems used as building blocks. We construct low-order 2-D system functions whose unit-circle root contours can be approximated by a straight line. As a counterpart to a 1-D system function with zeros not on the unit-circle, we introduce the notion of system functions whose magnitude response has, approximately, a constant minimum along a controllable linear contour and show how to construct them. Using these low-order system functions as building blocks, in both cascade and parallel forms, we present a simple and efficient algorithm for designing frequency selective 2-D IIR filters based on summing 2-D all-pass filters.
Building Better Search Engines
Authors: Pam Frost Gorder
Venue: Computing in Science and Engineering (2007)

Filippo Menczer remembers the day in 1993 when he downloaded his first Web browser. He was a graduate student studying artificial intelligence (AI) at the University of California, San Diego. The Web was still relatively new, and there were no search engines to sort through it; users could only follow links from one page to another. Finding a specific piece of information required a combination of determination and serendipity. As he clicked through his first series of links, Menczer thought, "we're like ants searching for food!" Today, he's an associate professor of informatics at Indiana University, and he studies how the Web grows and evolves. Search engines have profoundly changed the way we use the Web, he says. Finding information is easy—so easy, in fact, that one common notion about search engines is that they bias Web traffic by directing people to popular sites and away from less popular, yet relevant, sites.
World-wide web cache consistency
Authors: James Gwertzman, Margo Seltzer
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

The bandwidth demands of the World Wide Web continue to grow at a hyper-exponential rate. Given this rocketing growth, caching of web objects as a means to reduce network bandwidth consumption is likely to be a necessity in the very near future. Unfortunately, many Web caches do not satisfactorily maintain cache consistency. This paper presents a survey of contemporary cache consistency mechanisms in use on the Internet today and examines recent research in Web cache consistency. Using trace-driven simulation, we show that a weak cache consistency protocol (the one used in the Alex ftp cache) reduces network bandwidth consumption and server load more than either time-to-live fields or an invalidation protocol and can be tuned to return stale data less than 5% of the time.
Robust management of outliers in sensor network aggregate queries
Authors: Yannis Kotidis, Vasilis Vassalos, Antonios Deligiannakis, Vassilis Stoumpos, Alex Delis
Venue: Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access (2007)

Sensor networks are increasingly applied for monitoring diverse environments and applications. Due to their unsupervised nature of operation and inexpensive hardware used, sensor nodes may furnish readings of rather poor quality. We thus need to devise techniques that can withstand "dirty" data during query processing. In this paper we introduce a robust aggregation framework that can detect and isolate spurious measurements from computed aggregate values. Such readings are not injected in the reported aggregate, in order not to obscure the outcome, but are still maintained and returned to the user/application, which may investigate them further and take appropriate decisions. In addition, our framework provides a form of positive feedback to the user by enhancing the result with a set of nodes that contain the most characteristic values out of those included in the aggregation process. We perform an extensive experimental evaluation of our framework using real traces of sensory data and demonstrate its utility to the monitoring of applications.
Dynamically Optimizing FPGA Applications by Monitoring Temperature and Workloads
Authors: Phillip H. Jones, Young H. Cho, John W. Lockwood
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In the past, Field Programmable Gate Array (FPGA) circuits only contained a limited amount of logic and operated at a low frequency. Few applications running on FPGAs consumed excessive power. Today, the temperature of FPGAs are a major concern due to increased logic density and speed. Large applications with highly pipelined datapaths can ultimately generate more heat than the package can dissipate. For FPGAs that operate in controlled environments, heat sinks and fans can be used to effectively dissipate heat from the device. However, FPGA devices operating under harsher thermal conditions in outdoor environments, or in systems with malfunctioning cooling systems need a thermal management control system. To address this issue, we had previously devised a recon- figurable temperature monitoring system that gives feedback to the FPGA circuit using the measured junction temperature of the device. Using this feedback, we designed a novel dual frequency switching system that allows the FPGA circuits to maintain the highest level of throughput performance for a given maximum junction temperature. This paper extends the previous work by additionally making this adaptive frequency mechanism workload aware and evaluating power and latency performance under bursty workload conditions. Our working system has been implemented on the Field Programmable Port Extender (FPX) platform developed at Washington University in St. Louis. Experimental results with a scalable image correlation circuit show up to a 30% saving in power for bursty workloads and up to a 2x factor improvement in latency performance as compared to a system without thermal or workload feedback. Our circuit provides power efficient high performance processing of bursty workloads, while ensuring the device always operates within a safe temperature range.
Two-dimensional orthogonal and symmetrical wavelets and filter-banks
Authors: D. Stanhill
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Two-dimensional compactly supported, symmetric, orthogonal wavelets and filter-banks are presented. Two cases are discussed, filters with two-fold symmetry (centrosymmetric), and filters with four-fold symmetry that are symmetric (or anti-symmetric) about the vertical and horizontal axes. We show that imposing the requirement of symmetry (linear phase) in the case of factorable wavelets and filter-banks, imposes a simple constraint on each of its polynomial degree-1 factors. We thus obtain a simple and complete method of constructing orthogonal factorable filter-banks with linear phase. This method is exemplified by design in the case of four-band separable sampling. An interesting result is obtained, similar to the one well known in the case of 1D, orthogonal factorable wavelets can not be both continuous and have four-fold symmetry.
Commiftees
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

We present the effects of using an efficient algorithm for behavior-based model synthesis which is specifically tailored to reactive (legacy) system behaviors. Conceptual backbone is the classical automata learning procedure L*, which we adapt according to the considered application profile. The resulting learning procedure L*Meal , which directly synthesizes generalized Mealy automata from behavioral observations gathered via an automated test environment, drastically outperforms the classical learning algorithm for deterministic finite automata. Thus it marks a milestone towards opening industrial legacy systems to model-based test suite enhancement, test coverage analysis, and online testing. 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
Project Data Incorporating Qualitative Facts for Improved Software Defect Prediction
Authors: Norman Fenton, Martin Neil, William Marsh, Peter Hearty, Lukasz Radlinski, Paul Krause
Venue: Proceedings of the Third International Workshop on Predictor Models in Software Engineering (2007)

To make accurate predictions of attributes like defects found in complex software projects we need a rich set of process factors. We have developed a causal model that includes such process factors, both quantitative and qualitative. The factors in the model were identified as part of a major collaborative project. A challenge for such a model is getting the data needed to validate it. We present a dataset, elicited from 31 completed software projects in the consumer electronics industry, which we used for validation. The data were gathered using a questionnaire distributed to managers of recent projects. The dataset will be of interest to other researchers evaluating models with similar aims. We make both the dataset and causal model available for research use.
Binding Now or Binding Later: The Performance of UDDI Registries
Authors: M. Brian Blake, Amy Lynn Sliva, Michael zur Muehlen, Jeffrey V. Nickerson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In service-oriented environments, the fluidity of the marketplace introduces changes in service offerings and subsequent connection failures for users still bound to outdated services. One focus of web services research is the real-time acquisition of new capabilities via service discovery using Universal Description, Discovery, and Integration (UDDI) registries. Another equally valuable usage of UDDI registries, as addressed in this paper, is the real-time assurance of service responsiveness. UDDI registries can be incorporated into business process execution routines to assure that the underlying services are active at operations time. In this paper, several UDDI modes of operation are evaluated through performance tests of different UDDI implementations. The results of the investigations can be applied as a decision aid for organizations to choose the most efficient utilization of UDDI for the management of responsiveness in their own service-oriented processes.
Engineering ethics education in the U.S.: where it is and where it should go
Authors: K. D. Stephan
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

In this paper, I propose a new model for engineering and technological ethics which looks beyond the usual health and safety issues to the broader effects of engineering on society. Most current engineering curricula emphasize the "how" of engineering almost to the exclusion of the "why". I propose a two-phase approach to a systematic yet flexible treatment of these larger issues, in which one or more humanities courses are coupled with an engineering course on the roles of technology in society. 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
Inter-cluster communication in VLIW architectures
Authors: A. S. Terechko, H. Corporaal
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2007)

The traditional VLIW (very long instruction word) architecture with a single register file does not scale up well to address growing performance demands on embedded media processors. However, splitting a VLIW processor in smaller clusters, which are comprised of function units fully connected to local register files, can significantly improve VLSI implementation characteristics of the processor, such as speed, energy consumption, and area. In our paper we reveal that achieving the best characteristics of a clustered VLIW requires a thorough selection of an Inter-cluster Communication (ICC) model, which is the way clustering is exposed in the Instruction Set Architecture. For our study we, first, define a taxonomy of ICC models including copy operations, dedicated issue slots, extended operands, extended results, and multicast. Evaluation of the execution time of the models requires both the dynamic cycle count and clock period. We developed an advanced instruction scheduler for all the five ICC models in order to quantify the dynamic cycle counts of our multimedia C benchmarks. To assess the clock period of the ICC models we designed and laid out VLIW datapaths using the RTL hardware descriptions derived from a deeply pipelined commercial TriMedia processor. In contrast to prior art, our research shows that fully distributed register file architectures (with eight clusters in our study) often underperform compared to moderately clustered machines with two or four clusters because of explosion of the cycle count overhead in the former. Among the evaluated ICC models, performance of the copy operation model, popular both in academia and industry, is severely limited by the copy operations hampering scheduling of regular operations in high ILP (instruction-level parallelism) code. The dedicated issue slots model combats this limitation by dedicating extra VLIW issue slots purely for ICC, reaching the highest 1.74 execution time speedup relative to the unicluster. Furthermore, our VLSI experiments show that the lowest area and energy consumption of 42 and 57&percnt; relative to the unicluster, respectively, are achieved by the extended operands model, which, nevertheless, provides higher performance than the copy operation model.
Quantifying the effects of IT-governance rules
Authors: C. Verhoef
Venue: Science of Computer Programming (2007)

Via quantitative analyses of large IT-portfolio databases, we detected unique data patterns pointing to certain IT-governance rules and styles, plus their sometimes nonintuitive and negative side-effects. We grouped the most important patterns in seven categories and highlighted them separately. These patterns relate to the five fundamental parameters for IT-governance: data, control, time, cost and functionality. We revealed patterns of overperfect and heterogeneous data signifying reporting anomalies or ambiguous IT-governance rules, respectively. We also detected patterns of overregulation and underregulation, portending bloated control or no IT-control at all, both with negative side-effects: productivity loss, and too costly IT-development. Uniform management on time, cost or functionality showed clear patterns in the time and cost case, and more diffuse combined patterns for functionality. For these in total seven types of patterns, it was possible to take corrective measures to reduce unwanted side-effects, and/or amplify the intended purpose of the underlying IT-governance rules. These modifications ranged from refinements and additions, to eradications of IT-governance rules. For each of the seven patterns we provided lessons learned and recommendations on how to recognize and remove unwanted effects. Some effects were dangerous, and addressing them led to significant risk reduction and cost savings.