ppxscal/embedding_network huggingface dataset:
The p-step iterative algorithm for a system of generalized mixed quasi-variational inclusions with (H,η)-monotone operators
Authors: Jian-Wen Peng, Dao-Li Zhu
Venue: Journal of Global Optimization (2007)

In this paper, we introduce and study a new system of generalized mixed quasi-variational inclusions with (H,¿)-monotone operators which contains variational inequalities, variational inclusions, systems of variational inequalities and systems of variational inclusions in the literature as special cases. By using the resolvent technique for the (H,¿)-monotone operators, we prove the existence of solutions and the convergence of some new p-step iterative algorithms for this system of generalized mixed quasi-variational inclusions and its special cases. The results in this paper unifies, extends and improves some known results in the literature.
Panel on US-Mexico Cooperative Activities in Computer Science and Engineering
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The five principal investigators (PIs) of the graphics and visualization center, a distributed NSF science and technology center, report on the lessons learned from reaching an interactive graduate-level seminar involving their five sites over a high-end communications infrastructure. The experiences related will be of value to institutions presently conducting or considering distance learning. Although the experiences reported here are based an a high-end scenario available to this research center, the present trends in technology and distance education should make these observations applicable in the imminent future to a large number of educational institutions. 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
Global memory management for a multi computer system
Authors: Dejan Milojicic, Steve Hoyle, Alan Messer, Albert Munoz, Lance Russell, Tom Wylegala, Vivekanand Vellanki, Stephen Childs
Venue: Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4 (2000)

In this paper, we discuss the design and implementation of fault-aware Global Memory Management (GMM) for a multikernel architecture. Scalability of today's systems is limited by SMP hardware, as well as by the underlying commodity operating systems (OS), such as Microsoft Windows or Linux. High availability is limited by insufficiently robust software and by hardware failures. Improving scalability and high availability are the main motivations for a multikernel architecture, and GMM plays a key role in achieving this. In our design, we extend the underlying OS with GMM supported by a set of software failure recovery modules in the form of device drivers. While the underlying OS manages the virtual address space and the local physical address space, the GMM module manages the global physical address space. We describe the GMM design, prototype implementation, and the use of GMM.
Unauthorized copying of software: an empirical study of reasons for and against
Authors: Mikko T. Siponen, Tero Vartiainen
Venue: ACM SIGCAS Computers and Society (2007)

Computer users copy computer software - this is well-known. However, less well-known are the reasons why some computer users choose to make unauthorized copies of computer software. Furthermore, the relationship linking the theory and the practice is unknown, i.e., how the attitudes of ordinary end-users correspond with the theoretical views of computer ethics scholars. In order to fill this gap in the literature, we investigated the moral attitudes of 249 Finnish computing students towards the unauthorized copying of computer software, and we then asked how these results compared with the theoretical reasons offered by computer ethics scholars. The results shed a new light on students' moral attitudes with respect to the unauthorized copying of software. In particular, this new knowledge is useful for computer ethics teachers, and for organizations seeking to combat this practice.
Secure Anonymous Union Computation Among Malicious Partners
Authors: Stefan Bottcher, Sebastian Obermeier
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

When applications require a union calculation of different distributed datasets, two requirements are often necessary to fulfill: anonymity and security. Anonymity means for scenarios with more than 2 participants that the owner of a certain data item cannot be identified. Security means that no participant can prevent that data items of other participants will be included in the union set. In this paper, we present a union protocol that guarantees both properties: anonymity and security even if participants act malicious, i.e. to modify messages or change the protocol. We prove the correctness of protocol and give experimental results that show the applicability of our protocol in a common environment.
Reconciling Synthesis and Decomposition: A Composite Approach to Capability Identification
Authors: Ramya Ravichandar, James D. Arthur, Robert P. Broadwater
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Stakeholders' expectations and technology constantly evolve during the lengthy development cycles of a largescale computer based system. Consequently, the traditional approach of baselining requirements results in an unsatisfactory system because it is ill-equipped to accommodate such change. In contrast, systems constructed on the basis of Capabilities are more change-tolerant; Capabilities are functional abstractions that are neither as amorphous as user needs nor as rigid as system requirements. Alternatively, Capabilities are aggregates that capture desired functionality from the users' needs, and are designed to exhibit desirable software engineering characteristics of high cohesion, low coupling and optimum abstraction levels. To formulate these functional abstractions we develop and investigate two algorithms for Capability identification: Synthesis and Decomposition. The synthesis algorithm aggregates detailed rudimentary elements of the system to form Capabilities. In contrast, the decomposition algorithm determines Capabilities by recursively partitioning the overall mission of the system into more detailed entities. Empirical analysis on a small computer based library system reveals that neither approach is sufficient by itself. However, a composite algorithm based on a complementary approach reconciling the two polar perspectives results in a more feasible set of Capabilities. In particular, the composite algorithm formulates Capabilities using the cohesion and coupling measures as defined by the decomposition algorithm and the abstraction level as determined by the synthesis algorithm.
HP caliper: an architecture for performance analysis tools
Authors: Robert Hundt
Venue: Proceedings of the 1st conference on Industrial Experiences with Systems Software - Volume 1 (2000)

HP Caliper is an architecture for software developer tools that deal with executable (binary) programs. It provides a common framework that allows building of a wide variety of tools for doing performance analysis, profiling, coverage analysis, correctness checking, and testing. HP Caliper uses a technology known as dynamic instrumentation, which allows program instructions to be changed on-the-fly with instrumentation probes. Dynamic instrumentation makes HP Caliper easy to use: It requires no special preparation of an application, supports shared libraries, collects data for multiple threads, and has low intrusion and overhead. This paper describes HP Caliper for HP-UX, running on the IA-64 (Itanium) processor. It describes Caliper's architecture, dynamic instrumentation algorithm, and the experiences gathered during its implementation.
An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity
Authors: Kei Uchizawa, Eiji Takimoto
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

A complexity measure for threshold circuits, called the energy complexity, has been proposed to measure an amount of energy consumed during computation in the brain. Biological neurons need more energy to transmit a "spike" than not to transmit one, and hence the energy complexity of a threshold circuit is defined as the number of gates in the circuit that output "1" during computation. Since the firing activity of neurons in the brain is quite sparse, the following question arises: what Boolean functions can or cannot be computed by threshold circuits with small energy complexity. In the paper, we partially answer the question, that is, we show that there exists a tradeoff among three complexity measures of threshold circuits: the energy complexity, size, and depth. The tradeoff implies an exponential lower bound on the size of constant-depth threshold circuits with small energy complexity for a large class of Boolean functions.
Network Traffic Invariant Characteristics: Metering Aspects
Authors: Vladimir Zaborovsky, Andrey Rudskoy, Alex Sigalov
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Many fundamental important questions regarding Internet behavior are still remained unexplored. This paper considers some important metering issues "on which time-scale traffic characteristics are stationary, and do TCP attractor exit". The answer to the questions has important practical implication for traffic control strategy and design of the protocols. The goal of this paper is the analysis of time invariant feature of traffic collected in local and global computer networks. Proposed approach investigates processes caused by elastic dynamics of the virtual TCP connection and characteristic of measurement processes that can be used to improve accuracy of measurement.
Multi-paradigm network modeling framework
Authors: Rajive Bagrodia
Venue:  (2006)

Network evaluation tools are indispensable in design and developments of computer networks and their distributed applications. Traditionally, such tools have been developed based on an analytical model, discrete event simulation, emulation or a physical testbed of computer network. As computer networks grow in scale, heterogeneity and deploy a rich variety of new applications, none of the above four network modeling methodologies can fulfill the complex users requirements including scalability, fidelity, reconfigurability and experimentation support for real application, needed in the network evaluation studies. In this dissertation, we developed a novel multi-paradigm network modeling framework, which address the limitations of existing evaluation tools by the integrations of modeling methodologies with complementary capabilities. As the first step, we developed MAYA, a modeling tool integrating analytical models, simulation, and physical network interface. MAYA allows users to interface simulated networks directly with physical networks, while attaining real time constraints even for large-scale networks by incorporating both analytical models and simulation. It thus provides a scalable and extensible evaluation tool for distributed applications to run on large, heterogeneous networks. To further enrich the modeling compatibilities of the proposed multi-paradigm framework, we developed TWINE, a hybrid emulation testbed that combines simulation, emulation and physical networks for evaluation of adaptive wireless systems, particularly those exploiting cross layer interactions. The integration of emulation and simulation in TWINE enables evaluation of real applications and protocols over a wide range of wireless network scenarios while achieving scalability of the testbed. Interfacing with real networks, TWINE also allows users to directly leverage existing, partially deployed physical testbeds and extend the performance evaluation to a larger-scaled networking context. We have conducted experiments to evaluate the proposed multi-paradigm network modeling framework with respect to multiple performance metrics: Firstly, we evaluated the scalability improvements achieved by the integrations of multiple modeling methodologies; secondly, we evaluate the fidelity of the proposed framework in terms of accurately modeling the impact of various network dynamics on actual applications in real time; finally, we conducted case studies to demonstrate the utility of the proposed modeling framework in supporting repeatable, flexible and efficient experimentations with protocol implementations and applications in large heterogeneous networks.
Packet Loss Recovery Schemes for Peer-to-Peer Video Streaming
Authors: B. Akabri, H. R. Rabiee, M. Ghanbari
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

One of the man concerns of peer-to-peer video streaming over the internet is the cumulative impact of the Internet packet loss due to the decoding dependency of the compressed video frames. In this paper we study the efficiency of various packet loss recovery policies that can be used in peer-to-peer streaming. Our analytical and simulation results show how different packet loss recovery policies can be effective for peer-topeer video streaming.
High-speed & Low Area Hardware Architectures of the Whirlpool Hash Function
Authors: Máire McLoone, Ciaran McIvor
Venue: Journal of VLSI Signal Processing Systems (2007)

High-speed and low area hardware architectures of the Whirlpool hash function are presented in this paper. A full Look-up Table (LUT) based design is shown to be the fastest method by which to implement the non-linear layer of the algorithm in terms of logic. An unrolled Whirlpool architecture implemented on the Virtex XC4VLX100 device achieves a throughput of 4.9 Gbps. This is faster than a SHA-512 design implemented on the same device and other previously reported hash function architectures. A low area iterative architecture, which utilises 64-bit operations as opposed to full 512-bit operations, is also described. It runs at 430 Mbps and occupies 709 slices on a Virtex X4VLX15. This proves to be one of the smallest 512-bit hash function architectures currently available.
Sketch Interpretation Using Multiscale Models of Temporal Patterns
Authors: Tevfik Metin Sezgin, Randall Davis
Venue: IEEE Computer Graphics and Applications (2007)

The growing popularity of tablet PCs and intelligent pen-based interfaces have increased the importance of freehand sketch recognition algorithms as enabling technology. A recognition framework based on multiscale statistical models of temporal patterns significantly increases correct recognition rates, with no added computational penalties.
Ontology-Directed Generation of Frameworks for Pervasive Service Development
Authors: C. Consel, W. Jouve, J. Lancia, N. Palix
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Pervasive computing applications are tedious to develop because they combine a number of problems ranging from device heterogeneity, to middleware constraints, to lack of programming support. In this paper, we present an approach to integrating the ontological description of a pervasive computing environment into a programming language, namely Java. From this ontological description of a pervasive computing environment, a framework is automatically generated. It provides the developer with dedicated programming support to manage, discover and invoke services. Besides, it performs a number of verifications both at compile and run time, ensuring the robustness of applications.
Envisioning knowledge: tightly coupling knowledge analysis and visualization
Authors: Katy Boerner
Venue:  (2006)

Analysis and visualization techniques share a symbiotic relationship when it comes to making sense of datasets. Particularly for large datasets, the coupling of data analysis and data visualization is often beneficial. While a gamut of data analysis and visualization techniques exist, it is often problematic to identify what combination of techniques is good for what task to provide maximum insight into a dataset. This dissertation introduces, exemplifies and validates a Data Analysis and Visualization Taxonomy, called 'DA-Vis taxonomy', that provides guidance to the selection of complementary analysis and visualization techniques. The DA-Vis taxonomy is validated by demonstrating its utility to develop new visualizations for real world applications. Further, the new taxonomy is applied to systematically describe and classify couplings of data analysis and visualization techniques in prior work. A user-study that evaluates the usability of the DA-Vis taxonomy was also conducted and is reported here. The intellectual contributions of this dissertation include a flexible DA-Vis layout schema that can be used to tightly couple complementary data analysis and visualization techniques. This dissertation also shows a visionary computational diagnostic tool developed for data analysis and visualization of clinical data. Techniques used to generate meaningful knowledge management visualizations from a dataset are presented as a part of this dissertation. This dissertation concludes with a discussion of the broader impacts of the DA-Vis taxonomy, the computational diagnostic tool, and knowledge management maps.
Performance analysis of a file delivery system based on the FLUTE protocol: Research Articles
Authors: Jani Peltotalo, Sami Peltotalo, Jarmo Harju, Rod Walsh
Venue: International Journal of Communication Systems (2007)

This paper presents the results of performance tests carried out for a file delivery system based on the file delivery over unidirectional transport (FLUTE) protocol. FLUTE is a file transport protocol used to deliver files over IP networks, including the Internet and unidirectional systems, from a sender to one or more receivers. FLUTE uses UDP, an unreliable transport protocol, and so reliable delivery must be guaranteed by other means. This paper shows how FLUTE manages to recover from packet losses using forward path redundancy (forward error correction (FEC) and repeat transmissions in a data carousel), and a simple HTTP-based point-to-point file repair scheme which is specified in 3GPP and DVB standards. The results presented in this paper show that careful optimization of FEC overhead, and the number of repeat transmissions, gives the best system performance in most cases. Based on the simplified error reception and distribution model depicted in this study, it is illustrated that the simple client-server point-to-point file repair is optimal only for small groups. Several options to improve the configuration of FLUTE senders are provided, to deliver reception guarantees with optimal data expense from the system point of view. Copyright &copy; 2006 John Wiley & Sons, Ltd.
An adaptive-search residual vector quantizer for airborne reconnaissance
Authors: S. E. Budge
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A lossy image compression algorithm designed for high-speed, high quality data applications is described. The algorithm consists of a vector quantizer followed by a modified Huffman entropy encoder. The quantizer is a mean-removed, adaptive-search, residual vector quantizer. A few details of a high-speed hardware implementation for reconnaissance are given, as well as an example of the performance of two variations of the algorithm.
Empirical Study on the Evolution of PlanetLab
Authors: Li Tang, Yin Chen, Fei Li, Hui Zhang, Jun Li
Venue: Proceedings of the Sixth International Conference on Networking (2007)

PlanetLab is a globally distributed overlay platform that has been increasingly used by researchers to deploy and assess planetary-scale network services. This paper analyzes some particular advantages of PlanetLab, and then investigates its evolution process, geographical node-distribution, and network topological features. The revealed results are helpful for researchers to 1) understand the history of PlanetLab and some of its important properties quantitatively; 2) realize the dynamic of PlanetLab environment and design professional experiments; 3) select stable nodes that possess a high probability to run continuously for a long time; and 4) objectively and in depth evaluate the experimental results.
Back cover
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

In this paper we present techniques for comparison between behavioral level and register transfer level (RTL) design descriptions by mapping the designs into virtual controllers and virtual datapaths. We also discuss about how the equivalence between behavioral level and RTL designs can be defined precisely using the proposed "attribute statements" in an interactive fashion. Implementation issues as well as considerations on real life industrial design examples are presented as well. 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
Best Practices for Automated Traceability
Authors: Jane Cleland-Huang, Brian Berenbach, Stephen Clark, Raffaella Settimi, Eli Romanova
Venue: Computer (2007)

Automated traceability applies information-retrieval techniques to generate candidate links, sharply reducing the effort of manual approaches to build and maintain a requirements trace matrix as well as providing after-the-fact traceability in legacy documents. The authors describe nine best practices for implementing effective automated traceability.
The dynamic predicate: integrating access control with query processing in XML databases
Authors: Jae-Gil Lee, Kyu-Young Whang, Wook-Shin Han, Il-Yeol Song
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2007)

Recently, access control on XML data has become an important research topic. Previous research on access control mechanisms for XML data has focused on increasing the efficiency of access control itself, but has not addressed the issue of integrating access control with query processing. In this paper, we propose an efficient access control mechanism tightly integrated with query processing for XML databases. We present the novel concept of the dynamic predicate (DP), which represents a dynamically constructed condition during query execution. A DP is derived from instance-level authorizations and constrains accessibility of the elements. The DP allows us to effectively integrate authorization checking into the query plan so that unauthorized elements are excluded in the process of query execution. Experimental results show that the proposed access control mechanism improves query processing time significantly over the state-of-the-art access control mechanisms. We conclude that the DP is highly effective in efficiently checking instance-level authorizations in databases with hierarchical structures.