ppxscal/embedding_network huggingface dataset:
Tool support for executable documentation of Java class hierarchies: Research Articles
Authors: Daniel Hoffman, Paul Strooper, Sarah Wilkin
Venue: Software Testing, Verification Reliability (2005)

While object-oriented programming offers great solutions for today's software developers, this success has created difficult problems in class documentation and testing. In Java, two tools provide assistance: Javadoc allows class interface documentation to be embedded as code comments and JUnit supports unit testing by providing assert constructs and a test framework. This paper describes JUnitDoc, an integration of Javadoc and JUnit, which provides better support for class documentation and testing. With JUnitDoc, test cases are embedded in Javadoc comments and used as both examples for documentation and test cases for quality assurance. JUnitDoc extracts the test cases for use in HTML files serving as class documentation and in JUnit drivers for class testing. To address the difficult problem of testing inheritance hierarchies, JUnitDoc provides a novel solution in the form of a parallel test hierarchy. A small controlled experiment compares the readability of JUnitDoc documentation to formal documentation written in Object-Z. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Template-Based Privacy Preservation in Classification Problems
Authors: Ke Wang, Benjamin C. M. Fung, Philip S. Yu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper, we present a template-based privacy preservation to protect against the threats caused by data mining abilities. The problem has dual goals: preserve the information for a wanted classification analysis and limit the usefulness of unwanted sensitive inferences that may be derived from the data. Sensitive inferences are specified by a set of "privacy templates". Each template specifies the sensitive information to be protected, a set of identifying attributes, and the maximum association between the two. We show that suppressing the domain values is an effective way to eliminate sensitive inferences. For a large data set, finding an optimal suppression is hard, since it requires optimization over all suppressions. We present an approximate but scalable solution. We demonstrate the effectiveness of this approach on real life data sets.
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm
Authors: Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper, we study frequent-subsequence extraction from a single very-long data-sequence. First we propose a novel frequency measure, called the total frequency, for counting multiple occurrences of a sequential pattern in a single data sequence. The total frequency is anti-monotonic, and makes it possible to count up pattern occurrences without duplication. Moreover the total frequency has a good property for implementation based on the dynamic programming strategy. Second we give a simple on-line algorithm for a specialized subsequence extraction problem, i.e., a problem with the infinite window-length. This specialized problem is considered to be a relaxation of the general-case problem, thus this fast on-line algorithm is important from the view of practical applications.
The Interactive 3D BreakAway Map: A navigation and examination aid for multi-floor 3D worlds
Authors: Luca Chittaro, Vijay Kumar Gatla, Subramanian Venkataraman
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper, we propose the Interactive 3D BreakAway Map (I3BAM), an extension of the wellknown Worlds In Miniature [6]. The I3BAM supports user navigation in virtual buildings as a navigation aid, but also provides a means of examining any floor of a virtual building without having to necessarily navigate it. The aid presents multiple views of a virtual building and provides information about both the internal and external structure of a building. The paper also includes some implementation details and shows an application of the I3BAM to help users learn how to navigate real buildings.
Documenting for software maintenance
Authors: Robert L. Glass
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

A curious phenomenon has occurred over the last several years in the field of software system documentation. 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
Fast and automated generation of attack signatures: a basis for building self-protecting servers
Authors: Zhenkai Liang, R. Sekar
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simply unable to cope with the volume and speed with which new vulnerabilities are being discovered. In this paper, we develop a new approach that can provide effective protection against a vast majority of these attacks that exploit memory errors in C/C++ programs. Our approach, called COVERS, uses a forensic analysis of a victim server's memory to correlate attacks to inputs received over the network, and automatically develop a signature that characterizes inputs that carry attacks. The signatures tend to capture characteristics of the underlying vulnerability (e.g., a message field being too long) rather than the characteristics of an attack, which makes them effective against variants of attacks. Our approach introduces low overheads (under 10%), does not require access to source code of the protected server, and has successfully generated signatures for the attacks studied in our experiments, without producing false positives. Since the signatures are generated in tens of milliseconds, they can potentially be distributed quickly over the Internet to filter out (and thus stop) fast-spreading worms. Another interesting aspect of our approach is that it can defeat guessing attacks reported against address-space randomization and instruction set randomization techniques. Finally, it increases the capacity of servers to withstand repeated attacks by a factor of 10 or more.
Exponent parameter estimation for generalized Gaussian probability density functions with application to speech modeling
Authors: Kostas Kokkinakis, Asoke K. Nandi
Venue: Signal Processing (2005)

In this contribution, we exploit entropy matching to estimate the exponent parameter of a generalized Gaussian density. Based on this premise, we derive a new entropic expression with respect to higher-order moments of the modeled data, which yields a novel generalized source entropy matching estimator (G-EME). A number of other popular statistical methods are also reviewed, described and compared against the proposed technique. Extensive comparative experimental results illustrate the high accuracy of the proposed estimator, for both light- and heavy-tailed distributions, as well as speech data.
Interconnecting 802.15.4 clusters in master-slave mode: queueing theoretic analysis
Authors: Jelena Misic, Jun Fung, Vojislav B. Misic
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this work we investigate the performance of two IEEE 802.15.4 network clusters interconnected through a masterslave bridge which is also the coordinator of one of the clusters. Both clusters operate in beacon enabled, slotted CSMA-CA regime. We apply queueing theoretic analysis to investigate the effects of the CSMA-CA MAC as well as those of the limited buffer size at the coordinator/bridge node.
Radio's next generation: Radii
Authors: Dan Rasmussen, Paul D. Norton, Jon Morgan
Venue: Linux Journal (2005)

Hours of commercial-free programs, your favorite music and you might even catch Doc Searls. Bring Internet radio to your regular listening spot.
Automated Prototyping of User Interfaces Based on UML Scenarios
Authors: Mohammed Elkoutbi, Ismaïl Khriss, Rudolf K. Keller
Venue: Automated Software Engineering (2006)

User interface (UI) prototyping and scenario engineering have become popular techniques. Yet, the transition from scenario to formal specifications and the generation of UI code is still ill-defined and essentially a manual task, and the two techniques lack integration in the overall requirements engineering process. In this paper, we suggest an approach for requirements engineering that generates a user interface prototype from scenarios and yields a formal specification of the application. Scenarios are acquired in the form of collaboration diagrams as defined by the Unified Modeling Language (UML), and are enriched with user interface (UI) information. These diagrams are automatically transformed into UML Statechart specifications of the UI objects involved. From the set of obtained specifications, a UI prototype is generated that is embedded in a UI builder environment for further refinement. Based on end user feedback, the collaboration diagrams and the UI prototype may be iteratively refined, and the result of the overall process is a specification consisting of the Statechart diagrams of all the objects involved, together with the generated and refined prototype of the UI. The algorithms underlying this process have been implemented and exercised on a number of examples.
Rayskip: faster ray tracing of implicit surface animations
Authors: Erwin de Groot, Brian Wyvill
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Implicit surfaces offer several advantages over other volume representations, but despite the ease with which CSG and smooth blending can be used to construct complex models they are not commonly used. The main reason for this is the long visualization time, especially when the surface is being rendered using ray tracing.In this paper an algorithm called RaySkip is described. Rayskip improves rendering times of ray tracing animations of implicit surfaces (19% to 55% per frame). This is accomplished by exploiting object space coherence and temporal coherence, reducing the number of evaluations of the surface needed to trace a ray.
An Efficient Distributed Algorithm for Constructing Delay and Degree-Bounded Application-Level Multicast Tree
Authors: Feng Liu, Xicheng Lu, Yuxing Peng, Jingshu Huang
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper we investigate the problem of finding a delay- and degree-bounded maximum sum of nodes application level multicast tree. We then proved the problem is NP-hard, and its relationship with the wellstudied degree-bounded minimum maximum-delay multicast tree problem. We propose a distributed algorithm---OverStream, which adopts PPAF heuristic for father node to choose optimal child nodes based on multiple network parameters. Simulation results show that our algorithm is better than OMNI, SpreadIt, HMTP, and Zigzag in general.
Boosting Color Saliency in Image Feature Detection
Authors: Joost van de Weijer, Theo Gevers, Andrew D. Bagdanov
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

The aim of salient feature detection is to find distinctive local events in images. Salient features are generally determined from the local differential structure of images. They focus on the shape-saliency of the local neighborhood. The majority of these detectors are luminance-based, which has the disadvantage that the distinctiveness of the local color information is completely ignored in determining salient image features. To fully exploit the possibilities of salient point detection in color images, color distinctiveness should be taken into account in addition to shape distinctiveness. In this paper, color distinctiveness is explicitly incorporated into the design of saliency detection. The algorithm, called color saliency boosting, is based on an analysis of the statistics of color image derivatives. Color saliency boosting is designed as a generic method easily adaptable to existing feature detectors. Results show that substantial improvements in information content are acquired by targeting color salient features.
Networked game mobility model for first-person-shooter games
Authors: Swee Ann Tan, William Lau, Allan Loh
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

This paper proposes the Networked Game Mobility Model (NGMM), for synthesising mobility in First-Person-Shooter (FPS) networked games. Current networked game research focuses on modelling low-level aspects, such as packet inter-arrival times and packet sizes, to optimise network traffic and efficient use of gaming servers. Due to the increasing popularity of multiplayer online games, the need has arisen to develop more realistic models. NGMM is such a model that utilises application level aspects of networked game traces to statistically model FPS games. It is believed that an understanding of the application level aspect (e.g. mobility and user actions) of the network is necessary to derive the causality of increasing workloads on the servers, particularly in response to increasing online game popularity. To evaluate the performance of the model simulations, comparisons are made between the original game traces, the Random Way Point Model and NGMM. Analyses of the comparative simulation results show that NGMM is capable of closely matching actual game traces. The incorporation of application level knowledge, performance boundaries of current optimisation techniques, including dead-reckoning and interest management, are also effectively ascertained in this research. This is particularly significant as current models are unable to evaluate their impact with optimisation techniques.
IT Expanding in New Ways
Authors: Frank E. Ferrante
Venue: IT Professional (2005)

Now in its seventh year, IT Professional has covered the ever-expanding IT world with leading-edge features on public safety communications, Web services, and outsourcing. In his farewell letter, Editor in Chief Frank Ferrante predicts even more expansion on the horizon and stresses the importance of covering IT issues globally and in a unified fashion.
A Scalable Low Power Imager Architecture for Compound-Eye Vision Sensors
Authors: Farid Boussaid, Chen Shoushun, Amine Bermak
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper, we propose a scalable low power imager architecture for compound-eye vision sensors. The proposed hardware architecture is based on a time domain data representation as well as a biologically inspired read-out strategy using Address-Event-Representation (AER). The proposed AER approach to compound-eye imaging enables low power operation (10nA/pixel), efficient read-out, improved signal-to-noise ratio together with wide dynamic range. Moreover, the proposed AER-based VLSI architecture is scalable and well suited to the next generation of deep submicron silicon processes owing to decreased supply voltage, process variability and increased noise levels.
Robustness of threshold policies in beneficiary-donor model
Authors: Mor Harchol-Balter, Takayuki Osogami, Alan Scheller-Wolf
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

A common problem in multiserver systems is deciding how to allocate resources among jobs so as to minimize mean response time. Since good parameter settings typically depend on environmental conditions such as system loads, an allocation policy that is optimal in one environment may provide poor performance when the environment changes, or when the prediction of the environment is wrong. We say that such a policy is not robust. In this paper, we analytically compare the robustness of several threshold-based allocation policies, in a dual server beneficiary-donor model. We introduce two types of robustness: static robustness, which measures robustness against mis-estimation of the true load, and dynamic robustness, which measures robustness against fluctuations in the load. We find that policies employing multiple thresholds offer significant benefit over single threshold policies with respect to static robustness. Yet they surprisingly offer much less benefit with respect to dynamic robustness.
Advanced middleware support for distributed data-intensive applications
Authors: Gagan Agrawal
Venue:  (2005)

A coarse-grained pipelined execution model provides a natural vehicle for executing applications on the distributed or grid environment. Here, the processing associated with an application is carried out at several stages, which are executed on a pipeline of computing units. Each stage handles the intermediate results obtained from the previous one, and packs the current output for the following stage. Typically, the first stage in this pipeline is the unit where the input data is available, and the last stage is where the final results are to be viewed. In this thesis, I present language and compiler supports for developing such applications. These supports could allow programmers to focus on writing a sequential code to specify the application-specific tasks without worrying about the details not directly related to applications. Our extended language constructs can help expose both pipelined and data parallelism to the compiler. Then our compilation system is responsible for selecting a set of candidate filter boundaries, determining the volume of communication required if a particular boundary is chosen, performing the decomposition, and generating code for execution on coarse-grained pipelined execution model. To support the adaptivity aspect of the applications, we adopted a hybrid methodology, which combines compile-time analysis with runtime feedback. A program analysis algorithm states the execution time of an application component as a function of the values of the adaptation parameters and other runtime constants. These constants are determined by initial runs of the application in the target environment. Based on these calculated constants, adaptation parameters can be modified and corresponding adjustment steps allow user to achieve a given change in execution time, or to retain the same performance under a particular variation in available resources. Substantial amount of experiments have been carried out to assess this dissertation, which shows the proposed algorithms and models work quite effectively in practice. The dissertation concludes with a set of open research questions that frame the future work. (Abstract shortened by UMI.)
Heteroscedastic Gaussian process regression
Authors: Quoc V. Le, Alex J. Smola, Stéphane Canu
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

This paper presents an algorithm to estimate simultaneously both mean and variance of a non parametric regression problem. The key point is that we are able to estimate variance locally unlike standard Gaussian Process regression or SVMs. This means that our estimator adapts to the local noise. The problem is cast in the setting of maximum a posteriori estimation in exponential families. Unlike previous work, we obtain a convex optimization problem which can be solved via Newton's method.
Features of a general continuous systems network simulator
Authors: Walter L. Whipple
Venue: ACM SIGSIM Simulation Digest (1972)

In the last few years, a large number of simulation programs has been developed for the solution of specialized problems. These programs differ in a number of respects, but the most important reason for their development seems to be an unwillingness to use a tool which does not use input-output forms which are familiar to the user. Of course, the algorithms and problem formulations also differ, but it is not obvious to the author that there is any reason why different algorithms would be necessary for electrical and electronic circuits analysis, for example. Many simulation studies need a network analysis capability whether the investigation involves electronics, structures, thermodynamics, or industrial dynamics. Yet no general purpose simulation language seems to provide the capability with sufficient flexibility to replace the many special purpose programs now being used. It is the thesis of this paper that such a general purpose simulator is feasible and desirable.
Augmented Coliseum: An Augmented Game Environment with Small Vehicles
Authors: Minoru KOJIMA, Maki SUGIMOTO, Akihiro NAKAMURA, Masahiro TOMITA, Masahiko INAMI, Hideaki NII
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

We propose a novel display-based game environment using augmented reality technology with small robots. In this environment, the small robots can be augmented by a display image according to their positions and postures. The augmentation activity reinforces the fun of playing with such small robots in the real world.
Proof linking: a modular verification architecture for mobile code systems
Authors: Philip W. L. Fong
Venue:  (2004)

This dissertation presents a critical rethinking of the Java bytecode verification architecture from the perspective of a software engineer. In existing commercial implementations of the Java Virtual Machine, there is a tight coupling between the dynamic linking process and the bytecode verifier. This leads to delocalized and interleaving program plans, making the verifier difficult to maintain and comprehend. A modular mobile code verification architecture, called Proof Linking, is proposed. By establishing explicit verification interfaces in the form of proof obligations and commitments, and by careful scheduling of linking events, Proof Linking supports the construction of bytecode verifier as a separate engineering component, fully decoupled from Java's dynamic linking process. This turns out to have two additional benefits: (1) Modularization enables distributed verification protocols, in which part of the verification burden can be safely offloaded to remote sites; (2) Alternative static analyses can now be integrated into Java's dynamic linking process with ease, thereby making it convenient to extend the protection mechanism of Java. These benefits make Proof Linking a competitive verification architecture for mobile code systems. A prototype of the Proof Linking Architecture has been implemented in an open source Java Virtual Machine, the Aegis VM (http://aegisvm.sourceforge.net). On the theoretical side, the soundness of Proof Linking was captured in three correctness conditions: Safety, Monotonicity and Completion. Java instantiations of Proof Linking with increasing complexity have been shown to satisfy all the three correctness conditions. The correctness proof had been formally verified by the PVS proof checker.