ppxscal/embedding_network huggingface dataset:
Communication in wireless networks with directional antennas
Authors: Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We study the problem of maintaining connectivity in a wireless network where the network nodes are equipped with directional antennas. Nodes correspond to points on the plane and each uses a directional antenna modeled by a sector with a given angle and radius. The connectivity problem is to decide whether or not it is possible to orient the antennas so that the directed graph induced by the node transmissions is strongly connected. We present algorithms for simple polynomial-time-solvable cases of the problem, show that the problem is NP-complete in the $2$-dimensional case when the sector angle is small, and present algorithms that approximate the minimum radius to achieve connectivity for sectors with a given angle. We also discuss several extensions to related problems. To the best of our knowledge, the problem has not been studied before in the literature.
Sparse matrix computations on manycore GPU's
Authors: Michael Garland
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Modern microprocessors are becoming increasingly parallel devices, and GPUs are at the leading edge of this trend. Designing parallel algorithms for manycore chips like the GPU can present interesting challenges, particularly for computations on sparse data structures. One particularly common example is the collection of sparse matrix solvers and combinatorial graph algorithms that form the core of many physical simulation techniques. Although seemingly irregular, these operations can often be implemented with data parallel operations that map very well to massively parallel processors.
The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions (Art of Computer Programming), 1 edition
Authors: Donald E. Knuth
Venue:  (2008)

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuths writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.Volume 4, Fascicle 0This fascicle introduces what will become by far the longest chapter in The Art of Computer Programming, a chapter on combinatorial algorithms that will itself fill three full-sized volumes. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs. Combinatorial patterns or arrangements solve vast numbers of practical problems, and modern approaches to dealing with them often lead to methods that are more than a thousand times faster than the straightforward procedures of yesteryear. This fascicle primes the pump for everything that follows in the chapter, discussing first the essential ideas of combinatorics and then introducing fundamental ideas for dealing efficiently with 0s and 1s inside a machine, including Boolean basics and Boolean function evaluation. As always, the authors exposition is enhanced by hundreds of new exercises, arranged carefully for self-instruction, together with detailed answers.
Demonstrating remote operation of industrial devices using mobile phones
Authors: Daniel Görlich, Peter Stephan, Jan Quadflieg
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In the SmartFactoryKL, the intelligent factory of the future, a consortium of companies and research facilities explores new, intelligent technologies. Being a development and demonstration center for industrial applications, the SmartFactoryKL is arbitrarily modifiable and expandable (flexible), connects components from multiple manufacturers (networked), enables its components to perform context-related tasks autonomously (self-organizing), and emphasizes user-friendliness (user-oriented). In this paper, we present a prototypical system that enables commercial mobile phones to monitor, diagnose, and remotely control plant components via Bluetooth.
Detecting Suspicious Relational Database Queries
Authors: Stefan Böttcher, Rita Hartel, Matthias Kirschner
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Whenever secret information has been shared among multiple partners and has been illegally leaked to a third party, it is important for the trust among the partners to identify the information leak. We present a forensic approach to privacy violation control that after information has been leaked identifies those partners that had access to the leaked information. Our approach represents secret information as a boolean formula and compares it with the queries and the relational database state to which the queries were applied. We use this technique to identify suspicious queries, i.e., queries that have got sufficient information to infer secret information that has been leaked. Furthermore, we prove that checking where a select-project query is suspicious with respect to a given secret information is NP-complete, but a polynomial time solution exists for interesting subclasses.
Haze removal for high-resolution satellite data: a case study
Authors: G. Dal Moro, L. Halounova
Venue: International Journal of Remote Sensing (2007)

In the framework of a land cover study of a reclamation area, a high-resolution IKONOS scene characterized by an extremely non-homogenous haze cover was processed in order to reduce haze and calculate some vegetation indices (VIs). Haze removal was performed by means of a technique based on the haze optimized transform (HOT). As HOT is also sensitive to components other than haze, with respect to the original procedure we introduced a second step in which the haze component estimated from HOT was masked both for water bodies (as in the original approach) and urban features (responsible for high HOT values). Interpolation was finally performed in order to reconstruct haze in such areas. Dark-object subtraction (DOS) was then performed on the dehazed scene in order to estimate approximate soil reflectances necessary to calculate VIs. Their calculation for original and dehazed data illustrates the beneficial effects of the haze removal process and shows that, in the case of severe haze cover, even so-called atmospherically resistant VIs require a preliminary haze removal procedure.
Exact algorithms and software in optimization and polyhedral computation
Authors: Komei Fukuda
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

In this tutorial, we present a new field of research on implementing exact algorithms in optimization and polyhedral computation in exact (arbitrary precision) arithmetic. Such algorithms including those to solve linear programming and convex hull problems have been implemented mostly with floating-point arithmetic. This new field of developing "exact software" in optimization and polyhedral computation is now at the second stage where new mathematical tools relying on optimization and polyhedral codes are being developed that have not been implemented before. This tutorial is not meant to cover all important developments but to look at some interesting facets.
On tests to detect via opens in digital CMOS circuits
Authors: Sudhakar M. Reddy, Irith Pomeranz, Chen Liu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We consider voltage based (logic) tests to detect complete opens in digital CMOS circuits. Open defects are known to be prevalent in the current VLSI technologies and vias are known to be the primary sites of interconnect opens. The voltage on a circuit node that is disconnected due to an open via is determined by several circuit parameters. As the feature size of VLSI circuits decreases, precise knowledge of the values of circuit parameters may be difficult, if not impossible, to obtain. Thus, it is important to develop methods to generate tests to detect opens that do not require accurate knowledge of circuit parameters. We propose new classes of tests to detect via opens with voltage based (logic) tests that are effective even with imprecise knowledge of circuit parameters. The proposed tests to detect an open via are constituted as a pair of constrained stuck-at fault tests for the circuit node affected by the open defect. One class of proposed tests called circuit parameter independent tests detect via opens even in the case of complete lack of knowledge of the circuit parameters. Experimental results demonstrate that high coverage of open vias can be obtained using the proposed constrained tests.
Permeability and Anticataract Effects of a Topical Ocular Drug Delivery System of Disulfiram
Authors: Siling Wang, Tongying Jang, Zhanyou Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Immortalized Human Corneal Epithelial Cells (HCECs) were cultured in vitro. Cells were observed under phase-contrast microscope and the integrity of cells monolayer was determined by transepithelia electrical resistance (TEER). A permeability of Diethyldithiocarbamate (DDC) through a HCECs monolayer was compared with that of DDC through an excised rabbit cornea. The permeability coefficients of DDC through a HCECs monolayer and a excised rabbit cornea were (29.5±4.8)×10-6cm·s-1 and (34.7±5.2)×10-6 cm·s-1 respectively. The result demonstrates that the permeability of DDC through in vitro cornea may be predicted using HCECs monolayer. In vivo trans-corneal transit of DDC from DSF eye drops was performed. Eye drops with HPMC has 2.8-fold greater for area under the curve (AUC) than eye drops without HPMC, which was attributed to the complex formation of DSF/HPβCD inclusion with HPMC. The lenses opacity was monitored using a slit lamp and results show DSF eye drops can effectively prevent the cataracts development.
Variants of the Hajnal-Szemer&eacute;di Theorem
Authors: Eldar Fischer
Venue: Journal of Graph Theory (1999)

The Hajnal-Szemer&eacute;di Theorem [Hajnal & Szemer&eacute;di, Colloq Math Soc J Bolyai, 1970] states that a graph with hk vertices and minimum degree at least (h - 1)k contains k vertex disjoint copies of Kh. Its proof is not algorithmic. Here, we present an algorithm that, for a fixed h, finds in such a graph k - C(h) vertex disjoint copies of Kh in polynomial time in k, C(h) being a constant depending on h only. The proof suggests a variant of the theorem for h-partite graphs, which is conjectured here and proven in a slightly weaker form in some special cases. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 275&ndash;282, 1999 This article forms part of a Ph. D. thesis written by the author under the supervision of Prof. N. Alon.
Activity-Based Computing
Authors: Giovanna Di Marzo Serugendo, Alfredo A. Villalba Castro, Dimitri Konstantas, Liu Liang, Duan Zheng-yu, Thyagaraju G.S., Umakanth P. Kulkarni, Anil R. Yardi, Gonzalo Huerta Cánepa, Angel Jiménez Molina, In-Young Ko, Dongman Lee, Jaewook Jung, Youngjae Kim, Minsoo Hahn, Tatsuya Yamazaki, Tetsuo Toyomura, Takashi Matsuyama, D. B. Kulkarni
Venue: IEEE Pervasive Computing (2008)

This month's Works in Progress department features six projects related to activity-based computing—a hovering information service for mobile devices, a method for analyzing spatio-temporal data to learn activity patterns, a conflict-resolution method for context-aware applications, pervasive middleware for a mobile environment, a novel sensor network for controlling power consumption, and a system to help end users visually design context-aware activity-based ubiquitous applications. This is part of a special issue on activity-based computing.
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
Authors: Cristina Bazgan, Zsolt Tuza
Venue: Journal of Discrete Algorithms (2008)

The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is @Q(n^3^.^5logn); but the best combinatorial algorithms have approximation ratio 4/5 only, achieved in O(n^2) time [J.A. Bondy, S.C. Locke, J. Graph Theory 10 (1986) 477-504; E. Halperin, et al., J. Algorithms 53 (2004) 169-185]. Here we present an improved combinatorial approximation, which is a 5/6-approximation algorithm that runs in O(n^2) time, perhaps improvable even to O(n). Our main tool is a new type of vertex decomposition for graphs of maximum degree 3.
Static Validation of Licence Conformance Policies
Authors: Rene Rydhof Hansen, Flemming Nielson, Hanne Riis Nielson, Christian W. Probst
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Policy conformance is a security property gaining importance due to commercial interest like Digital Rights Management. It is well known that static analysis can be used to validate a number of more classical security policies, such as discretionary and mandatory access control policies, as well as communication protocols using symmetric and asymmetric cryptography. In this work we show how to develop a Flow Logic for validating the conformance of client software with respect to a licence conformance policy. Our approach is sufficiently flexible that it extends to fully open systems that can admit new services on the fly.
Assessment of process improvement from organizational change
Authors: Sangjae Lee, Hyunchul Ahn
Venue: Information and Management (2008)

In order to enhance their performance, many organizations have initiated change projects. However, management is reluctant to initiate them due to their enterprise-wide impact and costs that are higher than those of traditional system development projects. Thus, there is a need to assess the value of the redesigned process of a successfully implemented organizational change projects. The purpose of this study was therefore to assess process improvement from organizational change in the areas of resource utilization and allocation and cycle time and cost reduction. The candidate process and design alternatives were identified from organizational requirements analysis. The variables and their relations were defined to perform task activity analysis, bottleneck analysis, cycle cost analysis, and resource utilization analysis. A case study of a manufacturing company indicated that the assessment method was a promising approach for identifying alternative processes that leads to better organizational performance.
A Conversation with Erik Meijer and Jose Blakeley
Authors: Terry Coatta
Venue: Queue (2008)

In any discussion about ORM (object-relational mapping), Microsoft's approach is inevitably a part of the conversation. With LINQ (language-integrated query) and the Entity Framework, Microsoft divided its traditional ORM technology into two parts: one part that handles querying (LINQ) and one part that handles mapping (Entity Framework). To understand more about these technologies and why Microsoft took this approach, we invited two Microsoft engineers closely involved with their development, Erik Meijer and Jos&eacute; Blakeley, to speak with Queue editorial board member Terry Coatta.
Multitrack video editor roundup
Authors: Dan Sawyer
Venue: Linux Journal (2008)

Video editing in Linux continues to improve.
Optimizing requirements decisions with keys
Authors: Omid Jalali, Tim Menzies, Martin Feather
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

Recent work with NASA's Jet Propulsion Laboratory has allowed for external access to five of JPL's real-world requirements models, anonymized to conceal proprietary information, but retaining their computational nature. Experimentation with these models, reported herein, demonstrates a dramatic speedup in the computations performed on them. These models have a well defined goal: select mitigations that retire risks which, in turn, increases the number of attainable requirements. Such a non-linear optimization is a well-studied problem. However identification of not only (a)~the optimal solution(s) but also (b)~the key factors leading to them is less well studied. Our technique, called KEYS, shows a rapid way of simultaneously identifying the solutions and their key factors. KEYS improves on prior work by several orders of magnitude. Prior experiments with simulated annealing or treatment learning took tens of minutes to hours to terminate. KEYS runs much faster than that; e.g for one model, KEYS ran 13,000 times faster than treatment learning (40 minutes versus 0.18 seconds). Processing these JPL models is a non-linear optimization problem: the fewest mitigations must be selected while achieving the most requirements. Non-linear optimization is a well studied problem. With this paper, we challenge other members of the PROMISE community to improve on our results with other techniques.
When Timing Matters: Enabling Time Accurate and Scalable Simulation of Sensor Network Applications
Authors: Olaf Landsiedel, Hamad Alizai, Klaus Wehrle
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

The rising complexity of data processing algorithms in sensor networks combined with their severely limited computing power necessitates a in-depth understanding of their temporal behavior. However, today only cycle accurate emulation and test-beds provide a detailed and accurate insight into the temporal behavior of sensor networks.In this paper we introduce fine grained, automated instrumentation of simulation models with cycle counts derived from sensor nodes and application binaries to provide detailed timing information. The presented approach bridges the gap between scalable but abstracting simulation and cycle accurate emulation for sensor network evaluation.By mapping device-specific code with simulation models, we can derive the time and duration a certain code line takes to get executed on a sensor node. Hence, eliminating the need to use expensive instruction-level emulators with limited speed and restricted scalability. Furthermore, the proposed design is not bound to a specific hardware platform, a major advantage compared to existing emulators. Our evaluation shows that the proposed technique achieves a timing accuracy of 99% compared to emulation while adding only a small overhead. Concluding, it combines essential properties like accuracy, speed and scalability on a single simulation platform.
Dynamic classification explorer for music digital libraries
Authors: J. Stephen Downie, Kris West, Xiao Hu
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper outlines a dynamic classification explorer for music digital library users and researchers. System provides multiple simultaneous classification visualizations and synchronized audio.
Agile Release Planning: Dealing with Uncertainty in Development Time and Business Value
Authors: Kevin Logue, Kevin McDaid
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Release planning is a critical activity in the software development process. The creation of a clear and realistic plan is extremely difficult, as key factors such as time and cost to develop chosen functionality and the likely return are subject to a high level of uncertainty. As such the management decision as to which stories to develop and which to ignore can be an extremely difficult one requiring an expert balancing of competing benefits and risks. This paper proposes a relatively simple statistical methodology that allows for the uncertainty in story size, value and project velocity. In so doing it provides key stakeholders with the opportunity to manage uncertainty in the planning of future releases. The technique is lightweight in nature and consistent with existing agile planning practices.
Distributed reactive systems are hard to synthesize
Authors: A. Pneuli, R. Rosner
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The problem of synthesizing a finite-state distributed reactive system is considered. Given a distributed architecture A, which comprises several processors P/sub 1/, . . ., P/sub k/ and their interconnection scheme, and a propositional temporal specification phi , a solution to the synthesis problem consists of finite-state programs Pi /sub 1/, . . ., Pi /sub k/ (one for each processor), whose joint (synchronous) behavior maintains phi against all possible inputs from the environment. Such a solution is referred to as the realization of the specification phi over the architecture A. Specifically, it is shown that the problem of realizing a given propositional specification over a given architecture is undecidable, and it is nonelementarily decidable for the very restricted class of hierarchical architectures. An extensive characterization of architecture classes for which the realizability problem is elementarily decidable and of classes for which it is undecidable is given.
Fingerprint Watermarking for H.264 Streaming Media
Authors: Sooyeun Jung, Dongeun Lee, Seongwon Lee, Joonki Paik
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In this paper we propose a method that identifies users at H.264 streaming using watermarking with fingerprints. The watermark can efficiently reduce the potential danger of forgery or alteration. Especially a biometric watermark has various advantages. Among entire biometric characteristics, the fingerprint is the most convenient and economical. In this paper we propose a novel fingerprint-based watermarking technique that can survive under very low bit-rate compression. The proposed algorithm consists of enhancement of a fingerprint image, watermark insertion using discrete wavelet transform. In this paper we also analyze H.264 compression pattern and its effects on watermarking. After restoring the damaged watermark sequence using various filters, the algorithm extracts the embedded watermark. The proposed algorithm can achieve robust watermark extraction against H.264 compressed videos.