waashk/dblp huggingface dataset:
hierarchical model-based clustering of relational data with aggregates. this paper proposes a propositional method for hierarchical model-based clustering of relational data. we define a new type of aggregate -- frequency aggregate, which has a vector data type and can be used to record not only the observed values but also the distribution of the values of an attribute. a hierarchical agglomerative clustering algorithm with log-likelihood distance is then applied to cluster the aggregated data tentatively, and a mixture model-based method with the em algorithm is developed to perform a further relocation clustering, in which bayes information crieterion is used to determine the optimal number of clusters.
template detection for large scale search engines. templates in web sites hurt search engine retrieval performance, especially in content relevance and link analysis. current template removal methods suffer from processing speed and scalability when dealing with large volume web pages. in this paper, we propose a novel two-stage template detection method, which combines template detection and removal with the index building process of a search engine. first, web pages are segmented into blocks and blocks are clustered according to their style features. second, similar contents sharing the common layout style are detected during the index building process. the blocks with similar layout style and content are identified as templates and deleted. our experiment on eight popular web sites shows that our method achieves 20-40% faster than shingle and sst methods with close accuracy.
the bitmap-based feature selection method. cbr(case-based reasoning) is a problem solving technique that reuses past cases and experiences to find a solution to current problems. a critical issue in case-based reasoning is to select the correct and enough features to represent a case. however, this task is difficult to carry out since such knowledge is often exhaustively captured and cannot be represented successfully. in this paper, the new, efficient feature selection method originated from bitmap indexing and rough set techniques will be proposed. the bitmap-based feature selection method is proposed for discovering the optimal feature sets for decision-making problems. and the corresponding indexing and selecting algorithms for such feature selection method are also proposed. finally, some experiments and comparisons are given and the result shows the efficiency and accuracy of our proposed method.
deontic relevant logic as the logical basis for legal information systems. this paper discusses why classical mathematical logic, its various classical conservatives extensions, or its non-classical alternatives are not suitable candidates for the right fundamental logic to underlie legal information systems, and show that deontic relevant logic is a more hopeful candidate for the right fundamental logic.
arcats: a scalable compositional analysis tool suite. automatic verification techniques, which analyze all processes at once, typically do not scale well for large, complex concurrent software systems because of the theoretic barrier - pspace complexity in worst case. in this paper, we present our tool named arcats (architecture refactoring and compositional analysis tool suite). arcats consists a set of tools to combat state explosion in a divide-and-conquer, hierarchical manner, which is also known as compositional analysis. we build these tools to seek out best combinations to scale the verification to larger software systems.
tinygals: a programming model for event-driven embedded systems. networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. programming embedded systems with multiple reactive tasks is difficult due to the complex nature of managing the concurrency of execution threads and consistency of shared states. this paper describes a globally asynchronous and locally synchronous model (tinygals) for programming event-driven embedded systems. software components are composed locally through synchronous method calls to form modules, and asynchronous message passing is used between modules to separate the flow of control. in addition, a guarded yet synchronous model (tinyguys) is designed to allow thread-safe sharing of global state by multiple modules without explicitly passing messages. this programming model is structured such that all asynchronous message passing code and module triggering mechanisms can be automatically generted from a high-level specification. we have implemented the programming model and code generation facilities on a wireless sensor network platform known as the berkeley motes. as an example, we have redesigned a multi-hop ad hoc communication protocol using the tinygals model.
providing resource allocation and performance isolation in a shared streaming-media hosting service. the trend toward media content hosting is seeing a significant growth as more rich media is used in the enterprise environment and as it becomes mission critical for businesses. a shared media hosting service supports the illusion that each hosted service has its own media server, when, in reality, multiple "logical hosts" may share one physical host. for such a shared media hosting service, the ability to guarantee a specified share of server resources to a particular hosted service is very important. we present sharedmediaguard - a shared media hosting infrastructure that can efficiently allocate the predefined shares of server resources to the hosted media services. the proposed solution is based on a unified cost function that uses a single value to reflect the combined resource requirement such as cpu, bandwidth and memory necessary to support a particular media stream depending on the stream bit rate and type of access (memory file access or disk file access). our evaluation of sharedmediaguard compared to the traditional, disk-based allocation strategy that assumes all content must be served from disk reveals a factor of two improvement in server throughput while providing performance isolation and qos guarantees among the hosted services.
mamview: a visual tool for exploring and understanding metric access methods. the mamview framework is a data exploration tool that allows developers and users of metric access methods (mams) to explore and share dynamic and interactive 3d presentations of a mam, making the understanding of those structures easier. it is able to create visual representations of metric datasets, including high-dimensional and non-dimensional information. this is achieved by using an extension of the fastmap algorithm. this framework was developed as a practical tool that has been successfully applied to study existing mams, helping both new and experienced users to better understand them. the mamview was also applied to a new under development mam. with mamview in hands, the development team of this mam was able to drill-down its algorithms, quickly finding problems and also potential points for improvement and optimizations. our focus on this work is on proposing an intuitive yet powerful visualization framework that can be easily employed to build intuitive visual presentations that can bypass the drawback of mams dealing with datasets with no spatial representation. besides mamview being a powerful visualization tool, its greatest strengths are the ability to interactively explore a visual presentation of a mam at any level of detail, and the ability to seamlessly query and produce graphical representations in xml format that can be straightforward executed. this paper presents the mamview framework and its main techniques, describes the current tool, and reports on our experiences in applying it to real applications.
contour-based partial object recognition using symmetry in image databases. this paper discusses the problem of partial object recognition in image databases. we propose the method to reconstruct and estimate partially occluded shapes and regions of objects in images from overlapping and cutting. we present the robust method for recognizing partially occluded objects based on symmetry properties, which is based on the contours of objects. our method provides simple techniques to reconstruct occluded regions via a region copy using the symmetry axis within an object. based on the estimated parameters for partially occluded objects, we perform object recognition on the classification tree. since our method relies on reconstruction of the object based on the symmetry rather than statistical estimates, it has proven to be remarkably robust in recognizing partially occluded objects in the presence of scale changes, rotation, and viewpoint changes.
on utility accrual processor scheduling with wait-free synchronization for embedded real-time software. we present the first wait-free utility accrual (ua) real-time scheduling algorithms for embedded real-time systems. ua scheduling algorithms allow application activities to be subject to time/utility function (tuf) time constraints, and optimize criteria such as maximizing the sum of the activities' attained utilities. we present ua algorithms that use wait-free synchronization for mutually exclusively accessing shared data objects. we derive lower bounds on the possible accrued utility with wait-free over their lock-based counterparts, while incurring the minimum possible additional space costs. our implementation measurements on a posix rtos reveal that (during under-loads), the wait-free algorithms yield optimal utility for step tufs and significantly higher utility (than lock-based) for non-step tufs.
design and implementation of a kernel resource protector for robustness of linux module programming. loadable kernel modules supported by linux provides lots of benefits such as a small-sized kernel, on-demand loading, and easy software upgrading. however, since modules are executed in a privileged mode, trivial misuses in a module may cause critical system halts or deadlock situations. this paper presents a kernel resource protector which prevents kernel from faults generated by modules. the protector models the system in two objects: module object and resource object. by observing the interrelations between the two objects, the protector can detect misuses of modules and take actions to resolve the erroneous situations. implementation study has shown that the protector can find out memory leaks wasted by modules and can reclaim leaks without degrading system performance. the proposed protector makes linux more robust, which is required indispensably in the system equipped with nvram (non volatile ram) such as fram and pram.
an extension of dead end elimination for protein side-chain conformation using merge-decoupling. a two-phase strategy is widely adopted to solve the side-chain conformation prediction (sccp) problem. phase one is a fast reduction phase removing large numbers of rotamers not existing in the gmec. phase two (optimization phase) uses heuristics or exhaustive search to find a good/optimal solution. presently, dee (dead end elimination) is the only deterministic reduction method for phase one. however, to achieve convergence in phase two using dee, the strategy of forming super-residues is used. this quickly leads to a combinatorial explosion, and becomes inefficient in this paper, an improvement of the dee process by forming super-residues efficiently is proposed for phase one. the method basically merges residues into pairs based on some merging criteria. simple goldstein is then applied until no more elimination is possible. a decoupling process then reforms the original residues sans removed rotamers and rotamer pairs. the process of merging and elimination is repeated until no more elimination is possible. initial experiments have shown the method, called merge-decoupling dee, can fix up to 25% of the unfixed residues coming out of simple goldstein dee.
creating and shareing web notes via a standard browser. today practitioners in education actively publish their instructional materials as html documents, using a variety of media. yet, in most cases, third parties can only passively read the documents displayed in their browsers. this partly accounts for why students in web-based courses continue to take notes and get feedback on assignments from their teachers on paper documents [9]. in this paper, we describe an intuitve web annotation environment that allows users to annotate directly on any dhtml-compliant portions of web page using a standard browser, for private, group or public use along with support for voice synthesis and notification. in makes extensive use of dhtml to realize the interactive markup effects and offers capabilities not available in existing systems. our implementation is among the few systems currently available that make use of dhtml for creating a wide range of group services within web browsers.
coordination middleware for xml-centric applications. this paper focuses on coordination middleware for distributed applications based on active documents and xml technologies. it introduces the main concepts underlying active documents and xml then, the paper goes into details about the problem of defining a suitable middleware architecture to effectively support coordination activities in applications including active documents and mobile agents, by specifically focusing on the role played by xml technologies in that context. according to a simple taxonomy, the characteristics of several middleware systems are analyzed and evaluated. this analysis enables us to identify the advantages and the shortcoming of the different approaches, and to identify the basic requirements of a middleware for xml-centric applications.
weaving concerns in model based development of data-intensive web applications. the last decade witnessed a pervasive growth of web applications intended as environments for distributed applications. many design methodologies have been proposed to cope with the technical intricacy of such systems. although each of them proposes its own constructs, they share a common metamodel enabling the designer to describe web applications under three different views: data, navigation and presentation. while the constructs can be unified in such a metamodel, consistency among the views is guaranteed by less formal relations being essentially based on name conventions and/or ad-hoc tool support.this paper proposes explicit weaving models to define rigorous connections between the different artifacts produced during a system development, in order to enhance their reuse and maintenance and perform operations based on the connection semantics. these structural mappings do not interfere with the definition of the views on either side, achieving a clear separation of views and their connections and enabling the use of general purpose theories and tools.
dana (digital archive network for anthropology): a model for digital archiving. this is a report of work on an internet-based digital library called the digital archive network for anthropology (dana). dana provides a model for a generalized method for implementing digital archives. this federation of databases will link researchers, students, and the general public to distributed databases that include realistic, accurate, three-dimensional (3d), visual representations of artifacts, fossils, and other objects, along with 2d digitized documents (e.g., maps, plan views, excavation profiles, and photographs) and various associated data. dana will have a strong data mining component which will allow users to find relationships in the data which correspond to facts about the actual artifacts and fossils. the data mining techniques involve a new spatial data mining structure called the ptree. dana is being created through development and implementation of cross-platform, open standards that will facilitate interoperability and exchange of information between remote systems. dana enables dynamic use of digital models, virtual measurement tools, and an array of data supplied by contributing content providers (collaborators) for education and scholarly research.
disentangling the implementation of local-to-global transformations in a rewrite rule transformation system. transformation rules are often used to implement compilers for domain-specific languages. in an ideal situation, each transformation rule is a modular unit transforming one input element of the source program into a new element of the output program. however, in practice, transformation rules must be written which take one input element and produce several new elements belonging to various locations in the output program, the so-called local-to-global transformations. the implementation of such transformations is very complex and tightly coupled which imposes severe constraints on maintenance and evolvability. in this paper, we propose a transformation architecture on top of rewrite rules to loosen this coupling. the resulting transformation system combines the simplicity and modularity properties of rewrite rules with a new semi-automatic composition system that enables the implementation of local-to-global transformations without hampering maintenance and future evolutions.
from collective knowledge to e-books. this paper describes a new way of creating electronic books through the unsupervised collaborative work of several authors. for this aim a web-based groupware system for knowledge construction is proposed. this system allows building web sites that can be described as electronic books where relevant and structured knowledge about some area or topic can be found.these electronic books are adaptive: they are in continuous evolution as a response to user contributions. users that are interacting with the electronic book form a virtual community that is in charge of the creation of the structure and the contents of the book in an unsupervised way.the system has being tested with several groups of students at universidad autonoma de madrid, who have constructed electronic books about some of their academic courses.
a software framework for efficient system-level performance evaluation of embedded systems. the sesame environment provides modeling and simulation methods and tools for the efficient design space exploration of heterogeneous embedded multimedia systems. in this paper we describe the sesame software system and demonstrate its capabilities using several examples. we show that sesame significantly reduces model construction time through the use of modeling component libraries, hierarchy, and advanced model structure description features.
towards differentiation-enabled fortran 95 compiler technology. we present a novel approach to generating derivative code for mathematical models implemented as fortran 95 programs using automatic differentiation inside a compiler. this technique allows us to combine the advantages of both operator overloading and source transformation based tools for automatic differentiation. furthermore, the compiler's infrastructure for syntactic, semantic, and static data flow analysis can be built on.
on contracting different behavioral properties in component-based systems. using different specification formalisms together is necessary to leverage better reliability on component-based systems. the confract system provides a contracting system for hierarchical software components, but currently, only executable assertions are supported. in this paper, we describe how to integrate other kinds of formalism in confract. we propose a domain specific language and integration tools that enable designers to describe the observations needed to appropriately verify their specifications.
a uml 2-compatible language and tool for formal modeling real-time system architectures. architrio is a formal language, which complements uml 2.0 concepts with a formal, logic-based notation that allows users to state system-wide properties, both static and dynamic, including real-time constraints. this paper summarizes the architrio approach, and presents the core elements of a tool supporting it, called architrident, which is currently under development. this tool is a plugin of the trio-based editing and verification trident tool suite.
knowledge based approach to semantic composition of teams in an organization. finding rapidly suitable experts in an organization to compose a team able to solve specific tasks is a typical problem in large consulting firms. in this paper we present a description logics approach to the semantic-based composition of ad-hoc teams based on individuals skill profiles and on task description. the selection process is carried out using a novel concept covering algorithm that exploits the recently proposed concept abduction inference service in description logics. the approach has been deployed as part of a skill management system that takes text files with curricula and project specifications as inputs and extracts from them available individual profiles and task descriptions, according to an ontology modeling skills.
editorial message: special track on web and e-business applications. the world wideweb has become the standard computing platform for the development of new-generation information systems. a new tide of web-based e-business applications (such as corporate portals, network-based supply chains and market places, etc.) is driving the need for a more open, flexible and distributed infrastructure, together with appropriate development methodologies and theoretical settings. today's web applications involve skills from many different areas of computer science, including databases, ai and agent based applications, programming languages and algorithms, distributed computing, information retrieval, semantic modeling, etc. for this reason we proposed a track on web and e-business applications based on the following main topics: data models for the world wide web, web data management, languages for the world wide web and xml, e- business and web services, transactions on the world wide web, security and integrity issues for the www, query systems for the world wide web, management and storage of web information, information retrieval and search engines for the web, web semantics, data integration over the world wide web, data-intensive applications on the world wide web, web architectures.we received 30 submissions, which were extensively reviewed for originality, significance, technical soundness and clarity of presentation. the submitted papers covered most of the proposed topics. the number of submissions distributed on each continent has been the following: 16 from europe (53%), 9 from north america (30%), 3 from asia (10%), 1 from africa (3%) and 1 from australia (3%). 12 papers corresponding to the 40% of the submitted papers have been selected for presentation at the conference, with the following distribution: 7 from europe, 3 from america, 1 from asia and 1 from australia.
angular measures for feature selection in text categorization. text categorization, which consists of automatically assigning documents to a set of categories, usually involves the management of a huge number of features. most of them are irrelevant or introduce noise which misleads the classifiers. thus, feature reduction is often performed in order to increase the efficiency and effectiveness of the classification. in this paper we propose to select relevant features by means of what we call angular measures, which are simpler than other usual measures applied for this purpose. we carry out experiments over two different corpora and find that the proposed measures perform equal or better than some of the existing ones.
conceptual modeling of xml data. in this paper, we propose a conceptual model for building schemata for xml documents. in particular, we define the conceptual model uxs (uml & xml schema), which is based on uml and provides several graphical constructs to help the programmer to define complex xml schemata. the model is completed by the support of several translation approaches for building the xml schema code, corresponding to the defined conceptual schema. a prototype has been developed, and allows the conceptual definition of xml schemata by using the introduced approach.