waashk/dblp huggingface dataset:
shader space navigator: a turbo for an intuitive and effective shading process. in this paper, we first point out difficulties faced by cg artists in the shading process: (1) a lot of technical details on shaders required, (2) long rendering time, and (3) repeated cumbersome trial-and-errors. to make them overcome such difficulties, we propose shader space navigator, a system that efficiently searches for shaders similar to a given query shader. with shader space navigator, cg artists find quality shaders from the database that are very close to the final result shader, and thus complete the shading process easily by slightly tuning some attributes of those shaders. as a result, the cg artists can create their final shaders in an intuitive and efficient way thereby avoiding a large number of time-consuming rendering processes.
aspect-oriented procedural content engineering for game design. generally progressive procedural content in the context of 3d scene rendering is expressed as recursive functions where a finer level of detail gets computed on demand. typical examples of content procedurally generated are fractal images and noise textures. unfortunately, not always the content can be expressed in this way, developers and content creators need the data to have some peculiarity (like windows on a wall for a house 3d model) and a method to drive data simplification without losing relevant details. in this paper we discuss how aspect oriented (ao) techniques can be used to drive the content creation process by mapping each data peculiarity to the code to generate it. using aspects will let us to partially evaluate the code of the procedure improving the performance without losing the flow of the generation logic. we will also discuss how the use of ao can provide techniques to build simplified version of the data through code transformations.
a role-based enterprise architecture framework. organizations deal with contrasting domains such as people, strategy, business processes, and information systems as well as with their representation, alignment and governance. in this setting, different approaches to enterprise architecture have been introduced to address these concerns. this paper focuses on describing an enterprise architecture framework centered in three core concepts (role, entity and activity) from which domain-specific concepts are derived from. the framework abstracts the organization's domains as five architectural views (organization, business, information, application and technology) and captures the concept dependencies and relationships across the different domains.
failure management development for integrated automotive safety-critical software systems. nowadays the number of vehicles equipped with electronic components is increasing rapidly by replacing mechanical and hydraulic systems. the most advanced cars function appropriately via more than 50 electronic control units (ecus), sensors and actuators that exchange more than 2500 electronic signals among them. the electronic components are interconnected with automotive bus systems. there are several bus systems that have been developed or improved in automotive bus systems to meet the different requirements for automotive applications: local interconnection network (lin), controller area network (can), flexray and media oriented system transport (most). however, there are demands to combine these different bus systems to increase the efficiency and safety of the vehicle systems. failure management is a most challenging problem in car industry since the integrated automotive system needs to communicate with software/hardware components on the different bus systems in a car. the discussion on how to interconnect those automotive bus systems in a safety-critical way is addressed in the paper, where failure management should be applied.
measuring coherence between electronic and manual annotations in biological databases. the use of controlled structured vocabularies for annotation purposes, such as the gene ontology (go) is currently one of the strategies to cope with the increasingly cumbersome task of genome annotation. the gene ontology annotation database (goa) uses go to annotate gene products through curated literature analysis and uncurated electronic methods. although electronic annotations constitute the large majority of annotations (over 95%), most researchers are reluctant to use them in their studies, since they are regarded as having a lower quality than curated ones. assessing the quality of electronic annotations may help clarify the advantages and disadvantages of their use. this paper proposes a preliminary measure of electronic annotation quality based on the coherence between electronic and manual annotations. coherence is analysed both at the gene product and at the annotation level, based on semantic similarity of gene ontology terms. we have found that average annotation coherence values are around 60%, but can be as high as 81% for a less granular analysis. based on this analysis we propose meaningful coherence thresholds for electronic annotation selection and filtering, and for highlighting gene products for annotation revision.
semanticqa: web-based ontology-driven question answering. the ability to ask specific question to the internet using natural language and receiving answers instead of documents is highly desired. recent advancements in semantic web technologies make it possible to support such capability with more accuracy compared to existing non-semantic techniques. using our expertise in ontology building and semantic search and discovery we designed an ontology-driven question answering system that extracts answers from web documents. this system processes natural language queries using a background ontology and finds possible answer(s) to the question from web documents.
medical volume segmentation using bank of gabor filters. in this paper, we will present an unsupervised approach for segmenting medical volume images based on texture properties. the texture properties of the volume data are defined based on spatial frequencies as implemented using a statistical method known as gabor filters. each gabor filter in the bank is tuned to detect patterns of a specific frequency and orientation when convolved with a medical volume. the convolution is performed in the fourier domain and the resulting response image is a feature which is added to our feature vector. the feature vector is thus passed into a classification/segmentation algorithm.
partitioning web applications between the server and the client. web 2.0 and rich internet application technologies are offering more and more sophisticated means for building compelling applications. at the same time the development of applications is becoming increasingly complex. while web applications are commonly relying on server-side processing, we aim at implementing a "fat client" and running applications mostly on the client. with this in mind we can derive a set of guidelines on how the applications should be partitioned between the server and the client. by following these directives and leaning on the traditional principles of good software development, we can address the issues of complexity that have lately emerged in web development.
learners automated evaluation with the odala approach. we present in this paper odala approach (ontology-driven auto-evaluation for e-learning approach) for an automated evaluation of the learners state of knowledge. the context considered is computer based human learning environnement (cbhle) in a self-learning by doing mode. this approach, that we put in work and test in the setting of a self-learning system for an algorithmic language, is founded on the representation of the teaching domain as domain ontology on the one hand and on errors classification and detection on the other hand. the evaluation process that we recommend is structured in four stages, starting from the learner solution form analysis (that consists at this step of our research to a lexico-syntactic analysis) and finish with the update of the learner model, while passing by a semantic analysis and a marking process. after a brief introduction of the main aspects raising of the cbhle domain to which we refer here, we develop our approach of the learners evaluation problem, while especially insisting on its independence of the teaching domain and on the possibility to take in account answers to open questions, freely built by the learner. we also present, at the end, the results of the algorithmic self-learning system development, where the main stages of our evaluation approach are implemented.
searching for relevant software change artifacts using semantic networks. the discovery of software artifacts (files, documents, and datasets) relevant to a change request, can increase software reuse and reduce the cost of software development and maintenance. however, traditional search techniques often fail to provide the relevant documents because they do not consider relationships between software artifacts. we propose the creation of semantic networks which convey such relationships and assist in automatically discovering not only the requested artifacts based on a user query, but additional relevant ones that the user may not be aware of. subsequently, we increase the accuracy of the returned artifacts by applying appropriate contexts. experimental results show that this approach leads to better recall and precision compared to existing full-text search approaches.
kenro: a virtual machine monitor mostly described in haskell. we report on our experiences developing a tiny virtual machine monitor, named kenro, mostly in haskell as a concrete example of low-level, hardware-dependent system software. the development of kenro was greatly helped by features of haskell, including higher-order functions, strong static typing, and the automatic memory management. we describe the advantages and limitations of haskell studied through our development experience.
a new inter-layer prediction scheme for spatial scalability with different frame rates. to provide spatial, temporal and quality scalabilities, the scalable video coding (svc) offers several additional techniques. the inter-layer prediction is one of them to improve the coding efficiency. however, it is only applied to the enhancement layer when the base layer is available. because of this limited inter-layer prediction, it deteriorates the coding efficiency of enhancement layer. in this paper, we propose a new inter-layer prediction scheme for spatial scalability with different frame rates. it improves the coding efficiency using the information of the interpolation layer when the base layer is not available. the experimental results show that the proposed scheme reduces the bitrates by 2~10% and improves video quality by 0.01~0.4db compared with the reference software, jsvm 11.0.
towards a fast enterprise ontology based method for post merger integration. our research program aims at finding and testing method components for deciding on and implementing organizational splits and mergers. we tested a method to timely detect design & migration issues of a post merger integration. using actors from enterprise ontology as organization building blocks for two large operationally merging airliners, experts systematically listed per actor (a) its organizational implementations, (b) its quality of business and (c) its it implementations. the drafted demo construction model appeared to be the first neutral and shared language for describing the essence of the business. also the results needed for decision making (a) were experienced as a necessary and sufficient validation of operational integrity and (b) were delivered fast, yielding a high return on modeling effort.
certification of smart-card applications in common criteria. this paper describes the certification of smart-card applications in the framework of common criteria. in this framework, a smart-card application is represented by a model of its specification, a functional specification describing an input-output relationship, a low-level design, and implementation code. the certification process consists of the following tasks: (1) prove that the model, the functional specification, the low-level design, and the code satisfy security properties in the smart-card application's specification, and (2) prove that there is a representation correspondence between each two consecutive representations. for each task, a certificate or a collection of certificates are needed to certify the accomplishment of the task. all representations of a smart-card application are essentially programs and the representation correspondences are properties relating two programs. we show that a theory of program properties can be applied to the certification process. the theory provides foundations for describing and proving properties of a single program and properties relating two programs. the theory provides a notion of certificate that is essential to the certification process.
matching to subtyping. the notion of thistype has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. it is well-known, however, that thistype does not match with subtyping well. in the current type systems, type safety is guaranteed by the sacrifice of subtyping, hence dynamic dispatch. in this paper, we propose two mechanisms, namely, nonheritable methods and local exactization to remedy the mismatch between thistype and subtyping. we rigorously prove their safety by modeling them in a small calculus.
a spatial bitmap-based index for geographical data warehouses. in this paper we propose the spatial bitmap index (sb-index), which is an index based on bitmap and minimum bounding rectangle (mbr) to provide efficient query processing in geographical data warehouses. the sb-index is built on the primary key of a spatial dimension table, and maintains the mbr of a given spatial attribute. query processing requires a scan on the index, which compares both the query spatial predicate and the current mbr. this scan supplies a set of candidate solutions to a refinement step that evaluates each candidate. finally, only the index entries from objects that satisfy the spatial predicate must be accessed, in order to answer the submitted query. comparisons between the sb-index and the star-join indexed with r-tree and gist showed significantly improvement of 25% up to 95% with regards to the query processing time. this performance gain occurs since sb-index restricts a set of candidates and avoids the star-join calculation.
self-organized control of knowledge generation in pervasive computing systems. pervasive computing devices (e.g., sensor networks, localization devices, cameras, etc.) are increasingly present in every aspect of our lives. these devices are able to generate enormous amounts of data, from which knowledge about situations and facts occurring in the world can be inferred; inference can also be done by combining data items and generating new (higher-level) ones. such data and knowledge is of extreme importance for to context-aware and mobile services. however, we are left with the problem that the possibly huge amount of data and knowledge generated can be very hard to be analyzed and made usable in real-time. the core of the problem in today's pervasive environments lies between the ability to extract meaningful (useful) knowledge from the data while making sure the total amount of data does not become overwhelming to the system. this paper focus on this trade-off using (without loss of generality) the w4 model for contextual data as a case study. starting from the basic mechanism by which the w4 model autonomously generate new knowledge, the paper shows how this can generate knowledge overflow, and propose a method to select---in a self-organizing way---what kinds of knowledge should be generated based on their importance; hence preventing knowledge overflow. experimental results are reported to support our arguments and proposals.
reconstructing strip-shredded documents using color as feature matching. this paper discusses the destroyed documents that have been strip-shredded, which is a often problem in forensic science. the proposed method first extracts features based on color of the boundaries and then computes the nearest neighbor algorithm to carry out the local reconstruction. in this way the overall complexity can be dramatically reduced because few features are used to perform the matching. the preliminary results reported in this paper, which take into account a two hundred documents database, demonstrate that color-matching-based method produces interesting results for the problem of document reconstruction and can be of interest to the forensic document examiners and provide some effective solutions for law enforcement practitioners.
alternatives to conjunctive query processing in peer-to-peer file-sharing systems. peer-to-peer file-sharing systems suffer from the over-specification of query results due to the fact that query processing is conjunctive and the descriptions of shared files are sparse. ultimately, longer queries, which should yield more accurate results, do the opposite. to alleviate this problem, we consider alternative means of query processing. that is, results are sent from the server to the client only if they are deemed relevant based on cosine similarity. based on our results, these alternatives can increase query accuracy by 40% at virtually no cost.
simulation supporting the design of self-organizing ambient intelligent systems. the ambient intelligence scenario depicts electronic environments that are sensitive and responsive to the presence of people. the aim of this kind of system is not necessarily to provide some form of electronic service to its users, but also to enhance the everyday experience of people moving inside the related physical environment. for this type of application, computer simulation represents a useful way to envision the behaviour of responsive environments without actually bringing them into existence in the real world. this paper will describe the simulation of an adaptive illumination facility, a physical environment endowed with a set of sensors that perceive the presence of humans (or other entities such as dogs, bicycles, cars) and interact with a set of actuators (lights) that coordinate their state to adapt the ambient illumination to the presence and behaviours of its users.
two lower bounds for self-assemblies at temperature 1. self-assembly is an autonomous process by which small simple parts assemble into larger and more complex objects. self-assembly occurs in nature, for example, when atoms combine to form molecules, and molecules combine to form crystals. it has been suggested that intricate self-assembly schemes will ultimately be useful for circuit fabrication, nanorobotics, dna computing, and amorphous computing [2, 7]. to study the process of self-assembly we use the tile assembly model proposed by rothemund and winfree [5]. this model considers the assembly of square blocks called "tiles" and a set of glues called "binding domains". each binding domain has a strength. each of the four sides of a tile can have a glue on it that determines interactions with neighbouring tiles. the two neighbouring tiles form a bond if the binding domains on the touching sides are the same. the strength of this bond is the strength of the matching binding domain. the process of self-assembly is initiated by a single seed tile and proceeds by attaching tiles one by one. a tile can only attach to the growing complex if it binds strongly enough, i.e., if the sum of the strengths of its bonds to the existing complex is at least the temperature &tau;. it is assumed that there is an infinite supply of tiles of each tile type. when this growing process stops, i.e., no tile can be attached to the existing complex, we say that the tile system has assembled this shape. a tile system is specified by the seed tile, the set of tile types, the strengths of glues and the temperature. the physical plausibility and relevance of this abstraction was demonstrated by simple self-assembling systems of tiles built out of certain types of dna molecules [3, 4]. in this paper we only consider self-assembly at temperature &tau; = 1. self-assemblies at temperature &tau; > 1 have been considered in [5, 6, 1]. a measure of complexity of self-assembly is the minimum number of distinct tile types needed to uniquely assemble a certain shape (assembles the shape but does not assemble any other shape). if we want to assemble any scaled version of a given shape, then the complexity depends on the expressibility (kolmogorov complexity) of the shape [6]. if we want to assemble a given shape with a prescribed size, then in [5] it was observed that assembling an n x n full square (a square where there is a bond between any two adjacent tiles) at &tau; = 1 requires n2 distinct tile types. in fact, one can see that any uniquely produced 2-connected full assembly with p tiles requires p tile types (all tiles must be distinct). if we do not require a bond between every two adjacent tiles of a uniquely produced assembly the number of used tile types can be significantly smaller. in particular, in [5] a tile system that uniquely assembles an n x n square using only 2n - 1 tile types was described. the construction is based on a comb-like backbone graph of the n x n square. moreover, it was conjectured in [5] that this is best possible.
lightweight monitoring of sensor software. wireless sensors are very small computers, and understanding the timing and behavior of software written for them is crucial to ensuring that they perform correctly. this paper outlines a lightweight method for gathering behavioral and timing information from simulated executions of software written in the nesc/tinyos environment. the resulting data is used to generate both behavioral and timing profiles of the software, using uml sequence diagrams to visualize the behavior and to present the timing information.
visualization of information flows in a very large social network. in this paper, we present our research result that enables users to navigate a very large social network and to take a look at information flows on the network. to this end, we devise two techniques; (i) mapping a very large social network to a 2-dimensional graph layout, and (ii) exploring the graph to all directions with zooming it in/out. with these methods, we can also look through information flows over social networks.
an approach to detection of uml-based ownership violation. in this paper, we study how to detect the ownership violation based on the unified modeling language (uml 2.0) in ibm eclipse modeling framework. we develop a novel technique for automatically detecting the ownership violation in a program against its design class diagram using a software model checker. specifically, given the fields that are intended to implement ownership in a uml class diagram, our approach checks the ownership property in two steps. first, the approach systematically generates all valid object diagrams, i.e. valid input program states. then, after a method to destroy the owner object is called on each object diagram, the approach checks whether all external links to the owned objects have been removed. central to this approach is how to prune away the large search space that includes all valid input program states.