ppxscal/embedding_network huggingface dataset:
The Key Points of New Fuzzy Set Theory
Authors: Xiaoyu Gao, Yue Hu, Qingshi Gao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The key of new fuzzy set theory (C-Fuzzy Set Theory): The different kinds of relations between two fuzzy sets, the statistics background of fuzzy sets, the calculation of grade of membership, the overlapping coefficient, and the expansions of Zadeh's fuzzy set theory, etc., are discussed in this paper. This paper also can be regard as an
Software Structure Metrics Based on Information Flow
Authors: S. Henry
Venue: IEEE Transactions on Software Engineering (1981)

Structured design methodologies provide a disciplined and organized guide to the construction of software systems. However, while the methodology structures and documents the points at which design decisions are made, it does not provide a specific, quantitative basis for making these decisions. Typically, the designers' only guidelines are qualitative, perhaps even vague, principles such as "functionality," "data transparency," or "clarity." This paper, like several recent publications, defines and validates a set of software metrics which are appropriate for evaluating the structure of large-scale systems. These metrics are based on the measurement of information flow between system components. Specific metrics are defined for procedure complexity, module complexity, and module coupling. The validation, using the source code for the UNIX operating system, shows that the complexity measures are strongly correlated with the occurrence of changes. Further, the metrics for procedures and modules can be interpreted to reveal various types of structural flaws in the design and implementation.
Variations on a Method for Representing Data Items of Unlimited Length
Authors: F. Luccio
Venue: IEEE Transactions on Software Engineering (1985)

A recent encoding method [11 is revisited here, and two simple variations are proposed to reduce the length of the encoded data strings. The new variations also decrease encoding time, and allow numerical data to be represented in any base.
On Genuine Connectivity Relations Based on Logical Predicates
Authors: Pierre Soille
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper introduces a framework for the generation of genuine connectivity relations whose equivalent classes (called connected components) define unique partitions of the definition domain of a given grey tone image. This framework exploits the total ordering relation between the alpha-connected components of a pixel (two pixels are alpha-connected if there exists at least one path joining them such that the intensity differences between successive pixels of this path does not exceed a threshold value equal to alpha). Genuine connectivity relations are then obtained by considering the largest alpha-connected components satisfying one or more logical predicates such as the variance of the intensity values of the alpha-connected components not exceeding a given threshold value. Fine to coarse hiearchy partitions are generated by carefully varying the input threshold values. The proposed framework has the striking property of uniqueness. That is, the results do not depend on pixel processing order and are fully defined by the values of the threshold values, in contrast to most region growing procedures.
Robust and Adaptive Surface Reconstruction using Partition of Unity Implicits
Authors: Joao Paulo Gois, Valdecir Polizelli-Junior, Tiago Etiene, Eduardo Tejada, Antonio Castelo, Thomas Ertl, Luis Gustavo Nonato
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Implicit surface reconstruction from unorganized point sets has been recently approached with methods based on multi-level partition of unity. We improve this approach by addressing local approximation robustness and iso-surface extraction issues. Our method relies on the J_1^A triangulation to perform both the spatial subdivision and the isosurface extraction. We also make use of orthogonal polynomials to provide adaptive local approximations in which the degree of the polynomial can be adjusted to accurately reconstruct the surface locally. Finally, we compare our results with previous work to demonstrate the robustness of our method.
The FDP, a Fast Programmable Signal Processor
Authors: B. Gold, I. L. Lebow, P. G. McHugh, C. M. Rader
Venue: IEEE Transactions on Computers (1971)

This paper contains a description of the architecture of the fast digital processor (FDP), a general purpose digital attachment to a UNIVAC 1219 computer facility. The main purpose of the FDP is to enhance the capability of the UNIVAC facility for performance of digital signal processing operations such as digital filtering and discrete Fourier transforms. The structural design evolved during a series of discussions among the four authors. The FDP is presently being constructed under the supervision of one of the authors, P. McHugh, and should be completed in late 1970.
New Applications
Authors: D. A. Michalopoulos
Venue: Computer (1976)

A computerized traffic control system is now in operation in Greensboro, North Carolina. The $1.4-million system controls 158 intersections and uses 219 vehicle detectors buried in the streets to help ensure smooth traffic flow.
Prioritized Constraints with Data Sampling Scores for Automatic Test Data Generation
Authors: Xiao Ma, J. Jenny Li, David M. Weiss
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Many automatic test data generation approaches use constraint solvers to find data values, e.g. the method given in [1]. One problem with this method is that it cannot generate test data when the constraints are not solvable, either because there is no solution or the constraints are too complex. We propose a constraint prioritization method using data sampling scores to generate valid test data even when a set of constraints is not solvable. Our case study illustrates the effectiveness of this method.
MREM: An associative autonomous recurrent network
Authors: Enrique Mérida-Casermeiro, José Muñoz-Pérez
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

This paper shows a new type Hopfield multivalued recurrent neural model (MREM) and some of its learning capabilities. So, the network can be used as an associative memory (multivalued counterpart of Hopfield network). Moreover, when only two states ({-1, 1} or {0, 1}) are allowed, the network coincides with the bipolar or binary Hopfield discrete models. Although there exist some other multivalued type Hopfield models, this model uses, in a more proper way, the multivalued information contained in a multivalued neuron. It is possible because we have considered that the interaction between neurons is expressed by a general real function between their outputs, whereas most of others models use the product function that produces only two possible values with a drastic lost of the multivalued information. The introduction of this function of the outputs of neurons (that we are naming function of similarity as it measures the similarity between the outputs of neurons) allows to represent more properly the interaction between two similar, but different, neuron outputs (for example: waves, colors, etc.) than a binary (or previous multivalued models) do. In this paper, a method to load a set of patterns into the network has been studied. That method generalizes the Hopfield's one when multivalued neurons are been considered. Finally, it is shown that by using an augmented network and loading augmented patterns we can avoid the storage of spurious patterns into the network, as the well-known effect of loading the opposite pattern into the Hopfield's network. For this new storage technics has been obtained an expression that allows to set bounds to the capacity of the network. It must be considered that multivalued patterns contains much more information than bipolar ones. So, for similar capacity value a multivalued network must be preferred to another one whose neuron outputs can take only two values.
Further Cryptanalysis of a CRT-RSA Algorithm at CCS 2003
Authors: Ming Li, Baodong Qin, Fanyu Kong, Daxing Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

At CCS 2003, Bl¨omer, Otto, and Seifert proposed a new CRT-RSA signature algorithm, which was claimed to be secure against hardware fault attack. Unfortunately, one year later, Wagner presented a simple and practical fault attack on the so-called BOS algorithm. In this paper, we give a further cryptanalysis of the BOS algorithm and can completely break the security of it with a probability at least 25%. Compared to Wagner's attack, the new attack is much simpler and requires fewer faulty signatures. We further conclude that the BOS algorithm is not safe for use in its present form.
A New Biometric Technology Based on Mouse Dynamics
Authors: Ahmed Awad E. Ahmed Issa Traore
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

In this paper we introduce a new form of behavioral biometrics based on mouse dynamics, which can be used indifferent security applications. We develop a technique that can be used to model the behavioral characteristics from the captured data using artificial neural networks. In addition, we present an architecture and implementation for the detector, which cover all the phases of the biometric data flow including the detection process. Experimental data illustrating the experiments conducted to evaluate the accuracy of the proposed detection technique are presented and analyzed. Specifically, three series of experiments are conducted. The main experiment, in which twenty-two participants are involved, reproduces real operating conditions in computing systems by giving participants an individual choice of operating environments and applications; 284 hours of raw mouse data are collected over 998 sessions, with an average of 45 sessions per user. The two other experiments, involving seven participants, provided a basis for studying the confounding factors arising from the main experiment by fixing the environment variables. In the main experiment, the performance results presented using receiver operating characteristic(ROC) curves and a confusion matrix yield at the crossover point (i.e., threshold set for an equal error rate) a false acceptance rate (FAR) of 2.4649% and a false rejection rate (FRR) of 2.4614%.
Parallel Processing in a Message-Based operating System
Authors: R. Olson
Venue: IEEE Software (1985)

As originally designed, the ELXSI System 6400 used messages to achieve parallelism. Shared-memory capabilities were added later-with added later with surprising ease and success. 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
State-annotated motion graphs
Authors: Bill Chiu, Victor Zordan, Chun-Chih Wu
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Motion graphs have gained popularity in recent years as a means for re-using motion capture data by connecting previously unrelated segments of a recorded library. Current techniques for controlling movement of a character via motion graphs have largely focused on path planning which is difficult due to the density of connections found on the graph. We introduce "state-annotated motion graphs," a novel technique which allows high-level control of character behavior by using a dual representation consisting of both a motion graph and a behavior state machine. This special motion graph is generated from labeled data and then bound to a finite state machine with similar labels. At run-time, character behavior is simply controlled by switching states. We show that it is possible to generate rich, controllable motion without the need for deep planning. We demonstrate that, when applied to an interactive fighting testbed, simple state-switching controllers may be coded intuitively to create various effects.
An empirical evaluation of XQuery processors
Authors: Stefan Manegold
Venue: Information Systems (2008)

This paper presents an extensive and detailed experimental evaluation of XQuery processors. The study consists of running five publicly available XQuery benchmarks-the Michigan benchmark (MBench), XBench, XMach-1, XMark and X007-on six XQuery processors, three stand-alone (file-based) XQuery processors (Galax, Qizx/Open, Saxon-B) and three XML/XQuery database systems (BerkeleyDB/XML, MonetDB/XQuery, X-Hive/DB). Next to assessing and comparing the functionality, performance and scalability for the various systems, the major focus of this work is to report in detail about the experiences made while performing such an exhaustive study, to discuss all the problems that we encountered and how we solved them, and hence to hopefully provide some guidelines (or even a recipe) for performing reproducible large-scale experimental research and system evaluation.
Probabilistic independence with respect to upper and lower conditional probabilities assigned by Hausdorff outer and inner measures
Authors: Serena Doria
Venue: International Journal of Approximate Reasoning (2007)

Upper and lower conditional probabilities are defined by Hausdorff outer and inner measures, when the conditioning events have positive and finite Hausdorff outer and inner measures in their dimension, otherwise, when the conditioning events have Hausdorff outer or inner measure equal to zero or infinity in their dimension, they are defined by a 0-1 valued finitely, but not countably, additive probability. Examples are given when the @s-field of the conditioning events is the @s-field of countable and co-countable subsets of [0,1], the tail @s-field and the @s-field of symmetric events. The definitions of s-independence and s-irrelevance with respect to these upper and lower conditional probabilities are introduced to assure that logical independence is a necessary condition of stochastic independence. It is also proved that s-irrelevance is a sufficient condition for strong independence introduced for credal sets. An example is given to show that the converse is not true. The definitions of s-independence and strong independence are equivalent when all subsets of the sample space @W have the same Hausdorff dimension, as it happens when @W is a finite set. The definition of s-conditional irrelevance is given and a generalized factorization property is proposed as a necessary condition of s-conditional irrelevance. Examples are given to show that s-conditional irrelevance and s-irrelevance are not related; moreover, sufficient conditions are given for equivalence between s-conditional irrelevance and s-irrelevance.
Databases in a wireless world
Authors: David Yach
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The traditional view of distributed databases is based on a number of database servers with regular communication. Today information is stored not only in these central databases, but on a myriad of computers and computer-based devices in addition to the central storage. These range from desktop and laptop computers to PDA's and wireless devices such as cellular phones and BlackBerry's. The combination of large centralized databases with a large number and variety of associated edge databases effectively form a large distributed database, but one where many of the traditional rules and assumptions for distributed databases are no longer true. This keynote will discuss some of the new and challenging attributes of this new environment, particularly focusing on the challenges of wireless and occasionally connected devices. It will look at the new constraints, how these impact the traditional distributed database model, the techniques and heuristics being used to work within these constraints, and identify the potential areas where future research might help tackle these difficult issues.
Qualitative kinematics of planar robots: Intelligent connection
Authors: Honghai Liu, George M. Coghill, David J. Brown
Venue: International Journal of Approximate Reasoning (2007)

This paper proposes a qualitative representation for robot kinematics in order to close the gap, raised by the perception-action problem, with a focus on intelligent connection of qualitative states to their corresponding numeric data in a robotic system. First, qualitative geometric primitives are introduced by combining a qualitative orientation component and qualitative translation component using normalisation techniques. A position in Cartesian space can be mathematically described by the scalable primitives. Secondly, qualitative robot kinematics of an n-link planar robot is derived in terms of the qualitative geometry primitives. Finally, it shows how to connect quantitativeness and qualitativeness of a robotic system. On the one hand, the integration of normalisation and domain knowledge generates normalised labels to introduce the meaningful parameters into the proposed representation. On the other hand, the normalised labels of this representation can be converted to a quantitative description using aggregation operators, whose numeric outputs can be used to generate desired trajectories based on mature interpolation techniques.
Seeking stable clusters in the blogosphere
Authors: Nilesh Bansal, Fei Chiang, Nick Koudas, Frank Wm. Tompa
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The popularity of blogs has been increasing dramatically over the last couple of years. As topics evolve in the blogosphere, keywords align together and form the heart of various stories. Intuitively we expect that in certain contexts, when there is a lot of discussion on a specific topic or event, a set of keywords will be correlated: the keywords in the set will frequently appear together (pair-wise or in conjunction) forming a cluster. Note that such keyword clusters are temporal (associated with specific time periods) and transient. As topics recede, associated keyword clusters dissolve, because their keywords no longer appear frequently together. In this paper, we formalize this intuition and present efficient algorithms to identify keyword clusters in large collections of blog posts for specific temporal intervals. We then formalize problems related to the temporal properties of such clusters. In particular, we present efficient algorithms to identify clusters that persist over time. Given the vast amounts of data involved, we present algorithms that are fast (can efficiently process millions of blogs with multiple millions of posts) and take special care to make them efficiently realizable in secondary storage. Although we instantiate our techniques in the context of blogs, our methodology is generic enough to apply equally well to any temporally ordered text source. We present the results of an experimental study using both real and synthetic data sets, demonstrating the efficiency of our algorithms, both in terms of performance and in terms of the quality of the keyword clusters and associated temporal properties we identify.
Study of Gray Analysis Method of Fault Probability for Quality of Product Design
Authors: Yiyong Yao, Liping Zhao, Fei Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Quality of product design is formed in the process of product design. Quality problem of product design is found and solved through analysis fault reason. In the paper, Based on structure tree of product and fault tree, with combination of Node Knowledge Representation method (NKR) and Gray Analysis method (GRA), fault probability analysis model is established for product design, then the relation and importance of fault are analyzed, and computational method of sequence sets of fault probability of parts is proposed based on data mining, which is the basis of ensuring and improving quality of product design. Finally, an instance of automobile engine is analyzed.1 .
An end effector based on the Bernoulli principle for handling sliced fruit and vegetables
Authors: S. Davis, J. O. Gray, Darwin G. Caldwell
Venue: Robotics and Computer-Integrated Manufacturing (2008)

This paper describes the design and testing of a gripper developed for the handling of delicate sliced fruit and vegetable products commonly found in the food industry. The device operates on the Bernoulli principle whereby air flow over the surface of an object generates a lift. The gripper allows objects to be lifted with minimal contact thereby reducing the chances of damaging or contaminating the object. The paper will describe the mathematical basis of the gripper operation followed by tests showing the nature of the grasp. As a secondary benefit it will be shown that the flow of air over the object can also be used to remove surface moisture produced during slicing. This drying effect is a feature particularly useful in some areas of food production. The paper will show a test manufacturing cell demonstrating the placement of slices of tomatoes and cucumber on to sandwiches.
Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links
Authors: Yu Gu, Tian He
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

In extremely low duty-cycle sensor networks, end-to-end communications cannot afford to maintain an always-awake communication backbone. Low duty-cycle, accompanied by the unreliable nature of wireless communication, makes it essential to design a new data forwarding scheme for such networks, so as to achieve network energy efficiency, reliability, and timeliness in an integrated fashion. In this work, we introduce the concept of dynamic switch-based forwarding (DSF) that optimizes the (i) expected data delivery ratio, (ii) expected communication delay, or (iii) expected energy consumption. DSF is designed for networks with possibly unreliable communication links and predetermined node communication schedules. Interestingly, we reveal that allowing opportunistic looping can actually reduce the end-to-end delay. To our knowledge, these are the most encouraging results to date in this new research direction. In this paper, DSF is evaluated with a theoretical analysis, extensive simulation, and physical testbed consisting of 20 MicaZ motes. Results reveal the remarkable advantage of DSF in extremely low duty-cycle sensor networks in comparison to three well-known solutions (ETX [3], PRRxD [19] and DESS [16]). We also demonstrate our solution defaults into ETX in always-awake networks and DESS in perfect-link networks.
Protocol Transducer Synthesis using Divide and Conquer approach
Authors: S. Watanabe
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

One of the efficient design methodologies for large scale system on a chip (SoC) is IP-based design. In this methodology, a system is considered as a set of components and interconnects among them. The designers try to reuse existing IPs as much as possible. Communications among components have to be conducted using a common protocol, however, IPs available today use various communication protocols. Thus the protocol conversion is one of the most important topics in IP-based design (Gajski et al., 2000). In this paper, we propose a method for automatic protocol transducer synthesis which is applicable to complex protocols. The main idea of our proposed method is division of the exploration space into smaller ones for avoiding explosion of the exploration space, namely with a divide and conquer approach. We demonstrate our method by synthesizing transducers which translate between the real and complicated protocols with advanced features such as non-blocking transactions and out-of-order transactions.