ppxscal/embedding_network huggingface dataset:
Robust window-based multi-node technology-independent logic minimization
Authors: Jeff L. Cobb, Kanupriya Gulati, Sunil P. Khatri
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Multi-node optimization using Boolean relations is a powerful approach for network minimization. In this paper, we present an algorithm to perform Boolean relation-based multi-node optimization using a robust, fast and memory efficient algorithm. In particular, we simultaneously optimize two nodes at a time. The robustness of our approach arises from the use of a window-based technique for computing these Boolean relations. Secondly, we perform early quantification during the computation, keeping memory utilization low. Finally, we employ smart heuristics for selecting the node pair to be optimized simultaneously. These features allow the approach to scale well and provide good results for large designs. We perform experiments on a set of large benchmarks and compare our algorithm's performance to a recent SAT-based network optimization technique using complete don't cares. On average, we achieve a 15% reduction in literal count across all the large designs, compared to the complete don't care-based method while maintaining small runtimes and low memory usage.
Computational complexity of computing a partial solution for the Graph Automorphism problems
Authors: Takayuki Nagoya, Seinosuke Toda
Venue: Theoretical Computer Science (2009)

It is known that a nontrivial automorphism on a given graph is computed by using any oracle that computes a pair of vertices (u,v) such that u is mapped to v by some nontrivial automorphism. In this paper, we consider a weaker oracle acting as follows. For a given graph, the oracle returns a pair (v,b) of a vertex v and a bit b@?{0,1} with the promise that if it returns (v,0), then the vertex v is fixed by some nontrivial automorphism, but if it returns (v,1), then the vertex v is moved by some nontrivial automorphism, provided that the given graph has a nontrivial automorphism. We here note that the oracle may return an arbitrary pair as its answer in case that the given graph has no nontrivial automorphism. We then show a stronger result that such an oracle is still powerful enough to compute a nontrivial automorphism. We also show that a similar result holds for RightGA, a GA-complete problem. We further investigate the computational complexity of computing a partial solution for PrefixGA which is known to be GI-complete. For this problem, we show that, when we consider any oracle similar to one mentioned above, the oracle does not help us to solve PrefixGA unless GI @?"T^p GA.
Digital communications on cable systems
Authors: William F. Utlaut Peter M. McManamon Hubert J. Schlafly, Friend Skinner, S. S. Tyler
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Three technologies---digital transmission, computers, and cable systems---offer opportunities to meet the growing and diverse needs for high volume and rate of data and information transfer required by society for business, education, entertainment and crime reduction. Panelists will discuss technical and economic factors, and their priorities, associated with integrating these technologies, and others, to provide services such as electronic mail, banking, retail marketing, work and learning at home, surveillance and others.
The Psychic-Skeptic Prediction framework for effective monitoring of DBMS workloads
Authors: Said Elnaffar, Patrick Martin
Venue: Data Knowledge Engineering (2009)

Self-optimization is one of the defining characteristics of an autonomic computing system. For a complex system, such as the database management system (DBMS), to be self-optimizing it should recognize properties of its workload and be able to adapt to changes in these properties over time. The workload type, for example, is a key to tuning a DBMS and may vary over the system's normal processing cycle. Continually monitoring a DBMS, using a special tool called Workload Classifier, in order to detect changes in the workload type can inevitably impose a significant overhead that may degrade the overall performance of the system. Instead, the DBMS should selectively monitor the workload during some specific periods recommended by the Psychic-Skeptic Prediction (PSP) framework that we introduce in this work. The PSP framework allows the DBMS to forecast major shifts in the workload by combining off-line and on-line prediction methods. We integrate the Workload Classifier with the PSP framework in order to come up with an architecture by which the autonomous DBMS can tune itself efficiently. Our experiments show that this approach is effective and resilient as the prediction framework adapts gracefully to changes in the workload patterns.
Recognition of gestures in Pakistani sign language using fuzzy classifier
Authors: Sumaira Kausar, M. Younus Javed, Shaleeza Sohail
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

Automatic recognition of sign language can be used as an efficient mean of communication with deaf people. In this paper, a fuzzy classifier to recognize alphabets of Pakistani sign language is proposed. In the proposed method, colored gloves are used to identify each finger-tip and joint. Angle between finger tip and corresponding finger joint is calculated and used to identify the position of each finger and then these positions are used to recognize the alphabet of sign language. Angles are provided as input to fuzzy inference system and then system identifies the position of each finger and on the basis of these positions defuzzification is performed. Results have shown that accuracy rate of the proposed system is quite high; only two signs out of thirty seven could not be recognized by the system correctly; all other 35 signs have been recognized accurately.
Development of techniques for sketched diagram recognition
Authors: Rachel Blagojevic, Beryl Plimmer, John Grundy, Yong Wang
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Recognition enables us to turn ordinary sketches into formal diagrams and executable models. However the accuracy of recognition techniques must be improved before we can gain any real value. We believe a formal analysis of features and algorithms will help us to construct more robust and flexible recognition engines for hand drawn diagrams.
Output tracking of constrained nonlinear processes with offset-free input-to-state stable fuzzy predictive control
Authors: Tiejun Zhang, Gang Feng, Xiao-Jun Zeng
Venue: Automatica (Journal of IFAC) (2009)

This paper develops an efficient offset-free output feedback predictive control approach to nonlinear processes based on their approximate fuzzy models as well as an integrating disturbance model. The estimated disturbance signals account for all the plant-model mismatch and unmodeled plant disturbances. An augmented piecewise observer, constructed by solving some linear matrix inequalities, is used to estimate the system states and the lumped disturbances. Based on the reference from an online constrained target generator, the fuzzy model predictive control law can be easily obtained by solving a convex semi-definite programming optimization problem subject to several linear matrix inequalities. The resulting closed-loop system is guaranteed to be input-to-state stable even in the presence of observer estimation error. The zero offset output tracking property of the proposed control approach is proved, and subsequently demonstrated by the simulation results on a strongly nonlinear benchmark plant.
A fuzzy guided multi-objective evolutionary algorithm model for solving transportation problem
Authors: H. C. W. Lau, T. M. Chan, W. T. Tsui, F. T. S. Chan, G. T. S. Ho, K. L. Choy
Venue: Expert Systems with Applications: An International Journal (2009)

In the field of supply chain management and logistics, using vehicles to deliver products from suppliers to customers is one of the major operations. Before transporting products, optimizing the routing of vehicles is required so as to provide a low-cost and efficient service for customers. This paper deals with the problem of optimization of vehicle routing in which multiple depots, multiple customers, and multiple products are considered. Since the total traveling time is not always restrictive as a time constraint, the objective considered in this paper comprises not only the total traveling distance, but also the total traveling time. We propose using a multi-objective evolutionary algorithm called the fuzzy logic guided non-dominated sorting genetic algorithm 2 (FL-NSGA2) to solve this multi-objective optimization problem. The role of fuzzy logic is to dynamically adjust the crossover rate and mutation rate after ten consecutive generations. In order to demonstrate the effectiveness of FL-NSGA2, we compared it with the following: non-dominated sorting genetic algorithms 2 (NSGA2) (without the guide of fuzzy logic), strength Pareto evolutionary algorithm 2 (SPEA2) (with and without the guide of fuzzy logic), and micro-genetic algorithm (MICROGA) (with and without the guide of fuzzy logic). Simulation results showed that FL-NSGA2 outperformed other search methods in all of three various scenarios.
A Case for Hybrid Content Distribution for Interactive Video-on-Demand
Authors: Andrew MacQuire, Andrew Brampton, Nicholas J. P. Race, Laurent Mathy, Michael Fry
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

With the advent of numerous video distribution services, Content Distribution Networks (CDNs) are under increasing demand. Given the associated expenses, many organisations have made use of Peer-to-Peer (P2P) approaches to offset bandwidth costs. Unfortunately, using clients as part of the delivery process can vastly increase load on service providers' networks. Furthermore, many approaches thus far lack the ability for interactive, on-demand viewing. For these reasons, this paper considers how 'hybrid' methods could alleviate these issues, through simulations of delivery methodologies in a CDN context. As it is unlikely that any one method will suffice for all content, network and audience types, a successful system should adapt in response to changes, as outlined in this paper.
A framework for low energy data management in reconfigurable multi-context architectures
Authors: M. Sanchez-Elez, N. Bagherzadeh, R. Hermida
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2009)

In this paper, we present an approach to the problem of low energy data scheduling for reconfigurable architectures targeting digital signal processing (DSP) and multimedia applications. The main goal is the reduction of the energy consumed by these applications through the integration of the proposed data management framework within a compilation tool specifically conceived for these architectures. Two levels of on-chip data storage are assumed to be available in the reconfigurable architecture. Then, the data manager tries to optimally exploit this storage hierarchy by saving data transfers among on-chip and external memories, so reducing the energy consumption. To do that, specific algorithms for finding the data shared among the different computation kernels of the application have been developed. Also, a data placement and replacement policy has been designed. We also show how an adequate data scheduling could decrease the number of operations required to implement the dynamic reconfiguration of the system.
Photomodulated transmittance of GaBiAs layers grown on (001) and (311)B GaAs substrates
Authors: R. Kudrawiec, P. Poloczek, J. Misiewicz, M. Shafi, J. Ibáñez, R. H. Mari, M. Henini, M. Schmidbauer, S. V. Novikov, L. Turyanska, S. I. Molina, D. L. Sales, M. F. Chisholm
Venue: Microelectronics Journal (2009)

In this work, photomodulated transmittance (PT) has been applied to investigate the energy gap of GaBiAs layers grown on (001) and (311)B GaAs substrates. In PT spectra, a clear resonance has been observed below the GaAs edge. This resonance has been attributed to the energy gap-related absorption in GaBiAs. The energy and broadening of PT resonances have been determined using a standard approach in electromodulation spectroscopy. It has been found that the crystallographic orientation of GaAs substrate influences on the incorporation of Bi atoms into GaAs and quality of GaBiAs layers. The Bi-related energy gap reduction has been determined to be ~90meV per percent of Bi. In addition to PT spectra, common transmittance spectra have been measured and the energy gap of GaBiAs has been determined from the square of the absorption coefficient &alpha;2 around the band-gap edge. It has been found that the tail of density of states is significant for GaBiAs and influences the accuracy of energy gap determination from the &alpha;2 plot. In the case of PT spectra, the energy gap is determined unambiguously since this technique is directly sensitive to singularities in the density of states.
2-rainbow domination of generalized Petersen graphs P(n,2)
Authors: Chunling Tong, Xiaohui Lin, Yuansheng Yang, Meiqin Luo
Venue: Discrete Applied Mathematics (2009)

Assume we have a set of k colors and we assign an arbitrary subset of these colors to each vertex of a graph G. If we require that each vertex to which an empty set is assigned has in its neighborhood all k colors, then this assignment is called the k-rainbow dominating function of a graph G. The corresponding invariant @c"r"k(G), which is the minimum sum of numbers of assigned colors over all vertices of G, is called the k-rainbow domination number of G. Bresar and S@?umenjak [B. Bresar, T.K. S@?umenjak On the 2-rainbow domination in graphs, Discrete Applied Mathematics, 155 (2007) 2394-2400] showed that @?4n5@?@?@c"r"2(P(n,2))@?@?4n5@?+@a, where @a=0 for n=3,9mod10 and @a=1 for n=1,5,7 mod 10. And they raised the question: Is @c"r"2(P(2k+1,k))=2k+1 for all k>=2? In this paper, we put forward the answer to the question. More over, we show that @c"r"2(P(n,2))=@?4n5@?+@a, where @a=0 for n=0,3,4,9mod10 and @a=1 for n=1,2,5,6,7,8mod10.
Numerical treatment of Bayesian robustness problems
Authors: Bruno Betrò
Venue: International Journal of Approximate Reasoning (2009)

The problem of analyzing the robustness of Bayesian procedures with respect to the prior has been considered to some extent in the last years. In spite of this, robustness analysis has not yet entered into routine Bayesian analysis, mainly because of the inadequate development of numerical algorithms and related software. When the prior belongs to a class defined in terms of the so called generalized moment conditions, it has been shown that the problem can be reduced to one of linear semi-infinite programming (LSIP). A new way of performing such a reduction is presented here aimed at providing proper scaling of the functions defining the problem and keeping into account their possible unboundedness. An algorithm for solving LSIP problems under rather mild assumptions, as required by the typical presence of indicator functions in the generalized moment conditions, has been previously developed by the author and its applicability to Bayesian robustness is discussed here. The algorithm, called accelerated central cutting plane (ACCP) algorithm, is also numerically illustrated by an example.
Geographic privacy-aware knowledge discovery and delivery
Authors: Fosca Giannotti, Dino Pedreschi, Yannis Theodoridis
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

A flood of data pertinent to moving objects is available today, and will be more in the near future, particularly due to the automated collection of privacy-sensitive telecom data from mobile phones and other location-aware devices. Such wealth of data, referenced both in space and time, may enable novel classes of applications of high societal and economic impact, provided that the discovery of consumable and concise knowledge out of these raw data is made possible. Recent research activities have developed theory, techniques and systems for geographic knowledge discovery and delivery, some of them based on privacy-preserving methods for extracting knowledge from large amounts of raw data referenced in space and time. All these efforts aim at devising knowledge discovery and analysis methods for trajectories of moving objects. The fundamental hypothesis is that it is possible, in principle, to aid citizens in their mobile activities by analysing the traces of their past activities by means of data mining techniques. For instance, behavioural patterns derived from mobile trajectories may allow inducing traffic flow information, capable to help people travel efficiently, to help public administrations in traffic-related decision making for sustainable mobility and security management, as well as to help mobile operators in optimising bandwidth and power allocation on the network. On the other hand, it is clear that the use of personal sensitive data arouses concerns about citizen's privacy rights. In this tutorial, we establish a framework for the challenges and the mining solutions for the geographic information collected by Moving Object Database (MOD) engines. We first discuss the challenges of collecting mobility data, and elaborate on the impact of trajectory data analysis in several modern applications. We then discuss methodologies and techniques to collect raw data, reconstruct trajectory information, and efficiently store it in MODs. We continue with an overview of knowledge discovery approaches for movement data. Finally, we propose a research agenda and identify areas where interdisciplinary studies are needed.
Research of Trace Equivalence Relation on XTR
Authors: Yong Li, Xiang-li Zhang, Long He, Zhi-heng Xie, Chong Zhu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

The trace equivalence relation is analyzed and proved by the property of cyclic group, and the XTR security decreasing caused by the equivalence relation is discussed. To cope with this problem, an improved algorithm was proposed to eliminate the equivalence relation effectively. The improved algorithm is compatible with the old speedup algorithm. Furthermore, the algorithm is more effective to improve the degree of XTR security. In the last, the algorithm is used in an improved signature scheme with Message Recovery, and the computation and communication cost are analyzed. The results show that the computation cost is on average more half than the old, but the communication cost only need an additional parameter.
Dynamic context management for low power coarse-grained reconfigurable architecture
Authors: Yoonjin Kim, Rabi N. Mahapatra
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Coarse-grained reconfigurable architectures (CGRA) require many processing elements (PEs) and a configuration memory unit (configuration cache) for reconfiguration of its PE array. Al-though this structure is meant for high performance and flexibility, it consumes significant power. Specially, power consumption by configuration cache is explicit overhead compared to other types of IP cores. Reducing power in configuration cache is very crucial for CGRA to be more competitive and reliable processing core in embedded systems. In this paper, we propose a dynamic context management strategy for power saving in configuration cache. This power-efficient approach works without degrading the per-formance and flexibility of CGRA. Experimental results show that the proposed approach saves 38.24%/38.15% of the power in write/read-operation of configuration cache with negligible area overhead compared to the previous design.
A reasoning agent for credit card fraud using the event calculus
Authors: Clive Blackwell
Venue: International Journal of Electronic Security and Digital Forensics (2009)

We illustrate the design of an intelligent agent to aid a merchant to limit fraudulent payment card purchases over the internet. This is important because increasing fraud may limit the rise of electronic-commerce, and difficult because of the uncertainty in identifying and authenticating people remotely. The agent can advise the merchant what actions to take to reduce risk without complete knowledge of the circumstances. It can also negotiate flexibly to conclude transactions successfully that would otherwise be rejected. We use the event calculus to model the transaction system including the participants and their actions. The idea has applications in other distributed systems where incomplete knowledge of a system may be exploited by adversaries to their advantage.
Complete Fairness in Multi-party Computation without an Honest Majority
Authors: S. Dov Gordon, Jonathan Katz
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study of complete fairness in the multi-party case and demonstrate the first completely-fair protocols for non-trivial functions in this setting. We also provide evidence that achieving fairness is "harder" in the multi-party setting, at least with regard to round complexity.
Visualizing the runtime behavior of embedded network systems: A toolkit for TinyOS
Authors: Andrew R. Dalton, Sally K. Wahba, Sravanthi Dandamudi, Jason O. Hallstrom
Venue: Science of Computer Programming (2009)

TinyOS is an effective platform for developing lightweight embedded network applications. But the platform's lean programming model and power-efficient operation come at a price: TinyOS applications are notoriously difficult to construct, debug, and maintain. The development difficulties stem largely from a programming model founded on events and deferred execution. In short, the model introduces non-determinism in the execution ordering of primitive actions - an issue exacerbated by the fact that embedded network systems are inherently distributed and reactive. The resulting set of possible execution sequences for a given system is typically large and can swamp developers' unaided ability to reason about program behavior. In this paper, we present a visualization toolkit for TinyOS 2.0 to aid in program comprehension. The goal is to assist developers in reasoning about the computation forest underlying a system under test and the particular branches chosen during each run. The toolkit supports comprehension activities involving both local and distributed runtime behavior. The constituent components include (i) a full-featured static analysis and instrumentation library, (ii) a selection-based probe insertion system, (iii) a lightweight event recording service, (iv) a trace extraction and reconstruction tool, and (v) three visualization front-ends. We demonstrate the utility of the toolkit using both standard and custom system examples and present an analysis of the toolkit's resource usage and performance characteristics.