ppxscal/embedding_network huggingface dataset:
Formal verification of tamper-evident storage for e-voting
Authors: Dominique Cansell, J. Paul Gibson, Dominique Mery
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

The storage of votes is a critical component of any voting system. In traditional systems there is a high level of transparency in the mechanisms used to store votes, and thus a reasonable degree of trustworthiness in the security of the votes in storage. This degree of transparency is much more difficult to attain in electronic voting systems, and so the specific mechanisms put in place to ensure the security of stored votes require much stronger verification in order for them to be trusted by the public. There are many desirable properties that one could reasonably expect a vote store to exhibit. From the point of view of security, we argue that tamper-evident storage is one of the most important requirements: the changing, or deletion of already validated and stored votes should be detectable; as should the addition of unauthorised votes after the election is concluded. We propose the application of formal methods (in this paper, event- B) for guaranteeing, through construction, the correctness of a vote store with respect to the requirement for tamperevident storage. We illustrate the utility of our refinementbased approach by verifying through the application of a reusable formal design pattern a store design that uses a specific PROM technology and applies a specific encoding mechanism.
Three-Dimensional Digital Display of Ultrasonograms
Authors: Shohei Nakamura
Venue: IEEE Computer Graphics and Applications (1984)

Computerized projection and display of hundreds of sequential ultrasonic images can yield molded 3-D images of an object's surface that are useful in exact disease diagnosis. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Semantic indexing in structured peer-to-peer networks
Authors: Ronaldo A Ferreira, Mehmet Koyutürk, Suresh Jagannathan, Ananth Grama
Venue: Journal of Parallel and Distributed Computing (2008)

The past few years have seen tremendous advances in distributed storage infrastructure. Unstructured and structured overlay networks have been successfully used in a variety of applications, ranging from file-sharing to scientific data repositories. While unstructured networks benefit from low maintenance overhead, the associated search costs are high. On the other hand, structured networks have higher maintenance overheads, but facilitate bounded time search of installed keywords. When dealing with typical data sets, though, it is infeasible to install every possible search term as a keyword into the structured overlay. State-of-the art semantic indexing techniques have been successfully integrated into peer-to-peer (P2P) systems using semantic overlays. However, exiting approaches are based on the premise that the fundamental ingredient of semantic indexing, a semantic basis for the underlying data, is globally available, which is not likely to be the case in practice. Therefore, development of techniques to efficiently compute basis vectors for data distributed across peers is important for large-scale deployment of semantic indexing in P2P systems. In this paper, we present a novel structured overlay that integrates aspects of semantic indexing using non-orthogonal matrix decompositions, with the hash structure of the overlay. We adopt PROXIMUS, a recursive decomposition method for computing concise representations for binary data sets, to locally identify latent patterns in data distributed across peers. To enable efficient consolidation of patterns, we rely on distributed hash tables (DHT), commonly used in various applications in P2P networks. The discrete nature of non-orthogonal matrix decomposition is well suited to the binary key structure of DHTs, resulting in an indexing method, PMINER, that enables the network to deliver efficient and accurate responses to semantic queries. We present the algorithmic underpinnings of PMINER and demonstrate its excellent performance characteristics on real, as well as synthetic data sets.
A system for summary-document similarity in notary domain
Authors: Carmine Cesarano, Antonino Mazzeo, Antonio Picariello
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper we propose a methodology to perform a comparison between a legal document and its related handwritten summary. We thus describe the algorithms that verify when a human-produced summary is consistent with its source document. We first analyze both documents in order to extract only the relevant information then we compare such information in order to obtain a measure of correlation indicating the consistence between the two documents. Eventually, we briefly report on the performance of these algorithms.
Higher order fuzzy system identification using subtractive clustering
Authors: K. Demirli, P. Muthukumaran
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

This paper proposes a higher order fuzzy system identification method using subtractive clustering, which is an extended application of subtractive clustering. Minimum error models are obtained through enumerative search of clustering parameters. The results of the enumerative study presented in this paper explain the mechanism behind subtractive clustering and introduce a modification in the penalizing process of subtractive clustering. The results of applying the higher order modeling to both linear and non-linear systems are given in this paper. The comparison with the results of other models shows improvement in the modeling performance by subtractive clustering with higher order system identification technique. The higher order identification method resulted in fewer rules compared to lower order models. Results of case studies on systems of different complexities are also presented.
Measuring the Productivity of Computer Systems Development Activities with Function Points
Authors: C. A. Behrens
Venue: IEEE Transactions on Software Engineering (1983)

The function point method of measuring application development productivity developed by Albrecht is reviewed and a productivity improvement measure introduced. The measurement methodology is then applied to 24 development projects. Size, environment, and language effects on productivity are examined. The concept of a productivity index which removes size effects is defined and an analysis of the statistical significance of results is presented.
Air-Pollution Monitoring Network in the Netherlands
Authors: J. J. Wilting, H. van den Berge
Venue: Computer (1971)

Athough the Netherlands is only a small country, it has the world's largest port in terms of annual tonnage. This is Rotterdam, situated in the area where the rivers Rijn and Maas loin, prior to reaching the North Sea. Their estuary forms a complex waterway; the main one being the "New Waterway," shown on the map Figure 1. South of this is a complex of harbours and industrial areas embracing six oil retineries, chemical plants, shipyards, metal works, etc. The residential areas within this complex suffer tfrom the air pollution associated with heavy industry.
Using MDA to Support Hypermedia Document Sharing
Authors: Bruno Lima, Jose G. Jr. de Sousa, Denivaldo Lopes
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

The standards around hypermedia documents wrap all technologies for Digital Television and Web delivery such as transmission, content, software layer and return channel. This paper focuses in the software layer, also know as middleware. Many standard multimedia languages have a similar syntax and semantics to describe hypermedia documents, such as Synchronized Multimedia Integration Language and Nested Context Model. However, each one of these languages can only be interpreted by its specific middleware. This scenario generates an enormous problem because a hypermedia document model designed for a specific standard can not be widely shared. Consequently, a same hypermedia document must be translated in several other standards to be widely shared, increasing the authoring efforts and waste of time. This paper introduces a model driven approach to support the widely sharing of hypermedia documents.
Removing Noise from Medical CR Image Using Multineural Network Filter Based on Noise Intensity Distribution
Authors: Yeqiu Li, Jiangming Lu, Ling Wang, Song Li, Ying Fan, Takashi Yahagi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this paper, a new type of multineural networks filter (MNNF) is presented that is trained for restoration and enhancement of the medical CR images. In medical CR image, noise has been categorized as quantum mottle, which is related to the incident X-ray exposure and artificial noise, which is caused by the grid, etc. MNNF consists of several neural network filters (NNFs). A novel analysis method is proposed to make the characteristics of the trained MNNF clearly. In the proposed method, a characteristics judgement system is presented to decide which NNF will be executed through the estimation of noise intensity calculated by Maximum Penalized Likelihood Estimator (MPLE). The new approach was tested on clinical medical X-ray image, synthesized noisy X-ray image and natural image. In all cases, the proposed MNNF produced better results in terms of Mean Square Error (MSE) measure than MPLE, NNF and conventional wavelet BayesShrink (BS) methods.
Website usage metrics: A re-assessment of session data
Authors: Paul Huntington, David Nicholas, Hamid R. Jamali
Venue: Information Processing and Management: an International Journal (2008)

Metrics derived from user visits or sessions provide a means of evaluating Websites and an important insight into online information seeking behaviour, the most important of them being the duration of sessions and the number of pages viewed in a session, a possible busyness indicator. However, the identification of session (termed often 'sessionization') is fraught with difficulty in that there is no way of determining from a transactional log file that a user has ended their session. No one logs out. Instead a session delimiter has to be applied and this is typically done on the basis of a standard period of inactivity. To date researchers have discussed the issue of a time out delimiter in terms of a single value and if a page view time exceeds the cut-off value the session is deemed to have ended. This approach assumes that page view time is a single distribution and that the cut-off value is one point on that distribution. The authors however argue that page time distribution is composed of a number of quite separate view time distributions because of the marked differences in view times between pages (abstract, contents page, full text). This implies that a number of timeout delimiters should be applied. Employing data from a study of the OhioLINK digital journal library, the authors demonstrate how the setting of a time out delimiter impacts on the estimate of page view time and the number of estimated session. Furthermore, they also show how a number of timeout delimiters might apply and they argue that this gives a better and more robust estimate of the number of sessions, session time and page view time compared to an application of a single timeout delimiter.
AADL modeling and analysis of hierarchical schedulers
Authors: Frank Singhoff, Alain Plantec
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

A system based on a hierarchical scheduler is a system in which the processor is shared between several collaborative schedulers. Such schedulers exist since 1960 and they are becoming more and more investigated and proposed in real-life applications. For example, the ARINC 653 international standard which defines an Ada interface for avionic real time operating systems provides such a kind of collaborative schedulers. This article focuses on the modeling and the performance analysis of hierarchical schedulers. We investigate the modeling of hierarchical schedulers with AADL. Hierarchical scheduler timing and synchronization relationships are expressed with a domain specific language based on timed automata: the Cheddar language. With the meta CASE tool Platypus, we generate Ada packages implementing the Cheddar language. These Ada packages are part of Cheddar, a real time scheduling simulator. With these Ada packages, Cheddar is able to perform analysis by scheduling simulation of AADL systems composed of hierarchical schedulers. An AADL model of the ARINC 653 hierarchical scheduling is described as an illustration.
User-Oriented Materialized View Selection
Authors: Ziyu Lin, Dongqing Yang, Guojie Song, Tengjiao Wang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The problem of materialized view selection has been long researched, and many approaches have been proposed to deal with this issue. However, all the methods proposed to date strive toward improving the overall query perfor- mance, instead of being user-oriented. In this paper, we propose a new user-oriented method, called SOMES (uSer- Oriented Materialized viEw Selection), aiming at achiev- ing better performance for view selection problem. SOMES takes into account query characteristics of different users, in which, users are classified into different groups accord- ing to their query characteristics, and various user groups are provided with their own windows, user view windows containing the views involved in their own query process. Experimental results show that our method can achieve de- sirable performance improvements over other methods such as BPUS and FPUS.
Student defensiveness as a threshold to reflective learning in software design
Authors: Leslie Schwartzman
Venue: Informatics in education (2007)

Reflective practice is considered to play an important role in students' learning as they encounter difficult material. However, students in this situation sometimes do not behave reflectively, but in less productive and more problematic ways. This paper investigates how educators can recognize and analyze students' confusion, and determine whether students are responding reflectively or defensively. Qualitative data for the investigation comes from an upper-level undergraduate software engineering and design course that students invariably find quite challenging. A phenomenological analysis of the data, based on Heidegger's dynamic of rupture, provides useful insight to students' experience. A comparison between that approach and a sampling of classic sources in scholarship on learning, reflectiveness, and defensiveness has implications for teaching and education research in software design - and more generally. In addition, a clearer understanding of the concepts presented in this paper should enable faculty to bring a more sophisticated analysis to student feedback, and lead to a more informed and productive interpretation by both instructor and administration.
Modeling Semantic Aspects for Cross-Media Image Indexing
Authors: Florent Monay, Daniel Gatica-Perez
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

To go beyond the query-by-example paradigm in image retrieval, there is a need for semantic indexing of large image collections for intuitive text-based image search. Different models have been proposed to learn the dependencies between the visual content of an image set and the associated text captions, then allowing for the automatic creation of semantic indices for unannotated images. The task, however, remains unsolved. In this paper, we present three alternatives to learn a Probabilistic Latent Semantic Analysis model (PLSA) for annotated images, and evaluate their respective performance for automatic image indexing. Under the PLSA assumptions, an image is modeled as a mixture of latent aspects that generates both image features and text captions, and we investigate three ways to learn the mixture of aspects. We also propose a more discriminative image representation than the traditional Blob histogram, concatenating quantized local color information and quantized local texture descriptors. The first learning procedure of a PLSA model for annotated images is a standard EM algorithm, which implicitly assumes that the visual and the textual modalities can be treated equivalently. The other two models are based on an asymmetric PLSA learning, allowing to constrain the definition of the latent space on the visual or on the textual modality. We demonstrate that the textual modality is more appropriate to learn a semantically meaningful latent space, which translates into improved annotation performance. A comparison of our learning algorithms with respect to recent methods on a standard dataset is presented, and a detailed evaluation of the performance shows the validity of our framework.
Variants of Memetic And Hybrid Learning of Perceptron Networks
Authors: Roman Neruda, Stanislav Slusny
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Hybrid models combining neural networks and genetic algorithms have been studied recently in order to achieve better performance and/or faster training. In this paper we deal with variants of memetic genetic learning applied for the structure optimization and weights evolution of multilayer perceptron networks. The memetic approach combines genotype and phenotype evolution together with local search represented here by gradient based optimization. It is shown, that combining memetic algorithms with neural networks can lead to better results than relying on neural networks alone in terms of the quality of the solution (both training and generalization error).
Novel set-theoretic definitions of common fuzzy hedges, theory and application
Authors: Hongjian Shi, Nawwaf Kharma, Rabab Ward
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

The subject of this paper is fuzzy linguistic hedging, used to modify membership functions. Our investigation will exceed the traditional definition given by Zadeh (and others), upon which our research is based. We will present new and more general definitions for four of the most commonly used hedges. These hedges are very, more or less, positively and negatively. The effect of applying each hedge to a membership function will be described both qualitatively and quantitatively in this paper. We will also describe conditions under which a specific hedge is valid, chart the examples, and explore the properties of the hedge operations. A software program called FuzzyMarkx has been developed for understanding and applying the above four hedges to list of data. It is specially designed for altering school grade distributions. It allows users to view the new grades, the grade distribution as well as the graphical representation of the hedge being applied.
Fabrication of stamps for microcontact printing by injection molding
Authors: Amol Chandekar, Michael Alabran, Sandip K. Sengupta, Jun S. Lee, Joey L. Mead, Carol M. F. Barry, James E. Whitten, Sivasubramanian Somu, Ahmed A. Busnaina
Venue: Microelectronic Engineering (2008)

Microcontact printing has been shown to be a viable lithographic technique for the fabrication of a variety of microelectronic components, including source/drain and gate electrodes for organic field effect transistors. Future manufacturing efforts may require a means of mass producing stamps for this process. In the present work, stamps for microcontact printing were rapidly produced by injection molding a commercial polyurethane resin, using a silicon master as the mold insert. The performance of these stamps was evaluated by microcontact printing gold coated silicon surfaces with a fluorinated alkanethiol. Etching of the stamped surface protected by the patterned alkanethiol revealed excellent replication of the submicron linear features of the micromold. The use of injection molding as a standard method for the production of stamps for microcontact printing is proposed and may have advantages for future nanotechnology applications that require mass production of stamps. Because a wide range of polymers may be injection molded, this method may make possible the fabrication of stamps with improved mechanical and chemical properties compared to polydimethylsiloxane based stamps.
An adaptive finite element semi-Lagrangian implicit--explicit Runge--Kutta--Chebyshev method for convection dominated reaction--diffusion problems
Authors: R. Bermejo, J. Carpio
Venue: Applied Numerical Mathematics (2008)

We introduce in this paper an adaptive method that combines a semi-Lagrangian scheme with a second order implicit-explicit Runge-Kutta-Chebyshev (IMEX RKC) method to calculate the numerical solution of convection dominated reaction-diffusion problems in which the reaction terms are highly stiff. The convection terms are integrated via the semi-Lagrangian scheme, whereas the IMEX RKC treats the diffusion terms explicitly and the highly stiff reaction terms implicitly. The space adaptation is done in the framework of finite elements and the criterion for adaptation is derived from the information supplied by the semi-Lagrangian step; so that, this can be considered a heuristic approach to adaptivity that is somewhat similar to the so-called r-adaptivity strategy.
Workstation Market Issues
Authors: Marleen Martin
Venue: IEEE Computer Graphics and Applications (1984)

If you like the craziness associated with today's volatile personal computer market, you're going to love the coming boom in workstations. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Impact of multi-query optimization in sensor networks
Authors: Shili Xiang, Hock Beng Lim, Kian-Lee Tan
Venue: Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006 (2006)

In this paper, we study the problem of processing multiple queries in a wireless sensor network. We focus on multi-query optimization at the base station level to minimize the number of radio messages in the sensor network. We adopt a cost-based approach, and develop a cost model to study the benefit of exploiting common subexpressions in queries. We also propose several optimization algorithms for both data acquisition queries and aggregation queries that intelligently rewrite multiple sensor data queries (at the base station) into "synthetic" queries to eliminate redundancy among them before they are injected into the wireless sensor network. The set of running synthetic queries is dynamically updated by the arrival of new queries as well as the termination of existing queries. We validate the effectiveness of our cost model and our experimental results indicate that our multi-query optimization strategy can provide significant performance improvements.
How Japan's Recently Amended Copyright Law Affects Software
Authors: A. U. Tomijima
Venue: IEEE Software (1987)

Japan rejected a proposal to adopt a special software protection law and instead modified its copyright law to include software. This change may affect US firms doing business there. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player