ppxscal/embedding_network huggingface dataset:
Improving Web Server Performance with Adaptive Proxy Caching in Soft Real-time Mobile Applications
Authors: Albert M. Cheng, Zhubin Zhang
Venue: Journal of VLSI Signal Processing Systems (2007)

This paper introduces an adaptive cache proxy to improve the performance of web access in soft real-time applications. It consists of client proxies and cooperative proxy servers with a server-side pushing schema. The large amount of heterogeneous data will be stored in the proxy servers and delivered to clients through computer networks to reduce the response time and network traffic. The adaptive proxy pre-fetches and replaces heterogeneous data dynamically in consideration of networks cost, data size, data change rate, etc. The simulation results show that the modified LUV algorithm has better performance in terms of hit rate, byte hit rate, and delay saving rate. With the cooperative proxy caching, it is shown that the performance of the proxy caching system is more predictable even if the proxies need to deal with a variety of data. The modified adaptive TTL algorithm has better performance in terms of the combination of temporal coherency and system overheads.
On correlating structural tests with functional tests for speed binning
Authors: Jing Zeng, M. Abadir
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

The utilization of functional vectors has been an industry standard for speed binning purpose. This practice can be prohibitively expensive as the ICs become faster and more complex. In comparison, structural patterns can target performance related faults in a more systematic manner. To make structural test an effective alternative to functional test for speed binning, structural patterns need to correlate with functional test frequency closely. In this paper, we demonstrate the correlations between the functional test frequency and that of various types of structural patterns on MPC7455, a Motorola processor executing to the PowerPC/sup /spl trade// instruction set architecture.
Automatic language identification using large vocabulary continuous speech recognition
Authors: S. Mendoza
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We have developed a highly accurate automatic language identification system based on large vocabulary continuous speech recognition (LVCSR). Each test utterance is recognized in a number of languages, and the language ID decision is based on the probability of the output word sequence reported by each recognizer. Recognizers were implemented for this test in English, Japanese, and Spanish, using the Ricardo corpus of telephone monologues. When tested on the OGI corpus of digitally recorded telephone speech, we obtained error rates of 3% or lower on 2-way and 3-way closed-set classification of ten-second and one-minute speech segments.
Optimal Multicast Communication in Wormhole-Routed Torus Networks
Authors: David F. Robinson, Philip K. McKinley, Betty H. C. Cheng
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper presents efficient algorithms that implement one-to-many, or multicast, communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a multicast message to m - 1 destinations in [log_2 m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks are also given.
Supplemental instruction benefits students in an introductory engineering course
Authors: T. Webster
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Introduction to Engineering Analysis (IEA; course 20.100, Rensselaer Polytechnic Institute) is generally taken in the first semester of the freshman year and provides an integrated treatment of vector mechanics (statics) and linear algebra, also emphasizing computer-based matrix methods for solving engineering problems. The course format combines large (i.e., 80-100 students) lectures with weekly, smaller (40-50 students) recitations during which students work as teams to solve problems, assisted by the professor and/or the teaching assistant(s). IEA, therefore, incorporates active and peer-learning techniques with traditional lecture-based instructional methods. Students and faculty have been pleased with the additional teamwork and problem-solving practice provided by recitation sections; however, the recitations are a panacea for the many special challenges inherent in teaching a first-semester, freshman-level course. For example, students who performed well in high school classes, while exerting minimal effort, may not possess study skills which are appropriate for a rigorous college environment. Moreover, engineering problem solving is often a totally new mental exercise for college freshmen, even for students who excelled in high school math and science classes. Therefore, the Learning Center at Rensselaer initiated a series of Supplemental Instruction (SI) sessions for IEA students in the Fall of 1996. The authors describe the nature of these sessions and their evaluation.
Programming language support for digitized images or, the monsters in the closet
Authors: Daniel E. Stevenson, Margaret M. Fleck
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

Computer vision (image understanding) algorithms are difficult to write, debug, maintain, and share. This complicates collaboration, teaching, and replication of research results. This paper shows how user-level code can be simplified by providing better programming language constructs, particularly a new abstract data type called a "sheet." These primitives have been implemented as an extension to Scheme. Implementation of sheet operations is made challenging by the fact that images are extremely large, e.g. sometimes over 5 megabytes each. Therefore, operations that loop through images must be compiled from (a specialized subset of) Scheme into C. This paper discusses how the need for extreme efficiency affects the design of the user-level language, the run-time support, and the compiler.
DP-based wordgraph pruning
Authors: T. Kuhn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We present an efficient technique of generating word graphs in a continuous speech recognition system. The word graph is constructed in two stages. In the first stage, a huge word graph is generated as a by-product of a beam-driven forward search. Based on a dynamic-programming (DP) method, this huge word graph will be pruned in the second stage using higher level knowledge, such as n-gram language models. In this pruning stage an edge is removed if there is no path going through this edge which is better scored as the best-scored path in the word graph. The proposed technique is evaluated in the German VERBMOBIL task.
A New Algorithm for Maintaining Closed Frequent Itemsets in Data Streams by Incremental Updates
Authors: Hua-Fu Li, Chin-Chuan Ho, Fang-Fei Kuo, Suh-Yin Lee
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Online mining of closed frequent itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we propose an efficient one-pass algorithm, NewMoment to maintain the set of closed frequent itemsets in data streams with a transaction-sensitive sliding window. An effective bit-sequence representation of items is used in the proposed algorithm to reduce the time and memory needed to slide the windows. Experiments show that the proposed algorithm not only attain highly accurate mining results, but also run significant faster and consume less memory than existing algorithm Moment for mining closed frequent itemsets over recent data streams.
Multiple description coding via scaling-rotation transform
Authors: Wenqing Jiang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We propose a two-stage transform design technique for multiple description transform coding. The first stage is the structure design in which we enforce a scaling-rotation factorization of the transform and we further constrain the transform for specific channel conditions using the knowledge of the input correlation matrix and the desired output correlation matrix. In the second stage, magnitude design, we find the optimal transform from all admissible transforms given by the structure design using the numerical algorithm proposed by Goyal et al. (see Proc. of IEEE Data Compression Conference, 1998). Such a design enables a structured transform framework which reduces both the design and implementation complexities compared to an exhaustive search through the whole space of nonorthogonal transforms. We give two examples to illustrate the design idea, the scaling-Hadamard transform for equal rate channels and the scaling-DST transform for sequential protection channels.
Feather: teaching Tcl objects to fly
Authors: Paul Duffin
Venue: Proceedings of the 7th conference on USENIX Tcl/Tk - Volume 7 (2000)

Feather is a set of extensions which enhances the capabilities and flexibility of Tcl objects, builds a framework around them to enable new data types to be easily added and also provides a rich set of new data types. This paper starts off by giving quite a detailed description of how Tcl objects work and then moves on to describe the features of Feather, how they work and what they can be used for.
Parallelization of the quantile function optimization algorithms
Authors: A. I. Kibzun
Venue: Automation and Remote Control (2007)

Consideration was given to optimization of the loss function that is individually convex in the strategy and random vector. The problem was solved using the confidential method which majorizes the estimate of the quantile function. Two methods to determine the desired estimate were discussed. Both allow one to parallelize calculation of the estimate and reduce the problem to the solution of a set of convex programming problems.
Industry involvement in the Women in Applied Science and Engineering (WISE) recruiting and retention programs
Authors: S. Fletcher
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Industry has recognized that the employment of women and minorities is critical in maintaining a diverse and progressive engineering environment. It has played a significant role in the Women in Applied Science and Engineering (WISE) recruitment programs. For example, industry has offered financial support, sponsored company tours and initiated the participation of engineers to serve as educators and speakers for both middle school and high school summer programs. In addition, industry has played a significant role in WISE retention programs including the multi-tiered mentor program and onsite shadow program. These programs foster relationships between students and engineers and help bridge the gap between education and employment. Finally, industry members have further strengthened collaborative efforts by serving on the WISE industry advisory committee and participating as industry panel members at various events. An overview of WISE programs that involve industry support are presented as well as a discussion of the impact industry has made on these particular programs. In addition, the mutual benefits of industry supported pre-college recruitment and college retention programs are discussed.
Understanding user behavior in online feedback reporting
Authors: Arjun Talwar, Radu Jurca, Boi Faltings
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

Online reviews have become increasingly popular as a way to judge the quality of various products and services. Previous work has demonstrated that contradictory reporting and underlying user biases make judging the true worth of a service difficult. In this paper, we investigate underlying factors that influence user behavior when reporting feedback. We look at two sources of information besides numerical ratings: linguistic evidence from the textual comment accompanying a review, and patterns in the time sequence of reports. We first show that groups of users who amply discuss a certain feature are more likely to agree on a common rating for that feature. Second, we show that a user's rating partly reflects the difference between true quality and prior expectation of quality as inferred from previous reviews. Both give us a less noisy way to produce rating estimates and reveal the reasons behind user bias.Our hypotheses were validated by statistical evidence from hotel reviews on the TripAdvisor website.
On optimal cell assignments in PCS networks
Authors: W. N. N. Hung
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

We address a problem of network design for personal communication services (PCS). The objective is to assign cells optimally to the switches in mobile as well as personal communications. Two types of costs are considered: the cost of handoffs between cells and the cost of cabling (or trunking) between a cell site and its associated switch. The problem is constrained by the call volume that each switch can handle. We adapt a powerful combinatorial search technique, called scatter search, to this optimization problem. We also develop a new optimization paradigm, called bounded scatter search, based on limited discrepancy search. Empirical results show promising performance with quality improvement.
Multiobjective optimization using a Pareto differential evolution approach
Authors: N. K. Madavan
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Differential evolution is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. In this paper, the differential evolution algorithm is extended to multiobjective optimization problems by using a Pareto-based approach. The algorithm performs well when applied to several test optimization problems from the literature.
Stay out of My Forum! Evaluating Firm Involvement in Online Ratings Communities
Authors: Neveen Farag Awad, Jian Zhang
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

As online review systems become increasingly prevalent it is imperative for companies to evaluate their involvement in online ratings. Despite the widespread popularity of online ratings among consumers and firms alike, the business value that such systems bring to organizations, and the degree to which these organizations should be involved in filtering these reviews, remains unanswered questions. This paper addresses these questions by studying the relationship between a firm's online product ratings and the purchases made on their website. We find that the online ratings on a website are significantly correlated with online purchases. In addition, we find that a firms' filtering strategy for online reviews affects the impact of these ratings on purchases. The results of our work provide evidence that firms must think very carefully about their filtering policies for online reviews; the strategy that a firm implements in filtering their online reviews could indeed affect their bottom line.
Wavelet folding and decorrelation across the scale
Authors: J. Tian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The discrete wavelet transform (DWT) gives a compact multiscale representation of signals and provides a hierarchical structure for signal processing. It has been assumed the DWT can fairly well decorrelate real-world signals. However a residual dependency structure still remains between wavelet coefficients. It has been observed magnitudes of wavelet coefficients are highly correlated, both across the scale and at neighboring spatial locations. In this paper we present a wavelet folding technique, which folds wavelet coefficients across the scale and removes the across-the-scale dependence to a larger extent. It produces an even more compact signal representation and the energy is more concentrated in a few large coefficients. It has a great potential in applications such as image compression.
Probabilistic Admission Control to Govern Real-Time Systems under Overload
Authors: Claude-J. Hamann, Michael Roitzsch, Lars Reuther, Jean Wolter, Hermann Hartig
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

Existing real-time research focuses on how to formulate. model and enforce timeliness guarantees for task sets whose correctness has a temporal aspect. However; the resulting systems often exhibit poor resource utilization due to the resource scheduler reserving more resources than required in order to ensure that admitted schedules can be satisfied under worst case conditions. Weakening the guarantees leads to the known concepts of firm and soft real-time tasks, butt we think the paradigm needs to be shifted further,: reifying efficient utilization. With Quality-Assuring Scheduling (QAS) we presented such an algorithm. However: its practical applicability is restricted to uniform and harmonic periods, due to its complexity for arbitrary periods. To overcome this limitation, we introduce Quality-Rate-Monotonic Scheduling (QRMS), which, although slightly more pessimistic, is less complex compared to QAS. Thee admission control is again based on a probabilistic model to ensure that a requested fraction of jobs is successfully executed. Thus the amount of missed deadlines can be externally controlled, even in sustained overload situations.
An Approach to Utilize Ubiquitous device for Game-based Learning Environment
Authors: Takashi TACHINO, Yuuki KATO, Shogo KATO
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

Over recent years the importance of game-based learning situation has seen a remarkable growth. Existing computer-based platform that utilize the Internet so as to provide effective access to information regarding for exchange of ideas and knowledge aim to create online community, such attempts target only on traditional Internet users excluding an ongoing population of people that access World Wide Web via mobile phone. We suggest an innovative approach to an educational environment, where participants can sign up for the game by mobile phone. This paper introduces a game-based learning environment on ubiquitous devices and real-based simulation game which produces the learning environment in which it is possible for students to practice decision- making with communication via portable device such as mobile phones. And it also describes some preliminary results from the research on an example practice.
Hoarding Context Information with Context Clusters
Authors: Myilone Anandarajah, Ricky Robinson, Jadwiga Indulska
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

The components of a context-aware system can often become disconnected because of the dynamic environments within which they are deployed. Hoarding context information on the client application side can improve the probability that the application will continue to behave correctly in the event of disconnection. While traditional approaches to caching and hoarding can be used to combat this problem, we contend that a cache management solution that uses the extra information captured by context modelling techniques will provide more robust operation. Specifically, we focus on the metadata provided by the Context Modelling Language (CML), which may enable smarter decisions to be made by a cache management system for context information.
Distributed Enforcement of Unlinkability Policies: Looking Beyond the Chinese Wall
Authors: Apu Kapadia, Prasad Naldurg, Roy H. Campbell
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

We present a discretionary access control framework that can be used to control a principal's ability to link information from two or more audit records and compromise a user's privacy. While the traditional Chinese Wall (CW) access control model is sufficient to enforce this type of unlinkability, in distributed environments CW is inefficient because its semantics requires knowledge of a user's access history. We propose a restricted version of the CW model in which policies are easy to enforce in a decentralized manner without the need for an access history. Our architecture analyzes system policies for potential linkability conflicts. Users can identify specific threats to their privacy, typically in terms of trusted and untrusted roles in the context of RBAC (role based access control), following which the system attaches automatically generated policy constraints to the audit records. When these constraints are enforced appropriately, they implement unlinkability policies that are provably secure and precise for a fixed protection state. We extend the model with a versioning scheme that can handle evolving protection state, including changing roles and permissions, trading precision to maintain the security of deployed policies.