ppxscal/embedding_network huggingface dataset:
Sensor networks for agent based distributed energy resources [cool room control example]
Authors: J. Ward, G. Platt
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

We are developing agents for the control of distributed energy resources (DERS) in the electricity network. These resources consist of both generators and loads, physically located close to load centres. Although traditionally DERs have operated independently, we have been able to demonstrate an architecture whereby DERs collaborate to present an aggregated response. This aggregated response can be used to support the network at times of peak demand, increasing efficiency and robustness. In this paper, we focus on one such DER agent, which provides control of a commercial cool room. This agent utilizes a wireless sensor network to collect information on various products in the cool room, allowing the control system to respond based on aggregated conditions across the sensor network. Through development of new software and protocols, the sensor network is able to exist on the same control channel as traditional control hardware and provide extra reliability and fault tolerance.
Using Wavelet Transform, DPCM and Adaptive Run-length Coding to Compress Images
Authors: Ban N. Thanoon
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

This research work aims to investigate the performance of a suggested wavelet based image compression system. The scheme of the proposed system utilizes 9/7 biorthogonal wavelet transforms to decompose the image signal, then uses run-length coding, with a little modification, to compress the detail sub-bands. A hierarchal quantization scheme was applied to reduce the number of bits required to encode the wavelet coefficients. The test results indicate that the proposed compression scheme shows good performance aspects in addition to its simplicity.
Preconditioning the limited-memory bfgs algorithm
Authors: Richard H. Byrd
Venue:  (2006)

For large scale unconstrained optimization, truncated Newton methods and limited memory quasi-Newton methods are most effective choices. Often, the truncated Newton method adopts a preconditioner to speed up the convergence. However, very little previous study has explored the possibility of using a preconditioner in the limited memory quasi-Newton method. In this thesis, we focus on the LBFGS method, which belongs to the limited memory quasi-Newton methods, and we implement and study this preconditioned LBFGS algorithm (PLBFGS). We did experiments on protein structure prediction problems with three kinds of preconditioners constructed from the protein potential energy function. We also did experiments on a set of general test problems using a general preconditioner, the incomplete Cholesky factorization preconditioner. The results show that PLBFGS method has significant performance improvement over LBFGS algorithm by using the preconditioners, and has advantages over the standard preconditioned truncated Newton method. We also proposed a dynamic preconditioner update interval strategy, which benefits both preconditioned LBFGS method and preconditioned truncated Newton method.
URES: an unsupervised web relation extraction system
Authors: Benjamin Rosenfeld, Ronen Feldman
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Most information extraction systems either use hand written extraction patterns or use a machine learning algorithm that is trained on a manually annotated corpus. Both of these approaches require massive human effort and hence prevent information extraction from becoming more widely applicable. In this paper we present URES (Unsupervised Relation Extraction System), which extracts relations from the Web in a totally unsupervised way. It takes as input the descriptions of the target relations, which include the names of the predicates, the types of their attributes, and several seed instances of the relations. Then the system downloads from the Web a large collection of pages that are likely to contain instances of the target relations. From those pages, utilizing the known seed instances, the system learns the relation patterns, which are then used for extraction. We present several experiments in which we learn patterns and extract instances of a set of several common IE relations, comparing several pattern learning and filtering setups. We demonstrate that using simple noun phrase tagger is sufficient as a base for accurate patterns. However, having a named entity recognizer, which is able to recognize the types of the relation attributes significantly, enhances the extraction performance. We also compare our approach with KnowItAll's fixed generic patterns.
Multi-Agent Cooperative Design Support in Distributed Environments
Authors: Camelia Chira, D. Dumitrescu
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The paper addresses system modelling and engineering in cooperative distributed environments. Multi-agent systems, ontologies and web technologies are used for the support and management of resources in a distributed virtual environment. Distributed design involves dispersed heterogeneous teams of people who have to establish and maintain an efficient cooperation process in order to reach global "optimal' solutions to various problems. Key needs addressed by the introduced multi-agent system refer to interoperation among distributed resources and knowledge sharing, reuse and integration. An ontology library creates a common shared understanding of the domain for interoperating agents. The proposed system employs agents for information storage and retrieval, for enhancing collaboration within a distributed design environment and for providing a suitable interface to the user. The agents offer content-related support to the user by committing to the same library of ontologies. The proposed multi-agent design information management system aims to facilitate the optimization of the solution space of the collective dispersed design team.
Experiences with a laboratory-intensive curriculum in electrical engineering
Authors: T. W. Martin
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The Department of Electrical Engineering at the University of Arkansas implemented major changes in the curriculum in the Fall 1997 semester. A part of these changes was an increase in the number of laboratory hours and the method of delivering the laboratories. Prior to making changes in the curriculum, there were four semester hours of laboratory associated with the required courses and two required courses with a small laboratory component. Under the new curriculum, all of the required core electrical engineering course, with the exception of electromagnetics, have a one-semester hour laboratory associated directly with them. Some of the topics discussed in this paper are: (1) motivation for increasing the laboratory hours, (2) initial and resulting laboratory requirements, (3) increased demands on faculty time, (4) maintenance of the laboratories, (5) logistics of physically accommodating the increased number of laboratories, and (6) positive/negative aspects of the changes made in the laboratory portion of the curriculum.
Hidden Markov models with divergence based vector quantized variances
Authors: J. Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper describes a method to significantly reduce the complexity of continuous density HMM with only a small degradation in performance. The proposed method is noise-robust and may perform even better than the standard algorithm if training and testing noise conditions are not matched. The method is based on approximating the variance vectors of the Gaussian kernels by a vector quantization (VQ) codebook of a small size. The quantization of the variance vectors is done using an information theoretic distortion measure. Closed form expressions are given for the computation of the VQ codebook and the superiority of the proposed distortion measure over the Euclidean distance is demonstrated. The effectiveness of the proposed method is shown using the connected TI digits database and a noisy version of it. For the connected TI digit database, the proposed method shows that by quantizing the variance to 16 levels we can maintain recognition performance within 1% degradation of the original VR system. In comparison, with Euclidean distortion, a size 256 codebook is needed for a similar error rate.
Understanding engineering students for better recruitment strategies: a four-year study
Authors: M. R. Anderson-Rowland
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Engineering enrollments are declining. Interest in engineering is near a 20 year low among entering college freshmen. At the same time, the demand for engineering in the US is great, with foreign national students being brought to our country to help fill the gap. The situation calls for increased efforts in recruitment and retention. Since many university budgets are shrinking, accountability is expected for all invested funds, including those used for recruitment and retention. To better allocate resources to recruitment and retention efforts, a pilot survey was first administered to engineering freshman at ASU in the fall of 1994. This survey was refined and continued for an additional four years. Evaluations of the surveys in the first few years revealed some surprises. In the first survey, the primary reasons for attending ASU for an engineering degree was similar for both women and men: a good engineering school, close to home, and good weather. Surprising results, obtained from early surveys, showed that over fifty percent of the junior college transfers only decided on engineering after they attended college. Contrary to expectations, the data also showed that for underrepresented minority engineering students, it made no difference if they took the Introduction to Engineering class in their first or second semester. We look at the freshman engineering class longitudinally with four years of data. The paper examines if there have been any changes in recruitment and retention efforts during the last four years in response to information learned through the early surveys.
Revisiting Java Bytecode Compression for Embedded and Mobile Computing Environments
Authors: Dimitris Saougkos George Manis Konstantinos Blekas, Apostolos V. Zarras
Venue: IEEE Transactions on Software Engineering (2007)

Pattern-based Java bytecode compression techniques rely on the identification of identical instruction sequences that occur more than once. Each occurrence of such a sequence is substituted by a single instruction. The sequence defines a pattern that is used for extending the standard bytecode instruction set with the instruction that substitutes the pattern occurrences in the original bytecode. Alternatively, the pattern may be stored in a dictionary that serves for the bytecode decompression. In this case, the instruction that substitutes the pattern in the original bytecode serves as an index to the dictionary. In this paper, we investigate a bytecode compression technique that considers a more general case of patterns. Specifically, we employ the use of an advanced pattern discovery technique that allows locating patterns of an arbitrary length, which may contain a variable number of wildcards in place of certain instruction opcodes or operands. We evaluate the benefits and the limitations of this technique in various scenarios that aim at compressing the reference implementation of MIDP, a standard Java environment for the development of applications for mobile devices.
Failure-Resilient Computations in the EcliPSe System
Authors: Felipe Knop, Vernon Rego, Vaidy Sunderam, Adam Ferrari
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Local or wide-area connected workstation cluster-based computation systems are inherently failure-prone, particularly for long running computations. In this work we introduce a variety of features for failure resilience in the EcliPSe system for replicative applications. Key characteristics of fault-tolerant EcliPSe are ease of use, low statesaving costs, system scalability and good performance.
How New Network Markets Emerge: A Comparative Analysis of the Mobile Internet in Japan and Europe
Authors: Michael Haas
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Although markets for network goods and services such as video games, DVD-players, or PC hard- and software have since long become a standard topic of economic research and textbooks, our understanding of their emergence is less well advanced. The extent literature is particularly "blind' with regard to cases in which the compelling content that eventually drives demand for innovative hardware is not yet known. In such cases not the availability of a large content variety as such but the discovery of the "right' content is crucial for the emergence of a new market. This paper shows that firms which plan to launch a new network product but do not yet know how compelling content for this product will look like are well advised to ensure that a) experimentation processes inevitable for making latent customer needs explicit are not hampered and b) results of the experiments can be monitored, e.g. a billing infrastructure is in place that allows to individually track which content offering is demanded by customers and which is not.
Revenue analysis of a family of ranking rules for keyword auctions
Authors: Sébastien Lahaie, David M. Pennock
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

Keyword auctions lie at the core of the business models of today's leading search engines. Advertisers bid for placement alongside search results, and are charged for clicks on their ads. Advertisers are typically ranked according to a score that takes into account their bids and potential click-through rates. We consider a family of ranking rules that contains those typically used to model Yahoo! and Google's auction designs as special cases. We find that in general neither of these is necessarily revenue-optimal in equilibrium, and that the choice of ranking rule can be guided by considering the correlation between bidders' values and click-through rates. We propose a simple approach to determine a revenue-optimal ranking rule within our family, taking into account effects on advertiser satisfaction and user experience. We illustrate the approach using Monte-Carlo simulations based on distributions fitted to Yahoo! bid and click-through rate data for a high-volume keyword.
Evaluation of a Low-Cost 3D Sound System for Immersive Virtual Reality Training Systems
Authors: Kai-Uwe Doerr
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Since Head Mounted Displays (HMD), datagloves, tracking systems, and powerful computer graphics resources are nowadays in an affordable price range, the usage of PC-based "Virtual Training Systems” becomes very attractive. However, due to the limited field of view of HMD devices, additional modalities have to be provided to benefit from 3D environments. A 3D sound simulation can improve the capabilities of VR systems dramatically. Unfortunately, realistic 3D sound simulations are expensive and demand a tremendous amount of computational power to calculate reverberation, occlusion, and obstruction effects. To use 3D sound in a PC-based training system as a way to direct and guide trainees to observe specific events in 3D space, a cheaper alternative has to be provided, so that a broader range of applications can take advantage of this modality. To address this issue, we focus in this paper on the evaluation of a low-cost 3D sound simulation that is capable of providing traceable 3D sound events. We describe our experimental system setup using conventional stereo headsets in combination with a tracked HMD device and present our results with regard to precision, speed, and used signal types for localizing simulated sound events in a virtual training environment.
Visual Interactions in Software Technology
Authors: Guido Wirtz, Kang Zhang
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Software development life cycle involves the activities of project management, requirement analysis and specification, architectural and system design, algorithm design, coding, testing, quality assurance, maintenance, and if necessary performance tuning. Throughout the development cycle, visual means have been playing an important rule in almost all the development activities, such as visual modeling using UML, design using flowcharts, and performance analysis using space-time diagrams, to name only a few. Interactivity among the visual components representing software artifacts and between software systems and the human (developers and users) is the key to the success of the visual assistance to the software development lifecycle.
Multi-channel high resolution blind image restoration
Authors: P. D. Wirawan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We address the reconstruction problem of a high resolution image from its undersampled measurements across multiple FIR channels with unknown response. Our method consists of two stages: blind multi-input multi-output (MIMO) deconvolution using FIR filters and blind separation of mixed polyphase components. The proposed deconvolution method is based on the mutually referenced equalizers (MRE) algorithm previously developed for blind equalization in digital communications. For sources separation, a method is proposed for separating mixed polyphase components of a bandlimited signal. The existing blind source separation algorithms assume that the source signals are either independent or uncorrelated, which is not the case when the sources are polyphase components of a bandlimited signal. Simulation results on artificial and photographic images are given.
Algorithms and methodology in physical domain optimization for high-performance vlsi design
Authors: Dian Zhou
Venue:  (2006)

Computer-Aided Design (CAD) tools are extensively used throughout all of the steps in a VLSI design flow. The physical design domain is one of the three domains that are conceptually abstracted in representing a VLSI design flow. This research work focuses on three areas in VLSI physical design domain: clock tree design and buffer insertion, interconnect model order reduction and LVS verification. First, an optimal buffer insertion for clock delay and skew minimization algorithm is developed based on the theory that the minimal clock delay can be obtained by equalizing derivatives of a convex function, and the minimal clock skew can be achieved by equalizing delay functions of different source-to-sink paths. Experimental results show that the presented algorithm achieves both minimal delay and skew in real clock tree design. Further, an automatic clock tree design algorithm is developed for realizing the pre-specified clock arrival time requirements that often occur in an IP block based design environment. In this proposed strategy, planar clock routing and buffer insertion are carried out simultaneously to minimize clock delay and skew, and a full waveform simulation is applied to ensure the signal integrity necessary for high-speed VLSI design. Second, an efficient balanced truncation realization algorithm is presented for interconnect model order reduction. This algorithm shows that there is no need to solve the whole Lyapunov equation for controllability and observability grammians before obtaining approximation to their predominant spaces, and a linear order reduction algorithm can be achieved by extending the O(n) Krylov Subspace Oblique Projection method. Finally, a unique LVS methodology is proposed for the verification of a quad-core microprocessor designed with a triple-well 90-nm CMOS technology. Due to the IP reuse, the standard LVS flow is incapable of handling the additional design complexity in verifying the LVS for the chip designed with multiple power domains. This proposed LVS strategy consists of two phases. The first phase involves verifying LVS at the block level as well as the full-chip level. The second phase aims at verifying the integrity of the multi-power-domain power grid. The proposed LVS methodology was successfully verified by real silicon.
Efficient random access channel transmission method utilizing soft-combining of retransmitted message packets according to QoS
Authors: Y. Lizuka, M. Tanno, M. Sawahashi
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper proposes an efficient random access channel (RACH) transmission method that utilizes soft-combining of consecutively retransmitted message data packets according to the quality of service (QoS) requirements for broadband multi-carrier/DS-CDMA (MC/DS-CDMA) in the reverse link. In the proposed scheme, the relative transmission power of message data compared to that of a successfully detected preamble for non-real time (NRT) traffic data is significantly reduced to achieve error-free transmission by soft-combining several retransmitted message data packets thanks to time diversity since the delay requirement is relaxed. Meanwhile, for real time (RT) traffic data with rigid delay requirements, the relative transmission power of the message data compared to that of the detected preamble is increased to reduce the residual packet error rate with a limited number of retransmissions. Simulation results elucidate that the total required average received signal energy per bit-to-background noise power spectrum density ratio (E/sub b//N/sub 0/) for error-free transmission with time diversity for NRT traffic data is reduced by approximately 2.4 dB compared to that for RT traffic data in a 12-path fading channel with exponential distribution at the fading maximum Doppler frequency of f/sub D/ = 20 Hz.
Simplified Modeling, Simulation and Performance Analysis Using Circuit Model for a Corporate Feed Microstrip Patch Array
Authors: P. J. Soh, A. A. H. Azremi, R. A. Rahim, H. Dayang, M. T. Jusoh
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This work is an effort in investigating and modeling an accurate Circuit Model derived from the Transmission Line Method (CM/TLM) by simulating a rectangular microstrip patch array using two different simulation techniques, the Transmission Line Method (TLM) and Method of Moments (MoM). Each array contains two element units of rectangular patches. This basic rectangular patch is very accurately modeled in a previous work. The array, which is a combination of several unit of this basic structure, is designed to resonate at 3G/UMTS frequency of 2 GHz. A standard software platform is chosen to simulate both techniques and Microwave Office^TM software is utilized. Both simulation sets (using CM/TLM and MoM) are compared and to determine their level of variation in terms of bandwidth, resonant frequency (fres) and S11. MoM-simulated structure is then fabricated and measured to determine the degree of distinction between hardware and the two simulation sets. Fabrication is done on an FR-4 board with a relative permittivity (\varepsilon_r) of 4.7. Antennas designed and simulated for each feeding technique achieved the best return losses at the desired frequency, which is 2 GHz, with S11 values lower than -10 dB. At the same time, both produced relatively sufficient bandwidth for its kind which is about 3.2%. CM presented in this work has been found out to have less than 5% difference compared to its MoM counterpart in terms of S11 and resonant frequency (f_res), and slightly higher variation of 6.4% in terms of bandwidth.