ppxscal/embedding_network huggingface dataset:
Clock Free Data Streams Alignment for Sensor Networks
Authors: Guo-Liang Li, Chi-Sheng Shih
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

We develop a data alignment mechanism for sensor networks. The mechanism allows the sensor data streams to be aligned without real-time clocks or virtual clocks [1]. The developed mechanism makes use of the built-in counters on sensors and external synchronization signals to align data streams. The data server broadcasts out-of-channel synchronization signals with constant or variable intervals. The sensor data streams are aligned when received on the server. Only one way communication is used so as to reduce the communication overhead and clock synchronization overhead on sensors nodes. In addition, the developed mechanism is scalable thanks to one way communication. The synchronization error is bounded by the maximum sampling period of the sensors, and is independent of the number of the nodes in the network. Our analysis also shows the required awake time for sensors to tolerate different clock drifts and signal lost.
Web and Mobile Data Management
Authors: Xiaofeng Meng, Wei Liu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The rapid prevalence of Web and mobile devices are making themselves becoming huge data sources. This new infrastructure presents tremendous challenges for data management technology, and traditional data management technologies such as query processing, transaction management, workflow etc. must all be re-evaluated in this emerging environment. Furthermore, non-traditional issues, such as Web and mobile data management, must all be addressed. This paper aims to investigate this interesting issue, focusing on the challenges and opportunities for the technologies of Web and mobile data management.
On the marriage of Lp-norms and edit distance
Authors: Lei Chen, Raymond Ng
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot support local time shifting. The second category consists of distance functions which are capable of handling local time shifting but are nonmetric. The first contribution of this paper is the proposal of a new distance function, which we call ERP ("Edit distance with Real Penalty"). Representing a marriage of L1- norm and the edit distance, ERP can support local time shifting, and is a metric. The second contribution of the paper is the development of pruning strategies for large time series databases. Given that ERP is a metric, one way to prune is to apply the triangle inequality. Another way to prune is to develop a lower bound on the ERP distance. We propose such a lower bound, which has the nice computational property that it can be efficiently indexed with a standard B+- tree. Moreover, we show that these two ways of pruning can be used simultaneously for ERP distances. Specifically, the false positives obtained from the B+-tree can be further minimized by applying the triangle inequality. Based on extensive experimentation with existing benchmarks and techniques, we show that this combination delivers superb pruning power and search time performance, and dominates all existing strategies.
Common security management for CDMA2000 1x and 1x EV-DO networks
Authors: Andrew C. Clark, Karen E. Plonty
Venue: Bell Labs Technical Journal (2007)

The security of mobility voice networks has traditionally been ensured by deploying point-to-point circuit-switched transport between network elements and by isolating the voice infrastructure from the public data network. However, with the introduction of new services such as Voice over Internet Protocol (VoIP) and the trend toward IP transport between network elements, this approach is no longer adequate. To guarantee the security of IP-based voice and data networks, both human-to-machine and machine-to-machine interfaces must be secured using an approach that is consistent with industry best practices, and is robust and easy to manage. This paper describes a common infrastructure for managing network element security, encompassing both CDMA2000* 1x and CDMA2000 1x evolution data optimized (1x EV-DO) networks that contain hundreds of individual network elements. The architecture provides a common, centralized infrastructure for security management, including configuration management, data audits, logging, and key distribution. The networks are secured against both internal and external threats by addressing standard security dimensions such as authentication, privacy, non-repudiation, and access control. &copy; 2007 Alcatel-Lucent.
Systematic Multi-Path HMM Topology Design for Online Handwriting Recognition of East Asian Characters
Authors: Shi Han, Ming Chang, Yu Zou, Xinjian Chen, Dongmei Zhang
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper presents a systematic multi-path HMM topology design algorithm to better model online handwriting of East Asian characters. This data-driven algorithm solves three key problems in HMM topology design. First, HMM path number determination is formalized as a clustering problem using Subsequence Direction Histogram Vector (SDHV) as feature of both writing order and style. Second, Curvature Scale Space-based (CSS-based) substroke segmentation is used to calculate the optimal state number and initial state parameters. Third, Self-rotation restricted corner state and imaginary stroke state are designed to determine state connectivity and Gaussian mixture number in order to achieve better state alignment. Experiments on large character sets demonstrate both a significant relative error reduction rate and high recognition accuracy using the proposed algorithm.
An Effective Hybrid ADP-PSO Strategy for Optimization and Its Application to Face Recognition
Authors: Yongzhong Lu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In order to distinguish faces of various angles during face recognition, an algorithm of the combination of approximate dynamic programming (ADP) which is called action dependent heuristic dynamic programming (ADHDP) and particle swarm optimization (PSO) is presented and used, that is to say, ADP is applied for dynamically changing the values of the PSO parameters. During the process of face recognition, the discrete cosine transformation (DCT) is first introduced to reduce negative effects. Then K-L transformation can be used to compress images and decrease data dimensions. According to principal component analysis (PCA), main parts of vectors are extracted for data representation. Finally, radial basis function (RBF) neural network is enrolled to recognize various faces. The training of RBF neural network is exploited by ADP-PSO. In terms of ORL Face Database, the experimental result gives a clear view of its highly accurate efficiency.
A Multiple-Stream Registerless Shared-Resource Processor
Authors: E. F. Miller
Venue: IEEE Transactions on Computers (1974)

A novel high-performance processor architecture for processing a large number of independent instruction streams is proposed and its operating behavior studied. The proposed processor operates on instruction words in a two-address format (thereby eliminating the "operating registers"), and is organized in a fashion which permits as high degree of internal buffering and pipelining. The processor has the following properties: 1) The hardware cost grows only slightly more than linearly with the overall implementation cost; 2) The overall performance is primarily dependent on the processor wordtime and is only secondarily dependent on the supporting memory cycle time; 3) All instruction stream interfaces with memory occur at special queuing (buffer) units which are used to "unscramble" the instruction streams and continually provide work for subsequent processing elements.
Passive Steganalysis Using Image Quality Metrics and Multi-class Support Vector Machine
Authors: Bo Xu, Jiazhen Wang, Xiaqin Liu, Zhe Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this paper we propose a scheme using image quality metrics and multi-class support vector machine to identify steganographic domains. Firstly, we classify stegnographic domains into four, i.e. spatial domain, DCT domain, DWT domain and ICA domain. Then we analyze total 26 image quality measures summarized by Ismail Avcibas and choose eight sensitive features based on the Analysis of Variance technique as feature set to distinguish between cover-images and stego-images which are marked in the four domains respectively. The features' scores are computed between the original images and their Gaussian filtered versions. The classifier between cover and stego-images is built using multi-class Support Vector Machine on the selected feature set. The presented method can not only detect the presence of hidden message but also identify the hiding domains. The experiment results show the proposed scheme achieves good classification results and improves its performance with larger embedded message length.
Evolving Quantum Circuits for Temporal Averaging in Bulk Quantum Computation
Authors: Shengchao Ding, Zhi Jin, Qing Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Temporal averaging preparation permutes all the computational basis except the first one. The problem of synthesizing quantum circuits for the preparations is expressed as a constraint integer optimization problem avoiding enormous matrix multiplications. An approach with standard genetic algorithm is also proposed. Two genome representations are presented and a fitness function is investigated. Extensive experiments show that the approach performs very well and the evolved quantum circuits are better than those provided by another literature.
On the design of interfaces to sparse direct solvers
Authors: Marzio Sala, Kendall S. Stanley, Michael A. Heroux
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We discuss the design of general, flexible, consistent, reusable, and efficient interfaces to software libraries for the direct solution of systems of linear equations on both serial and distributed memory architectures. We introduce a set of abstract classes to access the linear system matrix elements and their distribution, access vector elements, and control the solution of the linear system. We describe a concrete implementation of the proposed interfaces, and report examples of applications and numerical results showing that the overhead induced by the object-oriented design is negligible under typical conditions of usage. We include examples of applications, and we comment on the advantages and limitations of the design.
Cultivating Operating System Process Concept with Card Game
Authors: Wen-Chih Chang, Yi-Lung Chen
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Game can be one of the educational tools. With the interactivity and competition, learners will have high motivation to play games. In order to express some abstract concept like operation system process, we designed a card game which subject is operation system process diagram. It is too hard to realize the real process lifecycle. For some students, it is uneasy to find solid examples about operating system. We hope game launch high learning motivation and interaction in operating system. Learners can experience some experience in operation system process lifecycle.
A Design Philosophy for Microcomputer Architectures
Authors: D. R. Allison
Venue: Computer (1977)

Microcomputers, as a class of programmable machines, are rather uncomfortable and difficult to program, and are even more unpleasant as the target machines for programming languages. This need not be so.
Foreign Superkeys and Constant References
Authors: Jon Heggland
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

A foreign superkey in relational database theory is a set of attributes referring to a superkey of some relation variable. In this paper, the notion of constant references is introduced: foreign superkeys with constant elements, which lead to simplified constraint formulation and integrity enforcement when implementing entity subclassing in relational databases.
Measuring the emotional impact of websites: a study on combining a dimensional and discrete emotion approach in measuring visual appeal of university websites
Authors: Kevin Capota, Marco van Hout, Thea van der Geest
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

In this paper a combined dimensional and discrete emotional approach is introduced for measuring emotions elicited by the visual appeal of websites. An online experiment was set out to measure the emotional experience of twelve screenshots of university websites. By indicating a position on the dimensions of pleasure and arousal, participants were asked to score corresponding emotion words that would relate to their position on the dimensions, plus random emotion words that were not related to their position. It was expected that scores on the corresponding emotion words would be higher than scores on the random emotion words. As expected, results showed that corresponding emotion words scored significantly higher, indicating that a combined dimensional and discrete emotion approach was feasible in measuring emotional experience elicited by visual appeal of websites.
A filled function method for constrained global optimization
Authors: Z. Y. Wu, F. S. Bai, H. W. Lee, Y. J. Yang
Venue: Journal of Global Optimization (2007)

In this paper, a filled function method for solving constrained global optimization problems is proposed. A filled function is proposed for escaping the current local minimizer of a constrained global optimization problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Then a filled function method for obtaining a global minimizer or an approximate global minimizer of the constrained global optimization problem is presented. Some numerical results demonstrate the efficiency of this global optimization method for solving constrained global optimization problems.
SmartCoast: A Wireless Sensor Network for Water Quality Monitoring
Authors: B O'Flynn, Rafael Martinez-Catala, S. Harte, C. O'Mathuna, John Cleary, C. Slater, F. Regan, D. Diamond, Heather Murphy
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The implementation of the Water Framework Directive (WFD) across the EU, and the growing international emphasis on the management of water quality is giving rise to an expanding market for novel, miniaturized, intelligent monitoring systems for freshwater catchments, transitional and coastal waters. This paper describes the "SmartCoast" Multi Sensor System for water quality monitoring. This system is aimed at providing a platform capable of meeting the monitoring requirements of the Water Framework Directive. The key parameters under investigation include temperature, phosphate, dissolved oxygen, conductivity, pH, turbidity and water level. The "Plug and Play" capabilities enabled by the Wireless Sensor Network (WSN) platform developed at Tyndall allow for integration of sensors as required are described, as well as the custom sensors under development within the project.
Patrick Blackett: Physicist, Radical, and Chief Architect of the Manchester Computing Phenomenon
Authors: David Anderson
Venue: IEEE Annals of the History of Computing (2007)

The dominant discourse in the history of computing holds that the world's first stored-program digital electronic computer--the Manchester "Baby"--was developed under the sole leadership and direction of the Department of Electro-Technics. This biography, which arises out of a detailed re-examination of the historical evidence, suggests that the physicist P.M.S. Blackett was much more influential in the genesis, enabling, staffing, and funding of the project than has previously been recognized.
Opportunistic Encryption: A Trade-Off between Security and Throughput in Wireless Networks
Authors: Mohamed A. Haleem, Chetan N. Mathur, R. Chandramouli, K. P. Subbalakshmi
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

Wireless network security based on encryption is widely prevalent at this time. However, encryption techniques do not take into account wireless network characteristics such as random bit errors and fading. For example, we note that properties such as the avalanche effect that make a block cipher secure also cause them to be sensitive to bit errors. Therefore, there is a fundamental trade-off between security and throughput in encryption based wireless security. Further, if there is an adversary with a certain attack strength present in the wireless network, we see an additional twist to the security-throughput trade-off issue. In this paper, we proposed a framework called opportunistic encryption that uses channel opportunities (acceptable signal to noise ratio) to maximize the throughput subject to desired security constraints. To illustrate this framework and compare it with some current approaches this paper presents the following: (a) mathematical models to capture the secuity-throughput trade-off; (b) adversary models and their effects; (c) joint encryption and modulation (single and multi-rate) optimization; (d) the use of forward error correcting (FEC) codes to protect encrypted packets from bit errors; and (e) simulation results for Rijndael cipher. We observe that opportunistic encryption produces signficant improvement in the performance compared to traditional approaches.
The Architecture and Applications of the Apollo Domain
Authors: David Nelson, Paul Leach
Venue: IEEE Computer Graphics and Applications (1984)

The Domain system's objective is to integrate mainframe capability with local area networking and raster graphics capabilities at a cost appropriate to engineering and graphics applications.
Remote sensing image matching based on corner structures
Authors: Hongya Tuo, Zhongliang Jing, Yuncai Liu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we propose a matching method for remote sensing images based on corner structures. Firstly corner angle vector is defined to analysis corner structure, and the process of how to obtain it is discussed in detail. Then some measures are given to eliminate the false corners. Finally a relaxation matching scheme is presented. The experiments show the effectiveness and feasibility of our matching method.
Efficient Spare Allocation for Reconfigurable Arrays
Authors: Sy-yen Kuo, W. Fuchs
Venue: IEEE Design Test (1987)

Yield degradation from physical failures in large memories and processor arrays is of significant concern to semiconductormanufacturers. One method of increasing the yield for iterated arrays of memory cells or processing elements is to incorporatespare rows and columns in the die or wafer. These spare rows and columns can then be programmed into the array. The authorsdiscuss the use of CAD approaches to reconfigure such arrays. The complexity of optimal reconfiguration is shown to be NP-complete.The authors present two algorithms for spare allocation that are based on graph-theoretic analysis. The first uses a branch-and-boundapproach with early screening based on bipartite graph matching. The second is an efficient polynomial time-approximationalgorithm. In contrast to existing greedy and exhaustive search algorithms, these algorithms provide highly efficient andflexible reconfiguration analysis.
Hydraulic Splines: A Hybrid Approach to Modeling River Channel Geometries
Authors: Maik Flanagin, Aurelien Grenotton, Jay Ratcliff, Kevin B. Shaw, John Sample, Mahdi Abdelguerfi
Venue: Computing in Science and Engineering (2007)

The hydraulic spline algorithm generates irregular 2D channel grids from highly accurate cross-sectional survey data at any desired resolution, facilitating its integration with high-density light detection and ranging (lidar) data.
Some Properties Derived from Structural Analysis of Program Graph Models
Authors: R. M. Negrini
Venue: IEEE Transactions on Software Engineering (1983)

It is considered interesting to identify, from the structure of control flow and of relationships among variables in a program, some properties allowing to point out possible sources of errors or of faulty behavior. In particular, it is found that information about termination of loops and about meaningfulness of acceptance tests in recopery block strategy can be extracted from such structural analysis. Criteria for applying this analysis to programs with arbitrary structures are presented.
Solutions of the fractional differential equations with constant coefficients
Authors: Chunhai Kou, Xiuyun Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper some of fractional differential equations with constant coefficients are treated by means of N-fractional calculus. By applying some similar arguments to the theory of ordinary differential equations, we establish a direct approach to obtain solutions for some linear homogeneous fractional differential equations.
Adaptive Load Management over Real-Time Data Streams
Authors: Xin Li, Li Ma, Kun Li, Kun Wang, Hong-An Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Streaming applications require long-running query services against data streams. Existing data stream management systems (DSMSs) are poor at processing long-running queries with timing constrains. To address this problem, we present a real-time DSMS which can support real-time query services in unpredictable environments. In this system, long- running queries over data streams are divided into two classes: periodic and continuous queries. A mixed query model is introduced to characterize these two kinds of real-time queries. Furthermore, an Adaptive Load Management (ALM) strategy based on dynamic execution time prediction is proposed to distribute processor time among all query instances. The objective of the ALM strategy is to provide certain guarantee on the deadline miss ratio of periodic queries and reduce the one of continuous queries, meanwhile maximizing overall query quality. A series of experiments confirm that the ALM strategy is effective in improving query quality and managing workload fluctuations.