ppxscal/embedding_network huggingface dataset:
Rate-lifetime tradeoff for reliable communication in wireless sensor networks
Authors: Junhua Zhu, Ka-Lok Hung, Brahim Bensaou, Farid Nait-Abdesselam
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The network lifetime and application performance are two fundamental, yet conflicting, design objectives in wireless sensor networks. There is an intrinsic tradeoff between network lifetime maximization and application performance maximization, the latter being often correlated to the rate at which the application can send its data reliably in sensor networks. In this paper we study this tradeoff by investigating the interactions between the network lifetime maximization problem and the rate allocation problem with a reliable data delivery requirement. Severe bias on the allocated rates of some sensor nodes may exist if only the total throughput of the sensor network is maximized, hence we enforce fairness on source rates of sensor nodes by invoking the network utility maximization (NUM) framework. To guarantee reliable communication, we adopt the hop-by-hop retransmission scheme. We formulate the network lifetime maximization and fair rate allocation both as constrained maximization problems. We characterize the tradeoff between them, give the optimality condition, and derive a partially distributed algorithm to solve the problem. Furthermore, we propose an approximation of the tradeoff problem using NUM framework, and derive a fully distributed algorithm to solve the problem.
Low-Cost Testers: Are They Really Low Cost?
Authors: G. Bowers, B. Pratt
Venue: IEEE Design Test (1985)

Initial ATE capital investments can affect overall test manufacturing costs as shown in this analysis, which compares a $5000semiconductor tester with a $900,000 system (purchase price). The application is wafer testing of logic die, and the producthas a five-year lifetime. Variables affecting cost include tester throughput, wafer test escape rate, and test system capitalcost. Factors considered in the analysis include (1) the number of test systems required and the cost effect of capital, floorspace, and manpower, (2) the quality of test and the effect of escapes on subsequent manufacturing operations; and (3) theeffects of tax credits on the two options. Results of the comparison show that a major factor is escape from wafer test. Evena low escape rate justifies the use of the $900,000 general-purpose system over the $5000 low-cost tester. Throughput differencesalso tend to negate any initial cost advantage with the LCT. When total systems are considered (four LCTs are needed overthe five years), total capital costs tend to converge. A major asset of the GPT is its flexibility, making it again more attractivethan the LCT.
Confidence intervals for the difference between two means
Authors: Weiwen Miao, Paul Chiou
Venue: Computational Statistics Data Analysis (2008)

This paper compares three confidence intervals for the difference between two means when the distributions are non-normal and their variances are unknown. The confidence intervals considered are Welch-Satterthwaite confidence interval, the adaptive interval that incorporates a preliminary test (pre-test) of symmetry for the underlying distributions, and the adaptive interval that incorporates the Shapiro-Wilk test for normality as a pre-test. The adaptive confidence intervals use the Welch-Satterthwaite interval if the pre-test fails to reject symmetry (or normality) for both distributions; otherwise, apply the Welch-Satterthwaite confidence interval to the log-transformed data, then transform the interval back. Our study shows that the adaptive interval with pre-test of symmetry has best coverage among the three intervals considered. Simulation studies show that the adaptive interval with pre-test of symmetry performs as well as the Welch-Satterthwaite interval for symmetric distributions. However, for skewed distributions, the adaptive interval with pre-test of symmetry performs better than the Welch-Satterthwaite interval.
A survey of affect recognition methods: audio, visual and spontaneous expressions
Authors: Zhihong Zeng, Maja Pantic, Glenn I. Roisman, Thomas S. Huang
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Automated analysis of human affective behavior has attracted increasing attention from researchers in psychology, computer science, linguistics, neuroscience, and related disciplines. Promising approaches have been reported, including automatic methods for facial and vocal affect recognition. However, the existing methods typically handle only deliberately displayed and exaggerated expressions of prototypical emotions-despite the fact that deliberate behavior differs in visual and audio expressions from spontaneously occurring behavior. Recently efforts to develop algorithms that can process naturally occurring human affective behavior have emerged. This paper surveys these efforts. We first discuss human emotion perception from a psychological perspective. Next, we examine the available approaches to solving the problem of machine understanding of human affective behavior occurring in real-world settings. We finally outline some scientific and engineering challenges for advancing human affect sensing technology.
An analysis of browser domain-isolation bugs and a light-weight transparent defense mechanism
Authors: Shuo Chen, David Ross, Yi-Min Wang
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Browsers' isolation mechanisms are critical to users' safety and privacy on the web. Achieving proper isolations, however, is very difficult. Historical data show that even for seemingly simple isolation policies, the current browser implementations are surprisingly error-prone. Isolation bugs have been exploited on most major browser products. This paper presents a focused study of browser isolation bugs and attacks. We found that because of the intrinsic complexity of browser components, it is impractical to exhaustively examine the browser implementation to eliminate these bugs. In this paper, we propose the script accenting mechanism as a light-weight transparent defense to enhance the current domain isolation mechanism. The basic idea is to introduce domain-specific "accents" to scripts and HTML object names so that two frames cannot communicate/interfere if they have different accents. The mechanism has been prototyped on Internet Explorer. Our evaluations showed that all known attacks were defeated, and the proposed mechanism is fully transparent to existing web applications. The measurement about end-to-end browsing time did not show any noticeable slowdown. We also argue that accenting could be a primitive that is general enough for implementing other domain-isolation policies.
A Hybrid Data Mining Approach for Knowledge Extraction and Classification in Medical Databases
Authors: Syed ZahidHassan, Brijesh Verma
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper presents a novel hybrid data mining approach for knowledge extraction and classification in medical databases. The approach combines self organizing map, k-means and naïve bayes with a neural network based classifier. The idea is to cluster all data in soft clusters using neural and statistical clustering and fuse them using serial and parallel fusion in conjunction with a neural classifier. The approach has been implemented and tested on a benchmark medical database. The preliminary experiments are very promising.
ECharts for SIP servlets: a state-machine programming environment for VoIP applications
Authors: Thomas M. Smith, Gregory W. Bond
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

The development of telecommunication applications that require multiple call legs is often complex due to their event-driven nature as well as the significant amount of state that must be maintained. In general, the state associated with different call legs within an application instance differs and must be separately maintained; in addition, (non-call related) application state is often required. As a means of managing all the required state information, application developers often implement ad-hoc state machine programming constructs within the application. This paper describes an alternate approach, wherein the application logic is written in ECharts, an open-source state-machine programming language, and translated into SIP Servlet applications which can be deployed and executed on any standards-compliant container. This approach can yield great benefits for complex applications, including reusability, increased maintainability, and the prospect of program analysis.
Simultaneous input vector selection and dual threshold voltage assignment for static leakage minimization
Authors: Lin Yuan, Gang Qu
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Dual Vt assignment and input vector control are two tightly coupled leakage reduction techniques. We study how to apply them effectively to a circuit to minimize the static leakage power. We argue that simply combining them in a serial fashion will not reach their full potential in leakage reduction. To show this, we propose a heuristic algorithm that integrates them into a single optimization loop by assigning the value for primary inputs and Vt for logic gates simultaneously. Our algorithm leverages the fact that both input vector and threshold voltage Vt have great impact on a gate's leakage at standby mode and avoids to assign a gate both low Vt and input vector that results high leakage. The selection of input vector and the assignment of Vt are integrated seamlessly through the concepts of leakage observability, worst leakage state, and path factor. The proposed algorithm has a low run time complexity and achieves an average 15% leakage reduction on all the ISCAS and MCNC benchmarks over the serial combination of input vector selection and dual Vt assignment.
Separating Latent Classes by Information Criteria
Authors: Chih-Chien Yang, Chih-Chiang Yang
Venue: Journal of Classification (2007)

This study evaluates performance of information criteria used to separate latent classes. In the evaluations, various numbers of latent classes, sample sizes, parameter structures and latent-class complexities were designed to simulate datasets. The average accuracy rates of information criteria in selecting the designed numbers of latent classes were the core results in this experiment. The study revealed that widely used information criteria, e.g., AIC, BIC, CAIC, could perform poorly under some circumstances. By including a sample size adjustment (Rissanen, 1978), the unsatis-factory performances could be improved considerably. The sample size adjustment provides a plausible solution for separating latent classes. Guidelines are provided to help achieve optimum use of the model fit indices.
Potential speech features for cognitive load measurement
Authors: M. Asif Khawaja, Natalie Ruiz, Fang Chen
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Intelligent user interfaces with an awareness of a user's experienced level of cognitive load have the potential to change the way output strategies are implemented and executed. However, current methods of measuring cognitive load are intrusive and unsuitable in real-time scenarios. Certain speech features have been shown to change under high levels of load. We present a dual-task speech based user study in which we explore three speech features: pause length, pause frequency and latency to response. These features are evaluated for their diagnostic capacity. Pause length and latency to response are shown to be useful indicators of high load versus low load speech.
What A Single Template Can Do in Recognition
Authors: Lixin Fan
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This article presents a generic object detection and tracking system that requires a single template only. The system allows end-users to choose arbitrary objects to recognize, without need of extensive training. Although a single template is used, the detection and tracking are robust to different imaging conditions and intra-class variation. Finally, the system is fast and achieves real time frame rate on laptop PCs.
Applying data mining technology to analyze user behavior in course website
Authors: Chien-Yun Dai, Chen-Chieh Yeh, Chi-Jun Lu
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Information of network grows up fast, and there is an important thing providing user a tool which could search information quickly. In order to achieve this purpose and we must track and analyze user behavior of network. We apply data mining approach which is used to accurately capture user behavior of network traffic, and the proposed prediction model is constructed by log database. This research is used Petri-net method to grasp the user behavior accurately, and it offers path of user behavior. And we use converted weight matrix method to construct rule table and prediction model, and it has flexibility to make management and access of the database more convenient. The experimental results showed that improve site of website and predict path of user behavior efficiently.
High Data Rate Ultra Wideband System Design for Wireless Sensor Network
Authors: Liang Zhaohui
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Ultra wideband impulse radio (UWB-IR) is a highly promising physical layer technology for wireless sensor network (WSN) due to its unique characteristics such as low power transmission, low cost and low complexity transceiver circuitry. In this paper, a novel method for high data rate transmissions in ultra wideband (UWB) communications is proposed. It employs a combination of pulse polarity modulation and pulses shape modulation for the simultaneous transmission of multiple bits. Two orthogonal pulses based on wavelet are presented, their spectrum meet The U.S. Federal Communications Commission (FCC) spectral rules. High achievable data rate for UWB systems means that sensors can transfer their payload data quickly and spend much of the rest of the time "asleep" or in a low-power state.
Special Feature Report on Intermag '77 Current Developments in Magnetic Bubble Technology
Authors: W. Myers
Venue: Computer (1977)

Last November we reported that magnetic bubble memory devices would be available this year, permitting designers to find out about them first hand.1The most important development since then for the computer industry was Texas Instruments' March announcement of the first commercially available bubble device-a 92K chip-for about $200 each in sample quantities. Of importance as an indication of what the next two years could bring to the market was Rockwell International's announcement on June 7 at the International Magnetics Conference in Los Angeles of the successful development of a one-million-bit bubble device in its Electronic Research Division.2 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
A Secure Aggregation Protocol for Cluster-Based Wireless Sensor Networks With no Requirements for Trusted Aggregator Nodes
Authors: Chakib Bekara, Maryline Laurent-Maknavicius
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Data aggregation is an important feature in wireless sensor networks (WSN), where data inputs at an aggregator node are merged to produce compact small output data, thus reducing the network's transmission overhead and preserving the scarce-battery resources of sensors. Unfortunately, if not secured against attackers, data aggregation can produce erroneous results, which can induce the network operator to take wrong decisions. In this paper, we present a secure aggregation protocol for cluster-based WSN, which is adapted to a large variety of aggregation functions, and which does not rely on trusted aggregator nodes. The inherent transmission overhead is even smaller than in other secure aggregation protocols.
Moving Object Detection for Real-Time Applications
Authors: Lucia Maddalena, Alfredo Petrosino
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Detection of moving objects in video streams is the first relevant step of information extraction in many computer vision applications. Aside from the intrinsic usefulness of being able to segment video streams into moving and background components, detecting moving objects provides a focus of attention for recognition, classification, and activity analysis, making these later steps more efficient. We present some extensions to the method for moving object detection presented in [4]. Our main contributions are related to the pre-processing of intermediate results (transience maps), aimed at enhancing the accuracy of detection results, and to the parallelization of some of the most computationally intensive steps using SSE2 instructions, in order to enhance efficiency and allow for real-time applications.
SQLB: a query allocation framework for autonomous consumers and providers
Authors: J.-A. Quiané-Ruiz, Philippe Lamarre, Patrick Valduriez
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In large-scale distributed information systems, where participants are autonomous and have special interests for some queries, query allocation is a challenge. Much work in this context has focused on distributing queries among providers in a way that maximizes overall performance (typically throughput and response time). However, preserving the participants" interests is also important. In this paper, we make two main contributions. First, we provide a model to define participants' perception of the system w.r.t. their interests and propose metrics to evaluate the quality of query allocation methods. This model facilitates the design and evaluation of new query allocation methods that take into account the participants' interests. Second, we propose a framework for query allocation called Satisfaction-based Query Load Balancing (SQLB). To be fair, SQLB dynamically trades consumers' interests for providers' interests. And it continuously adapts to changes in participants' interests and to the workload. We implemented SQLB and compared it, through experimentation, to two important baseline query allocation methods, namely Capacity based and Mariposa-like. The results demonstrate that SQLB yields high efficiency while satisfying the participants' interests and significantly outperforms the baseline methods.
Global Contour Lines Reconstruction in Topographic Maps
Authors: J. Pouderoux, S. Spinello
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Topographic maps are a common support for geograph- ical information because they have the particularity to por- tray the relief through a set of contour lines. This to- pographic feature can be very useful in many context but the automatic extraction of this information is not an easy task, especially because the map contains many other lay- ers which overlay the contours. In this paper we propose an automatic approach to reconstruct gaps in contour lines. Our novel parameterless reconstruction scheme is based on the extrapolation of the gradient orientation field from the available pieces of thinned contours. A weight is then af- fected to each pair of end-points according the force needed by its potential reconstructed curve to cross the field. The computation of the optimal global solution is obtained by solving a perfect matching problem. We finally use the ori- entation flow to fill the gaps with a smooth curve that re- spects the tangents at the en-points.
Modelling and Simulating IPv6 Mobility
Authors: Xu Lei, Yong Soo Kim, Richard Lai
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Mobile Internet Protocol version 6 (IPv6) is a protocol enhancement that is designed to allow transparent routing of IPv6 packets to mobile nodes. Without specific support for mobility in IPv6, packets destined to a mobile node would not be able to reach it while the mobile node is away from its home link. Mobility support in IPv6 is particularly important, as mobile computers are likely to account for a majority or at least a substantial fraction of the population of the Internet during the lifetime of IPv6. This paper de- scribes a modelling of the IPv6 mobility using Estelle, an internationally standardised Formal Description Technique (FDT), and its simulation using the Estelle Development Toolset.
Scheduling for shared window joins over data streams
Authors: Moustafa A. Hammad, Michael J. Franklin, Walid G. Aref, Ahmed K. Elmagarmid
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Continuous Query (CQ) systems typically exploit commonality among query expressions to achieve improved efficiency through shared processing. Recently proposed CQ systems have introduced window specifications in order to support unbounded data streams. There has been, however, little investigation of sharing for windowed query operators. In this paper, we address the shared execution of windowed joins, a core operator for CQ systems. We show that the strategy used in systems to date has a previously unreported performance flaw that can negatively impact queries with relatively small windows. We then propose two new execution strategies for shared joins. We evaluate the alternatives using both analytical models and implementation in a DBMS. The results show that one strategy, called MQT, provides the best performance over a range of workload settings.
An integrated platform, implementing real, remote lab-experiments for electrical engineering courses
Authors: Dimitris Karadimas, Kostas Efstathiou
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Nowadays, the design of a remote, real instrumentation and measurement laboratory requires flexible hardware platforms. This paper describes an Internet-based laboratory, named Remote Monitored and Controlled Laboratory (RMCLab) developed at University of Patras, Greece, for electrical engineering experiments. The key feature of this remote laboratory is the utilization of real experiments, in terms of instrumentation and under-measurement circuits, rather than simulation or virtual reality environment. RMCLab's hardware infrastructure contains multiple reconfigurable sub-systems (FPGAs), which can be enhanced by almost any analog expansion module. The main characteristics of this system include the versatility of the hardware resources, due to the dynamic reconfiguration potentiality and the low cost of the hardware components. Moreover, this system enables its users to test, in real time, their own custom circuit designs. The paper concludes with a specific example regarding an elementary circuit in digital electronics and a short statistical review of the RMCLab educational usage. RMCLab can be accessed via the web through http://www.apel.ee.upatras.gr/rmclab.