ppxscal/embedding_network huggingface dataset:
Performance Bounds for Bi-Directional Coded Cooperation Protocols
Authors: Sang Joon Kim, Patrick Mitran, Vahid Tarokh
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

In coded bi-directional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this paper, we derive performance bounds for this problem for each of three protocols. The first protocol is a two phase protocol where both users simultaneously transmit during the first phase and the relay alone transmits during the second. In this protocol, our bounds are tight. The second protocol considers sequential transmissions from the two users followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. In the latter two protocols the inner and outer bounds are not identical, and differ in a manner similar to the inner and outer bounds of Cover's relay channel. Numerical evaluation shows that at least in some cases of interest our bounds do not differ significantly. Finally, in the Gaussian case with path loss, we derive achievable rates and compare the relative merits of each protocol in various regimes. Surprisingly, we find that in some cases, the achievable rate region of the four phase protocol sometimes contains points that are outside the outer bounds of the other protocols.
Improving the Robustness of Private Information Retrieval
Authors: Ian Goldberg
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

Since 1995, much work has been done creating protocols for private information retrieval (PIR). Many variants of the basic PIR model have been proposed, including such modifications as computational vs. information-theoretic privacy protection, correctness in the face of servers that fail to respond or that respond incorrectly, and protection of sensitive data against the database servers themselves. In this paper, we improve on the robustness of PIR in a number of ways. First, we present a Byzantine-robust PIR protocol which provides information-theoretic privacy protection against coalitions of up to all but one of the responding servers, improving the previous result by a factor of 3. In addition, our protocol allows for more of the responding servers to return incorrect information while still enabling the user to compute the correct result. We then extend our protocol so that queries have information-theoretic protection if a limited number of servers collude, as before, but still retain computational protection if they all collude. We also extend the protocol to provide information-theoretic protection to the contents of the database against collusions of limited numbers of the database servers, at no additional communication cost or increase in the number of servers. All of our protocols retrieve a block of data with communication cost only O(.) times the size of the block, where . is the number of servers.
A framework for formal modeling and analysis of organizations
Authors: Catholijn M. Jonker, Alexei Sharpanskykh, Jan Treur, Pinar Yolum
Venue: Applied Intelligence (2007)

A new, formal, role-based, framework for modeling and analyzing both real world and artificial organizations is introduced. It exploits static and dynamic properties of the organizational model and includes the (frequently ignored) environment. The transition is described from a generic framework of an organization to its deployed model and to the actual agent allocation. For verification and validation of the proposed model, a set of dedicated techniques is introduced. Moreover, where most computational models can handle only two or three layered organizational structures, our framework can handle any arbitrary number of organizational layers. Henceforth, real-world organizations can be modeled and analyzed, as illustrated by a case study, within the DEAL project line
A Model-Based Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained Concurrency
Authors: Tim Schattkowsky, Gregor Engels, Alexander Forster
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Fine grained concurrency and accurate timing can be essential for embedded hardware and software systems. These requirements should be reflected in the specification and must be consistently enforced by the actual implementation. Automated synthesis of the implementation from such specifications appears to be a straightforward way to ensure this consistency. However, especially for software systems this is quite difficult, since software lacks the inherent timing and concurrency of a hardware system. Still, the same timing and concurrency requirements have to be fulfilled. Thus, we introduce a UML-based design approach that supports the synthesis of embedded hardware or software systems from essentially the same abstract specification. Our approach provides explicit support for specifying fine grained concurrency and microsecond accurate timing. In our approach, these properties must be ensured by the automatically derived implementation. Since this is especially hard to achieve for software systems, this paper focuses on execution on software platforms. For this, we introduce our UML Virtual Machine (UVM). It enables the direct execution of binary encoded system specifications and enforces the desired timing and concurrency. As a result, our approach enables the creation of binary encoded portable concurrent time-accurate software components.
A Tunable Add-On Diagnostic Protocol for Time-Triggered Systems
Authors: Marco Serafini, Neeraj Suri, Jonny Vinter, Astrit Ademaj, Wolfgang Brandstatter, Fulvio Tagliabo, Jens Koch
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

We present a tunable diagnostic protocol for generic time-triggered (TT) systems to detect crash and send/receive omission faults. Compared to existing diagnostic and membership protocols for TT systems, it does not rely on the single-fault assumption and tolerates malicious faults. It runs at the application level and can be added on top of any TT system (possibly as a middleware component) without requiring modifications at the system level. The information on detected faults is accumulated using a penalty/reward algorithm to handle transient faults. After a fault is detected, the likelihood of node isolation can be adapted to different system configurations, including those where functions with different criticality levels are integrated. Using actual automotive and aerospace parameters, we experimentally demonstrate the transient fault handling capabilities of the protocol.
A computer graphics curriculum to meet the european bologna requirements
Authors: Steve Cunningham
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Computer graphics programmes in Europe have been working to address the requirements of the Bologna education process. This poster presents the results of a workshop held in Vienna, Austria in September 2006 that developed an outline for computer graphics curricula to meet those requirements.
A modular monadic action semantics
Authors: Keith Wansbrough, John Hamer
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

A domain-specific language (DSL) is a framework which is designed to precisely meet the needs of a particular application. Domain-specific languages exist for a variety of reasons. As productivity tools, they are used to make application prototyping and development faster and more robust in the presence of evolving requirements. Furthermore, by bridging the "semantic gap" between an application domain and program code, DSLs increase the opportunity to apply formal methods in proving properties of an application. In this paper, we contribute a synthesis of two existing systems that address the problem of providing sound semantic descriptions of realistic programming languages: action semantics and modular monadic semantics. The resulting synthesis, modular monadic action semantics, is compatible with action semantics yet adds true modularity and allows domain specific specifications to be made at a variety of levels.
A Hybrid Approach to Fault Detection and Correction in SoCs
Authors: P. Bernardi, L. Bolzani, M. Sonza Reorda
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

The reliability of Systems-on-Chip (SoCs) is very important with respect to their use in different types of critical applications. Several fault tolerance techniques have been proposed to improve their fault detection and correction capabilities. These approaches can be classified in two basic categories: software-based and hardware-based techniques. In this paper, we propose a hybrid approach to provide fault detection and correction capabilities of transient faults for processor-based SoCs. This solution improves a previous one, aimed at fault detection only, and combines some modifications of the source code at high level with the introduction of an Infrastructure Intellectual Property (I-IP). The main advantage of the proposed method lies in the fact that it does not require modifying the microprocessor core. Experimental results are provided to evaluate the effectiveness of the proposed method.
Fully integrating algorithm visualization into a cs2 course.: a two-year experience
Authors: Pilu Crescenzi, Carlo Nocentini
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

We describe a two-year experience of fully integrating algorithm visualization technology into a CS2 course on data structures and algorithms. Our integration methodology was based on the engagement taxonomy proposed by the working group on Improving the Educational Impact of Algorithm Visualization: in particular, we used five forms of engagement of this taxonomy, that is, the no-viewing, the viewing, the changing, the constructing and the presenting forms. The integration of algorithm visualization technology into the course culminated in the writing of a textbook on the design, analysis and visualization of data structures and algorithms, whose reading is strictly dependent on the use of an algorithm visualization tool, called Alvie, which has been developed by the authors.
State of the art review of the existing PageRankTM based algorithms for trust and reputation computation
Authors: Farookh Khadeer Hussain, Elizabeth Chang, Omar Khadeer Hussain
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

In this paper we present a state of the art review of PageRankTM based approaches for trust and reputation computation. We divide the approaches that make use of PageRankTM method for trust and reputation computation, into six different classes. Each of the six classes is discussed in this paper.
A Cycle-Based Decomposition Method for Burst-Mode Asynchronous Controllers
Authors: Melinda Y. Agyekum, Steven M. Nowick
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

In this paper, a systematic and automated methodology is proposed for decomposing an asynchronous burst-mode (BM) controller into smaller sub-controllers, where each resulting subcontroller is activated on a communication channel. The proposed approach consists of a new decomposition algorithm, control micro-architecture and inter-controller communication protocol. This method has also been broadened to handle extended burstmode (XBM) controllers. For both controller types, only a moderate amount of auxiliary hardware is required, and optimizations are proposed to eliminate or simplify this hardware. Initial runtime results for both burst-mode and extended burstmode controllers are promising. Two of the largest BM benchmarks (dean-cache, scsi) were run using the Minimalist CAD tool and an optimized script. While the original controllers each timed out after 10 hours, the decomposition runs each completed in under 84 seconds. Further attempts to synthesize the original controllers using a suboptimal script succeeded, but with 16-200x greater runtime. Several XBM benchmarks were synthesized using the 3D CAD tool; one large complex controller (cdp-p1) was unable to complete while the decomposed run succeeded in under 197 seconds.
Iclient/Iserver: distributed objects using [incr Tcl]
Authors: Lee F. Bernhard
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

Iclient/Iserver is a simple distributed object framework for [incr Tcl] applications that enables its clients to synchronize activities and share information. Using Iclient/Iserver, clients can access objects living on a remote server tranparently, making building client/server applications both easy and intuitive. Iclient/Iserver is conceptually similar to the widely used CORBA standard, but is much simpler, intended for building smaller, client/server applications where the cost and complexity of a CORBA implementation cannot be justified. In this paper I describe the use of Iclient/Iserver for sharing server objects among clients. I explain the underlying architecture and implementation of the distributed object system. I conclude by illustrating how to use Iclient/Iserver to build a simple networked version of the card game Hearts.
Standards or semantics for curriculum search?
Authors: Byron B. Marshall, René F. Reitsma, Martha N. Cyr
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Aligning digital library resources with national and state educational standards to help K-12 teachers search for relevant curriculum is an important issue in the digital library community. Aligning standards from different states promises to help teachers in one state find appropriate materials created and cataloged elsewhere. Although such alignments provide a powerful means for crosswalking standards and curriculum across states, alignment matrices are intrinsically sparse. Hence, we hypothesize that such sparseness may cause significant numbers of false negatives when used for searching curriculum. Our preliminary results confirm the false negative hypothesis, demonstrate the usefulness of term-based techniques in addressing the false negative problem, and explore ways to combine term occurrence data with standards correlations.
An Approximation Scheme For Cake Division With A Linear Number Of Cuts
Authors: Ji&#x0159;&#x00ed; Sgall, Gerhard J. Woeginger
Venue: Combinatorica (2007)

In the cake cutting problem, n&#x2265;2 players want to cut a cake into n pieces so that every player gets a &#x2018;fair&#x2019; share of the cake by his own measure. We prove the following result: For every &#x03b5;>0, there exists a cake division scheme for n players that uses at most c&#x03b5;n cuts, and in which each player can enforce to get a share of at least (1-&#x03b5;)/n of the cake according to his own private measure.
Unintelligent Guided Ant-Based Solution to the Application Service Mapping Problem in a Grid Environment
Authors: Sharath Babu Musunoori, Geir Horn
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

A key problem of component-based grid application configuration is to map services onto the execution nodes of the grid environment such that all services of the application satisfy some minimum quality requirements. This problem is known to be NP-hard. Based on the previous ant-based methods to solve the problem, this paper proposes learning gatekeepers to guide the movement of unintelligent foraging ants to enhance the efficiency of the grid node graph exploration. In this respect, three variants of learning schemes have been used to reason how the gatekeepers could learn better recommendations to guide the ants. The simulation evaluation of the proposed methods shows that inclusion of gatekeepers significantly improves the convergence performance over the simple unintelligent random ants.
Fast construction of test-program generators for digital signal processors
Authors: S. Rubin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Test-program generators play a key role in hardware functional verification of large scale processors. However, in the DSP domain, the usage of full-blown test-program generators is much less popular, mainly due to the limited resources (time and money) available when developing such systems. This paper describes a work-model for the fast, low cost construction of a test-program generator for DSPs. The core technology uses Genesys, a known test program generator that, until now, has been used for the verification of large scale processor families, such as PowerPC and x86. We developed the model while using Genesys for verification of the IBM C54XDSP, a fixed-point DSP. The case study shows that it is possible to build a full test-program generator in a very short time and thus achieve better verification coverage in spite of the shorter development time.
Dielectric miceocavity resonators based on silicon mold
Authors: Yigui Li, Di Chen, Jun Zhu, Jingquan Liu, Jiliang Zhang
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

Microcavity resonators based on the developed a new fabrication technique to obtain silicon mold with crystalline flat planes are designed and fabricated. The principle, design, fabrication process, and performance as a resonator for application in both the dye laser and microcavity type optical filter based on two optical fibers and cavity resonator are described.
Integrating reflective writing in CS/IS
Authors: Jeffrey A. Stone, Elinor M. Madigan
Venue: ACM SIGCSE Bulletin (2007)

The ability to communicate effectively is a critical attribute for graduates of CS/IS programs. A challenge for CS/IS educators is how best to create experiential learning activities for students that allow for enhanced learning outcomes. In this paper we summarize a set of experiential learning activities coupled with the use of reflective writing. These activities are designed to build cognitive connections between academic theory and real-world applications. Sample experiences for both the freshmen and upper division levels are described, as well as discussion of and the results obtained from reflective writing activities.
Perception and prediction of simple object interactions
Authors: Manfred Nusseck, Julien Lagarde, Benoit Bardy, Roland Fleming, Heinrich H. Bülthoff
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

For humans, it is useful to be able to visually detect an object's physical properties. One potentially important source of information is the way the object moves and interacts with other objects in the environment. Here, we use computer simulations of a virtual ball bouncing on a horizontal plane to study the correspondence between our ability to estimate the ball's elasticity and to predict its future path. Three experiments were conducted to address (1) perception of the ball's elasticity, (2) interaction with the ball, and (3) prediction of its trajectory. The results suggest that different strategies and information sources are used for passive perception versus actively predicting future behavior.
Variable Step Size Affine Projection Algorithm for Adaptive Multiuser DS-CDMA MMSE Receiver
Authors: Aditya Trivedi, Daljit Kumar Mehra
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, we consider the use of affine projection algorithm (APA) for interference suppression in direct sequence code-division multiple-access (DS-CDMA) system. We first derive the multiuser fixed step-size APA (FSS-APA) algorithm. The computational complexity offered by the APA algorithm is linear in terms of the number of taps with additional terms of O (L 2) and a matrix inversion of dimension L, where L is known as the order of the filter. The value of L is chosen very small as compared to the number of filter-taps N T . We next propose a novel variable step-size APA (VSS-APA) algorithm, which further improves the performance of the FSS-APA algorithm with very small increase in computational complexity as compared to the FSS-APA. It is demonstrated that the performance of the APA based minimum mean-square error (MMSE) receivers is far superior to that of the normalized least-mean-square (NLMS) based receivers. Though, the recursive-least-square (RLS) algorithm based adaptive receivers offer better performance but at the cost of much higher computational complexity.
Parameter identification and macromodeling of hysteresis phenomena
Authors: D. Peters, S. Rehfuss, R. Laur, H.-G. Brachtendorf
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A parameter identification method for a macro model of hysteresis phenomena is illustrated. The chosen model is based on the theory due to Jiles and Atherton. In contrast to the Jiles-Atherton model (JA) the here chosen model does not show the JA's problems with the frequency dependence of the coercivity. A methodology well known from modeling electronic circuits has been chosen to utilize the illustrated model for the simulation of hard magnetic core materials applying parameter extraction methods based on parametric optimization.
Scheduling Data-IntensiveWorkflows onto Storage-Constrained Distributed Resources
Authors: Arun Ramakrishnan, Gurmeet Singh, Henan Zhao, Ewa Deelman, Rizos Sakellariou, Karan Vahi, Kent Blackburn, David Meyers, Michael Samidi
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

In this paper we examine the issue of optimizing disk usage and of scheduling large-scale scientific workflows onto distributed resources where the workflows are dataintensive, requiring large amounts of data storage, and where the resources have limited storage resources. Our approach is two-fold: we minimize the amount of space a workflow requires during execution by removing data files at runtime when they are no longer required and we schedule the workflows in a way that assures that the amount of data required and generated by the workflow fits onto the individual resources. For a workflow used by gravitationalwave physicists, we were able to improve the amount of storage required by the workflow by up to 57 %. We also designed an algorithm that can not only find feasible solutions for workflow task assignment to resources in diskspace constrained environments, but can also improve the overall workflow performance.