ppxscal/embedding_network huggingface dataset:
FPGA-based implementation of safe Petri nets models
Authors: V. Ababii, E. Gutuleac, V. Sudacevschi, D. Odobesco
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

In this work is proposed a hardware implementation method of Safe Petri Nets (SaPN) models. The processing structure presents an interaction between homogeny processing elements functional defined. On dependence of interconnections of elements, there can be implemented any complexity of Safe Petri Net model. The processing elements represent a flexible architecture, which permit to adjust them to Safe Petri Nets models. Using this architecture and interactions of elements we obtained a reduced time of processing to checking Safe Petri Nets to reachability, viability and other behavior properties.
A mildly exponential approximation algorithm for the permanent
Authors: M. Jerrum
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

An approximation algorithm for the permanent of an n*n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp (0(n/sup 1/2/ log/sup 2/ n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form e/sup theta (n)/.
Interactive View-Dependent Rendering over Networks
Authors: Zhi Zheng, Prakash Edmond, Tony Chan
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

For a client-server based view-dependent rendering system, the overhead of view-dependent rendering and the network latency are major obstacles in achieving interactivity. In this paper, we first present a multiresolution hierarchy traversal management strategy to control the overhead of view-dependent rendering for low-capacity clients. Then we propose a predictive parallel strategy to overcome the network latency for client-server based view-dependent multiresolution rendering systems. Our solution is to make the client process and the server process run in parallel, using the rendering time to cover the network latency. For networks with long round-trip times, we manage to overlap the network latency for one frame with the rendering time for multiple frames. View-parameters prediction is incorporated to make the parallelism of the client and the server feasible. In order to maintain an acceptable view-dependent rendering quality in the network environment, we develop a synchronization mechanism and a dynamic adjustment mechanism to handle the transient network slowdowns and the changes of the network condition. Our experimental results, in comparison with the sequential method, show that our predictive parallel approach can achieve an interactive frame rate while keeping an acceptable rendering quality for large triangle models over networks with relatively long round-trip times.
Clock Skew Analysis via Vector Fitting in Frequency Domain
Authors: Ling Zhang, Wenjian Yu, Haikun Zhu, Wanping Zhang, Chung-Kuan Cheng
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

An efficient frequency-based clock analysis method: CSAV is proposed in this paper. It computes the circuit response by first solving the state equation in frequency domain, and derive the rational approximate with the help of vector fitting. There are two aspects that contribute to the time efficiency of the method. One is CSAV solves the state equation only on selected frequency points, which significantly reduce the amount of time for equation solving. The other is CSAV performs vector fitting and waveform recovery only on user specified nodes, which save the unnecessary computation on the nodes which are not concerned by user. Our experimental results show that compared with Hspice, CSAV achieves speed-up up to 35 times while the error is only 1%. Moreover, computational saving of CSAV grows with circuit size, which makes this method especially promising for large cases.
Design of an environmental monitoring program using NDVI and cumulative effects assessment
Authors: R. Quiñonez-Piñón, A. Mendoza-Durán, C. Valeo
Venue: International Journal of Remote Sensing (2007)

This paper presents a sampling design for monitoring spatial and temporal changes in forest health in the Upper Elbow River Basin, in Alberta, Canada. The procedure involved a combination of cumulative effects assessment and remote sensing techniques for selecting sampling sites based on physical and anthropogenic features. Normalized difference vegetation index (NDVI) was the indicator of forest health. Unique combinations of slope, aspect, soil moisture, NDVI, vegetation type, and the zone of influence of human activities were used to select pairs of sampling sites. Each pair consisted of a site within the zone of influence and one outside the zone. Spatial discrimination analysis was the method used for reclassification. The analysis suggested that 58 pairs would be appropriate for monitoring. NVDI was negatively correlated with dry soils and increased with the slope. To various extents, most of the species displayed NDVI values between 0.20 and 0.59. The density of linear disturbances (km/km2) was estimated and it showed that one of the three sub-catchments, the Bragg Creek, has levels of human disturbance above the value considered optimal for wildlife habitat suitability.
A simple ICA-based digital image watermarking scheme
Authors: Thang Viet Nguyen, Jagdish Chandra Patra
Venue: Digital Signal Processing (2008)

In a digital watermarking scheme, it is not convenient to carry the original image all the time in order to detect the owner's signature from the watermarked image. Moreover, for those applications that require different watermark for different copies, it is preferred to utilize some kind of watermark-independent algorithm in extraction (does not need a priori knowledge of the watermark). In this paper we introduce a novel approach called WMicaT that employs an independent component analysis technique in watermark embedding and extraction. Using a single 'public image' that can be made publicly available, the new algorithm is able to extract the watermark without requiring the original image and any information about the watermark. In addition, the watermark is not limited to some specific binary sequences but can be any meaningful image. The WMicaT method, undergoing different experiments, has shown its robustness against many attacks.
Fast generation of regular graphs and construction of cages
Authors: Markus Meringer
Venue: Journal of Graph Theory (1999)

The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this article an efficient algorithm to generate regular graphs with a given number of vertices and vertex degree is introduced. The method is based on orderly generation refined by criteria to avoid isomorphism checking and combined with a fast test for canonicity. The implementation allows computing even large classes of graphs, like construction of the 4-regular graphs on 18 vertices and, for the first time, the 5-regular graphs on 16 vertices. Also in cases with given girth, some remarkable results are obtained. For instance, the 5-regular graphs with girth 5 and minimal number of vertices were generated in less than 1 h. There exist exactly four (5, 5)-cages. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 30: 137&ndash;146, 1999
A testbed for cooperative multi cell algorithms
Authors: Carsten Jandura, Patrick Marsch, André Zoch, Gerhard P. Fettweis
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

In this paper, we describe the setup of a planned cellular testbed in downtown Dresden, Germany. It is developed by Technische Universit&auml;t Dresden in cooperation with various other project partners within the German research project EASY-C. Aim of the testbed is the development and evaluation of innovative physical layer algorithms for next generation mobile communications systems. While the testbed is based on a baseline implementation of the 3GPP LTE physical layer, the focus of the research will be on techniques beyond LTE, such as multi-cell signal processing (often referred to as network MIMO) and cooperative or non-cooperative relaying. These schemes are known to be suitable for inter-cell interference cancelation and to thus strongly improve the spectral efficiency and fairness of cellular systems in theory, but have so far not been evaluated in practise. The testbed will furthermore allow the development and evaluation of improved simulation methodology for next generation mobile communication systems. The authors explain the testbed infrastructure, the hardware architecture and the algorithms of interest.
Deductive verification of alternating systems
Authors: Matteo Slanina, Henny B. Sipma, Zohar Manna
Venue: Formal Aspects of Computing (2008)

Alternating systems are models of computer programs whose behavior is governed by the actions of multiple agents with, potentially, different goals. Examples include control systems, resource schedulers, security protocols, auctions and election mechanisms. Proving properties about such systems has emerged as an important new area of study in formal verification, with the development of logical frameworks such as the alternating temporal logic ATL*. Techniques for model checking ATL* over finite-state systems have been well studied, but many important systems are infinite-state and thus their verification requires, either explicitly or implicitly, some form of deductive reasoning. This paper presents a theoretical framework for the analysis of alternating infinite-state systems. It describes models of computation, of various degrees of generality, and alternating-time logics such as ATL* and its variations. It then develops a proof system that allows to prove arbitrary ATL* properties over these infinite-state models. The proof system is shown to be complete relative to validities in the weakest possible assertion language. The paper then derives auxiliary proof rules and verification diagrams techniques and applies them to security protocols, deriving a new formal proof of fairness of a multi-party contract signing protocol where the model of the protocol and of the properties contains both game-theoretic and infinite-state (parameterized) aspects.
Numerical discretization of a Darcy&#x2013;Forchheimer model
Authors: V. Girault, M. F. Wheeler
Venue: Numerische Mathematik (2008)

We solve a steady Darcy&#x2013;Forchheimer flow in a bounded region by means of piecewise constant velocities and nonconforming piecewise $${\mathbb{P}_1}$$ pressures. For the computation, we solve the nonlinearity by an alternating-directions algorithm and we decouple the computation of the velocity from that of the pressure by a gradient algorithm. We prove a priori error estimates of the scheme and convergence of the alternating-directions algorithm.
Bit-Error Rate Estimation for Bang-Bang Clock and Data Recovery Circuit in High-Speed Serial Links
Authors: Dongwoo Hong, Kwang-Ting(Tim) Cheng
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Clock and data recovery (CDR) circuits incorporating a bang-bang (BB) phase detector have been widely adopted in high-speed serial links due to their advantages in high speed implementations. However, the heavily non-linear nature of the BB phase detector makes the analysis of the CDR loop difficult. In this paper, we propose a new technique for accurate and efficient estimation of the bit-error rate (BER) for BB CDR circuits. The technique estimates the BER based on the spectral information of jitter and the jitter transfer characteristics of the BB CDR circuit. It eliminates the conventional BER measurement process and, thus, substantially accelerates the jitter tolerance test. In addition, this technique offers insights into the behavior of the non-linear CDR loop and the contribution of the jitter to the BER. We present simulation results that demonstrate the potential usefulness of the method.
Where all the interaction is: sketching in interaction design as an embodied practice
Authors: Jakob Tholander, Klas Karlgren, Robert Ramberg, Per Sökjer
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Sketching and design sketches are often recognized as key elements of successful interaction design practice and a central skill in interaction design expertise. Interaction design is a relatively young field without well-developed conventions, tools, and formalisms. We analyze the practical work and the conduct of interaction designers in how they express interaction and dynamics through whiteboard drawings. We focus on how talk and action were used to shape the meaning of the drawings. The ways the designers imagined that users would interact with the system and how it would mediate communication between users became topical through a web of drawings, talk, and embodied action. Our analysis forefronts three aspects of interaction design: 1) the role of the design material 2) the role of embodied action in interaction design, and 3) talk and embodied action as central means of doing design. We argue that the qualities of a design material need to be understood in relation to the activity in which it is taken into use and through the kinds of actions that the participants engage in. This implies that design representations do not carry meaning in themselves but are made meaningful through design activity.
Applicability of social weight theory to brain computer interfaces
Authors: K. Felix Navarro, E. Lawrence, D. Martin
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The multidisciplinary nature of Brain Computer Interfaces (BCIs) technologies demands scientists and researchers in the area to develop a homogeneous framework and classification of the existent BCI technologies in order to identify, facilitate and accelerate the natural incorporation of the state-of-the-art techniques from the different areas of knowledge. The researchers firstly discuss an extensive literature review and classification of BCI technologies based on Wolpaw's architecture. As the number of disabled people grows it is vital that researchers develop devices that assist in making the everyday life of such people more bearable. However when developing technologically advanced human computer interfaces researchers have often ignored the importance of the look and feel of the device. In this paper the researchers assess the importance of the Theory of Social Weight when considering BCIs.
FairTrust: Toward secure and high performance P2P networks
Authors: Haiying (Helen) Shen, Yingwu Zhu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Peer-to-Peer (P2P) networks are becoming increasingly popular and are an exciting new class of innovative, internet-based resource sharing systems. In a P2P network, a reputation system is essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest, and malicious peer behaviors. The system collects locally-generated peer feedbacks and aggregates them to yield the global reputation values to represent peer trustworthiness. Reputation system guides peers in choosing a server for services/resources. Most of the approaches for peers to exploit reputation metrics are to select the one with the highest reputation value as a providing server. However, it may lead to unexpectedly low efficiency for high-reputed peers, and prevents P2P networks from taking full advantage of all resources for high performance. Other approaches restrict a peer to select a server in the same or lower reputation values. However, these approaches prevent P2P networks from achieving their goal of widely resource sharing and service exchanges. In this paper, we introduce a trust-based fairness-oriented server selection policy, FairTrust, for a peer to choose anther peer to interact. FairTrust takes into account both reputation and capacity factors in server selection. It helps to create a secure P2P communication environment, and meanwhile to take full advantage of system resources for high performance by fair load distribution. Simulation results show the superiority of the FairTrust policy in achieving both high security and high performance in P2P networks in comparison with other related policies.
The complexity of finding medians
Authors: S. Toda
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

PF( Hash P) is characterized in a manner similar to M.W. Krentel's (1988) characterization of Pf(NP). If MidP is the class of functions that give the medians in the outputs of metric Turing machines, then it is shown that every function in PF( Hash P) is polynomial time 1-Turing reducible to a function in MidP and MidP contained in PF( Hash P); that is, PF( Hash P)=PF(MidP(1)). Intuitively, finding medians is as hard computationally as PF( Hash P); this forms a contrast to an intuitive interpretation of Krentel's result that finding maxima (or minima) is as hard as PF(NP). Several applications of the result are shown.
Virtual knowledge modelling for distributed teams: towards an interactive design approach
Authors: Ricardo Mejia-Gutierrez, Xavier Fischer, Fouad Bennis
Venue: International Journal of Networking and Virtual Organisations (2008)

A distributed framework for knowledge modelling in interactive design will be presented in this article. A multi-agent approach is proposed in order to support distributed partners in the creation of coherent models for engineering analysis. A granular modelling process is proposed to ensure a coherent construction of models and their analysis. It consists of a global and a local analysis based on a networked Product Life Cycle (PLC). A set of 'Tutor Agents' (TA) intends to guide each partner to extract relevant information from his/her technical domain while a 'Standardisation Process' (SP) is performed with supplied information to find potential redundancies. A coherent model is then obtained that is ready to be analysed by traditional inference engines such as optimisation solvers and constraint satisfaction programming. Furthermore, a case will be presented in order to clarify the framework. The results will enable design teams to integrate constraints from throughout the PLC in order to optimise the evolution of design concepts in distributed design.
Collaborative Semantic Authoring
Authors: Mathieu d'Aquin, Enrico Motta, Martin Dzbor, Laurian Gridinoc, Tom Heath, Marta Sabou
Venue: IEEE Intelligent Systems (2008)

In the context of the Semantic Web, notions of collaboration, interoperability, and reuse are intrinsically interrelated: interoperability implies reuse, which in turn can be seen as a form of collaboration. In this context, as we move from classic Web 2.0 to scenarios in which semantic content is central, our technologies need to change so that it becomes possible to create and exchange knowledge transparently, consistently with the openness of the Web. In this article, the authors examine different modalities for collaborative semantic authoring on the Web. To this purpose, they present three novel tools that correspond to different levels of interaction between the user and the created resources, as well as different levels of interoperation between various resources on the Semantic Web.
Photorealistic modeling of the growth of filamentous specimens
Authors: Jiří Sedlář, Jan Flusser, Michaela Sedlářová
Venue: EURASIP Journal on Advances in Signal Processing (2008)

We present a new method for modeling the development of settled specimens with filamentous growth patterns, such as fungi and oomycetes. In phytopathology, the growth parameters of such microorganisms are frequently examined. Their development is documented repeatedly, in a defined time sequence, leaving the growth pattern incomplete. This restriction can be overcome by reconstructing the missing images from the images acquired at consecutive observation sessions. Image warping is a convenient tool for such purposes. In the proposed method, the parameters of the geometric transformation are estimated by means of the growth tracking based on the morphological skeleton. The result is a sequence of photorealistic artificial images that show the development of the specimen within the interval between observations.
Techniques for cancellation of interfering multiple reflections in terahertz time-domain measurements
Authors: Ole Hirsch, Paul Alexander, Lynn F. Gladden
Venue: Microelectronics Journal (2008)

Algorithms are described which allow a significant reduction of the effects of multiple pulses, which originate from pulse reflections within terahertz (THz) emitters. The algorithms are based on models for the pulse propagation inside the emitter. Model parameters can be estimated from a calibration experiment using a reference signal in the absence of a sample. The parameters once estimated for a particular emitter device, can then be used to suppress the effects of multiple pulses in all measurements performed with the same emitter. The application of this method is demonstrated in the investigation of a disc sample and in the investigation of a paint layer.
Adaptive Classifier Selection System Using Context-driven Genetic Algorithm
Authors: Xi Wang, Phill Kyu Rhee
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Adaptation under changing environment is very important since advanced applications become pervasive and ubiquitous, and need to adaptive to their changing context. So we design this classifier selection system using context-driven genetic algorithm. Classifier selection is a combination scheme that can be used in a classification system. This kind of system can tolerate the dynamic of varying environments. It adopts the context and comparability analysis for picking out an optimal classifier. The proposed scheme using genetic algorithm which is based on context analysis is suitable for the varying environments' situations, we call this method context-driven genetic algorithm for short. The goal of this system is to select an optimal classifier from a group of candidate classifiers for the identified multiple possible clusters. It tries to distinguish the category of input environment and decides an optimal classifier.