waashk/dblp huggingface dataset:
design pattern implementation in object teams. implementing the 23 gang-of-four design patterns in the aspect-oriented programming language object teams/java (ot/j) yields modularity and reusability results roughly comparable to those obtained in a similar study of aspectj, though not in the same exact set of patterns. due to differences in composition mechanisms, the two languages seem complementary rather than overlapping. aspectj is clearly superior to ot/j in terms of quantification capability while ot/j is clearly superior to aspectj as regards extensibility of pattern modules.
the 'dresden image database' for benchmarking digital image forensics. this paper introduces and documents a novel image database specifically built for the purpose of development and bench-marking of camera-based digital forensic techniques. more than 14,000 images of various indoor and outdoor scenes have been acquired under controlled and thus widely comparable conditions from altogether 73 digital cameras. the cameras were drawn from only 25 different models to ensure that device-specific and model-specific characteristics can be disentangled and studied separately, as validated with results in this paper. in addition, auxiliary images for the estimation of device-specific sensor noise pattern were collected for each camera. another subset of images to study model-specific jpeg compression algorithms has been compiled for each model. the 'dresden image database' will be made freely available for scientific purposes when this accompanying paper is presented. the database is intended to become a useful resource for researchers and forensic investigators. using a standard database as a benchmark not only makes results more comparable and reproducible, but it is also more economical and avoids potential copyright and privacy issues that go along with self-sampled benchmark sets from public photo communities on the internet.
coverage-hole trap model in target tracking using distributed relay-robot network. target tracking is an important issue in wireless sensor network applications. in this paper, we design a coverage-hole trap model (ctm) based on a system that contains one moving target, one moving pursuer and a distributed relay robot network with sensing coverage holes. usually, the coverage hole is harmful for target tracking in wireless mobile robot network (wmrn). many algorithms have been proposed to detect and avoid coverage holes. in this paper, we try to use coverage holes as traps to point out the region where the target is moving into, and help the pursuer to catch the target. after the coverage holes are discovered by multiple relay robots in the initialization phase, the pursuer calculates the target position and predicts where it should move to. we propose distributed coverage-hole detection algorithm (dcda), which is based on 3mesh method to discover coverage holes and tackle this challenge by introducing the coverage-hole based pursuer algorithm (cbpa). cbpa is a prediction-based algorithm for the pursuer using the information about the target and coverage holes obtained from the relays. simulation results show that our methods address the limitation of the previous work, considerably improve the required tracking time and reduce the average total traveling distance of target.
early identification of crosscutting concerns in the domain model guided by states. by nature, software applications involve a myriad of different concerns, which many times crosscut each other. the problem of crosscutting concerns may be solved by aspect oriented techniques which allow to separate core functionality from aspects. this separation must be done as soon as possible during software construction in order to minimize reworking of the software artifacts. our work identifies aspects very early in the software development process. this paper presents an approach for using the problem domain language captured by the language extended lexicon to identify crosscutting concerns during the domain analysis stage.
web-based image matting. we present ntust image matting (nim), an interactive and web-based tool for image matting. it is the first image matting tool accessible through a web browser. nim can extract a foreground with thin, thread-like shapes. it begins to process inputs immediately after the user has started to paint with a brush roughly along the boundary between the foreground and the background. the user can stop anywhere while painting, and change the width of brush as needed. this helps achieve good matting quality. the quality of the foreground extracted by nim is generally better or not worse than those done by the other two online tools and photoshop. the amount of time required to complete matting by nim is reasonable.
a stochastic approach to candidate disease gene subnetwork extraction. experimental methods are beginning to define the networks of interacting genes and proteins that control most biological processes. there is significant interest in developing computational approaches to identify subnetworks that control specific processes or that may be involved in specific human diseases. because genes associated with a particular disease (i.e., disease genes) are likely to be well connected within the interaction network, the challenge is to identify the most well-connected subnetworks from a large number of possible subnetworks. one way to do this is to search through chromosomal loci, each of which has many candidate disease genes, to find a subset of genes well connected in the interaction network. in order to identify a significantly connected subnetwork, however, an efficient method of selecting candidate genes from each locus needs to be addressed. in the current study, we describe a method to extract important candidate subnetworks from a set of loci, each containing numerous genes. the method is scalable with the size of the interaction networks. we have conducted simulations with our method and observed promising performance.
peer-to-peer collaboration in the lively kernel. with the increasing popularity of the world wide web, end-user applications are moving from the desktop to the browser. more and more applications that we have come to know as desktop applications are now making their way into the web. this has made online collaboration a key aspect for many applications. collaborative applications like facebook, flickr and google docs are just an early hint of how we can benefit from users being able to share data. still, collaborative features are not easy to implement in web applications. most web programming environments aim at easy user interface creation and persistence, but not for online collaboration and pushing data from one user to another. the lively kernel is a highly dynamic web programming platform and runtime environment developed at sun microsystems laboratories. by utilizing the lively kernel platform, it is easy to implement desktop like applications for the web using javascript. in this paper we summarize the experiences from adding peer-to-peer collaboration into the lively kernel. these additions include persistent data storage, communication channels between users and user identification.
seal object detection in document images using ght of local component shapes. due to noise, overlapped text/signature and multi-oriented nature, seal (stamp) object detection involves a difficult challenge. this paper deals with automatic detection of seal from documents with cluttered background. here, a seal object is characterized by scale and rotation invariant spatial feature descriptors (distance and angular position) computed from recognition result of individual connected components (characters). recognition of multi-scale and multi-oriented component is done using support vector machine classifier. generalized hough transform (ght) is used to detect the seal and a voting is casted for finding possible location of the seal object in a document based on these spatial feature descriptor of components pairs. the peak of votes in ght accumulator validates the hypothesis to locate the seal object in a document. experimental results show that, the method is efficient to locate seal instance of arbitrary shape and orientation in documents.
transparency versus security: early analysis of antagonistic requirements. information systems designers have been increasingly convinced about the importance of dealing with quality issues at early stages of development. over the landscape of quality issues, several proposals have been published as to help with respect to security. on the other hand, designers do also need to care about other quality issues; for instance, transparency. transparency is the quality of having open information to the public. at first, the general intuition is that security and transparency conflict, but how should designers deal with these antagonistic issues? departing from the use of the non-functional requirements framework we propose a process, based on personal construct theory, to perform early analysis of antagonistic design issues. having early analysis of antagonistic quality issues makes it possible for informed decision to be taken early on during is design. we use the election domain to illustrate the application of our proposal.
novel immune-based framework for securing ad hoc networks. one of the main security issues in mobile ad hoc networks (manets) is a malicious node that can falsify a route advertisement, overwhelm traffic without forwarding it, help to forward corrupted data and inject false or uncompleted information, and many other security problems. mapping immune system mechanisms to networking security is the main objective of this paper which may significantly contribute in securing manets. in a step for providing secured and reliable broadband services, formal specification logic along with a novel immuneinspired security framework (i2manets) are introduced. the different immune components are synchronized with the framework through an agent that has the ability to replicate, monitor, detect, classify, and block/isolate the corrupted packets and/or nodes in a federated domain. the framework functions as the human immune system in first response, second response, adaptability, distributability, and survivability and other immune features and properties. interoperability with different routing protocols is considered. the framework has been implemented in a real environment. desired and achieved results are presented.
a dewarping algorithm to compensate volume binding distortion in scanned documents. this paper presents a new algorithm for dewarping the volume binding distortion often found whenever one scans a book. the existing algorithms in the literature need scanner parameters, seldom known by the end user. the algorithm proposed here only needs the user to print a calibration grid and to scan it in the central page of a volume. the algorithm collects all the data needed to dewarp all pages in the volume.
can domain-specific languages be implemented by service-oriented architecture? although there have been many benefits of domain-specific languages (dsls) reported from both academia and industry, the need to evolve a dsl definition in the presence of limited tool support results in several challenges that increase dsl development cost and constrain dsl adoption opportunities. as a new approach to address such limitations, this paper introduces a service-oriented architecture (soa) technique to implement an existing imperative dsl. the approach utilizes wsdl to perform lexical analysis and assist with syntax analysis. the paper also explores how ws-bpel can be used to define a dsl grammar. web services have potential to define the semantics of a dsl. the advantages that soa offers in dsl implementation are realized through soa's characteristics of interoperability, loose coupling, and technology-neutral implementation.
captcha smuggling: hijacking web browsing sessions to create captcha farms. captchas protect online resources and services from automated access. from an attacker's point of view, they are typically perceived as an annoyance that prevents the mass creation of accounts or the automated posting of messages. hence, miscreants strive to effectively bypass these protection mechanisms, using techniques such as optical character recognition or machine learning. however, as captcha systems evolve, they become more resilient against automated analysis approaches. in this paper, we introduce and evaluate an attack that we denote as captcha smuggling. to perform captcha smuggling, the attacker slips captcha challenges into the web browsing sessions of unsuspecting victims, misusing their ability to solve these challenges. a key point of our attack is that the captchas are surreptitiously injected into interactions with benign web applications (such as web mail or social networking sites). as a result, they are perceived as a normal part of the application and raise no suspicion. our evaluation, based on realistic user experiments, shows that captcha smuggling attacks are feasible in practice.
evaluating trust in grid certificates. digital certificates are used to secure international computation and data storage grids used for e-science projects, like the worldwide large hadron collider computing grid. the international grid trust federation has defined the grid certificate profile: a set of guidelines for digital certificates used for grid authentication. we have designed and implemented a program and related test suites for checking x.509 certificates against the certificate profiles and policies relevant for use on the grid. the result is a practical tool that assists implementers and users of public key infrastructures to reach appropriate trust decisions.
rttm: real-time transactional memory. hardware transactional memory is a promising synchronization technology for chip-multiprocessors. it simplifies programming of concurrent applications and allows for higher concurrency than lock based synchronization. standard transactional memory is optimized for average case throughput, but for real-time systems we are interested in worst-case execution times. we propose real-time transactional memory (rttm) as a time-predictable synchronization solution for chip-multiprocessors in real-time systems. we define the hardware for time-predictable transactions and provide a bound for the maximum transaction retries. the proposed rttm is evaluated with a simulation of a java chip-multiprocessor.
embedded contract languages. specifying application interfaces (apis) with information that goes beyond method argument and return types is a long-standing quest of programming language researchers and practitioners. the number of type system extensions or specification languages is a testament to that. unfortunately, the number of such systems is also roughly equal to the number of tools that consume them. in other words, every tool comes with its own specification language. in this paper we argue that for modern object-oriented languages, using an embedding of contracts as code is a better approach. we exemplify our embedding of code contracts on the microsoft managed execution platform (.net) using the c# programming language. the embedding works as well in visual basic. we discuss the numerous advantages of our approach and the technical challenges, as well as the status of tools that consume the embedded contracts.
a method for validating the compliance of business processes to business rules. regulatory compliance of business operations and practices is increasingly becoming an area of great concern for management, costing tens of billions of dollars in compliance actions a year. this paper presents a method for validating business processes with respect to the business rules. in the proposed method, business processes are modeled with uml activity diagrams, whilst business rules are represented as ocl expressions attached to process activities and the business conceptual model. the model validation is based on the simulation of the execution of process instances based on specific scenarios. the simulation algorithm steps through the process model executing the actions associated to the activities with the help of the use tool and checking for violations of the associated business rules. the proposed method allows the modeler to have an early feedback of possible defects that may exist in a business process model.
introducing global scaling parameters into ncut. gaussian similarity is usually used in spectral clustering. it generates the affinity matrix by mainly considering point-to-point distances in a local region with respect to the scaling parameters &delta;. as a result, global information is not considered. to address this problem, we design a mapping and rescaling framework (referred as m-r framework) to introduce global scaling parameters into spectral clustering. the m-r framework is applied on normalized cut to form the m-r ncut algorithm which obtains remarkable performance improvements in our experimental evaluations.
general constant expressions for system programming languages. most mainstream system programming languages provide support for builtin types, and extension mechanisms through userdefined types. they also come with a notion of constant expressions whereby some expressions (such as array bounds) can be evaluated at compile time. however, they require constant expressions to be written in an impoverished language with minimal support from the type system; this is tedious and error-prone. this paper presents a framework for generalizing the notion of constant expressions in modern system programming languages. it extends compile time evaluation to functions and variables of user-defined types, thereby including formerly ad hoc notions of read only memory (rom) objects into a general and type safe framework. it allows a programmer to specify that an operation must be evaluated at compile time. furthermore, it provides more direct support for key meta programming and generative programming techniques. the framework is formalized as an extension of underlying type system with a binding time analysis. it was designed to meet real-world requirements. in particular, key design decisions relate to balancing expressive power to implementability in industrial compilers and teachability. it has been implemented for c++ in the gnu compiler collection, and is part of the next iso c++ standard.
e-mail authorship verification for forensic investigation. the internet provides a convenient platform for cyber criminals to anonymously conduct their illegitimate activities, such as phishing and spamming. as a result, in recent years, authorship analysis of anonymous e-mails has received some attention in the cyber forensic and data mining communities. in this paper, we study the problem of authorship verification: given a set of e-mails written by a suspect along with an e-mail dataset collected from the sample population, we want to determine whether or not an anonymous e-mail is written by the suspect. to address the problem of authorship verification of textual documents and employ detection measures that are more suited in the context of forensic investigation, we borrow the nist's speaker recognition evaluation (sre) framework. our experimental results on real world e-mail dataset suggest that the employed framework addresses the e-mail authorship verification problem with a matching success as in case of speaker verification. the proposed framework produces an average equal error rate of 15--20% and mindcf equal to 0.0671 (with 10-fold cross validation technique) in correctly verifying the author of a malicious e-mail.
dynamic set-up of monitoring infrastructures for service based systems. service based systems are intrinsically dynamic as the services deployed by them can be replaced at runtime. when this happens, the service level agreements (slas) that regulate the provision of services may also need to change. following such changes, the monitoring infrastructure that is used to monitor slas may also need to be modified to ensure the continuous provision of the necessary runtime checks. this paper presents a framework that supports the dynamic assessment of the monitorability of slas terms and the dynamic setup of an appropriate infrastructure for monitoring them following such changes. the monitorability checks are based on comparisons between the sla terms for specific services and descriptions of the monitoring capabilities of these services which are expressed in languages introduced in the paper. the paper presents a prototype implementation of the framework and the results of a preliminary evaluation of it.
modeling cardinal directions in the 3d space with the objects interaction cube matrix. in gis and spatial databases, cardinal directions are frequently used as selection and join criteria in query languages. however, most cardinal direction models are only able to handle two-dimensional spatial objects. but, e.g., geoscientists and engineers in fields like geography, cartography, soil engineering, and landscape modeling have shown an increasing demand for modeling cardinal directions between objects in the three-dimensional space. unfortunately, the few available 3d cardinal direction models suffer from several problems like the coarse approximation of the two operand 3d objects in terms of single points and minimum bounding boxes, the lacking property of converseness of the cardinal direction relations computed, and the incomplete coverage of all possible direction relations. all problems mentioned can lead to incorrect results. this paper proposes a new model that solves these problems and in a first stage introduces an objects interaction cube and, as its representation, an objects interaction cube matrix to capture all possible interactions between any two 3d spatial objects. in a second stage, an interpretation technique is applied to the objects interaction cube matrix to determine the cardinal directions.
simulated annealing based algorithm for smooth robot path planning with different kinematic constraints. in this paper, we present a simulated annealing (sa) based algorithm for robot path planning. the kernel of our sa engine is based on voronoi diagram and composite bezier curve to obtain the shortest smooth path under given kinematic constraints. in our algorithm, a voronoi diagram is constructed according to the global environment. the piecewise linear path in the voronoi diagram which keeps away from the obstacles is obtained by performing dijkstra's shortest path algorithm. the control points on the reference path are used to create the control variables for our sa engine. our sa engine then updates the control variables to obtain the shortest composite bezier curve path while satisfying given kinematic constraints. experimental results on two maps containing sharp turns demonstrate the effectiveness of the proposed sa-based smooth path planning algorithm.
probabilistic developmental program evolution. a probabilistic model building genetic programming technique for automatic program synthesis is introduced. the approach, called probabilistic developmental program evolution (pdpe), draws on the probabilistic incremental program evolution (pipe) learning algorithm, but employs the developmental genetic programming representations of gene expression programming (gep). pdpe induces a population of programs, encoded as fixed-length gep chromosomes, by iteratively refining and randomly sampling a probability distribution of program instructions stored in a vector called probability prototype chromosome (ppc). this refining, however, is accomplished solely by means of mutation of the ppc. we compared pdpe with pipe and gep on a function regression problem and the 6-bit parity problem. our results show that pdpe outperforms pipe in terms of solution quality and variance. it also outperforms gep in terms of solution quality, but not in terms of variance.