ppxscal/embedding_network huggingface dataset:
Storage Virtualization Gets Smart
Authors: Kostadis Roussos
Venue: Queue (2007)

Over the past 20 years we have seen the transformation of storage from a dumb resource with fixed reliability, performance, and capacity to a much smarter resource that can actually play a role in how data is managed. In spite of the increasing capabilities of storage systems, however, traditional storage management models have made it hard to leverage these data management capabilities effectively. The net result has been overprovisioning and underutilization. In short, although the promise was that smart shared storage would simplify data management, the reality has been different.
Cumulative Voting Consensus Method for Partitions with Variable Number of Clusters
Authors: Hanan G. Ayad, Mohamed S. Kamel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Over the past few years, there has been a renewed interest in the consensus clustering problem. Several new methods have been proposed for finding a consensus partition for a set of n data objects that optimally summarizes an ensemble. In this paper, we propose new consensus clustering algorithms with linear computational complexity in n. We consider clusterings generated with random number of clusters, which we describe by categorical random variables. We introduce the idea of cumulative voting as a solution for the problem of cluster label alignment, where, unlike the common one-to-one voting scheme, a probabilistic mapping is computed. We seek a first summary of the ensemble that minimizes the average squared distance between the mapped partitions and the optimal representation of the ensemble, where the selection criterion of the reference clustering is defined based on maximizing the information content as measured by the entropy. We describe cumulative vote weighting schemes and corresponding algorithms to compute an empirical probability distribution summarizing the ensemble. Given the arbitrary number of clusters of the input partitions, we formulate the problem of extracting the optimal consensus as that of finding a compressed summary of the estimated distribution that preserves maximum relevant information. An efficient solution is obtained using an agglomerative algorithm that minimizes the average generalized Jensen-Shannon divergence within the cluster. The empirical study demonstrates significant gains in accuracy and superior performance compared to several recent consensus clustering algorithms.
Semi-Concurrent On-Line Testing of Transition Faults Through Output Response Comparison of Identical Circuits
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

We describe a method for on-line testing of delay faults based on the comparison of output responses of identical circuits. The method allows one of the circuits to participate in useful computations during the testing process, while the other circuit must be idle. We refer to this method as semi -concurrent on-line testing. While unknown input vectors are applied to the circuit that participates in useful computations, the proposed method applies modified vectors to the idle circuit. In this way, different conditions are created for the detection of delay faults, allowing identical delay faults that affect both circuits to be detected. In designing the modified vectors, we ensure that the expected fault free responses of the two circuits are identical. We also ensure that the hardware for modifying the vectors applied to the idle circuit will be easy to implement on-chip.
Reconfigurable trusted computing in hardware
Authors: Thomas Eisenbarth, Tim Güneysu, Christof Paar, Ahmad-Reza Sadeghi, Dries Schellekens, Marko Wolf
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

Trusted Computing (TC) is an emerging technology towards building trustworthy computing platforms. The TrustedComputing Group (TCG) has proposed several specifications to implement TC functionalities by extensions to common computing platforms, particularly the underlying hardware with a Trusted Platform Module (TPM). However, actual TPMs are mostly available for workstations and servers nowadays and rather for specific domainapplications and not primarily for embedded systems. Further, the TPM specifications are becoming monolithic andmore complex while the applications demand a scalable and flexible usage of TPM functionalities. In this paper we propose a reconfigurable (hardware) architecture with TC functionalities where we focus on TPMsas proposed by the TCG specifically designed for embedded platforms. Our approach allows for (i) an efficient andscalable design and update of TPM functionalities, in particular for hardware-based crypto engines and accelerators, (ii) establishing a minimal trusted computing base in hardware, (iii) including the TPM as well as its functionalities into the chain of trust that enables to bind sensitive data to the underlying reconfigurable hardware, and (iv) designing a manufacturer independent TPM. We discuss possible implementations based on current FPGAs and point out the associated challenges, in particular with respect to protection of the internal TPM state since it must not be subject to manipulation, replay, and cloning
Probabilistic correlation-based similarity measure of unstructured records
Authors: Shaoxu Song, Lei Chen
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Computing the similarity between unstructured records is a fundamental function in multiple applications. Approximate string matching and full text retrieval techniques do not show the best performance when applied directly, since the information are limited in unstructured records of short record length. In this paper, we propose a novel probabilistic correlation-based similarity measure. Rather than simply conducting the exact matching tokens of two records, our similarity evaluation enriches the information of records by considering the correlations of tokens. We define the probabilistic correlation between tokens as the probability that these tokens appear in the same records. Then we compute the weight of tokens and discover the correlations of records based on the probabilistic correlations of tokens. Finally, we present extensive experimental results to demonstrate the effectiveness of our approach.
SCOOP
Authors: Alex Bateman, Robert D. Finn
Venue: Bioinformatics (2007)

Motivation: Profile searches of sequence databases are a sensitive way to detect sequence relationships. Sophisticated profile–profile comparison algorithms that have been recently introduced increase search sensitivity even further. Results: In this article, a simpler approach than profile–profile comparison is presented that has a comparable performance to state-of-the-art tools such as COMPASS, HHsearch and PRC. This approach is called SCOOP (Simple Comparison Of Outputs Program), and is shown to find known relationships between families in the Pfam database as well as detect novel distant relationships between families. Several novel discoveries are presented including the discovery that a domain of unknown function (DUF283) found in Dicer proteins is related to double-stranded RNA-binding domains. Availability: SCOOP is freely available under a GNU GPL license from http://www.sanger.ac.uk/Users/agb/SCOOP/ Contact: agb@sanger.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.
A virtual link routing scheme in the wireless home network architecture supporting end-to-end seamless connectivity: Research Articles
Authors: Byounghoon Kim, E. K. Park, Sungwoo Tak
Venue: Wireless Communications Mobile Computing (2007)

This paper presents a communication framework for end-to-end seamless connectivity improvement in IEEE802.11-based wireless home networks. The proposed communication framework incorporates the following two things: a new concept of wireless home network architecture and a new routing technique in an effort to improve wireless communication coverage and end-to-end seamless packet delivery respectively. First, the proposed wireless home network architecture based on the End-to-end Seamless multi-hop COnnectivity based on Dual-mode (ESCOD) integrates infrastructure and ad hoc modes in an IEEE 802.11-based wireless home network. Second, the Virtual Link Routing (VLR) technique, a kind of ad hoc routing protocols working on the layer 2.5, provides mobile nodes with end-to-end seamless connectivity and packet delivery. We compare the performance of VLR with two prominent on-demand routing protocols for Mobile Ad hoc Networks (MANET), Dynamic Source Routing (DSR) and Ad hoc On demand Distance Vector (AODV), in the ESCOD-based wireless home network. Experiments show that our communication framework incorporating the VLR technique in the ESCOD-based wireless home network architecture yields efficient performance in terms of the low failure rate of packet transmission, fast packet transmission time, network throughput, and a wider coverage area of wireless home networks. Copyright &copy; 2007 John Wiley & Sons, Ltd.
An IMS-SOA Architecture for Multimodal Interaction using Distributed Keyword Dictionaries
Authors: Sorin-Marian Georgescu
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

The multimodal architecture discussed in this paper is a distributed implementation of W3C Multimodal Interaction model. Certain functions of the W3C Interaction Manager are now executed by the multimodal client, while others have been distributed to remote SOA compliant multimodal enablers. A Multimodal Interaction AS manages the interaction with the local Speech Platform and communicates with neighbor enablers to retrieve interaction rules/recognition models. Remote speech recognition is used whenever the semantic analysis of the information associated to a given command does not lead to words in the local dictionary, or when the dialect of the user determines significant recognition errors.
A Method for Blind Detection of OFDM Signal Based on Power Spectrum Reprocessing
Authors: Hai-ying Zhang, Chao-wei Yuan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

A method for blind detection of OFDM signal based on power spectrum reprocessing is presented for distinguishing OFDM signal and single carrier modulation signals. The method takes full advantage of cryptic period of OFDM signal and enhances its ability for processing through power spectrum pretreatment, and has strong ability to suppress additive interference and is applicable to frequency selectivity fading channel and accurately estimate subcarrier frequency interval, symbol period, signal bandwidth and subcarrier number of OFDM signal. The simulation result shows that the new method is able to detect OFDM signals rapidly and accurately in condition of relatively low signal-noise ratio, and achieves high identification probability, has high adaptability for frequency selectivity fading channel, and has also low computational complexity, high precision, and is suitable for hardware implement.
The Regulation of Gene Expression in E-Cell
Authors: Xinhua Lu, Jigui Sun, Ying Ren, Shuai Lu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Gene expression is the transformational procedure from genetic information of genome to proteome which affect the life activities of cells. The Regulation of gene expression determines the structure, quantity and functions of proteome. Existing electronic cell (E-Cell) models seldom relate to simulation on the regulations of gene expressions. In this paper, the E-Cell model we propose, named Analog-Cell, in order to reappear the life activities of cells and discover new biological rules, simulates the main regulation mechanisms in gene expression through defining regulation factors, enzymes and rational reaction rules, thus Analog-Cell obtains recommendable simulative results.
Associative Processing of Network Flow Problems
Authors: I-Ngo Chen
Venue: IEEE Transactions on Computers (1979)

Application of associative processors to the solution of the maximal flow problem is investigated. To take maximum advantage of the capability of associative processors, a new algorithm based on matrix representation is developed. The new algorithm is then compared with the associative version of the Ford and Fulkerson labeling method. The comparison is made on the total associative memory access time required for problem solution by each algorithm running on an associate processor. Results show that the ratio of the labeling algorithm to the new algorithm is about 3 for a dense network with 5 nodes. This ratio increases as the number of nodes increases, and decreases as the density of the network decreases.
MA1: real-time and parallel processing in ada
Authors: John W. McCormick
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

This tutorial assumes basic knowledge or experience with the Ada programming language. This tutorial covers two of the major problems with parallel and real-time programming -- time management and storage management. Parallel processing, whether on single-processor machines or multiple processors, has many pitfalls. We will examine these potential pitfalls, and discuss ways to avoid common problems, such as deadlocks and race conditions. We will also discuss how to write code that efficiently passes data with other parallel processes. The basics of parallel processing are covered, leading to a discussion and examples using Ada tasking. In addition, the Ada Real-Time Systems Annex is also covered.
Parallel Digital Differential Analyzer with Arbitrary Stored Interconnections
Authors: D. Sh. Dawoud
Venue: IEEE Transactions on Computers (1973)

DRO associative memory, as well as NDRO associative memory, is used for realizing an arbitrary stored interconnection address system and the increment store of a parallel-type DDA. An MFMU is used also for realizing a parallel-type DDA with an arbitary stored interconnection system. In this system each memory cell represents an integrator with its address codes.
Usage and Perceptions of Agile Software Development in an Industrial Context: An Exploratory Study
Authors: Andrew Begel, Nachiappan Nagappan
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Agile development methodologies have been gaining acceptance in the mainstream software development community. While there are numerous studies of Agile development in academic and educational settings, there has been little detailed reporting of the usage, penetration and success of Agile methodologies in traditional, professional software development organizations. We report on the results of an empirical study conducted at Microsoft to learn about Agile development and its perception by people in development, testing, and management. We found that one-third of the study respondents use Agile methodologies to varying degrees, and most view it favorably due to improved communication between team members, quick releases and the increased flexibility of Agile designs. The Scrum variant of Agile methodologies is by far the most popular at Microsoft. Our findings also indicate that developers are most worried about scaling Agile to larger projects (greater than twenty members), attending too many meetings and the coordinating Agile and non-Agile teams.
FAC: A Functional APL Language
Authors: Hai-Chen Tu
Venue: IEEE Software (1986)

FAC, a functional array calculator language, features APL syntax and array operations but allows partitions, operators, and infinite arrays-extensions that are semantically wthat are semantically implausible in APL.
A Software Maintainability Evaluation Methodology
Authors: D. E. Peercy
Venue: IEEE Transactions on Software Engineering (1981)

This paper describes a conceptual framework of software maintainability and an implemented procedure for evaluating a program's documentation and source code for maintainability characteristics. The evaluation procedure includes use of closed-form questionnaires completed by a group of evaluators. Statistical analysis techniques for validating the evaluation procedure are described. Some preliminary results from the use of this methodology by the Air Force Test and Evaluation Center are presented. Areas of future research are discussed.
User-Perceived Quality of Interactive Systems
Authors: W. Dzida
Venue: IEEE Transactions on Software Engineering (1978)

User-perceived quality of interactive systems is defined in terms of statistically nonoverlapping categories, so-called dimensions or factors Categories are identified by factor analysis and represent a dimensional concept of the quality of interactive systems as perceived by its users. Each category describes essential user requirements.
Stochastic immune layer optimizer: efficient tool for optimization of combustion process in a boiler
Authors: G. Jarmoszewicz, K. Świrski, K. Wojdan
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

The article presents a method for optimization of combustion process in a boiler. This solution is based on the artificial immune system. A layered optimization system is used, to minimize CO and NOx emission. This solution is implemented in real power plant. The results from this implementation have been presented. They confirm that presented solution is effective and usable in practice.
Segmentation and recognition of phonetic features in handwritten Pitman shorthand
Authors: Yang Ma, Graham Leedham, Colin Higgins, Swe Myo Htwe
Venue: Pattern Recognition (2008)

There is a wish to be able to enter text into mobile computing devices at the speed of speech. Only handwritten shorthand schemes can achieve this data recording rate. A new, overall solution to the segmentation and recognition of phonetic features in Pitman shorthand is proposed in this paper. Approaches to the recognition of consonant outlines, vowel and diphthong symbols and shortforms, which are different components of Pitman shorthand, are presented. A new rule is introduced to solve the issue of smooth junctions in the consonant outlines which was normally the bottleneck for recognition. Experiments with a set of 1127 consonant outlines, 2039 vowels and diphthongs and 841 shortforms from three shorthand writers have demonstrated that the proposed solution is quite promising. The recognition accuracies for consonant outlines, vowels and diphthongs, and shortforms achieved 75.33%, 96.86% and 91.86%, respectively. From the evaluation of 461 outlines with smooth junction, the introduction of the new rule has a great positive effect on the performance of the solution. The recognition accuracy of smooth junction improves from 37.53% to 93.41% given a writing time increase of 14.42%.
Optimal fuel core loading pattern design in PWR nuclear power reactors using genetic algorithms and fuzzy nonlinear programming
Authors: Mehrdad Boroushaki, Mohammad B. Ghofrani, Caro Lucas
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

In pressurized water reactors, the fuel reloading problem has significant meaning in terms of both safety and economics. An optimal loading pattern is defined as a pattern in which the local power peaking factor (P_q) is lower than a predetermined value during one cycle and the effective multiplication factor (k_{eff}) is maximized to extract the maximum energy. This article presents a specialized genetic algorithm for loading pattern design. The tests on well-researched cases have shown that the genetic algorithm is capable of finding better loading patterns than solutions found by direct search methods. However, most of the previous researchers have considered simple fitness (cost) functions; therefore the reported solutions cannot minimize the P_qtogether with maximization of the k_{eff}. To solve this difficulty, we used Fuzzy Nonlinear Programming (FNLP) technique with the genetic algorithm to perform multi-objective optimization (maximizing the k_{eff}together with minimizing the P_q). The results show that this method improves the genetic algorithm results compared to previous methods.
Development of system on 3D image visualization and analyzing for industrial computed tomography
Authors: Yanping Lu, Jue Wang, Honglin Yu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Industrial computed tomography (ICT) systems have widely applied in many important industrial areas for non-destructive testing (NDT) and non-destructive evaluate (NDE). A software system on 3D image visualization and analyzing for industrial CT is developed. This system is built on the frame that based on data flow model, and with the modules such as data I/O, data pre-processing, 3D visualization and data analyzing. It is includes the functions of complicated surface constructing, transparent volume rendering, reslicing, virtual endoscopy and 3D measuring. The system has been applied to several types of industrial CT, and the results indicate that it can clearly shows the 3D configuration and material information of tested object, which helps to analyze the object's status. The system improved the usefulness of industrial CT images and extended the functions of industrial CT.
Synæsthetic Music or the Ultimate Ocular Harpsichord
Authors: Julian Villegas, Michael Cohen
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

We address the problem of visualizing microtuned scales and chords such that each representation is unique and therefore distinguishable. Using colors to represent the dif- ferent pitches, we aim to capture aspects from the musical scale impossible to represent with numerical ratios. In- spired by the neurological phenomenon known as synæs- thesia, we built a system to reproduce microtuned MIDI se- quences aurally and visually. This system can be related to Castel's historic idea of the `Ocular Harpsichord.'
Exploiting Heterogeneity of Nodes to Enhance Search Performance in Large-Scale Peer-to-Peer Network
Authors: Yadong Gong, Xiaola Lin
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

A large number of resource locating algorithms have been proposed in peer-to-peer (P2P) networks. However, the query efficiency of most existing methods is limited to large-scale P2P networks. In this paper, we propose a new decentralized P2P architecture, by taking advantage of the heterogeneous characters of nodes to integrate the resources of stable nodes, and simplify the management of dynamic nodes based on two different types of clustering. In our proposed architecture, group-based semantic overlay network is formed by node clustering and resources of stable nodes are organized by a set of cooperative resource clustering frameworks. When a query is generated, it will be first processed in local group, and if it fails to hit the targets, it will be relayed to the resource clustering frameworks. Simulation shows that this architecture can greatly reduce the search traffic in large-scale P2P networks.