ppxscal/embedding_network huggingface dataset:
Ultralow-Power Reconfigurable Computing with Complementary Nano-Electromechanical Carbon Nanotube Switches
Authors: S. Bhunia, M. Tabib-Azar, D. Saab
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In recent years, several alternative devices have been proposed to deal with inherent limitation of conventional CMOS devices in terms of scalability at nanometer scale geometry. The fabrication and integration cost of these devices, however, have been prohibitive and/or the devices do not allow smooth transition from the conventional design paradigm. To address some of these limitations, we have developed a new family of devices called "complementary nano electro-mechanical switches" (CNEMS) using carbon nanotubes as active switching/latching elements. The basic structure of these devices consists of three coplanar carbon nanotubes arranged so that the central nanotube can touch the two side carbon nanotubes upon application of a voltage pulse between them. Owing to the unique properties of carbon nanotubes, these devices have very low leakage current, low operation voltages, and have built-in energy storage to reduce computation power, resulting in very low overall power dissipation. CNEMS have stable on-off state and latching mechanism for non-volatile memory-mode operation. Besides, the devices can be readily integrated in the same substrate as CMOS transistors with high integration densities - thus, allowing easy manufacturability and hybridization with conventional CMOS devices. In this paper, we present the properties of these devices and based on our analysis, we propose a reconfigurable computation framework using these devices. For the first time, we demonstrate that these devices are promising in dynamically reconfigurable instant-on system development with about 25times lower power dissipation.
Design and Evaluation of a Legal Information Flow (LIF) Scheduler in a Role-based Access Control Model
Authors: Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The role-based access control model is widely used to keep information systems secure. Here, a subject s is allowed to issue a method op to an object o only if an access right \left\langle {o,op} \right\rangleis included in the roles granted to the subject s. Even if every access request is authorized in the roles, illegal information flow might occur as well known confinement problem. A legal information flow relation (R_1 \underline \prec^I R_2) among a pair of role families R_1 and R_2 shows that no illegal information flow occur if a transaction T_1 with a role family R_1 is performed prior to another transaction T_2 with R_2. In addition, a significantly precedent relation R_1 \underline\prec^S R_2 implies that a role family R_2 is more significant than R_1. We discuss a legal information flow (LIF) scheduler to synchronize transactions so as to prevent illegal information flow and how to serialize conflicting methods from multiple transactions in terms of significancy and information flow relation of roles families. We evaluate the LIF scheduler in terms of how much illegal information flow can be prevented.
Identity-Based Cryptography for Grid
Authors: Hongwei Li, Shixin Sun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In the grid security infrastructure (GSI), the authentication is based on traditional public key infrastructure (PKI). Grid user is in a heavily loaded point both in computation and in communication. This results in a limit for the user on the number of resource contributing sites it can use. Being certificate-free and non-interactive, identity-based cryptography (IBC) aligns well with demands of grid computing. In this paper, we first propose the identity-based architecture for grid(IBAG). Unlike the former work, IBAG is absolutely certificate-free. In addition to this, the identity-based encryption and signature schemes for IBAG are presented. Based on the encryption and signature schemes, the identity-based authentication protocol is proposed. Compared with the SAP (SSL Authentication Protocol) in the GSI, the protocol achieves better performance, specially the more lightweight user side. This contributes to the larger grid scalability.
Proceedings of the 2007 international ACM conference on Supporting group work
Venue: Conference on Supporting Group Work (2007)

We are pleased to host Group 2007, a conference that combines world-class research contributions with a beautiful conference location. Group 2007 is part of a series of bi-annual high-impact conferences on computer-based systems that have an impact on groups, organizations, and social networks. For the third time, the conference is being held on beautiful Sanibel Island, on the southwest coast of Florida. Group 2007 will foster a discourse on collaborative technology that bridges the fields of Computer-Supported Cooperative Work (CSCW) and Information Systems (IS). Group 2007 brings together researchers and practitioners from different areas working on the development, introduction, management, deployment, and analysis of computer-based collaborative systems. In these proceedings you will find contributions from academia and industry, including 38 papers (full-length contributions) and 9 notes (papers with smaller yet equally innovative contributions) selected from a record number of submissions (132 papers / 25 notes). This year's program will feature topics including theories of cooperative work and analysis of complex work settings, general questions of interactions in groups for working and learning, awareness and sharing support, technical issues, as well as social computing including social tagging and wikis. Beyond papers and notes, we are excited to host the first ever Doctoral Consortium at Group, sponsored by NSF and Microsoft Research. Thirteen PhD students from five different countries have been selected to participate in a full-day workshop with leading experts in the field. Continuing from previous years, Group 2007 is pleased to also offer workshops, posters, and an opening plenary, not to mention lots of fun in the sun.
Job-attention Replica Replacement Strategy
Authors: Ai Lihua, Luo Siwei
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Grid computing is increasingly being viewed as the next phase of distributed computing. In this paper we propose a new replica replacement strategy, called JARRS (shorts for Job-Attention Replica Replacement Strategy), which applies for replica management in data grids. A novel interpretation of locality appropriate for grid is presented. It is the grid locality that lays foundation of replica replacement strategy. A new approach, file forward-looking, is suggested. JARRS uses file forward-looking and references to recently accessed files to make decision. Experiments show that JARRS has a better efficiency and robust property for different file access patterns than others.
Answering xpath queries over networks by sending minimal views
Authors: Keishi Tajima, Yoshiki Fukui
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may appear in more than one answer set, and some elements in some answer sets may be subelements of other elements in other (or the same) answer sets. Even when a client submits a single query, the answer can be self-redundant because some elements may be subelements of other elements in that answer. Therefore, sending those answers as they are is not optimal with respect to communication costs. In this paper, we propose a method of minimizing communication costs in XPath processing over networks. Given a single or a set of queries, we compute a minimal-size view set that can answer all the original queries. The database sends this view set to the client, and the client produces answers from it. We show algorithms for computing such a minimal view set for given queries. This view set is optimal; it only includes elements that appear in some of the final answers, and each element appears only once.
Probabilistic ranking of database query results
Authors: Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, Gerhard Weikum
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval for structured data. Our proposed solution is domain independent. It leverages data and workload statistics and correlations. Our ranking functions can be further customized for different applications. We present results of preliminary experiments which demonstrate the efficiency as well as the quality of our ranking system.
Measurement Method for Micro-cavity Based on Super-resolution Restoration
Authors: Cui Jiwen, Tan Jiubin, Shi Qian
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

One effective measurement method for micro-cavity is optical fiber micro-force contact measure- ement method, but the measurement precision descends because of collected blur images caused by many factors. In the paper, a method used in micro-cavity measurement based on maximum a posterior (MAP) and projection onto convex set (POCS) hybrid processing is proposed. The hybrid method dual-purposes the merit of MAP converg- ence and POCS edge maintenance ability, adds one convex set for every part of the image under the terms of the whole image optimum. What's more, the method can reduce the noise's effect, insure the uniqueness for optimum image, and maintain the edge information. The experiment shows that the method can be used in micro-cavity measurement, and the uncertainty of location can be improved three folds.
Research issues in software fault categorization
Authors: Jan Ploski, Matthias Rohr, Peter Schwenkenberg, Wilhelm Hasselbring
Venue: ACM SIGSOFT Software Engineering Notes (2007)

Software faults are a major threat for the dependability of software systems. When we intend to study the impact of software faults on software behavior, examine the quality of fault tolerance mechanisms, or evaluate diagnostic techniques, the issue of distinguishing fault categories and their frequency distribution arises immediately. This article surveys the literature that provides quantitative data on categories of software faults and discusses the applicability of these software fault category distributions to fault injection case studies.
A hybrid query scheme to speed up queries in unstructured peer-to-peer networks
Authors: Zhan Zhang, Yong Tang, Shigang Chen, Ying Jian
Venue: Advances in Multimedia (2007)

Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate resources. However, existing query schemes, for example, flooding, random walks, and interest-based shortcut suffer various problems in reducing communication overhead and in shortening response time. In this paper, we study the possible problems in the existing approaches and propose a new hybrid query scheme, which mixes inter-cluster queries and intracluster queries. Specifically, the proposed scheme works by efficiently locating the clusters, sharing similar interests with intercluster queries, and then exhaustively searching the nodes in the found clusters with intracluster queries. To facilitate the scheme, we propose a clustering algorithm to cluster nodes that share similar interests, and a labeling algorithm to explicitly capture the clusters in the underlying overlays. As demonstrated by extensive simulations, our new query scheme can improve the system performance significantly by achieving a better tradeoff among communication overhead, response time, and ability to locate more resources.
Development of Aircraft Conceptual Design Optimization Software
Authors: Daniel Neufeld, Joon Chung
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

This paper describes the development of computer software designed to assist in the process of conceptual aircraft design. A Multi-Objective Genetic Algorithm (MOGA) optimizer and an aircraft performance simulation package was developed and integrated with an aircraft component database to produce useful suggestions to aircraft designers during the conceptual design phase. The results include the conceptual design of two types of aircraft; a Very Light Jet (VLJ) and an Unmanned Aerial Vehicle (UAV).
Everything but the kitchen sink
Authors: Grant Martin
Venue: IEEE Design Test (2007)

This is a review of Integrated System-Level Modeling of Network-on-Chip Enabled Multi-processor Platforms (by Tim Kogel, Rainer Leupers, and Heinrich Meyr).This book offers an education in the wide range of areas involved in embedded-systems design, as well as a brief exploration of solutions on the horizon. It should resonate with students, researchers, and practical designers interested in the state of electronic systems-level (ESL) design in 2007.
A genetic approach for random testing of database systems
Authors: Hardik Bati, Leo Giakoumakis, Steve Herbert, Aleksandras Surna
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreover, this space is continuously increasing in size as the feature set of modern DBMS systems expands with every product release. To tackle these problems, random query generator tools have been used to create large numbers of test cases. While such test case generators enable the creation of complex and syntactically correct SQL queries, they do not guarantee that the queries produced return results or exercise desired DBMS components. Very often the generated queries contain logical contradictions, which cause "short-circuits" at the query optimization layer, failing to exercise the lower layers of the database engine (query optimization, query execution, access methods, etc.) In this paper we present a random test case generation technique, which provides solutions to the above problems. Our technique utilizes execution feedback, obtained from the DBMS under test, in order to guide the test generation process toward specific DBMS subcomponents and rarely exercised code paths. Test cases are created incrementally using a genetic approach, which synthesizes query characteristics that are of interest for the purposes of test coverage. Our experiments indicate that our technique can outperform other methods of random testing in terms of efficiency and code coverage. We also provide experimental results which show that the use of execution feedback improves code coverage of specific DBMS components. Finally, we share our experiences gained from using this testing approach during the development cycles of Microsoft SQL Server.
Swing phase estimation in paralyzed persons walking
Authors: Imre Cikajlo
Venue: Technology and Health Care (2002)

In the paper we present the sensory system aimed for FES gait reeducation of incomplete spinal cord injured persons. The proposed system consists of four accelerometers, gyro and two goniometers placed along the shank of the paralyzed leg. The data assessed are input into mathematical algorithms estimating the swing phase quality. The estimation is based on swing phase detection and signal correlation and is used to determine the cognitive feedback signal. The feedback signal is delivered to the patient as an auditory signal. The preliminary measurements were performed in three healthy and two incomplete spinal cord injured persons with C6 and C6-7 lesion during treadmill walking. FES was manually triggered by a physiotherapist. The results have shown that the proposed multisensory system was successful in gait quality estimation. Therefore, the use of FES multisensory system and cognitive feedback could be an efficient rehabilitative approach in gait reeduction.
Facial Expression Recognition using KCCA with Combining Correlation Kernels and Kansei Information
Authors: Yo Horikawa
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Kernel canonical correlation analysis (kCCA) with combining correlation kernels of multiple-orders and Kansei information is applied to facial expression recognition. Any explicit feature extraction is done and spatial correlation features of image data are implicitly incorporated in the correlation kernels. Further, Kansei information is included as the second feature in kCCA. Classification experiments with JAFFE database show that, although the use of Kansei information in itself gives lower classification performance than class indicators optimal for classification tasks, combining Kansei information with them makes the classification performance higher than the only use of the indicators.
Predicting Query Duplication with Box-Jenkins Models and Its Applications
Authors: Xinyao Hu, Shicong Meng, Cong Shi, Dingyi Han, Yong Yu
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Many previous works of Peer-to-Peer traffic characterization and modeling focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper characterizes query traffic by using automatic time series analysis to evaluate different linear models(Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction. To show that these characteristics have a wide range of potential applications, we propose two enhancement to existing search results caching and load balancing algorithms. Our simulation study shows that our methodology works quite well in both scenarios in terms of efficiency and effectiveness. The main contribution of this paper lies in: (1) proposing new measurement techniques on Gnutella, (2) characterizing and modeling peer-to-peer query traffic with Box-Jenkins Models, (3) presenting a general enhancement to existing performance optimization algorithm in P2P systems.
Aspects of Software Quality Assurance in Open Source Software Projects: Two Case Studies from Apache Project
Authors: Dindin Wahyudin, Alexander Schatten, Dietmar Winkler, Stefan Biffl
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Open source software (OSS) solutions provide missioncritical services to industry and government organizations. However, empirical studies on OSS development practices raise concerns on risky practices such as unclear requirement elicitation, ad hoc development process, little attention to quality assurance (QA) and documentation, and poor project management. Event then the ability to produce high quality products in such an environment may seem surprising and thus warrants an investigation on effective QA mechanism in OSS projects. This paper provides a preliminary exploration to improve our understanding of software quality practices in different types of OSS projects. We propose a framework of QA in an OSS project, elicit OSS stakeholder value propositions for QA, and derive performance indicators. For an initial empirical evaluation we applied these indicators to 5 releases of 2 large Apache projects (Tomcat and MyFaces) to analyze the extent to which QA aspects are commonly performed during development process.
A Nonparametric Statistical Approach to Clustering via Mode Identification
Authors: Jia Li, Surajit Ray, Bruce G. Lindsay
Venue: The Journal of Machine Learning Research (2007)

A new clustering approach based on mode identification is developed by applying new optimization techniques to a nonparametric density estimator. A cluster is formed by those sample points that ascend to the same local maximum (mode) of the density function. The path from a point to its associated mode is efficiently solved by an EM-style algorithm, namely, the Modal EM (MEM). This method is then extended for hierarchical clustering by recursively locating modes of kernel density estimators with increasing bandwidths. Without model fitting, the mode-based clustering yields a density description for every cluster, a major advantage of mixture-model-based clustering. Moreover, it ensures that every cluster corresponds to a bump of the density. The issue of diagnosing clustering results is also investigated. Specifically, a pairwise separability measure for clusters is defined using the ridgeline between the density bumps of two clusters. The ridgeline is solved for by the Ridgeline EM (REM) algorithm, an extension of MEM. Based upon this new measure, a cluster merging procedure is created to enforce strong separation. Experiments on simulated and real data demonstrate that the mode-based clustering approach tends to combine the strengths of linkage and mixture-model-based clustering. In addition, the approach is robust in high dimensions and when clusters deviate substantially from Gaussian distributions. Both of these cases pose difficulty for parametric mixture modeling. A C package on the new algorithms is developed for public access at http://www.stat.psu.edu/∼jiali/hmac.
An Approximate Analytical Method for General Queueing Networks
Authors: R. A. Marie
Venue: IEEE Transactions on Software Engineering (1979)

In this paper, we present an approximate solution for the asymptotic behavior of relatively general queueing networks. In the particular case of networks with general service time distributions (i.e., fixed routing matrix, one or many servers per station, FIFO discipline), the application of the method gives relatively accurate results in a very short time. The approximate stationary state probabilities are identified with the solution of a nonlinear system. The proposed method is applicable to a larger class of queueing networks (dependent routing matrix, stations with fimite capacity, etc.). In this case, the structure of the network studied must satisfy certain decomposability conditions.