ppxscal/embedding_network huggingface dataset:
Single Hf atoms inside the ultrathin SiO2 interlayer between a HfO2 dielectric film and the Si substrate: how do they modify the interface?
Authors: S. N. Rashkeev, K. van Benthem, S. T. Pantelides, S. J. Pennycook
Venue: Microelectronic Engineering (2005)

We show that individual Hf atoms may get incorporated into the SiO2 interlayer which is formed between the HfO2 dielectric film and the Si substrate during rapid thermal annealing. We report atomically-resolved Z-contrast images of a Si/SiO2/HfO2 structure together with first-principles calculations which demonstrate that single Hf atoms are in fact present in the interlayer. The location of individual Hf atoms within the interlayer oxide is closely related to the structure of the amorphous oxide near the Si/SiO2 interface. The Hf defects may affect channel mobility and leakage currents in the HfO2/Si electronic devices.
Parallel Telemetric Data Warehouse Balancing Algorithm
Authors: Marcin Gorawski, Robert Chechelski
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

One of the most important requirements of data warehouses is query response time. Amongst all methods of improving query performance, parallel processing (especially in shared nothing class) is one of the giving practically unlimited system's scaling possibility. The key problem in a parallel data warehouses is data allocation between system nodes. The problem is growing when nodes have different computational characteristics. In this paper we present an algorithm of balancing parallel data warehouse built on mentioned architecture. Balancing is realized by setting dataset size stored in each node. We exploited some well known data allocation schemas using space filling curves: Hilbert and Peano. Our conception is verified by a set of tests and its analysis.
Framework for personalized multimedia summarization
Authors: Lalitha Agnihotri, John Kender, Nevenka Dimitrova, John Zimmerman
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

We extend and validate methods of personalization to the domain of automatically created multimedia summaries. Based on a previously performed user study of 59 people we derived a mapping of personality profile information to preferred multimedia features. This article describes our summarization algorithm. We define constraints for automatic summary generation. Summaries should consist of contiguous segments of full shots, with duration proportional to the log of video length, selected by an objective function of total "importance" of features, with heuristic rules for deciding the "best" combination of length and importance. We validated the summaries with a user study of 32 people. They were asked to answer a shortened series of personality queries. Using this current user profile, together with the earlier genre-specific reduced mapping and with automatically derived features, we automatically generated two summaries for each video: one optimally matched, and one matched to the "opposite" personality. Each user evaluated both summaries on a preference scale for four each of: news, talk show, and music videos. From a statistical analysis we find statistically significant evidence of the effectiveness of personalization on news and music videos, with no evidence of user subpopulations. We conclude for these genres that our claim, of a universal mapping from certain measured personality traits to the computable creation of preferred multimedia summaries, is supported.
CAFE - Collaborative Agents for Filtering E-mails
Authors: Lorenzo Lazzari, Marco Mari, Agostino Poggi
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

CAFE (Collaborative Agents for Filtering E-mails) is a multi-agent system to collaboratively filter spam from users' mail stream. CAFE associates a proxy agent with each user, and this agent represents a sort of interface between the user's e-mail client (i.e. Microsoft Outlook, Eudora, etc.) and the e-mail server. With the support of other types of agents, the proxy agent makes a classification of new messages into three categories: ham (good messages), spam and spam-presumed. The system analyzes every single email using essentially three kinds of approach: a first approach based on the usage of an hash function, a static approach using DNSBL (DNS-based Black Lists) databases and a dynamic approach based on a Bayesian algorithm.
Research on Chinese Ellipsis Recovering Based on Discourse Representation Theory
Authors: Shaozi Li, Wang Li, Changle Zhou
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

This paper presents our recent research work on Chinese ellipsis recovering based on discourse representation theory (DRT). From various perspectives, our work focuses on how to construct the Chinese DRT and the semantic model. Then it proposes an ellipsis recovering model based on discourse, which selects the most suitable one and fill in the syntactic ellipsis and possible semantic ellipsis. The simulated results show some advantages of the proposed approach based on DRT and potential applications in Chinese oral system and discourse machine understanding.
A Threshlod Selection Method Based on Multiscale and Graylevel Co-occurrence Matrix Analysis
Authors: Yun Li, Ching Y. Suen, Mohamed Cheriet
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Noises and complex backgrounds often make the thresholding of degraded document images a difficult job. In this paper, we propose a new threshold selection method to handle severely degraded document images. First, multiscale image description is adopted to analyze the image edge. From it, edge pixel pair information is derived and recorded by a graylevel co-occurrence matrix. An appropriate threshold value is chosen by measuring the edge pixel pair co-occurrence matrix. The new method is tested with degraded document images. The experimental results show it is resistant to noises and complex backgrounds.
A Low Power Soft Error Suppression Technique for Dynamic Logic
Authors: Jeetendra Kumar, Mehdi B. Tahoori
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

As the device sizes are shrinking, the next generation combinational logic will also become equally susceptible to soft errors as the memory elements. In this paper, we propose a novel technique to minimize the impact of soft errors in domino logic by using complementary pass transistor devices and additional weak keeper to selectively isolate the logic gates struck by single event upsets (SEUs). Experimental analysis shows that this technique achieves soft error suppression with no extra power consumption and modest area (2.6%) and delay (13.6%) overhead.
Rf-to-text transcription without prior knowledge of modulation format, channel- or source-coding
Authors: Jeffrey Robert Johnson
Venue:  (2005)

Documented prior investigations in signal classification for non-cooperative communications have focused on modulation recognition. Modulation assigns message-bearing symbols to waveforms selected for near optimal propagation through a given radio frequency communications channel. Waveform design for modern data communications systems augments modulation with coding, compression, and interleaving. So, communications protocols number in the thousands. Under conventional design methodologies each protocol requires a unique receiver structure or a signal classifier which can configure a programmable demodulator and/or decoder for one of a number previously anticipated signals types. Our investigation revealed that for each known human language, a single schema can be used to recover text messages from all members of the class of unencrypted proforma signals without regard to the specific method for synthesizing those signals. Channel and error control coding; data compression; and encryption are remappings of a M-ary symbol set to achieve three different sets of goals. Channel coding remaps a sequence of bits to a sequence of waveform primitives that fulfills certain synchronization and spectral occupancy requirements; error control coding augments a bit sequence with redundant bits that are also transmitted through the communications channel and are used at the receiver to detect and correct transmission errors. Data compression replaces a symbol sequence sufficient to carry a certain message with an equivalent, strictly necessary sequence. Encryption may operate on the M-ary symbols or their component bits. In either case, components of a message are resequenced or interleaved so that message content can not be inferred either from the symbols transmitted or their statistics. In the receiver developed in this investigation, digitized samples from the analog communications channel are collected into frames corresponding to single K-bit symbol segments. We assume the message is in a known human language. These symbol segments are labeled arbitrarily on the basis of their order of appearance in a given message, then the sequence of labels is de-interleaved and statistically analyzed on an iterative basis until a measure of language structure is satisfied. At this point, the co-occurrence statistics of the groups of arbitrarily labeled symbol segments are associated with text symbol groups in the assumed language. The symbol labeling process is based on finding waveform critical points in the presence of broadband random noise and so is independent of source coding, error-control coding, channel coding, and modulation type.
FI-RED: AQM Mechanism for Improving Fairness among TCP Connections in Tandem Networks
Authors: Hiroyuki Ohsaki, Tomoya Eguchi, Masayuki Murata
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

In this paper, we focus on a tandem network, and design an AQMmechanism called FI-RED (Fairness Improvement for RED) for improving the fairness among heterogeneous TCP connections. In FI-RED, ECN (Explicit Congestion Notification) mechanism is used for differentiating the packet marking probability of RED according to the CE (Congestion Experienced) bit of arriving packets. Namely, FI-RED suppresses congestion indication to TCP connections with a large number of hops (i.e., connections with a high probability that the CE bit is marked). With such a simple modification to the original RED, a TCP connection with a large number of hops suffers almost the same packet marking probability as one with a small number of hops. Therefore, it is expected that FI-RED improves fairness among TCP connections with different numbers of hops; i.e., bias against the number of hops. We analyze the steady state behavior of FI-RED and perform simulation experiments in several network configurations. We quantitatively show that the fairness among TCP connections is significantly improved compared with RED.
A reflective middleware for controlling smart objects from mobile devices
Authors: Diego López de Ipiña, Iñaki Vázquez, Daniel García, Javier Fernández, Iván García
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Mobile devices are mainly used for communication, entertainment, and as electronic assistants. However, their increasing computational, storage, communicational and multimedia capabilities make them suitable for previously unexpected scenarios such as Ambient Intelligence (AmI). Thus, mobile devices may be used as intermediaries between us and the smart objects (everyday objects augmented with computational services) in our surroundings. This paper describes the design and implementation of a middleware to transform mobile devices into universal remote controllers of smart objects.
Integrated support for handoff management and context awareness in heterogeneous wireless networks
Authors: Paolo Bellavista, Marcello Cinque, Domenico Cotroneo, Luca Foschini
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

The overwhelming success of mobile devices and wireless communications is stressing the need for the development of mobility-aware services. Device mobility requires services adapting their behavior to sudden context changes and being aware of handoffs, which introduce unpredictable delays and intermittent discontinuities. Heterogeneity of wireless technologies (Wi-Fi, Bluetooth, 3G) complicates the situation, since a different treatment of context-awareness and handoffs is required for each solution. This paper presents a middleware architecture designed to ease mobility-aware service development. The architecture hides technology-specific mechanisms and offers a set of facilities for context awareness and handoff management. The architecture prototype works with Bluetooth and Wi-Fi, which today represent two of the most widespread wireless technologies. In addition, the paper discusses motivations and design details in the challenging context of mobile multimedia streaming applications.
Image models for wavelet domain statistics
Authors: Seyedeh-Zohreh Azimifar
Venue:  (2005)

Statistical models for the joint statistics of image pixels are of central importance in many image processing applications. However the high dimensionality stemming from large problem size and the long-range spatial interactions make statistical image modeling particularly challenging. Commonly this modeling is simplified by a change of basis, mostly using a wavelet transform. Indeed, the wavelet transform has widely been used as an approximate whitener of statistical time series. It has, however, long been recognized that the wavelet coefficients are neither Gaussian, in terms of the marginal statistics, nor white, in terms of the joint statistics. The question of wavelet joint models is complicated and admits for possibilities, with statistical structures within subbands, across orientations, and scales. Although a variety of joint models have been proposed and tested, few models appear to be directly based on empirical studies of wavelet coefficient cross-statistics. Rather; they are based on intuitive or heuristic notions of wavelet neighborhood structures. Without an examination of the underlying statistics, such heuristic approaches necessarily leave unanswered questions of neighborhood sufficiency and necessity. This thesis presents an empirical study of joint wavelet statistics for textures and other imagery including dependencies across scale, space, and orientation. There is a growing realization that modeling wavelet coefficients as independent, or at best correlated only across scales, may be a poor assumption. While recent developments in wavelet-domain Hidden Markov Models (notably HMT-3S) account for within-scale dependencies, we find that wavelet spatial statistics are strongly orientation dependent, structures which are surprisingly not considered by state-of-the-art wavelet modeling techniques. To demonstrate the effectiveness of the studied wavelet correlation models a novel non-linear correlated empirical Bayesian shrinkage algorithm based on the wavelet joint statistics is proposed. In comparison with popular nonlinear shrinkage algorithms; it improves the denoising results.
Weighted bootstrap method for fuzzy data
Authors: Wen-Liang Hung
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

The weighted bootstrap contained in the monograph by Barbe and Bertail in Lecture Notes in Statist, Springer (1995) is a simple and straight-forward method for calculating approximated biases, standard deviations, confidence intervals, and so forth, in almost any nonparametric estimation problem. In this paper, we consider another example, namely, fuzzy data, and use the weighted bootstrap to answer several questions concerning the minimum inaccuracy estimator (Corral and Gil in Stochastica 8:63&#x2013;81, 1984): (a) What is the standard error of this estimator? (b) What is a reasonable confidence interval for such a estimate? The validity of weighted bootstrap method is investigated using a real data and computer simulation.
"Lazy Susan" Communication System for Remote, Spatial and Physical Collaborative Works
Authors: Shigeru WESUGI, Yoshiyuki MIWA
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

Various communication systems in shared space technology have been proposed to support remote spatial collaborative works with physical objects. The authors have focused on sharing bodily interactions with physical objects between remote places, and have developed "Lazy Susan" communication systems. We have applied our unique communication system to support remote collaborative works and proved that our communication system is useful to change spatial and positional relation between a remote physical object and local self. Moreover, in order to exploit the feature of "Lazy Susan" communication system, we have proposed three modes; Rotation, Magnifying and Personal mode, and implement visual tag interface as additional functions for a collaborative work. We discussed also uniqueness of our system in comparison to conventional communication systems and indicated its possibility.
Performance Tradeoff with Adaptive Frame Length and Modulation in Wireless Network
Authors: Yafei Hou, Masanori Hamamura, Shiyong Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, we present the results of analysis which shows that there is much to be gained from variable frame length, different modulations in terms of goodput, range and energy consumption for wireless channel. Using those results, then we obtain three useful rules for the tradeoff with goodput, range and energy consumption with different modulations.
Honeywell 600/6000 simulator
Authors: Jackson D. Harper, Robert L. James
Venue: ACM SIGSIM Simulation Digest (1973)

The use of simulation to solve problems related to the Honeywell G-635 computers of the Air Force Data Services Center (AFDSC) at the Pentagon was contemplated many months prior to the 1970 hardware installation. In the summer of 1969 we began to lay down the criteria for such a simulator. It would be used for general system enhancement and would have a moderate level of detail.
Kernel-Density-Based Clustering of Time Series Subsequences Using a Continuous Random-Walk Noise Model
Authors: Anne Denton
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Noise levels in time series subsequence data are typically very high, and properties of the noise differ from those of white noise. The proposed algorithm incorporates a continuous random-walk noise model into kernel-density-based clustering. Evaluation is done by testing to what extent the resulting clusters are predictive of the process that generated the time series. It is shown that the new algorithm not only outperforms partitioning techniques that lead to trivial and unsatisfactory results under the given quality measure, but also improves upon other density-based algorithms. The results suggest that the noise elimination properties of kernel-density-based clustering algorithms can be of significant value for the use of clustering in preprocessing of data.
On the Size and Generation of Minimal N-Detection Tests
Authors: Kalyana R. Kantipudi
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N times the minimal test set size for N = 1. Tests with N > 1 have been reported to have a higher defect coverage and hence are of practical interest. We give an integer linear programming (ILP) algorithm for optimally minimizing a given test set for any given N; in general, the value of N can be separately specified for each fault. Results on benchmark circuits show that optimal N-detection tests are easier to find for circuits that are deep and the input cones of primary outputs have large overlap. However, for small depth circuits, where the primary input overlap between output cones is small or nonexistent, the minimization of the N-detection tests requires further investigation.
An Application Gateway to Deploy High-quality Video Communications in Various Network Environments
Authors: Takashi Kishida, Kaori Maeda, Eitaro Kohno, Yoshiaki Kakuda
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

Video communication is being popular by spreading broadband networks. Realization of this kind of communications is important to deploy IPv6. However, many almost of commercial videoconference systems do not work in IPv6 networks. We developed an application gateway called as "PTGATE" to extend available scenes of videoconferences. PTGATE has three functions: IPv4 over IPv6 tunneling to use videoconference systems for IPv4, multicast tunneling over unicast networks, and error recovery using FEC. By using PTGATE, the current resources of videoconferences correspond to various network environments. In this paper, we describe the overview of PTGATE and its evaluation. Also, we show practical experiments of PTGATE using actual networks.
Jacobian---Free Newton---Krylov Methods for the Accurate Time Integration of Stiff Wave Systems
Authors: D. A. Knoll, V. A. Mousseau, L. Chacón, J. Reisner
Venue: Journal of Scientific Computing (2005)

Stiff wave systems are systems which exhibit a slow dynamical time scale while possessing fast wave phenomena. The physical effects of this fast wave may be important to the system, but resolving the fast time scale may not be required. When simulating such phenomena one would like to use time steps on the order of the dynamical scale for time integration. Historically, Semi-Implicit (SI) methods have been developed to step over the stiff wave time scale in a stable fashion. However, SI methods require some linearization and time splitting, and both of these can produce additional time integration errors. In this paper, the concept of using SI methods as preconditioners to Jacobian---Free Newton---Krylov (JFNK) methods is developed. This algorithmic approach results in an implicitly balanced method (no linearization or time splitting). In this paper, we provide an overview of SI methods in a variety of applications, and a brief background on JFNK methods. We will present details of our new algorithmic approach. Finally, we provide an overview of results coming from problems in geophysical fluid dynamics (GFD) and magnetohydrodynamics (MHD).
A Secure User Authentication Method in Networked Intelligent Manufacturing Systems
Authors: Yuseung Sohn, Misung Cho, Giwon On, Kijoon Chae
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper, we propose a secure user authentication method for a networked manufacturing system, which is a system framework of computer-aided solutions to support the manufacturing industry, in particular the automobile and shipbuilding sector. The proposed authentication method called as CRI-TMT is based on a Challenge-Response Identification scheme using a Time-variant Mapping Table. The proposed CRITMT can prevent a user's secret from key-log or over-theshoulder attack. Also a user's secret data is not stored on the verifier's side. Thus, a user's secret data is not disclosed even though attackers break into the authentication server. Through an analytical study, we show that the gain of the attackers who have users secret-related data by observing the verification step is not bigger than that of the blind attackers without any user's secret data. We also show the feasibility and practicality of the CRI-TMT system by a fast implementation.