ppxscal/embedding_network huggingface dataset:
Instilling a defect prevention philosophy [software engineering education]
Authors: L. Williams
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

In software, teaching a programming language and how to compile and execute programs allows people to write programs immediately. Very likely, such programs will require considerable debugging. Errors and unit debugging are just an expected and integral part of programming. However, people with the right education and training need not unit debug their software any more than people need to look at the keys when they type. Serious programming begins only with formal methods, more explicit design, and verification from specifications. A proven software development process, Cleanroom Software Engineering, adds engineering rigor to the process and focuses on defect prevention and statistical quality control. Cleanroom has historically produced software with significantly superior quality and improved productivity. As a result, the University of Utah offers a new undergraduate course in Cleanroom Software Engineering. The course instills a defect-prevention, systematic/engineering philosophy in the students. This paper contains some introductory information on Cleanroom Software Engineering and explains how its principles are taught and enforced in the classroom.
Analysis of stochastic gradient identification of polynomial nonlinear systems with memory
Authors: P. Celka
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper presents analytical, numerical and experimental results for a stochastic gradient adaptive scheme which identifies a polynomial-type nonlinear system with memory for noisy output observations. The analysis includes the computation of the stationary points, the mean square error surface, and the mean behaviour of the algorithm for Gaussian data. Monte Carlo simulations confirm the theoretical predictions which show a small sensitivity to the observation noise.
A game theoretic comparison of TCP and digital fountain based protocols
Authors: Luis López, Antonio Fernández, Vicent Cholvi
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

In this paper we analyze a novel paradigm of reliable communication which is not based on the traditional timeout-and-retransmit mechanism of TCP. Our approach, which we call Fountain Based Protocol (FBP), consists of using a digital fountain encoding which guarantees that duplicate packets are almost impossible. By using Game Theory, we analyze the behavior of TCP and FBP in the presence of congestion. We show that hosts using TCP have an incentive to switch to an FBP approach, obtaining a higher goodput. Furthermore, we also show that a Nash equilibrium occurs when all hosts use FBP (i.e., when FBP hosts act in an absolutely selfish manner injecting packets into the network as fast as they can and without any kind of congestion control approach). At this equilibrium, the performance of the network is similar to the performance obtained when all hosts comply with TCP. Regarding the interaction of hosts using FBP at different rates, our results show that the Nash equilibrium is reached when all hosts send at the highest possible rate, and, as before, that the performance of the network in such a case is similar to the obtained when all hosts comply with TCP.
A Reflective Aspect-Oriented Model Editor Based on Metamodel Extension
Authors: Naoyasu Ubayashi, Shinji Sano, Genya Otsubo
Venue: Proceedings of the International Workshop on Modeling in Software Engineering (2007)

AspectM, an aspect-oriented modeling language, provides not only basic modeling constructs but also an extension mechanism called metamodel access protocol (MMAP) that allows a modeler to modify the metamodel. MMAP consists of metamodel extension points, extension operations, and primitive predicates for defining pointcut designators. In this paper, a reflective model editor for supporting MMAP is proposed. A new modeling construct can be introduced by extending the metamodel. This mechanism, a kind of edit-time structural reflection, enables a modeler to represent domain-specific crosscutting concerns.
Massively Parallel Simulations on Light-Induced Charge Transfer in Molecules
Authors: Mark R. Pederson, W. A. Anderson, Tunna Baruah
Venue: Proceedings of the HPCMP Users Group Conference (2006)

The development of environmentally friendly, inexpensive, lightweight solar cells would significantly enhance both sea- and land- based DoD operations and directly enhance global security through a reduction of competition for carbon-based fuels. For example, capturing one out of every 10000 photons from the sun would provide all the power the world currently uses. Approximately 75% of the solar radiation striking the upper atmosphere (1368 W/m2 = 8555 eV/sec/nm2 ) reaches the surface of the earth and most of this is in the form of photons with more than 1 eV of energy since water vapor and other atmospheric constituents effectively absorb energy below this threshold. In order to produce a one micron photovoltaic molecular film (composed of approximately 1000 layers of a molecule) with 1020 percent efficiency, each molecule would have to create 13 eV/sec. Since the available solar radiation is in the 14 eV range, this implies 13 electron-hole pairs per second which biological systems currently achieve. As such, various organic molecules, some of which are biologically inspired, have been proposed as alternative building blocks for solar energy materials.
Identifying and tracking suspicious activities through IP gray space analysis
Authors: Yu Jin, Zhi-Li Zhang, Kuai Xu, Feng Cao, Sambit Sahu
Venue: Proceedings of the 3rd annual ACM workshop on Mining network data (2007)

Campus or enterprise networks often have many unassigned IP addresses that collectively form IP gray space within the address blocks of such networks. Using one-month traffic data collected in a large campus network, we have monitored a significant amount of unwanted traffic towards IP gray space in various forms, such as worms, port scanning, and denial of service attacks. In this paper, we apply a heuristic algorithm to extract the IP gray space in our campus network. Subsequently, we analyze the behavioral patterns such as dominant activities and target randomness, of the gray space traffic for individual outside hosts. By correlating and contrasting the traffic towards IP gray addresses and live end hosts, we find the gray space traffic provides unique insight for uncovering the behavior, and intention,of anomalous traffic towards live end hosts. Finally, we demonstrate the applications of gray space traffic for identifying SPAM behavior, detecting malicious scanning and worm activities that successfully compromise end hosts.
SecureShare: safe UNIX/Windows file sharing through multiprotocol locking
Authors: Andrea J. Borr
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

As mixed UNIX/Windows environments become more common, safe file sharing among the NFS and CIFS clients becomes a significant problem. In this paper, we describe SecureShare, a multiprotocol file sharing technology that resolves the mismatch between NFS/NLM and CIFS file locking protocols, provides coherent caching and enables multiprotocol change notification. SecureShare achieves the goal through a uniform lock-mode model and multiprotocol oplock management. This paper presents the main features of SecureShare and discusses the rationale behind its design.
Closed loop stability analysis of an assistance system for catheterization
Authors: Thorsten A. Kern, Stephanie Klages, Thorsten Meib, Roland Werthschutzky
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Catheterizations are standard procedures of today's vascular treatment for diagnosis and therapy. To improve navigation even into smaller branches a novel device with haptic feedback assisting during catheterization is currently being developed. One aspect of the design is the identification of possible sources for instability, which is focused on in this paper. This requires the analysation and modeling of the interaction between the device, the patient and the medical staff. The resulting open loop response plotted in BODEdiagram demonstrates areas of possible instabilities. As a result design constrains to
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
Authors: Venkatesan Guruswami, Christopher Umans, Salil Vadhan
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are polynomially close to optimal, whereas the previous constructions of Ta-Shma, Umans, and Zuckerman (STOC "01) required at least one of these to be quasipolynomial in the optimal. Our expanders have a short and self-contained description and analysis, based on the ideas underlying the recent list-decodable error-correcting codes of Parvaresh and Vardy (FOCS "05). Our expanders can be interpreted as near-optimal "randomness condensers," that reduce the task of extracting randomness from sources of arbitrary min-entropy rate to extracting randomness from sources of min-entropy rate arbitrarily close to 1, which is a much easier task. Using this connection, we obtain a new construction of randomness extractors that is optimal up to constant factors, while being much simpler than the previous construction of Lu et al. (STOC "03) and improving upon it when the error parameter is small (e.g. 1/poly(n)).
The effects of finite bit precision for a VLSI implementation of the constant modulus algorithm
Authors: G. P. Fettweis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

One of the most popular blind equalization techniques is the constant modulus algorithm (CMA), and it has gained popularity in the literature and in practice because of its LMS-like complexity and its robustness to non-ideal, but practical, conditions. Although the CMA has been well-studied in the literature, these analyses have typically implemented the algorithm using "infinite" precision arithmetic. The motivation for this paper is a VLSI implementation of a high data rate, fractionally spaced, linear forward equalizer whose taps are adjusted using the CMA. We examine how implementing the CMA using finite bit precision affects the algorithm's performance.
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
Authors: Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a new non-terminal symbol. We present a new text compression algorithm by simplifying the algorithm presented in [dl. We give a new formulation of the correctness proof introducing the sparse lazy sufix tree data structure. We also present another type of longest first substitution strategy that allows better compression. W e show results of preliminary experiments comparing grammar sizes of the two versions of the longest first strategy and the most frequent strategy.
Using the web to enhance education
Authors: A. J. Turner
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Many educational uses for the Internet and WWW have been proposed for enhancing education in computing courses as well as in courses of other disciplines. Some uses of the web have been quite successful and provide a positive contribution toward enhancing a course. However, other uses of the web may not provide benefits that are worth the effort that is required. This paper discusses some experiences in using the Internet and WWW for teaching computing courses. Observations are made about the perceived value of some of these, and some suggestions are made for their effective use.
Web++: a system for fast and reliable web service
Authors: Radek Vingralek, Yuri Breitbart, Mehmet Sayal, Peter Scheuermann
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

We describe the design of a system for a fast and reliable HTTP service termed Web++. Web++ achieves high reliability by dynamically replicating Web data among multiple Web servers. Web++ selects a server which is available and that is expected to provide the fastest response time. Furthermore, Web++ guarantees data delivery, provided that at least one server containing the requested data is available. After detecting a server failure, Web++ client requests are satisfied transparently to the client by another server. Web++ is built on top of the standard HTTP protocol and does not require any changes either in existing Web browsers, or the installation of any software on the client side. We implement a Web++ prototype; performance experiments indicate that Web++ improves the client response time on average by 36.6%, and in many cases by as much as 59%, when compared with the current Web performance.
Density estimation and application to robust multiuser detection in heavy tailed noise
Authors: D. S. Pham, A. M. Zoubir
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

We address the problem of robust multiuser detection in heavy tailed noise. A number of multiuser detectors which have been proposed require parametric channel noise models. The rigidity in the design of these detectors can make them far from optimal when the channel noise is not close to the assumed distribution. Nonparametric detectors, on the other hand, make no assumption about the noise parameters and have been shown to be robust in different types of channel noise. In this paper, we propose a new class of detector which makes use of some a priori channel information. Simulations show that the proposed detector, under regular circumstances, exhibits robust detection over a wide range of channel noise types and outperforms the nonparametric detector at a lower computational cost.
Co-evolving automata negotiate with a variety of opponents
Authors: D. D. B. van Bragt, J. A. La Poutre
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Real-life negotiations typically involve multiple parties with (i) different preferences for the different issues and (ii) bargaining strategies which change over time. Such a dynamic environment (with imperfect information) is addressed in this paper with a multi-population evolutionary algorithm (EA). Each population represents an evolving collection of bargaining strategies in our setup. The bargaining strategies are represented by a special kind of finite automata, which require only two transitions per state. We show that such automata (with a limited complexity) are a suitable choice in a computational setting. We furthermore describe an EA which generates highly-efficient bargaining automata in the course of time. A series of computational experiments shows that co-evolving automata are able to discriminate successfully between different opponents, although they receive no explicit information about the identity or preferences of their opponents. These results are important for the further development of evolving automata for real-life (agent system) applications.
Spoken language understanding method using confidence measure and dialogue history
Authors: Noriki Fujiwara, Toshihiko Itoh, Kenji Araki, Atsuhiko Kai, Tatsuhiro Konishi, Yukihiro Itoh
Venue: Systems and Computers in Japan (2007)

In the real environment, it is hard for a speech recognizer to avoid misrecognitions completely. However, if misrecognitions occur, user's intentions are usually misunderstood by a conventional language understanding technique, which simply gives priority to the higher rank hypothesis of a speech recognition result (N-best). The utterances in a dialogue are coherent and correct user's intentions might appear in the lower rank hypothesis of N-best. To understand user's speech intentions in the real environment, we propose the language understanding technique that utilizes the dialogue context and confidence measure, which is the word posterior probability. The experimental results show that proposed technique is more efficient (about 15&percnt;) than the conventional technique. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 21&ndash; 31, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20758
Betting on permutations
Authors: Yiling Chen, Lance Fortnow, Evdokia Nikolova, David M. Pennock
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

We consider a permutation betting scenario, where people wager on the final ordering of n candidates: for example, the outcome of a horse race. We examine the auctioneer problem of risklessly matching up wagers or, equivalently, finding arbitrage opportunities among the proposed wagers. Requiring bidders to explicitly list the orderings that they'd like to bet on is both unnatural and intractable, because the number of orderings is n! and the number of subsets of orderings is 2n!. We propose two expressive betting languages that seem natural for bidders, and examine the computational complexity of the auctioneer problem in each case. Subset betting allows traders to bet either that a candidate will end up ranked among some subset of positions in the final ordering, for example, "horse A will finish in positions 4, 9, or 13-21", or that a position will be taken by some subset of candidates, for example "horse A, B, or D will finish in position 2". For subset betting, we show that the auctioneer problem can be solved in polynomial time if orders are divisible. Pair betting allows traders to bet on whether one candidate will end up ranked higher than another candidate, for example "horse A will beat horse B". We prove that the auctioneer problem becomes NP-hard for pair betting. We identify a sufficient condition for the existence of a pair betting match that can be verified in polynomial time. We also show that a natural greedy algorithm gives a poor approximation for indivisible orders.
Automated IVUS Contour Detection Using Intesity Features and Radial Basis Function Approximation
Authors: Maria Papadogiorgaki, Vasileios Mezaris, Yiannis S. Chatzizisis, George D. Giannoglou, Ioannis Kompatsiaris
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Intravascular ultrasound (IVUS) constitutes a valuable technique for the diagnosis and management of coronary atherosclerosis. The detection of lumen and media-adventitia borders in IVUS images represents a necessary step in the utilization of the IVUS data for the reliable quantitative assessment of atherosclerotic lesions. In this paper, a fully automated technique for the detection of lumen and media-adventitia boundaries is developed. This comprises two different steps for contour initialization, one for each corresponding contour of interest, and a procedure for the refinement of the detected contours based on Radial Basis Function approximation. The proposed approach is shown to be capable of performing quick and reliable automated segmentation of IVUS images.
A genetic algorithm for integrated cell formation and layout decisions
Authors: Xiaodan Wu, Chao-Hsien Chu, Yunfeng Wang, Weli Yan
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Presents a hierarchical genetic algorithm (GA) to solve the cell formation and layout decisions of cellular manufacturing. The intrinsic features of our proposed GA include using a hierarchical chromosome structure to encode concurrent cell design and layout decisions, developing a new selection scheme to dynamically consider two highly correlated fitness functions, and proposing a group mutation operator to increase the probability of mutation. Our tests show that these modifications are fairly effective in improving solution quality as well as shortening the speed of convergence.
Using design, build, and test projects to teach engineering
Authors: D. F. Elger
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The design, build and test (DBT) project was created with the idea that the best way to learn engineering is by doing engineering. The primary goal of a DBT project is to provide students with an experience that is fun, motivating and educational. In addition, a DBT project is designed to be easy to implement. The preeminent feature of a DBT project is the extensive use of science, math, and calculations to guide design efforts prior to construction. Key factors in designing an effective DBT project are: selecting an appealing topic that is amenable to simple prototype construction; using metrics to define the project goal; instituting a mentoring culture; involving substantial mathematical modeling; guiding students using iteration cycles; motivating students by using competition and public presentation; and continuously improving a project by collecting project resources.
Automatic misconfiguration troubleshooting with peerpressure
Authors: Helen J. Wang, John C. Platt, Yu Chen, Ruyun Zhang, Yi-Min Wang
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

Technical support contributes 17% of the total cost of ownership of today's desktop PCs [25]. An important element of technical support is troubleshooting miscon-figured applications. Misconfiguration troubleshooting is particularly challenging, because configuration information is shared and altered by multiple applications. In this paper, we present a novel troubleshooting system: PeerPressure, which uses statistics from a set of sample machines to diagnose the root-cause misconfigurations on a sick machine. This is in contrast with methods that require manual identification on a healthy machine for diagnosing misconfigurations [30]. The elimination of this manual operation makes a significant step towards automated misconfiguration troubleshooting. In PeerPressure, we introduce a ranking metric for misconfiguration candidates. This metric is based on empirical Bayesian estimation. We have prototyped a PeerPressure troubleshooting system and used a database of 87 machine configuration snapshots to evaluate its performance. With 20 real-world troubleshooting cases, PeerPressure can effectively pinpoint the root-cause misconfigurations for 12 of these cases. For the remaining cases, PeerPressure significantly narrows down the number of root-cause candidates by three orders of magnitude.
Multiwavelet systems with disjoint multiscaling functions
Authors: F. C. A. Fernandes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper describes the first steps toward a multiwavelet system that may retain the advantages of a traditional multiwavelet system while alleviating some of its disadvantages. We attempt to achieve this through the introduction of a novel property-the disjoint support of the multiscaling functions. We derive the conditions on the matrix filter coefficients that guarantee the disjoint support of multiscaling functions. The preliminary results demonstrate that multiwavelet systems with this property may be arbitrarily complex. We then establish the existence of multiwavelet systems with two scaling functions and approximation order=2.