ppxscal/embedding_network huggingface dataset:
A unique insight into department of energy research accomplishments: a special collection
Authors: Mary V. Schorn
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This poster describes online access to a unique collection of Department of Energy (DOE) Research and Development (R&D) accomplishments. The collection features research of DOE and its predecessor agencies, the Energy Research and Development Administration (ERDA) and the Atomic Energy Commission (AEC). This special collection contains historically significant government documents, including items from the Manhattan Project era, that have been specially selected and digitized to make them accessible via the Web. Landmark documents in the collection include The Eightfold Way: A Theory of Strong Interaction Symmetry (authored by Nobel prize winner Murray Gell-Mann) and The First Weighing of Plutonium (authored by Nobel prize winner Glenn Seaborg). In addition to a database of approximately 250 specially-selected documents, all related aspects of the collection (documents, research areas, and/or Nobel Laureate information) are combined in Feature Topic pages for the added value of a single point of access to each compilation. Over sixty (60) Feature Topic pages include diverse topics such as "Video Games - Did They Begin at Brookhaven?" and "Human Genome Research: Decoding DNA". This collection features a large number of DOE-associated Nobel Laureates, including Enrico Fermi, winner of the 1938 Nobel prize in physics, and George Smoot, winner of the 2006 Nobel prize in physics, and showcases a diversity in DOE research areas, including solar energy (with related educational materials) and Radioisotope Thermoelectric Generators (RTGs) that are used to power spacecraft. Easy access to this unique collection is provided via DOE R&D Accomplishments at http://www.osti.gov/accomplishments. This special collection is continually growing, with additional Nobel Laureate and/or research topic documents and features being added on a regular basis.
Eigenvalues, Expanders And Superconcentrators
Authors: N. Alon
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Explicit construction of families of linear expanders and superconcentrators is relevant to theoretical computer science in several ways. There is essentially only one known explicit construction. Here we show a correspondence between the eigenvalues of the adjacency matrix of a graph and its expansion properties, and combine it with results on Group Representations to obtain many new examples of families of linear expanders. We also obtain better expanders than those previously known and use them to construct explicitly n-superconcentrators with 157.4 n edges, much less than the previous most economical construction.
SemGrAM: integrating semantic graphs into association rule mining
Authors: John F. Roddick, Peter Fule
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. This constrains the search for interesting rules to those that satisfy the specified quality metrics as independent values or as higher level concepts of those values. However, in many cases the determination of a single hierarchy is not practicable and, for many datasets, an item's value may be taken from a domain that is more conveniently structured as a graph with weights indicating semantic (or conceptual) distance. Research in the development of algorithms that generate disjunctive association rules has allowed the production of rules such as Radios &or; TVs &rarr; Cables. In many cases there is little semantic relationship between the disjunctive terms and arguably less readable rules such as Radios &or; Tuesday &rarr; Cables can result. This paper describes two association rule mining algorithms, SemGrAMG and SemGrAMP, that accommodate conceptual distance information contained in a semantic graph. The SemGrAM algorithms permit the discovery of rules that include an association between sets of cognate groups of item values. The paper discusses the algorithms, the design decisions made during their development and some experimental results.
Opportunistic Aggregation over Duty Cycled Communications in Wireless Sensor Networks
Authors: Jonathan Benson, Tony O'Donovan, Utz Roedig, Cormac J. Sreenan
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

To implement duty cycles with packet based transceivers, a sender transmits a trail of identical packets (which we call framelets) of which the receiver is able to catch one in its active listening phase. This communication concept is used in the standard low power listening (LPL) protocol shipped with TinyOS 2.x. This existing solution has many shortcomings which result in a very limited network performance. In this paper, we firstly present an alternative framelet based low power listening implementation called Framelet ommunications (FrameComm) that eliminates these shortcomings. Secondly, we present a novel additional improvement to FrameComm - Interception and Aggregation of Framelet Communications (i-FrameComm) - that further improves network performance by opportunistically aggregating packets over the radio channel. A prototype implementation of the proposed FrameComm mechanism in TinyOS 2.02 on TelosB nodes is used for evaluation and comparison. The experiments show that the interception and aggregation method increases network throughput and lifetime as communication resources are used more efficiently.
Electromagnetic radiation measurements at Olympia radio short wave antennae park
Authors: Konstantinos Voudouris, Panagiotis Grammatikakis
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

This paper presents and analyses measurements as well as theoretical calculations of the electromagnetic radiation emitted by a short wave antennae installation of the Greek incumbent Telecom Operator (OTE). The antennae park, named "Olympia Radio", is located in the Prefecture of Ilia in south-western Greece, is consisted of 24 antennae masts, and built in an area of 1.2 km2. The radiation emitted by this installation when worst case scenarios were applied, was well bellow the limits set by European Community legislation, as well as national law.
Seamless Mobility Architecture Supporting Ad-Hoc Environments
Authors: Susana Sargento, Rafael Sarrô, Ricardo Duarte, Patrick Stupar
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The support of ad-hoc networks as extension of infrastructure operator networks is increasing its strength in next generation networks, due to the increasing requirement for ubiquitous access of the users. This paper describes the Ad-hoc network integration mobility architecture being developed inside the IST project Daidalos II. The main purpose of this architecture is to seamlessly support the movement of nodes between ad-hoc and infrastructure networks, maintaining in the ad-hoc networks all the features being supported in the infrastructure. The architecture makes use of and extends IEEE 802.21 and NetLMM IETF concepts for mobility support and integration, and multihoming procedures for multiple gateways support.
Tool Support for Teaching Design Patterns
Authors: Jens Dietrich, Elizabeth Kemp
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Design patterns are programming language and project independent design artefacts that are widely used by professional software engineers. They represent best practise software design. However, the fact that design patterns are highly abstract makes it difficult for undergraduate students to understand and apply them. In this paper, we present DPLab, a tool we have developed to assist students in recognising and comprehending design patterns.
Fair Broadcasting Schedules on Dependent Data in Wireless Environments
Authors: Ming-Te Shih, Chuan-Ming Liu
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In wireless mobile services, data broadcasting provides an effective method to disseminate information to mobile clients. In some applications, the access pattern of all data items can be represented by a weighted DAG. In this paper, we explore how to generate the data broadcast schedule for dependent data, which can be modeled as a weighted DAG, to serve all the mobile clients effectively and fairly. The resulting data broadcast schedules must keep the original dependency and minimizes the variance of latency. We prove that it is NP-complete to find such an optimal solution. Due to the NP-completeness, we provide two heuristics to solve the problem. In additions, we discuss the upper and lower bounds on the variance of latency for the problem.
Envisioning systemic effects on persons and society throughout interactive system design
Authors: Lisa P. Nathan, Batya Friedman, Predrag Klasnja, Shaun K. Kane, Jessica K. Miller
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

The design, development, and deployment of interactive systems can substantively impact individuals, society, and the natural environment, now and potentially well into the future. Yet, a scarcity of methods exists to support long-term, emergent, systemic thinking in interactive design practice. Toward addressing this gap, we propose four envisioning criteria --- stakeholders, time, values, and pervasiveness -- distilled from prior work in urban planning, design noir, and Value Sensitive Design. We characterize how the criteria can support systemic thinking, illustrate the integration of the envisioning criteria into established design practice (scenariobased design), and provide strategic activities to serve as generative envisioning tools. We conclude with suggestions for use and future work. Key contributions include: 1) four envisioning criteria to support systemic thinking, 2) value scenarios (extending scenario-based design), and 3) strategic activities for engaging the envisioning criteria in interactive system design practice.
Credit Token Based Dynamic Resource Renting and Offering Mechanism for Cognitive Radio WRAN BS Spectrum Sharing
Authors: Dan Gao, Jueping Cai, Zan Li, Xing Wei, Rei Chen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

With the development of cognitive radio technologies, dynamic spectrum sharing has become a promising approach to increasing the efficiency of spectrum use. This paper describes dynamic resource renting and offering mechanism for dynamic spectrum sharing in a multi cell context for OFDMA systems. A credit token based mechanism using auctioning is proposed in support of dynamic spectrum sharing between cells. The implementation of mechanism proposed is discussed from the perspective of current IEEE 802.22 standard activities. The mechanism proposed provides the incentive to sharing resources with the advantages of being real time, dynamic and self governance based policy so as to adapt the space time varying spectrum use between cells.
An Efficient Tree-Based Tag Identification Protocol for RFID Systems
Authors: Kuo-Hui Yeh, N. W. Lo, Enrico Winata
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper presents an efficient tree-based query protocol for tag identification in Radio Frequency Identification (RFID) systems. Instead of reducing collisions, our proposed protocol adequately utilizes the advantage of signal collision to fast identify numerous tags simultaneously. From the system efficiency point of view, the performance evaluation shows our proposed protocol achieves almost 200% system efficiency in terms of query times.
Branching and merging in the repository
Authors: Chadd C. Williams, Jaime W. Spacco
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

Two of the most complex operations version control software allows a user to perform are branching and merging. Branching provides the user the ability to create a copy of the source code to allow changes to be stored in version control but outside of the trunk. Merging provides the user the ability to copy changes from a branch to the trunk. Performing a merge can be a tedious operation and one that may be error prone. In this paper, we compare file revisions found on branches with those found on the trunk to determine when a change that is applied to a branch is moved to the trunk. This will allow us to study how developers use merges and to determine if merges are in fact more error prone than other commits.
Cyber-Physical Systems: A New Frontier
Authors: Lui Sha, Sathish Gopalakrishnan, Xue Liu, Qixin Wang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

The report of the President's Council of Advisors on Science and Technology (PCAST) has placed CPS on the top of the priority list for federal research investment [6]. This article first reviews some of the challenges and promises of CPS, followed by an articulation of some specific challenges and promises that are more closely related to the Sensor Networks, Ubiquitous and Trustworthy Computing Conference.
Optimum topological design of simply supported composite stiffened panels via genetic algorithms
Authors: Luigi Iuspa, Eugenio Ruocco
Venue: Computers and Structures (2008)

In the present paper the topological optimal design of isotropic/orthotropic thin structures performed via genetic algorithms is shown. Examples involving structural weight minimization under compressive load or buckling load maximization are presented. A modified finite strip method was developed and used to analyze parametric structures arranged in form of plates or stiffened panels with almost arbitrary cross-section shapes. Specific design variables were defined to assure a robust control over geometrical and topological features. In particular, a semi-analytical formulation for the determination of eigenvalues and eigenvectors was adopted in order to reduce computational efforts requested by the optimization task. A mesh-independent solver, involving a reduced number of degrees of freedom, was implemented and interfaced with a genetic optimizer for the purpose. The optimization procedure was based on a specific bit-masking oriented genetic algorithm, able to handle in parallel different genetic operators expressly conceived to process with proper metrics discrete and continuous design variables. As preliminary example, the buckling load maximization of a metallic plate with an arbitrary grid-shaped cross-section is described first. Then a topological optimization concerning the weight minimization of a composite stiffened panel subject to constraint about buckling load is illustrated and discussed in detail about parametric model definition and genetic procedure.
Estimating local optimums in EM algorithm over Gaussian mixture model
Authors: Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
Venue: Proceedings of the 25th international conference on Machine learning (2008)

EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is not guaranteed to converge to the global optimum. Instead, it stops at some local optimums, which can be much worse than the global optimum. Therefore, it is usually required to run multiple procedures of EM algorithm with different initial configurations and return the best solution. To improve the efficiency of this scheme, we propose a new method which can estimate an upper bound on the logarithm likelihood of the local optimum, based on the current configuration after the latest EM iteration. This is accomplished by first deriving some region bounding the possible locations of local optimum, followed by some upper bound estimation on the maximum likelihood. With this estimation, we can terminate an EM algorithm procedure if the estimated local optimum is definitely worse than the best solution seen so far. Extensive experiments show that our method can effectively and efficiently accelerate conventional multiple restart EM algorithm.
ATSR-2 camera models for the automated stereo photogrammetric retrieval of cloud-top heights-initial assessments
Authors: M. -A. Denis, J. -P. Muller, H. Mannstein
Venue: International Journal of Remote Sensing (2007)

A description of two camera models is given which can be applied to along-track scanning radiometer 2 conical scanner images to provide estimates of cloud-top height and amount. Results are shown of initial quantitative assessments of these camera models and the underlying stereo-matching system applied to cloud-free areas in two different mountainous areas. These results indicate that for cloud-free areas with a sufficiently large range of heights the biases are mostly less than 1 km with standard deviations in the range of 0.31-4.96 km. This is in accordance within the predicted range of 1-2 km from previous theoretical studies.
Embedding cycles and paths in a k-ary n-cube
Authors: Sun-Yuan Hsieh, Tsong-Jie Lin
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The k-ary n-cube, denoted by Qnk, has been one of the most common interconnection networks. In this paper, we study some topological properties of Qnk. Given two arbitrary distinct nodes x and y in Qnk, we show that there exists an x&#x2013;y path of every length from [k/2]n to kn &#x2212; 1, where n &#x2265; 2 is an integer and k &#x2265; 3 is an odd integer. Based on this result, we further show that each edge in Qnk lies on a cycle of every length from k to kn. In addition, we show that Qnk is both bipanconnected and edge-bipancyclic, where n &#x2265; 2 is an integer and k &#x2265; 2 is an even integer.
Some aspects of the labor risk in physiotherapy due to microwaves
Authors: Javier Bilbao, Yolanda Ruiz
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

In physical rehabilitation, physiotherapists can use electrotherapy and radiofrequency diathermy. Microwave diathermy is used in medical therapy to produce local heating in tissue by means of concerting electromagnetic energy into thermal energy. The interaction of the microwave radiation with human beings depends on many parameters. Sometimes, this microwave exposure causes some diseases or disorders both in patients and in the operators of the microwave device, that is to say, the physiotherapist. In order to avoid these disorders, some measures are proposed.
Education for digital stewardship: librarians, archivists or curators?
Authors: Joyce Ray
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The large-scale digital repositories that are emerging today and expected to increase exponentially during this century will require information managers with the skills to archive, preserve, and organize massive amounts of data for use and re-use by a variety of interdisciplinary scholarly communities over time. Where will these managers come from, and what skills will they need? This workshop, organized by the US Institute of Museum and Library Services (IMLS) will address these questions through presentations and discussion among educators and other interested participants. IMLS has invested more than $100 million since 2003 in the education of librarians, archivists and data curators through both formal and continuing education programs. This timely funding has enabled graduate schools of library and information science to reshape their curricula to address the emerging need for digital data managers. Are we prepared to meet the challenge?
An Implementation of Performance-Driven Block and I/O Placement for Chip-Package Codesign
Authors: Ming-Fang Lai, Hung-Ming Chen
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

As silicon technology scales, we can integrate more and more circuits on a single chip, which means more I/Os are needed in modern designs. The flip-chip technology which was developed by IBM is better suited for I/O increase than the typical peripheral wire-bond design.One of the most important characteristics of flip-chip designs is that the I/O buffers could be placed anywhere inside a chip, just like core cells. Motivated by [14] in proposing various I/O planning constraints, we develop a block and I/O buffer placement method in wirelength and signal skew optimization (especially for differential pair signals), and power integrity awareness for chip-package codesign. The results have shown that our approach takes care of power integrity and outperforms [12] in weightedperformance metrics optimization.
A system for secure verification of location claims
Authors: Michelle Graham
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

Location information is playing a larger and larger part within services in today's world and for this reason, users require some way of providing their location which can be trusted by third parties. Until recently, GPS has been accepted as an adequate solution but with user privacy and information security becoming more sensitive issues, a new method of gathering trustworthy location information must be developed. We believe that enlisting the aid of neighbouring devices, while employing proper security measures, provides the basis of such a method, and propose one such method of our own, based upon distance-bounding protected by security protocols.
Online multicast with egalitarian cost sharing
Authors: Moses Charikar, Howard Karloff, Claire Mathieu, Joseph (Seffi) Naor, Michael Saks
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We consider a multicast game played by a set of selfish noncooperative players (i.e., nodes) on a rooted undirected graph. Players arrive one by one and each connects to the root by greedily choosing a path minimizing its cost; the cost of using an edge is split equally among all users using the edge. How large can the sum of the players' costs be, compared to the cost of a "socially optimal" solution, defined to be a minimum Steiner tree connecting the players to the root? We show that the ratio is O(log2 n) and ©(log n), when there are n players. One can view this multicast game as a variant of Online Steiner Tree with a different cost sharing mechanism. Furthermore, we consider what happens if the players, in a second phase, are allowed to change their paths in order to decrease their costs. Thus, in the second phase players play best response dynamics until eventually a Nash equilibrium is reached. We show that the price of anarchy is O(log 3 n) and ©(log n). We also make progress towards understanding the challenging case where arrivals and path changes by existing terminals are interleaved. In particular, we analyze the interesting special case where the terminals fire in random order and prove that the cost of the solution produced (with arbitrary interleaving of actions) is at most O(polylog(n)√n) times the optimum.