ppxscal/embedding_network huggingface dataset:
Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics
Authors: Mercedes Hidalgo-Herrero, Alberto Verdejo, Yolanda Ortega-Mallén
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Eden is a parallel extension of the functional language Haskell. On behalf of parallelism Eden overrides Haskell's pure lazy approach, combining a non-strict functional application with eager process creation and eager communication. We desire to investigate alternative semantics for Eden in order to analyze the consequences of some of the decisions adopted during the language design. In this paper we show how to implement in Maude the operational semantics of Eden in such a way that semantic rules can be modified easily. Moreover, other semantic features can be implemented by means of parameterized modules that allow to instantiate in different ways several parameters of the semantics but without modifying the semantic rules.
Paradigms for on-line learning: a case study in the design and implementation of an asynchronous learning networks (ALN) course
Authors: J. R. Bourne
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper examines paradigms used in online learning, with a specific emphasis on how to effectively employ asynchronous learning networks (ALN) for the delivery of online courses. Recent progress in ALNs is presented, methodologies for getting started in creating an ALN course given and relationships between traditional teaching and learning methods and ALN-based courses discussed. To illustrate a specific ALN model, the paper presents a case study about the creation of an online course. The prospects for online education and the challenges that face the ALN field are considered.
Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams
Authors: Guodong Rong, Tiow-Seng Tan
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. This paper presents three novel variants of JFA. They focus on different aspects of JFA: the first variant can further reduce the errors of JFA; the second variant can greatly increase the speed of JFA; and the third variant enables JFA to compute Voronoi diagrams in 3D space in a slice-by-slice manner, without a high end graphics processing unit. These variants are orthogonal to each other. In other words, it is possible to combine any two or all of them together.
CheckFence: checking consistency of concurrent data types on relaxed memory models
Authors: Sebastian Burckhardt, Rajeev Alur, Milo M. K. Martin
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Concurrency libraries can facilitate the development of multi-threaded programs by providing concurrent implementations of familiar data types such as queues or sets. There exist many optimized algorithms that can achieve superior performance on multiprocessors by allowing concurrent data accesses without using locks. Unfortunately, such algorithms can harbor subtle concurrency bugs. Moreover, they requirememory ordering fences to function correctly on relaxed memory models. To address these difficulties, we propose a verification approach that can exhaustively check all concurrent executions of a given test program on a relaxed memory model and can verify that they are observationally equivalent to a sequential execution. Our CheckFence prototype automatically translates the C implementation code and the test program into a SAT formula, hands the latter to a standard SAT solver, and constructs counter example traces if there exist incorrect executions. Applying CheckFence to five previously published algorithms, we were able to (1) find several bugs (some not previously known), and (2) determine how to place memory ordering fences for relaxed memory models.
Mapping Applications to Tiled Multiprocessor Embedded Systems
Authors: Lothar Thiele, Iuliana Bacivarov, Wolfgang Haid, Kai Huang
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

Modern multiprocessor embedded systems execute a large number of tasks on shared processors and handle their complex communications on shared communication networks. Traditional methods from the HW/SW codesign or general purpose computing domain cannot be applied any more to cope with this new class of complex systems. To overcome this problem, a framework called Distributed Operation Layer (DOL) is proposed that enables the efficient execution of parallel applications on multiprocessor platforms. Two main services are offered by the DOL: systemlevel performance analysis and multi-objective algorithmarchitecture mapping. This paper presents the basic principles of the DOL, the specification mechanisms for applications, platform and mapping as well as its internal analytic performance evaluation framework. To illustrate the presented concepts, an MPEG-2 decoder case study is presented.
Electronic commerce and the street performer protocol
Authors: John Kelsey, Bruce Schneier
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

We introduce the Street Performer Protocol, an electronic-commerce mechanism to facilitate the private financing of public works. Using this protocol, people would place donations in escrow, to be released to an author in the event that the promised work be put in the public domain. This protocol has the potential to fund alternative or "marginal" works.
Creating and evaluating interactive formal courseware for mathematics and computing
Authors: R. L. Constable
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The application of the the Nupri proof development system to the teaching of college-level mathematics is explored. The advantages of this method include the flexibility to accommodate the needs of students with very diverse backgrounds and the creation of an environment that encourages collaborative learning.
The Armed Forces Casualty Assistance Readiness Enhancement System (CARES) A Case Study in Rapid Prototyping and Design for Flexibility
Authors: MAJ Ernest Y. Wong, LTC William Bland, LTC Simon R. Goerger
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Numerous government benefits are available to the surviving family of fallen U.S. military service members. Unfortunately, most of these entitlements require a considerable amount of paperwork to be correctly processed, necessitating a great deal of patience, attention to detail, and composure from families at a time when their grief is raw. Even though the U.S. Army appoints a Casualty Assistance Officer (CAO) to help surviving family members through this process, the soldiers serving as CAOs tend to be inexperienced and oftentimes find themselves challenged to provide accurate and thorough assistance. Consequently, some families do not receive all benefits in a timely manner, and some entitlements may be overlooked entirely. To help with the military's Casualty Program, we have developed the Casualty Assistance Readiness Enhancement System (CARES) an information system that improves how the Department of Defense cares for military families in arguably their greatest time of need.
Design of efficient FIR filters with cyclotomic polynomial prefilters using mixed integer linear programming
Authors: T. Higuch
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The cyclotomic polynomial (CP) prefilter design problem is formulated as an optimization problem with linear objective functions by applying the logarithm to the transfer function of the CP prefilter. Then this problem is solved by mixed integer linear programming (MILP). Design examples demonstrate that this method leads to more efficient cascaded FIR prefilter-equalizers than existing methods. 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
Why it is hard to build a long-running service on PlanetLab
Authors: Justin Cappos, John Hartman
Venue: Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2 (2005)

PlanetLab was conceived as both an experimental testbed and a platform for long-running services. It has been quite successful at the former, less so at the latter. In this paper we examine why. The crux of the problem is that there are few incentives for researchers to develop long-running services. Research prototypes fulfill publishing requirements, whereas long-running services do not. Several groups have tried to deploy research services, long-running services that are useful, but also novel enough to be published. These services have been generally unsuccessful. In this paper we discuss the difficulties in developing a research service, our experiences in developing a research service called Stork, and offer suggestions on how to increase the incentives for researchers to develop research services.
Breaking Down Stereotypes: A Call for an Ontological Model
Authors: Russell D. Rosco, Marcus K. Rogers, Samuel Liles
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

An ontological model, such as the one proposed in this paper, can provide the basis for many activities. The first important activity is the ability to gather and categorize statistics which provide the empirical basis to discuss deviant computer usage, thus helping to dispel stereotypes. The information gathered via the proposed ontological model could be used to (1) validate or create categories in taxonomies, (2) educate potential victims about their risk factors, (3) help corporations determine security priorities, (4) reduce the potential suspect pool in a crime investigation, (5) provide data for policy makers, (6) create computer crime profiles , and multiple other uses.
A Parallel Algorithm for Rendering Huge Terrain Surfaces
Authors: Norbert Somosi, Dana Petcu
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

In this short report we present an efficient way for real time parallel rendering of complex terrain models. We describe a hybrid algorithm that combines the parallel Sort Last and the sequential GeoMipMapping rendering algorithms. Tests on a cluster of workstations are also reported.
On the balancing principle for some problems of Numerical Analysis
Authors: Raytcho D. Lazarov, Shuai Lu, Sergei V. Pereverzev
Venue: Numerische Mathematik (2007)

We discuss a choice of weight in penalization methods. The motivation for the use of penalization in computational mathematics is to improve the conditioning of the numerical solution. One example of such improvement is a regularization, where a penalization substitutes an ill-posed problem for a well-posed one. In modern numerical methods for PDEs a penalization is used, for example, to enforce a continuity of an approximate solution on non-matching grids. A choice of penalty weight should provide a balance between error components related with convergence and stability, which are usually unknown. In this paper we propose and analyze a simple adaptive strategy for the choice of penalty weight which does not rely on a priori estimates of above mentioned components. It is shown that under natural assumptions the accuracy provided by our adaptive strategy is worse only by a constant factor than one could achieve in the case of known stability and convergence rates. Finally, we successfully apply our strategy for self-regularization of Volterra-type severely ill-posed problems, such as the sideways heat equation, and for the choice of a weight in interior penalty discontinuous approximation on non-matching grids. Numerical experiments on a series of model problems support theoretical results.
A new approach for symbol frame synchronization and carrier frequency estimation in OFDM communications
Authors: J. H. Gunther
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

This work considers the problem of jointly estimating symbol frame boundaries and carrier frequency offsets for orthogonal frequency division multiplexed (OFDM) communications in frequency selective fading environments. Orthogonality between the modulated and virtual carriers over an interference free window of the received signal is used to develop an algorithm for estimating the carrier frequency offset and detecting the beginning of a symbol frame. By using a cyclic prefix to remove interference from neighboring frames, the the method is applicable in the presence of dispersive channels. The main contribution of this work is the joint estimation of the frequency offset and the frame boundary.
Autonomous Return on Investment Analysis of Additional Processing Resources
Authors: Jonathan Wildstrom, Peter Stone, Emmett Witchel
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

With the recent explosion in computing power available in a single system, much attention has been turned towards the concepts of virtualization of these systems. As this trend continues, it is logical to assume that deploying an entire web-based service on an externally managed virtualized environment will soon be not only plausible, but common. In such an environment, the different components of the system would be logical machines, which would each appear to have private access to CPUs, memory, and other resources, and which would each be running an independent operating system. Because resources are not shared between virtual machines, administrators will need to make decisions about how much they should invest in resources and when more (or less) resource capacity is a good investment. An autonomous agent that can determine the Return on Investment (ROI) of the resource can make this management problem easier.
Enterprise Architecture and IT Governance: A Risk-Based Approach
Authors: James R. Getter
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The USCP had enormous challenges with its IT Program and support to the internal and external stakeholders of the Department, because of a fragile IT infrastructure. The IT Program was not able to provide the basic assistance to the end-user, adequate reporting to middle and senior management, and lacked training of IT and end-user staff, to venture into the rapidly changing technologies in network management, operating systems, data security, risk management, and systems integration, as well as, the need for innovative data management. The need for these services were exacerbated by increased demands on the IT Services Group and budgetary pressures restricting the resources available to accomplish the mission until an IT Governance structure was adopted and the development and implementation of an Enterprise Architecture with corresponding Risk Management Planning was undertaken. In order to overcome the inadequacies in the IT program, USCP established several ambitious goals for updating its Strategic Planning Process, developing and implementing an Enterprise Architecture and Risk Management Plan, setting up an IT Governance structure to provide the necessary standards and guidance, as well as the relevance, accessibility, and timeliness of its Information Technology support. The Office of Information Systems, set out to transforming itself into a performance-based organization. The envisioned "to be" system architecture helped USCP focus scarce assets on prioritized application and infrastructure projects to directly support USCP mission requirements, both Operational and Administrative. Additionally an IT Security Program was implemented to include compliance with FISMA [7]; established a Configuration and Change Management Board; instituted Earned Value Management techniques into project management activities, during the system acquisition process.
Service-Oriented Framework for Internet Applications
Authors: Tony C. Shan, Winnie W. Hua
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

This paper presents a broad-spectrum Service- Oriented Framework for Internet Applications (SOFIA), to efficiently manage the architecture design complexity and govern the solution development lifecycle of information systems in a service-oriented paradigm. This overarching model comprises multiple dimensions of design activities: System Architecture, Development Lifecycle, Technology Solutions, and System Management & Governance. Further, these four dimensions consist of a string of elements: Conceptual View, Logical View, Physical View, Topology View, Methodology/Process, Design/Develop, Testing, Build/Deploy, Application Framework, Utility Components, Integration Mechanism, Security Solutions, Quality of Services, System Management, Governance, and Tools modules. The characteristics and features of the constituent elements in the SOFIA model are articulated in great detail. Applications and future trends are also discussed in the context. This holistic framework provides a comprehensive taxonomy of the design and process artifacts from both design-time and run-time perspectives. It helps build high-quality serviceoriented solutions focused on different domains, and in the meantime keeps the agility, flexibility and adaptivity of the overall model.
On the capacity of OFDM-based multi-antenna systems
Authors: H. Boleskei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We compute the capacity of wireless orthogonal frequency division multiplexing (OFDM)-based spatial multiplexing systems in delay spread environments. Introducing an abstract model to characterize the statistical properties of the space-time channel, we provide a Monte-Carlo method for estimating the capacity cumulative distribution function, expected capacity, and outage capacity for the case where the channel is unknown at the transmitter and perfectly known at the receiver. We study the influence of the propagation environment and system parameters on capacity, and we apply our method to spatial versions of standard channels taken from the GSM recommendations. This allows us to make statements about achievable data rates of OFDM-based spatial multiplexing systems operating in practical broadband propagation environments.
A bio-inspired approach for multi-word expression extraction
Authors: Jianyong Duan, Ruzhan Lu, Weilin Wu, Yi Hu, Yan Tian
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper proposes a new approach for Multi-word Expression (MWE)extraction on the motivation of gene sequence alignment because textual sequence is similar to gene sequence in pattern analysis. Theory of Longest Common Subsequence (LCS) originates from computer science and has been established as affine gap model in Bioinformatics. We perform this developed LCS technique combined with linguistic criteria in MWE extraction. In comparison with traditional n-gram method, which is the major technique for MWE extraction, LCS approach is applied with great efficiency and performance guarantee. Experimental results show that LCS-based approach achieves better results than n-gram.
A classification of predictive-reactive project scheduling procedures
Authors: Stijn Vonder, Erik Demeulemeester, Willy Herroelen
Venue: Journal of Scheduling (2007)

The vast majority of the project scheduling research efforts over the past several years have concentrated on the development of workable predictive baseline schedules, assuming complete information and a static and deterministic environment. During execution, however, a project may be subject to numerous schedule disruptions. Proactive-reactive project scheduling procedures try to cope with these disruptions through the combination of a proactive scheduling procedure for generating predictive baseline schedules that are hopefully robust in that they incorporate safety time to absorb anticipated disruptions with a reactive procedure that is invoked when a schedule breakage occurs during project execution. In this paper we discuss the results obtained by a large experimental design set up to evaluate several predictive-reactive resource-constrained project scheduling procedures under the composite objective of maximizing both the schedule stability and the timely project completion probability.
Bayesian estimation of chirplet signals by MCMC sampling
Authors: Chung-Chieh Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We address the problem of parameter estimation of chirplets which are chirp signals with Gaussian shaped envelopes. The procedure we propose is an extension of our previous work on estimation of chirp signals (Lin and Djuric, 2000), and it is based on MCMC sampling. For fast convergence of the Markov chain Monte Carlo (MCMC) sampling based method, a critical step is the initialization of the method Since the chirplets have finite durations and may or may not overlap in time, we propose initialization procedures for each of these cases. We have tested the method by extensive simulations and compared it with Cramer-Rao bounds. The obtained results have been excellent.
Graph Visualization Techniques for Web Clustering Engines
Authors: Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

One of the most challenging issues in mining information from the World Wide Web is the design of systems that present the data to the end user by clustering them into meaningful semantic categories. We show that the analysis of the results of a clustering engine can significantly take advantage of enhanced graph drawing and visualization techniques. We propose a graph-based user interface for Web clustering engines that makes it possible for the user to explore and visualize the different semantic categories and their relationships at the desired level of detail.
On the release of CRLs in public key infrastructure
Authors: Chengyu Ma, Nan Hu, Yingjiu Li
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

Public key infrastructure provides a promising foundation for verifying the authenticity of communicating parties and transferring trust over the internet. The key issue in public key infrastructure is how to process certificate revocations. Previous research in this aspect has concentrated on the tradeoffs that can be made among different revocation options. No rigorous efforts have been made to understand the probability distribution of certificate revocation requests based on real empirical data. In this study, we first collect real empirical data from VeriSign and derive the probability function for certificate revocation requests. We then prove that a revocation system will become stable after a period of time. Based on these, we show that different certificate authorities should take different strategies for releasing certificate revocation lists for different types of certificate services. We also provide the exact steps by which certificate authorities can derive optimal releasing strategies.