ppxscal/embedding_network huggingface dataset:
A continuum theory for unstructured mesh generation in two dimensions
Authors: Guy Bunin
Venue: Computer Aided Geometric Design (2008)

A continuum description of unstructured meshes in two dimensions, both for planar and curved surface domains, is proposed. The meshes described are those which, in the limit of an increasingly finer mesh (smaller cells), and away from irregular vertices, have ideally-shaped cells (squares or equilateral triangles), and can therefore be completely described by two local properties: local cell size and local edge directions. The connection between the two properties is derived by defining a Riemannian manifold whose geodesics trace the edges of the mesh. A function @f, proportional to the logarithm of the cell size, is shown to obey the Poisson equation, with localized charges corresponding to irregular vertices. The problem of finding a suitable manifold for a given domain is thus shown to exactly reduce to an Inverse Poisson problem on @f, of finding a distribution of localized charges adhering to the conditions derived for boundary alignment. Possible applications to mesh generation are discussed.
Requirements engineering in new product development
Authors: Frank Safayeni, P. Robert Duimering, Kimberley Zheng, Natalia Derbentseva, Christopher Poile, Bing Ran
Venue: Communications of the ACM (2008)

How effective are the socio-technical interactions in developing new products?
Functional evaluation of domain–domain interactions and human protein interaction networks
Authors: Andreas Schlicker, Carola Huthmacher, Fidel Ramírez, Thomas Lengauer, Mario Albrecht
Venue: Bioinformatics (2007)

Motivation: Large amounts of protein and domain interaction data are being produced by experimental high-throughput techniques and computational approaches. To gain insight into the value of the provided data, we used our new similarity measure based on the Gene Ontology (GO) to evaluate the molecular functions and biological processes of interacting proteins or domains. The applied measure particularly addresses the frequent annotation of proteins or domains with multiple GO terms. Results: Using our similarity measure, we compare predicted domain–domain and human protein–protein interactions with experimentally derived interactions. The results show that our similarity measure is of significant benefit in quality assessment and confidence ranking of domain and protein networks. We also derive useful confidence score thresholds for dividing domain interaction predictions into subsets of low and high confidence. Contact: mario.albrecht@mpi-inf.mpg.de Supplementary information: Supplementary data are available at Bioinformatics online.
Clustering Using Feature Domain Similarity to Discover Word Senses for Adjectives
Authors: Noriko Tomuro, Steven L. Lytinen, Kyoko Kanzaki, Hitoshi Isahara
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper presents a new clustering algorithm called DSCBC which is designed to automatically discover word senses for polysemous words. DSCBC is an extension of CBC Clustering [11], and incorporates feature domain similarity: the similarity between the features themselves, obtained a priori from sources external to the dataset used at hand. When polysemous words are clustered, words that have similar sense patterns are often grouped together, producing polysemous clusters: a cluster in which features in several different domains are mixed in. By incorporating the feature domain similarity in clustering, DSCBC produces monosemous clusters, thereby discovering individual senses of polysemous words. In this work, we apply the algorithm to English adjectives, and compare the discovered senses against WordNet. The results show significant improvements by our algorithm over other clustering algorithms including CBC.
A New Video Compression Method for Surveillance Network
Authors: Fu Xianping, Liang Dequn
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The new video compression method recognition-oriented is discussed using wavelet analysis on the basis of the characteristics of wireless automatic surveillance network. The characteristics of surveillance network are narrowband for video communication and need lower cost in the terminals because of the quantity. A new method is proposed in this paper for narrowband network, such as wireless network. The innovation of the method is that low-frequency parameters of wavelet transform that are used in classical compression method are not used, while the high-frequency parameters are used for the purpose of target recognition. This is done by emphasizing high frequency components and discarding low frequency components according to a new developed recognition-based approach for image compression. Computer simulation experiments show that high-frequency parameters can lower the bit rate, having good compression ratio, and has higher practical value for target recognition in surveillance system.
An Efficient Algorithm for Web Access Pattern Mining
Authors: Sen Yang, Jiankui Guo, Yangyong Zhu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

WAP-Mine is one of algorithms for mining frequent web access patterns from web access database. It generates frequent web access patterns by recursively mining the web access pattern trees by use of WAP- tree. But in the process of mining frequent web access pattern, WAP-Mine generates many intermediate data which lowers efficiency especially at the lower support. In this paper, TD-Mine, a new algorithm was proposed which based on the WAP tree structure. TD-Mine mines the web access database in a top-down manner, which avoids building many intermediate data and saves more space. Experiments over real datasets demonstrate the effectiveness of this approach.
The Fuzzy Decision-Making Model Based on Rough Set of the M&A of Resource-Typed Enterprises
Authors: Minghua He, Wei Guo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Due to the shortage of non-renewable resources, the resource-typed enterprises have become the targets of M&A of global capital. One of the pivotal factors that decide the success of enterprises' M&A is how to choose their targets. According to the characteristics of resource-typed enterprises, this paper establishes an index system that can be utilized to evaluate the M&A' s targets comprehensively and scientifically. Moreover, by using the basic theory of rough sets and gray system, this paper conducts a quantitative decision- making, presents a decision-making model to choose the optimum alternative for M&A' s targets, and realizes the multi-object decision-making in mergers and acquisitions of the resource-typed enterprises.
Minimax a posteriori estimation in the hidden Markov models
Authors: A. V. Borisov
Venue: Automation and Remote Control (2007)

Consideration was given to the minimax estimation in the observation system including a hidden Markov model for continuous and counting observations. The dynamic and observation equations depend on a random finite-dimensional parameter having an unknown distribution with the given support. The conditional expectation of the available observation of some generalized quadratic loss function was used as the risk function. Existence of the saddle point in the formulated minimax problem was proved, and the worst distribution and the minimax estimate as the solution of a simpler dual problem were characterized.
Toward the Light Field Display: Autostereoscopic Rendering via a Cluster of Projectors
Authors: Ruigang Yang, Xinyu Huang, Sifang Li, Christopher Jaynes
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Ultimately, a display device should be capable of reproducing the visual effects observed in reality. In this paper we introduce an autostereoscopic display that uses a scalable array of digital light projectors and a projection screen augmented with microlenses to simulate a light field for a given three-dimensional scene. Physical objects emit or reflect light in all directions to create a light field that can be approximated by the light field display. The display can simultaneously provide many viewers from different viewpoints a stereoscopic effect without headtracking or special viewing glasses. This work focuses on two important technical problems related to the light field display; calibration and rendering. We present a solution to automatically calibrate the light field display using a camera and introduce two efficient algorithms to render the special multi-view images by exploiting their spatial coherence. The effectiveness of our approach is demonstrated with a four-projector prototype that can display dynamic imagery with full parallax.
FMGSP: An Efficient Method of Mining Global Sequential Patterns
Authors: Changhai Zhang, Kongfa Hu, Haidong Liu, Youwei Ding, Ling Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Now some distributed sequential patterns mining algorithms generate too many candidate sequences, and increase communication overhead. Therefore, we propose an efficient algorithm-FMGSP (Fast Mining of Global Sequential Patterns) of mining global sequential pattern on distributed system. Our method of mining sequential pattern in distributed environment differs from previous related works. Tow main contributions are made in this paper. First local sequential patterns obtained on every site in distributed environment are compressed into a lexicographic sequence tree before all subtrees will be distributed into polling site, Second, an efficient pruning strategy called I/S-EP (Item and Sequence Extension Pruning) is proposed to reduce candidate sequences. Just this, the cost of communication in the network is reduced greatly when counting requests are sent (or received) to the corresponding databases. Both theories and experiments indicate that the performance of FMGSP is predominant for large databases, the global sequential patterns could be obtained effectively by the method after reducing the cost of communication.
Towards Trace Visualization and Exploration for Reactive Systems
Authors: Shahar Maoz, Asaf Kleinbort, David Harel
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

The design and development of reactive systems [10], discrete-event systems that maintain ongoing interaction with their environment, is a complex and challenging task. One way to address it is to use visual formalisms to model and describe the system's behavior. Two complementary approaches to model the behavior of reactive systems have been proposed -- state-based intra-object modeling and scenario-based inter-object modeling -- with corresponding visual languages [5, 7].
Program Correctness: On Inductive Assertion Methods
Authors: J. C. King
Venue: IEEE Transactions on Software Engineering (1980)

A study of several of the proof of correctness methods is presented. In particular, the form of induction used is explored in detail. A relational semantic model for programming languages is introduced and its relation to predicate transformers is explored. A rather elementary viewpoint is taken in order to expose, as simply as possible, the basic differences of the methods and the underlying principles involved. These results were obtained by attempting to thoroughly understand the "subgoal induction" method.
Thunderstriking constraints with JUPITER
Authors: C. Kloukinas
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

We present JUPITER, a tool for analysing multi-constrained systems. JUPITER was built to explore three basic ideas. First, how to use controller synthesis so as to find the exact conditions under which a particular constraint will be satisfied. Second, how to successively refine the models used for the controller synthesis so as to obtain a series of more easily understandable and more robust controllers. Last but not least, how to structure & explain the synthesised controllers and provide hints to designers for further optimisations through the use of machine learning techniques. Thus, JUPITER can help in the design and analysis of multi-constraint systems through the automatic synthesis of control logic for certain of the constraints and the aid it provides to designers for discovering further optimisations. The controllers it synthesises can be easily implemented on top of a standard real-time OS.
HomeRF&trade; and SWAP: wireless networking for the connected home
Authors: Kevin J. Negus, John Waters, Jean Tourrilhes, Chris Romans, Jim Lansford, Stephen Hui
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

The Shared Wireless Aaccess Protocol (SWAP) specification for wireless voice and data networking within the home will enable a new class of mobile consumer devices that draw from the power and content of the Internet and the Home PC. If cable modems and xDSL represent the "last mile" access to the home, then HomeRFTM's mission with SWAP could be called the "very last 150 feet" within and around the home. HomeRFTM has the broad backing of the major corporate stakeholders for networking within the home and is optimized specifically for the cost/performance point needed for consumers. The technology leverages the existing PC-industry infrastructure around the Internet, TCP/IP and Ethernet and adds a standard way to connect to the Public Switched Telephone Network (PSTN) for voice telephony. First products should appear in late 1999 and future versions with enhanced features and/or higher data rates should follow by 1--2 years.
Three-dimensional finite strip analysis of laminated panels
Authors: K. M. Z. Attallah, J. Q. Ye, H. Y. Sheng
Venue: Computers and Structures (2007)

In this paper, a combined finite strip and state space approach is introduced to obtain three-dimensional solutions of laminated composite plates with simply supported ends. The finite strip method is used to present in-plane displacement and stress components, while the through-thickness components are obtained by using the method of state equation. The method can replace the traditional three-dimensional finite element solutions for structures that have regular geometric plans and simple boundary conditions, where a full three-dimensional finite element analysis is very often both extravagant and unnecessary. The new method provides results that show good agreement with available benchmark problems having different material compositions, thickness and boundary conditions. The new method provides a three-dimensional solution for laminated plates, while the advantages of using the traditional finite strip method are fully taken. This solution also yields a continuous transverse stress field across material interfaces that normally is not achievable by other numerical modelling of laminates, such as the traditional finite element method.
Structure Learning of Bayesian Networks Based on Vertical Segmentation Data
Authors: Hao Huang, Jianqing Huang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

A distributed approach in learning a Bayesian networks from vertical segmentation data was promoted in the paper. The approach includes four sequential steps: local learning, sample selection, cross learning, and combination of the results. The main improvement of the algorithm brings forward in the second step. The complex sub-structure of local BN is considered that exist a hidden node which contacts with the sub-structure. The hidden node exist in the other local BN. The experiment proved that the distributed learning method can learn almost the same structure as the result obtained by a centralized learning method.
A Flexible Integration Framework for Semantic Web 2.0 Applications
Authors: Eyal Oren, Armin Haller, Cédric Mesnage, Manfred Hauswirth, Benjamin Heitmann, Stefan Decker
Venue: IEEE Software (2007)

Mash-ups are an emerging paradigm for online applications that combine functionality from various sources. The Semantic Web, which extends the current Web with more support for data integration and data reuse, significantly eases the development of such mash-ups. But existing application frameworks offer only limited support for the integration of Semantic Web data. Additional needs for application development on the Semantic Web include bridging the semantic differences between the object-oriented and RDF(S) data models. The Semantic Web Application Framework, which extends the Ruby on Rails framework, enables rapid development of mash-ups. This article is part of a special issue on dynamically typed languages.
Eliminating Redundant Communication of Code Generation for Distributed Memory Machines
Authors: Ya Nan Shen, Rong Cai Zhao, Lei Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

How to eliminate redundant communications is a key issue in developing parallelizing compilers for distributed memory machines. An important way to improve the performance of the code generated by parallelizing compiler in distributed memory systems is to eliminate as much communications as possible. This paper investigates algorithms for generating communications code from previously published work and modifies them to eliminate redundant communications. Based on the mathematical model of symbolic coefficient linear inequalities the revisited formal specification of communications sets are presented and the corresponding improved algorithms are given. Experimental results indicate that the new algorithms can reduce communication messages and improve the performance of parallelized code significantly.
Deductive Techniques for Simulating Logic Circuits
Authors: H. Y. Chang
Venue: Computer (1975)

The use of logic simulation to facilitate the development of computers, telephone switching processors, and other digital systems has almost become an accepted industrial practice. In order to improve the quality of the design, to evaluate design alternatives, and to shorten development intervals, logic simulators have found wide-spread applications in design checkout and verification, derivation and validation of fault-detection and fault-isolation tests, and management of design and manufacturing data. Because of this, the efficiency of logic simulation techniques has also become a vital concern among the simulator developers and the users.
The Use of Bayesian Learning of Neural Networks for Mobile User Position Prediction
Authors: Sherif Akoush, Ahmed Sameh
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Mobility management plays a central role in providing ubiquitous communications services in future wireless mobile networks. In mobility management, there are two key operations, location update and paging, commonly used in tracking mobile users on the move. Location update is to inform the network about a mobile user's current location, while paging is used for the network to locate a mobile user. Both operations will incur signaling traffic in the resource limited wireless networks. The more frequent the location updates, the less paging in locating a mobile user; thus, there is a trade off in terms of signaling cost. In this paper, we present a novel hybrid Bayesian neural network model for predicting locations on Cellular Networks. We investigate different parallel implementation techniques on mobile devices of the proposed approach and compare it to many standard neural network techniques such as: Back-propagation, Elman, Resilient, Levenberg- Marqudat, and One-Step Secant models. In our experiments, we compare results of the proposed Bayesian Neural Network with 5 standard neural network techniques in predicting next location. Bayesian learning for Neural Networks predicts location better than standard neural network techniques since it uses well founded probability model to represent uncertainty about the relationship being learned. The result of Bayesian training is a posterior distribution over network weights.
P2P Live Streaming with Tree-Mesh based Hybrid Overlay
Authors: Qi Huang, Hai Jin, Xiaofei Liao
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

P2P technology has been widely adopted in live streaming system for its scalability and low commercial cost. However, tree based system or mesh based system still has to face the constraint or tradeoff caused by its solo shaped overlay construction. To address this problem, this paper introduces a treemesh based hybrid overlay and an optimized scheduling method. These works have been proven efficient in terms of low control overhead and better streaming experience compared with other systems. All algorithms and methods have been implemented in Anysee2.
An Approach for Fuzzy-Rough Sets Attributes Reduction via Mutual Information
Authors: Feifei Xu, Duoqian Miao, Lai Wei
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper presented a novel approach, based on an integrated use of fuzzy and rough set theories, to greatly reduce data redundancy. The information framework in rough set theory is introduced in fuzzy-rough set. Mutual information-based algorithm for attribute reduction in fuzzy rough set is introduced and illustrated with a simple example. Experimental result shows that it is an effective technique.
Stablewise absolute output natural tracking control with finite reachability time: MIMO Lurie systems
Authors: Lyubomir T. Gruyitch, William Pratt Mounfield,  Jr.
Venue: Mathematics and Computers in Simulation (2008)

New control concepts of the natural absolute trackability, absolute stablewise elementwise tracking and natural absolute tracking control are introduced for MIMO systems with multiple unknown controller Lurie nonlinearities, unknown linear part and unknown external disturbances. The concepts are aimed at output tracking control synthesis and implementation for such systems in order to ensure a prespecified output tracking quality. This opens two essential problems: (a) what are conditions for the natural trackability of such Lurie systems and (b) how to design a controller generating the natural tracking control for them? Both are resolved in the form of the necessary and sufficient simple conditions. The theory established in the paper is illustrated by simulation results.
The Soma: A Programming Construct for Distributed Processing
Authors: J. L. W. Kessels
Venue: IEEE Transactions on Software Engineering (1981)

A construct is proposed for parallel programming, called soma (software machine). A soma is a sequential process that can communicate with other somas by exchanging messages via mailboxes. The soma construct is well suited for implementation on conventional as well as on distributed computer architectures, the main characteristic of the latter being the absence of a common store.