ppxscal/embedding_network huggingface dataset:
Computer Systems and Networks, 1 edition
Authors: Barry G. Blundell, Nawaz Khan, Aboubaker Lasebae, Muthana Jabbar
Venue: Fasttrack (2007)

Computer Systems and Networks provides an insight into the construction and operation of modern computer systems. Main computer sub-systems such as the CPU, primary and secondary storage devices, I/O systems, the display, etc, are reviewed. One chapter deals exclusively with digital circuits. Basic gates are described together with their use in forming combinational and sequential logic circuits. The functionality of the modern operating system is also described. Today, networking is an integral part of the computer and so the book introduces basic networking techniques and communications principles. By and large a bottom up approach is adopted in describing how the computer sub-systems are constructed and integrated so as to form the modern computer.
Characterizing chip-multiprocessor variability-tolerance
Authors: Sebastian Herbert, Diana Marculescu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Spatially-correlated intra-die process variations result in significant core-to-core frequency variations in chip-multiprocessors. An analytical model for frequency island chip-multiprocessor throughput is introduced. The improved variability-tolerance of FI-CMPs over their globally-clocked counterparts is quantified across a range of core counts and sizes under constant die area. The benefits are highest for designs consisting of many small cores, with the throughput of a globally-clocked design with 70 small cores increasing by 8.8% when per-core frequency islands are used. The small-core FI-CMP also loses only 7.2% of its nominal performance to process variations, the least among any of the designs.
Dynamic types for authentication
Authors: Michele Bugliesi Riccardo Focardi Matteo Maffei
Venue: Journal of Computer Security (2007)

We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the validation of each component in isolation is provably sound and fully compositional: if all the protocol participants are independently validated, then the protocol as a whole guarantees authentication in the presence of Dolev-Yao intruders possibly sharing long term keys with honest principals. Protocols are thus validated in the presence of both malicious outsiders and compromised insiders. The highly compositional nature of the analysis makes it suitable for multi-protocol systems, where different protocols might be executed concurrently.
Fast communication: Dominant sets clustering for image retrieval
Authors: Man Wang, Zheng-Lin Ye, Yue Wang, Shu-Xun Wang
Venue: Signal Processing (2008)

In image retrieval algorithms, retrieval is according to feature similarities with respect to the query, ignoring the similarities among images in database. To use the feature similarities information, this paper presents an application of dominant set clustering (DSC) to image retrieval system. Combining the low-level visual features and high-level concepts, the proposed approach fully explores the similarities among images in database using DSC and optimizes the relevance feedback results from traditional image retrieval system by clustering the similar images. To test its retrieval performances, we presented an image retrieval system using the memorized support vector machine (SVM) relevance feedback. The results of experiments on the images from Corel Image Database show that the proposed approach can greatly improve the efficiency and performances of learning machine, as well as the convergence to user's retrieval concept. Comparisons on retrieval precision, total feedback time of method with and without DSC were also made, which indicated an improvement by 6.79% over the average precision and less total relevance feedback times after using DSC.
Using Hollywood's greatest film scenes to illustrate concepts of organisational behaviour and management
Authors: Steve Dunphy
Venue: Behaviour & Information Technology (2007)

Great film moments achieve a life of their own. They seem to hang around in the viewer's subconscious mind begging for clarification or, if nothing else, classification. The author proposes using these moments or 'greatest film scenes' for the purpose of illustrating concepts of organisational behaviour and management. A chart is derived that enumerates the top 10 greatest film scenes, associates a relevant management concept or concepts to that scene and then provides a series of citations relevant to the concept. The citations are provided for the purpose of enabling further research.
Relation rule mining
Authors: Mehdi Adda, Rokia Missaoui, Petko Valtchev
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

Relationships between objects constitute an important component of domain knowledge and represent an added value to data and knowledge discovery and management. Some existing studies in data mining (including association rule mining) exploit domain knowledge to better conduct tasks in applications such as e-learning and e-commerce. However, general semantic links between objects are either not exploited in the mining process or limited to is-a relations. In this paper we present the basis of a new approach where direct and indirect domain relations between items (basket market analysis) are used to reveal hidden knowledge in item transactions. First, we define the notion of relation association rule as an association that holds between sequences of relations. Such a type of rules is produced from item transactions and existing links among items in a given domain ontology. Then, we define an a priori-based algorithm for relation association rule mining. Finally, we illustrate the potential of our approach for recommendation purposes.
Use of remote sensing data for estimation of winter wheat yield in the United States
Authors: L. Salazar, F. Kogan, L. Roytman
Venue: International Journal of Remote Sensing (2007)

This paper shows the application of remote sensing data for estimating winter wheat yield in Kansas. An algorithm uses the Vegetation Health (VH) Indices (Vegetation Condition Index (VCI) and Temperature Condition Index (TCI)) computed for each week over a period of 23 years (1982-2004) from Advance Very High Resolution Radiometer (AVHRR) data. The weekly indices were correlated with the end of the season winter wheat (WW) yield. A strong correlation was found between winter wheat yield and VCI (characterizing moisture conditions) during the critical period of winter wheat development and productivity that occurs during April to May (weeks 16 to 23). Following the results of correlation analysis, the principal components regression (PCR) method was used to construct a model to predict yield as a function of the VCI computed for this period. The simulated results were compared with official agricultural statistics showing that the errors of the estimates of winter wheat yield are less than 8%. Remote sensing, therefore, is a valuable tool for estimating crop yields well in advance of harvest, and at a low cost.
A meshless approach for solution of Burgers' equation
Authors: Alireza Hashemian, Hossein M. Shodja
Venue: Journal of Computational and Applied Mathematics (2008)

A new meshless method called gradient reproducing kernel particle method (GRKPM) is proposed for numerical solutions of one-dimensional Burgers' equation with various values of viscosity and different initial and boundary conditions. Discretization is first done in the space via GRKPM, and subsequently, the reduced system of nonlinear ordinary differential equations is discretized in time by the Gear's method. Comparison with the exact solutions, which are only available for restricted initial conditions and values of viscosity, approves the efficacy of the proposed method. For challenging cases involving small viscosities, comparison with the results obtained using other numerical schemes in the literature further attests the desirable features of the presented methodology.
Exploiting the Thread-Level Parallelism for BGP on Multi-core
Authors: Gao Lei, Lai Mingche, Gong Zhenghu
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

With the developing technology of multi-core processors, exploiting the thread-level parallelism (TLP) of BGP will highly improve the performance required by core routers on Internet, to relax the problems of BGP route outburst updates and persistent route oscillations. The TLP approach for BGP based on min-cut partition algorithm which introduces thread-level speculation (TLS) and decomposesthe BGP program into granularity balanced threads is proposed in this paper. Meanwhile, the speculation strategies and relative implementations,which ensure the commits of speculative threads insequence and maintain the memory consistency, are presented for TLS of BGP to improve the parallelism. Experiments on Sun Fire T1000 server show that our algorithm can achieve pretty speedup, which canreach 1.51, 1.82, 2.59 and 2.92 when partitioning 32,64, 256 and 512 threads and allowing 4, 8, 12 and 16 threads in parallel. And the response time of processing 1K, 5K, 10K and 30K packets on single sessionhas decreased 16.9% and 25.2% averagely when partitioning 64 and 256 threads.
Entropy Based Clustering of Data Streams with Mixed Numeric and Categorical Values
Authors: Shuyun Wang, Yingjie Fan, Chenghong Zhang, HeXiang Xu, Xiulan Hao, Yunfa Hu
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In is paper, a novel algorithm for clustering data streams with mixed numeric and categorical attributes (CNC-Stream)is proposed. A new similarity measure based on entropy determining the similarity between the objects (data points in the stream or the micro-clusters in memory) is also presented here, which makes CNC-Stream work. The experiments conducted on the real data sets and synthetic data sets show that the proposed method is of high quality.
Lower bounds for pseudorandom number generators
Authors: M. Kharitonov, A. V. Goldberg
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Computational resources necessary to generate pseudorandom strings are studied. In particular, lower bounds are proved for pseudorandom number generators, whereas previous research concentrated on upper bounds. The idea of separation of machine-based complexity classes on the basis of their ability (or inability) to generate pseudorandom strings is introduced and investigated.
Social theatres: a model for regulated virtual interaction environments
Authors: Hugo Paredes, F. Mário Martins
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The growth of the Internet and its associated technologies did open space for a new type of human interaction: virtual, social interaction environments. Nowadays, these virtual places are spread all over the Internet and are accessible to almost everyone. However, in these environments interaction is still mostly ad hoc, which is a drawback that, as pointed out by some authors, may lead to their future extinction. Therefore, the introduction of regulated interaction in these virtual interaction spaces may be a solution towards their organization and inherent increased credibility. In this paper we propose a model for interaction regulation and control for virtual, social interaction spaces, called Social Theatres. Social Theatres stand for the application of the theatrical metaphor to social virtual environments, intended to virtually reproduce some of the common useful people interaction contexts. Inside these environments, users become actors, playing previously well defined roles within a well known, commonly established virtual interaction scenario. The interaction between users becomes regulated and has to obey and follow very well established rules, flows and conversation protocols. This paper discusses the advantages of regulated interaction, presents the Social Theatre metaphor and proposes a software architecture for the implementation of these interaction spaces. A small case study of a regulated virtual interaction environment is also presented.
Specifying and Executing Reactive Scenarios With Lutin
Authors: Pascal Raymond, Yvan Roux, Erwan Jahier
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infinite sequence of input/output reactions. More precisely, it is dedicated to the description and the execution of constrained random scenarios. Its first use is for test sequence specification and generation. It can also be useful for early simulation of huge systems, where Lutin programs can be used to describe and simulate modules that are not yet fully developed. The programming style mixes relational and imperative features. Basic statements are input/output relations, expressing constraints on a single reaction. Those constraints are then combined to describe non deterministic sequences of reactions. The language constructs are inspired by regular expressions, and process algebra (sequence, choice, loop, concurrency). Moreover, the set of statements can be enriched with user defined operators. A notion of stochastic directive is also provided, in order to finely influence the selection of a particular class of scenarios.
Mobile P2P Web Services using SIP
Authors: Guido Gehlen, Fahad Aijaz, Yi Zhu, Bernhard Walke
Venue: Mobile Information Systems (2007)

Telecommunication networks and the Internet are growing together. Peer-to-Peer (P2P) services which are originally offered by network providers, like telephony and messaging, are provided through VoIP and Instant Messaging (IM) by Internet service providers, too. The IP Multimedia Subsystem (IMS) is the answer of the telecommunication industry to this trend and aims at providing Internet P2P and multimedia services controlled by the network operators. The IMS provides mobility and session management as well as message routing, security, and billing. This article is a comprehensive version of a conference publication [1] and introduces a Mobile P2P Web Services framework which enables the creation of arbitrary P2P application on mobile devices within the IMS. The terminals are sharing and publishing a Web Service interface, which provides the capability of coupling arbitrary applications using Web Service technologies and the support of the {IMS} infrastructure. The concept, the necessary Web Service adaptations, and extension as well as the interworking of Web Services, {IMS} nodes, and protocols are described and proofed by an exemplary mobile chess game application. In addition, the performance of mobile P2P Web Services is evaluated by means of an analytical analysis.
Caspar: cultural, artistic and scientific knowledge for preservation, access and retrieval
Authors: David Lamb, Daniel Lucchesi
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

CASPAR (Cultural, Artistic, and Scientific knowledge for Preservation, Access, and Retrieval) aims at providing secure, reliable and cost-effective access for digitally encoded information for an indefinite time frame. From digital pictures to museum archives, from music to scientific data sets, technology is constantly changing. CASPAR is being developed to address this situation, and provide people and organisations with a user-oriented preservation framework.
Zero-knowledge with log-space verifiers
Authors: J. Kilian
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

Interactive proof systems are considered in which the best set of possible verifiers is restricted to the class of probabilistic log-space automata. A. Condon (1988) introduced this model and showed that if the protocols are allowed to run for arbitrarily many rounds, exponential-time languages can be proved to a log-space verifier. To better approximate the usual notion of interactive proof systems, a number of researchers have considered a more realistic, further restricted model in which protocols are polynomially bounded, both in the number of rounds of communication and in the number of computational steps allowed to the verifier. A notion of language-recognition zero-knowledge is defined for this model, and it is shown that anything provable in this model can be proved in language-recognition zero-knowledge.
Efficient memory representation of XML document trees
Authors: Giorgio Busatto, Markus Lohrey, Sebastian Maneth
Venue: Information Systems (2008)

Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times larger than the size of the document. A considerable amount of memory is needed to store the tree structure of the XML document. In this paper, a technique is presented that allows to represent the tree structure of an XML document in an efficient way. The representation exploits the high regularity in XML documents by compressing their tree structure; the latter means to detect and remove repetitions of tree patterns. Formally, context-free tree grammars that generate only a single tree are used for tree compression. The functionality of basic tree operations, like traversal along edges, is preserved under this compressed representation. This allows to directly execute queries (and in particular, bulk operations) without prior decompression. The complexity of certain computational problems like validation against XML types or testing equality is investigated for compressed input trees.
Revised fabrication process for micro-fluxgate-magnetometers: Usage of electrodepositable photoresist
Authors: Maren R. Kirchhoff, Jens Güttler, Andreas Waldschik, Marco Feldmann, Stephanus Büttgenbach
Venue: Microelectronic Engineering (2008)

Magnetometers based on the fluxgate principle detect low vector magnetic fields. In this paper we present micro-fabricated fluxgate-magnetometers that are produced by multilayer processing techniques such as UV lithography and electroplating. They consist of two helical coils around a soft magnetic racetrack-core. The one-step electroplating of the vertical and top sections of the helical coils demands a photoresist application method which is able to uniformly deposit resist along a topographical profile. We use an electrodepositable photoresist to create this uniform coating.
The role of a cohort in the design and evaluation of pervasive systems
Authors: Tim Jay, Danaë Stanton Fraser
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

In this paper, we describe a new methodology for the design and evaluation of pervasive systems. We have recruited a cohort of 30 participants who are engaging with an interdisciplinary pervasive computing project Cityware over 3 years. The cohort has been selected in order to represent a broad mix of ages and technological abilities so as to increase the ecological validity of evaluation of systems and applications developed in Cityware. We discuss some of the techniques and methods that we have been able to employ as a result of maintaining this group of participants and illustrate how their data feeds into Cityware studies and applications. While the costs of recruiting and maintaining a cohort such as this are relatively high, the benefits in terms of the depth, richness and validity of results produced in this way are considered to be significant. We discuss this in terms of the potential for new designs, the type of data one can collect and engagement within the city.
Single-chip MPEG-2 422P@HL CODEC LSI with multichip configuration for large scale processing beyond HDTV level
Authors: Hiroe Iwasaki, Jiro Naganuma, Koyo Nitta, Ken Nakamura, Takeshi Yoshitome, Mitsuo Ogura, Yasuyuki Nakajima, Yutaka Tashiro, Takayuki Onishi, Mitsuo Ikeda, Toshihiro Minami, Makoto Endo, Yoshiyuki Yashima
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper proposes a new architecture for VASA, a single-chip MPEG-2 422P@HL CODEC LSI with multichip configuration for large scale processing beyond the HDTV level, and demonstrates its flexibility and usefulness. VASA is the world's first single-chip full-specs MPEG-2 422P@HL CODEC LSI with a multichip configuration. An LSI was successfully fabricated using the 0.13-µm eight-metal CMOS process. The architecture not only provides an MPEG-2 422P@HL CODEC but also large scale processing beyond the HDTV level for digital cinema and multiview/-angled live TV applications with a multichip configuration. The VASA implementations will lead to a new dimension in future high-quality, high-resolution digital multimedia entertainment.
Automated synthesis of mechanical vibration absorbers using genetic programming
Authors: Jianjun Hu, Erik d. Goodman, Shaobo Li, Ronald Rosenberg
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2008)

Conceptual innovation in mechanical engineering design has been extremely challenging compared to the wide applications of automated design systems in digital circuits. This paper presents an automated methodology for open-ended synthesis of mechanical vibration absorbers based on genetic programming and bond graphs. It is shown that our automated design system can automatically evolve passive vibration absorbers that have performance equal to or better than the standard passive vibration absorbers invented in 1911. A variety of other vibration absorbers with competitive performance are also evolved automatically using a desktop PC in less than 10 h.
Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
Authors: Enrique Garcia-Moreno, Gelasio Salazar
Venue: Journal of Graph Theory (2001)

We show that if G has a minor M with maximum degree at most 4, then the crossing number of G in a surface &Sigma; is at least one fourth the crossing number of M in &Sigma;. We use this result to show that every graph embedded on the torus with representativity r&thinsp;&ge;&thinsp;6 has Klein bottle crossing number at least &lfloor;2r-3&rfloor;2-64. &copy; 2001 John Wiley & Sons, Inc. J Graph Theory 36: 168&ndash;173, 2001
Performance study of data stream approximation algorithms in wireless sensor networks
Authors: Ying Li, Seng W. Lokey, M. V. Ramakrishna
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Reducing amount of data transmitted enables conserving scarce battery power in wireless sensor networks. In our previous work, we propose two data approximation algorithms for data reduction in sensor networks, maintaining the accuracy of query results within certain bounds. In this paper, we provide a performance study and analysis of these algorithms with emphasis on the types of data for which the algorithms are appropriate. We experimented with different data sets to determine the reduction ratios achieved , energy consumed, errors introduced, complexity of query answering obtained.We provide comparison of our algorithms with related methods. The presented results indicate the superiority of our methods in terms of data reduction and accuracy of query results.