ppxscal/embedding_network huggingface dataset:
TEAM STORM: demonstrating an interaction model for working with multiple ideas during creative group work
Authors: Joshua Hailpern, Erik Hinterbichler, Caryn Leppert, Damon Cook, Brian P. Bailey
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Informal design tools can provide immense value during the creative stages of the design process, e.g., by transforming sketches into interactive simulations. Two key limitations of informal and many other design tools are that they do not promote working with multiple design ideas in parallel or collaboration. In this paper, we present a new interaction model that allows a team of designers to work efficiently with multiple ideas in parallel. The model is grounded in theories of creativity and collaboration, and was further informed by observations of creative group work practice. Our interaction model is fully demonstrated within a new system called TEAM STORM. Results from an initial evaluation indicate that design teams are able to effectively utilize our system to create, organize, and share multiple design ideas during creative group work. The benefit of our model is that it demonstrates how many existing single-user design tools can be extended to support working efficiently with multiple ideas in parallel and co-located collaboration.
A Future for Software Engineering?
Authors: Leon J. Osterweil
Venue: 2007 Future of Software Engineering (2007)

This paper suggests the need for a software engineering research community conversation about the future that the community would like to have. The paper observes that the research directions the community has taken in the past, dating at least back to the formative NATO Conferences in the late 1960's, have been driven largely by desire to meet the needs of practice. The paper suggests that the community should discuss whether it is now appropriate to balance this problem-solving-oriented research with a stronger complement of curiosity-driven research. This paper does not advocate what that balance should be. Neither does it advocate what curiosity driven research topics should be pursued (although illustrative examples are oflered). It does does advocate the need for a community conversation about these questions.
The dichotomy of conjunctive queries on probabilistic structures
Authors: Nilesh Dalvi, Dan Suciu
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

We show that for every conjunctive query, the complexity of evaluating it on a probabilistic database is either PTIME or P-complete, and we give an algorithm for deciding whether a given conjunctive query is PTIME or P-complete. The dichotomy property is a fundamental result on query evaluation on probabilistic databases and it gives a complete classification of the complexity of conjunctive queries.
On the estimation of the bandwidth of nonuniformly sampled signals
Authors: T. Strohmer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In many applications signals can only be sampled at nonuniformly spaced points. For a reliable reconstruction of the signal from its samples we require knowledge of the bandwidth of the signal, which however is often not known a priori. Therefore robust and efficient methods are needed that allow one to estimate the bandwidth of a signal from nonuniform spaced, noisy samples. We present two procedures for bandwidth estimation. The first method is based on the discrete Bernstein inequality and Newton's divided differences and is computationally very efficient. The second method requires somewhat more computational effort, since it simultaneously estimates the bandwidth and provides a reconstruction of the signal. It is based on a multi-scale conjugate gradient algorithm for the solution of a nested sequence of Toeplitz systems and is particularly useful in case of noisy data. Examples from various applications demonstrate the performance of the proposed methods.
System-in-Package, a Combination of Challenges and Solutions
Authors: P. Cauvet, S. Bernard, M. Renovell
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

System-in-Package (SiP) has recently become a significant technology in the semiconductor industry, offering to the consumer applications many new product features without increasing the overall form factor. In this talk, the basic SiP concepts are first discussed, showing difference between SiP and SoC, illustrated by some examples, drawn from real-life cases. The specific challenges are considered from the testing point of view, focussing on the assembled yield and defect level for the packaged SiP. Various bare-die test techniques to find known-good-dies are described including their limitations, followed by two techniques to test the SiP at the system level: functional system test and embedded component test. A brief discussion on future SiP design and test challenges concludes the presentation.
How CN and P2P technologies may help build next-generation grids
Authors: Guillaume Pierre
Venue: Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks (2007)

With the evolution of technology, Grids cannot be considered any more solely as a federation of a modest number of powerful cluster computers. Trends show that future Grids will instead be composed of extremely large numbers of individual machines, which may or may not be part of a high-performance cluster. Such evolution forces one to reconsider the design of a number of important Grid services. This paper explores a number of those, and argues that technologies originally developed in the content delivery network and in the peer-to-peer communities may help solve some of the issues that next-generation technologies will face.
Ethernet aggregation and core network models for effcient and reliable IPTV services: Research Articles
Authors: Christian Hermsmeyer, Enrique Hernandez-Valencia, Dieter Stoll, Oliver Tamm
Venue: Bell Labs Technical Journal (2007)

With the growing interest on wireline network architectures for residential triple-play and business Ethernet services there is a renewed demand for efficient and reliable packet-based transport capabilities between the content providers and the end users. Voice and data traffic carried over a variety of access technologies is collected via technology-specific access networks (e.g., digital subscriber line [xDSL], passive optical network [xPON], and wireless fidelity [WiFi]). Metro and core networks need to aggregate the various user flows from different access network nodes and provide scalable and cost-effective distribution of various flow types (e.g., Internet access, voice, video on demand, and broadcast TV services) to the relevant service access points. Varying quality of service and resiliency requirements for these services are being reflected in a new breed of converged Ethernet and optical network elements with capabilities to interwork the bearer-planes of these two networking technologies seamlessly. Network elements based on Ethernet&#x002F;Optical converged technology are able to select the most fitting mechanisms from each networking technology to meet the transport requirements for each individual service demand better while providing significantly enhanced implementation and operational efficiencies. This paper discusses network architecture models and network elements addressing these goals. &copy; 2007 Alcatel-Lucent.
Commutability of Design Pattern Instantiation and Integration
Authors: Jing Dong, Tu Peng, Zongyan Qiu
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Design patterns capture expert design experience in generic design structure and behavior. A design pattern needs to be instantiated before using. It can be integrated with other patterns as well. The instantiation and integration operations are two important operations when a designer uses a design pattern in a particular application. In this paper, we investigate the commutability of these two operations based on our formal specification framework. We provide rigorous proofs on the conditions when the order of these two operations does not matter. Our results enable the software designers to choose their design processes with assurance of their equivalence.
At-Speed Testing of Core-Based System-on-Chip Using an Embedded Micro-Tester
Authors: Matthieu Tuna, Mounir Benabdenbi, Alain Greiner
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

In SoC designs, limited test access to internal cores, low-cost external tester's lack of accuracy and slow frequencies make application of at-speed tests impractical. Therefore, this paper presents an embedded micro-tester for testing IEEE1500-compliant SoCs. In the proposed approach, the test program is no more executed by the external tester but by the embedded micro-tester. Under the control of the embedded SoC microprocessor, the micro-tester executes the test programs stored outside of the SoC in an external memory. The micro-tester supports stuck-at testing as well as both at-speed testing techniques: Launch-On-Last-Shift (LOLS) and Launch-On-Capture (LOC). Using the ITC'02 benchmarks, experimental results are presented: test application time, test data volume and area overhead.
Interaction testing of highly-configurable systems in the presence of constraints
Authors: Myra B. Cohen, Matthew B. Dwyer, Jiangfan Shi
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

Combinatorial interaction testing (CIT) is a method to sample configurations of a software system systematically for testing. Many algorithms have been developed that create CIT samples, however few have considered the practical concerns that arise when adding constraints between combinations of options. In this paper, we survey constraint handling techniques in existing algorithms and discuss the challenges that they present. We examine two highly-configurable software systems to quantify the nature of constraints in real systems. We then present a general constraint representation and solving technique that can be integrated with existing CIT algorithms and compare two constraint-enhanced algorithm implementations with existing CIT tools to demonstrate feasibility.
Generalized hypertree decompositions: np-hardness and tractable variants
Authors: Georg Gottlob, Zoltan Miklos, Thomas Schwentick
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergraphs have bounded GHW are known to be solvable in polynomial time. However,it has been an open problem for several years if for a fixed constant k and input hypergraph H it can be determined in polynomial time whether GHW(H)< k. Here, this problem is settled by proving that even for k=3 the problem is already NP-hard. On the way to this result, another long standing open problem, originally raised by Goodman and Shmueli in 1984 all in the context of join optimization is solved. It is proven that determining whether a hypergraph H admits a tree projection with respect to a hypergraph G is NP-complete. Our intractability results on generalized hypertree width motivate further research on more restrictive tractable hypergraph decomposition methods that approximate general hypertree decomposition (GHD). We show that each such method is dnominated by a tractable decomposition method definable through a function that associates a set of partial edges to a hypergraph. By using one particular such function, we define the new Component Hypertree Decomposition method, which is tractable and strictly more general than other approximations to GHD published so far.
Specification and analysis of timing requirements for real-time systems in the CBD approach
Authors: Ho Kyoung Lee, Woo Jin Lee, Heung Seok Chae, Yong Rae Kwon
Venue: Real-Time Systems (2007)

In real-time software, not only computation errors but also timing errors can cause system failures, which eventually result in significant physical damages or threats to human life. To efficiently guarantee the timely execution of expected functions, it is necessary to clearly specify and formally verify timing requirements before performing detailed system design. With the expected benefit of reusability and extensibility, component technology has been gradually applied to developing industrial applications including real-time systems. However, most of component-based approaches applied to real-time systems lack in a systematic and rigorous approach to specifying and verifying timing requirements at an earlier development stage. This paper proposes a component-based approach to specifying and verifying timing requirements for real-time systems in a systematic and compositional manner. We first describe behaviors of the constituent components including timing requirements in UML diagrams, and then translate the UML diagrams into MTER nets, an extension of TER nets, to perform timing analysis in a compositional way. The merit of the proposed approach is that the specification and analysis results can be reused and independently maintained.
Bisecting a 4-connected graph with three resource sets
Authors: Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
Venue: Discrete Applied Mathematics (2007)

Let G=(V,E) be an undirected graph with a node set V and an arc set E. G has k pairwise disjoint subsets T"1,T"2,...,T"k of nodes, called resource sets, where |T"i| is even for each i. The partition problem with k resource sets asks to find a partition V"1 and V"2 of the node set V such that the graphs induced by V"1 and V"2 are both connected and |V"1@?T"i|=|V"2@?T"i|=|T"i|/2 holds for each i=1,2,...,k. The problem of testing whether such a bisection exists is known to be NP-hard even in the case of k=1. On the other hand, it is known that if G is (k+1)-connected for k=1,2, then a bisection exists for any given resource sets, and it has been conjectured that for k>=3, a (k+1)-connected graph admits a bisection. In this paper, we show that for k=3, the conjecture does not hold, while if G is 4-connected and has K"4 as its subgraph, then a bisection exists and it can be found in O(|V|^3log|V|) time. Moreover, we show that for an arc-version of the problem, the (k+1)-edge-connectivity suffices for k=1,2,3.
Multiresolution joint source-channel coding using embedded constellations for power-constrained time-varying channels
Authors: I. Kozintsev
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We explore joint source-channel coding (JSCC) for time-varying (slow-fading Rayleigh) channels, using a multiresolution (MR) framework for both source coding and transmission (via a novel MR modulation constellation). We tackle the important case of the informed receiver but uninformed transmitter, i.e. where the receiver has access to the channel state information (CSI), but the transmitter does not. We describe an algorithm which jointly optimizes the design of the MR source codebook, the MR constellation, and the decoding strategy of optimally matching the source and signal constellation resolution trees according to the time-varying channel, and show how this leads to improved performance over separately designed source and channel coders.
Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors
Authors: Abhishek Chandra, Micah Adler, Pawan Goyal, Prashant Shenoy
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain weight assignments in multiprocessor environments results in unfairness or starvation in many existing proportional-share schedulers. We present a novel weight readjustment algorithm to translate infeasible weight assignments to a set of feasible weights. We show that weight readjustment enables existing proportional-share schedulers to significantly reduce, but not eliminate, the unfairness in their allocations. We then present surplus fair scheduling, a proportional-share scheduler that is designed explicitly for multiprocessor environments. We implement our scheduler in the Linux kernel and demonstrate its efficacy through an experimental evaluation. Our results show that SFS can achieve proportionate allocation, application isolation and good interactive performance, albeit at a slight increase in scheduling overhead. We conclude from our results that a proportional-share scheduler such as SFS is not only practical but also desirable for server operating systems.
Energy Efficient Robot Rendezvous
Authors: Pawel Zebrowski, Yaroslav Litus, Richard T. Vaughan
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous is minimized. We propose two algorithms that solve this problem. The first method computes an approximate globally optimal meeting point using numerical simplex minimization. The second method is a computationally cheap heuristic that computes a local heading for each robot: by iterating this method, all robots arrive at the globally optimal location. We compare the performance of both methods to a na¨ýve algorithm (center of mass). Finally, we show how to extend the methods with inter-robot communication to adapt to new environmental information.
Robust distant speaker recognition based on position-dependent CMN by combining speaker-specific GMM with speaker-adapted HMM
Authors: Longbiao Wang, Norihide Kitaoka, Seiichi Nakagawa
Venue: Speech Communication (2007)

In this paper, we propose a robust speaker recognition method based on position-dependent Cepstral Mean Normalization (CMN) to compensate for the channel distortion depending on the speaker position. In the training stage, the system measures the transmission characteristics according to the speaker positions from some grid points to the microphone in the room and estimates the compensation parameters a priori. In the recognition stage, the system estimates the speaker position and adopts the estimated compensation parameters corresponding to the estimated position, and then the system applies the CMN to the speech and performs speaker recognition. In our past study, we proposed a new text-independent speaker recognition method by combining speaker-specific Gaussian mixture models (GMMs) with syllable-based HMMs adapted to the speakers by MAP [Nakagawa, S., Zhang, W., Takahashi, M., 2004. Text-independent speaker recognition by combining speaker-specific GMM with speaker-adapted syllable-based HMM. Proc. ICASSP-2004 1, 81-84]. The robustness of this speaker recognition method for the change of the speaking style in close-talking environment was evaluated in (Nakagawa et al., 2004). In this paper, we extend this combination method to distant speaker recognition and integrate this method with the proposed position-dependent CMN. Our experiments showed that the proposed method improved the speaker recognition performance remarkably in a distant environment.
What can rna hybrids tell us about translation?
Authors: Donald Bitzer, Mladen Vouk, Anne Stomp
Venue:  (2006)

Molecular biologists have been observing interactions between messenger RNA (mRNA) molecules and other non-coding RNA molecules for quite some time. Here I revisit some of the classical hybridizations between the 16S ribosomal RNA (rRNA) and mRNA during initiation, as well as investigate the interactions between small interfering RNA (siRNA) molecules and mRNA. In reviewing rRNA-mRNA interactions, I observed that the majority of both bacterial and eukaryote genes can bind at the start codon. This novel result lead to a method for improving genome annotation as well as a new theory of translation initiation. The examination of siRNA-mRNA interactions lead to new criteria for predicting an siRNA's efficacy.
Evaluation of active measurement tools for bandwidth estimation in real environment
Authors: Y. Labit, P. Owezarski, N. Larrieu
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

Available bandwidth - as well as capacity or achievable bandwidth - on a path or a link is one of the very important parameters to measure or estimate in a network: it is of high interest for many networking functions (routing, admission and congestion control, load balancing, etc). Active probing techniques provide the easiest and the more flexible approach, for estimating available bandwidth. In addition, they can be used for different network technologies or structures. Many techniques and tools for available bandwidth estimation appeared recently, but little attention has been given to the accuracy of the estimated values in the real Internet, most of previous studies focusing on validating the accuracy of these tools on local platform. Therefore, this paper deals with evaluating the accuracy of active estimation tools in the real wide area Internet. We use passive monitoring tools for this purpose. We then built a platform combining active and passive equipments, and define a methodology for evaluating active probing techniques using passive tools. The passive evaluation relies on DAG system cards that represent references for such kind of measurements. This paper then discusses the results we got in the different experiments with different tools. In particular, we use traffic generators for changing the characteristics of the traffic on the Internet paths, which we are making our measurements on. It is useful for analyzing the accuracy of active estimation tools according to network and traffic conditions.
High-level capacity performance insights into wireless mesh networking
Authors: D. Chieng, T. G. Hodgkinson, A. Ting, R. Rahim, S. Kawade
Venue: BT Technology Journal (2007)

Despite the increasing interest in wireless mesh networking, it is still unclear how well these systems will scale with increasing user density. Therefore, the aim of this paper is to position mesh network performance within the context of the importance of the mesh-to-access link rate ratio and the number of radios per mesh node when operating the mesh under relatively high traffic loads.
ksh - an extensible high level language
Authors: David G. Korn
Venue: Proceedings of the USENIX 1994 Very High Level Languages Symposium Proceedings on USENIX 1994 Very High Level Languages Symposium Proceedings (1994)

ksh is a high level interactive script language that is a superset of the UNIX system shell. ksh has better programming features and better performance. Versions of ksh are distributed with the UNIX system by many vendors; this has created a large and growing user community in many different companies and universities. Applications of up to 25,000 lines have been written in ksh and are in production use. ksh-93 is the first major revision of ksh in five years. Many of the changes for ksh-93 were made in order to conform to the IEEE POSIX and ISO shell standards. In addition, ksh-93 has many new programming features that vastly extend the power of shell programming. It was revised to meet the needs of a new generation of tools and graphical interfaces. Much of the impetus for ksh-93 was wksh, which allows graphical user interfaces to be written in ksh. ksh-93 includes the functionality of awk, perl, and tcl. Because ksh-93 maintains backward compatibility with earlier versions of ksh, older ksh and Bourne shell scripts should continue to run with ksh-93.