ppxscal/embedding_network huggingface dataset:
GreenStor: Application-Aided Energy-Efficient Storage
Authors: Nagapramod Mandagere, Jim Diehl, David Du
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

The volume of online data content has shown an unprecedented growth in recent years. Fueling this growth are new federal regulations which warrant longer data retention and a general increase in the richness of data content. To cope with this growth, high performance computing and enterprise environments are making use of large disk-based solutions that consume power all the time, unlike tape-based solutions. As a consequence, the energy consumption of the storage solutions has grown significantly. In this work we propose a storage solution called GreenStor, which makes use of application hinting on top of Massive Arrays of Idle Disks (MAID) to improve energy efficiency. GreenStor is centered on MAID, but with more efficient data movement to aid in energy conservation. Specifically, we propose an Extent-based Metadata Manager that achieves better space efficiency without sacrificing cache utilization and an Opportunistic Scheduling scheme that helps provide better use of application hints in a MAID system. Results show that our proposed opportunistic scheme for application hint scheduling consumes up to 40% less energy compared to traditional non-MAID storage solutions, whereas use of standard schemes for scheduling application hints on typical MAID systems is only able to achieve a smaller energy savings of about 25% versus non-MAID storage.
Behavior Modeling During Software Design
Authors: W. E. Riddle
Venue: IEEE Transactions on Software Engineering (1978)

A modeling scheme is presented which provides a medium for the rigorous, formal, and abstract specification of large-scale software system components. The scheme allows the description of component behavior without revealing or requiring the description of a component's internal operation. Both collections of sequential processes and the data objects which they share may be described. The scheme is of particular value during the early stages of software system design, when the system's modules are being delineated and their interactions designed, and when rigorous, well-defined specification of undesigned components allows formal and informal arguments concerning the design's correctness to be formulated.
Architectural and Software Issues in the Design and Application of Peripheral Array Processors
Authors: W. J. Karplus
Venue: Computer (1981)

How can we overcome the limits of von Neumann architecture and avoid supercomputer costs? This overview suggests that peripheral array processors are the answer in many applications.
Precise Dynamic Impact Analysis with Dependency Analysis for Object-oriented Programs
Authors: Lulu Huang, Yeong-Tae Song
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Dynamic impact analysis based on program executions has shown promise in aiding tasks in the life cycle of large-scale systems. Dynamic impact analysis techniques have shown to produce more precise results than static impact analysis [1]. However, current dynamic impact analysis techniques lack important features such as analysis of dependency among program entities and consideration of object-oriented programs' features. Thus they may produce imprecise results. In this paper, we present a precise dynamic impact analysis approach for object-oriented programs. This approach considers the characteristics of object-oriented programs and performs dependency analysis which may potentially reduce the impact sets by eliminating elements that do not have dependency on the changed elements. Even though our discussion in this paper is based on JavaTM programming language, this approach can be carried out in a language independent manner for broader applications.
UQLIPS: a real-time near-duplicate video clip detection system
Authors: Heng Tao Shen, Xiaofang Zhou, Zi Huang, Jie Shao, Xiangmin Zhou
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Near-duplicate video clip (NDVC) detection is an important problem with a wide range of applications such as TV broadcast monitoring, video copyright enforcement, content-based video clustering and annotation, etc. For a large database with tens of thousands of video clips, each with thousands of frames, can NDVC search be performed in real-time? In addition to considering inter-frame similarity (i.e., spatial information), what is the impact of frame sequence similarity (i.e., temporal information) on search speed and accuracy? UQLIPS is a prototype system for online NDVC detection. The core of UQLIPS comprises two novel complementary schemes for detecting NDVCs. Bounded Coordinate System (BCS), a compact representation model ignoring temporal information, globally summarizes each video to a single vector which captures the dominating content and content changing trends of each clip. The other proposal, named FRAme Symbolization (FRAS), maps each clip to a sequence of symbols, and takes temporal order and sequence context information into consideration. Using a large collection of TV commercials, UQLIPS clearly demonstrates that it is feasible to perform real-time NDVC detection with high accuracy.
Statistical Modeling and Correlation Analysis of End-to-End Delay in Wide Area Networks
Authors: Wei Zhang, Jingsha He
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

End-to-end delay is a very important network performance parameter. Consequently, research on end-to-end delay has received a great deal of interest. In this paper, we model end-to-end delay using statistical methods. In particular, we use three statistical distribution models to study end-to-end delay, i.e., Pareto distribution, normal distribution and lognormal distribution. Our analysis results show that Pareto distribution is most appropriate to model end-to-end delay while normal or normal-related distribution is not. We also study delay correlation in different time ranges to find out if delay in the past can provide any indication on delay in the future. Our study shows that there is indeed a good correlation when the time range is about 1.25 seconds.
Microprocessor Applications
Authors: S. C. Lee
Venue: Computer (1977)

This special issue of Computer presents five papers covering as many major areas of microcomputer applications: high-level languages development for microcomputer applications, special-purpose microcomputers, computer peripherals and instrumentation, microcomputer networks, and distributed process control.
A Fault-Tolerant Mutual Exclusion Resource Reservation Protocol for Clustered Mobile Ad hoc Networks
Authors: Mohammad Moallemi, Mohammad Hossien Yaghmaee Moghaddam, Mahmoud Naghibzadem
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Resource reservation and mutual exclusion are challenging problems in mobile ad-hoc networks (MANET). Due to the dynamic characteristics of nodes in these networks, yet, few algorithms have been proposed. The other problem in these networks is link or node failure due to many reasons (e.g. running out of battery, hardware software crash, getting out of transmission range due to high mobility). Thus fault tolerance for these algorithms is another necessity which hasn't been completely accomplished. In this paper we proposed an algorithm which is completely fault tolerant (covers temporary and permanent faults). It also has the mutual exclusion property for critical resource reservations. The proposed algorithm uses three recovery processes to maintain the stable state for whole system. At the end we have proved the proposed algorithm's Safety and Liveness properties to show its integrity.
IOTA: A Modular Programming System
Authors: T. Yuasa
Venue: IEEE Transactions on Software Engineering (1985)

A highly interactive programming system is presented which supports hierarchical and modular program development with abstraction mechanisms. By taking advantage of abstraction mechanisms, the system provides a "truly modular" environment, in which modules are constructed, debugged, verified, and compiled in a module-by-module fashion. Such an environment naturally requires system management of the information concerning ongoing program development, in the form of module databases. As a result, further problems arise as to how to modify the information in efficient and consistent ways. This paper discusses design objectives for modular programming systems by focusing on such issues as information management, interactive construction and modification of modules, separate processing, specification and verification, and supports for cooperative program development.
Temperature-controlled self-organized InP nanostructures grown on GaAs(100) substrate by MOCVD
Authors: J. Zhou, X. M. Ren, Q. Wang, Y. Q. Huang, J. H. Lv, H. Huang, S. W. Cai
Venue: Microelectronics Journal (2007)

The self-organized InP nanostructures grown on GaAs(001) substrates by metalorganic vapor deposition were examined in detail using atomic force microscopy. By properly selecting growth temperature, three kinds of nanostructure, islands, pits and ripples were formed. For growth temperature of 400-450^oC, the surface morphologies were governed by islands; but, for the growth temperature of 500^oC, the formation of surface ripples instead of islands was presumably due to the combination effect of temperature-controlled surface kinetics and strain effect. On the other hand, the observation of enhanced growth of pits upon a high-temperature annealing (at 685^oC for 90s) indicated that the strained InP epitaxial film would be morphologically stabilized by taking the form of pits formation.
Adaptive Selection of Wavelet Basis Based on Genetic Algorithm and Its Application
Authors: Zhonghui Luo, Leping Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

An adaptive selection of wavelet basis is presented in this paper. Based on the constructive theory of orthogonal binary wavelet basis, a parameter expression equation of orthogonal wavelet basis is constructed and a adaptive goal function of de-noised effect is defined. By applying genetic optimization method, the best wavelet basis was obtained, and the correlative arithmetic is presented. Applying the optimal wavelet basis to eliminate noises from signals, and computed the correlation dimension of the de-noised signals as fault feature. Simulation and experiments show that the adaptive wavelet de-noising makes the mechanical fault feature extraction more reliable.
ProbDiVinE: A Parallel Qualitative LTL Model Checker
Authors: Jiri Barnat, Lubos Brim, Ivana Cema, Milan Ceska, Jana Tumova
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

We introduce a parallel model checker for checking Markov decision processes against linear time properties. The model checker extends the parallel model checker Di- VinE and supports verification of qualitative properties.
A QoS Model of Next Generation Network based on MPLS
Authors: Na Lin, Hongman Qi
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

At first, several QoS technologies are presented and analyzed, one single technology can not solve QoS problem perfectly. A new QoS model is brought forward, which integrates MPLS traffic engineering, DiffServ and IntServ. Design philosophy and implementation technique of this model are presented. At last, simulations about this model in NS2 are done. Comparing with MPLS network, network delay is shortened and packets loss rate is improved in proposed model.
A low-power multiplier with the spurious power suppression technique
Authors: Kuan-Hung Chen, Yuan-Sun Chu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper provides the experience of applying an advanced version of our former spurious power suppression technique (SPST) on multipliers for high-speed and low-power purposes. To filter out the useless switching power, there are two approaches, i.e., using registers and using AND gates, to assert the data signals of multipliers after the data transition. The SPST has been applied on both the modified Booth decoder and the compression tree of multipliers to enlarge the power reduction. The simulation results show that the SPST implementation with AND gates owns an extremely high flexibility on adjusting the data asserting time which not only facilitates the robustness of SPST but also leads to a 40% speed improvement. Adopting a 0.18-µm CMOS technology, the proposed SPST-equipped multiplier dissipates only 0.0121 mW per MHz in H.264 texture coding applications, and obtains a 40% power reduction.
Dependability Analysis with Markov Chains: How Symmetries Improve Symbolic Computations
Authors: Michael G. McQuinn, Peter Kemper William H. Sanders
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

We propose a novel approach that combines two general and complementary methods for dependability analysis based on the steady state or transient analysis of Markov chains. The first method allows us to automatically detect all symmetries in a compositional Markovian model with state-sharing composition. Symmetries are detected with the help of an automorphism group of the model composition graph, which yields a reduction of the associated Markov chain due to lumpability. The second method allows us to represent and numerically solve the lumped Markov chain, even in the case of very large state spaces, with the help of symbolic data structures, in particular matrix diagrams. The overall approach has been implemented and is able to compute stationary and transient measures for large Markovian models of dependable systems.
On the utility of syllable-based acoustic models for pronunciation variation modelling
Authors: Annika Hämäläinen, Lou Boves, Johan de Veth, Louis ten Bosch
Venue: EURASIP Journal on Audio, Speech, and Music Processing (2007)

Recent research on the TIMIT corpus suggests that longer-length acoustic models are more appropriate for pronunciation variation modelling than the context-dependent phones that conventional automatic speech recognisers use. However, the impressive speech recognition results obtained with longer-length models on TIMIT remain to be reproduced on other corpora. To understand the conditions in which longer-length acoustic models result in considerable improvements in recognition performance, we carry out recognition experiments on both TIMIT and the Spoken Dutch Corpus and analyse the differences between the two sets of results. We establish that the details of the procedure used for initialising the longer-length models have a substantial effect on the speech recognition results. When initialised appropriately, longer-length acoustic models that borrow their topology from a sequence of triphones cannot capture the pronunciation variation phenomena that hinder recognition performance the most.
Bayesian Regularization for Normal Mixture Estimation and Model-Based Clustering
Authors: Chris Fraley, Adrian E. Raftery
Venue: Journal of Classification (2007)

Normal mixture models are widely used for statistical modeling of data, including cluster analysis. However maximum likelihood estimation (MLE) for normal mixtures using the EM algorithm may fail as the result of singularities or degeneracies. To avoid this, we propose replacing the MLE by a maximum a posteriori (MAP) estimator, also found by the EM algorithm. For choosing the number of components and the model parameterization, we propose a modified version of BIC, where the likelihood is evaluated at the MAP instead of the MLE. We use a highly dispersed proper conjugate prior, containing a small fraction of one observation's worth of information. The resulting method avoids degeneracies and singularities, but when these are not present it gives similar results to the standard method using MLE, EM and BIC.
Biology, immunology and information security
Authors: Mark Burgess
Venue: Information Security Tech. Report (2007)

Biology has succeeded in solving many computational and communication problems in the natural world, and computer users are ever inspired by its apparently ingenious creativity. Today scientists are building artificial immune systems and discussing autonomic computing, with self-healing, self-anything systems. We discuss the relevance and efficacy of these approaches. Are they better than classical software engineering design?
FOX: Inference of Approximate Functional Dependencies from XML Data
Authors: Fabio Fassetti, Bettina Fazzinga
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Functional dependencies (FDs) are an integral part of relational database theory since they are used in integrity enforcement and in database design. Despite their importance FDs are often not specified or some of them are not expected by database designers, but they occur in the data and the need of inferring them from data arises. Furthermore, in several areas as data cleaning, data integration and data analysis, an important task is to find approximate functional dependencies (that are FDs approximately satisfied by a data collection) in order to discovery erroneous or exceptional elements in the data. In this work we present a system, called Fox , that infers approximate functional dependencies from XML documents employing a new notion of approximation suitable for XML data. Moreover, we show experimental results assessing the effectiveness of the Fox system and indicating that our approach is promising from the point of view of the semantic significance of the mined knowledge.
Cluster Grid based Response-time analysis module for the PIPE Tool
Authors: Harini Kulatunga, Ashok Argent-Katwala, William Knottenbelt
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Generalized Stochastic Petri Nets (GSPNs) are a widely used high-level formalism used for modelling discrete-event systems. The Platform Independent Petri net Editor (PIPE) is an open source software project that allows creation, analysis and simulation of Petri Nets. This tool paper presents a PIPE module for response-time analysis of a Petri net's underlying Continuous Time Markov Chain (CTMC). Jobs are submitted via a web interface, from within PIPE or from a browser. The parallel computations are run using Grid Engine on a cluster hosted at Imperial College London.
Solving Timetabling Problem Using Genetic and Heuristic Algorithms
Authors: Nguyen Duc Thanh
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, we propose a hybrid algorithm that combines genetic and heuristic approach. By using this method, solving timetabling problem is converted to finding the optimal arrangement of elements on a 2D matrix. This algorithm was implemented and tested with the synthetic and real data of Nong Lam University of HCM City, Vietnam. The experimental results reveal the usability and potential of the proposed algorithm in solving timetabling problems.
Quinault: An Office Modeling System
Authors: G. J. Nutt
Venue: Computer (1981)

Quinault is an automated system for constructing and analyzing office models. Its interactive graphics help managers understand office structures and predict office information systems' performance.
Mining unexpected multidimensional rules
Authors: Marc Plantevit, Sabine Goutier, Françoise Guisnel, Anne Laurent, Maguelonne Teisseire
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

Discovering unexpected rules is essential, particularly for industrial applications with marketing stakes. In this context, many works have been done for association rules. However, none of them addresses sequences. In this paper, we thus propose to discover unexpected multidimensional sequential rules in data cubes. We define the concept of multidimensional sequential rule, and then unexpectedness. We formalize these concepts and define an algorithm for mining this kind of rules. Experiments on a real data cube are reported and highlight the interest of our approach.
Visualizing Human Body Motion Simulations
Authors: K. D. Willmert
Venue: IEEE Computer Graphics and Applications (1982)

The simulation of uncontrolled human motion often requires realistic graphics displays. But what can you do if your simulation program has no graphics capabilities?
Flexible and Executable Hardware/Software Interface Modeling for Multiprocessor SoC Design Using SystemC
Authors: P. Gerin
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

At high abstraction level, multi-processor system-on-chip (SoC) designs are specified as assembling of IP's which can be hardware or software. The refinement of communication between these different IP's, known as hardware/software interfaces, is widely seen as the design bottleneck due to their complexity. In order to perform early design validation and architecture exploration, flexible executable models of these interfaces are needed at different abstraction levels. In this paper, we define a unified methodology to implement executable models of the hardware/software interface based on SystemC. The proposed formalism based on the concept of services gives to this approach the flexibility needed for architecture exploration and the ability to be used in automatic generation tools. A case study of hardware/software interface modeling at the transaction accurate level is presented. Experimental results show that this method allows higher simulation speed with early performance estimation.
Knowledge-Based Program Debugging Systems
Authors: R. E. Seviora
Venue: IEEE Software (1987)

No one likes to debug programs, and there is no way to automate the task. However, knowledge-based approaches offer some possibilities for the future.
Computer-Based Aid to Managing Patients with Chronic Illness
Authors: C. F. Starmer
Venue: Computer (1975)

Computer technology has had a major impact on virtually all segments of society and industry. The medical profession, however, is an exception. No major changes in the behavior of the practicing doctor have resulted from the past 15 years of computer research in medicine. Although there are isolated examples where computer technology has been used in the laboratory and in accounting, computer technology has not become an integral, cost-effective part of today's medicine.