ppxscal/embedding_network huggingface dataset:
Memory safety without garbage collection for embedded applications
Authors: Dinakar Dhurjati, Sumant Kowshik, Vikram Adve, Chris Lattner
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2005)

Traditional approaches to enforcing memory safety of programs rely heavily on run-time checks of memory accesses and on garbage collection, both of which are unattractive for embedded applications. The goal of our work is to develop advanced compiler techniques for enforcing memory safety with minimal run-time overheads. In this paper, we describe a set of compiler techniques that, together with minor semantic restrictions on C programs and no new syntax, ensure memory safety and provide most of the error-detection capabilities of type-safe languages, without using garbage collection, and with no run-time software checks, (on systems with standard hardware support for memory management). The language permits arbitrary pointer-based data structures, explicit deallocation of dynamically allocated memory, and restricted array operations. One of the key results of this paper is a compiler technique that ensures that dereferencing dangling pointers to freed memory does not violate memory safety, without annotations, run-time checks, or garbage collection, and works for arbitrary type-safe C programs. Furthermore, we present a new interprocedural analysis for static array bounds checking under certain assumptions. For a diverse set of embedded C programs, we show that we are able to ensure memory safety of pointer and dynamic memory usage in all these programs with no run-time software checks (on systems with standard hardware memory protection), requiring only minor restructuring to conform to simple type restrictions. Static array bounds checking fails for roughly half the programs we study due to complex array references, and these are the only cases where explicit run-time software checks would be needed under our language and system assumptions.
Review of "Find the Bug: A Book of Incorrect Programs by Adam Barr"; Pearson Education, 2004, ISBN 0321223918
Authors: Joe Saur
Venue: ACM SIGSOFT Software Engineering Notes (2005)

Now, this is a real geek's book! Most of us would rather write code than read code, but all of us have had to spend hours (or days!) hunting for the elusive bug that's driving us crazy, and this book offers the opportunity to develop and refine our bug-finding skills. What a concept!
The Use of a Proximity Agent in a Collaborative Virtual Environment with 6 Degrees-of-Freedom Voxel-Based Haptic Rendering
Authors: Anthony Prior, Karen Haines
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The extension of software designed primarily for a single-user haptic environment to a multi-user collaborative environment presents challenges on several fronts. This paper discusses the use of a proximity agent to overcome problems associated with the time allowances for collision detection and subsequent force/torque generation between pairs of dynamic objects in a voxel-based collaborative haptic environment.
A Qualitative Comparison of Three Aspect Mining Techniques
Authors: M. Ceccato, M. Marin, K. Mens, L. Moonen, P. Tonella, T. Tourwe
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

The fact that crosscutting concerns (aspects) cannot be well modularized in object oriented software is an impediment to program comprehension: the implementation of a concern is typically scattered over many locations and tangled with the implementation of other concerns, resulting in a system that is hard to explore and understand. Aspect mining aims to identify crosscutting concerns in a system, thereby improving the systemýs comprehensibility and enabling migration of existing (object-oriented) programs to aspect-oriented ones. In this paper, we compare three aspect mining techniques that were developed independently by different research teams: fan-in analysis, identifier analysis and dynamic analysis. We apply each technique to the same case (JHotDraw) and mutually compare the individual results of each technique based on the discovered aspects and on the level of detail and quality of those aspects. Strengths, weaknesses and underlying assumptions of each technique are discussed, as well as their complementarity. We conclude with a discussion of possible ways to combine the techniques in order to achieve a better overall aspect-mining technique.
Software failure prediction based on a Markov Bayesian network model
Authors: C. G. Bai, Q. P. Hu, M. Xie, S. H. Ng
Venue: Journal of Systems and Software (2005)

Due to the complexity of software products and development processes, software reliability models need to possess the ability of dealing with multiple parameters. Also in order to adapt to the continually refreshed data, they should provide flexibility in model construction in terms of information updating. Existing software reliability models are not flexible in this context. The main reason for this is that there are many static assumptions associated with the models. Bayesian network is a powerful tool for solving this problem, as it exhibits strong ability to adapt in problems involving complex variant factors. In this paper, a software prediction model based on Markov Bayesian networks is developed, and a method to solve the network model is proposed. The use of our model is illustrated with an example.
Algorithmic detection of semantic similarity
Authors: Ana G. Maguitman, Filippo Menczer, Heather Roinestad, Alessandro Vespignani
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Automatic extraction of semantic information from text and links in Web pages is key to improving the quality of search results. However, the assessment of automatic semantic measures is limited by the coverage of user studies, which do not scale with the size, heterogeneity, and growth of the Web. Here we propose to leverage human-generated metadata --- namely topical directories --- to measure semantic relationships among massive numbers of pairs of Web pages or topics. The Open Directory Project classifies millions of URLs in a topical ontology, providing a rich source from which semantic relationships between Web pages can be derived. While semantic similarity measures based on taxonomies (trees) are well studied, the design of well-founded similarity measures for objects stored in the nodes of arbitrary ontologies (graphs) is an open problem. This paper defines an information-theoretic measure of semantic similarity that exploits both the hierarchical and non-hierarchical structure of an ontology. An experimental study shows that this measure improves significantly on the traditional taxonomy-based approach. This novel measure allows us to address the general question of how text and link analyses can be combined to derive measures of relevance that are in good agreement with semantic similarity. Surprisingly, the traditional use of text similarity turns out to be ineffective for relevance ranking.
Database in web environment
Authors: Radek Dvorak, Ivan Jelinek
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The goal is to find a universal model of a data source for accessing heterogeneous data spaces and heterogeneous types of information on the Internet/web. The key area of data sources of today's world are databases. However, to access them is very difficult due to the variety of their nature and the inconsistent approach to data and their accessing. That is why a well created model of a data source will enable an easy and mainly consistent approach to the data sources both saved in the classic (relational) or specialized databases (object, XML, etc.), and other data sources. It is the interlink between the data source and the user (man, computer), which will remove the inconsistency of accessing data and will secure a user-friendly tool for cooperating with the data source. The formalism of the model will include also nonstandard methods of search, such as general search, contextual search, search for non-textual information.
Tree automata with one memory set constraints and cryptographic protocols
Authors: Hubert Comon, Véronique Cortier
Venue: Theoretical Computer Science (2005)

We introduce a class of tree automata that perform tests on a memory that is updated using function symbol application and projection. The language emptiness problem for this class of tree automata is shown to be in DEXPTIME.We also introduce a class of set constraints with equality tests and prove its decidability by completion techniques and a reduction to tree automata with one memory.Finally, we show how to apply these results to cryptographic protocols. We introduce a class of cryptographic protocols and show the decidability of secrecy for an arbitrary number of agents and an arbitrary number of (concurrent or successive) sessions, provided that only a bounded number of new data is generated. The hypothesis on the protocol (a restricted copying ability) is shown to be necessary: without this hypothesis, we prove that secrecy is undecidable, even for protocols without nonces.
DE/EDA: a new evolutionary algorithm for global optimization
Authors: Jianyong Sun, Qingfu Zhang, Edward P. K. Tsang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

Differential evolution (DE) was very successful in solving the global continuous optimization problem. It mainly uses the distance and direction information from the current population to guide its further search. Estimation of distribution algorithm (EDA) samples new solutions from a probability model which characterizes the distribution of promising solutions. This paper proposes a combination of DE and EDA (DE/EDA) for the global continuous optimization problem. DE/EDA combines global information extracted by EDA with differential information obtained by DE to create promising solutions. DE/EDA has been compared with the best version of the DE algorithm and an EDA on several commonly utilized test problems. Experimental results demonstrate that DE/EDA outperforms the DE algorithm and the EDA. The effect of the parameters of DE/EDA to its performance is investigated experimentally.
Own-Brand and Cross-Brand Retail Pass-Through
Authors: David Besanko, Jean-Pierre Dubé, Sachin Gupta
Venue: Marketing Science (2005)

In this paper we describe the pass-through behavior of a major U.S. supermarket chain for 78 products across 11 categories. Our data set includes retail prices and wholesale prices for stores in 15 retail price zones for a one-year period. For the empirical model, we use a reduced-form approach that focuses directly on equilibrium prices as a function of exogenous supply- and demand-shifting variables. The reduced-form approach enables us to identify the theoretical pass-through rate without specific assumptions about the form of consumer demand or the conduct of a category-pricing manager. Thus, our measurements of pass-through are not constrained by specific structure on the underlying economic model. The empirical pricing model includes costs of all competing products in the category on the right-hand side (not only the cost of the focal brand) and yields estimates of both own-brand and cross-brand pass-through rates.Our results provide a rich picture of the retailer's pass-through behavior. We find that pass-through varies substantially across products and across categories. Own-brand pass-through rates are, on average, more than 60% for 9 of 11 categories, a finding that is at odds with the claims of manufacturers about retailers in general. Importantly, we find substantial evidence of cross-brand pass-through effects, indicating that retail prices of competing products are adjusted in response to a change in the wholesale price of any given product in the category. We find that cross-brand pass-through rates are both positive and negative. We explore determinants of own-brand and cross-brand pass-through rates and find strong evidence in multiple categories of asymmetric retailer response to trade promotions on large versus small brands. For example, brands with larger market shares, and brands that contribute more to retailer profits in the category, receive higher pass-through. We also find that trade promotions on large brands are less likely than small brands to generate positive cross-brand pass-through, i.e., induce the retailer to reduce the retail price of competing smaller products. On the other hand, small share brands are disadvantaged along three dimensions. Trade promotions on small brands receive low own-brand pass-throughand generate positive cross-brand pass-through for larger competing brands. Moreover, small share brands do not receive positive cross pass-through from trade promotions on these larger competitors. We also find that store brands are similarly disadvantaged with respect to national brands.
Optimal Allocation of Proposals to Reviewers to Facilitate Effective Ranking
Authors: Wade D. Cook, Boaz Golany, Moshe Kress, Michal Penn, Tal Raviv
Venue: Management Science (2005)

Peer review of research proposals and articles is an essential element in research and development processes worldwide. Here we consider a problem that, to the best of our knowledge, has not been addressed until now: how to assign subsets of proposals to reviewers in scenarios where the reviewers supply their evaluations through ordinal ranking. The solution approach we propose for this assignment problem maximizes the number of proposal pairs that will be evaluated by one or more reviewers. This new approach should facilitate meaningful aggregation of partial rankings of subsets of proposals by multiple reviewers into a consensus ranking. We offer two ways to implement the approach: an integer-programming set-covering model and a heuristic procedure. The effectiveness and efficiency of the two models are tested through an extensive simulation experiment.
Hughes research laboratories Trainable Text Skimmer: MUC-4 test results and analysis
Authors: Stephanie E. August, Charles P. Dolan
Venue: Proceedings of the 4th conference on Message understanding (1992)

Table 1 shows the official template-by-template score results for the Hughes Trainable Text Skimmer used for MUC-4 (TTS-MUC4) on TST3. TTS is a largely statistical system, using a set of Bayesian classifiers with the output of a shallow parser as features. (See the System Summary section of this volume for a detailed description of TTS-MUC4).
The BAT: a beginner's assembler tutor for the arcane art
Authors: Bill Walker
Venue: Journal of Computing Sciences in Colleges (2004)

Some might declare that knowledge of the "arcane art" of programming in assembler language is no longer relevant to computer science education. It is probably true that many, if not most, graduates of computer science degree programs spend much of their time contriving, more or less successfully, programs written in higher level languages such as C, C++, and so forth.
The Tomato Sequencing Project, the first cornerstone of the International Solanaceae Project (SOL): Conference Papers
Authors: Lukas A. Mueller, Steven D. Tanksley, Jim J. Giovannoni, Joyce van Eck, Stephen Stack, Doil Choi, Byung Dong Kim, Mingsheng Chen, Zhukuan Cheng, Chuanyou Li, Hongqing Ling, Yongbiao Xue, Graham Seymour, Gerard Bishop, Glenn Bryan, Rameshwar Sharma, Jiten Khurana, Akhilesh Tyagi, Debasis Chattopadhyay, Nagendra K. Singh, Willem Stiekema, P. Lindhout, Taco Jesse, Rene Klein Lankhorst, Mondher Bouzayen, Daisuke Shibata, Satoshi Tabata, Antonio Granell, Miguel A. Botella, Giovanni Giuliano, Luigi Frusciante, Mathilde Causse, Dani Zamir
Venue: Comparative and Functional Genomics (2005)

The genome of tomato (Solanum lycopersicum) is being sequenced by an international consortium of 10 countries (Korea, China, the United Kingdom, India, The Netherlands, France, Japan, Spain, Italy and the United States) as part of a larger initiative called the &lsquo;International Solanaceae Genome Project (SOL): Systems Approach to Diversity and Adaptation&rsquo;. The goal of this grassroots initiative, launched in November 2003, is to establish a network of information, resources and scientists to ultimately tackle two of the most significant questions in plant biology and agriculture: (1) How can a common set of genes&#x002F;proteins give rise to a wide range of morphologically and ecologically distinct organisms that occupy our planet? (2) How can a deeper understanding of the genetic basis of plant diversity be harnessed to better meet the needs of society in an environmentally friendly and sustainable manner? The Solanaceae and closely related species such as coffee, which are included in the scope of the SOL project, are ideally suited to address both of these questions. The first step of the SOL project is to use an ordered BAC approach to generate a high quality sequence for the euchromatic portions of the tomato as a reference for the Solanaceae. Due to the high level of macro and micro-synteny in the Solanaceae the BAC-by-BAC tomato sequence will form the framework for shotgun sequencing of other species. The starting point for sequencing the genome is BACs anchored to the genetic map by overgo hybridization and AFLP technology. The overgos are derived from approximately 1500 markers from the tomato high density F2-2000 genetic map (). These seed BACs will be used as anchors from which to radiate the tiling path using BAC end sequence data. Annotation will be performed according to SOL project guidelines. All the information generated under the SOL umbrella will be made available in a comprehensive website. The information will be interlinked with the ultimate goal that the comparative biology of the Solanaceae&mdash;and beyond&mdash;achieves a context that will facilitate a systems biology approach. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The effect of cache models on iterative compilation for combined tiling and unrolling: Research Articles
Authors: P. M. W. Knijnenburg, T. Kisuki, K. Gallivan, M. F. P. O'Boyle
Venue: Concurrency and Computation: Practice Experience (2004)

Iterative compilation, where we search for the best program transformation based on profile feedback information, has been highly successful in determining good program optimizations, typically outperforming all static approaches. However, this benefit has come at a price, namely, a large number of executions of the target program which in many cases is unacceptable. This paper is concerned with reducing the number of program executions needed by iterative compilation by incorporating static models. We examine how static models may be incorporated into a purely iterative approach by developing several characterized heuristics. We empirically explore the tradeoff between reducing the number of executions required and the ultimate performance achieved for differing parameters or slack factors. We focus on tiling and unrolling as transformations and cache models as a test case for the feasibility of this approach. We show that a highly accurate model, used as a filter to profiling and appropriately parameterized, can reduce the number of executions by 50&percnt;. We also show that using a simple model to rank transformations and profiling, only those with the highest ranking can reduce the number of executions even further up to 70&percnt;, in cases where there is only a limited number of profiles available. We conclude that a production compiler might perform best using the last approach, gaining the benefit of iterative compilation at a much reduced cost. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Review of "Object Thinking by David West"; Microsoft Press: Microsoft, &copy; 2004, 0-7356-1965-4
Authors: Haoyang Che
Venue: ACM SIGSOFT Software Engineering Notes (2005)

Object Thinking, by David West, a highly renowned technologist and evangelist in the community, is definitely a thoughtful and profound object-oriented book. It is written in a really unique style, and different from other object books we've seen ever before. Previously, none of them shows too much interest in the cultural, historical, and philosophical underpinnings of objects in software development. This exceptional and controversial book begins with the basic premise that there is much more to object-oriented paradigm than a matter of experience of object-oriented languages. To fully understand object orientation requires understanding the philosophical and historical roots from which objects come. In a sense, the book talks more about knowledge instead of techniques, wisdom instead of knowledge.
The Action Language: Refining a Behavioral Modeling Language
Authors: Steve Nordstrom, Shweta Shetty, Di Yao, Shikha Ahuja, Sandeep Sandeep, Ted Bapty
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

When modeling large-scale complex system behavior we believe there is merit in abandoning the once fashionable all-encompassing system modeling approach in favor of developing a set of models created in a variety of loosely coupled modeling languages. Loosely coupled languages are those that are considered to be nearly orthogonal with respect to their intention, but in reality may display a limited degree of trivial dependencies. We apply this approach toward component behavioral modeling to show how core behaviors of software components can be specified using a Statecharts-like behavioral modeling language while elements of the behavior associated with implementation- or platform-specific concepts are modeled using a wholly separate language.
The impact of metadata implementation on webpage visibility in search engine results (part II)
Authors: Jin Zhang, Alexandra Dimitroff
Venue: Information Processing and Management: an International Journal (2005)

This paper discusses the impact of metadata implementation in a webpage on its visibility performance in a search engine results list. Influential internal and external factors of metadata implementation were identified. How these factors affect webpage visibility in a search engine results list was examined in an experimental study. Findings suggest that metadata is a good mechanism to improve webpage visibility, the metadata subject field plays a more important role than any other metadata field and keywords extracted from the webpage itself, particularly title or full-text, are most effective. To maximize the effects, these keywords should come from both title and full-text.
Are floorplan representations important in digital design?
Authors: Hayward H. Chan, Saurabh N. Adya, Igor L. Markov
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Research in floorplanning and block-packing has generated a variety of data structures to represent spatial configurations of circuit modules. Much of this work focuses on the geometry of module shapes and seeks tighter packing, as well as improvements in the asymptotic worst-case complexity of algorithms for standard tasks. In this work we consider the implications of interconnect optimization on the value of floorplan representations and establish a framework for comparing different representations. By analyzing performance bottlenecks in block packing and properties of floorplan representations, we show that many of the mathematical results in floorplanning do not translate into better VLSI layouts. This is confirmed by extensive empirical data for stand-alone floor-planners and integrated applications.