ppxscal/embedding_network huggingface dataset:
Trustworthiness of Acquaintance peers on Access Control Models
Authors: Yoshio Nakajima, Kenichi Watanabe, Alireza Goudarzi Nemati, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In a fully distributed peer-to-peer (P2P) overlay network, peer processes (peers) cannot perceive where every object exists due to the scalability and openness. A peer has to obtain service through communicating with acquaintance peers. Here, acquaintance peers may hold obsolete information and may be even malicious. Hence, it is critical for a peer to identify which acquaintance is more trustworthy. In this paper, the trustworthiness of an acquaintance is defined in terms of the satisfiability and ranking factor. We define how satisfiable a requesting peer is for each type of access requests by newly taking into account the authorization. The ranking factor of an acquaintance shows how much the acquaintance is trusted by trustworthy acquaintances. The trustworthiness of each acquaintance is propagated in a peer-by-peer way. We evaluate how the ranking factors of acquaintance is changing through interactions among peers.
Attacking on the Flank
Venue: Computer (1973)

In this exclusive interview with COMPUTER magazine, ex-IBM dean of computer architecture, Dr. Gene Amdahl, claims a new large-scale computer that is considerably faster and more efficient than any IBM, CDC or other competitor's offering. 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
Implementation and Evaluation of an Automatic Visualization Tool "PGT" for Programming Education
Authors: Yoshihiro Kita, Tetsuro Katayama, Shigeyuki Tomita
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

As the demand for software is increasing more rapidly than ever, demand for programmers is increasing. It is important to educate novice programmers in order to increase the population of programmers. They have to read source codes of various programs, when they learn programming. But, it is not easy task for them to understand the behavior of a program only by reading the source code. This paper describes implementation and evaluation of an automatic visualization tool "PGT(Path Generation Tool)" for aiding programs in reading the source code of a Java program. PGT generates paths from a source code by visualizing the paths corresponded to the statements of the source code so that understand the meaningof the program easily.
Group Averaged Linear Transforms that Detect Corners and Edges
Authors: J. C. Dunn
Venue: IEEE Transactions on Computers (1975)

Linear transforms of the characteristic functions of plane figures are averaged over the one parameter continuous group of dilatations (homothetic scale changes) to obtain new dilatation-invariant transforms. For a large class of kernel functions, the group averaged transforms act as corner detectors or edge detectors.
A storage system with sporadic and continuous clearings
Authors: Wolfgang Stadje
Venue: Probability in the Engineering and Informational Sciences (2007)

We study a cumulative storage system that is totally cleared sporadically at stationary renewal times and whenever a finite-capacity threshold is exceeded. The independent and identically distributed inputs occur at time epochs that also form a stationary renewal process. We determine the distribution of the interoverflow times. Although this distribution is quite intricate when both underlying renewal processes are general, in the special case of Poisson sporadic clearings we obtain a neat formula for its Laplace transform.
Automatically Proving Concurrent Programs Correct
Authors: Byron Cook
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

This talk will describe new advances that allow us to automatically prove both liveness properties and heap-shape properties of concurrent programs. The talk will focus on recent thread-modular extensions to the program termination prover TERMINATOR and shape analysis tool SLAyer and their application to Windows device drivers.
Randomized metric induction and evolutionary conceptual clustering for semantic knowledge bases
Authors: Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We present an evolutionary clustering method which can be applied to multi-relational knowledge bases storing semantic resource annotations expressed in the standard languages for the Semantic Web. The method exploits an effective and language-independent semi-distance measure defined for the space of individual resources, that is based on a finite number of dimensions corresponding to a committee of features represented by a group of concept descriptions (discriminating features). We show how to obtain a maximally discriminating group of features through a feature construction method based on genetic programming. The algorithm represents the possible clusterings as strings of central elements (medoids, w.r.t. the given metric) of variable length. Hence, the number of clusters is not needed as a parameter since the method can optimize it by means of the mutation operators and of a proper fitness function. We also show how to assign each cluster with a newly constructed intensional definition in the employed concept language. An experimentation with some ontologies proves the feasibility of our method and its effectiveness in terms of clustering validity indices.
Numerical Stability of Delay Integro-Differential Equations under Resolvent Conditions
Authors: Jing-jun Zhao, Yang Xu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper deals with the stability of numerical methods for the delay integro-differential equations. The \theta-methods are applied to this system by using the linear interpolation. The upper bound of norm for the corresponding iterative matrix is studied under a weak version for the resolvent conditions of Kreiss. It is proved that the system would preserve its stable properties if \theta \in [1/2, 1].
Panoramic Background Model under Free Moving Camera
Authors: Naveed I. Rao, Huijun Di, GuangYou Xu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

segmentation of moving regions in outdoor environment under a moving camera is a fundamental step in many vision systems including automated visual surveillance, human-machine interface, tracking etc. It is also a chal- lenging task due to camera motion, object motion, and out- door scene challenges i.e. periodic motions of swaying of trees, gradual illumination changes, etc. In this paper, a wide area scene modeling approach for object segmenta- tion under a moving camera is proposed. This approach suffers due to parallax effect, misallignment errors etc and needs their concurrent removal for its success. we explic- itly model the dense correspondence between input image and panoramic background model. Foreground segmenta- tion and correspondence estimation are expressed as a uni- fied labeling problem, and are solved efficiently via tree dy- namic programming (TDP). Lucas-Kanade method is used to find sparse correspondence between image and model, and robust M-estimator is then applied to find the projective transformation for initialization of TDP's window search. Optimal dense correspondences are achieved and are used to update panoramic background model and as a byprod- uct, online refined panoramic image is generated which is empty in the beginning and is filled step by step. We test our algorithm with hand-held camera and also with a camera mounted on a moving platform. Experiments proved our algorithm to be robust in performance
Time lower bounds for implementations of multi-writer snapshots
Authors: Faith Ellen, Panagiota Fatourou, Eric Ruppert
Venue: Journal of the ACM (JACM) (2007)

A snapshot object is an abstraction of the problem of obtaining a consistent view of the contents of shared memory in a distributed system, despite concurrent changes to the memory. There are implementations of m-component snapshot objects shared by n &ge; m processes using m registers. This is the minimum number of registers possible. We prove a time lower bound for implementations that use this minimum number of registers. It matches the time taken by the fastest such implementation. Our proof yields insight into the structure of any such implementation, showing that processes must access the registers in a very constrained way. We also prove a time lower bound for snapshot implementations using single-writer registers in addition to m historyless objects (such as registers and swap objects).
Computation of Surface Areas In GMSolid
Authors: R. F. Sarraga
Venue: IEEE Computer Graphics and Applications (1982)

When Applied to Combustion Chamber Design Analysis at General Motors, This Treebased Calculation Method Has Saved Time over the Boundary Representation Approach.
On the Hardness of Approximating the Multicast Delay Variation Problem
Authors: Pi-Rong Sheu, Shan-Tai Chen
Venue: IEEE Transactions on Computers (2007)

Given a network with one source and multiple destinations, the multicast delay variation problem attempts to construct a multicast tree such that the inter-destination delay variation among all the paths from the source to each destination is minimized. In this paper, we show that the problem is NP-hard and that it is not approximable within a constant factor in polynomial time unless NP = P. These findings indicate that it is impossible to develop efficient optimal or approximation algorithms for any multicast routing problem under the inter-destination delay variation constraint unless NP = P.
Combination of evidences in relevance feedback for xml retrieval
Authors: Lobna Hlaoua, Mohand Boughanem, Karen Pinel-Sauvagnat
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

The main objective in XML Retrieval is to select the relevant elements of XML document instead of the whole document. Many open issues appear when considering Relevance Feedback (RF) in XML documents. They are mainly related to the form of XML documents, which mix content and structure information and to the new information granularity. In this paper, a new flexible method of relevance feedback in XML retrieval using two sources of evidence is described. We propose to use the context criterion to select terms to extend the initial query and to use generative structures to express structural constraints. Both approaches are applied in different combined forms. Experiments are carried out with the INEX evaluation campaign and results show the effectiveness of our approach.
Information Flow Certification Using an Intermediate Code Program Representation
Authors: A. L. Mennie
Venue: IEEE Transactions on Software Engineering (1981)

This paper describes a compile-time information flow control (IFC) mechanism that certifies secure information flow within the collection of objects accessed by a program. The IFC mechanism is based on the lattice model and certification mechanism of Denning, who proposes the use of the mechanism during the analysis phase of compilation. However, IFC is placed after semantic analysis and before code optimization by ufilizing an intermediate code representation. This reduces the complexity of IFC and allows a degree of language independence. An implentation has been developed for Pascal.
Low power CMOS electronic central pattern generator design for a biomimetic underwater robot
Authors: Young Jun Lee, Jihyun Lee, Kyung Ki Kim, Yong-Bin Kim, Joseph Ayers
Venue: Neurocomputing (2007)

This paper presents a feasibility study of a central pattern generator-based analog controller for an autonomous robot. The operation of a neuronal circuit formed of electronic neurons based on Hindmarsh-Rose neuron dynamics and first order chemical synapses is modeled. The controller is based on a standard 0.25@mm CMOS process with 2V supply voltage. In order to achieve low power consumption, CMOS subthreshold circuit techniques are used. The controller generates an excellent replica of the walking motor program and allows switching between walking in different directions in response to different command inputs. The simulated power consumption is 4.8mW and die size including I/O pads is 2.2mm by 2.2mm. Simulation results demonstrate that the proposed design can generate adaptive walking motor programs to control the legs of autonomous robots.
Use of SPOOF's in the Analysis of Faulty Logic Networks
Authors: F. W. Clegg
Venue: IEEE Transactions on Computers (1973)

In general, one cannot predict the effects of possible failures on the functional characteristics of a logic network without knowlegde of the structure of that network.
Name-Based Write Barriers in Real-Time Java
Authors: M. Teresa Higuera-Toledano
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

From a real-time perspective, the GC introduces unpre- dictable pauses that are not tolerated by real-time tasks. Real-time collectors eliminate this problem but introduce a high overhead. Another approach is to use Memory Regions (MR) within which allocation and deallocation are cus- tomized. This facility is supported by the memory model of the Real-Time Specification for Java (RTSJ). RTSJ imposes strict access rules and assignment rules to avoid both delays of critical tasks for the GC and dangling inter-region refer- ences, which results in an unfamiliar programming model. The guidelines given by RTSJ to implement the assignment rules also increase the program complexity. This paper provides an indepth analytical investigation of the dynamic checks required to maintain the safety of a RTSJ implemen- tation, and propose a simplification of the algorithms man- aging memory regions which requires some changes on the RTSJ memory management rules.
Auditing and Inference Control in Statistical Databases
Authors: F. Y. Chin
Venue: IEEE Transactions on Software Engineering (1982)

A statistical database (SDB) may be defined as an ordinary database with the capability of providing statistical information to user queries. The security problem for the SDB is to limit the use of the SDB so(that only statistical information is available and no sequence of queries is sufficient to infer protected information about any individual. When such information is obtained, the SDB is said to be compromised.
A Survey of Proposed Architectures for the Execution of Functional Languages
Authors: S. R. Vegdahl
Venue: IEEE Transactions on Computers (1984)

Functional and imperative programming languages are characterized and compared with regard to programming style and efficiency. Machine design issues, are characterized by interconnection topology, evaluation strategy, program and data representation, process management, and dynamic optimization techniques; short descriptions of a number of "functional" machines are given in terms of these issues. Multiprocessor issues and systems are particularly emphasized. Outstanding problems in the area are reviewed and an overall evaluation of proposed machines is given.
Computer Buses a Tutorial
Authors: David Gustavson
Venue: IEEE Micro (1984)

The major issues of bus design are illuminated in this easy-to-understand introduction to computer buses?the communication paths that are revolutionizing interactions between microprocessor systems.
Data mining applications in BT
Authors: R. Shortland, R. Scarfe
Venue: BT Technology Journal (2007)

With the increased use of computers there is an ever increasing volume of data being generated and stored. This can lead to companies becoming `data rich and information poor'. This paper describes how BT has used data mining techniques to convert volume data into high-value information which can be used to aid decision making in a number of key business processes. The benefit of actively using data, as opposed to passively storing it, is demonstrated via a number of case studies which cover areas as diverse as fault diagnosis, fraud detection, market segmentation, credit vetting and litigation assessment.
On the displacement rigidity of Levi flat hypersurfaces: the case of boundaries of disc bundles over compact Riemann surfaces
Authors: Klas Diederich, Takeo Ohsawa
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

Non-existence theorems for Levi fiat hypersurfaces have found great interest in the literature. The question next to this that has to be asked is, when existing Levi flat hypersurfaces are at least rigid under deformations. Here, the case of boundaries of disc bundles over certain compact Riemann surfaces is considered.
Introduction
Authors: W. W. Chu
Venue: IEEE Transactions on Computers (1980)

DURING the past decade, we have experienced an explosive growth in data communications and networking in which terminals, computers, and computer networks are connected together via communication lines to share databases and computing resources. However, due to the lack of understanding of how to design efficient distributed databases and distributed processing systems, most of the systems are designed on an ad hoc basis. Thus, no standardization is yet available. With the advent of data communications, as well as the low-cost VLSI technology, intelligent memories, intelligent interfaces, etc., we do envision that distributed database and distributed processing development will experience an explosive growth in the 80's.
Neural networks deterioration models for serviceability condition of buried stormwater pipes
Authors: D. H. Tran, A. W. M. Ng, B. J. C. Perera
Venue: Engineering Applications of Artificial Intelligence (2007)

Buried stormwater pipe networks play a key role in surface drainage systems for urban areas of Australia. The pipe networks are designed to convey water from rainfall and surface runoff only and do not transport sewage. The deterioration of stormwater pipes is commonly graded into structural and serviceability condition using CCTV inspection data in order to recognize two different deterioration processes and consequences. This study investigated the application of neural networks modelling (NNM) in predicting serviceability deterioration that is associated with reductions of pipe diameter until a complete blockage. The outcomes of the NNM are predictive serviceability condition for individual pipes, which is essential for planning proactive maintenance programs, and ranking of pipe factors that potentially contribute to the serviceability deterioration. In this study the Bayesian weight estimation using Markov Chain Monte Carlo simulation was used for calibrating the NNM on a case study in order to account for the uncertainty often encountered in NNM's calibration using conventional back-propagation weight estimation. The performance and the ranked factors obtained from the NNM were also compared against a classical model using multiple discrimination analysis (MDA). The results showed that the predictive performance of the NNM using Bayesian weight estimation is better than that of the NNM using conventional backpropagation and MDA model. Furthermore, among nine input factors, 'pipe age' and 'location' appeared insignificant whilst 'pipe size', 'slope', 'the number of trees' and 'climatic condition' were found consistently important over both models for serviceability deterioration process. The remaining three factors namely, 'structure', 'soil' and 'buried depth' might be redundant factors. A better and more consistent data collection regime may help to improve the predictive performance of the NNM and identify the significant factors.
Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions
Authors: Attila Gyulassy Vijay Natarajan, Valerio Pascucci, Bernd Hamann
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and their importance. We present an algorithm that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of the complex in a consistent manner. All components of the complex, both geometric and topological, are computed, providing a complete decomposition of the domain. Efficiency is maintained by representing the geometry of the complex in terms of point sets.
A Concept Similarity Based Text Classification Algorithm
Authors: Jing Peng, Dong-qing Yang, Shi-Wei Tang, Jun Gao, Peng-yi Zhang, Yan Fu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Text classification is an important task of data mining. Existing algorithms, which based on vector space models, does not considered concept similarities among words, so the accuracy of traditional text classification cannot guarantee. To solve the problem, this paper proposes a new text classification algorithm in Chinese text processing based on concept similarity. The contributions of the paper include: (1) proposing a new similarity-computing model between words or sentences based on concept similarity; (2) applying the algorithm successfully in the text classification of WEB news; (3).analyzing the similarity computing formulas systematically in theory; (4).proving that the algorithm has much more accurate than traditional k-NN algorithm in text classification problems through extensive experiments.
Autocorrelation Function of Filtered p-Level Maximal-Length Sequences
Authors: G. Wustmann
Venue: IEEE Transactions on Computers (1982)

The autocorrelation function of nonrecursive digital filtered pseudorandom p-level (p = 2,3,5) maximal-length sequences is discussed. An extension to results given in the literature for summed binary sequences is presented and simple expressions for the correlation functions of higher level m-sequences are obtained.
Text Input System Using Online Overlapped Handwriting Recognition for Mobile Devices
Authors: Y. Tonouchi, A. Kawamura
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper proposes a novel online overlapped handwriting recognition system for mobile devices such as cellular phones. Users can input characters continuously without pauses on the single writing area. It has three features: small writing area, quick response and direct operations with handwritten gestures. Therefore, it is suitable for mobile devices such as cellular phones. The system realizes a new handwriting interface similar to touch-typing. We evaluated the system by two experiments: character recognition performance and text entry speed of Japanese sentences. Through these experiments we showed the effectiveness of the proposed system.