ppxscal/embedding_network huggingface dataset:
Continuous subspace clustering in streaming time series
Authors: Maria Kontaki, Apostolos N. Papadopoulos, Yannis Manolopoulos
Venue: Information Systems (2008)

Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clustering streaming time series, based on the sliding window paradigm. More specifically, we use the concept of subspace @a-clusters. A subspace @a-cluster consists of a set of streams, whose value difference is less than @a in a consecutive number of time instances (dimensions). The clusters can be continuously and incrementally updated as the streaming time series evolve with time. The proposed technique is based on a careful examination of pair-wise stream similarities for a subset of dimensions and then it is generalized for more streams per cluster. Additionally, we extend our technique in order to find maximal pClusters in consecutive dimensions that have been used in previously proposed clustering methods. Performance evaluation results, based on real-life and synthetic data sets, show that the proposed method is more efficient than existing techniques. Moreover, it is shown that the proposed pruning criteria are very important for search space reduction, and that the cost of incremental cluster monitoring is more computationally efficient that the re-clustering process.
Incorporating feature hierarchy and boosting to achieve more effective classifier training and concept-oriented video summarization and skimming
Authors: Hangzai Luo, Yuli Gao, Xiangyang Xue, Jinye Peng, Jianping Fan
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

For online medical education purposes, we have developed a novel scheme to incorporate the results of semantic video classification to select the most representative video shots for generating concept-oriented summarization and skimming of surgery education videos. First, salient objects are used as the video patterns for feature extraction to achieve a good representation of the intermediate video semantics. The salient objects are defined as the salient video compounds that can be used to characterize the most significant perceptual properties of the corresponding real world physical objects in a video, and thus the appearances of such salient objects can be used to predict the appearances of the relevant semantic video concepts in a specific video domain. Second, a novel multi-modal boosting algorithm is developed to achieve more reliable video classifier training by incorporating feature hierarchy and boosting to dramatically reduce both the training cost and the size of training samples, thus it can significantly speed up SVM (support vector machine) classifier training. In addition, the unlabeled samples are integrated to reduce the human efforts on labeling large amount of training samples. Finally, the results of semantic video classification are incorporated to enable concept-oriented video summarization and skimming. Experimental results in a specific domain of surgery education videos are provided.
Adaptive Reputation-Based Scheduling on Unreliable Distributed Infrastructures
Authors: Jason Sonnek, Abhishek Chandra, Jon Weissman
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

This paper addresses the inherent unreliability and instability of worker nodes in large-scale donationbased distributed infrastructures such as P2P and Grid systems. We present adaptive scheduling techniques that can mitigate this uncertainty and significantly outperform current approaches. In this work, we consider nodes that execute tasks via donated computational resources and may behave erratically or maliciously. We present a model in which reliability is not a binary property but a statistical one based on a node’s prior performance and behavior. We use this model to construct several reputationbased scheduling algorithms that employ estimated reliability ratings of worker nodes for efficient task allocation. Our scheduling algorithms are designed to adapt to changing system conditions as well as non-stationary node reliability. Through simulation we demonstrate that our algorithms can significantly improve throughput, while maintaining a very high success rate of task completion. Our results suggest that reputation-based scheduling can handle wide variety of worker populations, including non-stationary behavior, with overhead that scales well with system size. We also show that our adaptation mechanism allows the application designer fine-grain control over desired performance metrics.
Integrated vendor-buyer inventory system with sublot sampling inspection policy and controllable lead time
Authors: Kun-Shan Wu, Liang-Yuh Ouyang, Chia-Huei Ho
Venue: International Journal of Systems Science (2007)

This article investigates the impact of inspection policy and lead time reduction on an integrated vendor-buyer inventory system. We assume that an arriving order contains some defective items. The buyer adopts a sublot sampled inspection policy to inspect selected items. The number of defective items in the sublot sampling is a random variable. The buyer's lead time is assumed reducible by adding crash cost. Two integrated inventory models with backorders and lost sales are derived. We first assume that the lead time demand follows a normal distribution, and then relax the assumption about the lead time demand distribution function and apply the minimax distribution-free procedure to solve the problem. Consequently, the order quantity, reorder point, lead time and the number of shipments per lot from the vendor to the buyer are decision variables. Iterative procedures are developed to obtain the optimal strategy.
Energy-efficient middleware-layer multi-radio networking: An assessment in the area of service discovery
Authors: Damien Charlet, Valérie Issarny, Rafik Chibout
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The massive deployment of mobile networks together with the emergence of powerful portable devices has given rise to pervasive computing environments. In such environments, mobile users may discover and access services offered in surrounding networks using Service Discovery Protocols (SDPs). However, several SDPs are currently in use, each one designed for a specific target network architecture and setting. As a result, in today's multi-radio networking environment, SDPs do not equally suit each radio interface. In order to provide effective service discovery in multi-radio networks, the most resource-efficient radio interface should be chosen with respect to two main criteria: the adequacy of the interface against the SDP to be used, and energy saving, which is crucial for battery-powered devices. Toward this goal, this article assesses how to effectively take advantage of the multiple radio interfaces now embedded within wireless devices with respect to energy consumption, from the standpoint of service discovery and access. It further investigates the adequacy of legacy SDPs with the various networks, so as to classify the most appropriate networks for each SDP. Exploitation of these results is finally investigated with the description of an energy-efficient algorithm for SDP-based context sensing in a multi-radio pervasive environment.
Understanding and preventing network device fingerprinting
Authors: Lloyd G. Greenwald, Tavaris J. Thomas
Venue: Bell Labs Technical Journal (2007)

Internet Protocol (IP)-based devices disclose information about themselves through responses to common and carefully crafted IP packets. Attackers can discover security vulnerabilities by using open source tools to fingerprint devices remotely by eliciting and analyzing these responses. The current approach to IP-based security tries to solve this problem by interposing defensive devices such as firewalls and network scrubbers between attacker and targets. These devices block and&#x002F;or modify the responses of target machines, potentially defeating remote fingerprinting attempts. In this work, we present a method for assessing the value of security configurations and provide insights toward the development of a security solution that prevents remote fingerprinting. Our method uses information gain to measure the discriminative power of fingerprinting tools. We use this measure to provide an analytical evaluation of existing open source fingerprinting tools and present an empirical evaluation of the robustness of specific defensive device configurations to defeating the most discriminative tools. &copy; 2007 Alcatel-Lucent.
Stepwise probabilistic buffering for epidemic information dissemination
Authors: Emrah Ahi, Mine Çaǧlar, Öznur Özkasap
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

For large-scale peer-to-peer applications, bio-inspired epidemic protocols have considerable advantages as they are robust against network failures, scalable and provide probabilistic reliability guarantees. While providing reliability, a key issue to consider is the usage of system wide buffer space. In this context, we introduce a novel scheme called stepwise probabilistic buffering that reduces the amount of buffering and distributes the load of buffering to the entire system where every peer does not have the complete view of the system. We compute the performance measures through simulations of large-scale application scenarios.
A Survey of Developments in Distributed Data Base Management Systems
Authors: F. J. Maryanski
Venue: Computer (1978)

Distributed data base management systems extend the capacities of computing systems to give many people access to a wide range of information. These systems, which arise from the combination of recent important advances in computer networks with general-purpose data base management systems, should shortly represent another significant step in commercial system development. So it is not surprising that they have been the focus of much research and development activity in both the academic and industrial environments.
Impact of the LSI on High-Speed Computer Packaging
Authors: T. Chiba
Venue: IEEE Transactions on Computers (1978)

The effect of the logic LSI on high-speed computer packaging and relevant problems are described from the standpoint of obtaining effective logic speed and packaging density in system environments.
Modelling the frying of a non-deformable specimen by immersion in edible oil
Authors: A. Fasano, A. Mancini
Venue: Computers Mathematics with Applications (2008)

We present a non-trivial generalization of the one-dimensional model proposed in [A. Fasano, A. Mancini, A mathematical model for a class of frying processes, Comput. Math. Appl. (2007) (doi:10.1016/j.camwa.2006.02.046) (in press)] with several purposes. The first goal is to consider a multidimensional case (so that, for instance, the model can be applicable to French fries). We want also to provide a more realistic description of the mechanism of transport of liquid water within the sample, considering the effect of capillarity.
B74-14 Data Base Systems
Authors: E. C. Joseph
Venue: IEEE Transactions on Computers (1974)

This excellent book is the sixth in a series of volumes stemming from symposia in areas of current interest in computer science by the Courant Institute of Mathematical Sciences of New York University.
Global Stability of A Tuberculosis Model with Vertical Transmission
Authors: Chun Ma, Fengqin Zhang, Zhen Jin
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper considers an SEIT epidemic model that incorporates proportion recruitment and with vertical transmission. By means of Lyapunov function and LaSalle's invariant set theorem, we proved the global asymptotical stable results of the disease-free equilibrium and the endemic equilibrium with the help of numerical simulations.
Skeletonization by Gradient Regularization and Diffusion
Authors: F. LeBourgeois, H. Emptoz
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper describes a skeletonization process for grayscale or color images based on the diffusion of the color gradient vectors by using a simple iterative regularization scheme. We propose to diffuse the original color gradient vectors to obtain the skeleton of the main contrasted objects. Contrary to a distance transform or thinning based skeleton, the gradient vectors diffusion is a straightforward, simple and efficient approach to compute the skeleton, which does not require the localization of the contours curvatures or a distance map. In comparison to other approaches based on potential field functions, our method does not require the segmentation of the objects or the precise localization of the contours. Our approach is very simple to implement and can be applied to natural noisy color images of old documents.
Software Reliability: The Stopping Rule Problem
Authors: S. M. Ross
Venue: IEEE Transactions on Software Engineering (1985)

When a new computer software package is developed and all obvious erros removed, a testing procedure is often put into effect to eliminate the remaining errors in the package. One common procedure is to try the package on a set of randomly chosen problems. We suppose that whenever a program encounters an error, a system failure results. At this point the software is inspected to determine and remove the error responsible for the failure. This goes on for some time and two problems of interest are 1) to estimate the error rate of the software at a given time t, and 2) to develop a stopping rule for determining when to discontinue the testing and declare that the software is ready for use. In this paper, a model for the above is proposed as an estimation and stopping rule procedure.
Effective OpenMP Implementation and Translation For Multiprocessor System-On-Chip without Using OS
Authors: Woo-Chul Jeun, Soonhoi Ha
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

It is attractive to use the OpenMP as a parallel programming model on a multiprocessor system-on-chip (MPSoC) because it is easy to write a parallel program in the OpenMP and there is no standard method for parallel programming on an MPSoC. In this paper, we propose an effective OpenMP implementation and translation for major OpenMP directives on an MPSoC with physically shared memories, hardware semaphores, and no operating system.
DPICO: a high speed deep packet inspection engine using compact finite automata
Authors: Christopher L. Hayes, Yan Luo
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Deep Packet Inspection (DPI)has been widely adopted in detecting network threats such as intrusion, viruses and spam. It is challenging, however, to achieve high speed DPI due to the expanding rule sets and ever increasing line rates. A key issue is that the size of the finite automata falls beyond the capacity of on-chip memory thus incurring expensive off-chip accesses. In this paper we present DPICO a hardware based DPI engine that utilizes novel techniques to minimize the storage requirements for finite automata. The techniques proposed are modified content addressable memory (mCAM), interleaved memory banks, and data packing. The experiment results show the scalable performance of DPICO can achieve up to 17.7 Gbps throughput using a contemporary FPGA chip. Experiment data also show that a DPICO based accelerator can improve the pattern matching performance of a DPI server by up to 10 times.
Representation of Moving Rigid Objects Based on Visual Observations
Authors: H. -H. Nagel
Venue: Computer (1981)

A single-camera algorithmic system can learn from observations of scenes with moving rigid objects.
An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
Authors: M. T. Kaufman
Venue: IEEE Transactions on Computers (1974)

This paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. Assume that we have n identical processors, and a number of tasks to perform. Each task Tirequires an amount of time µito complete, 0 i= k, so that k is an upper bound on task time. Tasks are indivisible, s
Multivalued Integrated Injection Logic
Authors: T. T. Dao
Venue: IEEE Transactions on Computers (1977)

A family of circuits for multivalued, in particular quaternary, integrated injection logic is described. The basic elements are the I2L current mirror and I2L threshold gates.
Model-driven architecture for cancer research
Authors: Radu Calinescu, Steve Harris, Jeremy Gibbons, Jim Davies, Igor Toujilov, Sylvia B. Nagl
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

It is a common phenomenon for research projects to collect and analyse valuable data using ad-hoc information systems. These costly-to-build systems are often composed of incompatible variants of the same modules, and record data in ways that prevent any meaningful result analysis across similar projects. We present a framework that uses a combination of formal methods, model-driven development and service-oriented architecture (SOA) technologies to automate the generation of data management systems for cancer clinical trial research, an area particularly affected by these problems. The SOA solution generated by the framework is based on an information model of a cancer clinical trial, and comprises components for both the collection and analysis of cancer research data, within and across clinical trial boundaries. While primarily targeted at cancer research, our approach is readily applicable to other areas for which a similar information model is available.
Pitch Synchronous Analysis Method and Fisher Criterion Based Speaker Identification
Authors: Yumin Zeng, Huayu Wu, Rong Gao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

A novel text independent speaker identification system is proposed. In the proposed system, the 12-order perceptual linear predictive cepstrum and their delta coefficients in the span of five frames are extracted from segmented speech based on the method of pitch synchronous analysis. The Fisher ratio is used to evaluate the effectiveness of speech feature and select the part dimensions of the original 25-dimensional feature vector to form the new 13-dimensional feature vector. The Gaussian Mixture Model is applied to model the speakers. The experimental results show that the proposed system gives very good performances, which the identification accuracy is significantly better than that of the other 13-dimensional feature based systems and is a little bit better than or just the same as the 25-dimensional feature based system, but the algorithm complexity is much less than that of the 25-dimensional features based system.
Structure and function of myocardial fibrillar collagen
Authors: James B. Caulfield, Joseph S. Janicki
Venue: Technology and Health Care (1997)

The extracellular collagen matrix of the myocardium plays an important role in maintaining muscle fiber and cardiac alignment and ventricular shape and size. It also influences tissue and ventricle stiffness. This network consists of an organized hierarchy of collagen that is intimately associated with individual and groups of myocyte and muscle fibers, as well as the coronary vasculature. In renovascular and genetic hypertension, the hypertrophic response of the myocardium includes an increase in collagen concentration, thickening of existing fibrillar collagen, and addition of newly synthesized collagen to all of the matrix components. The consequences of this remodeling are a stiffer myocardium and left ventricular diastolic dysfunction. With removal of less than half of the normal amount of collagen the opposite occurs. That is, the ventricle dilates and there is an increase in ventricular compliance. Thus an abnormal accumulation of collagen is a major distinguishing factor between physiologic and pathologic hypertrophy while an abrupt decrease in collagen concentration results in a ventricular remodeling similar to that of a heart in failure.
A Comprehensive Planning Framework for Selecting and Customizing Quality Assurance Techniques
Authors: Frank Elberzhager, Christian Denger
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Different quality assurance techniques can be applied in the software development lifecycle to improve the quality of a product. Today, no holistic approach for planning and customizing inspection and testing techniques in a given context exists. In this paper, we present a framework which consists of the main aspects necessary for a systematic planning of quality assurance activities in different development steps. We present the core elements of the framework: influence and variation factors, characteristics of techniques and a role concept. The framework is a first step towards a systematic planning approach for quality assurance, which has to be refined in future research. Based on the elements, we recommend an initial process how to apply the framework. With this, a basis is developed to support quality managers planning quality assurance techniques in a more systematic way.
Fast background subtraction for real time monitoring
Authors: K. Sundaraj, V. Retnasamy
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

We present an implementation for fast detection of moving objects in real time monitoring applications. We apply a common technique known as background subtraction for this purpose. Background subtraction can be defined as the process of extracting the regions of interest from a given image. Over the last few decades or so, many background subtraction algorithms have appeared. They have been tailored for various applications. In this paper, we intend to propose an alternative implementation suitable for real-time monitoring applications. We do this by reducing the complexity of our mathematical model used for background modeling. We find that this tecnique might be an interesting alternative for many applications.
Resolving Collision and Delay Deterioration by a Novel Channel Collision Based Adaptive Backoff (CCBAB) Scheme in Wireless LANs
Authors: Di Wu, Guangxi Zhu, Gan Liu, Wenpeng Yuan, Mingxin Chen
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

IEEE 802.11e standard has defined EDCA to guarantee prioritized QoS by service differentiation. However, it induces significant performance deterioration in both delay performance and collision probability at heavy load due to inherent drawbacks of Binary Exponential Backoff (BEB) scheme. In this paper we proposed a novel backoff scheme, Channel Collision Based Adaptive Backoff (CCBAB) 1 scheme which compels each station to react to channel collisions irrespective of whether or not it is involved in, to combat the deterioration problem. CCBAB selectively forces some uncollided traffics to reduce their transmission probability and grants collided real time traffics larger transmission probability to ensure them be successfully transmitted in a shorter time. Simulations demonstrate that CCBAB scheme achieves more stable channel collision probabilities, smaller delay and jitter for real time traffics than EDCA and its enhanced variation AEDCF schemes and proves to be more resistant towards collisions and delay deterioration at high congestion level.
Special Feature The Challenge of Software Engineering Project Management
Authors: R. H. Thayer
Venue: Computer (1980)

Identifying crucial problems in SEPM, this summary of Survey results challenges the computing community to address and solve them.