ppxscal/embedding_network huggingface dataset:
Authentication of LZ-77 compressed data
Authors: Mikhail J. Atallah, Stefano Lonardi
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The formidable dissemination capability allowed by the current network technology makes it increasingly important to devise new methods to ensure authenticity. Nowadays it is common practice to distribute documents in compressed form. In this paper, we propose a simple variation on the classic LZ-77 algorithm that allows one to hide, within the compressed document, enough information to warrant its authenticity. The design is based on the unpredictability of a certain class of pseudo-random generators, in such a way that the hidden data cannot be retrieved in a reasonable amount of time by an attacker (unless the secret bit-string key is known). Since it can still be decompressed by the original LZ-77 algorithm, the embedding is completely "transparent". Preliminary experiments show also the degradation in compression due to the embedding is almost negligible.
Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
Authors: Laurence A. Wolsey
Venue: Management Science (2002)

Based on research on the polyhedral structure of lot-sizing models over the last 20 years, we claim that there is a nontrivial fraction of practical lot-sizing problems that can now be solved by nonspecialists just by taking an appropriate a priori reformulation of the problem, and then feeding the resulting formulation into a commercial mixed-integer programming solver.This claim uses the fact that many multi-item problems decompose naturally into a set of single-item problems with linking constraints, and that there is now a large body of knowledge about single-item problems. To put this knowledge to use, we propose a classification of lot-sizing problems (in large part single-item) and then indicate in a set of tables, what is known about a particular problem class and how useful it might be. Specifically, we indicate for each class (i) whether a tight extended formulation is known, and its size; (ii) whether one or more families of valid inequalities are known defining the convex hull of solutions, and the complexity of the corresponding separation algorithms; and (iii) the complexity of the corresponding optimization algorithms (which would be useful if a column generation or Lagrangian relaxation approach was envisaged).Three distinct multi-item lot-sizing instances are then presented to demonstrate the approach, and comparative computational results are presented. Finally, we also use the classification to point out what appear to be some of the important open questions and challenges.
Model determination tool (MDT): a multipurpose software engineering learning utensil
Authors: Michael M. Pickard, Jason R. Adams
Venue: ACM SIGCSE Bulletin (2003)

This paper describes a technique used in introductory undergraduate and graduate software engineering courses at Stephen F. Austin State University. It provided a team software development experience, encouraged enriched learning about software process models, served as the object of black-box testing, and gave students the opportunity to perform software maintenance activities that mimic real-life situations. A graduate software engineering class developed a tool to recommend consideration of appropriate software process models according to the responses to a small set of questions concerning the development environment and the nature of the project. Later, undergraduate classes performed black-box testing to determine whether the artifact performed correctly. More than a year after the original development, a second graduate class was challenged to perform maintenance actions on the product, about which none of the students had any knowledge or experience.
A Conversation with Will Harvey
Authors: Chris DiBona
Venue: Queue (2004)

In many ways online games are on the bleeding edge of software development. That puts Will Harvey, founder and executive vice president of Menlo Park-based There, right at the front of the pack. There, which just launched its product in October, is a virtual 3D world designed for online socializing.
Design of an Application Specific Instruction Set Processor for Parametric Speech Synthesis
Authors: Ravi Saini, Pramod Tanwar, A. S. Mandal, S. C. Bose, Raj Singh, Chandra Shekhar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Parametric speech synthesizers utilize digital parameterizedsource-filter models for modeling the process ofproduction of human speech. They are used in speech synthesissystems with an unlimited vocabulary. Presently, they are availableas C language codes that run on PC platforms. They requirea moderately high throughput of a mix of floating-point DSPfunctions and non-DSP (general-purpose) type computations.For embedded unlimited vocabulary speech synthesis systems,therefore, a need has been felt for the design of an ApplicationSpecific Integrated Processor for parametric speech synthesis.The present work describes the design of an Application SpecificInstruction Set Processor (ASIP) for parametric speech synthesisthat can serve the needs of embedded speech synthesis systems.
The More Things Change . . .
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2004)

If applications were static, maintenance efforts primarily could focus on tracking down and fixing intermittent bugs that appeared only after days or weeks of continuous operation. Unfortunately, middleware applications rarely are static. Not only do changing business requirements impact the applications themselves, but for a variety of reasons, the various platforms, operating systems, and middleware underneath the applications also change. Dealing with versioning and change management in a deployed middleware application can be complicated and costly.
Compact and localized distributed data structures
Authors: Cyril Gavoille, David Peleg
Venue: Distributed Computing (2003)

This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels, selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.
Simulation in Web data management
Authors: G. I. Papadimitriou, A. I. Vakali, G. Pallis, S. Petridou, A. S. Pomportsis
Venue: Applied system simulation: methodologies and applications (2003)

The enormous growth in the number of documents circulated over the Web increases the need for improved Web data management systems. In order to evaluate the performance of these systems, various simulation approaches must be used. In this paper, we study the main simulation models that have been deployed for Web data management. More specifically, we survey the most recent simulation approaches, for Web data representation and storage (in terms of caching) as well as for Web data trace evaluation.
Multidimensional data modeling for location-based services
Authors: Christian S. Jensen, Augustas Kligys, Torben Bach Pedersen, Igor Timko
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2004)

With the recent and continuing advances in areas such as wireless communications and positioning technologies, mobile, location-based services are becoming possible.Such services deliver location-dependent content to their users. More specifically, these services may capture the movements and requests of their users in multidimensional databases, i.e., data warehouses, and content delivery may be based on the results of complex queries on these data warehouses. Such queries aggregate detailed data in order to find useful patterns, e.g., in the interaction of a particular user with the services.The application of multidimensional technology in this context poses a range of new challenges. The specific challenge addressed here concerns the provision of an appropriate multidimensional data model. In particular, the paper extends an existing multidimensional data model and algebraic query language to accommodate spatial values that exhibit partial containment relationships instead of the total containment relationships normally assumed in multidimensional data models. Partial containment introduces imprecision in aggregation paths. The paper proposes a method for evaluating the imprecision of such paths. The paper also offers transformations of dimension hierarchies with partial containment relationships to simple hierarchies, to which existing precomputation techniques are applicable.
Optimization of Integrated Spiral Inductors Using Sequential Quadratic Programming
Authors: Yong Zhan, Sachin S. Sapatnekar
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The optimization of integrated spiral inductors has great practical importance. Previous optimization methods used in this field are either too slow or depend on very simplified assumptions in the device modeling which result in the algorithm only applicable to low-frequency cases. In this paper, we propose using the sequential quadratic programming(SQP) approach to optimize the on-chip spiral inductors. A physical model based on first principles is used in the back-end device-parameter extraction engine which makes the algorithm suitable to the optimization at any frequency range. In addition, compared with enumeration, which is used in many inductance optimization packages, our experiments show that the SQP algorithm can achieve at least an order of magnitude speedup while maintaining the same quality of the optimized design.
A software reverse engineering experience
Authors: Erich Buss, John Henshaw
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

This paper reviews the progress-to-date of the application of program reverse engineering technologies to a large-scale legacy software product. Basic reverse engineering concepts and a project overview are outlined, followed by a description of the legacy software product, the reverse engineering toolkit used, and analysis and discussion of the experiences so far. Future research directions and summary comments are then detailed.
An iterative hypothesis-testing strategy for pattern discovery
Authors: Richard J. Bolton, Niall M. Adams
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Pattern discovery has emerged as a direct result of increased data storage and analytic capabilities available to the data analyst. Without a massive amount of data, we do not have the evidence to support the discovery of the local deterministic structures that we call patterns. As such, pattern discovery is one of the few areas of data mining that cannot be considered simply as a 'scaling-up' of current statistical methodology to analyze large data sets. However, the philosophies of hypothesis testing and modeling in traditional statistics do lend themselves to forming a framework for pattern discovery, and we can also draw from ideas relating to outlier discovery and residual analysis to discover patterns. We illustrate an iterative strategy in a statistical framework by way of its application to one simulated and two real data sets.
Story fountain: intelligent support for story research and exploration
Authors: Paul Mulholland, Trevor Collins, Zdenek Zdrahal
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Increasingly heritage institutions are making digital artifacts available to the general public and research groups to promote the active exploration of heritage and encourage visits to heritage sites. Stories, such as folklore and first person accounts form a useful and engaging heritage resource for this purpose. Story Fountain provides intelligent support for the exploration of digital stories. The suite of functions provided in Story Fountain together support the investigation of questions and topics that require the accumulation, association or induction of information across the story archive. Story Fountain provides specific support toward this end such as for comparing and contrasting story concepts, the presentation of story paths between concepts, and mapping stories and events according to properties such as who met whom and who lived where.
Sparse finite elements for stochastic elliptic problems: higher order moments
Authors: Ch. Schwab, Radu Alexandru Todor
Venue: Computing (2003)

We define the higher order moments associated to the stochastic solution of an elliptic BVP in D ⊂ Rd with stochastic input data. We prove that the k-th moment solves a deterministic problem in Dk ⊂ Rdk, for which we discuss well-posedness and regularity. We discretize the deterministic k-th moment problem using sparse grids and, exploiting a spline wavelet basis, we propose an efficient algorithm, of logarithmic-linear complexity, for solving the resulting system.
The KM Infrastructure: Making Implicit Knowledge Assets Explicit
Authors: Nilmini Wickramasinghe, Adam Fadlalla, Sushil K. Sharma
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Empirical case study data from a large spine unit in the United States offers evidence of the existence of sophisticated, implicit, knowledge assets based around multidisciplinary servicedelivery. Yet the full potential of these knowledge assets is not being realized. A knowledge management infrastructure model is proffered as a way of making explicit the elements of these knowledge assets. In addition, this model provides a systematic and robust approach tostructuring the conceptualization of knowledge assets across a range of business environments.
An approach to efficient, fault tolerant programming
Authors: David C. Pflasterer
Venue: ACM SIGPLAN Notices (1978)

In the past software reliability has sometimes been accomplished by an interpreter. The benefits of an interpretive approach have been it's susceptibility to fault tolerance, i.e. it's error detecting and correcting capabilities, Interpreters historically are too slow to be used as the execution complex in a production environment, however.An interpretive based mecharism is proposed in this paper to allow 1) fault tolerance within both the testing and production environment (i.e. the interpreter continues to provide at least a minimum of services even within a hostile environment), and 2) suitable efficiency within a production environment.
Optimal Decision Making in a Dynamic Model of Community Health
Authors: Jack Homer, Bobby Milstein
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

This paper presents results from a preliminary system dynamics simulation model of a hypothetical community in poor health and suffering from a "syndemic" of intertwined afflictions. Prevention science has moved from an emphasis on single diseases and epidemicstoward a more systemic, ecological perspective, including the concept of causal feedback. From this perspective, afflictions may be seen as being affected by -- but also as affecting over time -- adverse living conditions and the community's internal capability to address its health and social problems. System dynamics provides a methodology for translating this feedback view into testable form and analyzing its implications, including those involving policy decisions. Our simulation model is relatively compact, containing only three stocks and about 100 variables overall, including some thirty constants that specify fixed aspects of the community, the cluster of afflictions, the effectiveness of problem-fighting efforts, and the cost-effectiveness of potential outside assistance from government and philanthropies. The model is based on the literature and the observations of public health officials, researchers, and community health advocates, but has not yet been verified and refined through case study application. Nonetheless, optimization and sensitivity testing of the model have generated logically defensible hypotheses about the dynamic impacts on community health of various types of outside assistance and their relative benefits. One suchhypothesis is that the first priority for outside assistance in communities that are weak and struggling against multiple afflictions should be to assist in building community strength, perhaps even before substantial assistance is provided for direct fighting of prevalent diseases. Another possibility suggested by the model is that outside assistance aimed directly at improving living conditions may have downsides (time lags, unintended side effects) that render such assistance less beneficial in the absence of widespread citizen participation than other types of assistance for health improvement.
The IS risk analysis based on a business model
Authors: Bomil Suh, Ingoo Han
Venue: Information and Management (2003)

The disruption of operations due to IS failure becomes more important as IS has become an increasingly essential component of the organization's operations and can affect its strategic objectives. Nevertheless, traditional IS risk analysis methods do not adequately reflect the loss from disruption of operations in determining the value of IS assets. Quantitative methods do not measure the loss from disruption of operations. Qualitative methods consider the loss, but their results are subjective and not suitable for cost-benefit decision support. There is a lack of systematic methods to measure the value of IS assets from the viewpoint of operational continuity.This study presents an IS risk analysis method based on a business model. The method uses a systematic quantitative approach dealing with operational continuity: the importance of various business functions and the necessity level of various assets are first determined. The value of each asset is then determined based on these two levels.The proposed method adds the first stage, organizational investigation, to traditional risk analysis. The process of the method utilizes various methodologies such as paired comparison, asset-function assignment tables, and asset dependency diagrams.
Simulation and video software development for soil consolidation testing
Authors: U. F. A. Karim
Venue: Advances in Engineering Software (2003)

The development techniques and file structures of CTM, a novel multi-media (computer simulation and video) package on consolidation and laboratory consolidation testing, are presented in this paper. A courseware tool called Authorware proved to be versatile for building the package and the paper shows in details how the file structure of CTM is implemented within Authorware. In the audio-visual parts of the package background information, animations on consolidation theory and practice as well as standard and large-scale model consolidation tests, are shown. Running the package in a multi-user examination-type setting proved to be effective for learning and control of the learning process. Content-oriented multiple-choice questions on the theoretical and professional aspects of the test are posed, and users response is evaluated and reported on log files. Student users have responded positively to this development indicating minor future improvements.
A Study on the Content Distribution of Cooperative Proxy Caching Using Total Cost-Aware Scheme
Authors: Tian-Cheng Hu, Yasushi Ikeda, Minoru Nakazawa, Shimmi Hattori
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Along with the recent development of CDN, the web proxy caching has been adopted in many main techniques. In this paper, by contrast to the regular removal policies based on single proxy server, we prefer to evaluate a retrieved web object based on the metrics gathered from multiply proxy caches regionally. We particularly introduce a concept called post-removal analysis, which is used in measuring the value of the removed objects. Finally, we use the real proxy cache Squid to implement our proposal and modify the cache benchmarking tool Web Polygraph to test this cooperative prototype. The test results prove that the proposed scheme can optimize the content distribution and bring noticeable performance improvement.
Large-scale network parameter configuration using on-line simulation framework
Authors: Shivkumar Kalyanaraman
Venue:  (2003)

Today's Internet relies on a variety of important network protocols. The current parameter configuration process of these protocols is mainly manual and widely considered a black art. This thesis tackles this parameter setting problem by formulating it as a &ldquo;black-box&rdquo; optimization problem. In this approach, we use an on-line simulation system to monitor and simulate the network, and then use a black-box optimization algorithm to optimize the parameters of the concerned network protocol. This black-box approach allows flexibility in terms of objectives and metrics of the desired optimization and can be applied to a wide range of network protocols. We first investigate the properties of the underlying optimization problems. The desired optimization algorithm is expected to be highly efficient, scalable to high dimensions and robust to noisy objective functions. Based on these requirements, we propose a Recursive Random Search (RRS) algorithm whose major feature is its basis on random sampling. We empirically validate the advantages of RRS with extensive tests on a suite of benchmark functions and application in some real network optimization problems. To provide a more general solution for practical optimization problems, we also propose a Unified Search Framework (USF), which includes a variety of search techniques as building blocks and can be used as the platform to build tailored optimization strategies by combining a selection of building blocks. Furthermore, USF includes the mechanisms to parallelize search techniques and allocate available computing resources among them such that the resources are optimally utilized. Finally, we investigate the configuration problems of several network protocols, such as, Random Early Drop (RED), Open Shortest Path First (OSPF) and Border Gateway Protocol (BGP). We formulate these problems into black-box optimization problems, some of which have thousands of parameters. We then apply the optimization techniques developed in this thesis to them. Simulations and experiments have demonstrated the effectiveness and efficiency of the on-line simulation system and the proposed optimization techniques.