ppxscal/embedding_network huggingface dataset:
DSSP: A Dynamic Sleep Scheduling Protocol for Prolonging the Lifetime of Wireless Sensor Networks
Authors: Eyuphan Bulut, Ibrahim Korpeoglu
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper presents DSSP (Dynamic Sleep Scheduling Protocol), a centralized scheme for extending the lifetime of densely deployed wireless sensor networks by keeping only a necessary set of sensor nodes active. We present an algorithm for finding out which nodes should be put into sleep mode, and the algorithm preserves coverage and connectivity while trying to put as much nodes as possible into sleep mode. The algorithm is executed at the base station periodically. In this way, the network is reconfigured periodically, which also helps to a more even distribution of energy consumption load to sensor nodes. We evaluated our protocol via simulations and observed a significant increase in the lifetime, depending on the node density, while providing good coverage.
Value Lab: Collaboration in Space
Authors: Jan Halatsch
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Visualization of huge data sets for activities in business worlds, entertainment industries and extended visualization in sciences are one of the most exciting chances in architecture. They can result in interweaving physical spaces - physical architectures - with electronic data spaces - virtual architectures. Places and localities with distances in geographical, intercultural and economic matters do not need to exist separated any longer. The networking concepts shout for the use of new architectural languages. Architectural interfaces in physical and digital spaces deliver associated communication, collaboration and learning - breaking up distances in time and geographic spaces. Inside this paper we will discuss how information architecture could be set up in existing buildings with the Value Lab as an example and which methods can be used to develop and to design physical architecture. We present the Value Lab as a recent prototype for Information Architecture.
Evaluating Indirect Branch Handling Mechanisms in Software Dynamic Translation Systems
Authors: Jason D. Hiser, Daniel Williams, Wei Hu, Jack W. Davidson, Jason Mars, Bruce R. Childers
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Software Dynamic Translation (SDT) systems are used for program instrumentation, dynamic optimization, security, intrusion detection, and many other uses. As noted by many researchers, a major source of SDT overhead is the execution of code which is needed to translate an indirect branch's target address into the address of the translated destination block. This paper discusses the sources of indirect branch (IB) overhead in SDT systems and evaluates several techniques for overhead reduction. Measurements using SPEC CPU2000 show that the appropriate choice and configuration of IB translation mechanisms can significantly reduce the IB handling overhead. In addition, cross-architecture evaluation of IB handling mechanisms reveals that the most efficient implementation and configuration can be highly dependent on the implementation of the underlying architecture.
MLP interpolation for digital image processing using wavelet transform
Authors: Yu-Len Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We present nonlinear interpolation schemes for image resolution enhancement. The multilayer perceptron (MLP) interpolation schemes based on the wavelet transform and subband filtering are proposed. Because estimating each subimage signal is more effective than estimating the whole image signal, pixels in the low-resolution image are used as the input signal of the MLP to estimate all of the wavelet subimage of the corresponding high-resolution image. The image of increased resolution is finally produced by the synthesis procedure of the wavelet transform. As compared with other popular methods, the results show that the improvement is remarkable.
The relation of CLR and blocking probability for VBR traffic in the wireless ATM access transport
Authors: Po-Chih Huang
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper is focused on the relation between CLR (cell loss ratio) and blocking probability in the wireless ATM access transport. The traffic model of wireless ATM access transport is based on the cell scale, burst scale and call connection level. The CLR due to buffer overflow for wireless access node is derived for variable bit rate (VBR) traffic. The CLR due to transmission errors in the wireless channel is derived. Using the CLR for both the access node and wireless channel, the CLR of wireless ATM access transport is derived. The relation between CLR and blocking probability is analyzed for VBR traffic to evaluate performance of wireless ATM access transport.
Mixture Gaussian envelope chirp model for speech and audio
Authors: B. Mondal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We develop a parametric sinusoidal analysis/synthesis model which can be applied to both speech and audio signals. These signals are characterised by large amplitude variations and small frequency variation within a short analysis frame. The model comprises of a Gaussian mixture representation for the envelope and a sum of linear chirps for the frequency components. A closed form solution is derived for the frequency domain parameters of a chirp with Gaussian-mixture envelope, based on the spectral moments. An iterative algorithm is developed to select and estimate prominent chirps based on the psycho-acoustic masking threshold. The model can adaptively select the number of time-domain and frequency-domain parameters to suit a particular type of signal. Experimental evaluation of the technique has shown that about 2 to 4 parameters/ms is sufficient for near transparent quality reconstruction of a variety of wide-band music and speech signals.
Object Tracking using Color Correlogram
Authors: Qi Zhao, Hai Tao
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

Color histogram based representations have been widely used for blob tracking. In this paper, a new color histogram based approach for object representation is proposed. By using a simplified version of color correlogram as object feature, spatial information is incorporated into object representation, which allows variations of rotation to be detected throughout the tracking therefore rotational objects can be more accurately tracked. The gradient decent method mean shift algorithm is adopted as the central computational module and further extended to a 3D domain to find the mostprobable target position and orientation simultaneously. The capability of the tracker to tolerate appearance changes like orientation changes, small scale changes, partial occlusions and background scene changes is demonstrated using real image sequences.
Speech compression with cosine and wavelet packet near-best bases
Authors: C. Taswell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Compression of speech from the TIMIT corpus was investigated for several transform domain methods coding near-best and best bases from cosine and wavelet packet transforms. Satisficing (suboptimizing) search algorithms for selecting near-best bases were compared with optimizing algorithms for best bases in these adaptive tree-structured transforms. Experiments were performed on several hundred seconds of speech spoken by both male and female speakers from all dialect regions of the TIMIT corpus. Near-best bases provided rate-distortion performance effectively as good as that of best bases but without the additional computational penalty. Cosine packet bases outperformed wavelet packet bases.
Stabilisation of Active Contours Using Tangential Evolution: An Application to Tracking
Authors: V. Srikrishnan, Subhasis Chaudhuri, Sumantra Dutta Roy
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Active contours are very widely used in computer vision problems. Their usage has a typical problem, that of bunching together of curve points. This becomes apparent especially when we use active contours for tracking leading to instability in curve evolution. In this paper, we propose an additional tangential term to stabilise the evolution while at the same time ensuring that the curve shape is not changed. The proposed method is simple and the computational overhead is minimal, while the results are good.
The higher-order power method revisited: convergence proofs and effective initialization
Authors: P. A. Regalia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We revisit the higher-order power method of De Lathauwer et al. (1995) for rank-one tensor approximation, and its relation to contrast maximization as used in blind deconvolution. We establish a simple convergence proof for the general nonsymmetric tensor case. We show also that a symmetric version of the algorithm, offering an order of magnitude reduction in computational complexity but discarded by De Lathauwer et al. as unpredictable, is likewise provably convergent. A new initialization scheme is also developed which, unlike the TSVD-based initialization, leads to a quantifiable proximity to the globally optimal solution.
An Automated Methodology for Cogeneration of Test Blocks for Peripheral Cores
Authors: L. Bolzani, E. Sanchez, M. Schillaci, M. Sonza Reorda, G. Squillero
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Test of peripheral modules has not yet been deeply investigated by the research community. When embedded in a system on a chip, peripheral cores introduce new issues for post-production testing. A peripheral core embedded in a SoC requires a test set able to properly perform two different tasks: configure the device in different operation modes and properly exercise it. In this paper an automatic approach able to generate test sets for peripheral cores embedded in a SoC is described. The presented approach is based on an evolutionary algorithm that exploits high-level simulation and gathers coverage metrics information to produce the test sets. The method compares favorably with results obtained by hand.
Generalized trade reduction mechanisms
Authors: Mira Gonen, Rica Gonen, Elan Pavlov
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

When designing a mechanism there are several desirable properties tomaintain such as incentive compatibility (IC), individual rationality (IR), and budget balance (BB). It is well known [15] that it is impossible for a mechanism to maximize social welfare whilst also being IR, IC, and BB. There have been several attempts to circumvent [15] by trading welfare for BB, e.g.,in domains such as double-sided auctions [13], distributed markets [3] and supply chain problems [2, 4]. In this paper we provide a procedure called a Generalized Trade Reduction (GTR) for single-value players, which given an IR and IC mechanism, outputs a mechanism which is IR, IC and BB with a loss of welfare. We bound the welfare achieved by our procedure for a wide range of domains. In particular, our resultsimprove on existing solutions for problems such as double sidedmarkets with homogenous goods, distributed markets and several kinds of supply chains. Furthermore, our solution provides budget balanced mechanisms for several open problems such as combinatorial double-sided auctions and distributed markets with strategic transportation edges.
The Analysis on the Customers Churn of Charge Email Based on Data Mining Take One Internet Company for Example
Authors: Guangli Nie, Lingling Zhang, Xingsen Li, Yong Shi
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The email has profoundly affected our ways of life. In the year 2001, many websites begin operating the charge emails in china. Recently the foreign internet company serves free email with large storage capability, which threats the existence of charge email. The churn of email users is serious. This paper studied the churn of the customer using the way of data mining based on the background introduced. There are a lot models and study papers on data mining. This is the same on the churn. But there is few study paper about the churn of charge email based on data mining. So this is the innovation of this paper. Then we analyzed the data after processing the data by way of data cleaning and data integration based on the method of data mining. The data includes the logdata which contain the information of using the email and the database-data which was provided when the client applied the email. The model which I used to train the data is decision tree (see5). The models I get after the operation implicate the feature of the churn before they stop using the email. By reasonable explanation of the model, we can help the enterprise to improve the customer relationship management (CRM) and redeem the customers who would leave the email.
A new learning algorithm for a forecasting neuro-fuzzy network
Authors: Peter Otto, Yevgeniy Bodyanskiy, Vitaliy Kolodyazhniy
Venue: Integrated Computer-Aided Engineering (2003)

The article addresses the problem of adaptive learning in a neuro-fuzzy network based on Sugeno-type fuzzy inference. A new learning algorithm for tuning of both the antecedent and consequent parts of the fuzzy rules is proposed. The algorithm is derived from the Hartley and Marquardt methods. A characteristic feature of the proposed algorithm is that it does not include time-consuming matrix inversion operations. Simulation results prove the high performance of the algorithm and illustrate its application to time series forecasting.
Dependability Aspects of Ubiquitous Computing
Authors: Lu Yan, Kaisa Sere
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

With more than 2 billions terminals in commercial operation world-wide, wireless and mobile technologies have enabled a first wave of pervasive communication systems and applications. Still, this is only the beginning, as wireless technologies such as RFID are currently contemplated with a deployment potential of ten's of billions of tags and a virtually unlimited application potential. Although significant R&D work has been undertaken over recent years on these systems, most of the research is still very application specific, with security and environmental applications dominating and demonstration driven. However, it is likely that more generic and comprehensive approach is required, where different stakeholders and research specialists work together to solve true systems level problems.
Quality of manual data collection in Java software: an empirical investigation
Authors: Steve Counsell, George Loizou, Rajaa Najjar
Venue: Empirical Software Engineering (2007)

Data collection, both automatic and manual, lies at the heart of all empirical studies. The quality of data collected from software informs decisions on maintenance, testing and wider issues such as the need for system re-engineering. While of the two types stated, automatic data collection is preferable, there are numerous occasions when manual data collection is unavoidable. Yet, very little evidence exists to assess the error-proneness of the latter. Herein, we investigate the extent to which manual data collection for Java software compared with its automatic counterpart for the same data. We investigate three hypotheses relating to the difference between automated and manual data collection. Five Java systems were used to support our investigation. Results showed that, as expected, manual data collection was error-prone, but nowhere near the extent we had initially envisaged. Key indicators of mistakes in manual data collection were found to be poor developer coding style, poor adherence to sound OO coding principles, and the existence of relatively large classes in some systems. Some interesting results were found relating to the collection of public class features and the types of error made during manual data collection. The study thus offers an insight into some of the typical problems associated with collecting data manually; more significantly, it highlights the problems that poorly written systems have on the quality of visually extracted data.
Large-scale analysis of format string vulnerabilities in Debian Linux
Authors: Karl Chen, David Wagner
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

Format-string bugs are a relatively common security vulnerability, and can lead to arbitrary code execution. In collaboration with others, we designed and implemented a system to eliminate format string vulnerabilities from an entire Linux distribution, using type-qualifier inference, a static analysis technique that can find taint violations. We successfully analyze 66% of C/C++ source packages in the Debian 3.1 Linux distribution. Our system finds 1,533 format string taint warnings. We estimate that 85% of these are true positives, i.e., real bugs; ignoring duplicates from libraries, about 75% are real bugs. We suggest that the technology exists to render format string vulnerabilities extinct in the near future.
Shark: scaling file servers via cooperative caching
Authors: Siddhartha Annapureddy, Michael J. Freedman, David Mazières
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

Network file systems offer a powerful, transparent interface for accessing remote data. Unfortunately, in current network file systems like NFS, clients fetch data from a central file server, inherently limiting the system's ability to scale to many clients. While recent distributed (peer-to-peer) systems have managed to eliminate this scalability bottleneck, they are often exceedingly complex and provide non-standard models for administration and accountability. We present Shark, a novel system that retains the best of both worlds--the scalability of distributed systems with the simplicity of central servers. Shark is a distributed file system designed for large-scale, wide-area deployment, while also providing a drop-in replacement for local-area file systems. Shark introduces a novel cooperative-caching mechanism, in which mutually-distrustful clients can exploit each others' file caches to reduce load on an origin file server. Using a distributed index, Shark clients find nearby copies of data, even when files originate from different servers. Performance results show that Shark can greatly reduce server load and improve client latency for read-heavy workloads both in the wide and local areas, while still remaining competitive for single clients in the local area. Thus, Shark enables modestly-provisioned file servers to scale to hundreds of read-mostly clients while retaining traditional usability, consistency, security, and accountability.
The Impact of Additional Electronic Word-of-Mouth on Sales of Digital Micro-products over Time: A Longitudinal Analysis of Amazon Shorts
Authors: Naveen Amblee, Tung Bui
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The purpose of this research was to conduct a longitudinal study of the impacts of additional reviews on sales of digital micro-products. Following daily sales of 121 digital micro-products -- Amazon's Shorts -- over a period of five months, we performed individual time series analyses and aggregated our individual findings with logistic regression. We have found that not all reviews impact sales. Shorts with high brand and complementary goods reputations are more likely to have the time series of their sales impacted by the addition of a review. Perhaps the most intriguing discovery is that Shorts with high (low) brand and complementary goods reputations are more (less) likely to have reviews posted to them in the future.
Vforce: An Extensible Framework for Reconfigurable Supercomputing
Authors: Nicholas Moore, Albert Conti, Miriam Leeser, Laurie Smith King
Venue: Computer (2007)

Reconfigurable supercomputer architectures require new programming tools that support application portability. The Vforce framework, based on the object-oriented VSIPL++ standard, encapsulates hardware-specific implementations behind a standard API, thus insulating application-level code from hardware-specific details.
Blind estimation of symbol timing and carrier frequency offset in pulse shaping OFDM systems
Authors: H. Bolcskei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We introduce a blind algorithm for the joint estimation of symbol timing and carrier frequency offset in pulse shaping OFDM systems. The proposed estimator exploits the cyclostationarity of the received OFDM signal and can be seen as an extension of the Gini-Giannakis estimator (see IEEE Trans. Comm., vol.46, p.400-11, 1998) for single-carrier systems. An important feature of our method is the capability to perform a carrier frequency acquisition over the entire bandwidth of the OFDM signal. Furthermore, our estimator can be applied even if no cyclic prefix is used. We provide simulation results demonstrating the performance of the new estimator. 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
Keeping Order: Determining the Effect of TCP Packet Reordering
Authors: Colin M. Arthur, Andrew Lehane, David Harle
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Packet Reordering over TCP/IP networks is a phenomenon which is becoming increasingly important in network performance analysis. Reordering is a consequence of network equipment manufacturers increasing switch and link level parallelism on the Internet, seeking performance, reliability and economical improvements. This paper presents a methodology for simulating and measuring TCP reordering, providing an insight into the behaviours of the congestion and retransmission algorithms, and demonstrating that reordering has a measurable effect on performance. These measurements illustrate that there is a maximum reordering delay threshold that should be applied to packets, regardless of percentage reordering, below which reordering has negligible effects. Determination of this threshold, on a specific path, is key to ensuring that a specific switch or router does not introduce reordering to such an extent that it causes unnecessary retransmissions and an associated reduction in throughput.
Applying Agent Technology in Water Pollution Monitoring Systems
Authors: Mihaela Oprea, Constantin Nichita
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

Monitoring local and national water quality is a resource intensive process, with increasing complexity as national directives with regard to water quality are being aligned with European directives. In this paper we propose the application of intelligent agent software technology to water quality monitoring for regulatory compliance. The system can also be used to facilitate response to contamination incidents. We give a brief description of the analysis phase of our MAS development.