ppxscal/embedding_network huggingface dataset:
Component development for the Java platform
Authors: Stuart Dabbs Halloway
Venue:  (2002)

Java is an object-oriented language, but it is also a component-oriented platform. Java's class-loading model and rich type information make it possible to build flexible and reusable binary components. Component Development for the JAVA Platform reveals both the potential and pitfalls of developing components using the Java platform.
Using the MCS-51 Microcontroller, 1st edition
Authors: Han-Way Huang
Venue:  (2000)

:This extensively detailed and comprehensive introduction to the Intel MCS-51 microcontroller covers both theoretical and design and implementation issues. The text begins with the MCS-51 CPU architecture and programming model and then discusses the details of the MCS-51 instruction set and assembly programming techniques. It goes on to cover the full spectrum of I/O functions of the MCS-51 variants, progressively developing topics from the simple to the complex; the author first deals with the general concept behind each I/O function, then discusses the specifics of the MCS-51. Numerous design examples and exercises illustrate the ideas presented, helping students to grasp key concepts and learn the applications. An ideal text for the first course in microprocessors or microcontrollers, Using the MCS-51 Microcontroller also includes extensive program and interfacing examples and is a helpful reference for practicing engineers. 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
Prefix-querying: an approach for effective subsequence matching under time warping in sequence databases
Authors: Sanghyun Park, Sang-Wook Kim, June-Suh Cho, Sriram Padmanabhan
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In our earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multi-dimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality.In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query processing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments. The results reveal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.
The Online Dating and Relating
Authors: Joe Schwartz
Venue:  (1999)

:The Complete Idiot's Guide to Online Dating and Relating shows you valuable information on all stages of online dating and different ways to find and use interest groups and messaging. All of the basic areas of online communicating are covered. Topics incluce a no-nonsense discussion of the resources available for dating and communicating online, simple explanations of the terminology of dating and relationships on the Internet, general dating advice about moving into the real world after life online, safety advice when exploring online relationships, and real life stories of online socializers. 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
Separation of coordination in a dynamic aspect oriented framework
Authors: M. Pinto, L. Fuentes, M. E. Fayad, J. M. Troya
Venue: Proceedings of the 1st international conference on Aspect-oriented software development (2002)

Aspect-Oriented Programming separates in a new dimension, named aspect, those features that are spread over different components in a system. In this paper we present a Dynamic AO Framework where software components and aspects are first-order entities composed dynamically at runtime according to the architectural information stored in middleware layer. As an example we describe the coordination aspect, one of the most relevant and useful aspects our approach, essential to develop open distributed systems The main functionality of this aspect is to encapsulate interaction protocol among a set of components.
Space, time, matter and things
Authors: Brandon Bennett
Venue: Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001 (2001)

I present a logical language for describing spatial, temporal and material properties of the physical world. The formalism is ontologically well-founded in the sense that it is interpreted with respect to model structures that have a specific physical interpretation in terms of the distribution of matter in space and time.
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Authors: Jérôme Amilhastre, Hélène Fargier, Pierre Marquis
Venue: Artificial Intelligence (2002)

Most of the algorithms developed within the Constraint Satisfaction Problem (CSP) framework cannot be used as such to solve interactive decision support problems, like product configuration. Indeed, in such problems, the user is in charge of assigning values to variables. Global consistency maintaining is only one among several functionalities that should be offered by a CSP-based platform in order to help the user in her task; other important functionalities include providing explanations for some user's choices and ways to restore consistency.
Detecting implied scenarios in message sequence chart specifications
Authors: Sebastian Uchitel, Jeff Kramer, Jeff Magee
Venue: Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering (2001)

Scenario-based specifications such as Message Sequence Charts (MSCs) are becoming increasingly popular as part of a requirements specification. Scenario describe how system components, the environment and users work concurrently and interact in order to provide system level functionality. Each scenario is a partial story which, when combined with other scenarios, should conform to provide a complete system description. However, although it is possible to build a set of components such that each component behaves in accordance with the set of scenarios, their composition may not provide the required system behaviour. Implied scenarios may appear as a result of unexpected component interaction. In this paper, we present an algorithm that builds a labelled transition system (LTS) behaviour model that describes the closest possible implementation for a specification based on basic and high-level MSCs. We also present a technique for detecting and providing feedback on the existence of implied scenarios. We have integrated these procedures into the Labelled Transition System Analyser (LTSA), which allows for model checking and animation of the behaviour model.
X Protocol Reference Manual, 4th edition
Authors: Adrian Nye
Venue:  (1994)

:Volume 0, X Protocol Reference Manual describes the X Network Protocol, which underlies all software for Version 11 of the X Window System. This fourth edition is updated for R6 and can be used with any release of X. Contents are divided into three parts: Part One provides a conceptual introduction to the X Protocol. It describes the role of the server and client and demonstrates the network transactions that take place during a minimal client session. Part Two contains an extensive set of reference pages for each protocol request and event. It is a reformatted and reorganized version of the X Consortium's Protocol specification. All material from the original document is present in this manual, and the material in the reference pages is reorganized to provide easier access. Each protocol request or event is treated as a separate, alphabetized reference page. Reference pages include the encoding of requests and replies. Part Three consists of several appendices describing particular parts of the X Protocol, along with several reference aids. Note: This fourth edition does not contain the Inter-Client Communication Conventions Manual (ICCCM) or the X Logical Font Description Convention (XLFD). This material will be included in an upcoming O'Reilly book.
SPFD-based global rewiring
Authors: Jason Cong, Yizhou Lin, Wangning Long
Venue: Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays (2002)

This paper presents the theory and algorithm for SPFD-based global rewiring (SPFD-GR). SPFD-GR allows us to globally replace a target wire with some alternative wire possibly far away from the target. It successfully overcomes the limitations of the existing SPFD-based local rewiring algorithm (SPFD-LR), which can only replace a wire with another wire that has the same destination node. In order to perform SPFD-based global rewiring, we developed the theory and algorithm for solving a fundamental problem in SPFD-based rewiring: Given the in-pin functions of a node and the SPFD at the node's out-pin, is there a way to modify the node's internal function so that the SPFD at the node's out-pin can be satisfied? Combined with a state-of-the-art partitioning algorithm, SPFD-GR scales well to large circuits with good synthesis quality. Our SPFD-based rewiring algorithm is ideal for LUT-based FPGAs, where the node's internal function can be changed freely without any area or delay penalty. Extensive experimental results show that for LUT-based FPGAs, the rewiring ability of SPFD-GR (in terms of the number of wires that have alternative wires) is 1.45, and 3 times that of SPFD-LR and an ATPG-based rewiring algorithm (with a preliminary experimental flow), respectively, while the run time is quite acceptable. When applied to the post-mapping area reduction for large LUT-based FPGAs under circuit depth restriction, SPFD-GR achieves 17.1% average area reduction, with no or little delay increase.
Legal Knowledge Representation: Automatic Text Analysis in Public International and European Law
Authors: Erich Schweighofer
Venue:  (1999)

:This volume is a presentation of all methods of legal knowledge representation from the point of view of jurisprudence as well as computer science. A new method of automatic analysis of legal texts is presented in four case studies.
Hands-on MS Win NT 4.0 Workstation W/ Projects for Server and Network Administrators, 1st edition
Authors: Michael Palmer
Venue:  (2000)

:Through project oriented approach, step-by-step instruction, real-world examples and cases text teaches individuals Win NT 4.0 Workstation from network administrator's perspective.
Outlook 2000 for Windows: Visual QuickStart Guide
Authors: Michael J. Young
Venue:  (1999)

:With Outlook 2000, Microsoft Office's desktop information manager, you can organize your business and personal life, share information through your company network or across the Internet, and collaborate on group projectsall from one place. Just as Outlook makes workplace collaboration easier and more productive, Outlook 2000 for Windows: Visual QuickStart Guide is the quickest and most efficient way to learn this productivity-boosting app. Outlook 2000: VQS takes a comprehensive, task-based approach that starts with a big-picture overview, then covers the most important features of the program with straightforward, step-by-step instructions and plentiful screenshots. You'll learn how to send and organize email and faxes, keep a calendar and schedule meetings with colleagues, store contact information and use it to send messages from Outlook, keep track of your personal to-do list and manage group projects, create and store sticky notes, and share all of the above with others. Platform: WIN
Internet Directory for Dummies with Cdrom, 1st edition
Authors: Brad Hill
Venue:  (1997)

:With concise reviews and an easy-to-read design, Internet Directory For Dummies takes the hassle out of Web surfing by listing the best sites on the World Wide Web. Net-savvy author Brad Hill shows you the best sites for news, sports, entertainment, shopping, and much more. And to make your Web browsing even easier, the bonus CD contains the URLs for every Web site reviewed in this book, so you're only a double-click away from the best info on the Net! Inside, find helpful advice that lets you Search for cool Web sites with the informative Micons (mini icons) Discover funny and unusual corners of the Web Find Internet resources that are fun and safe for the whole family Discover the best places to go for information on sports Access information on your favorite hobbies and pastimes Get up-to-the-minute news and weather from around the world
11 Genetic Gateways to Spiritual Awakening
Authors: Leonard Ira Sweet
Venue:  (1998)

:This is the first theological book linked directly to a Web site, one that picks up the book's ideas and takes the reader into a deeper and broader search for knowledge and understanding. In 11 Genetic Gateways to Spiritual Awakening the reader will discover how the core themes of the Wesleyan revival hold the key to reinvigorated mission and ministry for the church today. Sweet points out that many of the essential practices and emphases of that revival - such as innovative use of new communication technologies - may be even more appropriate to the century we are entering than the one in which they began. The point is that Wesleyans and non-Wesleyans alike can find irreplaceable tools for the church's ministry to the world.
Studying transition dynamics via focusing on underlying feedback interactions
Authors: Gönenç Yücel, Catherine Miluska Chiong Meza
Venue: Computational Mathematical Organization Theory (2008)

The emerging need for societal transitions raises the need for a better understanding of the dynamic nature of large scale societal systems, and therefore the development of an analytical approach for drawing dynamic conclusions based on system's dynamic mechanisms, feedback relationships and interacting components.The objective of this study is to explore the degree to which System Dynamics as an approach enhances the process of understanding transition dynamics in socio-technical systems. In other words, it is aimed to reveal the type of insights that can be developed about such systems and their dynamic behaviour using the approach, as well as the shortcomings of the approach in this challenging task. In order to do so, a modeling study aiming to understand the underlying mechanisms of the waste management transition in the Netherlands is conducted.The quantitative model developed is based on the historical case of the waste management transition of the Netherlands, and it portrays issues as the dynamics of actors' preferences, development of infrastructure and environmental consequences of dominant mode of functioning and provides an instance for demonstrating and evaluating the feedback-focused perspective discussed in this paper.Finally, the paper discusses a set of points regarding the utilized approach, System Dynamics, observed during this study both in general and in the specific context of transitions. In short, System Dynamics stands as a promising approach mainly due to its strength in explaining the source of complex dynamics based on interacting feedback loops, but it also has certain drawbacks in the context of transitions.
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
Authors: Amir Beck, Marc Teboulle
Venue: Mathematical Programming: Series A and B (2009)

We consider the nonconvex problem (RQ) of minimizing the ratio of two nonconvex quadratic functions over a possibly degenerate ellipsoid. This formulation is motivated by the so-called regularized total least squares problem (RTLS), which is a special case of the problem&#x2019;s class we study. We prove that under a certain mild assumption on the problem&#x2019;s data, problem (RQ) admits an exact semidefinite programming relaxation. We then study a simple iterative procedure which is proven to converge superlinearly to a global solution of (RQ) and show that the dependency of the number of iterations on the optimality tolerance $$\varepsilon$$grows as $$O(\sqrt{\ln \varepsilon^{-1}})$$.
Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm
Authors: Petr Jančar
Venue: Information and Computation (2008)

The proceedings of FOCS'98 contain a paper by Zakariae Bouziane, who sketches a new representation of the Petri net reachability problem and claims to provide a new algorithm solving the problem. In this note, the essence of Bouziane's approach is explained, and a serious flaw of the algorithm is exposed.
Inter-frame Change Directing Online Clustering of Multiple Moving Objects for Video-Based Sensor Networks
Authors: Guangyan Huang, Jing He, Zhiming Ding
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 (2008)

Recognition of multiple moving objects is a very important task for achieving user-cared knowledge to send to the base station in wireless video-based sensor networks. However, video based sensor nodes, which have constrained resources and produce huge amount of video streams continuously, bring a challenge to segment multiple moving objects from the video stream online. Traditional efficient clustering algorithms such as DBSCAN cannot run time-efficiently and even fail to run on limited memory space on sensor nodes, because the number of pixel points is too huge. This paper provides a novel algorithm named Inter-Frame Change Directing Online clustering (IFCDO clustering) for segmenting multiple moving objects from video stream on sensor nodes. IFCDO clustering only needs to group inter-frame different pixels, thus it reduces both space and time complexity while achieves robust clusters the same as DBSCAN. Experiment results show IFCDO clustering excels DBSCAN in terms of both time and space efficiency.
A Self-stabilizing $\frac{2}{3}$-Approximation Algorithm for the Maximum Matching Problem
Authors: Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil
Venue: Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2008)

The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and self-stabilizing literature. Previous work has resulted in self-stabilizing algorithms for computing a maximal ($\frac{1}{2}$-approximation) matching in a general graph, as well as computing a $\frac{2}{3}$-approximation on more specific graph types. In the following we present the first self-stabilizing algorithm for finding a $\frac{2}{3}$-approximation to the maximum matching problem in a general graph. We show that our new algorithm stabilizes in at most exponential time under a distributed adversarial daemon, and O(n 2) rounds under a distributed fair daemon, where n is the number of nodes in the graph.
Contact and directional radiative temperature measurements of sunlit and shaded land surface components during the SEN2FLEX 2005 campaign
Authors: J. Timmermans, C. van der Tol, W. Verhoef, Z. Su
Venue: International Journal of Remote Sensing (2008)

Evapotranspiration models require thermodynamic temperatures as a state variable characterizing the surface energy balance. The thermodynamic temperature is calculated using the brightness temperature and the emissivity because no effective method exists to measure thermodynamic temperatures in space and time. A method was therefore developed to measure thermodynamic temperatures in time using contact probes and spatial variations of the thermodynamic temperature using a thermal camera. Using an extraction scheme, the brightness temperatures of canopy and soil were extracted from the thermal images and compared with the contact temperatures. The contact temperatures had similar amplitudes and time-variability as the brightness temperatures for both components. The slope and offset parameters of a scatter plot were calculated. The slope of the scatter plot was lower than unity for canopy, and higher than unity for soil. Because of the spread in the scatter plot, the emissivities of the components could not be calculated. We conclude that kinematic temperature measurements by contact probes can be a valuable extension to current techniques for measuring continuous component temperatures. The extraction scheme could be a useful tool for extracting the component brightness temperatures for low-resolution imagery.
Criterion in selecting the clustering algorithm in radial basis functional link nets
Authors: Ang Sau Loong, Ong Hong Choon, Low Heng Chin
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

K-means and k-median clustering algorithms can help in the selection of centres for the Radial Basis Functional Link Nets. Radial Basis Functional Link Nets is used to classify the data. In this paper, we will show the importance of knowing the skewness of the data in deciding to choose between k-means or k-median clustering algorithm in finding the centre of Radial Basis Functional Link Nets and we will also show that this initial selection criterion will result in the improvement of efficiency in terms of speed and accuracy in data classification. Two sets of real data are used to demonstrate our results.
A measurement study of a commercial-grade urban wifi mesh
Authors: Vladimir Brik, Shravan Rayanchu, Sharad Saha, Sayandeep Sen, Vivek Shrivastava, Suman Banerjee
Venue: Proceedings of the 8th ACM SIGCOMM conference on Internet measurement (2008)

We present a measurement study of a large-scale urban WiFi mesh network consisting of more than 250 Mesh Access Points (MAPs), with paying customers that use it for Internet access. Our study, involved collecting multi-modal data, e.g., through continuous gathering of SNMP logs, syslogs, passive traffic capture, and limited active measurements in different parts of the city. Our study is split into four components - planning and deployment of the mesh, success of mesh routing techniques, likely experience of users, and characterization of how the mesh is utilized. During our data collection process that spanned 8 months, the network changed many times due to hardware and software upgrades. Hence to present a consistent view of the network, the core dataset used in this paper comes from a two week excerpt of our dataset. This part of the dataset had more than 1.7 million SNMP log entries (from 224 MAPs) and more than 100 hours of active measurements. The scale of the study allowed us to make many important observations that are critical in planning and using WiFi meshes as an Internet access technology. For example, our study indicates that the last hop 2.4GHz wireless link between the mesh and the client is the major bottleneck in client performance. Further we observe that deploying the mesh access points on utility poles results in performance degradation for indoor clients that receive poor signal from the access points.