text:
= {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {791–802},
numpages = {12},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007659,
author = {Chaudhuri, Surajit and Narasayya, Vivek and Ramamurthy, Ravishankar},
title = {Estimating Progress of Execution for SQL Queries},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007659},
doi = {10.1145/1007568.1007659},
abstract = {Today's database systems provide little feedback to the user/DBA on how much of a SQL query's execution has been completed. For long running queries, such feedback can be very useful, for example, to help decide whether the query should be terminated or allowed to run to completion. Although the above requirement is easy to express, developing a robust indicator of progress for query execution is challenging. In this paper, we study the above problem and present techniques that can form the basis for effective progress estimation. The results of experimentally validating our techniques in Microsoft SQL Server are promising.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {803–814},
numpages = {12},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007661,
author = {Guo, Hongfei and Larson, Per-\r{A}ke and Ramakrishnan, Raghu and Goldstein, Jonathan},
title = {Relaxed Currency and Consistency: How to Say "Good Enough" in SQL},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007661},
doi = {10.1145/1007568.1007661},
abstract = {Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applications are written with some understanding of which queries can use data that is not entirely current and which copies are "good enough"; however, there are neither explicit requirements nor guarantees. We propose to make this knowledge available to the DBMS through explicit currency and consistency (C&C) constraints in queries and develop techniques so the DBMS can guarantee that the constraints are satisfied. In this paper we describe our model for expressing C&C constraints, define their semantics, and propose SQL syntax. We explain how C&C constraints are enforced in MTCache, our prototype mid-tier database cache, including how constraints and replica update policies are elegantly integrated into the cost-based query optimizer. Consistency constraints are enforced at compile time while currency constraints are enforced at run time by dynamic plans that check the currency of each local replica before use and select sub-plans accordingly. This approach makes optimal use of the cache DBMS while at the same time guaranteeing that applications always get data that is "good enough" for their purpose.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {815–826},
numpages = {12},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007662,
author = {Shah, Mehul A. and Hellerstein, Joseph M. and Brewer, Eric},
title = {Highly Available, Fault-Tolerant, Parallel Dataflows},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007662},
doi = {10.1145/1007568.1007662},
abstract = {We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to implement a variety of continuous query (CQ) applications that require high-throughput, 24x7 operation. Examples include network monitoring, phone call processing, click-stream processing, and online financial analysis. Our main contribution is a scheme that carefully integrates traditional query processing techniques for partitioned parallelism with the process-pairs approach for high availability. This delicate integration allows us to tolerate failures of portions of a parallel dataflow without sacrificing result quality. Upon failure, our technique provides quick fail-over, and automatically recovers the lost pieces on the fly. This piecemeal recovery provides minimal disruption to the ongoing dataflow computation and improved reliability as compared to the straight-forward application of the process-pairs technique on a per dataflow basis. Thus, our technique provides the high availability necessary for critical CQ applications. Our techniques are encapsulated in a reusable dataflow operator called Flux, an extension of the Exchange that is used to compose parallel dataflows. Encapsulating the fault-tolerance logic into Flux minimizes modifications to existing operator code and relieves the burden on the operator writer of repeatedly implementing and verifying this critical logic. We present experiments illustrating these features with an implementation of Flux in the TelegraphCQ code base [8].},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {827–838},
numpages = {12},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007664,
author = {Gryz, Jarek and Guo, Junjie and Liu, Linqi and Zuzarte, Calisto},
title = {Query Sampling in DB2 Universal Database},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007664},
doi = {10.1145/1007568.1007664},
abstract = {Executing ad hoc queries against large databases can be prohibitively expensive. Exploratory analysis of data may not require exact answers to queries, however: results based on sampling the data are often satisfactory. Supporting sampling as a primitive SQL operator turns out to be difficult because sampling does not commute with many SQL operators.In this paper, we describe an implementation in IBM® DB2® Universal Database (UDB) of a sampling operator that commutes with some SQL operators. As a result, the query with the sampling operator always returns a random sample of the answers and in many cases runs faster than it would have without such an operator.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {839–843},
numpages = {5},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007665,
author = {Galindo-Legaria, C\'{e}sar A. and Stefani, Stefano and Waas, Florian},
title = {Query Processing for SQL Updates},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007665},
doi = {10.1145/1007568.1007665},
abstract = {A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused on issues related to data-retrieval queries, with a strong backing on relational algebra. However, update operations can also exhibit a number of query processing issues, depending on the complexity of the operations and the volume of data to process. Such issues include lookup and matching of values, navigational vs. set-oriented algorithms and trade-offs between plans that do serial or random I/Os.In this paper we present an overview of the basic techniques used to support SQL DML (Data Manipulation Language) in Microsoft SQL Server. Our focus is on the integration of update operations into the query processor, the query execution primitives required to support updates, and the update-specific considerations to analyze and execute update plans. Full integration of update processing in the query processor provides a robust and flexible framework and leverages existing query processing techniques.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {844–849},
numpages = {6},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007666,
author = {Cruanes, Thierry and Dageville, Benoit and Ghosh, Bhaskar},
title = {Parallel SQL Execution in Oracle 10g},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007666},
doi = {10.1145/1007568.1007666},
abstract = {This paper describes the new architecture and optimizations for parallel SQL execution in the Oracle 10g database. Based on the fundamental shared-disk architecture underpinning Oracle's parallel SQL execution engine since Oracle7, we show in this paper how Oracle's engine responds to the challenges of performing in new grid-computing environments. This is made possible by using advanced optimization techniques, which enable Oracle to exploit data and system architecture dynamically without being constrained by them. We show how we have evolved and re-architected our engine in Oracle 10g to make it more efficient and manageable by using a single global parallel plan model.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {850–854},
numpages = {5},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007668,
author = {Gupta, Abhinav and Subramanian, Sankar and Bellamkonda, Srikanth and Bozkaya, Tolga and Folkert, Nathan and Sheng, Lei and Witkowski, Andrew},
title = {Data Densification in a Relational Database System},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007668},
doi = {10.1145/1007568.1007668},
abstract = {Data in a relational data warehouse is usually sparse. That is, if no value exists for a given combination of dimension values, no row exists in the fact table. Densities of 0.1-2% are very common. However, users may want to view the data in a dense form, with rows for all combination of dimension values displayed even when no fact data exists for them. For example, if a product did not sell during a particular time period, users may still want to see the product for that time period with zero sales value next to it. Moreover, analytic window functions [1] and the SQL model clause [2] can more easily express time series calculations if data is dense along the time dimension because dense data will fill a consistent number of rows for each period.Data densification is the process of converting spare data into dense form. The current SQL technique for densification (using the combination of DISTINCT, CROSS JOIN and OUTER JOIN operations) is extremely unintuitive, difficult to express and inefficient to compute. Hence, we propose an extension to the ANSI SQL join operator, referred to as "PARTITIONED OUTER JOIN", which allows for a succinct expression of densification along the dimensions of interest. We also present various algorithms to evaluate the new join operator efficiently and compare it with existing methods of doing the equivalent operation. We also define a new window function "LAST_VALUE (IGNORE NULLS)" which is very useful with partitioned outer join.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {855–859},
numpages = {5},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007669,
author = {Acheson, Alazel and Bendixen, Mason and Blakeley, Jos\'{e} A. and Carlin, Peter and Ersan, Ebru and Fang, Jun and Jiang, Xiaowei and Kleinerman, Christian and Rathakrishnan, Balaji and Schaller, Gideon and Sezgin, Beysim and Venkatesh, Ramachandran and Zhang, Honggang},
title = {Hosting the .NET Runtime in Microsoft SQL Server},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007669},
doi = {10.1145/1007568.1007669},
abstract = {The integration of the .NET Common Language Runtime (CLR) inside the SQL Server DBMS enables database programmers to write business logic in the form of functions, stored procedures, triggers, data types, and aggregates using modern programming languages such as C#, Visual Basic, C++, COBOL, and J++. This paper presents three main aspects of this work. First, it describes the architecture of the integration of the CLR inside the SQL Server database process to provide a safe, scalable, secure, and efficient environment to run user code. Second, it describes our approach to defining and enforcing extensibility contracts to allow a tight integration of types, aggregates, functions, triggers, and procedures written in modern languages with the DBMS. Finally, it presents initial performance results showing the efficiency of user-defined types and functions relative to equivalent native DBMS features.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {860–865},
numpages = {6},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007670,
author = {Ordonez, Carlos},
title = {Vertical and Horizontal Percentage Aggregations},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007670},
doi = {10.1145/1007568.1007670},
abstract = {Existing SQL aggregate functions present important limitations to compute percentages. This article proposes two SQL aggregate functions to compute percentages addressing such limitations. The first function returns one row for each percentage in vertical form like standard SQL aggregations. The second function returns each set of percentages adding 100% on the same row in horizontal form. These novel aggregate functions are used as a framework to introduce the concept of percentage queries and to generate efficient SQL code. Experiments study different percentage query optimization strategies and compare evaluation time of percentage queries taking advantage of our proposed aggregations against queries using available OLAP extensions. The proposed percentage aggregations are easy to use, have wide applicability and can be efficiently evaluated.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {866–871},
numpages = {6},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007672,
author = {Little, Mark},
title = {Models for Web Services Tansactions},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007672},
doi = {10.1145/1007568.1007672},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {872},
numpages = {1},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007673,
author = {Agrawal, Rakesh and Asonov, Dmitri and Srikant, Ramakrishnan},
title = {Enabling Sovereign Information Sharing Using Web Services},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007673},
doi = {10.1145/1007568.1007673},
abstract = {Sovereign information sharing allows autonomous entities to compute queries across their databases in such a way that nothing apart from the result is revealed. We describe an implementation of this model using web services infrastructure. Each site participating in sovereign sharing offers a data service that allows database operations to be applied on the tables they own. Of particular interest is the provision for binary operations such as relational joins. Applications are developed by combining these data services. We present performance measurements that show the promise of a new breed of practical applications based on the paradigm of sovereign information integration.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {873–877},
numpages = {5},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007674,
author = {Mihic, Matthew},
title = {Building Dynamic Application Networks with Web Services},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007674},
doi = {10.1145/1007568.1007674},
abstract = {Looking at the state of the industry today, it is clear that we are in the early stages of Web Services development. Companies are still evaluating what the technology and considering how to apply it to their business. But over the past year, we seem to have reached an inflection point of companies building real systems based on Web Services. Partly this reflects an acceptance that the basic Web Services technologies - XML Schema [1][2], SOAP [3], WSDL [4] - have matured to the point where they can be used for mission critical applications. But it also reflects a growing understanding that Web Services enable a large class of systems that were previously very difficult to build. These systems are characterized by several critical properties:1. Rapid rates of change. The time is long past when companies could afford a year-long-effort to build out a new application. Businesses move at a faster pace today then ever before, and they are increasingly under pressure to do more work with fewer resources. This places a premium on the ability to build applications by quickly composing pre-existing services. The result is that systems are being connected in ways that were never imagined during development. This is reuse in the large - not just small services, but entire applications being linked together to solve a complex business function.2. Significant availability and scalability requirements. Many of these systems are "bet-your-business" types of applications. They have heavy scalability and availability requirements. Often then need to connect multiple partners and service hundreds of thousands of updates in a day, without ever suffering an interruption in service.3. Heterogeneous development tools and software platforms. Each of these applications typically involves components built using a wildly diverse set of tools, operating systems, and software platforms. Partly this is a result of building systems out of existing components - many of these components are locked into certain environments, and there are no resources to rewrite or migrate to a single homogenous platform. But it is also recognition that different problems are best solved by different toolsets. Some problems are best solved by writing code on an application server, others are best suited for scripting, and still others are solved by customizing an existing enterprise application. Heterogeneity is not going away. It is only increasing.4. Multiple domains of administrative control. An aspect of heterogeneity that is often overlooked is distributed ownership. As businesses merge, acquire, and partner with other companies, there is an increasing need to build applications that span organizational boundaries.These characteristics present a unique set of challenges to the way we think about developing, describing, connecting, and configuring applications. The challenges require us to develop new ways of looking at what it takes to build an application, and what makes up a network.In this session, we examine the nature of this next generation of application, and discuss the way in which Web Services are evolving to meet their needs. The session focuses on the development techniques that allow services to be easily and dynamically composed into rich applications, and considers the capabilities required of the underlying network fabric. The session concludes with an in-depth look at some of the critical Web Services specifications actively under development by industry leaders.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {878},
numpages = {1},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007675,
author = {Gudgin, Martin},
title = {Secure, Reliable, Transacted: Innovation in Web Services Architecture},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007675},
doi = {10.1145/1007568.1007675},
abstract = {This paper discusses the design of Web Services Protocols paying special attention to composition of such protocols. The transaction related protocols are discussed as exemplars.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {879–880},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007677,
author = {Kosugi, Naoko and Sakurai, Yasushi and Morimoto, Masashi},
title = {SoundCompass: A Practical Query-by-Humming System; Normalization of Scalable and Shiftable Time-Series Data and Effective Subsequence Generation},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007677},
doi = {10.1145/1007568.1007677},
abstract = {This paper describes our practical query-by-humming system, SoundCompass, which is being used as a karaoke song selection system in Japan. First, we describe the fundamental techniques employed by SoundCompass such as normalization in a time-wise sense of music data, time-scalable and tone-shiftable time-series data, and making subsequences for efficient matching. Second, we describe techniques to make effective feature vectors based on real music data and do matching with them to develop accurate query-by-humming. Third, we share valuable knowledge that has been obtained through month's of practical use of Sound Compass. Fourth, we describe the latest version of the SoundCompass system that incorporates these new techniques and knowledge, as well as describe quantitative evaluations that prove the practicality of SoundCompass. The new system provides flexible and accurate similarity retrieval based on k-nearest neighbor searches with multi-dimensional spatial indices structured with multi-dimensional features vectors.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {881–886},
numpages = {6},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007678,
author = {Bendsen, Per},
title = {Model-Driven Business UI Based on Maps},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007678},
doi = {10.1145/1007568.1007678},
abstract = {Future business applications will often have more than 2,000 forms and need to target several user interface (UI) technologies including: Web Browsers, Windows® Applications, PDA's, and cell phones. The applications will need state-of-the-art layout combined with excellent usability with specially built forms that handle specific tasks based on user roles. How can the trade-off between developer productivity and user experience be handled?The technologies being implemented in Microsoft® Business Framework include a model-driven business UI platform that exploits flexible maps and a layered form definition. The framework generates forms based on a model of the business logic, which is an integrated part of the business framework. The generation process uses declarative and changeable maps so that the process can be controlled and modified by the business developer.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {887–891},
numpages = {5},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007679,
author = {Dar, Shaul and Hecht, Gil and Shochat, Eden},
title = {DbSwitch™: Towards a Database Utility},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007679},
doi = {10.1145/1007568.1007679},
abstract = {Savantis Systems' dbSwitch™ is an innovative commercial product providing database server virtualization and advancing a database utility model. The dbSwitch enables a new architecture, called a Database Area Network (DAN), which pools database server resources and shares them among multiple database applications. Specific benefits of the DAN architecture for enterprise data centers include server consolidation, improved utilization, high availability and capacity management. We describe the major components of the dbSwitch, namely routing of application requests to database instances, optimization of database server resources and capacity visualization and manipulation. We also relate dbSwitch to recent work on utility and grid computing.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {892–896},
numpages = {5},
keywords = {DAN, utility, dbSwitch™, grid, Database Area Network, consolidation},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007681,
author = {Hall, Dean E.},
title = {Requirements and Policy Challenges in Highly Secure Environments},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007681},
doi = {10.1145/1007568.1007681},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {897–898},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007682,
author = {Multari, Nicholas J.},
title = {Information Assurance Technical Challenges},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007682},
doi = {10.1145/1007568.1007682},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {899},
numpages = {1},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007683,
author = {Dill, Marcus and Kraiss, Achim and Sigg, Stefan and Zurek, Thomas},
title = {Service-Oriented BI: Towards Tight Integration of Business Intelligence into Operational Applications},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007683},
doi = {10.1145/1007568.1007683},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {900},
numpages = {1},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007685,
author = {Carey, Michael J.},
title = {XML in the Middle: XQuery in the WebLogic Platform},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007685},
doi = {10.1145/1007568.1007685},
abstract = {The BEA WebLogic Platform product suite consists of WebLogic Server, WebLogic Workshop, WebLogic Integration, WebLogic Portal, and Liquid Data for WebLogic. W3C standards including XML, XML Schema, and the emerging XML query language XQuery play important roles in several of these products. This industrial presentation will discuss the increasingly central role of XML in the middle tier of enterprise IT architectures and cover some of the key XML technologies that the BEA WebLogic Platform provides for creating enterprise applications in today's IT world. We focus in particular on how XQuery fits into this picture, both for today's WebLogic Platform 8.1 and going forward in terms of the Platform roadmap.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {901–902},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007686,
author = {O'Neil, Patrick and O'Neil, Elizabeth and Pal, Shankar and Cseri, Istvan and Schaller, Gideon and Westbury, Nigel},
title = {ORDPATHs: Insert-Friendly XML Node Labels},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007686},
doi = {10.1145/1007568.1007686},
abstract = {We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft® SQL Server™. ORDPATH labels nodes of an XML tree without requiring a schema (the most general case---a schema simplifies the problem). An example of an ORDPATH value display format is "1.5.3.9.1". A compressed binary representation of ORDPATH provides document order by simple byte-by-byte comparison and ancestry relationship equally simply. In addition, the ORDPATH scheme supports insertion of new nodes at arbitrary positions in the XML tree, their ORDPATH values "careted in" between ORDPATHs of sibling nodes, without relabeling any old nodes.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {903–908},
numpages = {6},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007688,
author = {Brambilla, Marco and Ceri, Stefano and Comai, Sara and Dario, Marco and Fraternali, Piero and Manolescu, Ioana},
title = {Declarative Specification of Web Applications Exploiting Web Services and Workflows},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007688},
doi = {10.1145/1007568.1007688},
abstract = {This demo presents an extension of a declarative language for specifying data-intensive Web applications. We demonstrate a scenario extracted from a real-life application, the Web portal of a computer manufacturer, including interactions with third-party service providers and enabling distributors to participate in well-defined business processes. The crucial advantage of our framework is the high-level modeling of a complex Web application, extended with Web service and workflow capabilities. The application is automatically verified for correctness and the code is automatically generated and deployed.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {909–910},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007689,
author = {Fern\'{a}ndez, Mary and Onose, Nicola and Sim\'{e}on, J\'{e}r\^{o}me},
title = {Yoo-Hoo! Building a Presence Service with XQuery and WSDL},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007689},
doi = {10.1145/1007568.1007689},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {911–912},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007691,
author = {He, Bin and Zhang, Zhen and Chang, Kevin Chen-Chuan},
title = {Knocking the Door to the Deep Web: Integrating Web Query Interfaces},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007691},
doi = {10.1145/1007568.1007691},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {913–914},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007692,
author = {Carreira, Paulo and Galhardas, Helena},
title = {Efficient Development of Data Migration Transformations},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007692},
doi = {10.1145/1007568.1007692},
abstract = {In this paper, we present a data migration tool named DATA FUSION. Its main features are: A domain specific language designed to conveniently model complex data transformations; an integrated development environment that assists users on managing complex data transformation projects and an auditing facility that provides relevant information to project managers and external auditors.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {915–916},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007693,
author = {Borkar, Vinayak},
title = {Liquid Data for WebLogic: Integrating Enterprise Data and Services},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007693},
doi = {10.1145/1007568.1007693},
abstract = {Information in today's enterprises commonly resides in a variety of heterogeneous data sources, including relational databases, web services, files, packaged applications, and custom data repositories. BEA's enterprise information integration product, Liquid Data for WebLogic, takes an XML-based approach to providing integrated access to such heterogeneous information. This demonstration highlights the XML technologies involved - including web services, XQuery, and XML Schema - and shows how they can be brought to bear on the enterprise information integration problem. The demonstration uses a simple end-to-end example, one that involves integrating data from relational databases and web services, to walk the audience through the overall architecture, XML-based data modeling approach, programming model, declarative query and view facilities, and distributed processing features of Liquid Data.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {917–918},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007695,
author = {Cai, Y. Dora and Clutter, David and Pape, Greg and Han, Jiawei and Welge, Michael and Auvil, Loretta},
title = {MAIDS: Mining Alarming Incidents from Data Streams},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007695},
doi = {10.1145/1007568.1007695},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {919–920},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007696,
author = {Qian, Yu and Zhang, Gang and Zhang, Kang},
title = {FA\c{C}ADE: A Fast and Effective Approach to the Discovery of Dense Clusters in Noisy Spatial Data},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007696},
doi = {10.1145/1007568.1007696},
abstract = {FA\c{C}ADE (Fast and Automatic Clustering Approach to Data Engineering) is a spatial clustering tool that can discover clusters of different sizes, shapes, and densities in noisy spatial data. Compared with the existing clustering methods, FA\c{C}ADE has several advantages: first, it separates true data and noise more effectively. Second, most steps of FA\c{C}ADE are automatic. Third, it requires only O(nlogn) time. 2D and 3D visualizations are used in FA\c{C}ADE to assist parameter selection and result evaluation. More information on FA\c{C}ADE is available at: http://viscomp.utdallas.edu/FACADE.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {921–922},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007697,
author = {Serazi, Masum and Malakhov, Vasily and Ren, Dongmei and Perera, Amal and Rahal, Imad and Wu, Weihua and Ding, Qiang and Pan, Fei and Perrizo, William},
title = {DataMIME™},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007697},
doi = {10.1145/1007568.1007697},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {923–924},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007699,
author = {Kr\"{a}mer, J\"{u}rgen and Seeger, Bernhard},
title = {PIPES: A Public Infrastructure for Processing and Exploring Streams},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007699},
doi = {10.1145/1007568.1007699},
abstract = {PIPES is a flexible and extensible infrastructure providing fundamental building blocks to implement a data stream management system (DSMS). It is seamlessly integrated into the Java library XXL [1, 2, 3] for advanced query processing and extends XXL's scope towards continuous data-driven query processing over autonomous data sources.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {925–926},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007700,
author = {Garg, Shaveen and Ramamritham, Krithi and Chakrabarti, Soumen},
title = {Web-CAM: Monitoring the Dynamic Web to Respond to Continual Queries},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007700},
doi = {10.1145/1007568.1007700},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {927–928},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007701,
author = {Balazinska, Magdalena and Balakrishnan, Hari and Stonebraker, Michael},
title = {Load Management and High Availability in the Medusa Distributed Stream Processing System},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007701},
doi = {10.1145/1007568.1007701},
abstract = {Medusa [3, 6] is a distributed stream processing system based on the Aurora single-site stream processing engine [1]. We demonstrate how Medusa handles time-varying load spikes and provides high availability in the face of network partitions. We demonstrate Medusa in the context of Borealis, a second generation stream processing engine based on Aurora and Medusa.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {929–930},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007702,
author = {Babu, Shivnath and Widom, Jennifer},
title = {StreaMon: An Adaptive Engine for Stream Query Processing},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007702},
doi = {10.1145/1007568.1007702},
abstract = {StreaMon is the adaptive query processing engine of the STREAM prototype Data Stream Management System (DSMS) [4]. A fundamental challenge in many DSMS applications (e.g., network monitoring, financial monitoring over stock tickers, sensor processing) is that conditions may vary significantly over time. Since queries in these systems are usually long-running, or continuous [4], it is important to consider adaptive approaches to query processing. Without adaptivity, performance may drop drastically as stream data and arrival characteristics, query loads, and system conditions change over time.StreaMon uses several techniques to support adaptive query processing [1, 2, 3]; we demonstrate three of them:•Reducing run-time memory requirements for continuous queries by exploiting stream data and arrival patterns.•Adaptive join ordering for pipelined multiway stream joins, with strong quality guarantees.•Placing subresult caches adaptively in pipelined multiway stream joins to avoid recomputation of intermediate results.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {931–932},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007704,
author = {Idreos, Stratos and Koubarakis, Manolis and Tryfonopoulos, Christos},
title = {P2P-DIET: An Extensible P2P Service That Unifies Ad-Hoc and Continuous Querying in Super-Peer Networks},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007704},
doi = {10.1145/1007568.1007704},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {933–934},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007705,
author = {Chun, Brent and Hellerstein, Joseph M. and Huebsch, Ryan and Jeffery, Shawn R. and Loo, Boon Thau and Mardanbeigi, Sam and Roscoe, Timothy and Rhea, Sean and Shenker, Scott and Stoica, Ion},
title = {Querying at Internet Scale},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007705},
doi = {10.1145/1007568.1007705},
abstract = {We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate in order to achieve scalability, reliability, decentralized control, and load balancing. PIER enhances DHTs with declarative and algebraic query interfaces, and underneath those interfaces implements multihop, in-network versions of joins, aggregation, recursion, and query/result dissemination. PIER is currently being used for diverse applications, including network monitoring, keyword-based filesharing search, and network topology mapping. We will demonstrate PIER's functionality by showing system monitoring queries running on PlanetLab, a testbed of over 300 machines distributed across the globe.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {935–936},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007706,
author = {Guo, Hongfei and Larson, Per-\r{A}ke and Ramakrishnan, Raghu and Goldstein, Jonathan},
title = {Support for Relaxed Currency and Consistency Constraints in MTCache},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007706},
doi = {10.1145/1007568.1007706},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {937–938},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007707,
author = {Crainiceanu, Adina and Linga, Prakash and Machanavajjhala, Ashwin and Gehrke, Johannes and Shanmugasundaram, Jayavel},
title = {An Indexing Framework for Peer-to-Peer Systems},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007707},
doi = {10.1145/1007568.1007707},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {939–940},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007709,
author = {Meng, Xiaofeng and Jiang, Yu and Chen, Yan and Wang, Haixun},
title = {XSeq: An Indexing Infrastructure for Tree Pattern Queries},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007709},
doi = {10.1145/1007568.1007709},
abstract = {Given a tree-pattern query, most XML indexing approaches decompose it into multiple sub-queries, and then join their results to provide the answer to the original query. Join operations have been identified as the most time-consuming component in XML query processing. XSeq is a powerful XML indexing infrastructure which makes tree patterns a first class citizen in XML query processing. Unlike most indexing methods that directly manipulate tree structures, XSeq builds its indexing infrastructure on a much simpler data model: sequences. That is, we represent both XML data and XML queries by structure-encoded sequences. We have shown that this new data representation preserves query equivalence, and more importantly, through subsequence matching, structured queries can be answered directly without resorting to expensive join operations. Moreover, the XSeq infrastructure unifies indices on both the content and the structure of XML documents, hence it achieves an additional performance advantage over methods indexing either just content or structure, or indexing them separately.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {941–942},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007710,
author = {Botev, Chavdar and Amer-Yahia, Sihem and Shanmugasundaram, Jayavel},
title = {A TeXQuery-Based XML Full-Text Search Engine},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007710},
doi = {10.1145/1007568.1007710},
abstract = {We demonstrate an XML full-text search engine that implements the TeXQuery language. TeXQuery is a powerful full-text search extension to XQuery that provides a rich set of fully composable full-text primitives, such as phrase matching, proximity distance, stemming and thesauri. TeXQuery enables users to seamlessly query over both structure data and text, by embedding full-text primitives in XQuery and vice versa. TeXQuery also supports a flexible scoring construct that scores query results based on full-text predicates and permits top-k queries. TeXQuery is the precursor of the full-text language extension to XPath 2.0 and XQuery 1.0 currently being developed by W3C.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {943–944},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007712,
author = {Fundulaki, Irini and Sahuguet, Arnaud},
title = {"Share Your Data, Keep Your Secrets."},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007712},
doi = {10.1145/1007568.1007712},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {945–946},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007713,
author = {Agrawal, Rakesh and Kini, Ameet and LeFevre, Kristen and Wang, Amy and Xu, Yirong and Zhou, Diana},
title = {Managing Healthcare Data Hippocratically},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007713},
doi = {10.1145/1007568.1007713},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {947–948},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007715,
author = {Kumaran, A. and Haritsa, Jayant R.},
title = {LexEQUAL: Multilexical Matching Operator in SQL},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007715},
doi = {10.1145/1007568.1007715},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {949–950},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007716,
author = {Huang, B. and Huang, Z. and Li, H. and Lin, D. and Lu, H. and Song, Y.},
title = {ITQS: An Integrated Transport Query System},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007716},
doi = {10.1145/1007568.1007716},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {951–952},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007717,
author = {Bedathur, Srikanta J. and Kadlag, Abhijit and Haritsa, Jayant R.},
title = {BODHI: A Database Habitat for Bio-Diversity Information},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007717},
doi = {10.1145/1007568.1007717},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {953–954},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007718,
author = {Mehrotra, Sharad and Butts, Carter and Kalashnikov, Dmitri V. and Venkatasubramanian, Nalini and Altintas, Kemal and Hariharan, Ram and Lee, Haimin and Ma, Yiming and Myers, Amnon and Wickramasuriya, Jehan and Eguchi, Ron and Huyck, Charles},
title = {CAMAS: A Citizen Awareness System for Crisis Mitigation},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007718},
doi = {10.1145/1007568.1007718},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {955–956},
numpages = {2},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/3259422,
author = {Jensen, Christian S.},
title = {Session Details: Panel},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3259422},
doi = {10.1145/3259422},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
numpages = {1},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007720,
author = {Franklin, Michael J. and Widom, Jennifer and Ailamaki, Anastassia and Bernstein, Philip A. and DeWitt, David and Halevy, Alon and Ives, Zachary and Weikum, Gerhard},
title = {Rethinking the Conference Reviewing Process},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007720},
doi = {10.1145/1007568.1007720},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {957},
numpages = {1},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007722,
author = {Hull, Richard and Su, Jianwen},
title = {Tools for Design of Composite Web Services},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007722},
doi = {10.1145/1007568.1007722},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {958–961},
numpages = {4},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007724,
author = {Rosenthal, Arnon and Winslett, Marianne},
title = {Security of Shared Data in Large Systems: State of the Art and Research Directions},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007724},
doi = {10.1145/1007568.1007724},
abstract = {The target audience for this tutorial is the entire SIGMOD research community. The goals of the tutorial are to enlighten the SIGMOD research community about the state of the art in data security, especially for enterprise or larger systems, and to engage the community's interest in improving the state of the art.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {962–964},
numpages = {3},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007726,
author = {Lerner, Alberto and Shasha, Dennis and Wang, Zhihua and Zhao, Xiaojian and Zhu, Yunyue},
title = {Fast Algorithms for Time Series with Applications to Finance, Physics, Music, Biology, and Other Suspects},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007726},
doi = {10.1145/1007568.1007726},
abstract = {Financial time series streams are watched closely by millions of traders. What exactly do they look for and how can we help them do it faster? Physicists study the time series emerging from their sensors. The same question holds for them. Musicians produce time series. Consumers may want to compare them. This tutorial presents techniques and case studies for four problems:1. Finding sliding window correlations in financial, physical, and other applications.2. Discovering bursts in large sensor data of gamma rays.3. Matching hums to recorded music, even when people don't hum well.4. Maintaining and manipulating time-ordered data in a database setting.This tutorial draws mostly from the book High Performance Discovery in Time Series: techniques and case studies, Springer-Verlag 2004. You can find the power point slides for this tutorial at http://cs.nyu.edu/cs/faculty/shasha/papers/sigmod04.ppt.The tutorial is aimed at researchers in streams, data mining, and scientific computing. Its applications should interest anyone who works with scientists or financial "quants." The emphasis will be on recent results and open problems. This is a ripe area for further advance.},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {965–968},
numpages = {4},
location = {Paris, France},
series = {SIGMOD '04}
}

@inproceedings{10.1145/1007568.1007728,
author = {Faloutsos, Christos},
title = {Indexing and Mining Streams},
year = {2004},
isbn = {1581138598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1007568.1007728},
doi = {10.1145/1007568.1007728},
booktitle = {Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data},
pages = {969},
numpages = {1},
location = {Paris, France},
series = {SIGMOD '04}
}

license: Unlicense

license_type: permissive

branch_name: refs/heads/main

extension: bib


text:
# Path definitions
set(CONTENTFILTER_DIR ${ROOT_DIR}/src/lcp-content-filter)

# Content filter
file(GLOB CONTENTFILTER_SOURCES ${CONTENTFILTER_DIR}/*.cpp)

repository: TEA-ebook/readium-lcp-client

repo_name: TEA-ebook/readium-lcp-client

branch_name: refs/heads/master

extension: cmake


text:
@INPROCEEDINGS{Otjacques2007a,
  author = {Beno\^{\i}t Otjacques and Monique Noirhomme and Fernand Feltz},
  title = {Innovative Visualization Tools to Monitor Scientific Cooperative Activities},
  pages = {33--41},
  abstract = {This paper describes how information visualization techniques can be used to monitor a web-based collaborative platform and to support workplace awareness by providing a global overview of the activities. An innovative prototype is described. Its originality relies on using some enclosure-based visualization methods in the context of activities monitoring, which is rather unusual. In addition, a new layout is described for representing data trees. The use of the system is illustrated with the case of a EU-funded Network of Excellence.},
  doi = {10.1007/978-3-540-74780-2_4},
  year = {2007},
  booktitle = {CDVE'07: Proceedings of the International Conference on Cooperative Design, Visualization, and Engineering},
  editor = {Yuhua Luo},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  isbn = {9783540747796},
}

license: MIT

repository: vis-au/treevisnet

repo_name: vis-au/treevisnet

gha_language: TeX


text:
@Article{ito:ral:2020,
  author    = {Ito, Takahiro and Ayusawa, Ko and Yoshida, Eiichi and Kobayashi, Hiroshi},
  title     = {Simultaneous Control Framework for Humanoid Tracking Human Movement With Interacting Wearable Assistive Device},
  journal   = {IEEE Robotics and Automation Letters},
  year      = {2020},
  volume    = {5},
  number    = {2},
  pages     = {3604--3611},
  month     = {April},
  doi       = {10.1109/lra.2020.2979663},
  url       = {https://staff.aist.go.jp/e.yoshida/papers/ITO\_RAL2020.pdf},
  keywords  = {Humanoid robots, Assistive devices, Motion control, Human motion imitation, Physical interaction},
  abstract  = {Instead of human subjects, humanoid robots can be used as human dummies to test the human-designed products. We propose a controller that uses wearable assistive devices (also referred to as exoskeletons) to reproduce human movement in the evaluation. The proposed control scheme consists two components: one is the torque controller designed for a simplified interaction model with the device, and the other is the tracking controller based on a vector field to reproduce human motion. We implemented the proposed controller on the human-sized humanoid HRP-4 and validated the feasibility of the human motion reproduction by wearing the assistive device. In the experiment, we tested the commercially available device \textquotedblleft Muscle Suit\textquotedblright  by using our control scheme. The experimental results showed that while the device applies its supporting strength, the humanoid robot could reproduce human movements. The assistive effect of the device was visualized effectively in our evaluation framework.},
  publisher = {IEEE-INST Electrical Electronics Engineers Inc},
  address   = {445 Hoes Lane, Piscataway, NJ 08855-4141, USA}
}


text:
SUMMARY = "Python support for YAML"
DEPENDS += "libyaml ${PYTHON_PN}-cython-native"

LICENSE = "MIT"
LIC_FILES_CHKSUM = "file://LICENSE;md5=6d8242660a8371add5fe547adf083079"

PYPI_PACKAGE = "PyYAML"

inherit pypi setuptools3

SRC_URI[sha256sum] = "607774cbba28732bfa802b54baa7484215f530991055bb562efbed5b2f20a45e"

RDEPENDS_${PN} += "\
    ${PYTHON_PN}-datetime \
    ${PYTHON_PN}-netclient \
"

BBCLASSEXTEND = "native nativesdk"

repository: ni/meta-openembedded

repo_name: ni/meta-openembedded

branch_name: refs/heads/nilrt/master/hardknott

gha_license_id: MIT

gha_language: BitBake

extension: bb


text:
require binutils.inc
PR = "${INC_PR}.0"

LICENSE = "GPLv3"

SRC_URI = "\
     ftp://sourceware.org/pub/binutils/snapshots/binutils-${PV}.tar.bz2 \
     file://binutils-uclibc-100-uclibc-conf.patch \
     file://110-arm-eabi-conf.patch \
     file://binutils-uclibc-300-001_ld_makefile_patch.patch \
     file://binutils-uclibc-300-006_better_file_error.patch \
     file://binutils-uclibc-300-012_check_ldrunpath_length.patch \
     file://binutils-uclibc-gas-needs-libm.patch \
     file://binutils-arm-pr7093.patch \
     file://ld-stub-crash.patch;striplevel=0 \
     file://thumb-func.patch \
     "

# powerpc patches
SRC_URI += "file://binutils-2.16.1-e300c2c3.patch"

SRC_URI[md5sum] = "fd59f36022f6ea802d1c844a2576e616"
SRC_URI[sha256sum] = "52f350e2844e87f9e3bb60ade650ad806d020aafa66248ec2a55313d62ed60e4"

repository: overo/overo-oe-natty

repo_name: overo/overo-oe-natty

branch_name: HEAD


text:
// Copyright (C) 2015 Tudor Berariu

// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the “Software”), to deal in the Software without
// restriction, including without limitation the rights to use, copy,
// modify, merge, publish, distribute, sublicense, and/or sell copies
// of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:

// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.

// THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
// BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

#include <cassert>
#include <iostream>

using namespace std;

template<typename T>
class Matrix;

template<typename T>
ostream& operator<<(ostream&, const Matrix<T>&);

template<typename T>
class Matrix {
public:
  Matrix(size_t, size_t);
  T* operator[](size_t);
  T* at(size_t, size_t);
  T get(size_t, size_t) const;
  Matrix<T> operator*(const Matrix<T>&) const;
  Matrix<T> operator+(const Matrix<T>&) const;
  void operator*=(T x);
  size_t get_rows_no() const;
  size_t get_cols_no() const;

  void magic_init();

  template<typename T_>
  friend ostream& operator<<(ostream&, const Matrix<T_>&);

  Matrix<T>& operator=(const Matrix<T>&);

private:
  size_t rows_no;
  size_t cols_no;

  T* _values;
};

template<typename T, template<typename> class... layers>
struct ForwardComputation;

template<typename T>
struct ForwardComputation<T> {
  inline static Matrix<T> compute(const Matrix<T>& m_in) {
    Matrix<T> m_out = m_in;
    return m_out;
  }
};

template<typename T, template<typename> class CrtLayer,
         template<typename> class... Layers>
struct ForwardComputation<T, CrtLayer, Layers...> {
  using Next = ForwardComputation<T, Layers...>;

  inline static Matrix<T> compute(const Matrix<T>& m_in,
                           const CrtLayer<T>& layer,
                           Layers<T>... other) {
    return Next::compute(layer.compute(m_in), other...);
  }
};

template<typename T>
struct Multiplier {
  Matrix<T> p;
  Multiplier(size_t, size_t);
  Matrix<T> compute(const Matrix<T>&) const;
};

template<typename T>
Multiplier<T>::Multiplier(size_t rows_no, size_t cols_no)
  : p(rows_no, cols_no) {
  p.magic_init();
}

template<typename T>
Matrix<T> Multiplier<T>::compute(const Matrix<T>& m_in) const {
  Matrix<T> m3 = (m_in * p);
  return m3;
}

template<typename T>
struct Adder {
  Matrix<T> p;
  Adder(size_t, size_t);
  Matrix<T> compute(const Matrix<T>&) const;
};

template<typename T>
Adder<T>::Adder(size_t rows_no, size_t cols_no)
  : p(rows_no, cols_no) {
  p.magic_init();
}

template<typename T>
Matrix<T> Adder<T>::compute(const Matrix<T>& m_in) const {
  Matrix<T> m3 = (m_in + p);
  return m3;
}

// Constructor
// Sets cols_no and rows_no
// and allocaties memory
template<typename T>
Matrix<T>::Matrix(size_t rows_no, size_t cols_no)
  : rows_no {rows_no}, cols_no {cols_no} {
  _values = (T*) malloc(rows_no * cols_no * sizeof(T));
}

template<typename T>
size_t Matrix<T>::get_cols_no() const {
  return cols_no;
}

template<typename T>
size_t Matrix<T>::get_rows_no() const {
  return rows_no;
}

template<typename T>
T* Matrix<T>::operator[](size_t idx) {
  assert(idx < rows_no);
  return (_values + idx * cols_no);
}

template<typename T>
T Matrix<T>::get(size_t r, size_t c) const {
  assert(r < rows_no);
  assert(c < cols_no);
  return *(_values + r * cols_no + c);
}

template<typename T>
T* Matrix<T>::at(size_t r, size_t c) {
  assert(r < rows_no);
  assert(c < cols_no);
  return (_values + r * cols_no + c);
}

template<typename T>
void Matrix<T>::magic_init() {
  for (size_t i = 0; i < rows_no; i++)
    for (size_t j = 0; j < cols_no; j++)
      _values[i * cols_no + j] = (i + 1) * 10 + j + 1;
}

template<typename T>
void Matrix<T>::operator*=(T x) {
  for (size_t i = 0 ; i < rows_no * cols_no; i++)
    _values[i] *= x;
}

template<typename T>
Matrix<T> Matrix<T>::operator+(const Matrix<T>& b) const {
  assert(rows_no == b.get_rows_no() && cols_no == b.get_cols_no());
  Matrix<T> c(rows_no, b.get_cols_no());
  for(size_t i = 0; i < rows_no; i++) {
    for(size_t j = 0; j < b.get_cols_no(); j++) {
      c[i][j] = this->get(i,j) + b.get(i,j);
    }
  }
  return c;
}

template<typename T>
Matrix<T> Matrix<T>::operator*(const Matrix<T>& b) const {
  assert(cols_no == b.get_rows_no());
  Matrix<T> c(rows_no, b.get_cols_no());
  for(size_t i = 0; i < rows_no; i++) {
    for(size_t j = 0; j < b.get_cols_no(); j++) {
      c[i][j] = (T)0;
      for(size_t k = 0; k < cols_no; k++)
        c[i][j] += _values[i * cols_no + k] * b.get(k, j);
    }
  }
  return c;
}

template<typename T>
Matrix<T>& Matrix<T>::operator=(const Matrix<T>& source) {
  rows_no = source.rows_no;
  cols_no = source.cols_no;
  _values = (T*) malloc(rows_no * cols_no * sizeof(T));
  for(size_t r = 0; r < rows_no; r++) {
    for(size_t c = 0; c < cols_no; c++) {
      _values[r * cols_no + c] = source.get(r, c);
    }
  }
  return *this;
}

template<typename T>
ostream& operator<<(ostream& s, const Matrix<T>& m) {
  for (size_t row = 0; row < m.rows_no; row++) {
    for (size_t col = 0; col < m.cols_no; col++) {
      s << m._values[row * m.cols_no + col] << " ";
    }
    s << endl;
  }
  return s;
}

int main(int argc, char * argv[])
{
  /*
  Matrix<int> m1(4, 6);
  Matrix<int> m2(6, 3);

  m1.magic_init();
  m2.magic_init();

  cout << m1;
  cout << m2;

  Matrix<int> m3 = m1 * m2;

  cout << m3;

  m1 *= 2;

  cout << m1;

  Matrix<int> m4 = m1;

  cout << m4;

  Matrix<int> m5(3, 4);
  Matrix<int> m6(3, 4);

  m5.magic_init();
  m6.magic_init();

  Matrix<int> m7 = (m5 + m6);

  cout << m7;
  */

  Multiplier<int> l1(4, 6);
  Adder<int> l2(3, 6);
  Multiplier<int> l3(6, 2);

  using NN = ForwardComputation<int, Multiplier, Adder, Multiplier>;

  Matrix<int> m_in(3,4);
  m_in.magic_init();

  Matrix<int> m_out = NN::compute(m_in, l1, l2, l3);
  cout << m_out << endl;

  // Testare
  Matrix<int> _m_in(3,4);
  _m_in.magic_init();
  Matrix<int> _p1(4, 6);
  _p1.magic_init();
  Matrix<int> _p2(3, 6);
  _p2.magic_init();
  Matrix<int> _p3(6, 2);
  _p3.magic_init();

  cout << ((_m_in * _p1) + _p2) * _p3;

  return 0;
}

repository: tudor-berariu/cc-hacks

repo_name: tudor-berariu/cc-hacks

extension: cc


text:
@misc{fft,
  title={Cal {P}oly {G}ithub},
  note={\url{http://www.github.com/CalPoly}}
}

@inproceedings{edge2012memreflex,
	title={MemReflex: adaptive flashcards for mobile microlearning},
	author={Edge, Darren and Fitchett, Stephen and Whitney, Michael and Landay, James},
	booktitle={Proceedings of the 14th international conference on Human-computer interaction with mobile devices and services},
	pages={431--440},
	year={2012},
	organization={ACM}
}

@article{dodin2001integrated,
	title={Integrated project scheduling and material planning with variable activity duration and rewards},
	author={Dodin, B and Elimam, AA},
	journal={IIE Transactions},
	volume={33},
	number={11},
	pages={1005--1018},
	year={2001},
	publisher={Springer}
}

@article{vesselinov2012duolingo,
	title={Duolingo effectiveness study},
	author={Vesselinov, Roumen and Grego, John},
	journal={City University of New York, USA},
	year={2012}
}

@article{skinner1958teaching,
	title={Teaching machines.},
	author={Skinner, Burrhus Frederic},
	journal={Science},
	year={1958},
	publisher={American Assn for the Advancement of Science}
}

@article{skinner1963operant,
	title={Operant behavior.},
	author={Skinner, Burrhus F},
	journal={American Psychologist},
	volume={18},
	number={8},
	pages={503},
	year={1963},
	publisher={American Psychological Association}
}

@article{ferster1957schedules,
	title={Schedules of reinforcement.},
	author={Ferster, Charles B and Skinner, Burrhus Frederic},
	year={1957},
	publisher={Appleton-Century-Crofts}
}

@book{hardy_heyes_1999, place={Oxford}, title={Beginning psychology}, publisher={Oxford Univ. Press}, author={Hardy, Malcolm and Heyes, Steve}, year={1999}}

@article{huang2013gamification,
	title={Gamification of education},
	author={Huang, Wendy Hsin-Yuan and Soman, Dilip},
	journal={Research Report Series: Behavioural Economics in Action, Rotman School of Management, University of Toronto},
	year={2013}
}

@inproceedings{kiryakova2014gamification,
	title={Gamification in education},
	author={Kiryakova, Gabriela and Angelova, Nadezhda and Yordanova, Lina},
	year={2014},
	organization={Proceedings of 9th International Balkan Education and Science Conference}
}

@article{yerkes1908relation,
	title={The relation of strength of stimulus to rapidity of habit-formation},
	author={Yerkes, Robert M and Dodson, John D},
	journal={Journal of comparative neurology and psychology},
	volume={18},
	number={5},
	pages={459--482},
	year={1908},
	publisher={Wiley Online Library}
}

@article{lally2010habits,
	title={How are habits formed: Modelling habit formation in the real world},
	author={Lally, Phillippa and Van Jaarsveld, Cornelia HM and Potts, Henry WW and Wardle, Jane},
	journal={European journal of social psychology},
	volume={40},
	number={6},
	pages={998--1009},
	year={2010},
	publisher={Wiley Online Library}
}

@book{johnson2013designing,
	title={Designing with the mind in mind: simple guide to understanding user interface design guidelines},
	author={Johnson, Jeff},
	year={2013},
	publisher={Elsevier}
}

@article{orbell2010automatic,
	title={The automatic component of habit in health behavior: habit as cue-contingent automaticity.},
	author={Orbell, Sheina and Verplanken, Bas},
	journal={Health psychology},
	volume={29},
	number={4},
	pages={374},
	year={2010},
	publisher={American Psychological Association}
}

@article{walker2016impact,
	title={The impact of using Memrise on student perceptions of learning Latin vocabulary and on long-term memory of words},
	author={Walker, Louise},
	journal={Journal of Classics Teaching},
	volume={16},
	number={32},
	pages={14--20},
	year={2016},
	publisher={Cambridge Univ Press}
}

@article{sanchez2016classcraft,
	title={Classcraft: from gamification to ludicization of classroom management},
	author={Sanchez, Eric and Young, Shawn and Jouneau-Sion, Caroline},
	journal={Education and Information Technologies},
	pages={1--17},
	year={2016},
	publisher={Springer}
}

@article{wagner2017digital,
	title={Digital Gamification in Private Music Education},
	author={Wagner, Carolyn},
	journal={Antistasis},
	volume={7},
	number={1},
	year={2017}
}

@article{lingawi2016physiological,
	title={Physiological Mechanisms of Habit Formation},
	author={Lingawi, Nura W and Dezfouli, Amir and Balleine, Bernard W},
	journal={The Wiley Handbook on the Cognitive Neuroscience of Learning},
	pages={411},
	year={2016},
	publisher={John Wiley \& Sons}
}

@article{munday2016case,
	title={The case for using DUOLINGO as part of the language classroom experience/DUOLINGO como parte del curriculum de las clases de lengua extranjera},
	author={Munday, Pilar},
	journal={Revista Iberoamericana de Educaci{\'o}n a Distancia},
	volume={19},
	number={1},
	pages={83},
	year={2016},
	publisher={Universidad Nacional de Educacion a Distancia (UNED)}
}

@article{rachels2016effect,
	title={The Effect of Gamification on Elementary Students’ Spanish Language Achievement and Academic Self-Efficacy},
	author={Rachels, Jason},
	year={2016}
}

@inproceedings{renfree2016don,
	title={Don't Kick the Habit: The Role of Dependency in Habit Formation Apps},
	author={Renfree, Ian and Harrison, Daniel and Marshall, Paul and Stawarz, Katarzyna and Cox, Anna},
	booktitle={Proceedings of the 2016 CHI Conference Extended Abstracts on Human Factors in Computing Systems},
	pages={2932--2939},
	year={2016},
	organization={ACM}
}

repository: elliotfiske/THESIS

repo_name: elliotfiske/THESIS


text:
SUMMARY = "Phosphor Systemd targets"
DESCRIPTION = "Provides well known Systemd syncronization points for OpenBMC."
HOMEPAGE = "http://github.com/openbmc"
PR = "r1"

inherit obmc-phosphor-systemd
inherit obmc-phosphor-license
inherit allarch

CHASSIS_TARGETS = "start stop"
POWER_TARGETS = "start-pre start on stop-pre stop off"
HOST_TARGETS = "start-pre start started stop-pre stop stopped"

CHASSIS_FMT = "obmc-chassis-{0}@.target"
POWER_FMT = "obmc-power-{0}@.target"
HOST_FMT = "obmc-host-{0}@.target"

CHASSIS_LINK_FMT = "${CHASSIS_FMT}:obmc-chassis-{0}@{1}.target"
POWER_LINK_FMT = "${POWER_FMT}:obmc-power-{0}@{1}.target"
HOST_LINK_FMT = "${HOST_FMT}:obmc-host-{0}@{1}.target"

SYSTEMD_SERVICE_${PN} += " \
        obmc-mapper.target \
        obmc-webserver-pre.target \
        obmc-fans-ready.target \
        obmc-fan-control.target \
        obmc-standby.target \
        "

SYSTEMD_SERVICE_${PN} += "${@compose_list(d, 'CHASSIS_FMT', 'CHASSIS_TARGETS')}"
SYSTEMD_SERVICE_${PN} += "${@compose_list(d, 'POWER_FMT', 'POWER_TARGETS')}"
SYSTEMD_SERVICE_${PN} += "${@compose_list(d, 'HOST_FMT', 'HOST_TARGETS')}"

SYSTEMD_LINK_${PN} += "${@compose_list(d, 'CHASSIS_LINK_FMT', 'CHASSIS_TARGETS', 'OBMC_CHASSIS_INSTANCES')}"
SYSTEMD_LINK_${PN} += "${@compose_list(d, 'POWER_LINK_FMT', 'POWER_TARGETS', 'OBMC_POWER_INSTANCES')}"
SYSTEMD_LINK_${PN} += "${@compose_list(d, 'HOST_LINK_FMT', 'HOST_TARGETS', 'OBMC_HOST_INSTANCES')}"

repository: mellanoxbmc/openbmc-mlx

repo_name: mellanoxbmc/openbmc-mlx


text:
package main

import (
	"log"

	"github.com/michelvocks/gaia-docker-test/golang"
)

// Job1Handler is a job.
func Job1Handler(args golang.Arguments) error {
	log.Println("Job1 triggered!")
	return nil
}

func main() {
	// Create example job
	jobs := golang.Jobs{
		golang.Job{
			Title:   "Job1",
			Handler: Job1Handler,
		},
	}

	if err := golang.Serve(jobs); err != nil {
		panic(err)
	}
}

repository: michelvocks/docker-build-test

repo_name: michelvocks/docker-build-test

extension: go


text:
# Copyright (c) 2013, Ruslan Baratov
# All rights reserved.

include(CMakeParseArguments) # cmake_parse_arguments

include(hunter_internal_error)
include(hunter_wiki)

function(hunter_fatal_error)
  cmake_parse_arguments(x "" "WIKI" "" "${ARGV}")
  if(NOT x_WIKI)
    hunter_internal_error("Expected argument WIKI")
  endif()
  message("")
  foreach(x ${x_UNPARSED_ARGUMENTS})
    message("[hunter ** FATAL ERROR **] ${x}")
  endforeach()
  message("[hunter ** FATAL ERROR **] [Directory:${CMAKE_CURRENT_LIST_DIR}]")
  message("")
  hunter_wiki("${x_WIKI}")
endfunction()

repository: weiqiangzheng/hunter

repo_name: weiqiangzheng/hunter


text:
@article{pan2020finetuning,
  title={Exemplar-based Layout Fine-tuning for Node-link Diagrams},
  author={Pan, Jiacheng and Chen, Wei and Zhao, Xiaodong and Zhou, Shuyue and Zeng, Wei and Zhu, Minfeng and Chen, Jian and Fu, Siwei and Wu, Yingcai},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  year={2020},
  volume={},
  number={},
  pages={}
}


text:
DESCRIPTION = "Dialog-like functionality for Python Console Programs"
SECTION = "devel/python"
PRIORITY = "optional"
LICENSE = "LGPL"
SRCNAME = "pythondialog"
PR = "ml1"

SRC_URI = "${SOURCEFORGE_MIRROR}/${SRCNAME}/${SRCNAME}-${PV}.tar.bz2"
S = "${WORKDIR}/${SRCNAME}-${PV}"

inherit distutils

SRC_URI[md5sum] = "19e68b362fe61ef84b981d53d96f0735"
SRC_URI[sha256sum] = "5f7dbcbd28eebadc736d957b9511a87ad5570c8fc822c8123a42e7259773cb7f"


text:
require openssh.inc

PR = "${INC_PR}.2"

SRC_URI = "ftp://ftp.openbsd.org/pub/OpenBSD/OpenSSH/portable/openssh-${PV}.tar.gz \
           file://sshd_config \
           file://ssh_config \
           file://init \
           file://openssh-5.2-sftp-server-nolibcrypto.patch \
          "

SRC_URI[md5sum] = "ada79c7328a8551bdf55c95e631e7dad"
SRC_URI[sha256sum] = "4023710c37d0b3d79e6299cb79b6de2a31db7d581fe59e775a5351784034ecae"


text:
@article{Yagi:2010ff,
 archiveprefix = {arXiv},
 author = {Yagi, Junya},
 doi = {10.1090/pspum/085/1401},
 editor = {Block, Jonathan and Distler, Jacques and Donagi, Ron and Sharpe, Eric},
 eprint = {1002.0028},
 journal = {Proc. Symp. Pure Math.},
 pages = {477--484},
 primaryclass = {hep-th},
 title = {Vanishing chiral algebras and Hohn-Stolz conjecture},
 volume = {85},
 year = {2012}
}

repository: jnyg/starter-academic

repo_name: jnyg/starter-academic


text:
@article{Hutcheon:2016aa,
 author = {Hutcheon, Jennifer and Strumpf, Erin and Harper, Sam and Giesbrecht, Ellen},
 bdsk-url-1 = {https://doi.org/10.1111/1471-0528.13772},
 date-added = {2020-09-24 17:40:09 -0400},
 date-modified = {2020-09-24 17:40:09 -0400},
 doi = {10.1111/1471-0528.13772},
 journal = {BJOG},
 journal-full = {BJOG : an international journal of obstetrics and gynaecology},
 mesh = {Cesarean Section; Delivery, Obstetric; Female; Humans; Interrupted Time Series Analysis; Pregnancy},
 month = {May},
 number = {6},
 pages = {1035},
 pmid = {27101271},
 pst = {ppublish},
 title = {Authors' reply re: Maternal and neonatal outcomes after implementation of a hospital policy to limit low-risk planned caesarean deliveries before 39 weeks of gestation: an interrupted time-series analysis},
 volume = {123},
 year = {2016}
}


text:
DESCRIPTION = "Trusted Services ts-remote-test deployment for arm-linux."

TS_ENV = "arm-linux"

require trusted-services.inc

DEPENDS        += "libts"
RDEPENDS:${PN} += "libts"

OECMAKE_SOURCEPATH = "${S}/deployments/ts-remote-test/${TS_ENV}"

FILES:${PN} = "${bindir}/ts-remote-test"

repository: openbmc/openbmc

repo_name: openbmc/openbmc

gha_license_id: NOASSERTION

gha_language: Python


text:
SECTION = "console/network"
DEPENDS = "cyrus-sasl virtual/db"
LICENSE = "BSD"
PR = "r12"

SRC_URI = "ftp://ftp.andrew.cmu.edu/pub/cyrus-mail/cyrus-imapd-${PV}.tar.gz \
           file://autotools.patch \
           file://tail.patch \
           file://imapopts.c.gcc4.patch \
           file://imapopts.h.gcc4.patch \
	   file://cyrus \
	   file://cyrus.conf_2.2 \
	   file://imapd.conf_2.2 \
	   file://volatiles \
           file://remove-install-strip.patch \
	   "

inherit autotools update-rc.d

INITSCRIPT_NAME = "cyrus"
INITSCRIPT_PARAMS = "start 56 3 4 5 . stop 15 0 1 6 ."

TARGET_LDFLAGS_append_thumb = " -lpthread"
EXTRA_OECONF = "--with-auth=unix \
		--with-dblib=berkeley \
	        --with-bdb-libdir=${STAGING_LIBDIR} \
	        --with-bdb-incdir=${STAGING_INCDIR} \
		--without-perl \
		--without-snmp"

FILES_${PN} += "${prefix}/cyrus/bin"

# All, lib/foo.c includes <config.h> from the top level directory and
# is natively compiled
BUILD_CPPFLAGS += " -I${S} -I${S}/et"

do_install_append () {
	install -d ${D}${sysconfdir}/init.d
	install -m 755 ${WORKDIR}/cyrus ${D}${sysconfdir}/init.d/cyrus
	install -m 644 ${WORKDIR}/cyrus.conf_2.2 ${D}${sysconfdir}/cyrus.conf
	install -m 644 ${WORKDIR}/imapd.conf_2.2 ${D}${sysconfdir}/imapd.conf
	install -d ${D}${sysconfdir}/default/volatiles
	install -m 644 ${WORKDIR}/volatiles ${D}${sysconfdir}/default/volatiles/01_cyrus-imapd
}

pkg_postinst () {
	/etc/init.d/populate-volatile.sh update
}

pkg_postrm () {
}

SRC_URI[md5sum] = "70b3bba526a8d36d3bb23a87d37e9188"
SRC_URI[sha256sum] = "3c6f41255ba15d8b2ea78320dd5e0c98e07fe0b5c3c4b84bc20f503427bd1b7b"


text:
/*
Copyright 2017 The Kubernetes Authors.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/

package phases

import (
	"fmt"

	"github.com/pkg/errors"

	"k8s.io/klog/v2"

	"github.com/carlory/firefly/pkg/adm/cmd/options"

	"github.com/carlory/firefly/pkg/adm/cmd/phases/workflow"

	cmdutil "github.com/carlory/firefly/pkg/adm/cmd/util"
	etcdphase "github.com/carlory/firefly/pkg/adm/phases/etcd"
)

var (
	etcdhostedExample = cmdutil.Examples(`
		# Generates manifest files for etcd and apply them into the Kubernetes,
		# functionally equivalent to what is applied by fireflyadm init.
		fireflyadm init phase etcd hosted

		# Generates manifest files for etcd using options
		# read from a configuration file.
		fireflyadm init phase etcd hosted --config config.yaml
		`)
)

// NewEtcdPhase creates a kubeadm workflow phase that implements handling of etcd.
func NewEtcdPhase() workflow.Phase {
	phase := workflow.Phase{
		Name:  "etcd",
		Short: "Generate manifest files for local etcd",
		Long:  cmdutil.MacroCommandLongDescription,
		Phases: []workflow.Phase{
			newEtcdHostedSubPhase(),
		},
	}
	return phase
}

func newEtcdHostedSubPhase() workflow.Phase {
	phase := workflow.Phase{
		Name:         "hosted",
		Short:        "Generate manifest files for a local, single-node hosted etcd instance",
		Example:      etcdhostedExample,
		Run:          runEtcdPhaseHosted,
		InheritFlags: getEtcdPhaseFlags(),
	}
	return phase
}

func getEtcdPhaseFlags() []string {
	flags := []string{
		options.CertificatesDir,
		options.CfgPath,
		options.ImageRepository,
		options.Patches,
		options.DryRun,
	}
	return flags
}

func runEtcdPhaseHosted(c workflow.RunData) error {
	data, ok := c.(InitData)
	if !ok {
		return errors.New("etcd phase invoked with an invalid data struct")
	}
	cfg := data.Cfg()
	client, err := data.Client()
	if err != nil {
		return errors.Wrap(err, "error creating client")
	}
	namespace := data.Cfg().FireflyNamespace

	// Add etcd static pod spec only if external etcd is not configured
	if cfg.Etcd.External == nil {
		fmt.Printf("[etcd] Creating static Pod manifest for local etcd in %q\n", data.ManifestDir())
		if err := etcdphase.CreateHostedEtcd(client, namespace, data.ManifestDir(), data.PatchesDir(), &cfg.ClusterConfiguration, data.DryRun()); err != nil {
			return errors.Wrap(err, "error creating local etcd static pod manifest file")
		}
		// if err := etcdphase.EnsureEtcd(nil, data.DryRun()); err != nil {
		// 	return errors.Wrap(err, "error creating local etcd static pod manifest file")
		// }
	} else {
		klog.V(1).Infoln("[etcd] External etcd mode. Skipping the generation and apply of manifests for hosted etcd")
	}
	return nil
}

repository: carlory/firefly

repo_name: carlory/firefly

gha_language: Go


text:
package repositories

import (
	"context"
	"strings"

	log "github.com/sirupsen/logrus"

	"github.com/PUMATeam/catapult/pkg/model"
	"github.com/go-pg/pg"
	uuid "github.com/satori/go.uuid"
)

// NewVMsRepository create a new vm repository
func NewVMsRepository(db *pg.DB) VMs {
	return &vmsRepository{db: db}
}

type vmsRepository struct {
	db *pg.DB
}

func (v *vmsRepository) AddVM(ctx context.Context, vm model.VM) (uuid.UUID, error) {
	tx, err := v.db.Begin()
	if err != nil {
		log.Error(err)
	}
	err = v.db.WithContext(ctx).Insert(&vm)

	// TODO disgusting hack, find an actual solution
	if err != nil && strings.Contains(err.Error(), "cannot convert") {
		return vm.ID, nil
	}
	if err != nil {
		log.Error(err)
		return uuid.Nil, tx.Rollback()
	}

	return vm.ID, err
}

func (v *vmsRepository) UpdateVM(ctx context.Context, vm model.VM) error {
	err := v.db.WithContext(ctx).Update(&vm)
	return err
}

func (v *vmsRepository) VMByID(ctx context.Context, vmID uuid.UUID) (model.VM, error) {
	vm := model.VM{
		ID: vmID,
	}

	err := v.db.WithContext(ctx).Select(&vm)

	// TODO disgusting hack, find an actual solution
	if err != nil && strings.Contains(err.Error(), "cannot convert") {
		return vm, nil
	}

	return vm, err
}

func (v *vmsRepository) ListVMs(ctx context.Context) ([]model.VM, error) {
	var vms []model.VM
	err := v.db.WithContext(ctx).Model(&vms).Select()
	return vms, err
}

repository: PUMATeam/catapult

repo_name: PUMATeam/catapult


text:
SUMMARY = "A lightweight compositor for X11"
HOMEPAGE = "https://github.com/yshui/picom"
LICENSE = "MPL-2.0 & MIT"
LIC_FILES_CHKSUM = "file://COPYING;md5=a9a621b5a1b8f702c605093d657b550c"

SRC_URI = "git://github.com/yshui/picom.git;branch=stable/8;protocol=https"
SRCREV = "dac85eac10082dfc3df463aaa74b811144e22122"
PV = "8.2"
S = "${WORKDIR}/git"

DEPENDS = " \
    libxext \
    libxdamage \
    libxfixes \
    xcb-util-renderutil \
    libxrender \
    libxrandr \
    libxcomposite \
    xcb-util-image \
    libxpresent \
    libxinerama \
    libdrm \
    libev \
    pixman \
    dbus \
    libconfig \
    libpcre \
    uthash \
"

inherit meson features_check gtk-icon-cache

REQUIRED_DISTRO_FEATURES = "x11"

PACKAGECONFIG ??= "${@bb.utils.filter('DISTRO_FEATURES', 'opengl', d)}"
PACKAGECONFIG[opengl] = "-Dopengl=true,-Dopengl=false,virtual/libgl"


text:
DESCRIPTION = "A sophisticated console ftp client"
SECTION = "console/network"
PRIORITY = "optional"
LICENSE = "ClarifiedArtistic"

SRC_URI = "ftp://ftp.ncftp.com/ncftp/older_versions/ncftp-${PV}-src.tar.bz2 \
	   file://acinclude.m4 \
	   file://make.patch \
	   file://fixes.patch"

inherit autotools

do_configure_prepend () {
	install -m 0644 ${WORKDIR}/acinclude.m4 acinclude.m4
}

INHIBIT_AUTO_STAGE = "1"

do_install () {
	install -d ${D}${bindir} ${D}${sysconfdir} ${D}${mandir}
	oe_runmake 'prefix=${D}${prefix}' 'BINDIR=${D}${bindir}' \
		   'SYSCONFDIR=${D}${sysconfdir}' 'mandir=${D}${mandir}' \
		   install
}

SRC_URI[md5sum] = "384b7f01d725c89ccd30692628b3ac1b"
SRC_URI[sha256sum] = "2ebc7b51af96cb0fa8b703c7cb995bfb46ccf5312e335270d0420e260544c376"


text:
# Copyright (C) 2008 Instituto Nokia de Tecnologia
# Released under the MIT license (see COPYING.MIT for the terms)

DESCRIPTION = "Mamona-IM Enlightenment Applet"
HOMEPAGE = "http://dev.openbossa.org/trac/mamona/wiki"
LICENSE = "MIT BSD"
DEPENDS = "mamona-input-methods e-wm"
SRCREV = "a1ba7e8a388ffce3cca92bad059cd801e7733a7a"
PV = "0.1-${PR}+gitr${SRCREV}"
PR = "r1"
PE = "1"

SRC_URI = "git://dev.openbossa.org/mamona/projects/mamonaim_e_applet.git;protocol=http"
S = "${WORKDIR}/git"

inherit autotools pkgconfig

do_configure_prepend() {
        ./autogen.sh
}

# E Applet
FILES_${PN} = "\
            ${libdir}/enlightenment/modules/mamonaim/module.desktop \
            ${libdir}/enlightenment/modules/mamonaim/mamonaim.edj \
            ${libdir}/enlightenment/modules/mamonaim/e-module-mamonaim.edj \
            ${libdir}/enlightenment/modules/mamonaim/*.png \
            ${libdir}/enlightenment/modules/mamonaim/*/module.so \
        "
FILES_${PN}-dev = "\
            ${libdir}/enlightenment/modules/mamonaim/*/module.la \
            ${libdir}/enlightenment/modules/mamonaim/*/module.a \
        "
FILES_${PN}-dbg = "\
            ${libdir}/enlightenment/modules/mamonaim/*/.debug \
        "


text:
@inproceedings{moritz2017pangloss,
	Author = {Moritz, Dominik and Fisher, Danyel},
	Booktitle = {Submitted to the SIGCHI Conference on Human Factors in Computing Systems},
	Date-Added = {2016-11-11 19:42:45 +0000},
	Date-Modified = {2016-11-11 19:42:45 +0000},
	Organization = {ACM},
	Pages = {},
	Title = {Trust, but Verify: Optimistic Visualizations of Approximate Queries for Exploring Big Data},
	Year = {2017}}

@article{brehmer2013multi,
	Author = {Brehmer, Matthew and Munzner, Tamara},
	Date-Added = {2016-11-11 19:42:56 +0000},
	Date-Modified = {2016-11-11 19:42:56 +0000},
	Journal = {IEEE Transactions on Visualization and Computer Graphics},
	Number = {12},
	Pages = {2376--2385},
	Publisher = {IEEE},
	Title = {A multi-level typology of abstract visualization tasks},
	Volume = {19},
	Year = {2013}}

@inproceedings{heer2010crowdsourcing,
	Author = {Heer, Jeffrey and Bostock, Michael},
	Booktitle = {Proceedings of the SIGCHI Conference on Human Factors in Computing Systems},
	Date-Added = {2016-11-11 19:42:45 +0000},
	Date-Modified = {2016-11-11 19:42:45 +0000},
	Organization = {ACM},
	Pages = {203--212},
	Title = {Crowdsourcing graphical perception: using mechanical turk to assess visualization design},
	Year = {2010}}

@inproceedings{kay2016ish,
	Author = {Kay, Matthew and Kola, Tara and Hullman, Jessica R and Munson, Sean A},
	Booktitle = {Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems},
	Date-Added = {2016-11-11 19:42:29 +0000},
	Date-Modified = {2016-11-11 19:42:29 +0000},
	Organization = {ACM},
	Pages = {5092--5103},
	Title = {When (ish) is My Bus? User-centered Visualizations of Uncertainty in Everyday, Mobile Predictive Systems},
	Year = {2016}}

@article{amar2005knowledge,
	Author = {Amar, Robert A and Stasko, John T},
	Date-Added = {2016-11-11 19:42:06 +0000},
	Date-Modified = {2016-11-11 19:42:06 +0000},
	Journal = {IEEE Transactions on Visualization and Computer Graphics},
	Number = {4},
	Pages = {432--442},
	Publisher = {IEEE},
	Title = {Knowledge precepts for design and evaluation of information visualizations},
	Volume = {11},
	Year = {2005}}

@inproceedings{laput2015zensors,
	Author = {Laput, Gierad and Lasecki, Walter S and Wiese, Jason and Xiao, Robert and Bigham, Jeffrey P and Harrison, Chris},
	Booktitle = {Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems},
	Date-Added = {2016-11-11 19:41:19 +0000},
	Date-Modified = {2016-11-11 19:41:19 +0000},
	Organization = {ACM},
	Pages = {1935--1944},
	Title = {Zensors: Adaptive, rapidly deployable, human-intelligent sensor feeds},
	Year = {2015}}

@inproceedings{noronha2011platemate,
	Author = {Noronha, Jon and Hysen, Eric and Zhang, Haoqi and Gajos, Krzysztof Z},
	Booktitle = {Proceedings of the 24th annual ACM symposium on User interface software and technology},
	Date-Added = {2016-11-11 19:41:08 +0000},
	Date-Modified = {2016-11-11 19:41:08 +0000},
	Organization = {ACM},
	Pages = {1--12},
	Title = {Platemate: crowdsourcing nutritional analysis from food photographs},
	Year = {2011}}

@inproceedings{fisher2012trust,
	Author = {Fisher, Danyel and Popov, Igor and Drucker, Steven and others},
	Booktitle = {Proceedings of the SIGCHI Conference on Human Factors in Computing Systems},
	Date-Added = {2016-11-11 19:40:31 +0000},
	Date-Modified = {2016-11-11 19:40:31 +0000},
	Organization = {ACM},
	Pages = {1673--1682},
	Title = {Trust me, I'm partially right: incremental visualization lets analysts explore large datasets faster},
	Year = {2012}}

@inproceedings{agarwal2014knowing,
	Author = {Agarwal, Sameer and Milner, Henry and Kleiner, Ariel and Talwalkar, Ameet and Jordan, Michael and Madden, Samuel and Mozafari, Barzan and Stoica, Ion},
	Booktitle = {Proceedings of the 2014 ACM SIGMOD international conference on Management of data},
	Date-Added = {2016-11-11 19:35:31 +0000},
	Date-Modified = {2016-11-11 19:35:31 +0000},
	Organization = {ACM},
	Pages = {481--492},
	Title = {Knowing when you're wrong: building fast and reliable approximate query processing systems},
	Year = {2014}}

@inproceedings{yi2008understanding,
	Author = {Yi, Ji Soo and Kang, Youn-ah and Stasko, John T and Jacko, Julie A},
	Booktitle = {Proceedings of the 2008 Workshop on BEyond time and errors: novel evaLuation methods for Information Visualization},
	Date-Added = {2016-09-19 17:36:02 +0000},
	Date-Modified = {2016-09-19 17:36:02 +0000},
	Organization = {ACM},
	Title = {Understanding and characterizing insights: how do people gain insights using information visualization?},
	Year = {2008}}

@article{liu2014effects,
	Author = {Liu, Zhicheng and Heer, Jeffrey},
	Date-Added = {2016-09-19 20:23:15 +0000},
	Date-Modified = {2016-09-19 20:23:15 +0000},
	Journal = {IEEE transactions on visualization and computer graphics},
	Number = {12},
	Publisher = {IEEE},
	Title = {The effects of interactive latency on exploratory visual analysis},
	Volume = {20},
	Year = {2014}}

@article{nielsen1993response,
	Author = {Nielsen, Jakob},
	Date-Added = {2016-09-19 17:35:39 +0000},
	Date-Modified = {2016-09-19 17:35:39 +0000},
	Journal = {Usability Engineering},
	Publisher = {Morgan Kaufmann Publish},
	Title = {Response times: The 3 important limits},
	Year = {1993}}

@inproceedings{agarwal2013blinkdb,
	Acmid = {2465355},
	Address = {New York, NY, USA},
	Author = {Agarwal, Sameer and Mozafari, Barzan and Panda, Aurojit and Milner, Henry and Madden, Samuel and Stoica, Ion},
	Booktitle = {Proceedings of the 8th ACM European Conference on Computer Systems},
	Doi = {10.1145/2465351.2465355},
	Isbn = {978-1-4503-1994-2},
	Location = {Prague, Czech Republic},
	Numpages = {14},
	Publisher = {ACM},
	Series = {EuroSys '13},
	Title = {BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data},
	Url = {http://doi.acm.org/10.1145/2465351.2465355},
	Year = {2013},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2465351.2465355},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2465351.2465355}}

@inproceedings{ding2016sample+,
	Acmid = {2915249},
	Address = {New York, NY, USA},
	Author = {Ding, Bolin and Huang, Silu and Chaudhuri, Surajit and Chakrabarti, Kaushik and Wang, Chi},
	Booktitle = {Proceedings of the 2016 International Conference on Management of Data},
	Doi = {10.1145/2882903.2915249},
	Isbn = {978-1-4503-3531-7},
	Keywords = {approximate query processing, indexing, precision guarantee, sampling},
	Location = {San Francisco, California, USA},
	Numpages = {16},
	Publisher = {ACM},
	Series = {SIGMOD '16},
	Title = {Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee},
	Url = {http://doi.acm.org/10.1145/2882903.2915249},
	Year = {2016},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2882903.2915249},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2882903.2915249}}

@inproceedings{kamat2014distributed,
	Author = {Kamat, Niranjan and Jayachandran, Prasanth and Tunga, Karthik and Nandi, Arnab},
	Booktitle = {2014 IEEE 30th International Conference on Data Engineering},
	Organization = {IEEE},
	Title = {Distributed and interactive cube exploration},
	Year = {2014}}

@inproceedings{card1991information,
	Author = {Card, Stuart K and Robertson, George G and Mackinlay, Jock D},
	Booktitle = {Proceedings of the SIGCHI Conference on Human factors in computing systems},
	Organization = {ACM},
	Pages = {181--186},
	Title = {The information visualizer, an information workspace},
	Year = {1991}}

@article{tukey1977exploratory,
	Author = {Tukey, John W},
	Publisher = {Reading, Mass.},
	Title = {Exploratory data analysis},
	Year = {1977}}

@inproceedings{olston2002visualizing,
	Author = {Olston, Chris and Mackinlay, Jock D},
	Booktitle = {Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on},
	Date-Added = {2016-09-19 20:39:32 +0000},
	Date-Modified = {2016-09-19 20:39:32 +0000},
	Organization = {IEEE},
	Title = {Visualizing data with bounded uncertainty},
	Year = {2002}}

@article{joslyn2013decisions,
	Author = {Joslyn, Susan and LeClerc, Jared},
	Date-Added = {2016-09-19 18:03:51 +0000},
	Date-Modified = {2016-09-19 18:03:51 +0000},
	Journal = {Current Directions in Psychological Science},
	Number = {4},
	Publisher = {Sage Publications},
	Title = {Decisions with uncertainty: the glass half full},
	Volume = {22},
	Year = {2013}}

@article{borkin2013makes,
  title={What makes a visualization memorable?},
  author={Borkin, Michelle A and Vo, Azalea A and Bylinskii, Zoya and Isola, Phillip and Sunkavalli, Shashank and Oliva, Aude and Pfister, Hanspeter},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  volume={19},
  number={12},
  pages={2306--2315},
  year={2013},
  publisher={IEEE}
}

repository: domoritz/bias-study

repo_name: domoritz/bias-study


text:
package concurrent

import (
	"sync"

	"github.com/Fantom-foundation/lachesis-base/hash"
)

type EventsSet struct {
	sync.RWMutex
	hash.EventsSet
}

func WrapEventsSet(v hash.EventsSet) *EventsSet {
	return &EventsSet{
		RWMutex:   sync.RWMutex{},
		EventsSet: v,
	}
}

repository: weijun-sh/go-opera

repo_name: weijun-sh/go-opera