ppxscal/embedding_network huggingface dataset:
Using web metrics to analyze digital libraries
Authors: Michael Khoo, Joe Pagano, Anne L. Washington, Mimi Recker, Bart Palmer, Robert A. Donahue
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper discusses the use of web metrics tools at four digital libraries, the Instructional Architect, the Library of Congress, the National Science Digital Library, and WGBH Teachers' Domain. We describe some of the issues involved in using web metrics to report on ongoing web site performance. We also describe how web metrics can be used for focused data mining, using session length metrics as our example; and here, we recommend that session length metrics, which were developed to track e-commerce, need to be carefully considered when they are applied in non-e-commerce settings, such as digital libraries. We conclude by discussing some of the current limitations and possibilities of using web metrics to analyze and evaluate digital library use and impact.
Bio-Inspired Microsystem for Robust Genetic Assay Recognition
Authors: Jaw-Chyng Lue, Wai-Chi Fang
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

A compact integrated system-on-chip (SoC) architecture solution for robust, real-time, and on-site genetic analysis has been proposed. This microsystem solution is noise-tolerable and suitable for analyzing the weak fluorescence patterns from a PCR prepared dual-labeled DNA microchip assay. In the architecture, a preceding differential logarithm stage is designed for effectively computing the logarithm of the normalized input fluorescence signals. A posterior VLSI artificial neural network (ANN) processor chip is used for analyzing the processed signals from the differential logarithm stage. A single-channel logarithmic circuit was fabricated and characterized. A prototype ANN chip with winner-take-all (WTA) function was designed, fabricated, and tested. An ANN learning algorithm using a novel sigmoid-logarithmic transfer function based on the error backpropagation (BP) algorithm is proposed for robustly recognizing low intensity patterns. Our results show the trained new ANN can recognize low fluorescence patterns better than the ANN using the conventional sigmoid function.
Proceedings of the 2nd international workshop on Middleware for sensor networks
Venue: Middleware Conference (2007)

Following the successful First International Workshop on Middleware for Sensor Networks, which took place in Melbourne on November 28, 2006, this year's workshop will continue to work towards the definition of appropriate middleware architectures encompassing appropriate programming models for sensor networking while respecting the constraints that are unique to such systems. As the underlying hardware platforms increase in computational power and battery lifetime, standards for suitable wireless communication protocols such as 802.14.5 emerge, and convergence with the RFID world begins, sensor applications are emerging in a wide variety of different domains. This, in turn, is fuelling the need for standardised middleware to support the economic development and deployment of these applications into the future. This is the focus for the Second International Workshop on Middleware for Sensor Networks, to be held in Newport Beach in November 2007.
Analysis of the filling behaviour of trenches via air bubble tracking
Authors: S. Möllenbeck, N. Bogdanski, M. Wissen, H. -C. Scheer, J. Zajadacz, K. Zimmer
Venue: Microelectronic Engineering (2008)

Imprint of thin PDMS layers with undercut trenches features a behaviour different from the one known from binary structures. In order to compare the filling behaviour of such geometries a moulding process with preheated masters was performed. Due to the temperature accelerated curing of the reactive mixture this method enabled the identification of different filling states by 'freezing' of an incomplete filling situation. The different filling states could be discerned by means of the final location of the 'frozen' air bubbles and the filling length of the trenches. It turned out that, in contrast to the behaviour of binary trenches, the filling of undercut trenches proceeds primarily in lateral direction along the trench. This behaviour could be understood by pinning of the contact line between liquid and solid at outer edges.
Inconsistency tolerance in P2P data integration: An epistemic logic approach
Authors: Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati
Venue: Information Systems (2008)

We study peer-to-peer (P2P) data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by means of mappings among the peer schemas, rather than through a unique global schema. We propose a multi-modal epistemic logical formalization based on the idea that each peer is conceived as a rational agent that exchanges knowledge/belief with other peers, thus nicely modeling the modular structure of the system. We then address the issue of dealing with possible inconsistencies, and distinguish between two types of inconsistencies, called local and P2P, respectively. We define a nonmonotonic extension of our logic that is able to reason on the beliefs of peers under both local and P2P inconsistency tolerance. Tolerance to local inconsistency essentially means that the presence of inconsistency within one peer does not affect the consistency of the whole system. Tolerance to P2P inconsistency means being able to resolve inconsistencies arising from the interaction between peers. We study query answering in the new nonmonotonic logic, with the main goal of establishing its decidability and its computational complexity. Indeed, we show that, under reasonable assumptions on peer schemas, query answering is decidable, and is coNP-complete with respect to data complexity, i.e., the size of the data stored at the peers.
Providing Security and Privacy in RFID Systems Using Triggered Hash Chains
Authors: Dirk Henrici, Paul Müller
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

RFID technology shall increase security, e.g. by helping to prevent counterfeiting. But the technology also causes privacy issues. In this paper, after highlighting goals and problems, an approach called "Triggered Hash Chains" is proposed to address the problems. The approach combines concepts of two very different, widely known RFID protocols, i.e. the "Hash-based ID variation" approach and the "Hash chain" approach. The resulting proposal joins the advantages of both protocols. The approach is evaluated using a variety of criteria that are relevant in practice.
Flexible task graphs: a unified restricted thread programming model for java
Authors: Joshua Auerbach, David F. Bacon, Rachid Guerraoui, Jesper Honig Spring, Jan Vitek
Venue: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems (2008)

The disadvantages of unconstrained shared-memory multi-threading in Java, especially with regard to latency and determinism in realtime systems, have given rise to a variety of language extensions that place restrictions on how threads allocate, share, and communicate memory, leading to order-of-magnitude reductions in latency and jitter. However, each model makes different trade-offs with respect to expressiveness, efficiency, enforcement, and latency, and no one model is best for all applications. In this paper we present Flexible Task Graphs (Flexotasks), a single system that allows different isolation policies and mechanisms to be combined in an orthogonal manner, subsuming four previously proposed models as well as making it possible to use new combinations best suited to the needs of particular applications. We evaluate our implementation on top of the IBM Web-Sphere Real Time Java virtual machine using both a microbenchmark and a 30 KLOC avionics collision detector. We show that Flexotasks are capable of executing periodic threads at 10 KHz with a standard deviation of 1.2μs and that it achieves significantly better performance than RTSJ's scoped memory constructs while remaining impervious to interference from global garbage collection.
Thermal analysis of 8-T SRAM for nano-scaled technologies
Authors: Mesut Meterelliyoz, Jaydeep P. Kulkarni, Kaushik Roy
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Different sections of a cache memory may experience different temperature profiles depending on their proximity to other active logic units such as the execution unit. In this paper, we perform thermal analysis of cache memories under the influence of hot-spots. In particular, 8-T SRAM bitcell is chosen because of its robust functionality at nano-scaled technologies. Thermal map of entire 8-T SRAM cache is generated using hierarchical compact thermal models while solving the leakage and temperature self consistently. The impact of spatial temperature variations on 8T-SRAM parameters such as local bitline (LBL) sensing delay, noise robustness and bitcell stability are evaluated for 45nm/32nm/22nm bulk CMOS technology nodes. The effectiveness of variable keeper sizing on LBL sensing delay is analyzed. It is predicted that at 22nm node, the leakage induced temperature rise has severe effects on the 8-T SRAM characteristics.
Informatics olympiads: challenges in programming and algorithm design
Authors: Benjamin A. Burton
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

The International Olympiad in Informatics is a world-wide contest for high school students, with a strong focus on creativity and ingenuity in algorithm design. Here we describe the activities in Australia that support and complement this contest, including a range of programming competitions, more accessible pen-and-paper competitions, and other enrichment and training activities. Sample problems are included, along with suggestions for becoming involved.
Holographic Imaging
Authors: Stephen A. Benton, V. Michael,  Jr. Bove
Venue:  (2008)

This is a book about the three-dimensional imaging technique of holography. It covers the fundamental physical and optical principles of using diffraction to record and reconstruct images, human perception, and the history of holographic imaging with an approachable explanation of both basic and advanced holographic concepts. This authoritative work focuses on practical holography, including methods for white light illumination, full color holography, and holographic recording of natural scenes. The book promotes a hands-on approach to making holograms and an understanding of why and how they work.
Assessment of a multi-objective decision support system generated land use plan on forest fodder dependency in a Himalayan watershed
Authors: A. Raizada, Pradeep Dogra, B. L. Dhyani
Venue: Environmental Modelling Software (2008)

This paper analyzes the impact of integrated watershed land use plans generated through multi-objective optimization techniques in a Central Himalayan watershed on forest fodder dependency for meeting fodder requirements of livestock in the watershed. Alternate land use plans were developed for optimizing four objective functions - maximizing farm income, employment and nutritional security, and minimizing soil loss individually and simultaneously at the watershed level. The analysis was carried under two capital availability scenarios (restricted and unrestricted). The values of cultivated land utilization index (CLUI), crop diversification index (CDI), cropping intensity (CI) and forest dependency were estimated for each plan. Inferior plans were eliminated by applying the Law of Dominance rule. Out of the several optimal plans generated, the best land use plan was selected by employing MODSS techniques. Annual fodder production, sustainable animal population and changes in forest dependency were then computed. Optimal plans suggested significant changes in the number of buffaloes and cows in the watershed and in land use. Under a restricted capital availability scenario, forest dependency would change from existing surplus fodder availability to a dependency of 31.96% under the optimal plan, while under unrestricted capital scenario, forest dependency would be about 29.6%. This technique for land use planning to balance farmer and environmental needs has potential to prepare plans that will reduce current trends of increased forest degradation in the Himalayas. Watershed development and forest management plans in the central middle Himalayan region would therefore need to incorporate several measures to improve forest productivity, in situ moisture conservation and develop effective participatory forest management plans. The complexity of sustainable watershed development in a highly heterogeneous landscape requires that such optimal land use plans be developed for various identified micro-watersheds to meet location specific social and environmental requirements in the Himalayan region.
Exploratory multilevel hot spot analysis: Australian taxation office case study
Authors: Denny, Graham J. Williams, Peter Christen
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Population based real-life datasets often contain smaller clusters of unusual sub-populations. While these clusters, called 'hot spots', are small and sparse, they are usually of special interest to an analyst. In this paper we introduce a visual drill-down Self-Organizing Map (SOM)-based approach to explore such hot spots characteristics in real-life datasets. Iterative clustering algorithms (such as k-means) and SOM are not designed to show these small and sparse clusters in detail. The feasibility of our approach is demonstrated using a large real life dataset from the Australian Taxation Office.
Color space projection, feature fusion and concurrent neural modules for biometric image recognition
Authors: Victor-Emil Neagoe
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

A new technique of color face recognition is proposed. First processing stage consists of an optimum color conversion from the 3D RGB space into a 2D selected feature space using the old Karhunen-Loève transform (KLT). The resulted 2D color space is defined by the two color components (called C1 and C2), corresponding to the two largest eigenvalues of the RGB pixel covariance matrix. The second processing phase corresponds to Principal Component Analysis (PCA) for each color channel. Third stage corresponds to the feature fusion of the C1 and C2 PCA-components. Last processing stage is a multiple neural classifier consisting of a set of concurrent self-organizing modules. The proposed system is experimented for the Essex color face database containing 3520 color images of 151 subjects.
Distributed Computing: Principles, Algorithms, and Systems, 1 edition
Authors: Ajay D. Kshemkalyani, Mukesh Singhal
Venue:  (2008)

Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With state-of-the-art algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at www.cambridge.org/9780521876346.
Processing Mutual Nearest Neighbor Queries for Moving Object Trajectories
Authors: Yunjun Gao, Gencai Chen, Qing Li, Baihua Zheng, Chun Li
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Given a set of trajectories D, a query object (point or trajectory) q, and a query interval T, a mutual (i.e., symmetric) nearest neighbor (MNN) query over trajectories finds from D within T, the set of trajectories that are among the k1 nearest neighbors (NNs) of q, and meanwhile, have q as one of their k2 NNs. This type of queries considers proximity of q to the trajectories and the proximity of the trajectories to q, which is useful in many applications (e.g., decision making, data mining, pattern recognition, etc.). In this paper, we first formalize MNN query and identify some problem characteristics, and then develop two algorithms to process MNN queries efficiently. In particular, we thoroughly investigate two classes of queries, viz. MNNP and MNNT queries, which are defined w.r.t. stationary query points and moving query trajectories, respectively. Our techniques utilize the advantages of batch processing and reusing technology to reduce the I/O (i.e., number of node/page accesses) and CPU costs significantly. Extensive experiments demonstrate the efficiency and scalability of our proposed algorithms using both real and synthetic datasets.
Note making a K 4-free graph bipartite
Authors: Benny Sudakov
Venue: Combinatorica (2007)

We show that every K 4-free graph G with n vertices can be made bipartite by deleting at most n 2/9 edges. Moreover, the only extremal graph which requires deletion of that many edges is a complete 3-partite graph with parts of size n/3. This proves an old conjecture of P. Erd&#x0151;s.
Brief paper: Control design for a class of nonlinear continuous-time systems
Authors: Eugênio B. Castelan, Sophie Tarbouriech, Isabelle Queinnec
Venue: Automatica (Journal of IFAC) (2008)

This paper addresses the control design problem for a certain class of continuous-time nonlinear systems subject to actuator saturations. The system under consideration consists of a system with two nested nonlinearities of different type: saturation nonlinearity and cone-bounded nonlinearity. The control law investigated for stabilization purposes depends on both the state and the cone-bounded nonlinearity. Constructive conditions based on LMIs are then provided to ensure the regional or global stability of the system. Different points, like other approaches issued from the literature, are quickly discussed. An illustrative example allows to show the interest of the approach proposed.
Uncorrelated multilinear principal component analysis through successive variance maximization
Authors: Haiping Lu, Konstantinos N. Plataniotis, Anastasios N. Venetsanopoulos
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Tensorial data are frequently encountered in various machine learning tasks today and dimensionality reduction is one of their most important applications. This paper extends the classical principal component analysis (PCA) to its multilinear version by proposing a novel unsupervised dimensionality reduction algorithm for tensorial data, named as uncorrelated multilinear PCA (UMPCA). UMPCA seeks a tensor-to-vector projection that captures most of the variation in the original tensorial input while producing uncorrelated features through successive variance maximization. We evaluate the UMPCA on a second-order tensorial problem, face recognition, and the experimental results show its superiority, especially in low-dimensional spaces, through the comparison with three other PCA-based algorithms.
Business Software as a Facilitator for Business Process Excellence: Experiences from Case Studies
Authors: Petra Schubert
Venue: Electronic Markets (2007)

Software vendors claim in their marketing brochures that business processes and interoperability can be optimised through the use of business software. Business literature emphasizes the various benefits companies can gain from the targeted use of IT systems. Academic literature has, however, paid scant attention to the relationship between business process excellence and the use of ERP systems. Interoperability and business process excellence resulting from it are in the foreground of the following analysis of fourteen business software projects, examined within the eXperience framework in 2006. Hardly surprising was the insight that, in all the selected companies, central performance processes were identified as 'Excellence Processes'. Interoperability was, in this context, often crucial to the company's success. In some companies hybrid solutions were implemented, in which the relationship between human being and machine was optimized and a one-hundred-percent technology support was not necessarily pursued as an ideal.
Efficient scheduling discipline for hierarchical Diff-EDF
Authors: Moutaz Saleh, Zulaiha Ali Othman
Venue: International Journal of Network Management (2008)

Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet-scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First), which can meet the real-time needs of these applications while continuing to provide best-effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly.
Asymptotically tight bounds for computing with faulty arrays of processors
Authors: C. Kaklamanis
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The computational power of 2-D and 3-D processor arrays that contain a potentially large number of faults is analyzed. Both a random and a worst-case fault model are considered, and it is proved that in either scenario low-dimensional arrays are surprisingly fault tolerant. It is also shown how to route, sort, and perform systolic algorithms for problems such as matrix multiplication in optimal time on faulty arrays. In many cases, the running time is the same as if there were no faults in the array (up to constant factors). On the negative side, it is shown that any constant congestion embedding of an n*n fault-free array on an n*n array with Theta (n/sup 2/) random faults (or Theta (log n) worst-case faults) requires dilation Theta (log n). For 3-D arrays, knot theory is used to prove that the required dilation is Omega ( square root log n).