ppxscal/embedding_network huggingface dataset:
Aspect-Oriented Modeling of Ubiquitous Web Applications: The aspectWebML Approach
Authors: A. Schauerhuber, M. Wimmer, W. Schwinger, E. Kapsammer, W. Retschitzegger
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Ubiquitous web applications (UWA) are required to be customizable, meaning their services need to be adaptable towards the context of use, e.g., user, location, time, and device. Considering UWA's from a software engineering point of view, a systematic development on basis of models is crucial. Current web modeling languages, however, often disregard the crosscutting nature of customization potentially affecting all parts of a web application, and often mingle core and customization functionality. This leads to inefficient development processes, high maintenance overheads, and a low potential for reuse. We regard customization as a crosscutting concern in the sense of the aspect-oriented paradigm. As a proof of concept, we extend the prominent web modeling language WebML on basis of our reference architecture for aspect-oriented modeling. This allows for a clear separation between the core and customization functionality, and -- as a spin-off -- demonstrates how to bridge existing (domain-specific) modeling languages with aspect-oriented concepts.
System level clock tree synthesis for power optimization
Authors: Saif Ali Butt, Stefan Schmermbeck, Jurij Rosenthal, Alexander Pratsch, Eike Schmidt
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The clock tree is the interconnect net on Systems-on-Chip (SoCs) with the heaviest load and consumes up to 40% of the overall power budget. Substantial savings of the overall power dissipations are possible by optimizing the clock tree. Although these savings are already relevant at system-level, only little effort has been made to consider the clock tree at higher levels of abstraction. This paper shows how the clock-tree can be integrated into system-level power estimation and optimization. A clock tree routing algorithm is chosen, adapted to the system-level and then integrated into an algorithmic-level power optimization tool. Experimental results demonstrate the importance of the clock tree for system-level power optimization.
Exploiting structure in decentralized markov decision processes
Authors: Victor Lesser, Shlomo Zilberstein
Venue:  (2006)

While formal, decision-theoretic models such as the Markov Decision Process (MDP) have greatly advanced the field of single-agent control, application of similar ideas to multi-agent domains has proven problematic. The advantages of such an approach over traditional heuristic and experimental models of multi-agent systems include a more accurate representation of the underlying problem, a more easily defined notion of optimality and the potential for significantly better solutions. The difficulty often comes from the tradeoff between the expressiveness of the model and the complexity of finding an optimal solution. Much of the research in this area has focused on the extremes of this tradeoff. At one extreme are models where each agent has a global view of the world, and solving these problems is no harder than solving single-agent problems. At the other extreme lie very general, decentralized models, which are also nearly impossible to solve optimally. The work proposed here explores the middle-ground by starting with a general decentralized Markov decision process and introducing structure that can be exploited to reduce the complexity. I present two decision-theoretic models that structure the interactions between agents in two different ways. In the first model the agents are independent except for an extra reward signal that depends on each of the agents' histories. In the second model the agents have independent rewards but there is a structured interaction between their transition probabilities. Both of these models can be optimally and approximately solved using my Coverage Set Algorithm. I also extend the first model by allowing the agents to communicate and I introduce an algorithm that finds an optimal joint communication policy for a fixed joint domain-level policy.
Architecting Principles for Self-Managing Enterprise IT Systems
Authors: Kemal A. Delic, Jeff A. Riley, Yassine Faihe
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Economic mega-shifts and technology advances have created an entirely new context for the enterprise IT systems. It is now a very common expectation that the cost/performance ratios will be constantly improving while always offering better services and novel IT features. To fit such expectations, enterprise IT systems should be architected differently. In general, cost savings should be used to finance innovative projects fitting into enterprise architecting blueprints. In this paper we give a top-level view into typical enterprise IT system and outline four architecting principles to guide the implementation of these innovative projects articulated together as "renewal program' across entire IT. After describing in more depth each principle, we conclude with some practical challenges and outline a few interesting research directions. We also share some practical insights from an internal HP project.
Technique for Analyzing Items Reliability by Simulating Their Behaviour over Time Intervals
Authors: I. I. Ladygin, S. G. Yankov
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

This paper covers a technique of analyzing various items reliability by simulating such items' behaviour over time intervals. The paper concerns the main stages of calculating reliability indices using the above technique, means of items description, representation of the input data and results. The scope of the technique, its advantages, disadvantages, and software implementations are analyzed.
Evolution of Cooperative Information Gathering in Self-Replicating Digital Organisms
Authors: Benjamin E. Beckmann, Philip K. McKinley, David B. Knoester, Charles Ofria
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

We describe a study in the application of digital evolution to the problem of cooperative information gathering. In digital evolution, self-replicating computer programs evolve to perform tasks and optimize resource usage in order to survive within a user defined computational environment. Instruction-level mutations during replication and CPU-cycle rewards for desired behavior produce natural selection within the population. The evolution is openended and not limited by human preconceptions. The contributions of this work are (1) to demonstrate that cooperative information gathering can evolve in digital organisms and (2) to provide insight into the fundamental processes governing evolution of such behavior.
Assessment of the effectiveness of instructional technology in the CS introductory programming classes
Authors: D. S. Reese
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Many students with widely varying backgrounds are required to take an introductory programming course in computer science (CS). Mississippi State University has three courses in introductory programming that reach these concepts and differ only in the programming language that they use. Currently these courses are taught in a lecture only format with programming assignments required as part of the students' grades. Many of these introductory programming students struggle with the concepts in these classes. The wide availability of the World Wide Web to these students provides us with an opportunity to develop supplemental course material for these students to help demonstrate the basic concepts, and advance the students' capabilities in developing computer programs to solve a variety of problems. This paper discusses an experiment undertaken to determine the effectiveness of such Web based instructional material and asynchronous learning activities on student performance in an introductory programming class.
Soft updates: a technique for eliminating most synchronous writes in the fast filesystem
Authors: Marshall Kirk McKusick Gregory R. Ganger
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

Traditionally, filesystem consistency has been maintained across system failures either by using synchronous writes to sequence dependent metadata updates or by using write-ahead logging to atomically group them. Soft updates, an alternative to these approaches, is an implementation mechanism that tracks and enforces metadata update dependencies to ensure that the disk image is always kept consistent. The use of soft updates obviates the need for a separate log or for most synchronous writes. Indeed, the ability of soft updates to aggregate many operations previously done individually and synchronously reduces the number of disk writes by 40 to 70% for file-intensive environments (e.g., program development, mail servers, etc.). In addition to performance enhancement, soft updates can also maintain better disk consistency. By ensuring that the only inconsistencies are unclaimed blocks or inodes, soft updates can eliminate the need to run a filesystem check program after every system crash. Instead, the system is brought up immediately. When it is convenient, a background task can be run on the active filesystem to reclaim any lost blocks and inodes. This paper describes an implementation of soft updates and its incorporation into the 4.4BSD fast filesystem. It details the changes that were needed, both to the original research prototype and to the BSD system, to create a production-quality system. It also discusses the experiences, difficulties, and lessons learned in moving soft updates from research to reality; as is often the case, non-focal operations (e.g., fsck and "fsync") required rethinking and additional code. Experiences with the resulting system validate the earlier research: soft updates integrates well with existing filesystems and enforces metadata dependencies with performance that is within a few percent of optimal.
Improving single-pass adaptive VQ
Authors: F. Rizzo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Constantinescu and Storer (1994) introduced a single-pass vector quantization algorithm that with no specific training or prior knowledge of the data was able to achieve better compression results with respect to the JPEG standard, along with a number of computational advances such as: adjustable fidelity/compression tradeoff, precise guarantees on any l/spl times/l sub-block of the image, and fast table-lookup decoding. We improve that basic algorithm by blending it with the mean shape-gain vector quantization (MSGVQ) compression scheme. This blending allows a slightly better performance in terms of compression and a clear improvement in visual quality.
Physically Based Animation of Tongue on Fire in a Periodic Domain
Authors: Peiyu Qin, Chuanbo Chen, Zehua Lv, Hui Xia
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, a physically based approach for simulating tongue of fire is proposed. Realistic animation and real-time simulation are two objectives pursued in computer graphics applications. Traditional animation technique can obtain virtual movement, but it has difficulty for realistic movement. Compared with the traditional animation technique, physically based animation can represent realistic movement better. The incompressible Navier-Stokes equations are used in our model, and the operator splitting method including semi-Lagrangian scheme and fast Fourier transform is employed to split the model into external force term, advection term, diffusion term and projection term. Every step is stable, so the whole process is also stable. Thus, the big time step can be taken to ensure real-time simulation. Compared with the traditional technique, this method can be taken for realistic animation and real-time simulation of tongue of fire in computer graphics applications. A simple visualization approach is also proposed based on density field for rendering tongue of fire animations in real time.
Using peak intensity and fragmentation patterns in peptide sequence identification (sqid): a bayesian learning algorithm for tandem mass spectra
Authors: Vicki H. Wysocki
Venue:  (2006)

As DNA sequence information becomes increasingly available, researchers are now tackling the great challenge of characterizing and identifying peptides and proteins from complex mixtures. Automatic database searching algorithms have been developed to meet this challenge. This dissertation is aimed at improving these algorithms to achieve more accurate and efficient peptide and protein identification with greater confidence by incorporating peak intensity information and peptide cleavage patterns obtained in gas-phase ion dissociation research. The underlying hypothesis is that these algorithms can benefit from knowledge about molecular level fragmentation behavior of particular amino acid residues or residue combinations. SeQuence IDentification (SQID), developed in this dissertation research, is a novel Bayesian learning-based method that attempts to incorporate intensity information from peptide cleavage patterns in a database searching algorithm. It directly makes use of the estimated peak intensity distributions for cleavage at amino acid pairs, derived from probability histograms generated from experimental MS/MS spectra. Rather than assuming amino acid cleavage patterns artificially or disregarding intensity information, SQID aims to take advantage of knowledge of observed fragmentation intensity behavior. In addition, SQID avoids the generation of a theoretical spectrum predication for each candidate sequence, needed by other sequencing methods including SEQUEST. As a result, computational efficiency is significantly improved. Extensive testing has been performed to evaluate SQID, by using datasets from the Pacific Northwest National Laboratory, University of Colorado, and the Institute for Systems Biology. The computational results show that by incorporating peak intensity distribution information, the program's ability to distinguish the correct peptides from incorrect matches is greatly enhanced. This observation is consistent with experiments involving various peptides and searches against larger databases with distraction proteins, which indirectly verifies that peptide dissociation behaviors determine the peptide sequencing and protein identification in MS/MS. Furthermore, testing SQID by using previously identified clusters of spectra associated with unique chemical structure motifs leads to the following conclusions: (1) the improvement in identification confidence is observed with a range of peptides displaying different fragmentation behaviors; (2) the magnitude of improvement is in agreement with the peptide cleavage selectivity, that is, more significant improvements are observed with more selective peptide cleavages.
Very low bit rate foveated video coding for H.263
Authors: Sanghoon Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Recently, foveated video has been introduced as an important emerging method for very low bit rate multimedia applications. In this paper, we develop several rate control algorithms, and measure the performance of foveated video. We utilize H.263 video, and compare the performance with regular video based on the SNRC (signal-to-noise-ratio in curvilinear coordinates). In order to maximize compression, we use a maximum quantization parameter (QP=31) for the regular video, and code a foveated video sequence at the equivalent bit rate. In simulation, we improve the PSNRC to 3.64 (1.62)dB under 30 (14) kbits/sec for P pictures in CIF "News" ("Akiyo") standard video sequence.
Writing for the Web: student authors and authorities
Authors: S. M. Blanchard
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Students in BAE 465: Biomedical Engineering Applications have been writing projects for the World Wide Web (WWW) since 1994. During that time, 170 students completed 47 projects. These projects have allowed students to learn technical material and develop Web skills, to produce permanent, professional examples of their scholarly work, and to write for a large and diverse audience. The students approached these projects with more enthusiasm and pride than normal term papers and valued their resultant products. With these projects, students have became both authors and authorities in an area of biomedical engineering.
Simple current waveform probe for microwave amplifiers
Authors: N. T. Ali, N. J. McEwan, E. A. El-khazmi
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

A probe for sensing current waveforms in microstrip-based microwave power amplifiers is demonstrated. Its simple transfer function permits real-time current waveform displays using a sampling oscilloscope, without computer correction of the responses. Sample waveforms are presented for an active transmitting antenna, where the operating frequency is 2.3 GHz and harmonics up to the 5/sup th/ are correctly reproduced.
The rising tide: DDoS from defective designs and defaults
Authors: Richard Clayton
Venue: Proceedings of the 2nd conference on Steps to Reducing Unwanted Traffic on the Internet - Volume 2 (2006)

We consider the phenomenon of distributed denial of service attacks that occur through design defects (and poorly chosen defaults) in legitimately operated, entirely secure systems. Particular reference is made to a recently discovered "attack" on stratum 1 Network Time Protocol servers by routers manufactured by D-Link for the consumer market, the latest example of incidents that stretch back for decades. Consideration is given to how these attacks might have been avoided, and why such failures continue to occur.
An Empirical Assessment of Factors that Influence the Effectiveness of SMS Advertising
Authors: Dimitris Drossos, George M. Giaglis, George Lekakos
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Mobile advertising has emerged as one of the most popular applications in mobile commerce, particularly in the form of SMS advertising campaigns. However, looking at the process of mobile advertising scientific inquiry, one observes that little is known regarding the effectiveness of an SMS advertisement and the factors contributing to its success. This research investigates the significance of such factors via an experimental method based on a student sample. Several content and medium factors were manipulated and the key finding is that (1) incentive, (2) interactivity, (3) appeal, (4) product involvement, (5) acronyms usage and (6) attitude towards SMS advertising in general, exhibit main effects on attitudinal variables and purchase intentions.
Protected shared libraries: a new approach to modularity and sharing
Authors: Arindam Banerji, John Michael Tracey, David L. Cohn
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

Protected Shared Libraries, or PSLs, are a new type of support for modularity that form a basis for building flexible library-based operating system services. PSLs extend the familiar notion of shared libraries with protected state and data sharing across protection boundaries. Protected state information allows PSLs to be used to implement sensitive operating system services. Sharing of data across protection boundaries yields significant performance benefits. These features make PSLs a viable basis on which a complete operating system can be built largely as a set of dynamically loadable libraries without compromising protection or sacrificing performance. PSLs also allow highly flexible implementations of new functionality to be added to current commercial operating systems. A prototype PSL implementation has been built into AIX 3.2.5 and early performance results are encouraging.
Ambidexterity and Global IS Project Success: A Theoretical Model
Authors: Gwanhoo Lee, William DeLone, J. Alberto Espinosa
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Increasingly more IS projects are globally dispersed. As a result, the success of IS projects can be affected by various global boundaries such as geographical distance, time separation, organizational boundaries and cultural differences. At the same time, system requirements dynamism significantly undermines global IS project performance because it is difficult for global teams to effectively sense and respond to changing system requirements. Therefore, to deliver quality systems on time and within budget in today's dynamic, global environments, process, people, and technology employed by IS projects need to simultaneously exhibit ambidexterity i.e., both rigor and agility. Drawing upon prior literature and interview data from field studies, this research develops a theoretical model that explains and predicts global IS project success based on ambidextrous project capabilities. Specifically, the model identifies IS project rigor and IS project agility as two key IS project capabilities that moderate the negative effects of global boundary complexity and system requirements dynamism on global IS project success.
Supporting H.323 video and voice in an enterprise network
Authors: Randal Abler, Gail Wells
Venue: Proceedings of the 1st conference on Conference on Network Administration - Volume 1 (1999)

H.323 is a relatively new standard for video and voice transmission that specifies using IP packets as the transport. This opens the possibility of adding an inexpensive camera to a modern desktop, and allowing two way video-conferencing between any offices so equipped. While the H.323 specification addresses LAN networks, can H.323 be used in a WAN environment? What characteristics are necessary to support H.323 in the LAN and WAN networks, and what is the impact of H.323 on other traffic in the network? This paper attempts to outline the impact of running H.323 on a network and lay out some guidelines that should be useful for accommodating H.323 on both local and wide area networks.
The triple rotation method for constructing t-norms
Authors: Koen C. Maes, Bernard De Baets
Venue: Fuzzy Sets and Systems (2007)

Given an involutive negator N and a left-continuous t-norm T that either has no zero divisors or is rotation invariant, we build a rotation-invariant t-norm from a rescaled version of T and its left, right and front rotation. Depending on the involutive negator N and the set of zero divisors of T, some reshaping of the rescaled version of T may occur during the rotation process. The rescaled version of T itself can be understood as the @b-zoom of the newly constructed rotation-invariant t-norm, with @b the unique fixpoint of N. Starting with a rotation-invariant t-norm T there is, however, one important restriction. The triple rotation method based on the involutive negator N will yield a t-norm if and only if the companion Q of T is commutative on [0,1[^2. When Q is not commutative on [0,1[^2, there even does not exist a rotation-invariant t-norm with @b-zoom equal to T.