ppxscal/embedding_network huggingface dataset:
Developing Applications and Methodologies for Electronically Facilitated Project Planning: a Coast Guard Case Study
Authors: Lionel Mew, Doctoral Student, William H. Money
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper reports on development of an electronic project planning application and process designed to quickly and easily generate plans. The literature suggests that collaboration, planning and follow-up are major obstacles to project success. During the 1990s, the authors developed a formatting application providing GroupSystems output in MS Project format, and successfully tested it by developing a treaty implementation plan for the Coast Guard. The application worked, but languished because it was cumbersome and constrained by 1990's technology. In 2004, authors were asked to expand the earlier Coast Guard plan. Determined to improve upon their legacy system, they developed a completely new application specifically designed to collaboratively develop project plans, and tested it in development of a new long range plan for the Coast Guard. The opportunity to develop an application without legacy artifacts was an exciting experience. This paper discusses the author's experiences in application and collaborative process development.
Purple crayon: from sketches to interactive environment
Authors: Min Xin, Ehud Sharlin, Mario Costa Sousa, Saul Greenberg, Faramarz Samavati
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Abstract controls often required for gameplay hinder the potential for social interaction, especially in domestic settings. Purple Crayon, an interactive electronic entertainment environment for children, attempts to reclaim the sociable qualities of traditional entertainment occurring in the physical world by replacing abstract controls with intuitive interaction. Purple Crayon allows children to sketch virtual entities and interact with them in a physical manner. The sketched entities become animated and playful and afford interaction within their physical locality or between several localities. Various techniques for physical interaction are explored, demonstrating the feasibility and promise of the approach.
Exploring Adaptive Data Centers through Cooperative Symbiotic Networking
Authors: Paskorn Champrasert, Junichi Suzuki
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

This paper describes a biologically-inspired architecture, called SymbioticSphere, which allows large-scale data centers to autonomously adapt to dynamic environmental changes. SymbioticSphere follows biological principles such as decentralization, natural selection and symbiosis to design data centers (application services and middleware platforms). Each application service and middleware platform is designed as a biological entity and implements biological behaviors such as migration, replication death and energy exchange. Services and platforms cooperatively invoke their behaviors to improve their adaptability. This paper presents a set of behaviors for services and platforms, and describes how services and platforms act and interact with each other. Simulation results show that services and platforms autonomously adapt to dynamic network conditions (e.g., user location, network traffic, and resource availability) by invoking their behaviors suitable for the conditions.
Efficient Skyline and Top-k Retrieval in Subspaces
Authors: Yufei Tao Xiaokui Xiao Jian Pei
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Skyline and top-k queries are two popular operations for preference retrieval. In practice, applications that require these operations usually provide numerous candidate attributes, whereas, depending on their interests, users may issue queries regarding different subsets of the dimensions. The existing algorithms are inadequate for subspace skyline/top-k search because they have at least one of the following defects: 1) They require scanning the entire database at least once, 2) they are optimized for one subspace but incur significant overhead for other subspaces, or 3) they demand expensive maintenance cost or space consumption. In this paper, we propose a technique SUBSKY, which settles both types of queries by using purely relational technologies. The core of SUBSKY is a transformation that converts multidimensional data to one-dimensional (1D) values. These values are indexed by a simple B-tree, which allows us to answer subspace queries by accessing a fraction of the database. SUBSKY entails low maintenance overhead, which equals the cost of updating a traditional B-tree. Extensive experiments with real data confirm that our technique outperforms alternative solutions significantly in both efficiency and scalability.
Analog simulation of two clinical conditions: (1) Acute left ventricle failure; (2) exercise in patient with aortic stenosis
Authors: M. Sever, T. Podnar, F. Runovc, M. Kordaš
Venue: Computers in Biology and Medicine (2007)

A computer analysis of an equivalent electronic circuit is developed. Thus it is possible to simulate the human cardiovascular system, its negative feedback loops (including the control of venous tone, of myocardial contractility, and of heart rate) and negative intrathoracic pressure. If the simulated cardiovascular system is acted upon by various disturbances their consequences can be studied in detail. The consequences of two disturbances are studied by simulation: (i) acute left ventricular failure and (ii) exercise (decreased peripheral resistance) in aortic stenosis. However, prior to the simulation of the latter, a relatively complex condition, two additional procedures are implemented, i.e. simulations of (iii) increased sympathetic tone and of (iv) aortic stenosis are performed. Simulation of exercise (decreased peripheral resistance) in aortic stenosis is also compared with data observed in patients. Results show that, by using the present equivalent circuit, conditions described above can be qualitatively and to some extent quantitatively well simulated.
Reconfiguration of Spanning Trees in Faulty Hypercubes
Authors: Khalid M. Al-Tawil, Dimiter R. Avresky
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Spanning trees have been used extensively in algorithms for hypercube communications and broadcasting. We present algorithms for reconnecting spanning trees and achieving communication among the nonfaulty nodes in the hypercube. The algorithms presented provide reconfiguration for the completely unbalanced spanning tree (CUST), balanced spanning tree (BST), and general spanning tree (GST) in hypercubes in the presence of single node failure. These algorithms can reconfigure around any single fault in 0(1) reconfiguration time with no dilation and will increase the congestion of a link by, at most, one. Simulation results for the algorithms under multiple faults also are presented.
Learning random walks to rank nodes in graphs
Authors: Alekh Agarwal, Soumen Chakrabarti
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalization guarantees. In contrast, Page-rank variants are based on Markovian random walks. For directed graphs, there is no simple known correspondence between these views of scoring/ranking. Recent scalable algorithms for learning the Pagerank transition probabilities do not have generalization guarantees. In this paper we show some correspondence results between the Laplacian and the Pagerank approaches, and give new generalization guarantees for the latter. We enhance the Pagerank-learning approaches to use an additive margin. We also propose a general framework for rank-sensitive score-learning, and apply it to Laplacian smoothing. Experimental results are promising.
Driving by the rear-view mirror: managing a network with cricket
Authors: Jeff R. Allen
Venue: Proceedings of the 1st conference on Conference on Network Administration - Volume 1 (1999)

Cricket is a tool that lets users visualize a set of measurements over time. It was designed to assist network administrators by letting them see and respond to patterns in their network. In this paper, I will describe the need we saw and attempted to resolve by writing Cricket, then describe the solution we came up with. Finally, I will describe some future work we expect to do to make Cricket a more proactive monitoring tool.
Demonstrating the semantic growbag: automatically creating topic facets for faceteddblp
Authors: Jörg Diederich, Wolf-Tilo Balke, Uwe Thaden
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The FacetedDBLP demonstrator allows to search computer science publications starting from some keyword and shows the result set along with a set of facets, e.g., distinguishing publication years, authors, or conferences. Furthermore, it uses GrowBag graphs, i.e., automatically created categorization systems, to create a topic facet, with which a user can characterize the result set in terms of main research topics and filter it according to certain subtopics.
Chance Discovery in Credit Risk Management
Authors: Shinichi Goda, Yukio Ohsawa
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Kyushu Electric Power Co.,Inc. collects different sensor data and weather information to maintain the safety of hydroelectric power plants while the plants are running. In this paper, we consider that the abnormal condition sign may be unusual condition. This paper shows results of unusual condition patterns of bearing vibration detected from the collected different sensor data and weather information by using one class support vector machine. The result shows that our approach may be useful for unusual condition patterns detection in bearing vibration and maintaining hydroelectric power plants.
A Context Middleware Based on Sensor and RFID Information
Authors: Tomas Sanchez Lopez, Daeyoung Kim
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Pervasive computing environments have traditionally used distributed sensors to gather user context. EPC (Electronic Product Code) information extracted from RFID tags could additionally provide identification information associated with that context. However, the process of matching sensor and RFID information around the same context is not a trivial task. In our previous work, we proposed to move the sensors to the same objects that carry the RFID tags. By providing association capabilities among those objects using their EPCs, we can effectively build user and object context information while maintaining a global context identity. In this paper we analyze how the use of the EPC Network could greatly benefit our framework by providing the means for extracting, organizing and querying the context data. Additionally, we outline how services can be offered to the context data producers and how they can be built in a pervasive manner by linking them directly to the EPC Network infrastructure.
Characterization of class-based traffic flows in multiservice IP networks
Authors: I. Atov, R. J. Harris
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Recently, a framework for the development of multiservice IP networks based on a mixture of DiffServ-based QoS management and MPLS-based traffic engineering has been defined. This approach is based on the aggregation of individual flows into classes and on the provisioning of QoS to the class instead of a single flow. With these developments, it is important to model and characterize the traffic flows on a per class basis in order to plan and manage these networks to meet performance objectives (QoS) as required by various traffic classes. This paper addresses the problem of characterizing class-based traffic flows in a multiservice IP network. It provides simple models that can be used to take measurement-based data and translate it into a form that is suitable for implementing dimensioning and planning functions in these networks.
Model-Based Security Vulnerability Testing
Authors: Percy A. Pari Salas, Padmanabhan Krishnan, Kelvin J. Ross
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

In this work we present a model-based framework for security vulnerabilities testing. Security vulnerabilities are not only related to security functionalities at the application level but are sensitive to implementation details. Thus traditional model-based approaches which elide implementation details are by themselves inadequate for testing security vulnerabilities. We propose a framework that retains the advantages of model based testing that exposes only the necessary details relevant for vulnerability testing. We define a three-model framework: a model or specification of the key aspects of the application, a model of the implementation and a model of the attacker, for automatic test case generation. This separation allows the test case generation process to test contexts missed by other model-based approaches. We also describe the key aspects of our tool that generates the tests.
Non-iterative implementation of a class of iterative signal restoration algorithms
Authors: D. O. Walsh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

In this paper, we show that a class of iterative signal restoration algorithms, which includes as a special case the discrete Gerchberg-Papoulis algorithm, can always be implemented directly (i.e. non-iteratively). In the exactly- and over-determined cases, the iterative algorithm always converges to a unique least squares solution. In the under-determined case, it is shown that the iterative algorithm always converges to the sum of a unique minimum norm solution and a term dependent on initial conditions. For the purposes of early termination, it is shown that the output of the iterative algorithm at the rth iteration can be computed directly using a singular value decomposition-based algorithm. The computational requirements of various iterative and non-iterative implementations are discussed, and the effect of the relaxation parameter on the regularization capability of the iterative algorithm is investigated.
Composable Guarded Atomic Actions: a Bridging Model for SoC Design
Authors: Rishiyur S. Nikhil
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

We discuss the approach to concurrency in Bluespec's commercial tools that enable chip designers to deal with complex concurrency, the hallmark of today's systems on a chip. We discuss the basic concurrency model (rules, or guarded atomic actions); modular construction of rules; scheduling into clocked synchronous hardware, including multiple clock domains; non-determinism vs. determinism, and predictability and control of scheduling; and suitability for formal verification. We also discuss the importance of "bridging", i.e., the ability to use the same semantic model both for highlevel specifications and modeling as well as for highquality hardware implementations.
CLAD: a Sensor Management Device forWearable Computing
Authors: Kazuya Murao, Yoshinari Takegawa, Tsutomu Terada, Shojiro Nishio
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

There has been increasing interest in wearable computing. In wearable computing environments, a wearable computer runs various applications with various sensors (wearable sensors). Since conventional wearable systems do not manage the power supply flexibly, they consume excess power resources for unused sensors. Additionally, sensors frequently become unstable for several reasons such as a breakdown. This instability is hard to detect simply from the sensed data. To solve these problems, we propose a new sensor management device CLAD (cross-linkage for assembled devices) that has various functions for power management and sensed-data management. CLAD improves power saving, data accuracy, and operational reliability.
An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
Authors: Liping Jing, Michael K. Ng, Joshua Zhexue Huang
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

This paper presents a new k-means type algorithm for clustering high-dimensional objects in subspaces. In high-dimensional data, clusters of objects often exist in subspaces rather than in the entire space. For example, in text clustering, clusters of documents of different topics are categorized by different subsets of terms or keywords. The keywords for one cluster may not occur in the documents of other clusters. This is a data sparsity problem faced in clustering high-dimensional data. In the new algorithm, we extend the k{\hbox{-}}{\rm{means}} clustering process to calculate a weight for each dimension in each cluster and use the weight values to identify the subsets of important dimensions that categorize different clusters. This is achieved by including the weight entropy in the objective function that is minimized in the k{\hbox{-}}{\rm{means}} clustering process. An additional step is added to the k{\hbox{-}}{\rm{means}} clustering process to automatically compute the weights of all dimensions in each cluster. The experiments on both synthetic and real data have shown that the new algorithm can generate better clustering results than other subspace clustering algorithms. The new algorithm is also scalable to large data sets.
Directed Planar Reachability is in Unambiguous Log-Space
Authors: Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.
Music summarization using key phrases
Authors: B. Logan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Systems to automatically provide a representative summary or 'key phrase' of a piece of music are described. For a 'rock' song with 'verse' and 'chorus' sections, we aim to return the chorus or in any case the most repeated and hence most memorable section. The techniques are less applicable to music with more complicated structure although possibly our general framework could still be used with different heuristics. Our process consists of three steps. First we parameterize the song into features. Next we use these features to discover the song structure, either by clustering fixed-length segments or by training a hidden Markov model (HMM) for the song. Finally, given this structure, we use heuristics to choose the key phrase. Results for summaries of 18 Beatles songs evaluated by ten users show that the technique based on clustering is superior to the HMM approach and to choosing the key phrase at random.
P6 Binary Floating-Point Unit
Authors: Son Dao Trong, Martin Schmookler, Eric. M. Schwarz, Michael Kroener
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

The floating point unit of the next generation PowerPC is detailed. It has been tested at over 5 GHz. The design supports an extremely aggressive cycle time of 13 FO4 using a technology independent measure. For most dependent instructions, its fused multiply-add dataflow has only 6 effective pipeline stages. This is nearly equivalent to its predecessor, the Power 5, even though its technology independent frequency has increased over 70%. Overall the frequency has improved over 100%. It achieves this high performance through aggressive feedback paths, circuit design and layout. The pipeline has 7 stages but data may be fed back to dependent operations prior to rounding and complete normalization. Division and square root algorithms are also described which take advantage of high-precision linear approximation hardware for obtaining a reciprocal or reciprocal square root approximation.
Reduction in PAPR of OFDM system using a revised companding
Authors: Xiao Huang, Jianhua Lu, Junli Zheng
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

We propose a revised companding method to reduce peak-to-average power ratio (PAPR) of the over-sampled OFDM signals. By combining the advantage of the traditional companding and clipping, the proposed method can achieve a large reduction in PAPR with low BER performance. In particular, through studying the complementary cumulative distribution function (CCDF) of the PAPR of an OFDM signal, this paper shows that the proposed method can outperform the previous method substantially.
Precision: Privacy Enhanced Context-Aware Information Fusion in Ubiquitous Healthcare
Authors: Gautham Pallapa, Nirmalya Roy, Sajal Das
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Ubiquitous computing is an emerging paradigm for health care environments in which expedited decision making is of paramount importance. The information obtained from heterogeneous devices in such dynamic environments constitute a high degree of complexity, and emphasize the need for fusion. The realization of context-aware ubiquitous computing exacerbates existing privacy concerns. In this paper, we present Precision, a system for privacy enhanced context-aware information fusion in ubiquitous computing environments. In our scheme, privacy is defined as a set of parameters encapsulated in composite data entities called privons. Precision is an ongoing work, and in this paper, we discuss the overview of Precision and present preliminary results.
Stability Through Synchronization in Nonlinear Multiscale Transformations
Authors: Francesc Ara&grave;ndiga, Rosa Donat
Venue: SIAM Journal on Scientific Computing (2007)

Nonlinear analogues of classical wavelet transformations have been designed within spatially oriented multiresolution frameworks such as Harten&rsquo;s framework [J. Appl. Numer. Math., 12 (1993), pp. 153-193] and the lifting framework [R. L. Claypoole &etal;, IEEE Trans. Image Process., 12 (2003), pp. 1449-1459]. In designing and using nonlinear multiscale transformations for data compression purposes, the main issue is that of ensuring stability. In [J. Appl. Numer. Math., 12 (1993), pp. 153-193], Harten ensures stability by designing a special error-control mechanism that provides estimates for the compression error. In [R. L. Claypoole &etal;, IEEE Trans. Image Process., 12 (2003), pp. 1449-1459] no theoretical results are provided, but the authors argue that stability is a consequence of synchronization between the nonlinear decisions made by the prediction operators in the direct and inverse transformations. By interpreting the nonlinear multiscale transformation of R. L. Claypoole &etal; within Harten&rsquo;s cell-average framework, we are able to provide stability bounds for the scheme of R. L. Claypoole &etal; and establish a theoretical basis for comparison between both nonlinear multiresolution schemes.
From One to Many: Transforming Miramar into a Collaboration Space
Authors: John David Miller, Cindy Pickering
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

The Miramar virtual collaboration environment was originally designed and constructed as a singleuser 3D workspace. Its transformation into a multiuser collaboration workspace - while still retaining its core capabilities - posed major challenges, some anticipated, some empirical. The authors identify the issues faced in this transmogrification, discuss how they were addressed and why, the lessons learned, and remaining challenges.