ppxscal/embedding_network huggingface dataset:
Total domination in partitioned trees and partitioned graphs with minimum degree two
Authors: Allan Frendrup, Michael A. Henning, Preben Dahl Vestergaard
Venue: Journal of Global Optimization (2008)

Let G = (V, E) be a graph and let $$S \subseteq V$$ . A set of vertices in G totally dominates S if every vertex in S is adjacent to some vertex of that set. The least number of vertices needed in G to totally dominate S is denoted by ¿ t (G, S). When S = V, ¿ t (G, V) is the well studied total domination number ¿ t (G). We wish to maximize the sum ¿ t (G) + ¿ t (G, V 1) + ¿ t (G, V 2) over all possible partitions V 1, V 2 of V. We call this maximum sum f t (G). For a graph H, we denote by H ^ P 2 the graph obtained from H by attaching a path of length 2 to each vertex of H so that the resulting paths are vertex-disjoint. We show that if G is a tree of order n ¿ 4 and $$G \notin \{P_5, P_6, P_7, P_{10}, P_{14}\}$$ , then f t (G) ¿ 14n/9 with equality if and only if G ¿{P 9, P 18} or G = (T ^ P 2) ^ P 2 for some tree T. If G is a connected graph of order n with minimum degree at least two, we establish that f t (G) ¿ 3n/2 with equality if and only if G is a cycle of order congruent to zero modulo 4.
Optimal age-replacement policy for repairable products under renewing free-replacement warranty
Authors: Yu-Hung Chien, Jih-An Chen
Venue: International Journal of Systems Science (2007)

This paper investigates the effects of a renewing free-replacement warranty (RFRW) on the age replacement policy for a repairable product with a general failure model. In the general model, there are two types of failure when the product fails. One is type I failure (minor failure), which can be removed by a minimal repair; and the other is type II failure (catastrophic failure), which can be removed only by a replacement. After a minimal repair, the product is operational but the failure rate of the product remains unchanged. For both warranted and nonwarranted products, cost models are developed, and the corresponding optimal replacement ages are derived such that the long-run expected cost rate is minimized. The impacts of the RFRW on the optimal replacement age are investigated analytically. Finally, numerical examples are given for illustration.
Synthesis of object-oriented descriptions modeled at functional-level
Authors: Maziar Goudarzi, Shaahin Hessabi
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In this paper we present a novel approach to synthesizing polymorphic hardware from functional-level Object-Oriented (OO) models. Our proposed target architecture is intended to be subsequently used in co-design of hardware and software from a single OO source model, and hence, in order to be consistent with software compilers uses a global memory to store the objects data. The target architecture enables inheritance and polymorphism; it consists of a method-invocation unit (MIU), a functional unit (FU) per class method, and an object-management unit (OMU). The MIU, FU, and OMU functionalities are presented, along with the details of modeling and synthesis of a traffic-light controller to demonstrate the concepts and approach. Moreover, experimental results of modeling and implementing some case studies are presented and analyzed. Synthesis results show some area overhead compared to traditional methodologies; however, we show that this overhead is constant for all applications having the same class hierarchy and moreover is independent of the number of objects in the system. Therefore this overhead is ignorable, or even not present, for large designs or designs with several objects where OO shows its best.
Surface generation analysis in micro end-milling considering the influences of grain
Authors: J. S. Wang, Y. D. Gong, G. Abba, K. Chen, J. S. Shi, G. Q. Cai
Venue: Microsystem Technologies (2008)

The micro end-milling method is a universal micro manufacturing method used to fabricate micro parts and complex 3D micro structures with many materials. Although micrometer size is achieved, their surface quality is not satisfactory. In this paper, the influences of different metal phase grains are researched, and the micro end-milling process is described considering the workpiece with anisotropic properties in micro scope. In this research, the physical characteristics of different grains, specifically friction coefficient &#x03bc; and elastic modulus E, are very critical to determine the processes of the chip formation and the surface generation. And the chips are often discontinuous because of the grain boundary effect. Through the micro end-milling experiment, the results of bottom surface correlate very well with the theoretical analysis.
The invariant planck energy distribution law and its connection to the Maxwell-Boltzmann distribution function
Authors: Siavash H. Sohrab
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

A scale-invariant model of statistical mechanics is described and applied to derive the invariant Planck law of energy distribution from the invariant Boltzmann distribution function. Also, the invariant Schrödinger equation is derived from the invariant Bernoulli equation for potential incompressible flow. It is shown that a homogeneous isotropic turbulent fluid is composed of a spectrum of eddies (energy levels) each composed of a spectrum of molecular clusters with energy spectra governed by the Planck distribution law and harmonious with the Kolmogorov k-5/3 law. The stability of clusters, de Broglie wave packets, is shown to be due to a potential that acts as Poincaré stress. Atomic transitions between different size clusters (energy levels) are shown to result in emission/absorption of energy in harmony with Bohr's theory of atomic spectra.
Parallel generational-copying garbage collection with a block-structured heap
Authors: Simon Marlow, Tim Harris, Roshan P. James, Simon Peyton Jones
Venue: Proceedings of the 7th international symposium on Memory management (2008)

We present a parallel generational-copying garbage collector implemented for the Glasgow Haskell Compiler. We use a block-structured memory allocator, which provides a natural granularity for dividing the work of GC between many threads, leading to a simple yet effective method for parallelising copying GC. The results are encouraging: we demonstrate wall-clock speedups of on average a factor of 2 in GC time on a commodity 4-core machine with no programmer intervention, compared to our best sequential GC.
Statistical Data Stability and Leakage Evaluation of FinFET SRAM Cells with Dynamic Threshold Voltage Tuning under Process Parameter Fluctuations
Authors: Zhiyu Liu, Sherif A. Tawfik, Volkan Kursun
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A new six transistor (6T) FinFET static memory cell with dynamic access transistor threshold voltage tuning is evaluated in this paper for statistical power and stability distributions under process parameter variations. The independent-gate (IG) FinFET SRAM cell activates only one gate of the double-gate data access transistors during a read operation. The disturbance caused by the direct data access mechanism of the standard 6T SRAM cell topology is significantly reduced by dynamically increasing the threshold voltage of the access transistors. All the transistors in the presented SRAM cell are sized minimum without producing any data stability concerns. The average read static-noise-margin of the statistical samples with the independent gate bias technique is 82% higher as compared to the standard tied-gate FinFET SRAM cells under process variations. Furthermore, the IG-FinFET SRAM circuit reduces the average leakage power and the cell area by up to 53.3% and 17.5%, respectively, as compared to the standard tied-gate FinFET SRAM circuits sized for comparable data stability in a 32nm FinFET technology.
A Simple Cache Based Mechanism for Peer to Peer Resource Discovery in Grid Environments
Authors: Imen Filali, Fabrice Huet, Christophe Vergoni
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Grids are distributed systems aiming at the aggregation of geographically distributed resources for high performance computing. Heterogeneity and volatility are the main characteristics of resources in a Grid environment. This aspect makes the resource discovery in a grid a crucial problem: Given the resource requirements of an application, a resource discovery mechanism returns the set of resources matched by the description. By considering a grid as a peer-to-peer network, it is possible to use decentralized algorithms to locate resources. We propose in this paper a new mechanism for peer-to-peer resource discovery in a grid environment. Our system is based on push-pull strategy,i.e, each peer may ask for resources or advertise them if they are available. Also, each peer maintains a local cache of messages and uses this information for routing. We compare our proposal with other search methods through simulation and we show that it provides higher success rate with lower overhead.
Improving performance and reducing energy-delay with adaptive resource resizing for out-of-order embedded processors
Authors: Houman Homayoun, Sudeep Pasricha, Mohammad Makhzan, Alex Veidenbaum
Venue: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems (2008)

While Ultra Deep Submicron (UDSM) CMOS scaling gives embedded processor designers ample silicon budget to increase processor resources to improve performance, restrictions with the power budget and practically achievable operating clock frequencies act as limiting factors. In this paper we show how just increasing processor resource size is not effective in improving performance due to constraints on achievable operating clock frequency. In response we propose two adaptive resource resizing techniques L2RS and L2ML1RS that adaptively resize resources by exploiting cache misses. Our results show a significant performance improvement and overall energy-delay reduction of on average 9.2% (upto 34%) and 3.8% respectively across SPEC2K benchmarks for L2ML1RS. Applying L2RS resulted in 6.8% performance improvement (upto 24%) and 4.6% energy-delay reduction. We also present the required circuit modification to apply these techniques which shown to be minimal.
Exploring traversal strategy for web forum crawling
Authors: Yida Wang, Jiang-Ming Yang, Wei Lai, Rui Cai, Lei Zhang, Wei-Ying Ma
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this paper, we study the problem of Web forum crawling. Web forum has now become an important data source of many Web applications; while forum crawling is still a challenging task due to complex in-site link structures and login controls of most forum sites. Without carefully selecting the traversal path, a generic crawler usually downloads many duplicate and invalid pages from forums, and thus wastes both the precious bandwidth and the limited storage space. To crawl forum data more effectively and efficiently, in this paper, we propose an automatic approach to exploring an appropriate traversal strategy to direct the crawling of a given target forum. In detail, the traversal strategy consists of the identification of the skeleton links and the detection of the page-flipping links. The skeleton links instruct the crawler to only crawl valuable pages and meanwhile avoid duplicate and uninformative ones; and the page-flipping links tell the crawler how to completely download a long discussion thread which is usually shown in multiple pages in Web forums. The extensive experimental results on several forums show encouraging performance of our approach. Following the discovered traversal strategy, our forum crawler can archive more informative pages in comparison with previous related work and a commercial generic crawler.
There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle
Authors: Tobias Kreisel, Sascha Kurz
Venue: Discrete Computational Geometry (2008)

We give two configurations of seven points in the plane, no three points in a line, no four points on a circle with pairwise integral distances. This answers a famous question of Paul Erd&#x0151;s.
Computational Aesthetics
Authors: Bruce Gooch, Brian Wyvill
Venue: IEEE Computer Graphics and Applications (2008)

Guest Editors Bruce Gooch and Brian Wyvill discuss computational aesthetics and the articles that comprise their special issue.
Reliability-Aware Approach: An Incremental Checkpoint/Restart Model in HPC Environments
Authors: Nichamon Naksinehaboon, Yudan Liu, Chokchai (Box) Leangsuksun, Raja Nassar, Mihaela Paun, Stephen L. Scott
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

For full checkpoint on a large-scale HPC system, huge memory contexts must potentially be transferred through the network and saved in a reliable storage. As such, the time taken to checkpoint becomes a critical issue which directly impacts the total execution time. Therefore, incremental checkpoint as a less intrusive method to reduce the waste time has been gaining significant attentions in the HPC community. In this paper, we built a model that aims to reduce full checkpoint overhead by performing a set of incremental checkpoints between two consecutive full checkpoints. Moreover, a method to find the number of those incremental checkpoints is given. Furthermore, most of the comparison results between the incremental checkpoint model and the full checkpoint model [19] on the same failure data set show that the total waste time in the incremental checkpoint model is significantly smaller than the waste time in the full checkpoint model.
Interactive Data Compression
Authors: A. El Gamal
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Let X and Y be two random variables with probability distribution p(x,y), joint entropy H(X,Y) and conditional entropies H(X \ Y) and H(Y \ X) . Person P/sub x/ knows X and person P/sub Y/ knows Y. They communicate over a noiseless two-way channel so that both know X and Y. It is proved that, on the average, at least H(X \ Y) + H(Y \ X) bits must be exchanged and that H(X,Y) + 2 bits are sufficient. If p(x.y) > 0 for all (x.y), then at least H(X,Y) bits must be communicated on the average. However, if p (x,y) is uniform over its support set, the average number of bits needed is close to H(X \ Y) + H (Y \ X). Randomized protocols can reduce the amount of communication considerably but only when some probability of error is acceptable.
A Method for Describing Knowledge Work Processes
Authors: Weidong Pan, Jixue Liu, Igor Hawryszkiewycz
Venue: Proceedings of the 2008 International Workshop on Advanced Information Systems for Enterprises (2008)

Improving knowledge work processes has become one of the biggest challenges for contemporary enterprises to enhance their competitiveness in modern economies. Our research aims to develop services to guide process participants to advance process steps towards best practices. This paper will focus on a way for describing knowledge work processes. A work process specification language (WPSL) will be proposed. Using it, best practices of knowledge work processes integrated from diverse different sources can be described, and according to the description, supportive services will be dynamically organized and provided for process participants to guide them to advance process steps with the attempts to increase their productivity and reduce required cost. The paper will present the WPSL and explore the approach to organizing supportive services based on the framework the WPSL provides.
MTMDAT
Authors: Janosch Hennig, Klaus D. M. Hennig, Maria Sunnerhagen
Venue: Bioinformatics (2008)

Summary: In structural biology and -genomics, nuclear magnetic resonance (NMR) spectroscopy and crystallography are the methods of choice, but sample requirements can be hard to fulfil. Valuable structural information can also be obtained by using a combination of limited proteolysis and mass spectrometry, providing not only knowledge of how to improve sample conditions for crystallization trials or NMR spectrosopy by gaining insight into subdomain identities but also probing tertiary and quaternary structure, folding and stability, ligand binding, protein interactions and the location of post-translational modifications. For high-throughput studies and larger proteins, however, this experimentally fast and easy approach produces considerable amounts of data, which until now has made the evaluation exceedingly laborious if at all manually possible. MTMDAT, equipped with a browser-like graphical user interface, accelerates this evaluation manifold by automated peak picking, assignment, data processing and visualization. Availability: MTMDAT can be downloaded from the following page: http://www.cms.liu.se/chemistry/molbiotech/maria_sunnerhagens_group/mtmdat by clicking on the corresponding links (windows-or unix-based) together with the manual and example files. The program is free for academic/non-commercial purposes only. Contact: janhe@ifm.liu.se
Simulation of Blind Flooding over Wireless Sensor Networks Based on a Realistic Battery Model
Authors: Marco Aurélio Spohn, P. S. Sausen, Fabiano Salvadori, Mauricio Campos
Venue: Proceedings of the Seventh International Conference on Networking (2008)

A Wireless Sensor Network (WSN) is a power constrained system, because nodes run on limited power batteries. When a node switches between modes (i.e., transmit, receive, and sleep), there are also changes related to the transition process. Although the switching energy is considered negligible most of the time, it is strongly dependent on the technology (e.g., the radio) deployed on the nodes. Most of the time, the switching energy is neglected to simplify the simulation process. To better understand energy consumption in a WSN, it is necessary to adopt a more realistic battery model. Network simulators usually employ the linear discharge model. This model is simple, but far from reality, leading to wrong conclusions like, for example, that switching energy necessarily implies on energy consumption. Getting a more accurate measure for the energy consumption of a sensor network may lead to better estimates for the network lifetime. To better understand the impact of a more realistic battery model on the simulation of a WSN, we compare the results for blind flooding using the standard battery model (i.e., linear model) to the results obtained using the Rakhmatov-Vrudhula battery model which captures the non-linear battery behavior.
On torus Burth bifurcations in the pulse-width system
Authors: Zh. T. Zhusubaliev
Venue: Automation and Remote Control (2008)

The dynamics of the pulse-width system described by nonautonomous piecewise smooth differential equations is studied. In the parameter plane domains of different dynamic behaviour are determined both analytically and numerically. A special type of C-bifurcation resulting in the invariant torus birth from a stable equilibrium is discovered. It is shown that the periodic motion due to this bifurcation arises as an unstable focal cycle surrounded by a resonance or ergodic torus.
Proposition of a Method for the Development and Deployment of e-Government Systems that Emphasize Good Governance
Authors: Driss Kettani, Bernard Moulin, Asmae El Mahdi
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

Although it is commonly agreed that e-Government systems enhance governance, there is a lack of empirical evidence to build upon this hypothesis which, legitimately, creates reluctance among key decision makers to adopt e-Government, especially in local governmental agencies in developing countries, In the context of the e-Fez Project and in a close collaboration with the municipality of the Moroccan city of Fez, we developed a pilot e-Government system that facilitates citizens’ access to governmental information and services. In the course of the e-Fez Project and other similar projects, we set up a methodology that emphasizes good governance at each step of an e-Government project and enables us to continuously assess the outcomes of the resulting e-Gov systems on governance. The ultimate goal is to reduce the reluctance of decision makers and to contribute in the dissemination of e-technology in developing countries through a scientific and proven methodology that systematically links eGovernment outcomes to good governance attributes.
Computer science and game theory
Authors: Yoav Shoham
Venue: Communications of the ACM (2008)

The most dramatic interaction between CS and GT may involve game-theory pragmatics.
Informational Aesthetics Measures
Authors: Jaume Rigau, Miquel Feixas, Mateu Sbert
Venue: IEEE Computer Graphics and Applications (2008)

The Birkhoff aesthetic measure of an object is the ratio between order and complexity. Informational aesthetics describes the interpretation of this measure from an information-theoretic perspective. From these ideas, the authors define a set of ratios based on information theory and Kolmogorov complexity that can help to quantify the aesthetic experience.
Interactive mining of frequent itemsets over arbitrary time intervals in a data stream
Authors: Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches assume a fixed support threshold, a changeable threshold is more realistic, considering the rapid updating of the streaming transactions in practice. Additionally, mining of itemsets over various time granularities rather than over the entire stream may provide more flexibility for many applications. Therefore, we propose a interactive mechanism to perform the mining of frequent itemsets over arbitrary time intervals in the data stream, allowing a changeable support threshold. A synopsis vector having tilted-time tables is devised for maintaining statistics of past transactions for support computation over user-specified time periods. The extensive experiments over various parameter settings demonstrate that our approach is efficient and capable of mining frequent itemsets in the data stream interactively, with variable support thresholds.
Flexible demonstrator platform for cooperative joint transmission and detection in next generation wireless MIMO-OFDM networks
Authors: Andreas Ibing, David Kühling, Marcel Kuszak, Clemens v. Helmolt, Volker Jungnickel
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

This paper presents a flexible demonstrator platform for cooperative joint transmission and detection in next generation wireless networks, especially cellular networks like 3GPP LTE+. The platform is shown capable of handling computational load as well as network load of jointly processing three maximum bandwidth LTE sectors with four antennas each. The platform uses a Workstation mainboard as PCI Express backplane. Joint signal processing is done on a Cell processor, protocol handling on an IXP2350 network processor. For baseband sample exchange a 10GBit/s optical network interface card is used. First results show the Cell processor capable of computing the 12x12 modified LTE MIMO-OFDM processing concurrently for precoding (downlink) and postprocessing (uplink) with a MIMO matrix update interval of 1ms (high mobility).