ppxscal/embedding_network huggingface dataset:
Editor's message
Authors: Christophe Diot
Venue: ACM SIGCOMM Computer Communication Review (2006)

We had 14 submissions for this issue and accepted 2. We are still much below the acceptance rate that we would like to achieve, even when averaging on two or three issues. I can observe a significant increase in the quality and innovation of the papers submitted though. However, because of the very short turn-around (there is generally less than one week to revise papers), we have to reject papers because the work requested by the reviewers is not feasible in such a short time period. We have also received much fewer comments that we would expect. We would love to receive your feedback on the CCR content. Maybe the online CCR community will make is easier (see the end of this editorial).One of the fourteen papers was withdrawn two weeks before notification. We (the editorial board) suspect a beautiful specimen of double submission. So, we take this opportunity to refresh our readers' mind: double submission is not only unethical and forbidden; it is showing very little respect for those who spend time processing and reviewing papers. There are enough publications opportunities these days. No need to submit in parallel unless you have more confidence in the law of large numbers than in the quality of your work to get your papers accepted :-) This issue contains the usual columns. Matthias Grossglauser is offering us his 10 recommended readings, focusing on modeling papers. Do not miss Michalis Faloutsos article, as well as the now usual SIGCOMM community news.You know that CCR is dedicated to bring you the hottest ideas and innovation. Therefore, we are proud to publish the first fully automatically generated paper. The generation tool has been designed by Christian Kreibich and Jon Crowcroft from Cambridge University. As you will see, the result is not perfect, but close. Jon is confident that the tool can bring him a Sigcomm paper within a couple of years. Then, it will be time to automate the reviewing process ...We also re-publish the paper that received this year's test-of-time award. It has been granted to Vern Paxson for "End-to-End Routing Behavior in the Internet," published 10 years ago in SIGCOMM.The CCR online community is currently being stress-tested. It should be available from http://www.acm.org/sigs/sigcomm/ccr/ by the time you read this editorial. Please connect, add content, and send us comments. It is still a prototype and needs improvement. However, improvement will come from you. We can not really do more than what we have now. And please join me to congratulate again Ernst Biersack and Moritz Steiner, from EURECOM (Sophia-Antipolis, FRANCE), for having designed CCR-online.
Addressing interoperability in e-health: an Australian approach
Authors: Zoran Milosevic
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

This paper describes the use of the ISO ODP family of standards [1][2][3] to address interoperability issues in the Australian e-health environment. The Australian health system has a specific institutional structure and funding model involving a combination of federal, state, territory and local government jurisdictions along with the private sector. This arrangement requires a thorough understanding of legislation, regulation and other policies, as well as governance models and the collaborative nature of healthcare businesses to inform the building of interoperable and sustainable IT systems. The aim is to provide better, safer and more efficient service delivery than what current silo-based approaches deliver. The ODP standards provide a valuable conceptual basis for addressing diversity, richness and evolvability of such a complex system, embracing both human actors and IT systems. The ODP Enterprise Language provides core concepts for describing the organisational context for ehealth systems, while the ODP-RM architecture framework allows for the description of various e-health stakeholders' concerns, from organisational, information and technical perspectives. Further value of the standard comes from rigorous conformance and compliance guidelines.
Testing On-Die Process Variation in Nanometer VLSI
Authors: Mehrdad Nourani, Arun Radhakrishnan
Venue: IEEE Design Test (2006)

As device technology progresses toward 45 nm and beyond, the fidelity of process parameter modeling becomes questionable. The authors propose the concept of process variation (PV) testing, which involves applying an innovative fault model and test methodology that uses PV sensing circuitry and frequency domain analysis. Rather than pinpointing the variation of different parameters, the architecture proposed by the authors looks at the effect of PV on a chip indirectly and collectively. The novelty of this architecture is in shifting the strategy of VLSI testing to the frequency domain by using a distributed network of frequency-sensitive sensors such as ring oscillators. This provides an intrinsic advantage by minimizing the effect of noise (signal integrity loss, crosstalk, IR drop, and so on) and by using the powerful concept of digital signal processing for test analysis. The test architecture does not interfere with the rest of the circuit, thus providing freedom to tune the accuracy of PV test by choosing the proper number and type of oscillators.
Localized subspace projection
Authors: E. J. Baranoski, A. Steinhardt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors explore a new data-independent rank-reduction technique, called localized subspace projection (LSP), for adaptive array processing applications. The subspace is determined solely by the desired mainbeam location and width and the a priori knowledge of the array manifold, and is therefore independent of the directional interference environment. Due to the subspace construction, the algorithm provides enhanced sidelobe control over fully adaptive patterns, while still achieving nulling performance comparable with alternative data-adaptive subspace techniques. It was found that the LSP algorithm was sensitive to array manifold errors which distort the array sidelobe pattern, and a scheme for detecting and correcting them is proposed. In addition to enhancing the robustness of the LSP technique, this detection/correction process provides a blind calibration capability (unavailable for data-adaptive subspaces) which reveals the actual (i.e. distorted) array manifold without any knowledge of the interference environment.
WORKPAD: an Adaptive Peer-to-Peer Software Infrastructure for Supporting Collaborative Work of Human Operators in Emergency/Disaster Scenarios
Authors: Massimo Mecella, Michele Angelaccio, Alenka Krek, Tiziana Catarci, Berta Buttarazzi, Schahram Dustdar
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

The system presented in the paper is the main result of an on-going European research project WORKPAD (IST- 2005-5-034749) that aims at building and developing an innovative software infrastructure (software,models, services, etc.) for supporting collaborative work of human operators in emergency/disaster scenarios. In such scenarios, different teams, belonging to different organizations, need to collaborate each other to reach a common goal; each team member is equipped with handheld devices (PDAs) and communication technologies, and should carry on specific tasks. In such a way we can consider the whole team as carrying on a process (macro-process), and the different teams (of the different organizations) collaborate through the interleaving of all the different processes. The idea is to investigate a 2-level framework for such scenarios: a back-end peer-to-peer community, providing advanced services requiring high computational power, data-knowledge-content integration, and a set of front-end peer-to-peer communities, that provide services to human workers, mainly by adaptively enacting processes on mobile ad-hoc networks.
FIR Kramers-Kronig transformers for relaxation data conversion
Authors: Vairis Shtrauss
Venue: Signal Processing (2006)

It is shown that relaxation data conversion by the Kramers-Kronig (KK) relations can be treated as a filtering problem of band-unlimited relaxation signals in the Mellin transform domain. Based on this concept, KK relations are implemented in the form of FIR filters with the logarithmic sampling. It is demonstrated that KK transformers have sampling rate dependent impulse and frequency responses and only calculation of the imaginary part from the real part can be implemented by a computationally realisable filter. The performance of different types of transformers is studied.Approximately inversely proportional relationship is established between the error and the frequency range of input signal used for computing an output sample. It is found that transformers with even number of coefficients provide better performance than those having an odd number if input data are available within a frequency range wider than four decades. Usage of additional transformers with the shifted or shortened impulse responses is investigated for eliminating shortening of usable output sequence due to filter delay. The simulation results are provided for an elementary relaxation system (a single Debye relaxation) and systems described by the Havriliak-Negami dispersion relation. Some known numerical KK transform techniques are analysed in the functional filtering context.
A real-time model-based human motion analysis system
Authors: Chung-Lin Huang, Chia-Ying Chung
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper introduces a real time model-based human motion analysis system using two orthogonal views. The goal of the system is to analyze the motion of the human object without using any markers on the object. The system will generate the corresponding body definition parameters (BDPs) and body animation parameters (BAPs) defined by MPEG-4. With the BDPs and a sequence of BAPs, a real-time virtual actor can be synthesized on various platforms.
Neural Substrates of Perceptual Enhancement by Cross-Modal Spatial Attention
Authors: John J. Mcdonald, Wolfgang A. Teder-sälejärvi, Francesco Di Russo, Steven A. Hillyard
Venue: Journal of Cognitive Neuroscience (2003)

Orienting attention involuntarily to the location of a sudden sound improves perception of subsequent visual stimuli that appear nearby. The neural substrates of this cross-modal attention effect were investigated by recording event-related potentials to the visual stimuli using a dense electrode array and localizing their brain sources through inverse dipole modeling. A spatially nonpredictive auditory precue modulated visual-evoked neural activity first in the superior temporal cortex at 120 &ndash; 140 msec and then in the ventral occipital cortex of the fusiform gyrus 15 &ndash; 25 msec later. This spatio-temporal sequence of brain activity suggests that enhanced visual perception produced by the cross-modal orienting of spatial attention results from neural feedback from the multimodal superior temporal cortex to the visual cortex of the ventral processing stream.
A Formal Model of Lower System Layers
Authors: Julien Schmaltz
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

We present a formal model of the bit transmission between registers with arbitrary clock periods. Our model considers precise timing parameters, as well as metastability. We formally define the behavior of registers over time. From that definition, we prove, under certain conditions, that data are properly transmitted. We discuss how to incorporate the model in a purely digital model. The hypotheses of our main theorem define conditions that must be satisfied by the purely digital part of the system to preserve correctness.
Reconstruction of convex polyominoes from orthogonal projections of their contours
Authors: C. Picouleau
Venue: Theoretical Computer Science (2005)

The problem of reconstructing a convex polyominoes from its horizontal and vertical projections when the projections are defined as the number of cells of the polyomino in the different lines and columns was studied by Del Lungo and M. Nivat. In this paper, we study the reconstruction of any convex polyomino when the orthogonal projections are defined as the contour length of the object intercepted by the ray. We prove the NP-hardness of this problem for several classes of polyominoes: general, h-convex, v-convex. For hv-convex polyominoes we give a polynomial time algorithm for the reconstruction problem.
Memory of Ordinal Number Categories in Macaque Monkeys
Authors: Tanya Orlov, Daniel J. Amit, Volodya Yakovlev, Ehud Zohary, Shaul Hochstein
Venue: Journal of Cognitive Neuroscience (2006)

What mechanism underlies serial order memory? Studying preverbal serial memory shows that macaque monkeys reproducing a sequence of items can acquire knowledge of item ordinal position. In our previous experiment, macaques were repeatedly presented with image lists (first shown sequentially and then simultaneously on a touch screen together with a distractor chosen randomly from other lists). The task was to touch list images in the correct order. The monkeys' natural tendency was to categorize images by their ordinal position or number because their most common error was touching the distractor when it had the same ordinal number (in its own list) as the correct image. Item-to-item associations were used to complete the categorization strategy. Proposing a dynamic image-salience hypothesis for serial recall (based on category-to-image influence and a salience computation for identifying touch targets), we now study the category label characteristics in the context of this hypothesis. <*****br/>We found that these category labels are absolute, ordinal-number-based categories (first, second, etc.), not relative memorized as relative distance from the beginning and the end of the list, and not based on fixed ranking of reward contingency/image familiarity. Even isolated from item&ndash;item associations, the categories demonstrate category tuning (as well as the corresponding overlap of adjacent ordinal number codes). Moreover, monkeys choose images by proximity of their category to the current touch number, irrespective of the accuracy of the preceding choice. Category tuning itself is symmetric relative to correct ordinal position, but is skewed by other factors (reward, etc.). Tuning width increases with list length, with a concurrent increased use of item-to-item associations for determining touch order.
Resource Sharing Combined with Layout Effects in High-Level Synthesis
Authors: Junhyung Um, Taewhan Kim
Venue: Journal of VLSI Signal Processing Systems (2006)

In deep-submicron designs, the interconnects are equally as or more important than the logic gates. In particular, to achieve timing closure, it is necessary and critical to consider the interconnect delay at an early stage of the synthesis process. It has been known that resource sharing in high-level synthesis is one of the major synthesis tasks which greatly affect the final synthesis/layout results. In this paper, we propose a new layout-aware resource sharing approach to overcome some of the limitations of the previous works in which the effects of layout on the synthesis have never been taken into account or considered in local and limited ways, or whose computation time is excessively large. The proposed approach consists of two steps: (Step 1) We relax the integrated resource sharing and placement into an efficient linear programming (LP) formulation based on the concept of $discretisizing$ placement space; (Step 2) We derive a feasible solution from the solution obtained in Step 1. Then, we employ an iterative mechanism based on the two steps to tightly integrate resource sharing and placement tasks so that the slack time violation due to interconnect delay (determined by placement) as well as logic delay (determined by resource sharing) should be minimized. From experiments using a set of benchmark designs, it is shown that the approach is effective, and efficient, completely removing the slack time violation produced by conventional methods.
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
Authors: Olivier Danvy, Henning Korsholm Rohde
Venue: Information Processing Letters (2006)

We present the first derivation of the search phase of the Boyer-Moore string-matching algorithm by partial evaluation of an inefficient string matcher. The derivation hinges on identifying the bad-character-shift heuristic as a binding-time improvement, bounded static variation. An inefficient string matcher incorporating this binding-time improvement specializes into the search phase of the Horspool algorithm, which is a simplified variant of the Boyer-Moore algorithm. Combining the bad-character-shift binding-time improvement with our previous results yields a new binding-time-improved string matcher that specializes into the search phase of the Boyer-Moore algorithm.
A Pattern based Model Evolution Approach
Authors: Soon-Kyeong Kim, David Carrington
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

In this paper, we present a framework for patternbased model evolution approaches in the MDA context. In the framework, users define patterns using a pattern modeling language that is designed to describe software design patterns, and they can use the patterns as rules to evolve their model. In the framework, design model evolution takes place via two steps. The first step is a binding process of selecting a pattern and defining where and how to apply the pattern in the model. The second step is an automatic model transformation that actually evolves the model according to the binding information and the pattern rule. The pattern modeling language is defined in terms of a MOF-based role metamodel, and implemented using an existing modeling framework, EMF, and incorporated as a plugin to the Eclipse modeling environment. The model evolution process is also implemented as an Eclipse plugin. With these two plugins, we provide an integrated framework where defining and validating patterns, and model evolution based on patterns can take place in a single modeling environment.
Implementing a proximal algorithm for some nonlinear multicommodity flow problems
Authors: Adam Ouorou
Venue: Networks (2007)

In this article, we consider applying a proximal algorithm introduced by Ouorou to some convex multicommodity network flow minimization problems. This algorithm follows the characterization of saddle points introduced earlier but can be derived from Martinet's proximal algorithm. In the primal space, the algorithm can be viewed as a regularized version of the projection algorithm by Rosen. A remarkable feature of the algorithm is that the projection step for multicommodity flow problems reduces to solving independent linear systems (one for each commodity) involving the node-arc incidence matrix of the network. The algorithm is therefore amenable to parallel implementation. We present some numerical results on large-scale routing problems arising in telecommunications and quadratic multicommodity flow problems. A comparison with a specialized code for multicommodity flow problems indicates that this proximal algorithm is specially designed for very large-scale instances. &copy; 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 18&ndash;27 2007
A Case Study on the Impact of Customer Communication on Defects in Agile Software Development.
Authors: Mikko Korkala, Pekka Abrahamsson, Pekka Kyllonen
Venue: Proceedings of the conference on AGILE 2006 (2006)

Effective communication and feedback are crucial in agile development. Extreme Programming (XP) embraces both communication and feedback as interdependent process values which are essential for projects to achieve successful results. Our research presents the empirical results from four different case studies. Three case studies had partially onsite customers and one had an onsite customer. The case studies used face-to-face communication to different extents along with email and telephone to manage customer-developer communication inside the development iterations. Our results indicate that an increased reliance on less informative communication channels results in higher defect rates. These results suggest that the selection of communication methods, to be used inside development iterations, should be a factor of considerable importance to agile organizations working with partially available customers. This paper also proposes some guidelines for selecting proper communication methods.
An improvement of the tree code construction
Authors: Marcin Peczarski
Venue: Information Processing Letters (2006)

An improvement of the randomized construction for tree codes is presented. This construction, in contrary to the original one, almost surely gives a good code and uses smaller alphabet.
Importance sampling with skew-normal distributions
Authors: Tim Swartz
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This presentation considers integral approximation via importance sampling where the importance sampler is chosen from the family of skew-normal distributions. This is a wider class of distributions than is typically considered in importance sampling applications. We describe variate generation and propose adaptive methods for fitting a member of the skew-normal family to a particular integral.
A decision model for selecting slightly non-homogeneous technologies
Authors: Reza Farzipoor Saen
Venue: Applied Mathematics and Computation (2006)

Technology selection is an important component of management of technology. The assumption of classical technology selection models is based on complete homogeneity of technologies. The objective of this paper is to propose an innovative method for selecting slightly non-homogeneous technologies. A numerical example demonstrates the application of the proposed method.
Robust rate adaptation for 802.11 wireless networks
Authors: Starsky H. Y. Wong, Hao Yang, Songwu Lu, Vaduvur Bharghavan
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploiting the multi-rate capability at the physical layer.I n this paper, we conduct a systematic and experimental study on rate adaptation over 802.11 wireless networks. Our main contributions are two-fold. First, we critique five design guidelines adopted by most existing algorithms. Our study reveals that these seemingly correct guidelines can be misleading in practice, thus incur significant performance penalty in certain scenarios. The fundamental challenge is that rate adaptation must accurately estimate the channel condition despite the presence of various dynamics caused by fading, mobility and hidden terminals. Second, we design and implement a new Robust Rate Adaptation Algorithm (RRAA)that addresses the above challenge. RRAA uses short-term loss ratio to opportunistically guide its rate change decisions, and an adaptive RTS filter to prevent collision losses from triggering rate decrease. Our extensive experiments have shown that RRAA outperforms three well-known rate adaptation solutions (ARF, AARF, and SampleRate) in all tested scenarios, with throughput improvement up to 143%.