ppxscal/embedding_network huggingface dataset:
A Serial Memory by Quantum-Dot Cellular Automata (QCA)
Authors: V. Vankamamidi, M. Ottavi, F. Lombardi
Venue: IEEE Transactions on Computers (2008)

Quantum-dot Cellular Automata (QCA) has been widely advocated as a new device architecture for nano technology. QCA systems require extremely low power together with the potential for high density andregularity. These features make QCA an attractive technology for manufacturing memories in which the paradigm of memory-in-motion can be fully exploited. This paper proposes a novel serial memory architecture for QCA implementation. This architecture is based on utilizing new building blocks (referred to as tiles) in the storage and input/output circuitry of the memory. The QCA paradigm of memory-in-motion is accomplished using a novel arrangement in the storage loop and timing/clocking; a three-zone memory tile is proposed by which information is moved across a concatenation of tiles by utilizing a two-level clocking mechanism. Clocking zones are shared between memory cells and the length of the QCA line of a clocking zone is independent of the word size. QCA circuits for address decoding and input/output for simplification of the Read/Write operations are discussed in detail. An extensive comparison of the proposed architecture and previous QCA serial memories is pursued in terms of latency, timing, clocking requirements and hardware complexity.
A regression-based analytic model for capacity planning of multi-tier applications
Authors: Qi Zhang, Ludmila Cherkasova, Ningfang Mi, Evgenia Smirni
Venue: Cluster Computing (2008)

The multi-tier implementation has become the industry standard for developing scalable client-server enterprise applications. Since these applications are performance sensitive, effective models for dynamic resource provisioning and for delivering quality of service to these applications become critical. Workloads in such environments are characterized by client sessions of interdependent requests with changing transaction mix and load over time, making model adaptivity to the observed workload changes a critical requirement for model effectiveness. In this work, we apply a regression-based approximation of the CPU demand of client transactions on a given hardware. Then, we use this approximation in an analytic model of a simple network of queues, each queue representing a tier, and show the approximation's effectiveness for modeling diverse workloads with a changing transaction mix over time. Using two case studies, we investigate factors that impact the efficiency and accuracy of the proposed performance prediction models. Experimental results show that this regression-based approach provides a simple and powerful solution for efficient capacity planning and resource provisioning of multi-tier applications under changing workload conditions.
Improved bounds for the chromatic index of graphs and multigraphs
Authors: S. Louis Hakimi, Edward F. Schmeichel
Venue: Journal of Graph Theory (1999)

We show that coloring the edges of a multigraph G in a particular order often leads to improved upper bounds for the chromatic index &chi;&prime;(G). Applying this to simple graphs, we significantly generalize recent conditions based on the core of G &lang;i.e., the subgraph of G induced by the vertices of degree &Delta;(G)&rang;, which insure that &chi;&prime;(G) = &Delta;(G). Finally, we show that $\chi '(G) \leq \Delta (G) + \lceil \sqrt{\mu (G)}\rceil $ in any multigraph G in which every cycle of length larger than 2 contains a simple edge, where &mu;(G) is the largest edge multiplicity in G. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 311&ndash;326, 1999
Gazetiki: automatic creation of a geographical gazetteer
Authors: Adrian Popescu, Gregory Grefenstette, Pierre Alain Moëllic
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Geolocalized databases are becoming necessary in a wide variety of application domains. Thus far, the creation of such databases has been a costly, manual process. This drawback has stimulated interest in automating their construction, for example, by mining geographical information from the Web. Here we present and evaluate a new automated technique for creating and enriching a geographical gazetteer, called Gazetiki. Our technique merges disparate information from Wikipedia, Panoramio, and web search engines in order to identify geographical names, categorize these names, find their geographical coordinates and rank them. The information produced in Gazetiki enhances and complements the Geonames database, using a similar domain model. We show that our method provides a richer structure and an improved coverage compared to another known attempt at automatically building a geographic database and, where possible, we compare our Gazetiki to Geonames.
Hierarchical Test Compression for SoC Designs
Authors: Kee Sup Kim, Ming Zhang
Venue: IEEE Design Test (2008)

For SOC designs, it becomes very desirable to have IP blocks that come with their own test compression while having a second level of compression at the full-chip level. If done without careful analysis, this second-level compression logic can be subject to much greater aliasing and error masking because of the presence of X (unknown) values. This article presents a systematic way of designing the second-level compression logic. This method preserves the same X and multiple-error tolerance as the original X-Compact. The new method also successfully handles the use of identical cores, where there is a far higher chance of multiple errors and X values.
PXE magic: flexible network booting with menus
Authors: Kyle Rankin
Venue: Linux Journal (2008)

What if you never had to carry around an install or rescue CD again? Set up a PXE boot server with menus and put them all on the network.
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms
Authors: Vincent Nélis, Joël Goossens, Raymond Devillers, Dragomir Milojevic, Nicolas Navet
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. We propose two distinct algorithms. Our first algorithm is an off-line speed determination mechanism which provides an identical speed for each processor. That speed guarantees that all deadlines are met if the jobs are scheduled using EDF. The second algorithm is an on-line and adaptive speed adjustment mechanism which reduces the energy consumption while the system is running.
Orchestrating Data-Centric Workflows
Authors: Adam Barker, Jon B. Weissman, Jano van Hemert
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

When orchestrating data-centric workflows as are commonly found in the sciences, centralised servers can become a bottleneck to the performance of a workflow; output from service invocations are normally transferred via a centralised orchestration engine, when they should be passed directly to where they are needed at the next service in the workflow. To address this performance bottleneck, this paper presents a lightweight hybrid workflow architecture and concrete API, based on a centralised control flow, distributed data flow model. Our architecture maintains the robustness and simplicity of centralised orchestration, but facilitates choreography by allowing services to exchange data directly with one another, reducing data that needs to be transferred through a centralised server. Furthermore our architecture is standards compliment, flexible and is a non-disruptive solution; service definitions do not have to be altered prior to enactment.
An ontology-guided process for developing problem frame specification: an example
Authors: Xiaohong Chen, Zhi Jin
Venue: Proceedings of the 3rd international workshop on Applications and advances of problem frames (2008)

Problem Frames approach is a new and prospective tool for classifying, analyzing and structuring software development problems. However, there is not yet efficient CASE tool for guiding the problem frame specification development. An ontology based solution for this kind of CASE tool has been proposed, and an ontology of Problem Frames approach has been developed for this purpose. This paper presents the process of the ontology-guided problem frame specification development.
Imaging Tools in Cancer Research and Prevention
Authors: James L. Mulshine, Thomas M. Baer
Venue:  (2008)

Presents chapters written by leading clinical researchers in the field of lung cancer, where high resolution 3-D imaging technology appears to hold the greatest near-term promise, as well as contributions from recognized experts in CAD, medical information technology systems, regulatory procedure, x-ray standards development, and clinical trial design. These expert contributors discuss the current state of the art and provide a road map for directing further research in lung cancer as well as other organ systems.
Internet-based 'social sharing' as a new form of global production: The case of SETI@home
Authors: Hans-Jürgen Engelbrecht
Venue: Telematics and Informatics (2008)

Benkler (Sharing nicely: on shareable goods and the emergence of sharing as a modality of economic production, Yale Law Journal, 2004, vol. 114, pp. 273-358) has argued that 'social sharing' via Internet-based distributed computing is a new, so far under-appreciated modality of economic production. This paper presents results from an empirical study of SETI@home (the Search for Extraterrestrial Intelligence), which is the classic example of such a computing project. The aim is to explain SETI@home participation and its intensity in a cross-country setting. The data are for a sample of 172 developed and developing countries for the years 2002-2004. The results indicate that SETI@home participation and its intensity can be explained largely by the degree of ICT access (proxied by the International Telecommunication Union's 'Digital Access Index'), as well as GDP per capita and dummy variables for major country groups. Some other variables, such as the Human Development Index, perform less well. Although SETI@home is a global phenomenon, it is never-the-less mostly concentrated in rich countries. However, there are indications of a slowly narrowing global SETI@home digital divide.
Diagnosis of Scan Clock Failures
Authors: King Leong Lee, Nadir Z. Basturkmen, Srikanth Venkataraman
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

In this paper we present a fault diagnosis procedure for defects in the scan clock tree. We first identify the candidate clock tree buffers common to failing chains by backtracing. We then evaluate and rank these candidates by forward tracing and simulation. Experimental results show that the proposed procedure provides accurate diagnosis of scan clock failures.
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Authors: Ming Zhong, Kai Shen, Joel Seiferas
Venue: IEEE Transactions on Computers (2008)

Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state maintenance overhead, random walks have been widely used in such network environments. However, the current uses are limited to unguided or heuristic random walks with no guarantee on their converged node visitation probability distribution. Such a convergence guarantee is essential for strong analytical properties and high performance of many p2p applications. In this paper, we investigate an approach for random walks to converge to application-desired node visitation probability distributions while only requiring information about direct neighbors of each peer. Our approach is guided by the Metropolis-Hastings algorithm that is typically used in Monte Carlo Markov Chain sampling. We examine the effectiveness and practical issues of our approach using three application studies: random membership subset management, search, and load balancing. Both search and load balancing desire random walks with biased node visitation distributions to achieve application-specific analytical features. Our theoretical analysis, simulations, and Internet experiments demonstrate the advantage of our random walks compared with alternative topology-independent index-free approaches.
The round-up property of the fractional chromatic number for proper circular arc graphs
Authors: Thomas Niessen, Jaakob Kind
Venue: Journal of Graph Theory (2000)

Let G = (V, E) be a graph and let k be a nonnegative integer. A vector c &epsilon; ℤ V+ is called k-colorable iff there exists a coloring of G with k colors that assigns exactly c(v) colors to vertex v &epsilon; V. Denote by &chi; (G) and &chi;f(G) the chromatic number and fractional chromatic number, respectively. We prove that &chi;(G) = &chi;f(G) holds for every proper circular arc graph G. For this purpose, a more general round-up property is characterized by means of a polyhedral description of all k-colorable vectors. Both round-up properties are equivalent for proper circular arc graphs. The polyhedral description is established and, as a by-product, a known coloring algorithm is generalized to multicolorings. The round-up properties do not hold for the larger classes of circular arc graphs and circle graphs, unless P = NP. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 256267, 2000
Enhanced prediction of misalignment conditions from spectral data using feature selection and filtering
Authors: Hyun-Woo Cho, Myong K. Jeong
Venue: Expert Systems with Applications: An International Journal (2008)

This paper proposes a novel method for the use of genetic algorithm-based feature selection and signal filtering to construct reliable calibration models of shaft misalignment. Determination and selection of the key feature(s) is crucial to the predictive performance of calibration models. Even with proper feature selection, the predictive performance of calibration models can be enhanced by filtering the raw spectral data. This improvement results because a filter removes the unwanted variation of predictor variables that is orthogonal to response variables. This is the first work that attempts to develop a systematic calibration model based on genetic algorithm-based feature selection and orthogonal filtering. A case study shows that the proposed calibration model for shaft misalignment conditions produces better predictive performance than traditional multivariate statistical approaches such as principal component regression and partial least squares.
Note: A generalization of the Curtis-Hedlund theorem
Authors: Tullio Ceccherini-Silberstein, Michel Coornaert
Venue: Theoretical Computer Science (2008)

Let A be a set and let G be a group, and equip A^G with its prodiscrete uniform structure. Let @t:A^G->A^G be a map. We prove that @t is a cellular automaton if and only if @t is uniformly continuous and G-equivariant. We also give an example showing that a continuous and G-equivariant map @t:A^G->A^G may fail to be a cellular automaton when the alphabet set A is infinite.
Error Protected Data Bus Inversion Using Standard DRAM Components
Authors: Maurzio Skerlj, Paolo Ienne
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Off-chip communication consumes a significant part of main memory system power. Existing solutions imply the use of specialized memories or assume error free environments. This is either unrealistic or impractical in many industrial situations. In this paper, we propose an architecture which implements classic low power encoding but uses industry standard DRAMs. Moreover, the low power encoding is combined with error-protection in order to extend the application to noisy channels or to the presence of soft and hard failures in the memory. Parallelism between the two encoding processes avoids any latency adder. Our experimental results, based on current consumption measurements of DDR2 DRAM components in mass production, show savings up to 31% on the I/O power and 6% on the total memory energy of a single channel memory system of 4GB at practically no cost.
Variation-adaptive feedback control for networks-on-chip with multiple clock domains
Authors: Umit Y. Ogras, Radu Marculescu, Diana Marculescu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

This paper discusses the use of networks-on-chip (NoCs) consisting of multiple voltage-frequency islands to cope with power consumption, clock distribution and parameter variation problems in future multiprocessor systems-on-chip (MPSoCs). In this architecture, communication within each island is synchronous, while communication across different islands is achieved via mixed-clock, mixed-voltage queues. In order to dynamically control the speed of each domain in the presence of parameter and workload variations, we propose a robust feedback control methodology. Towards this end, we first develop a state-space model based on the utilization of the inter-domain queues. Then, we identify the theoretical conditions under which the network is controllable. Finally, we synthesize state feedback controllers to cope with workload variations and minimize power consumption. Experimental results demonstrate robustness to parameter variations and more than 40% energy savings by exploiting workload variations through dynamic voltage-frequency scaling (DVFS) for a hardware MPEG-2 encoder design.
Experiences in developing a fair-exchange e-commerce protocol using common off-the-shelf components
Authors: Indrajit Ray, Hongjun Zhang
Venue: Electronic Commerce Research and Applications (2008)

Fair-exchange is an important property that must be ensured in all electronic commerce environments where the merchants and the customers are reluctant to trust each other. This property guarantees that none of the transacting parties suffer because of the fraudulent behavior of the other party in the transaction. In this paper, we describe our experiences in developing a new e-commerce protocol to address the problem of fair-exchange for digital products. The protocol is based on a novel cryptographic technique that we had proposed earlier. We show how to use common off-the-shelf software components to develop such a protocol.
Implications of a single mobile computing device
Authors: Len Bass, John Klein
Venue: Proceedings of the 1st international workshop on Software architectures and mobility (2008)

This paper explores some of the implications of having a single platform that suffices for all of the mobile computing needs of an individual. It examines a mobile computing scenario from the perspective of designing the user interface software, and potential reliability and security issues.
An empirical validation of object-oriented class complexity metrics and their ability to predict error-prone classes in highly iterative, or agile, software: a case study
Authors: Hector M. Olague, Letha H. Etzkorn, Sherri L. Messimer, Harry S. Delugach
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2008)

Empirical studies have shown complexity metrics to be good predictors of testing effort and maintainability in traditional, imperative programming languages. Empirical validation studies have also shown that complexity is a good predictor of initial quality and reliability in object-oriented (OO) software. To date, one of the most empirically validated OO complexity metrics is the Chidamber and Kemerer Weighted Methods in a Class (WMC). However, there are many more OO complexity metrics whose predictive power has not been as extensively explored. In this study, we explore the predictive ability of several complexity-related metrics for OO software that have not been heavily validated. We do this by exploring their ability to measure quality in an evolutionary software process, by correlating these metrics to defect data for six versions of Rhino, an open-source implementation of JavaScript written in Java. Using statistical techniques such as Spearman's correlation, principal component analysis, binary logistic regression models and their respective validations, we show that some lesser known complexity metrics including Michura et al.'s standard deviation method complexity and Etzkorn et al.'s average method complexity are more consistent predictors of OO quality than any variant of the Chidamber and Kemerer WMC metric. We also show that these metrics are useful in identifying fault-prone classes in software developed using highly iterative or agile software development processes. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Edge-face chromatic number and edge chromatic number of simple plane graphs
Authors: Rong Luo, Cun-Quan Zhang
Venue: Journal of Graph Theory (2005)

Given a simple plane graph G, an edge-face k-coloring of G is a function &phi; : E(G) &cup; F(G) ➝ {1,&hellip;,k} such that, for any two adjacent or incident elements a, b &epsilon; E(G) &cup; F(G), &phi;(a) &ne; &phi;(b). Let &chi;e(G), &chi;ef(G), and &Delta;(G) denote the edge chromatic number, the edge-face chromatic number, and the maximum degree of G, respectively. In this paper, we prove that &chi;ef(G) = &chi;e(G) = &Delta;(G) for any 2-connected simple plane graph G with &Delta; (G) &ge; 24. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Backstop: a tool for debugging runtime errors
Authors: Christian Murphy, Eunhee Kim, Gail Kaiser, Adam Cannon
Venue: ACM SIGCSE Bulletin (2008)

The errors that Java programmers are likely to encounter can roughly be categorized into three groups: compile-time (semantic and syntactic), logical, and runtime (exceptions). While much work has focused on the first two, there are very few tools that exist for interpreting the sometimes cryptic messages that result from runtime errors. Novice programmers in particular have difficulty dealing with uncaught exceptions in their code and the resulting stack traces, which are by no means easy to understand. We present Backstop, a tool for debugging runtime errors in Java applications. This tool provides more user-friendly error messages when an uncaught exception occurs, and also provides debugging support by allowing users to watch the execution of the program and the changes to the values of variables. We also present the results of two preliminary studies conducted on introductory-level programmers using the two different features of the tool.