ppxscal/embedding_network huggingface dataset:
Telecommunications Stakeholder Perceptions of Teledensity: A Comparison of Stakeholders in the Latin American Region to those in Sub-Saharan Africa
Authors: Victor Mbarika, Peter Meso, Philip Musa
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Prior research has identified specific factors that hinder growth of teledensity in developing countries and specific strategies used to overcome such limitations both in Latin America and in Sub Saharan Africa. Prior research has also reported on the perceptions that telecommunications stakeholders have on how various strategies can inform and assist in the enhancement of teledensity in each of the two continental regions. This study investigates similarities and differences in the telecommunication stakeholders' perspectives of specific strategies used to address teledensity limitations in Latin America as well as in Sub-Saharan Africa. Independent samples of survey participants (Latin America's and Sub- Saharan Africa's telecommunications stakeholders) analyzed the strategies. Using appropriate statistical procedures we examined these stakeholders' perceptions to find areas of commonality and difference in how their perspectives of select strategies. Qualitative comments to support the stakeholders' responses are reported, together with future research implications.
Microarchitectural support for program code integrity monitoring in application-specific instruction set processors
Authors: Yunsi Fei, Z. Jerry Shi
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Program code in a computer system can be altered either by malicious security attacks or by various faults in microprocessors. At the instruction level, all code modifications are manifested as bit flips. In this work, we present a generalized methodology for monitoring code integrity at run-time in application-specific instruction set processors (ASIPs), where both the instruction set architecture (ISA) and the underlying microarchitecture can be customized for a particular application domain. We embed monitoring microoperations in machine instructions, thus the processor is augmented with a hardware monitor automatically. The monitor observes the processor's execution trace of basic blocks at run-time, checks whether the execution trace aligns with the expected program behavior, and signals any mismatches. Since microoperations are at a lower software architecture level than processor instructions, the microarchitectural support for program code integrity monitoring is transparent to upper software levels and no recompilation or modification is needed for the program. Experimental results show that our microarchitectural support can detect program code integrity compromises with small area overhead and little performance degradation.
Aliasing in the AF-GDTFD and the discrete spectrogram
Authors: J. C. O'Neill
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

It has previously been claimed that many of the discrete time-frequency representations (TFRs), including the alias free generalized time-frequency distributions (AF-GDTFD), contain aliasing components. This paper shows that the class of AF-GDTFD does indeed displace both cross term and auto term energy in ways not characteristic of continuous TFRs, but this energy displacement does not satisfy our traditional definition of aliasing. Since the discrete time spectrogram is a member of the class of AF-GDTFD, it will displace energy in ways not characteristic of the continuous spectrogram. This paper creates a procedure by which this energy displacement can be properly understood. Since a discrete time TFR should be periodic in frequency, it is suggested that the displaced energy be interpreted as cross terms across the periodic boundary and not as aliasing.
Protocol Design for Dynamic Delaunay Triangulation
Authors: Dong-Young Lee, Simon S. Lam
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Delaunay triangulation (DT) is a useful geometric structure for networking applications. In this paper we investigate the design of join, leave, and maintenance protocols to construct and maintain a distributed DT dynamically. We define a distributed DT and present a necessary and sufficient condition for a distributed DT to be correct. This condition is used as a guide for protocol design. We present join and leave protocols as well as correctness proofs for serial joins and leaves. In addition, to handle concurrent joins and leaves as well as node failures, we present a maintenance protocol. An accuracy metric is defined for a distributed DT. Experimental results show that our join, leave and maintenance protocols are scalable, and they achieve high accuracy for systems under churn and with node failures. We also present application protocols for greedy routing, clustering, broadcast, and multicast within a radius, and discuss and prove their correctness.
The Hardness of Metric Labeling
Authors: Julia Chuzhoy, Joseph (Seffi) Naor
Venue: SIAM Journal on Computing (2006)

The metric labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set $L$ of labels and a weighted graph $G=(V,E)$. Additionally, a metric distance function on the labels is defined, and for each label and each vertex, an assignment cost is given. The goal is to find a minimum-cost assignment of the vertices to the labels. The cost of the solution consists of two parts: the assignment costs of the vertices and the separation costs of the edges (where each edge pays its weight times the distance between the two labels to which its endpoints are assigned). Due to the simple structure and the variety of applications, the problem and its special cases (with various distance functions on the labels) have recently received much attention. Metric labeling is known to have a logarithmic approximation, and it has been an open question for some time whether a constant approximation exists. We refute this possibility and prove that no constant factor approximation algorithm exists for metric labeling unless P=NP. Moreover, we prove that the problem is $\Omega((\log |V|)^{1/2-\delta})$-hard to approximate for any constant $\delta: 0<\delta<1/2$, unless NP has quasi-polynomial time algorithms.
Testing Techniques for the Cross-platform Migration of Very Large Interactive Applications
Authors: Louis Heymans, Tony Van der Beken, Ben Wilson
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

This case recounts specific application testing techniques that have been used in the real-life cross-platform migration of a large-scale legacy application. In it we review the methodology itself alongside the sociotechnical context of the migration, placing an emphasis on the way that the system's users and software were impacted through the choice of testing method.
Characterization and measurement of TCP traversal through NATs and firewalls
Authors: Saikat Guha, Paul Francis
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

In recent years, the standards community has developed techniques for traversing NAT/firewall boxes with UDP (that is, establishing UDP flows between hosts behind NATs). Because of the asymmetric nature of TCP connection establishment, however, NAT traversal of TCP is more difficult. Researchers have recently proposed a variety of promising approaches for TCP NAT traversal. The success of these approaches, however, depend on how NAT boxes respond to various sequences of TCP (and ICMP) packets. This paper presents the first broad study of NAT behavior for a comprehensive set of TCP NAT traversal techniques over a wide range of commercial NAT products. We developed a publicly available software test suite that measures the NAT's responses both to a variety of isolated probes and to complete TCP connection establishments. We test sixteen NAT products in the lab, and 93 home NATs in the wild. Using these results, as well as market data for NAT products, we estimate the likelihood of successful NAT traversal for home networks. The insights gained from this paper can be used to guide both design of TCP NAT traversal protocols and the standardization of NAT/firewall behavior, including the IPv4-IPv6 translating NATs critical for IPv6 transition.
A complete development environment for image processing applications on adaptive computing systems
Authors: A. C. Moorman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Adaptive computing has always been a topic of great interest, providing a means to automatically map an application to specific hardware. The hardware may be configured to a specific application, thereby providing optimal performance. However, the largest benefit is that this configuration may be performed optimally during program execution. Unfortunately, adaptive computing is a relatively new area of research, therefore imposing serious complications when developing applications for adaptive hardware. This problem limits ACS development to hardware experts, prohibiting application specialists, such as image processing experts, from utilizing these systems. This paper discusses a development environment that can bring the world of ACS application development to the IP expert with minimal hardware knowledge. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Taking a Hard-Line Approach to Encryption
Authors: Cameron Laird
Venue: Computer (2007)

To avoid the loss of sensitive or other important information stored on computers, companies are increasingly adopting hardware-based encryption, which offers faster performance and causes less strain on a host system's processing resources.
Computer assisted assessment of diagrams
Authors: Pete G. Thomas, Neil Smith, Kevin G. Waugh
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

In this paper, we describe an approach to the grading (marking) of graph-based diagrams. The work is an application of a framework for the computer interpretation of imprecise diagrams (which students produce in response to assessment questions). We describe the interpretation framework and how it has been applied in the domain of entity-relationship diagrams used in data modeling. In our approach to grading, student diagrams are compared to specimen solutions representing correct solutions to an assessment question. The comparison between a student diagram and a specimen solution diagram results in a matching of the two diagrams from which a grade is computed. The comparison matching is used to provide graphical feedback on the correctness of the student diagram. The approach has been applied to a test corpus of 394 diagrams produced in answer to an examination question with some good results: 91% of all automatically produced grades were within 0.5 of a mark of the human graders. However, when supertype-subtype associations are present, the performance drops to around 87%. The paper concludes with a discussion of some applications of the marker.
Putting the "Engineering" into Software Engineering with Models
Authors: Brian Berenbach, Sascha Konrad
Venue: Proceedings of the International Workshop on Modeling in Software Engineering (2007)

Models are frequently used for illustrations in software design documents. Commonly they are used to show static structure and less often, external dynamic behavior. However, in software engineering, the lack of conceptual models often inhibits creativity and understanding, which may in turn lead to incomplete or poor design. This paper describes our experience using models for the architectural, conceptual and detailed design for software systems, identifies perceived weaknesses in traditional approaches and makes recommendations for future modeling tools and techniques.
Real-time voice quality guarantee on the IP based networks
Authors: S. M. A. El-Kader, H. S. Eissa, H. A. Baraka
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

A new proposed model has been implemented to guarantee the required voice quality based on the available network resources. Although, the proposed model is so simple from the routers side, it is somehow complex from the host side due to the input analyzing process. On the other hand, the QBone (quality of service backbone) model moves the complexity to the router side. Practically, the QBone model does not face any success because most of the users are not willing to pay much money to have voice sessions across the Internet. So, the proposed model not only guarantees the voice quality but also saves the network resources (up to 74% of the consumed bandwidth).
CWA-solutions for data exchange settings with target dependencies
Authors: Andre Hernich, Nicole Schweikardt
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Data exchange deals with the following problem: given an instance over a source schema, a specification of the relationship between the source and the target,and dependencies on the target, construct an instance over a target schema that satisfies the given relationships and dependencies. Recently - for data exchange settings without target dependencies - Libkin (PODS'06) introduced a new concept of solutions based on the closed world assumption (so calledCWA-solutions), and showed that, in some respects, this new notion behaves better than the standard notion of solutions considered in previous papers on data exchange. The present paper extends Libkin's notion of CWA-solutions to data exchange settings with target dependencies. We show that, when restricting attention to data exchange settings with weakly acyclic target dependencies, this new notion behaves similarly as before: the core is the unique "minimal" CWA-solution, and computing CWA-solutions as well as certain answers to positive queries is possible in polynomial time and can be PTIME-hard. However, there may be more than one "maximal" CWA-solution. And going beyond the class of positive queries, we obtain that there are conjunctive queries with (just) one inequality, for which evaluating the certain answers is coNP-hard. Finally, we consider the EXISTENCE-OF-CWA-SOLUTIONS problem: while the problem is tractable for data exchange settings with weakly acyclic target dependencies, it turns out to be undecidable for general data exchange settings. As a consequence, we obtain that also the EXISTENCE-OF-UNIVERSAL-SOLUTIONS problem is undecidable in genera.
A unified approach of incorporating general features in decision tree based acoustic modeling
Authors: W. Reichl
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

A unified maximum likelihood framework of incorporating phonetic and non-phonetic features in decision tree based acoustic modeling is proposed. Unlike phonetic features, non-phonetic features in this context are those features, which cannot be derived from the phoneme identities. Although non-phonetic features are used in speech recognition, they are often treated separately and based on various heuristics. In our approach, non-phonetic features are included as additional tags to the decision tree clustering. Moreover, the proposed tagged decision tree is based on the full training data, and therefore, it alleviates the problem of training data depletion in building specific feature dependent acoustic models. Experimental results indicate that up to 10% word error rate reduction can be achieved in a large vocabulary (Wall Street Journal) speech recognition task based on the proposed approach.
Implementation of Multimedia Service Mobility in Fix/ Mobile Converged Networks
Authors: Leo Lehmann
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper describes an algorithm which supports multimedia service mobility within a Fix/ Mobile Converged Telecommunications Network. A strong focus is given on the support of profile based multimedia service adaptation. The paper also considers the functional architecture of the Next Generation Network (NGN), which is currently being standardized by the International Telecommunication Union (ITU). A short description of a Generic multimedia service architecture Model including QoS aspects (bandwidth, delay, delay variation) is given, followed by a detailed explanation of the required network entities and the algorithm by itself. Different handover scenarios are considered, including devices with network access of different capabilities within different IP domains.
Continuous medial models in two-sample statistics of shape
Authors: Guido Gerig
Venue:  (2006)

In questions of statistical shape analysis, the foremost is how such shapes should be represented. The number of parameters required for a given accuracy and the types of deformation they can express directly influence the quality and type of statistical inferences one can make. One example is a medial model, which represents a solid object using a skeleton of a lower dimension and naturally expresses intuitive changes such as "bending", "twisting", and "thickening". In this dissertation I develop a new three-dimensional medial model that allows continuous interpolation of the medial surface and provides a map back and forth between the boundary and its medial axis. It is the first such model to support branching, allowing the representation of a much wider class of objects than previously possible using continuous medial methods. A measure defined on the medial surface then allows one to write integrals over the boundary and the object interior in medial coordinates, enabling the expression of important object properties in an object-relative coordinate system. I show how these properties can be used to optimize correspondence during model construction. This improved correspondence reduces variability due to how the model is parameterized which could potentially mask a true shape change effect. Finally, I develop a method for performing global and local hypothesis testing between two groups of shapes. This method is capable of handling the nonlinear spaces the shapes live in and is well defined even in the high-dimension, low-sample size case. It naturally reduces to several well-known statistical tests in the linear and univariate cases.
Delay Test Scan Flip-Flop: DFT for High Coverage Delay Testing
Authors: Gefu Xu, Adit D. Singh
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Scan based delay testing is currently mostly implemented using launch-on-capture (LOC) delay tests. Launch-on-shift (LOS) tests are generally more effective, achieving higher fault coverage with significantly fewer test vectors, but require a fast scan enable, which is not supported by most designs. We present a low cost solution for implementing LOS tests by adding a small amount of logic (six transistors) in each flip-flop to align the slow scan enable signal to the clock edge. Our new design can support full LOS and LOC testing, achieving an average TDF coverage of 92.67% in this combined mode for the ISCAS89 benchmarks. Adding a second slow global scan enable signal also allows mixed LOC/LOS tests, which can further increase coverage up to 94.86% on average for ISCAS89 benchmarks.
A CAD tool for the optimization of video signal processor architectures
Authors: H. Kropp
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper presents a system level design methodology and its implementation in a CAD tool for the optimization of video signal processor (VSP) architectures. These VSPs, consisting of dedicated as well as programmable modules, are highly suitable for performing composite schemes of image processing algorithms under real time constraints, whereas the optimization aims at the most suitable combination of dedicated and programmable modules for the overall system. Nevertheless, in order to apply optimization techniques, it is mandatory to estimate a set of performance measures like execution time and area expense for each module in advance. Based on these performance measures estimated for a finite set of dedicated and programmable modules, the optimization can be carried out. By using mixed integer linear programming as the optimization framework, VSP architectures can be derived, being optimal in terms of chip area and throughput rate.
Theoretical aspects concerning the calculus possibilities of magnetic fluid core coils
Authors: N. C. Popa, A. Siblini, L. Jorat
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The paper investigates the calculus possibilities of coils inductances for the construction of inductive transducers with magnetic fluid (MF) for aerodynamic measurements, acceleration and inclination angle. These transducers have as essential electrical components one or two pairs of identical coils of circular cross section, uniformly wound. The carcasses of every pair of coils have the role of vertical cylindrical reservoir and communicate at the bottom creating a vertical U-shaped tube half filled with MF. The MF has the role of magnetic liquid core for the electrical coils. The paper presents a comparative study between four different calculus methods of the inductance versus the level of MF (one numerical simulation method, and, three different analytical methods based on the images method for a non-homogeneous medium).
Increasing Instruct ion-level Parallelism through Multi-way Branching
Authors: Soo-Mook Moon
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Sequential execution of conditional branches in non-numerical code limits the exploitation of instruction-level parallelism (ILP). In order to cope with this limiation, exploitation of parallelism must be extended to concurrent execution of data and branches in a single cycle. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player